id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
8,143,014,292,609,018,000 | 基本使用
未匹配的标注
表格基本使用
简单示例
Dcat\Admin\Grid类用于生成基于数据模型的表格，先来个例子，数据库中有movies
CREATE TABLE `movies` (
`id` int(10) unsigned NOT NULL AUTO_INCREMENT,
`title` varchar(255) COLLATE utf8_unicode_ci NOT NULL,
`director` int(10) unsigned NOT NULL,
`describe` varchar(255) COLLATE utf8_unicode_ci NOT NULL,
`rate` tinyint unsigned NOT NULL,
`released` enum(0, 1),
`release_at` timestamp NOT NULL DEFAULT '0000-00-00 00:00:00',
`created_at` timestamp NOT NULL DEFAULT '0000-00-00 00:00:00',
`updated_at` timestamp NOT NULL DEFAULT '0000-00-00 00:00:00',
PRIMARY KEY (`id`)
) ENGINE=InnoDB DEFAULT CHARSET=utf8 COLLATE=utf8_unicode_ci;
对应的数据模型为App\Models\Movie，对应的数据仓库为App\Admin\Repositories\Movie，数据仓库代码如下：
{tip} 如果你的数据来自MySQL，则数据仓库不是必须的，你也可以直接使用Model
<?php
namespace App\Admin\Repositories;
use Dcat\Admin\Repositories\EloquentRepository;
use App\Models\Movie as MovieModel;
class Movie extends EloquentRepository
{
protected $eloquentClass = MovieModel::class;
/**
* 设置表格查询的字段，默认查询所有字段
*
* @return array
*/
public function getGridColumns(){
return ['id', 'title', 'director', 'rate', ...];
}
}
下面的代码可以生成表movies的数据表格：
<?php
namespace App\Admin\Controllers;
use App\Admin\Repositories\Movie;
use Dcat\Admin\Grid;
use \Dcat\Admin\Http\Controllers\AdminController;
class MovieController extends AdminController
{
protected function grid()
{
return Grid::make(new Movie(), function (Grid $grid) {
// 第一列显示id字段，并将这一列设置为可排序列
$grid->column('id', 'ID')->sortable();
// 第二列显示title字段，由于title字段名和Grid对象的title方法冲突，所以用Grid的column()方法代替
$grid->column('title');
// 第三列显示director字段，通过display($callback)方法设置这一列的显示内容为users表中对应的用户名
$grid->column('director')->display(function($userId) {
return User::find($userId)->name;
});
// 第四列显示为describe字段
$grid->column('describe');
// 第五列显示为rate字段
$grid->column('rate');
// 第六列显示released字段，通过display($callback)方法来格式化显示输出
$grid->column('released', '上映?')->display(function ($released) {
return $released ? '是' : '否';
});
// 下面为三个时间字段的列显示
$grid->column('release_at');
$grid->column('created_at');
$grid->column('updated_at');
// filter($callback)方法用来设置表格的简单搜索框
$grid->filter(function ($filter) {
// 设置created_at字段的范围查询
$filter->between('created_at', 'Created Time')->datetime();
});
});
}
}
表格显示模式
table_collapse
在这个版本开始，默认的表格布局将会采用 table_collapse 模式，效果如下
4bCfBdtvq5.png!large 35KJXfVXib.png!large
如果想要切换回旧版本的表格布局样式，可以在 app/Admin/bootstrap.php中加上
Grid::resolving(function (Grid $grid) {
$grid->tableCollapse(false);
});
边框模式
通过withBorder方式可以让表格显示边框
$grid->withBorder();
效果
禁用边框模式
$grid->withBorder(false);
基本使用方法
添加列 (column)
// 添加单列
$grid->column('username', '用户名');
// 添加多列
$grid->columns('email', 'username' ...);
修改查询条件 (where)
$grid->model()->where('id', '>', 100);
$grid->model()->orderBy('id', 'desc');
// 回收站数据
$grid->model()->onlyTrashed();
...
同时也可以使用以下方式
protected function grid()
{
return Grid::make(Model::with('...')->where(...), function (Grid $grid) {
...
});
}
其它查询方法可以参考eloquent的查询方法.
设置默认排序
$grid->model()->orderBy('id', 'desc');
这个功能也支持关联关系表字段排序，注意这里仅支持一对一以及一对多关联关系
$grid->model()->orderBy('profile.age');
修改显示输出 (display)
$grid->column('text')->display(function($text) {
return str_limit($text, 30, '...');
});
// 允许混合使用多个“display”方法
$grid->column('name')->display(function ($name) {
return "<b>$name</b>";
})->display(function ($name) {
return "<span class='label'>$name</span>";
});
$grid->column('email')->display(function ($email) {
return "mailto:$email";
});
// 可以直接写字符串
$grid->column('username')->display('...');
// 添加不存在的字段
$grid->column('column_not_in_table')->display(function () {
return 'blablabla....'.$this->id;
});
显示序号 (number)
通过number方法可以在表格中添加一列从1开始计算的行序号列
$grid->number();
设置名称 (setName)
当页面存在多个Grid表格时，需要给表格设置不同的名称，否则部分功能可能会出现冲突的情况
$grid->setName('name1');
获取当前行数据 (row)
display()方法接收的匿名函数绑定了当前行的数据对象，可以在里面调用当前行的其它字段数据
$grid->column('first_name');
$grid->column('last_name');
// 不存的字段列
$grid->column('full_name')->display(function () {
return $this->first_name.' '.$this->last_name;
});
设置工具栏按钮样式
工具栏按钮默认显示outline模式，效果如下
用法
$grid->toolsWithOutline();
// 禁止
$grid->toolsWithOutline(false);
效果
禁用outline后的效果
如果你希望某个按钮不使用outline模式，可以在按钮的class属性中加上disable-outline
$grid->tools('<a class="btn btn-primary disable-outline">测试按钮</a>');
设置创建按钮 (createButton)
此功能默认开启
// 禁用
$grid->disableCreateButton();
// 显示
$grid->showCreateButton();
开启弹窗创建表单
此功能默认不开启
$grid->enableDialogCreate();
// 设置弹窗宽高，默认值为 '700px', '670px'
$grid->setDialogFormDimensions('50%', '50%');
传递参数到按钮的URL
$grid->model()->setConstraints([
'key1' => 'v1',
'key2' => 'v2',
...
]);
修改创建以及更新按钮的路由 (setResource)
设置修改创建以及更新按钮的路由前缀
$grid->setResource('auth/users');
设置查询过滤器 (filter)
此功能默认开启
// 禁用
$grid->disableFilter();
// 显示
$grid->showFilter();
// 禁用过滤器按钮
$grid->disableFilterButton();
// 显示过滤器按钮
$grid->showFilterButton();
行选择器 (rowSelector)
// 禁用
$grid->disableRowSelector();
// 显示
$grid->showRowSelector();
设置选择中行的标题字段
设置选中后需要显示的字段，如不设置，默认取 nametitleusername中的一个。
$grid->column('full_name');
$grid->column('age');
...
$grid->rowSelector()->titleColumn('full_name');
设置选择中行的ID字段
设置选中后需要保存的字段，默认为 数据表主键(id) 字段
$grid->column('new_id');
...
$grid->rowSelector()->idColumn('new_id');
设置checkbox选择框颜色
默认 primary，支持：defaultprimarysuccessinfodangerpurpleinverse
$grid->rowSelector()->style('success');
点击当前行任意位置选中
此功能默认不开启。
$grid->rowSelector()->click();
设置选中行的背景颜色
use Dcat\Admin\Admin;
$grid->rowSelector()->background(Admin::color()->dark20());
设置默认选中行
$grid->rowSelector()->check(function ($row) {
return $row->state === 1; // 默认选中state为1的行
});
设置禁止选中行 (disable)
$grid->rowSelector()->disable(function ($row) {
return $row->state === 0; // state为0的行不可选中
});
设置行操作按钮 (actions)
// 禁用
$grid->disableActions();
// 显示
$grid->showActions();
// 禁用详情按钮
$grid->disableViewButton();
// 显示详情按钮
$grid->showViewButton();
// 禁用编辑按钮
$grid->disableEditButton();
// 显示编辑按钮
$grid->showEditButton();
// 禁用快捷编辑按钮
$grid->disableQuickEditButton();
// 显示快捷编辑按钮
$grid->showQuickEditButton();
// 设置弹窗宽高，默认值为 '700px', '670px'
$grid->setDialogFormDimensions('50%', '50%');
// 禁用删除按钮
$grid->disableDeleteButton();
// 显示删除按钮
$grid->showDeleteButton();
设置批量操作按钮 (batchActions)
// 禁用
$grid->disableBatchActions();
// 显示
$grid->showBatchActions();
// 禁用批量删除按钮
$grid->disableBatchDelete();
// 显示批量删除按钮
$grid->showBatchDelete();
批量操作设置下拉菜单分割线 (divider )
// 方式1
$grid->batchActions(function ($batch) {
$batch->add(...);
// 显示分割线
$batch->divider();
...
});
// 方式2
use Dcat\Admin\Grid\Tools\ActionDivider;
$grid->batchActions([
new Action1(),
...
new ActionDivider(),
...
]);
设置工具栏 (toolbar)
// 禁用
$grid->disableToolbar();
// 显示
$grid->showToolbar();
设置刷新按钮 (refresh)
// 禁用
$grid->disableRefreshButton();
// 显示
$grid->showRefreshButton();
设置分页功能 (paginate)
// 禁用
$grid->disablePagination();
// 显示
$grid->showPagination();
简化分页 (simplePaginate)
启用 simplePaginate 功能后会使用LaravelsimplePaginate功能进行分页，当数据量较大时可以大幅提升页面的响应速度，但需要注意的是，使用此功能后将不会查询数据表的总行数
// 启用
$grid->simplePaginate();
// 禁用
$grid->simplePaginate(false);
设置每页显示行数
// 默认为每页20条
$grid->paginate(15);
设置分页选择器选项 (perPages)
$grid->perPages([10, 20, 30, 40, 50]);
// 禁用分页选择器
$grid->disablePerPages();
设置表格样式 (addTableClass)
通过addTableClass可以给表格的table添加css样式
$grid->addTableClass(['class1', 'class2']);
设置表格文字居中 (table-text-center)
$grid->addTableClass(['table-text-center']);
显示横向滚动条 (scrollbarX)
显示表格横向滚动条，默认不显示
// 启用
$grid->scrollbarX();
// 禁用
$grid->scrollbarX(false);
设置表格外层容器
// 更改表格外层容器
$grid->wrap(function (Renderable $view) {
$tab = Tab::make();
$tab->add('示例', $view);
$tab->add('代码', $this->code(), true);
return $tab;
});
关联模型
参考表格关联关系
本文章首发在 LearnKu.com 网站上。
上一篇 下一篇
《L05 电商实战》
从零开发一个电商项目，功能包括电商后台、商品 & SKU 管理、购物车、订单管理、支付宝支付、微信支付、订单退款流程、优惠券等
《G01 Go 实战入门》
从零开始带你一步步开发一个 Go 博客项目，让你在最短的时间内学会使用 Go 进行编码。项目结构很大程度上参考了 Laravel。
贡献者：4
讨论数量: 11
发起讨论 只看当前版本
luxiaofeng
dcat admin 详情页如何做成选项卡的展示
4 个点赞 | 15 个回复 | 问答 | 课程版本 2.x
halweg
在form A的編輯页，提交后如和新增一条B的记录？
0 个点赞 | 7 个回复 | 问答 | 课程版本 2.x
luxiaofeng
dcat admin 表格怎么根据当前行数据的值隐藏或显示某个按钮
0 个点赞 | 4 个回复 | 问答 | 课程版本 2.x
蒙挚
Dcat Admin 新建和编辑怎么使用不同的页面和处理逻辑
0 个点赞 | 4 个回复 | 问答 | 课程版本 2.x
Judyhia
Dcat Admin部署后，JS组件未正常引入
0 个点赞 | 3 个回复 | 问答 | 课程版本 2.x
maxsky
为什么开发工具菜单在非 admin 用户下也能看见呢？
0 个点赞 | 1 个回复 | 问答 | 课程版本 2.x
Mutoulee
Dcat Admin 模型树depth字段疑问
0 个点赞 | 1 个回复 | 问答 | 课程版本 2.x
lezhl821125
Dcat2版本的代码生成器 在laravel 9的版本报错
0 个点赞 | 1 个回复 | 问答 | 课程版本 2.x
zhuameng
如果 MySQL 8 运行脚本出错，可以试试下面这个：
0 个点赞 | 0 个回复 | 分享 | 课程版本 2.x
esssd
小程序心跳
0 个点赞 | 0 个回复 | 代码速记 | 课程版本 2.x | {
"url": "https://learnku.com/docs/dcat-admin/2.x/basic-use/8089",
"source_domain": "learnku.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "232749",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KCVEOCGKFA4SIGECR5HKJO2T5CMGYWLY",
"WARC-Concurrent-To": "<urn:uuid:744f036c-1017-4f08-90f7-18bc517ccba9>",
"WARC-Date": "2024-06-12T22:39:12Z",
"WARC-IP-Address": "117.50.36.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QQNCAE6Y767T5U7LUOV7W5ZWRA26RLYQ",
"WARC-Record-ID": "<urn:uuid:12083a76-fab2-461b-9650-9fd02b600216>",
"WARC-Target-URI": "https://learnku.com/docs/dcat-admin/2.x/basic-use/8089",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f9f76e5d-4dd5-4dc2-91a9-6d34bb143dad>"
},
"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-181\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
5,
6,
13,
14,
21,
22,
27,
28,
76,
77,
101,
150,
207,
247,
307,
343,
368,
433,
498,
563,
584,
646,
647,
719,
720,
765,
766,
772,
773,
807,
808,
856,
892,
893,
932,
934,
984,
985,
993,
1019,
1027,
1048,
1056,
1094,
1151,
1157,
1159,
1160,
1183,
1184,
1190,
1191,
1224,
1225,
1259,
1280,
1330,
1331,
1377,
1379,
1409,
1415,
1478,
1516,
1567,
1568,
1645,
1681,
1682,
1760,
1827,
1877,
1893,
1894,
1926,
1965,
1966,
1994,
2029,
2030,
2092,
2169,
2215,
2231,
2232,
2261,
2302,
2343,
2384,
2385,
2432,
2479,
2518,
2594,
2610,
2622,
2628,
2630,
2631,
2638,
2639,
2654,
2655,
2698,
2699,
2741,
2742,
2791,
2792,
2832,
2865,
2869,
2870,
2875,
2876,
2900,
2901,
2922,
2923,
2926,
2927,
2934,
2935,
2961,
2962,
2969,
2970,
2983,
2984,
2992,
3026,
3027,
3035,
3076,
3077,
3092,
3093,
3132,
3133,
3172,
3173,
3182,
3213,
3214,
3218,
3219,
3231,
3232,
3258,
3260,
3338,
3350,
3358,
3360,
3361,
3386,
3387,
3394,
3395,
3434,
3435,
3472,
3473,
3513,
3514,
3531,
3532,
3581,
3621,
3625,
3626,
3649,
3699,
3727,
3759,
3806,
3810,
3811,
3863,
3891,
3895,
3896,
3908,
3951,
3952,
3964,
4024,
4062,
4066,
4067,
4081,
4082,
4114,
4115,
4132,
4133,
4148,
4149,
4194,
4195,
4220,
4221,
4235,
4236,
4284,
4285,
4314,
4342,
4343,
4353,
4403,
4454,
4458,
4459,
4469,
4470,
4494,
4495,
4498,
4499,
4526,
4527,
4533,
4565,
4566,
4569,
4570,
4584,
4585,
4639,
4640,
4709,
4710,
4732,
4733,
4741,
4742,
4748,
4778,
4784,
4811,
4812,
4821,
4822,
4831,
4832,
4861,
4862,
4894,
4940,
4941,
4953,
4954,
4987,
5007,
5027,
5035,
5039,
5040,
5068,
5069,
5087,
5088,
5122,
5123,
5140,
5141,
5149,
5150,
5156,
5180,
5186,
5207,
5208,
5219,
5249,
5260,
5287,
5288,
5307,
5308,
5314,
5343,
5349,
5375,
5376,
5388,
5389,
5434,
5435,
5463,
5485,
5486,
5490,
5491,
5539,
5540,
5552,
5553,
5583,
5584,
5609,
5610,
5614,
5615,
5657,
5658,
5674,
5675,
5734,
5735,
5775,
5776,
5788,
5789,
5799,
5800,
5831,
5832,
5843,
5844,
5866,
5867,
5927,
5928,
5936,
5937,
5983,
6030,
6034,
6035,
6053,
6054,
6102,
6149,
6153,
6154,
6172,
6173,
6179,
6204,
6210,
6232,
6233,
6243,
6271,
6281,
6306,
6307,
6317,
6345,
6355,
6380,
6381,
6393,
6426,
6438,
6468,
6469,
6501,
6547,
6548,
6549,
6559,
6589,
6599,
6626,
6627,
6651,
6652,
6658,
6688,
6694,
6721,
6722,
6734,
6763,
6775,
6801,
6802,
6827,
6828,
6835,
6875,
6897,
6898,
6911,
6934,
6935,
6943,
6947,
6948,
6955,
6996,
6997,
7019,
7038,
7046,
7071,
7079,
7083,
7084,
7100,
7101,
7107,
7132,
7138,
7160,
7161,
7178,
7179,
7185,
7216,
7222,
7250,
7251,
7269,
7270,
7276,
7304,
7310,
7335,
7336,
7358,
7359,
7459,
7460,
7466,
7491,
7492,
7498,
7528,
7529,
7538,
7539,
7551,
7572,
7573,
7594,
7595,
7634,
7635,
7646,
7672,
7673,
7696,
7697,
7731,
7732,
7776,
7777,
7806,
7807,
7852,
7853,
7874,
7875,
7891,
7892,
7898,
7919,
7920,
7926,
7952,
7953,
7962,
7963,
7976,
8018,
8042,
8043,
8071,
8113,
8114,
8131,
8135,
8136,
8141,
8142,
8151,
8152,
8176,
8177,
8185,
8196,
8260,
8274,
8340,
8346,
8355,
8367,
8368,
8369,
8380,
8405,
8436,
8443,
8470,
8500,
8511,
8545,
8575,
8578,
8609,
8639,
8647,
8671,
8701,
8708,
8736,
8766,
8775,
8799,
8829,
8841,
8871,
8901,
8910,
8938,
8968,
8974,
8980
],
"line_end_idx": [
5,
6,
13,
14,
21,
22,
27,
28,
76,
77,
101,
150,
207,
247,
307,
343,
368,
433,
498,
563,
584,
646,
647,
719,
720,
765,
766,
772,
773,
807,
808,
856,
892,
893,
932,
934,
984,
985,
993,
1019,
1027,
1048,
1056,
1094,
1151,
1157,
1159,
1160,
1183,
1184,
1190,
1191,
1224,
1225,
1259,
1280,
1330,
1331,
1377,
1379,
1409,
1415,
1478,
1516,
1567,
1568,
1645,
1681,
1682,
1760,
1827,
1877,
1893,
1894,
1926,
1965,
1966,
1994,
2029,
2030,
2092,
2169,
2215,
2231,
2232,
2261,
2302,
2343,
2384,
2385,
2432,
2479,
2518,
2594,
2610,
2622,
2628,
2630,
2631,
2638,
2639,
2654,
2655,
2698,
2699,
2741,
2742,
2791,
2792,
2832,
2865,
2869,
2870,
2875,
2876,
2900,
2901,
2922,
2923,
2926,
2927,
2934,
2935,
2961,
2962,
2969,
2970,
2983,
2984,
2992,
3026,
3027,
3035,
3076,
3077,
3092,
3093,
3132,
3133,
3172,
3173,
3182,
3213,
3214,
3218,
3219,
3231,
3232,
3258,
3260,
3338,
3350,
3358,
3360,
3361,
3386,
3387,
3394,
3395,
3434,
3435,
3472,
3473,
3513,
3514,
3531,
3532,
3581,
3621,
3625,
3626,
3649,
3699,
3727,
3759,
3806,
3810,
3811,
3863,
3891,
3895,
3896,
3908,
3951,
3952,
3964,
4024,
4062,
4066,
4067,
4081,
4082,
4114,
4115,
4132,
4133,
4148,
4149,
4194,
4195,
4220,
4221,
4235,
4236,
4284,
4285,
4314,
4342,
4343,
4353,
4403,
4454,
4458,
4459,
4469,
4470,
4494,
4495,
4498,
4499,
4526,
4527,
4533,
4565,
4566,
4569,
4570,
4584,
4585,
4639,
4640,
4709,
4710,
4732,
4733,
4741,
4742,
4748,
4778,
4784,
4811,
4812,
4821,
4822,
4831,
4832,
4861,
4862,
4894,
4940,
4941,
4953,
4954,
4987,
5007,
5027,
5035,
5039,
5040,
5068,
5069,
5087,
5088,
5122,
5123,
5140,
5141,
5149,
5150,
5156,
5180,
5186,
5207,
5208,
5219,
5249,
5260,
5287,
5288,
5307,
5308,
5314,
5343,
5349,
5375,
5376,
5388,
5389,
5434,
5435,
5463,
5485,
5486,
5490,
5491,
5539,
5540,
5552,
5553,
5583,
5584,
5609,
5610,
5614,
5615,
5657,
5658,
5674,
5675,
5734,
5735,
5775,
5776,
5788,
5789,
5799,
5800,
5831,
5832,
5843,
5844,
5866,
5867,
5927,
5928,
5936,
5937,
5983,
6030,
6034,
6035,
6053,
6054,
6102,
6149,
6153,
6154,
6172,
6173,
6179,
6204,
6210,
6232,
6233,
6243,
6271,
6281,
6306,
6307,
6317,
6345,
6355,
6380,
6381,
6393,
6426,
6438,
6468,
6469,
6501,
6547,
6548,
6549,
6559,
6589,
6599,
6626,
6627,
6651,
6652,
6658,
6688,
6694,
6721,
6722,
6734,
6763,
6775,
6801,
6802,
6827,
6828,
6835,
6875,
6897,
6898,
6911,
6934,
6935,
6943,
6947,
6948,
6955,
6996,
6997,
7019,
7038,
7046,
7071,
7079,
7083,
7084,
7100,
7101,
7107,
7132,
7138,
7160,
7161,
7178,
7179,
7185,
7216,
7222,
7250,
7251,
7269,
7270,
7276,
7304,
7310,
7335,
7336,
7358,
7359,
7459,
7460,
7466,
7491,
7492,
7498,
7528,
7529,
7538,
7539,
7551,
7572,
7573,
7594,
7595,
7634,
7635,
7646,
7672,
7673,
7696,
7697,
7731,
7732,
7776,
7777,
7806,
7807,
7852,
7853,
7874,
7875,
7891,
7892,
7898,
7919,
7920,
7926,
7952,
7953,
7962,
7963,
7976,
8018,
8042,
8043,
8071,
8113,
8114,
8131,
8135,
8136,
8141,
8142,
8151,
8152,
8176,
8177,
8185,
8196,
8260,
8274,
8340,
8346,
8355,
8367,
8368,
8369,
8380,
8405,
8436,
8443,
8470,
8500,
8511,
8545,
8575,
8578,
8609,
8639,
8647,
8671,
8701,
8708,
8736,
8766,
8775,
8799,
8829,
8841,
8871,
8901,
8910,
8938,
8968,
8974,
8980,
9011
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9011,
"ccnet_original_nlines": 522,
"rps_doc_curly_bracket": 0.004882920067757368,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.022090520709753036,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0210129301995039,
"rps_doc_frac_lines_end_with_ellipsis": 0.015296369791030884,
"rps_doc_frac_no_alph_words": 0.6519396305084229,
"rps_doc_frac_unique_words": 0.6902356743812561,
"rps_doc_mean_word_length": 10.178451538085938,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.008620689623057842,
"rps_doc_unigram_entropy": 5.711390018463135,
"rps_doc_word_count": 594,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.061032090336084366,
"rps_doc_frac_chars_dupe_6grams": 0.031591128557920456,
"rps_doc_frac_chars_dupe_7grams": 0.01323189027607441,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009923920035362244,
"rps_doc_frac_chars_top_3gram": 0.01190869975835085,
"rps_doc_frac_chars_top_4gram": 0.014555079862475395,
"rps_doc_books_importance": -835.0912475585938,
"rps_doc_books_importance_length_correction": -835.0912475585938,
"rps_doc_openwebtext_importance": -488.93634033203125,
"rps_doc_openwebtext_importance_length_correction": -488.93634033203125,
"rps_doc_wikipedia_importance": -320.8025207519531,
"rps_doc_wikipedia_importance_length_correction": -320.8025207519531
},
"fasttext": {
"dclm": 0.25371837615966797,
"english": 0.0711064264178276,
"fineweb_edu_approx": 1.485672950744629,
"eai_general_math": 0.014563440345227718,
"eai_open_web_math": 0.001731810043565929,
"eai_web_code": 0.8093873262405396
}
} | {
"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.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,751,678,460,092,268,000 |
Having problems with your EA - Electronic Arts The Sims Deluxe Edition for Windows ?
Sims and sims 2 on external hard drive?
\015 Hi everybodyI recently got a laptop. I always had the sims on the computer but now I ordered sims 2 and some expansion packs. I want to put them on the computer but I don't want to use up loads of memory. So I would like to save all sims and sims 2 onto an external hard drive. It seems possible because it allows you to change where it is saved. I have downloaded programs like itunes and picasa 3 etc onto it and all seems fine, they run off the laptop but use the external hard drives memory.Does anyone know if this is possible with sims and sims 2 and if so exactly how I should go about it? Do all the expansion packs need their own individual folder? Do I have one folder for the fist cd/dvd and a second for all the expansions? How should I do it? If anyone has any ideas I would love to hear them in as much detail as possible pleaseThanks a mil\015
Answers :
It works great, I had to do the same thing. All you have to do is save it to the external drive. yes all the programs and expansions need to be on the external drive.
\015\012
\015\012When it asks you if you want to put it on the C:/programs/simms as it always does, just change the "C" to what ever drive your external drive is. do this with each game.
\015\012
\015\012You will me living like a simm in no time. Let me know how you did..
Repair Help & Product Troubleshooting for EA - Electronic Arts The Sims Deluxe Edition for Windows
Tips for a great answer:
- Provide details, support with references or personal experience .
- If you need clarification, ask it in the comment box .
- It's 100% free, no registration required.
Suggested Questions/Answers :
Sims and sims 2 on external hard drive?
It works great, I had to do the same thing. All you have to do is save it to the external drive. yes all the programs and expansions need to be on the external drive.\015\012\015\012When it asks you if you want to put it on the C:/progra ... EA - Electronic Arts The Sims Deluxe Edition for Windows
I have a 5515 Acer Laptop. It was working Great. I installed an AT&T sim usb for internet. It said it was installed successfully and to restart the Laptop. I restarted laptop and now the keyboard is not responding and I cannot get passed from the user password screen. Can anyone Help Me?
Hi,\015\012theres a couple of options.\015\0121:) you could try using an external USB keyboard.\015\0122:) you could try inserting a system restore CD, into the CD/DVD drive. when prompted use the repair console, or roll-back to a p ... Acer PC Laptops
How to install new hard drive
Hi Mark,\015\012\015\012External drives have come a long way and run almost as fast as many\015\012internal drives. If your need for extra hard drive space is pretty\015\012much driven by the Microsoft Flight Simulator game, you could ge ... HP Compaq d530 PC Desktop
My LaCIe external hard drive will not open - I get a message saying that the disc is not ready and there may be a drawer open as though it is a DVD ROM - I have tried it on 3 diff computers and the message is the same
I am not really sure where to start here because I am a little confused\015\012about your setup here. It seems you made a great choice to keep Windows\015\012and your data on separate drives. Your primary hard drive is a really\015\012fast SATA Rapto ... LaCie PC Desktops
My windows explorer stops and restarts please help me to solve the same
It's possible that it's a hardware problem or your computer is infected by a computer virus. Does it restart when you see the windows XP logo or when you are in the desktop? or Does it restart before seeing the windows xp welcome screen? Since this i ... Acer Extensa 4620-6402 Notebook
Hard disk sir I have a vio(hitachi travelstar) USB hard disk model-hts541080g9at00 5400RPM,5V.01A ,80GB,ATA/IDE how can I formet it?
Before formatting the drive, be sure to back up any data from the external hard drive that you want to keep. If you want to make your external hard drive bootable, make sure the "File System" option on the "Format" screen matches y ... PC Desktops
How many hard frives can be installed
You can put as many drives as you can fit as long as you have the cables and connection. Usually 4 is the max in a computer, but you can by a SCSI IDE card and add even more. The biggest problem is to make sure that the jumpers are set to slave on ... Dell Dimension 4600 PC Desktop
How do I access my external hard drive on my lap
I think you should first set the parameters on the BIOS to boot on USB first then second to the internal hard drive. The lappy should have this capability first. And could support that storage space.But a word of advise. Since it is 180GB ... Compaq Presario M2000 Notebook
Operating System Not Found, Can't Use CD Drive
I'm afraid you have a hard disk problem, it has probably failed.If you have entered your BIOS and the hard disk has been set to auto (detect) and when you boot up and you press F1 to continue and get a message "Operating System not found" then ... PC Laptops
A message pops up saying that my d drive has low disk space. how can I add more memory to the d drive?
You can't add to the maximum capacity of a hard disk, but you can manipulate it in ways to make much better use of its space. First, do the normal things like deleting temporary internet files and all that, defragment your hard drive (I like MyDefra ... HP Pavilion dv6-1030us Notebook
Lap top screen
It's possible that it's a hardware problem, Since this is a laptop it may be hard for\015\012you to reseat some of the internal devices inside in your laptop so we\015\012could start isolating the issue from the hardware and to the software. ... Compaq Presario R3000Z Notebook
Playing movies from external hard drive
Hi rox09\015\012\015\012Well you can rip your DVD to any external drive using and third party DVD ripping software ,once you do that you will get a AVI,MPEG and any common fomats your DVD player supports\015\012\015\012\015\012Inord ... ASUS Eee PC 900 Notebook
Gateway MT3421 Laptop start-up Issues
Start by removing the battery completely, and plugging the power cord into the wall socket. If the power indicator light comes on at the converter on the cord, your power cord is fine. Then plug the power cord into the computer. If the computer star ... Gateway MT3422 RTL Notebook
External disk is not been detected - Toshiba Satellite M45-S351 Notebook
Check the BIOS setting, make sure the hard disk is set to Auto (detect) or change the settings to default settings (your BOS may not have this option) then save and reboot laptop.\015\012If the hard disk has not been detected and/or Unable to f ... Toshiba Satellite M45-S351 Notebook
Hard drive ST3160021A, error code HD521-2W
Hi,\015\012Your hard drive is failing. Back up your data immediately and replace the hard drive. Clean-install Windows.Click ... HP Compaq Presario SR1720NX (EL435AA) PC Desktop
Hello I am searching for a instalation disc because my external harddrive Hd-D1-U2 doesn't work on my laptop(vista). can you help me? Melvin
XP SP#, VISTA and win7 dont normally require drivers for external hard drives\015\012\015\012One or more of the hints below will probably sort out most USB problems with most USB portable / external hard drives and OTHER devices (though n ... HP Pavilion dv9000z Notebook
I have an acer 1000 running linux lite. I want to install windows xp via an LG external hard drive I have plugged the hard drive into the computer and inserted the hard drive set up disc but cannot figure out how to carry out the set up from the display that then appears showing the files on the disk. There is no guidance in the Acer application manual that comes with the computer as to how to do this. I also obviously need to be able to navigate my way through the set up for XP when I get t
Okay I if I understood it correctly You want to install windows XP from HARD DRIVE and not from a cd.To install Xp from a dos promtp (Eg. c:\\>) You will need to start dos first of all, with a boot diskette or a cd, linux won't do. ... Acer PC Desktops
Hp Pavilion a1220n -- Copy file errors when Installing windows
Maybe I can help;\015\012When I install a new hard drive I like to re-install the operating system (OS) as well. Unfortunatly this wipes out all your files. \015\012 Typically when files do not copy it's either because they're in use or ... HP Pavilion a1220n (A1220NED904AA) PC Desktop
System keeps freezing NO TASK MANGER OR POINTER OR KEYBOARD, also event viewer shows no sign
It could be that your Hard Drive is almost gone, or, that the system file is corrupt (but you would get a system error with this, pls advise if you do). In the case that your HDD is dying, I would recommend that you try and backup all your data asap ... Acer Aspire One PC Notebook
Upgrading the Acer Aspire 3050 80GB Hard Drive to something bigger??
Hey there gothicarcher, this is possible to do on your own. you will need to purchase an external drive case, that does exact copies of drives. You can also use this as an external drive when you are done. You could buy a kit for upgrading that also ... Acer Aspire 3050-1733 Notebook
SMART Failure Predicted on Hard Disk 4: Hitachi-(S1)-ToshibLaptop
That will be expensive. i just went to microcenter and asked them, they said many hundreds of dollars just to look at it, then like 1600 for the cheapest recovery...I would1. stop using it immediately. (after an error like tha ... Toshiba Satellite A215-S5822 Laptop
ACER Aspire L100 Desktop is dead?
If the hard drive is OK then you can remove the hard drive from the desktop case, and insert the hard drive into a USB 3 1/2" hard drive adapter case, this should come with a power adapter. These are available at your friendly computer shop. \0 ... Acer Aspire L100 PC Desktop
Gateway mx3222b laptop ram upgrade problem
Your computer does not support 1GB memory sticks. The max memory for that system is 1GB which would be 2 sticks configured as 512MB\015\012\015\012see below for the specs (i bold, italics and underlined the main part)\015\012\ ... Gateway PC Laptops
Playing movies from external hard drive
Both methods will work, but you will tend to have more control on the quality of the saved video if you "rip" the DVD yourself. There are several methods to rip a DVD. One, you can use the program SUPER, which is free, to rip to a single ... Dell Dimension 3000 PC Desktop
Maxtor One Touch Mini 4 external 160 Gb no longer recognized by computer. Any way to retrieve data? The disk still spins (I can feel it when I hold it in my hand), but the laptop (Windows XP) won't acknowledge it anymore. It's only a cuople months old, so I can get a new one, but even though THEIR device went bad, they want to charge me $1700 to restore data!!! Unbelievable!
Hello Ifurney,\015\012\015\012\015\012\015\012OK, this a long posting…\015\012\015\0121. There could be a problem with the USB cable. Try to replace the cable with\015\012another one and check.\015\012\015\0 ... PC Desktops
• Start your question with What, Why, How, When, etc. and end with a "?"
• Be clear and specific
• Use proper spelling and grammar
all rights reserved to the respective owners || www.electronic-servicing.com || Terms of Use || Contact || Privacy Policy
Load time: 0.5442 seconds | {
"url": "http://www.electronic-servicing.com/ea_electronic_arts_the_sims_deluxe_edition_for_windows/q1770696-sims_sims_2_external_hard_drive",
"source_domain": "www.electronic-servicing.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "28661",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HYDZZZ3CKOT2MUZQUSFOQMXNFJKSKDQF",
"WARC-Concurrent-To": "<urn:uuid:cfb6f282-d08f-4e23-9dc5-4ea8b8409641>",
"WARC-Date": "2017-05-28T01:17:07Z",
"WARC-IP-Address": "104.27.179.222",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5WMS3ZCHXILNCDUBAS6OXEQFKQPVAPGU",
"WARC-Record-ID": "<urn:uuid:024965d0-e0cf-4440-b2f9-51e83b87fb8f>",
"WARC-Target-URI": "http://www.electronic-servicing.com/ea_electronic_arts_the_sims_deluxe_edition_for_windows/q1770696-sims_sims_2_external_hard_drive",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:61dbefb3-3a62-4164-b1b6-b9e68c76fe84>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
1,
86,
87,
127,
128,
992,
993,
1003,
1004,
1171,
1180,
1358,
1367,
1444,
1543,
1544,
1569,
1570,
1638,
1695,
1739,
1740,
1770,
1771,
1811,
1812,
1813,
2112,
2113,
2402,
2403,
2404,
2657,
2658,
2688,
2689,
2690,
2958,
2959,
3177,
3178,
3179,
3452,
3453,
3525,
3526,
3527,
3814,
3815,
3948,
3949,
3950,
4198,
4199,
4237,
4238,
4239,
4522,
4523,
4572,
4573,
4574,
4848,
4849,
4896,
4897,
4898,
5157,
5158,
5261,
5262,
5263,
5549,
5550,
5565,
5566,
5567,
5845,
5846,
5886,
5887,
5888,
6150,
6151,
6189,
6190,
6191,
6473,
6474,
6547,
6548,
6549,
6834,
6835,
6878,
6879,
6880,
7058,
7059,
7200,
7201,
7202,
7474,
7475,
7972,
7973,
7974,
8227,
8228,
8291,
8292,
8293,
8580,
8581,
8674,
8675,
8676,
8958,
8959,
9028,
9029,
9030,
9315,
9316,
9382,
9383,
9384,
9651,
9652,
9686,
9687,
9688,
9965,
9966,
10009,
10010,
10011,
10261,
10262,
10302,
10303,
10304,
10579,
10580,
10958,
10959,
10960,
11184,
11259,
11285,
11321,
11443
],
"line_end_idx": [
1,
86,
87,
127,
128,
992,
993,
1003,
1004,
1171,
1180,
1358,
1367,
1444,
1543,
1544,
1569,
1570,
1638,
1695,
1739,
1740,
1770,
1771,
1811,
1812,
1813,
2112,
2113,
2402,
2403,
2404,
2657,
2658,
2688,
2689,
2690,
2958,
2959,
3177,
3178,
3179,
3452,
3453,
3525,
3526,
3527,
3814,
3815,
3948,
3949,
3950,
4198,
4199,
4237,
4238,
4239,
4522,
4523,
4572,
4573,
4574,
4848,
4849,
4896,
4897,
4898,
5157,
5158,
5261,
5262,
5263,
5549,
5550,
5565,
5566,
5567,
5845,
5846,
5886,
5887,
5888,
6150,
6151,
6189,
6190,
6191,
6473,
6474,
6547,
6548,
6549,
6834,
6835,
6878,
6879,
6880,
7058,
7059,
7200,
7201,
7202,
7474,
7475,
7972,
7973,
7974,
8227,
8228,
8291,
8292,
8293,
8580,
8581,
8674,
8675,
8676,
8958,
8959,
9028,
9029,
9030,
9315,
9316,
9382,
9383,
9384,
9651,
9652,
9686,
9687,
9688,
9965,
9966,
10009,
10010,
10011,
10261,
10262,
10302,
10303,
10304,
10579,
10580,
10958,
10959,
10960,
11184,
11259,
11285,
11321,
11443,
11468
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 11468,
"ccnet_original_nlines": 152,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3891330361366272,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06392329186201096,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18457850813865662,
"rps_doc_frac_unique_words": 0.32551172375679016,
"rps_doc_mean_word_length": 4.430853843688965,
"rps_doc_num_sentences": 124,
"rps_doc_symbol_to_word_ratio": 0.011186580173671246,
"rps_doc_unigram_entropy": 5.6145124435424805,
"rps_doc_word_count": 2003,
"rps_doc_frac_chars_dupe_10grams": 0.034478869289159775,
"rps_doc_frac_chars_dupe_5grams": 0.08157745748758316,
"rps_doc_frac_chars_dupe_6grams": 0.0723380297422409,
"rps_doc_frac_chars_dupe_7grams": 0.06467606127262115,
"rps_doc_frac_chars_dupe_8grams": 0.05701408162713051,
"rps_doc_frac_chars_dupe_9grams": 0.05002817139029503,
"rps_doc_frac_chars_top_2gram": 0.028394369408488274,
"rps_doc_frac_chars_top_3gram": 0.019154930487275124,
"rps_doc_frac_chars_top_4gram": 0.0054084500297904015,
"rps_doc_books_importance": -1171.3385009765625,
"rps_doc_books_importance_length_correction": -1171.3385009765625,
"rps_doc_openwebtext_importance": -699.8284912109375,
"rps_doc_openwebtext_importance_length_correction": -699.8284912109375,
"rps_doc_wikipedia_importance": -488.64251708984375,
"rps_doc_wikipedia_importance_length_correction": -488.64251708984375
},
"fasttext": {
"dclm": 0.023361559957265854,
"english": 0.9134836196899414,
"fineweb_edu_approx": 1.1788948774337769,
"eai_general_math": 0.12594455480575562,
"eai_open_web_math": 0.22486793994903564,
"eai_web_code": 0.15725702047348022
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
3,139,743,742,162,999,000 | Create Banner with mirror effect by ImageMagick
Tech Notes Imagemagick mirror effect
Santanu Misra / November 18, 2005
84 words ; 1 minute read
A simple way to create a text image which will have mirror effects. The best part of this you do not have to use any fancy imging software and it takes only few seconds to create the same. The code a single line to make it easier for Windows
convert -size 460x130 xc:white -font forte -pointsize 72 -fill “#cccccc” -annotate 0x180+12+80 “Banner Mirror” -gaussian 0x2 -stroke black -strokewidth 1 -fill “#80904F” -stroke black -strokewidth 1 -annotate 0x0+12+55 “Banner Mirror” -draw “line 0,68 430,68” Banner-Mirror-Imagemagick.jpg
Previous
Next | {
"url": "https://santm.com/blog/2005-11-18-create-banner-with-mirror-effect-by-imagemagick/",
"source_domain": "santm.com",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "7417",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DR5JNEW4NFQGAQWCIY2PJH7ZM3RRPVCW",
"WARC-Concurrent-To": "<urn:uuid:0b1ca621-03b4-4706-99e9-f3776d4c9b69>",
"WARC-Date": "2020-06-06T19:55:55Z",
"WARC-IP-Address": "185.199.110.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DE6Z7CYOSGSHPXHN4VUFNJWVILGETPAD",
"WARC-Record-ID": "<urn:uuid:2ecd7ed6-f59e-4136-84d2-3677434c740b>",
"WARC-Target-URI": "https://santm.com/blog/2005-11-18-create-banner-with-mirror-effect-by-imagemagick/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef152aa3-d09b-4e1c-a310-ff903afc631e>"
},
"warc_info": "isPartOf: CC-MAIN-2020-24\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-45.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,
48,
49,
86,
121,
146,
147,
389,
390,
680,
681,
691,
692
],
"line_end_idx": [
48,
49,
86,
121,
146,
147,
389,
390,
680,
681,
691,
692,
697
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 697,
"ccnet_original_nlines": 12,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18589743971824646,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012820510193705559,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.33974358439445496,
"rps_doc_frac_unique_words": 0.7777777910232544,
"rps_doc_mean_word_length": 5.092592716217041,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0.012820510193705559,
"rps_doc_unigram_entropy": 4.337005138397217,
"rps_doc_word_count": 108,
"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.04363635927438736,
"rps_doc_frac_chars_top_3gram": 0.07999999821186066,
"rps_doc_frac_chars_top_4gram": 0.08363635838031769,
"rps_doc_books_importance": -49.686607360839844,
"rps_doc_books_importance_length_correction": -51.893985748291016,
"rps_doc_openwebtext_importance": -22.338075637817383,
"rps_doc_openwebtext_importance_length_correction": -24.545454025268555,
"rps_doc_wikipedia_importance": -10.310498237609863,
"rps_doc_wikipedia_importance_length_correction": -12.517878532409668
},
"fasttext": {
"dclm": 0.14428794384002686,
"english": 0.6047347784042358,
"fineweb_edu_approx": 2.579055070877075,
"eai_general_math": 0.024780450388789177,
"eai_open_web_math": 0.29056012630462646,
"eai_web_code": 0.0005840099765919149
}
} | {
"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": "741.6",
"labels": {
"level_1": "Arts",
"level_2": "Drawing, Decoration and ornament, and Design",
"level_3": "Drawing — Technique and Caricatures and cartoons"
}
}
},
"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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
665,240,917,132,519,300 | Print
Print
I tried a couple free-standing digital asset managers but didn't find one I
really wanted to use. I purposely just downloaded a trial version and
waded in without reading too deeply into tutorials, as I wanted a user
interface more or less intuitive. Today it's mostly less, but you know
what I mean :). (I spent not one moment with video tutorials, which I find
to often be a pain in the butte, as one has to listen to the whole video
instead of being able to scan a table of contents to address a certain
problem.) Perhaps I didn't look at enough different systems, but frankly
most DAM software includes other types of software, most notably photo raw
converters. And many are pricey, especially Phase One Media Pro, which
would be one of the better options if one were part of a photography studio.
So I've opted for Lightroom, as was suggested by several respondents to my
earlier request. Lightroom provides me with two things I need: an awesome
DAM program, and updates for Adobe Camera Raw in case I should acquire new
camera equipment in the future. I must admit I'll probably do most of my
keywording in Bridge, at least initially, because it's what I've been doing
for so long. All the sorted photos and art work and documents will wind up
in Lightroom's catalog, however, as the catalog is easy to access and
provides useful ways to sort images and text. Too, Lightroom has other
options that I'll find useful, such as those for exporting to websites. I
found the Lightroom interface to be mostly intuitive, perhaps because I'm
so familiar with Photoshop. What I needed explaining was also
comparatively easy to find. Finally, Adobe is probably going to be around
for some time to come, and won't be selling it's software to the highest
bidder.
I must admit I debated Adobe's latest offer to photographers to acquire
Photoshop CC, Lightroom, and Behance for $10 a month (Adobe has met quite a
bit of resistance to offering Photoshop only as part of the the cloud), but
I decided to just buy Lightroom outright. This isn't a Luddite thing, but
rather a financial one. $120 a year doesn't sound like much unless one is
retired and relearning the meaning of "frugal." I have until the end of
the year to change my mind.
Thanks to all who made suggestions,
Bruce
--
Bruce Bartrug
Nobleboro, Maine, USA
[log in to unmask]
www.brucebartrug.com
The world is a dangerous place, not because of those who do evil, but
because of those who look on and do nothing. - Albert Einstein
Need to leave or subscribe to the Sciart-L listserv? Follow the instructions at
http://www.gnsi.org/resources/reviews/gnsi-sciart-l-listserv | {
"url": "https://listserv.unl.edu/cgi-bin/wa?A3=ind1309&L=SCIART-L&E=0&P=1724884&B=--047d7b343970ebb1d804e6aa0b7d&T=text%2Fplain;%20charset=ISO-8859-1&header=1",
"source_domain": "listserv.unl.edu",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "3808",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7QEFYI5BGRNMYJJEFEVFQXFQWF6NCO6U",
"WARC-Concurrent-To": "<urn:uuid:13d5afc7-b162-475b-b290-1b430eebd921>",
"WARC-Date": "2021-07-25T07:34:49Z",
"WARC-IP-Address": "129.93.2.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WMBPJXV62CSOIDFTTCE7XKMYDVTFZ4UW",
"WARC-Record-ID": "<urn:uuid:43a354a6-d2b7-4b97-b07c-15bf4067f03b>",
"WARC-Target-URI": "https://listserv.unl.edu/cgi-bin/wa?A3=ind1309&L=SCIART-L&E=0&P=1724884&B=--047d7b343970ebb1d804e6aa0b7d&T=text%2Fplain;%20charset=ISO-8859-1&header=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:85061047-028a-43d7-8652-1c5efb218e2e>"
},
"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-58.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,
6,
7,
13,
14,
15,
91,
162,
233,
305,
381,
454,
525,
599,
674,
746,
823,
824,
899,
975,
1050,
1124,
1200,
1276,
1346,
1418,
1493,
1567,
1630,
1705,
1778,
1786,
1787,
1859,
1935,
2011,
2086,
2161,
2234,
2262,
2263,
2299,
2305,
2306,
2310,
2324,
2346,
2365,
2386,
2387,
2457,
2521,
2522,
2602
],
"line_end_idx": [
6,
7,
13,
14,
15,
91,
162,
233,
305,
381,
454,
525,
599,
674,
746,
823,
824,
899,
975,
1050,
1124,
1200,
1276,
1346,
1418,
1493,
1567,
1630,
1705,
1778,
1786,
1787,
1859,
1935,
2011,
2086,
2161,
2234,
2262,
2263,
2299,
2305,
2306,
2310,
2324,
2346,
2365,
2386,
2387,
2457,
2521,
2522,
2602,
2662
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2662,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4356260895729065,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0476190485060215,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15520282089710236,
"rps_doc_frac_unique_words": 0.5629138946533203,
"rps_doc_mean_word_length": 4.604856491088867,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.114311695098877,
"rps_doc_word_count": 453,
"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.007190799806267023,
"rps_doc_frac_chars_top_3gram": 0.009587730281054974,
"rps_doc_frac_chars_top_4gram": 0.016299139708280563,
"rps_doc_books_importance": -254.8997802734375,
"rps_doc_books_importance_length_correction": -254.8997802734375,
"rps_doc_openwebtext_importance": -131.35394287109375,
"rps_doc_openwebtext_importance_length_correction": -131.35394287109375,
"rps_doc_wikipedia_importance": -142.01223754882812,
"rps_doc_wikipedia_importance_length_correction": -142.01223754882812
},
"fasttext": {
"dclm": 0.023402750492095947,
"english": 0.9727973937988281,
"fineweb_edu_approx": 1.2572221755981445,
"eai_general_math": 0.37906962633132935,
"eai_open_web_math": 0.1142759919166565,
"eai_web_code": 0.057766739279031754
}
} | {
"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": "770.285",
"labels": {
"level_1": "Arts",
"level_2": "Photography",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "24",
"label": "User Review"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,501,579,932,101,987,000 | The mean of 9 sales was recorded as $47.50.
One sales slip is missing and the remaining 8 were
$32.53, $12.78, $43.61, $52.16, $36.75, $40.56, $41.78, $42.15.
Find the value of the missing slip
Solution: We have that
GO TO NEXT PROBLEM >>
Stats Solution Summary
The use of descriptive statistics can be crucial at the time of understanding the basic distributional properties of a distribution | {
"url": "https://statisticshelp.org/descriptive_statistics_problems_5.php",
"source_domain": "statisticshelp.org",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "38481",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3OZFKQCQS25K2G3FPX3AGY2CBMNHFKST",
"WARC-Concurrent-To": "<urn:uuid:f7c8235f-8c81-494b-90ca-c7b8749191b3>",
"WARC-Date": "2021-04-21T23:41:42Z",
"WARC-IP-Address": "104.21.19.193",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZYBYHWZMQQVSUDLRYC2CII56L3XDK57V",
"WARC-Record-ID": "<urn:uuid:b276a0b9-f520-42b4-9d6a-f707fb3a7285>",
"WARC-Target-URI": "https://statisticshelp.org/descriptive_statistics_problems_5.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d0d6859-01e4-4e5f-8066-73b02329c031>"
},
"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-39.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
44,
45,
96,
97,
161,
162,
197,
198,
221,
222,
244,
245,
268,
269
],
"line_end_idx": [
44,
45,
96,
97,
161,
162,
197,
198,
221,
222,
244,
245,
268,
269,
400
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 400,
"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.2330097109079361,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03883495181798935,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4757281541824341,
"rps_doc_frac_unique_words": 0.7846153974533081,
"rps_doc_mean_word_length": 4.584615230560303,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.7557144165039062,
"rps_doc_word_count": 65,
"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": -32.12621307373047,
"rps_doc_books_importance_length_correction": -32.12621307373047,
"rps_doc_openwebtext_importance": -12.587752342224121,
"rps_doc_openwebtext_importance_length_correction": -12.587752342224121,
"rps_doc_wikipedia_importance": -10.681825637817383,
"rps_doc_wikipedia_importance_length_correction": -10.6818265914917
},
"fasttext": {
"dclm": 0.8873506784439087,
"english": 0.9537513852119446,
"fineweb_edu_approx": 1.216557502746582,
"eai_general_math": 0.995523989200592,
"eai_open_web_math": 0.431732177734375,
"eai_web_code": 0.024170460179448128
}
} | {
"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": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,899,323,961,106,110,000 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
PerlMonks
Reusing camel code
by gmax (Abbot)
on Dec 02, 2001 at 19:43 UTC ( #128986=perlquestion: print w/ replies, xml ) Need Help??
gmax has asked for the wisdom of the Perl Monks concerning the following question:
Dear monks,
This one was a slow Saturday, and I spent some idle time looking at the Camel Code. It would be nice to write such a program with a different shape, I thought. Unfortunately, among my many abilities, drawing is definitely missing. However, since the Camel code is a self drawing program, I thought that its magic, albeit not easily duplicated, could be reused. Thus, I got hold of some shapes (using a separated parser, which skips the first two lines and the __DATA__ section) and managed to re-use the Camel code, according to the golden principle of Laziness, so well explained by Larry Wall.
In order to run this program, you must have the Camel code in your current directory. (I only tried it in Linux and FreeBSD.)
perl camelfilter.pl # shows the llama perl camelfilter.pl shark perl camelfilter.pl gmax
The patterns for shark and llama are taken from the omonimous files in the obfuscated code section of www.perlmonks.net. A third pattern, a rather unimaginative "gmax", I got from rotating the output of the good old Unix banner program (still I can't draw, as I told you before). Parsing these files, I got my patterns as sets of F (for Filled) or S (for Spaces) followed by the number of occurrences. Such patterns are then assigned to scalar variables in camelfilter.pl. Newlines are indicated by colons. Thus a pattern of "S30F12:" means 30 spaces, followed by 12 nonspaces and a newline.
+------------------+ | | | while pattern |<------------------+ <-----------------+ | | | | +------------------+ | | | | | V | | /\ | | / \ +----------+----------+ | / \ | | | / is it\____NO_______> | write next non space| | \ space/ | characters from | | \ ? / | camel.pl | | \ / +---------------------+ | \/ | | | | | YES | | | V | +---------------------+ | | write as many spaces| | | as stated in the +------------------------------------+ | pattern | +---------------------+
camelfilter.pl reads camel.pl and makes a string of its code, skipping all spaces. The code is then rewritten in newcamel.pl following the pattern of llama (default), shark or gmax (if stated as an argument in the command line).
newcamel.pl will inherit camel.pl's magic and print its new shapes, with same additional noise lines (due to the difference in size between camels, llamas, sharks and gmax's, I suppose). You can either get rid of the noise by filtering the unwanted lines
system "perl $newcamel | perl -ne 'print if !/^ ?mm|[\\^]{20}/'";
or show them
do "$newcamel";
There is room for improvement (patterns could be bit-encoded, for instance), but I would like some specific hints on how to apply the pattern in a more linear way than my while ($$pattern ...). I suspect that it might be a mappish solution somewhere, but my Laziness did not come up with any practical suggestion (too much Impatience?, not enough Hybris? I don't know.)
I am working on patterns for a less entertaining project, involving database results representation, and some problems are very similar to this one: applying a pattern to a long stream of data in order to create a complex report. Since the problem is basically the same, I thought that asking with a funny example would at least make someone smile.
TIAFYH
gmax
#!/usr/bin/perl -w # camelfilter.pl use strict; my $llama = "S51F11:S47F10S1F9:S45F21:S49F12:S49F9:S49F9:S49F9:" . "S49F9:S49F9:S47F11:S3F8S4F26S4F13:S1F57:F57:F57:S2F54:S2F54:" . "S3F51:S4F49:S4F48:S5F45:S6F17S3F23:S7F15S6F20:S8F13S10F16:" . "S10F10S14F12:S11F8S17F10:S12F5S20F4S1F4:S12F4S21F4S2F3:" . "S11F4S22F3S3F3:S12F3S22F3S3F3:S13F3S21F3S4F2:S13F5S20F3S3F3:" . "S13F6S19F4S2F5:"; my $shark ="S46F9:S41F18:S8F24S5F3S1F21:F41S2F12:F7S2F33S3F9:" . "S2F22S2F20S2F1S2F4:S4F20S3F22S1F4:S6F2S7F10S1F4S1F3S1F20:" . "S11F2S7F14S1F1S1F15S1F3:S13F3S8F11S1F1S1F1S1F18:" . "S14F7S6F6S1F1S2F21:S16F21S1F9S1F13:S19F20S1F3S2F2S1F13:" . "S19F2S4F14S3F6S2F12:S17F7S9F6S1F2S3F4S1F13:S16F5S17F8S2F1S2F13:" . "S16F1S26F21:S53F12:S48F3S5F9:S50F6S2F7:S52F12:S53F10:S54F6:" . "S54F5:S53F4:S53F2:F1:"; my $gmax = "S65:S12F2S51:S11F4S50:S12F2S51:" . "S5F4S3F2S1F5S3F2S4F2S8F3S7F7S3F5S1:" . "S4F6S1F2S2F5S2F3S3F4S5F7S5F7S3F5S1:" . "S3F3S2F3S5F4S1F5S1F5S5F2S2F3S6F5S6F2S2:" . "S2F3S3F4S4F10S1F6S3F3S3F3S6F4S5F2S3:" . "S1F4S4F3S4F5S1F5S2F4S3F3S3F4S5F4S5F1S4:" . "S1F4S4F4S3F4S3F4S2F4S3F3S4F3S6F4S3F2S4:" . "S1F3S6F3S3F4S3F3S3F4S3F3S4F3S6F4S3F2S4:" . "F4S6F3S3F4S3F3S3F4S4F1S5F3S7F4S2F1S5:" . "F4S6F3S3F4S3F3S3F4S10F3S7F4S1F2S5:" . "F4S6F3S3F4S3F3S3F4S10F3S8F5S6:" . "F4S6F3S3F4S3F3S3F4S5F2S3F3S8F5S6:" . "F4S6F3S3F4S3F3S3F4S4F5S1F3S8F5S6:" . "S1F4S4F4S3F4S3F3S3F4S3F10S8F5S6:" . "S1F4S4F4S3F4S3F3S3F4S2F4S2F5S9F4S6:" . "S2F3S4F3S4F4S3F3S3F4S2F3S4F4S9F4S6:" . "S2F3S3F3S5F4S3F3S3F4S2F3S5F3S8F6S5:" . "S3F7S6F4S3F3S3F4S1F4S5F3S8F6S5:" . "S4F6S6F4S3F3S3F4S1F4S5F3S8F1S2F4S4:" . "S4F1S11F4S3F3S3F4S1F4S5F3S7F2S2F4S4:" . "S3F2S11F4S3F3S3F4S2F3S5F3S7F1S4F4S3:" . "S2F3S11F4S3F3S3F4S2F3S4F4S6F2S4F4S3:" . "S2F4S10F4S3F3S3F4S2F4S3F4S6F2S4F4S3:" . "S2F6S8F4S3F3S3F4S3F11S4F2S6F4S2:" . "S2F7S6F6S1F5S1F6S2F6S1F4S2F5S4F6S1:" . "S2F9S4F6S1F5S1F6S4F2S4F4S1F5S4F6S1:" . "S2F10S53:S1F2S2F7S53:S1F1S4F7S52:" . "S1F1S6F5S52:F2S8F3S52:F2S8F3S52:" . "F2S8F3S52:F2S8F3S52:S1F1S8F3S52:" . "S1F2S6F3S53:S2F3S3F4S53:S2F9S54:S3F7S55:S65:"; my $newcamel = "newcamel.pl"; my $oldcamel = "camel.pl"; open CAMEL, "< $oldcamel" or die "camel ($oldcamel) not found\n"; open NEWCAMEL, "> $newcamel" or die "can't create new camel ($newcamel)\n"; my $camel; while (<CAMEL>) { print NEWCAMEL $_,next if /^(:?use|#)/; chomp; while (/(.)/g) { $camel .= $1 if $1 ne " "; } } close CAMEL; my $out; my $choice=shift; my $pattern = \$llama; if (defined $choice) { $pattern = \$gmax if $choice eq "gmax"; $pattern = \$shark if $choice eq "shark"; } else { $choice = "llama"; } my $camelcount =0; while ($$pattern =~ /([SF:])([^SF:]*)/g) { if ($1 eq "F"){ $out = substr ($camel, $camelcount, $2); $camelcount += $2; } elsif ($1 eq "S"){ $out = " " x $2; } else { $out = "\n"; } print NEWCAMEL $out; } $out = substr($camel,$camelcount); print NEWCAMEL $out; close NEWCAMEL; system "perl $newcamel | " . "perl -ne 's/camel/$choice/;print if !/^ ?mm|[\\^]{20}/'"; #do "$newcamel";
Edit 2001-12-05 by dvergin per user request</link>
Comment on Reusing camel code
Select or Download Code
Replies are listed 'Best First'.
Re: Reusing camel code
by Beatnik (Parson) on Dec 03, 2001 at 00:02 UTC
#!/usr/bin/perl eval eval '"'. ('#'). '!'.'/' .('[' ^'.' ) .('['^'('). ("\["^ ')')."\/".( '`'|'"').('`'| ')').( '`'|'.') .'/'. ( '['^'+').('`'|'%').('[' ^')').('`'|',').('!' ^'+').('!'^'+').('['^'+' ).('['^')').('`'|')') .('`'|'.').('['^'/').(('{')^ '[').'\\'.'"'.("\`"^ '(').('`'|'%').('`'|',').('`'|','). (('`')| '/').('{'^'[').('{'^',').('`'|'/').( '['^')').('`'|',').('`'|'$').'\\'.'"'.';'.'"';$:='.'^'~';$~ ='@'|'(';$^=')'^'[';$/='`'|'.';$_='('^'}';$,='`'|'!';$\="\)"^ '}';$:='.'^'~';$~='@'|'(';$^=')'^'[';$/='`'|'.';$_='('^"\}";$,= '`'|'!';$\=')'^'}';$:='.'^'~';$~='@'|'(';$^=')'^'[';$/='`'|'.'; $_='('^'}';$,='`'|'!';$\=')'^'}';$:='.'^'~';$~='@'|'(';$^="\)"^ '[';$/='`'|'.';$_='('^'}';$,='`'|'!';$\=')'^'}';$:='.'^"\~";$~= '@'|'(';$^=')'^'[';$/='`'|'.';$_='('^'}';$,='`'|'!';$\=')'^"\}"; $:='.'^'~';$~='@'|'(';$^=')'^'[';$/='`'|'.';$_='('^'}';$,="\`"| '!';$\=')'^'}';$:='.'^'~';$~='@'|'(';$^=')'^'[';$/='`' |"\."; $_='('^'}';$,='`'|'!';$\=')'^'}';$:='.'^'~';$~="\@"| "\("; $^=')'^'[';$/='`'|'.';$_='('^'}';$,='`'|'!';$\=')' ^'}'; $:='.'^'~';$~='@'|'(';$^=')'^'[';$/='`' |'.';$_= '('^ (( '}'));$,='`'|'!';$\=')'^"\}";$:= '.'^'~'; ($~) ='@'|"\("; $^=')'^'[' ;$/='`'| '.';$_= '(' ^('}');$,= '`'|'!';$\ =')'^'}' ;$:='.' ^+ "\~";$~= '@'|'(';$^ =(')')^ '[';$/ ='`'|'.' ;$_=('(')^ '}';$,= "\`"| '!';$\= ')'^'}';$: ="\."^ '~';$~ =('@')| "\(";$^= (')')^ "\["; $/='`' |"\."; $_='(' ^'}'; ($,)= ('`')| '!';$\ =')'^ "\}"; $:='.'^ '~';$~ ='@' |'('; $^=')'^'[' ;$/= '`'| "\.";$_= '('^ '}'; $,=('`')| '!'; ($\) =')'^'}';$: ='.'^ "\~"; $~='@'|'(';$^= (')')^ "\["; $/="\`"| '.'; $_='('^ '}';$,= '`'|'!'; $\="\)"^ '}';#;
Now that I have your attention, the above camel is generated with Acme::EyeDrops and it's one of the many shapes available. You can have your own ASCII art too :) BooK explained the REAL camel at YAPC::Eu 2.00.1. Slides are here.
Greetz
Beatnik
... Quidquid perl dictum sit, altum viditur.
Re: Reusing camel code
by chromatic (Archbishop) on Dec 03, 2001 at 00:00 UTC
split looks like a better choice than a regex. I whittled away at this and came up with the untested:
for (split(/:/, $$pattern)) { # make sure it starts and ends with spaces $_ = 'S0' . $_ unless /^S/; $_ .= 'S0' unless /S\d+$/; my @pieces = split(/[SF](\d+)/, $_); while (my ($spaces, $fills) = splice(@pieces, 0, 2)) { $out .= " " x $spaces . substr($camel, $camelcount, $fills); } $out .= "\n"; }
I'm fairly pleased with that, but might try to fit a pack in there. (How would you have used map?)
Aside, this:
while (/(.)/g) { $camel .= $1 if $1 ne " "; }
could be spelled:
tr/ //d; $camel .= $_;
I'm sure you can trim that down more, too. Don't forget to check out Acme::EyeDrops for a different take on things.
Update, very shortly after: You could, of course, just split on [SF] and probably get the same effect, though you'll have an empty element at the start. It may or may not be more clear that way.
Thank you very much for your hints. I tested your code
for (split(/:/, $$pattern)) { $_ = 'S0' . $_ unless /^S/; $_ .= 'S0' unless /S\d+$/; print STDERR "pattern: $_\n"; my @pieces = split(/[SF](\d+)/, $_); foreach my $count (0..$#pieces) { print STDERR "$count -> [$pieces[$count]] "; } print STDERR "\n"; }
But I got an odd output. Split gives back some empty items
pattern: S51F11S0 0 -> [] 1 -> [51] 2 -> [] 3 -> [11] 4 -> [] 5 -> [0]
Changing split to match only /[SF]/ (your update suggestion) and adding a shift afterwards improves the output,
pattern: S51F11S0 0 -> [51] 1 -> [11] 2 -> [0]
leaving me with the second problem, i.e. that having an odd number of items in my array, splice(@,0,2) will give back an undefined second element.
Nothing catastrophic, but it is going to increase the number of necessary checks.
Even if it doesn't do what I need, though, this code of yours gives me some ideas that I can further develop.
As for the second hint:
tr/ //d; $camel .= $_;
yes, it looks much faster (not to mention smarter) than my code.
Ciao gmax
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: perlquestion [id://128986]
Approved by root
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (2)
As of 2015-10-10 10:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
Does Humor Belong in Programming?
Results (255 votes), past polls | {
"url": "http://www.perlmonks.org/index.pl?node_id=128986",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "36470",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:USQNDGK7PEP6AWXUJEZU3ZHPMTYOXNE2",
"WARC-Concurrent-To": "<urn:uuid:f82da1fc-54e9-416c-8534-e709cfb47cd3>",
"WARC-Date": "2015-10-10T10:13:36Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4RG4JUBUIHWA664FNU7GK6QOPOFTUEWX",
"WARC-Record-ID": "<urn:uuid:6dd6320a-7584-4eca-beea-be5d158674ee>",
"WARC-Target-URI": "http://www.perlmonks.org/index.pl?node_id=128986",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:33d29038-41b6-431c-8263-b2708b6e7569>"
},
"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,
63,
90,
120,
122,
134,
135,
154,
155,
171,
260,
343,
344,
356,
952,
1078,
1167,
1759,
2238,
2467,
2722,
2788,
2801,
2817,
3187,
3536,
3543,
3548,
6463,
6514,
6515,
6545,
6569,
6602,
6625,
6674,
8288,
8522,
8523,
8534,
8546,
8595,
8618,
8673,
8779,
9082,
9185,
9186,
9203,
9204,
9254,
9276,
9303,
9423,
9424,
9623,
9624,
9685,
9945,
10010,
10087,
10205,
10258,
10411,
10499,
10615,
10645,
10674,
10745,
10761,
10762,
10770,
10780,
10790,
10791,
10811,
10829,
10842,
10855,
10893,
10910,
10915,
10927,
10964,
10965,
11003,
11016,
11052,
11079,
11089,
11102,
11114,
11125,
11143,
11144,
11182,
11183,
11184,
11185,
11186
],
"line_end_idx": [
63,
90,
120,
122,
134,
135,
154,
155,
171,
260,
343,
344,
356,
952,
1078,
1167,
1759,
2238,
2467,
2722,
2788,
2801,
2817,
3187,
3536,
3543,
3548,
6463,
6514,
6515,
6545,
6569,
6602,
6625,
6674,
8288,
8522,
8523,
8534,
8546,
8595,
8618,
8673,
8779,
9082,
9185,
9186,
9203,
9204,
9254,
9276,
9303,
9423,
9424,
9623,
9624,
9685,
9945,
10010,
10087,
10205,
10258,
10411,
10499,
10615,
10645,
10674,
10745,
10761,
10762,
10770,
10780,
10790,
10791,
10811,
10829,
10842,
10855,
10893,
10910,
10915,
10927,
10964,
10965,
11003,
11016,
11052,
11079,
11089,
11102,
11114,
11125,
11143,
11144,
11182,
11183,
11184,
11185,
11186,
11221
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 11221,
"ccnet_original_nlines": 99,
"rps_doc_curly_bracket": 0.00543624022975564,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2315140813589096,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07658451050519943,
"rps_doc_frac_lines_end_with_ellipsis": 0.009999999776482582,
"rps_doc_frac_no_alph_words": 0.44366195797920227,
"rps_doc_frac_unique_words": 0.4592779278755188,
"rps_doc_mean_word_length": 5.691855430603027,
"rps_doc_num_sentences": 151,
"rps_doc_symbol_to_word_ratio": 0.0061619700863957405,
"rps_doc_unigram_entropy": 5.775221824645996,
"rps_doc_word_count": 1191,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02743767946958542,
"rps_doc_frac_chars_dupe_6grams": 0.010621040128171444,
"rps_doc_frac_chars_dupe_7grams": 0.005015490110963583,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010621040128171444,
"rps_doc_frac_chars_top_3gram": 0.009440920315682888,
"rps_doc_frac_chars_top_4gram": 0.00796577986329794,
"rps_doc_books_importance": -1019.1851196289062,
"rps_doc_books_importance_length_correction": -1019.1851196289062,
"rps_doc_openwebtext_importance": -622.7561645507812,
"rps_doc_openwebtext_importance_length_correction": -622.7561645507812,
"rps_doc_wikipedia_importance": -542.1557006835938,
"rps_doc_wikipedia_importance_length_correction": -542.1557006835938
},
"fasttext": {
"dclm": 0.8105456233024597,
"english": 0.7202966809272766,
"fineweb_edu_approx": 1.5038357973098755,
"eai_general_math": 0.5618313550949097,
"eai_open_web_math": 0.3518199920654297,
"eai_web_code": 0.39694201946258545
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
5,338,347,910,949,551,000 | Personal tools
Haskell Platform
From HaskellWiki
(Difference between revisions)
Jump to: navigation, search
(add link to unofficial versions comparison chart)
(43 intermediate revisions by 10 users not shown)
Line 1: Line 1:
[[Image:Platform.png|300px]]
+
{{HP}}
__NOTOC__
+
The Haskell Platform is a single, standard [[Haskell]] development environment for everyone. It offers a set of blessed libraries and tools, to save you the task of picking and choosing which core Haskell libraries to use.
The Haskell Platform (HP) is the name of the blessed, core library suite for Haskell. By taking the best libraries from the more than 1200 libraries of [http://hackage.haskell.org Hackage], it provides a comprehensive, stable and mature base for Haskell projects to work from.
+
[http://hackage.haskell.org/platform/contents.html Learn more about the Haskell Platform ⇒]
See the [http://trac.haskell.org/haskell-platform/wiki Platform Issue Tracker] for further information.
+
__TOC__
== Status ==
+
== What's in the platform ==
The platform is specified via a Cabal file:
+
See
+
* the [http://hackage.haskell.org/platform/changelog.html change log]
+
* the unofficial [http://sol.github.com/haskell-platform-versions-comparison-chart/ Versions Comparison Chart]
* '''[http://code.haskell.org/haskell-platform/haskell-platform.cabal The Haskell Platform 2009.2.0] (alpha) '''
+
== Trouble shooting ==
The initial release targets:
+
The Haskell Platform project maintains a bug tracker and wiki site, which you can use to report problems, or request features:
* ghc-6.10.2
+
* [http://trac.haskell.org/haskell-platform/report/1 Known issues]
* [http://trac.haskell.org/haskell-platform/wiki/Library/VersionMatrix#PlatformPackages Classic Extra Libs]
+
* [http://trac.haskell.org/haskell-platform/newticket?summary=%3CProblem%3E&description=%3CDescribe%20the%20problem%3E&component=Platform Report a bug]
* haddock, happy and alex
+
* cabal-install and its dependencies.
+
== Distributions ==
+
=== Developers ===
Distros that support the Haskell Platform
+
For developers, there is a wiki page with project details:
{|
+
* [http://trac.haskell.org/haskell-platform/ Developer's wiki]
|-
+
* [http://trac.haskell.org/haskell-platform/wiki/ReleaseTimetable Release Timetable]
| '''System'''
+
| '''Status'''
+
|-
+
|Arch
+
| ''To be constructed with cabal2arch''
+
|-
+
|Debian
+
|
+
|-
+
|Fedora
+
|
+
|-
+
|Gentoo
+
| Available in the gentoo haskell overlay, large parts in portage
+
|-
+
|Nix(OS)
+
| Metapackage available for testing in Nixpkgs
+
|-
+
|Ubuntu
+
|
+
|-
+
| Generic Unix Installer
+
|
+
|-
+
|
+
|
+
|-
+
|Windows Installer
+
|
+
|-
+
| OSX Installer
+
|
+
|-
+
|}
+
== Volunteers needed! ==
+
== Buttons ==
We are calling for volunteers for an action group. We need volunteers to
+
We have some buttons to let your friends know about the Haskell Platform.
take charge of various platforms and to manage the overall release.
+
We would like to release a beta at the upcoming [[Hac5|Haskell
+
Hackathon in Utrecht (April 17-19)]]. However this will '''only''' happen if people volunteer to help build distributions for different platforms.
+
In particular we need:
+
[http://hackage.haskell.org/platform http://hackage.haskell.org/platform/icons/button-100.png]
* Release manager / coordinator
+
* Website with downloads and release notes
+
* Someone in charge of each platform:
+
** Windows installer
+
** OSX installer
+
** Generic Unix source tarball
+
** Distribution packages: debian, fedora, gentoo, arch, BSD* etc
+
The person in charge of each platform is responsible for building a appropriate native packages / installer and coordinating the effort to test that the stuff installs and works ok.
+
Use this html in your site:
If no one volunteers, we simply won't have an Haskell Platform release for that platform.
+
<code>
+
<nowiki>
+
<a href="http://hackage.haskell.org/platform"
+
><img src="http://hackage.haskell.org/platform/icons/button-100.png"></a>
+
</nowiki>
+
</code>
Please join the mailing list and volunteer!
+
[http://hackage.haskell.org/platform http://hackage.haskell.org/platform/icons/button-64.png]
=== Hackathon Update ===
+
Use this html in your site:
We finalised the list of packages that will be in the first release. See:
+
<code>
http://trac.haskell.org/haskell-platform/wiki/Library/VersionMatrix
+
<nowiki>
+
<a href="http://hackage.haskell.org/platform"
+
><img src="http://hackage.haskell.org/platform/icons/button-64.png"></a>
+
</nowiki>
+
</code>
We managed to get a beta version of the generic tarball for unix systems. Get that here and try it out:
+
SVG source for the button: http://haskell.org/haskellwiki/Image:Button.svg
http://haskell.org/~duncan/haskell-platform-2009.0.0.tar.gz
+
Chris and Eelco made a very nice design for the front page of a "Get Haskell" download site for the platform.
+
=== Icons ===
Gregory reported progress on the OSX front. Turns out there will need to be more work to do new OSX Leopard-style installers.
+
Icons for the platform installer and desktop.
== Resources ==
+
[http://ireneknapp.com/himitsu/Platform-100.png http://ireneknapp.com/himitsu/Platform-100.png]
* [http://trac.haskell.org/haskell-platform/ Issue tracker and dev wiki]
+
[http://ireneknapp.com/himitsu/Platform-64.png http://ireneknapp.com/himitsu/Platform-64.png]
* [http://code.haskell.org/haskell-platform Darcs repository]: contains the meta-package and scripts for the generic unix tarball
+
* [[/FAQ]]
+
* [http://projects.haskell.org/cgi-bin/mailman/listinfo/haskell-platform Mailing list]
+
* IRC channel: #ghc @ freenode.org
+
* [http://www.galois.com/blog/2009/03/23/one-million-haskell-downloads/ Download statistics for Haskell Packages]
+
* [http://www.cse.unsw.edu.au/~dons/papers/CPJS08.html Haskell: Batteries Included], position paper by Don, Duncan and Isaac.
+
== Documentation ==
+
=== Legal ===
* [http://cgi.cse.unsw.edu.au/~dons/blog/2008/07/29#batteries The Haskell Platform Proposal] for the 2008 Haskell Symposium
+
* The cherry blossom image used in the 2011 HP release is [http://www.flickr.com/photos/28481088@N00/3291086383/ licensed CC by tanakawho]
* [http://blog.well-typed.com/2008/11/haskell-platform-talk-at-the-london-haskell-users-group/ Slides from the Haskell Platform talk]
+
* [http://blog.well-typed.com/2008/09/hackage-hacking-and-demo/ Haskell Platform discussion]
+
* Bryan O'Sullivan's [http://www.serpentine.com/blog/2008/09/26/some-notes-on-the-future-of-haskell-and-fp/ writeup] of the future of Haskell discussion
+
* [http://thread.gmane.org/gmane.comp.lang.haskell.cvs.ghc/28062/focus=28807 A discussion] took place in June and July 2008 about the direction of the HLP.
+
* [http://haskell.org/~duncan/ghc/%23ghc-2008-07-16.log More occurred during the #ghc meeting]
+
+
===Quality Control===
+
+
Inclusion or exclusion in the platform will be driven by metrics, objective measurements we can extract from code. Determining appropriate metrics is a milestone.
+
+
* cabal-installable libraries with haddocks.
+
* packages should follow the [[Package versioning policy]]
+
* The set of HP packages + core libs must be closed. In other words, all haskell dependencies must be from within the HP packages or core libs. Dependencies on C libs can be external.
+
* All packages in a particular HP version must have a consistent install plan.
+
+
That means only one version of each package and all dependencies on packages must be satisfied by the version in the HP package set.
+
+
There is code in cabal-install to check the last two requirements.
+
+
Other possible ideas for quality standards we might want to require:
+
+
* Uses base library types, to force API standardisation
+
* exposed module names must follow the hierarchical module name convention, meaning they must be in an appropriate place in the module namespace. In particular, no clash of module names should occur within the HP.
+
+
=== Other heuristics ===
+
+
Packages set for inclusion should:
+
+
* Have a maintainer
+
* Have a bug tracker
+
* Use the correct versioning
+
* Build with cabal
+
* Work on all arches.
+
+
Further goals:
+
+
* -Wall clean
+
* 100% coverage
+
* Have real world use.
+
* Answer a notable set of build dependencies.
+
* Have a declared correctness test suite.
+
* Have a declared performance test suite.
+
* BSD licensed
+
+
== Distribution format ==
+
+
* Source distribution
+
* .tar.gz bundle compatible with extra-libs
+
* Windows Installed
+
* Native distro packages
+
+
The HP will be the first '''meta-package''' on hackage, that depends on the platform library set. With this,
+
+
cabal install haskell-platform
+
+
will be possible.
+
+
== Version policy ==
+
+
yyyy.major.minor,
+
+
* odd major numbers indicate unstable branches
+
* minor numbers indicate bug fixes only, no API changes.
+
+
Examples:
+
+
* 2008.0.0 -- first biannual major stable release
+
* 2008.0.1 -- minor release, bug fix only
+
* 2008.1 -- unstable branch leading to next major release
+
* 2008.2.0 -- second annual major release, API changes
+
* 2008.2.1 -- bug fixes
+
* 2008.3 -- unstable branch of 2008
+
* 2009.0.0 -- first release in 2009.
+
+
Additionally, if a library is accepted into the platform, it is suggested its version number be lifted to 1.0, if not already at 1.0.
+
+
== Licenses ==
+
+
The initial release is expected to include only BSD3 licensed software.
+
+
== Programs ==
+
+
The platform includes programs, such as haddock or cabal-install.
+
These aren't nicely tracked from the cabal meta package yet.
+
+
== Build system ==
+
+
Two ways to build the bundle:
+
+
* generate a sh script from the .cabal file
+
+
Or, build cabal-install, have the components of the platform
+
as a mini, local hackage archive, and then ask cabal install to satisfy
+
and install the dependencies from the platform meta-cabal file.
+
+
== Related projects ==
+
+
* [http://docs.python.org/lib/lib.html Python libraries]
+
* [http://live.gnome.org/ReleasePlanning Gnome's release process]
+
* [http://live.gnome.org/ReleasePlanning/ModuleProposing How to propose modules for GNOME]
+
* [http://forge.ocamlcore.org/projects/batteries/ OCaml Batteries]
+
+
== Developers ==
+
+
Haskell Platform core team:
+
+
* Duncan Coutts (Well Typed)
+
* Don Stewart (Galois)
+
+
[[Category:Community]]
+
Revision as of 09:44, 18 March 2012
Platform.png
The Haskell Platform
The Haskell Platform is a single, standard Haskell development environment for everyone. It offers a set of blessed libraries and tools, to save you the task of picking and choosing which core Haskell libraries to use.
Learn more about the Haskell Platform ⇒
Contents
1 What's in the platform
See
2 Trouble shooting
The Haskell Platform project maintains a bug tracker and wiki site, which you can use to report problems, or request features:
2.1 Developers
For developers, there is a wiki page with project details:
3 Buttons
We have some buttons to let your friends know about the Haskell Platform.
button-100.png
Use this html in your site:
<a href="http://hackage.haskell.org/platform" ><img src="http://hackage.haskell.org/platform/icons/button-100.png"></a>
button-64.png
Use this html in your site:
<a href="http://hackage.haskell.org/platform" ><img src="http://hackage.haskell.org/platform/icons/button-64.png"></a>
SVG source for the button: http://haskell.org/haskellwiki/Image:Button.svg
3.1 Icons
Icons for the platform installer and desktop.
Platform-100.png
Platform-64.png
3.2 Legal | {
"url": "https://wiki.haskell.org/index.php?title=Haskell_Platform&diff=44952&oldid=28104",
"source_domain": "wiki.haskell.org",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "78554",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3YCNAT4RBSZOHQY2V54DEYUF4GQUK7WP",
"WARC-Concurrent-To": "<urn:uuid:f0177f97-3fd8-4d71-a24a-37defb52ba9f>",
"WARC-Date": "2017-06-23T08:48:01Z",
"WARC-IP-Address": "151.101.32.68",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:ZTGZZDFBDARWHNH4V6IPYKA7FT2MW6WZ",
"WARC-Record-ID": "<urn:uuid:4ce6cd77-d06b-499a-b45a-47e4f8b1c648>",
"WARC-Target-URI": "https://wiki.haskell.org/index.php?title=Haskell_Platform&diff=44952&oldid=28104",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:81ad0140-51ad-4503-8cb7-bbe488454468>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-54-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
15,
16,
33,
34,
51,
52,
83,
111,
162,
212,
228,
257,
259,
266,
269,
279,
281,
504,
507,
784,
786,
878,
881,
985,
987,
995,
998,
1011,
1013,
1042,
1045,
1089,
1091,
1095,
1098,
1168,
1171,
1282,
1285,
1398,
1400,
1423,
1426,
1455,
1457,
1584,
1587,
1600,
1602,
1669,
1777,
1779,
1931,
1957,
1959,
1997,
1999,
2002,
2022,
2024,
2043,
2046,
2088,
2090,
2149,
2152,
2155,
2157,
2220,
2223,
2225,
2310,
2325,
2327,
2342,
2344,
2347,
2349,
2355,
2357,
2397,
2399,
2402,
2404,
2412,
2414,
2416,
2418,
2421,
2423,
2431,
2433,
2435,
2437,
2440,
2442,
2450,
2452,
2518,
2520,
2523,
2525,
2534,
2536,
2583,
2585,
2588,
2590,
2598,
2600,
2602,
2604,
2607,
2609,
2634,
2636,
2638,
2640,
2643,
2645,
2647,
2649,
2651,
2653,
2656,
2658,
2677,
2679,
2681,
2683,
2686,
2688,
2704,
2706,
2708,
2710,
2713,
2715,
2718,
2720,
2723,
2748,
2750,
2764,
2767,
2840,
2842,
2916,
2984,
2986,
3049,
3051,
3198,
3200,
3203,
3226,
3228,
3323,
3355,
3357,
3400,
3402,
3440,
3442,
3463,
3465,
3482,
3484,
3515,
3517,
3582,
3584,
3587,
3769,
3771,
3799,
3802,
3892,
3894,
3901,
3904,
3913,
3916,
3962,
3965,
4039,
4042,
4052,
4055,
4063,
4066,
4110,
4112,
4206,
4209,
4234,
4236,
4264,
4267,
4341,
4343,
4350,
4418,
4420,
4429,
4432,
4478,
4481,
4554,
4557,
4567,
4570,
4578,
4581,
4685,
4687,
4762,
4822,
4824,
4827,
4937,
4939,
4953,
4956,
5082,
5084,
5130,
5133,
5149,
5151,
5247,
5250,
5323,
5325,
5419,
5549,
5551,
5562,
5564,
5651,
5653,
5688,
5690,
5804,
5806,
5932,
5934,
5937,
5957,
5959,
5973,
5976,
6100,
6102,
6241,
6375,
6377,
6470,
6472,
6625,
6627,
6783,
6785,
6880,
6882,
6884,
6886,
6908,
6910,
6912,
6914,
7077,
7079,
7081,
7083,
7128,
7130,
7189,
7191,
7375,
7377,
7456,
7458,
7460,
7462,
7595,
7597,
7599,
7601,
7668,
7670,
7672,
7674,
7743,
7745,
7747,
7749,
7805,
7807,
8021,
8023,
8025,
8027,
8052,
8054,
8056,
8058,
8093,
8095,
8097,
8099,
8119,
8121,
8142,
8144,
8173,
8175,
8194,
8196,
8218,
8220,
8222,
8224,
8239,
8241,
8243,
8245,
8259,
8261,
8277,
8279,
8302,
8304,
8350,
8352,
8394,
8396,
8438,
8440,
8455,
8457,
8459,
8461,
8487,
8489,
8491,
8493,
8515,
8517,
8561,
8563,
8583,
8585,
8610,
8612,
8614,
8616,
8725,
8727,
8729,
8731,
8766,
8768,
8770,
8772,
8790,
8792,
8794,
8796,
8817,
8819,
8821,
8823,
8841,
8843,
8845,
8847,
8894,
8896,
8953,
8955,
8957,
8959,
8969,
8971,
8973,
8975,
9025,
9027,
9069,
9071,
9130,
9132,
9187,
9189,
9213,
9215,
9252,
9254,
9291,
9293,
9295,
9297,
9431,
9433,
9435,
9437,
9452,
9454,
9456,
9458,
9530,
9532,
9534,
9536,
9551,
9553,
9555,
9557,
9623,
9625,
9686,
9688,
9690,
9692,
9711,
9713,
9715,
9717,
9747,
9749,
9751,
9753,
9797,
9799,
9801,
9803,
9864,
9866,
9938,
9940,
10004,
10006,
10008,
10010,
10033,
10035,
10037,
10039,
10096,
10098,
10164,
10166,
10257,
10259,
10326,
10328,
10330,
10332,
10349,
10351,
10353,
10355,
10383,
10385,
10387,
10389,
10418,
10420,
10443,
10445,
10447,
10449,
10472,
10474,
10475,
10511,
10512,
10525,
10546,
10547,
10548,
10767,
10768,
10808,
10809,
10818,
10819,
10820,
10845,
10846,
10850,
10851,
10870,
10871,
10998,
10999,
11014,
11015,
11074,
11075,
11085,
11086,
11160,
11161,
11176,
11177,
11205,
11206,
11326,
11327,
11341,
11342,
11370,
11371,
11490,
11491,
11566,
11567,
11577,
11578,
11624,
11625,
11642,
11643,
11659,
11660
],
"line_end_idx": [
15,
16,
33,
34,
51,
52,
83,
111,
162,
212,
228,
257,
259,
266,
269,
279,
281,
504,
507,
784,
786,
878,
881,
985,
987,
995,
998,
1011,
1013,
1042,
1045,
1089,
1091,
1095,
1098,
1168,
1171,
1282,
1285,
1398,
1400,
1423,
1426,
1455,
1457,
1584,
1587,
1600,
1602,
1669,
1777,
1779,
1931,
1957,
1959,
1997,
1999,
2002,
2022,
2024,
2043,
2046,
2088,
2090,
2149,
2152,
2155,
2157,
2220,
2223,
2225,
2310,
2325,
2327,
2342,
2344,
2347,
2349,
2355,
2357,
2397,
2399,
2402,
2404,
2412,
2414,
2416,
2418,
2421,
2423,
2431,
2433,
2435,
2437,
2440,
2442,
2450,
2452,
2518,
2520,
2523,
2525,
2534,
2536,
2583,
2585,
2588,
2590,
2598,
2600,
2602,
2604,
2607,
2609,
2634,
2636,
2638,
2640,
2643,
2645,
2647,
2649,
2651,
2653,
2656,
2658,
2677,
2679,
2681,
2683,
2686,
2688,
2704,
2706,
2708,
2710,
2713,
2715,
2718,
2720,
2723,
2748,
2750,
2764,
2767,
2840,
2842,
2916,
2984,
2986,
3049,
3051,
3198,
3200,
3203,
3226,
3228,
3323,
3355,
3357,
3400,
3402,
3440,
3442,
3463,
3465,
3482,
3484,
3515,
3517,
3582,
3584,
3587,
3769,
3771,
3799,
3802,
3892,
3894,
3901,
3904,
3913,
3916,
3962,
3965,
4039,
4042,
4052,
4055,
4063,
4066,
4110,
4112,
4206,
4209,
4234,
4236,
4264,
4267,
4341,
4343,
4350,
4418,
4420,
4429,
4432,
4478,
4481,
4554,
4557,
4567,
4570,
4578,
4581,
4685,
4687,
4762,
4822,
4824,
4827,
4937,
4939,
4953,
4956,
5082,
5084,
5130,
5133,
5149,
5151,
5247,
5250,
5323,
5325,
5419,
5549,
5551,
5562,
5564,
5651,
5653,
5688,
5690,
5804,
5806,
5932,
5934,
5937,
5957,
5959,
5973,
5976,
6100,
6102,
6241,
6375,
6377,
6470,
6472,
6625,
6627,
6783,
6785,
6880,
6882,
6884,
6886,
6908,
6910,
6912,
6914,
7077,
7079,
7081,
7083,
7128,
7130,
7189,
7191,
7375,
7377,
7456,
7458,
7460,
7462,
7595,
7597,
7599,
7601,
7668,
7670,
7672,
7674,
7743,
7745,
7747,
7749,
7805,
7807,
8021,
8023,
8025,
8027,
8052,
8054,
8056,
8058,
8093,
8095,
8097,
8099,
8119,
8121,
8142,
8144,
8173,
8175,
8194,
8196,
8218,
8220,
8222,
8224,
8239,
8241,
8243,
8245,
8259,
8261,
8277,
8279,
8302,
8304,
8350,
8352,
8394,
8396,
8438,
8440,
8455,
8457,
8459,
8461,
8487,
8489,
8491,
8493,
8515,
8517,
8561,
8563,
8583,
8585,
8610,
8612,
8614,
8616,
8725,
8727,
8729,
8731,
8766,
8768,
8770,
8772,
8790,
8792,
8794,
8796,
8817,
8819,
8821,
8823,
8841,
8843,
8845,
8847,
8894,
8896,
8953,
8955,
8957,
8959,
8969,
8971,
8973,
8975,
9025,
9027,
9069,
9071,
9130,
9132,
9187,
9189,
9213,
9215,
9252,
9254,
9291,
9293,
9295,
9297,
9431,
9433,
9435,
9437,
9452,
9454,
9456,
9458,
9530,
9532,
9534,
9536,
9551,
9553,
9555,
9557,
9623,
9625,
9686,
9688,
9690,
9692,
9711,
9713,
9715,
9717,
9747,
9749,
9751,
9753,
9797,
9799,
9801,
9803,
9864,
9866,
9938,
9940,
10004,
10006,
10008,
10010,
10033,
10035,
10037,
10039,
10096,
10098,
10164,
10166,
10257,
10259,
10326,
10328,
10330,
10332,
10349,
10351,
10353,
10355,
10383,
10385,
10387,
10389,
10418,
10420,
10443,
10445,
10447,
10449,
10472,
10474,
10475,
10511,
10512,
10525,
10546,
10547,
10548,
10767,
10768,
10808,
10809,
10818,
10819,
10820,
10845,
10846,
10850,
10851,
10870,
10871,
10998,
10999,
11014,
11015,
11074,
11075,
11085,
11086,
11160,
11161,
11176,
11177,
11205,
11206,
11326,
11327,
11341,
11342,
11370,
11371,
11490,
11491,
11566,
11567,
11577,
11578,
11624,
11625,
11642,
11643,
11659,
11660,
11669
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 11669,
"ccnet_original_nlines": 527,
"rps_doc_curly_bracket": 0.0005141799920238554,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17487327754497528,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013034029863774776,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4163649380207062,
"rps_doc_frac_unique_words": 0.4055944085121155,
"rps_doc_mean_word_length": 6.615384578704834,
"rps_doc_num_sentences": 204,
"rps_doc_symbol_to_word_ratio": 0.0014482300030067563,
"rps_doc_unigram_entropy": 5.587733745574951,
"rps_doc_word_count": 1287,
"rps_doc_frac_chars_dupe_10grams": 0.09137891232967377,
"rps_doc_frac_chars_dupe_5grams": 0.14587737619876862,
"rps_doc_frac_chars_dupe_6grams": 0.14070941507816315,
"rps_doc_frac_chars_dupe_7grams": 0.12168194353580475,
"rps_doc_frac_chars_dupe_8grams": 0.10500352084636688,
"rps_doc_frac_chars_dupe_9grams": 0.10500352084636688,
"rps_doc_frac_chars_top_2gram": 0.03171246871352196,
"rps_doc_frac_chars_top_3gram": 0.029598310589790344,
"rps_doc_frac_chars_top_4gram": 0.010805729776620865,
"rps_doc_books_importance": -1578.2774658203125,
"rps_doc_books_importance_length_correction": -1578.2774658203125,
"rps_doc_openwebtext_importance": -707.5408325195312,
"rps_doc_openwebtext_importance_length_correction": -707.5408325195312,
"rps_doc_wikipedia_importance": -393.515869140625,
"rps_doc_wikipedia_importance_length_correction": -393.515869140625
},
"fasttext": {
"dclm": 0.8939750790596008,
"english": 0.7126705050468445,
"fineweb_edu_approx": 0.8791152834892273,
"eai_general_math": 0.015018169768154621,
"eai_open_web_math": 0.3973677158355713,
"eai_web_code": 0.013409500010311604
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "1",
"label": "About (Org.)"
}
},
"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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,377,266,933,999,089,000 | Anything related to emoticons or "smileys", i.e. short sequences of ASCII characters (2 or 3 usually) that can be seen as little, stylized faces showing some kind of emotion. Emoticons date back to the origin of the Internet and have been and are used to convey "emotional information" in written ...
learn more… | top users | synonyms
-2
votes
1answer
20 views
How to add emoticon in TextView in Android
I tired for search long time for how to add emoticon in textview . please if you have better sample please give me. or no please help for design .
1
vote
4answers
67 views
Regex matching emoticons
We are working on a project where we want users to be able to use both emoji syntax (like :smile:, :heart:, :confused:,:stuck_out_tongue:) as well as normal emoticons (like :), <3, :/, :p) I'm ...
0
votes
0answers
29 views
Custom emojis and emoji transition between iOS and Android?
I am planning to develop a cross platform chat application.I am facing two issues 1.Create a custom keyboard (iOS) for displaying my own images.Also my image should be shown in my chat bubble in ...
0
votes
0answers
38 views
Using emoticon font in chrome
I've been looking around for a way to display emoticons in Chrome for a webpage I'm making. I found this link: github.com/MorbZ/OpenSansEmoji which provides an .odf file. I was hoping that font would ...
-2
votes
1answer
44 views
How to use emoticon icon in HTML in following scenario?
I've following HTML code : <div id="js_contact_message">Your have been registered successfully</div> With the following emoticon after the word "successfully": How to achieve this? I ...
0
votes
1answer
18 views
Chrome and Apple iphone emoticons in javascript/html
I am displaying strings in javascript/html that have Apple iphone emoticons. Safari handles them. Chrome doesn't. What should I do?
0
votes
1answer
27 views
Developed a Soft Keyboard - How to switch views/service?
I have currently developed a soft keyboard using the InputMethodService. It currently creates a functional QWERTY Keyboard: public class KeyboardIME extends InputMethodService implements ...
0
votes
0answers
25 views
Emojis from phone do not render properly on desktop using PHP
Emojis taken from the iPhone smiley tab shows up as weird squares on desktop. Is there a way to regex the whole sets out?
0
votes
0answers
26 views
How to get the result from a popup inflated activity without dismissing the dialog (Emoji style)?
I am successfully getting the result from a popup inflated activity back to the parent one; however, the dialog box is showing emoticons which needs to stay on screen until the user click back button ...
1
vote
0answers
20 views
flex mobile add emoticons and text
I created a chat program in the mobile project, but I can not add emoticons，I know textarea can not display pictures,So I reluctantly use RichEditableText, it can add a picture, but why can not I ...
1
vote
0answers
25 views
Where can I find a font that supports the emoticons used in the keyboard on mobile devices?
I'm allowing my users to submit the unicode emoticons available on their phones keyboards. I save the characters to the database just fine. But when it comes time to display them it's hit and ...
0
votes
0answers
19 views
emoticons turn into their normal text on activity resume
I implemented emoticons for android based from here: Displaying emoticons in Android I implemented it on a listview. here is my adapter: public View getView(int position, View convertView, ...
1
vote
1answer
65 views
Prevent GitHub for Windows from adding emoticons to my initial commit message
I'm new to git, and to GitHub. I'm using the GitHub for Windows program on Windows 7 64-bit. What I dislike is that when I create a new local repository, the initial change where the .gitattributes ...
0
votes
1answer
47 views
Regular expression replacing only a whole word
I'm trying to modify an addon called ReChat so it supports other emoticons than the default ones. I need to make this regular expression to replace a whole word only I know that you need to add the ...
1
vote
0answers
90 views
How to disable all emoticons in android keyboard
I want to disable all the emoticons i.e smileys, buildings etc in my android keyboard programmatically so that user is unable to see them or enter them. My application is webview based and I have ...
0
votes
1answer
34 views
Xaml Emoticons values not displaying when running
Am working on Universal Windows application and am reading string and if the string contains smiley characters (For eg. 😕) its not getting displayed. But when I try to declare it statically, ...
-1
votes
1answer
117 views
How to set emoticons using unicode
Hi i'm trying to implement emoticons in my chat, i'm using unicode emojis whit my code I am able to show and send emoticons chatMsg.getText().append("\uD83D\uDC30"); this works well.. but the ...
0
votes
0answers
13 views
Extract a set of icons from an image that contains all
I have an image like the one included below. Is it possibile "extract" the icons in it and allocate the extracted bitmap into a drawable resource for use it in my Android application? Thank you for ...
1
vote
0answers
59 views
Posting emoticon from iOS to Facebook via WebAPI
I am facing a problem that I cannot seem to overcome. Context I have an iOS application running on iOS7.0 and greater. In this application, you have the possibility to post pictures with comments. ...
0
votes
1answer
75 views
About Emoticons in android 2.3.7
I'm trying to make a chat app in android, I wanna add emotions in my app.. I used unicode in android 4.4.2 and it worked fine.. But when I try to use it in android 2.3.7 it doesn't work.. So how can ...
0
votes
0answers
63 views
Twitter emoticons in python 3
I'm re-writing my sentiment analysis script in python 3. I need to split the data based on the emoticons in the text. In python 2, I could just look for text emoticons like ":)" for example. However, ...
1
vote
2answers
144 views
How to find a textual description of emoticons, unicode characters and emoji in a string (python, perl)? [closed]
The detection and counting of emoticon icons has been addressed previously. As a follow-up on this question and the solution provided, I'd like extend it with ability to link the detected emoticons, ...
0
votes
1answer
72 views
How to display many images in several specific size windows, separate by tabs in php
In my database query, it returns set of image names. I want to display them in a small size window (say 3x3), if there are more images (>9) it will populate to the next window by a tab or a specific ...
1
vote
0answers
28 views
Wordpress Smilies for certain levels of members
Hello, I am trying to setup my wordpress website with a membership plugin (right now trying Paid Membership Pro), and I am trying to make it where certain membership levels are either are granted ...
0
votes
0answers
78 views
Is it possible to add a custom emoticon set to facebook chat?
We would like a custom emoticon set added to facebook chat. Is there any possible way to make this happen?
0
votes
1answer
47 views
Tinymce emoticon bug, adding a slash
Iam using a Tinymce setup that only uses emoticons for a small reply section on my website. The js plugin itself works fine and is visible within the editor but when it save to the database it shows ...
0
votes
0answers
256 views
Use Whatsapp emoticons in my own app
I'm currently thinking about an app where I need the Whatsapp smileys in my own app. Is there any font type or anything I can install to use exactly them in my app as well? My environment is a ...
0
votes
1answer
121 views
Remove the emoticon key from android kitkat
Is there any way to programatically hide the emoticon key in kitkat keyboard? I have marked the key in the image given below. I need to remove this icon from the keyboard displayed when I tap an ...
0
votes
0answers
163 views
Is it possible to show Smiley/Emoticon/Image span in android notification text?
I'm trying to show smiley(or a image span) in android notification text. And its not working. Anyone know how to do it ? Thanks. Code is below: SpannableStringBuilder builder = new ...
3
votes
2answers
47 views
Replace :D emoticons, except inside “:D”
I have: $txt = ':D :D ":D" :D:D:D:D'; I want to preg_replace all :D to ^ and if ":D" then not replace. ===> output: '^ ^ ":D" ^^^^';
1
vote
1answer
276 views
UITextField custom emoticons ( icons )
I have a little problem: I need to use custom emoticons in uitextfield, as I know - iOS emotions are unicode characters. To write system emoticon I just need to print something like \ue413 and it will ...
1
vote
0answers
25 views
Webiste emoticons implementation [duplicate]
I'm building a website using PHP which supports commenting on posts. I want the users to be able to use smileys in their comments, such as :) :D etc. Now I want to know which is the best practice to ...
0
votes
2answers
135 views
How to get pixel coordinates when CTRunDelegate callbacks are called
I have dynamic text drawn into a custom UIImageView. Text can contain combinations of characters like :-) or ;-), which I'd like to replace with PNG images. I apologize for bunch of codes below. ...
0
votes
2answers
278 views
Android Spannabe Emoji loads slow in GridView and TextView
I am making a little chat in my Android app and I am using emojis (emoticons) that displays in EditText and TextView with SpannableString. For that I made a class (code is below). Also I made a ...
0
votes
0answers
53 views
link detection and emoticon function colliding
i have an emoticon script and a link detector function.the link detector function changes a link (https://www.google.com) to a clickable link but the function collides with the emoticon script . For ...
1
vote
1answer
844 views
Android replace keyboard with Emoji Fragment
I'm making a little chat in my app and I have an Emoticon Fragment (just like the one from whatsapp or telegram). How can I switch between the fragment and the keyboard without any weird animation? I ...
0
votes
0answers
32 views
How to work with Facebook emotions?
I use emoticons on my project. It works well but with another language when I add an emoticon face the mouse cursor goes to the start of the line not after the emoticon. I tried to solve this issue ...
-2
votes
2answers
68 views
mysqli_real_escape_string makes program useless
The code below takes a string protects its using mysqli_real_escape_string. but not geting expected output working fine without the mysqli_real_escape_string but need that for protection. $str = ...
11
votes
4answers
399 views
Remove punctuation but keeping emoticons?
Is that possible to remove all the punctuations but keeping the emoticons such as :-( :) :D :p structure(list(text = structure(c(4L, 6L, 1L, 2L, 5L, 3L), .Label = ...
1
vote
5answers
109 views
what is the character code for ♥ and how to use it?
im creating a emoticon js script and i cant seem to get the character code for ♥ to work ive tried ♥ as the character code but dosen't work any help would be help ful my script ...
0
votes
2answers
469 views
check character and converting emoticon to text? c#
I have list of emoticon in database like this id | emoticon | convert_text 1 | :) | e_happy 2 | :( | e_sad etc. How to check if there are any characters included in the list of ...
0
votes
1answer
313 views
ios and android communication using emoticons
I want to create an app where users can exchange messages. The app will be for both IOS and Android. I know IOS supports Emoticons but android does not. The problem I am facing is if an ios user wants ...
1
vote
0answers
91 views
Replace text to emoticon (on Forumotion)
Forumotion has a limit of kb that the emoticon have, that make impossible many 50 x 50 gifs to be put. A person give me a ccode, but it replace the text for a image by the img alt, and it replaces ...
2
votes
1answer
2k views
Emoticons of whatsapp and telegram
I search smilies / emoticons for my Android App. I found that there are some open source sets available like used by pidgin. But I was wondering about the emoticons used in Whatsapp. They are ...
1
vote
1answer
166 views
Python 2.7 range regex matching unicode emoticons
How to count the number of unicode emoticons in a string using python 2.7 regex? I tried the first answer posted for this question. But it has been showing invalid expression error. ...
1
vote
2answers
893 views
windows phone 8 replace default emoticons
How can one replace the default emoticons in windows phone 8 by custom glypths? Do i have to provide my own font? I know that whatsapp managed to replace the default set with their custom set. If ...
1
vote
0answers
563 views
WhatsApp font for emoticons (unicode, windows)
does anybody know how to render these emoticons in Windows given the unicode charcode? It looks like this icons or font are native to apple (as sayed here) but I don't know which one I can choose to ...
3
votes
2answers
672 views
Detecting if a character in a String is an emoticon (using Android)
Like the title says. I want to find out if a given java String contains an emoticon. I can't use Character.UnicodeBlock.of(char) == Character.UnicodeBlock.EMOTICONS since that requires API level 19. ...
0
votes
0answers
82 views
in Facebook Social Plugin comments , How to allow mentions,Emoticons?
I have a website with Facebook social comments plugin. In comments I want users to be able to mention their friends and invite them to the discussion. Emoticons will also be a nice thing to have. How ...
0
votes
3answers
103 views
php - Replace emoticons in string with images
multiple shortcut keys without new lines without loops function smilies($string) { $emote = array(':)', ':(', ':P', ':D' , '^_^', ';)', ':3', ':*', '<3' ); $emote_replace = ... | {
"url": "http://stackoverflow.com/questions/tagged/emoticons",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "177028",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V74I62R25T4ERERFO7QOPV6EUJMW24JW",
"WARC-Concurrent-To": "<urn:uuid:1d979402-8cd8-4c6b-95d2-433f1c0ccc22>",
"WARC-Date": "2015-01-27T15:01:38Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4HLTRGOIKMVWHUNKWORN2E4IZ37ESFK5",
"WARC-Record-ID": "<urn:uuid:3437411c-3a5b-47a3-bf47-d1881dc2db74>",
"WARC-Target-URI": "http://stackoverflow.com/questions/tagged/emoticons",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6464dc27-2fb9-4e8b-926e-cf0f9d7094a9>"
},
"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,
301,
302,
337,
338,
341,
347,
355,
364,
365,
408,
409,
556,
558,
563,
572,
581,
582,
607,
608,
805,
807,
813,
822,
831,
832,
892,
893,
1092,
1094,
1100,
1109,
1118,
1119,
1149,
1150,
1354,
1357,
1363,
1371,
1380,
1381,
1437,
1438,
1625,
1627,
1633,
1641,
1650,
1651,
1704,
1705,
1837,
1839,
1845,
1853,
1862,
1863,
1920,
1921,
2112,
2114,
2120,
2129,
2138,
2139,
2201,
2202,
2324,
2326,
2332,
2341,
2350,
2351,
2449,
2450,
2654,
2656,
2661,
2670,
2679,
2680,
2715,
2716,
2916,
2918,
2923,
2932,
2941,
2942,
3034,
3035,
3231,
3233,
3239,
3248,
3257,
3258,
3315,
3316,
3509,
3511,
3516,
3524,
3533,
3534,
3612,
3613,
3815,
3817,
3823,
3831,
3840,
3841,
3888,
3889,
4091,
4093,
4098,
4107,
4116,
4117,
4166,
4167,
4367,
4369,
4375,
4383,
4392,
4393,
4443,
4444,
4639,
4642,
4648,
4656,
4666,
4667,
4702,
4703,
4899,
4901,
4907,
4916,
4925,
4926,
4981,
4982,
5184,
5186,
5191,
5200,
5209,
5210,
5259,
5260,
5461,
5463,
5469,
5477,
5486,
5487,
5520,
5521,
5724,
5726,
5732,
5741,
5750,
5751,
5781,
5782,
5986,
5988,
5993,
6002,
6012,
6013,
6127,
6128,
6331,
6333,
6339,
6347,
6356,
6357,
6442,
6443,
6646,
6648,
6653,
6662,
6671,
6672,
6720,
6721,
6921,
6923,
6929,
6938,
6947,
6948,
7010,
7011,
7118,
7120,
7126,
7134,
7143,
7144,
7181,
7182,
7385,
7387,
7393,
7402,
7412,
7413,
7450,
7451,
7648,
7650,
7656,
7664,
7674,
7675,
7719,
7720,
7919,
7921,
7927,
7936,
7946,
7947,
8027,
8028,
8213,
8215,
8221,
8230,
8239,
8240,
8281,
8282,
8415,
8417,
8422,
8430,
8440,
8441,
8480,
8481,
8686,
8688,
8693,
8702,
8711,
8712,
8757,
8758,
8961,
8963,
8969,
8978,
8988,
8989,
9058,
9059,
9258,
9260,
9266,
9275,
9285,
9286,
9345,
9346,
9544,
9546,
9552,
9561,
9570,
9571,
9618,
9619,
9822,
9824,
9829,
9837,
9847,
9848,
9893,
9894,
10098,
10100,
10106,
10115,
10124,
10125,
10161,
10162,
10364,
10367,
10373,
10382,
10391,
10392,
10440,
10441,
10640,
10643,
10649,
10658,
10668,
10669,
10711,
10712,
10879,
10881,
10886,
10895,
10905,
10906,
10958,
10959,
11147,
11149,
11155,
11164,
11174,
11175,
11227,
11228,
11409,
11411,
11417,
11425,
11435,
11436,
11482,
11483,
11688,
11690,
11695,
11704,
11713,
11714,
11755,
11756,
11957,
11959,
11965,
11973,
11982,
11983,
12018,
12019,
12215,
12217,
12222,
12230,
12240,
12241,
12291,
12292,
12478,
12480,
12485,
12494,
12504,
12505,
12547,
12548,
12748,
12750,
12755,
12764,
12774,
12775,
12822,
12823,
13026,
13028,
13034,
13043,
13053,
13054,
13122,
13123,
13326,
13328,
13334,
13343,
13352,
13353,
13423,
13424,
13628,
13630,
13636,
13645,
13655,
13656,
13702,
13703
],
"line_end_idx": [
301,
302,
337,
338,
341,
347,
355,
364,
365,
408,
409,
556,
558,
563,
572,
581,
582,
607,
608,
805,
807,
813,
822,
831,
832,
892,
893,
1092,
1094,
1100,
1109,
1118,
1119,
1149,
1150,
1354,
1357,
1363,
1371,
1380,
1381,
1437,
1438,
1625,
1627,
1633,
1641,
1650,
1651,
1704,
1705,
1837,
1839,
1845,
1853,
1862,
1863,
1920,
1921,
2112,
2114,
2120,
2129,
2138,
2139,
2201,
2202,
2324,
2326,
2332,
2341,
2350,
2351,
2449,
2450,
2654,
2656,
2661,
2670,
2679,
2680,
2715,
2716,
2916,
2918,
2923,
2932,
2941,
2942,
3034,
3035,
3231,
3233,
3239,
3248,
3257,
3258,
3315,
3316,
3509,
3511,
3516,
3524,
3533,
3534,
3612,
3613,
3815,
3817,
3823,
3831,
3840,
3841,
3888,
3889,
4091,
4093,
4098,
4107,
4116,
4117,
4166,
4167,
4367,
4369,
4375,
4383,
4392,
4393,
4443,
4444,
4639,
4642,
4648,
4656,
4666,
4667,
4702,
4703,
4899,
4901,
4907,
4916,
4925,
4926,
4981,
4982,
5184,
5186,
5191,
5200,
5209,
5210,
5259,
5260,
5461,
5463,
5469,
5477,
5486,
5487,
5520,
5521,
5724,
5726,
5732,
5741,
5750,
5751,
5781,
5782,
5986,
5988,
5993,
6002,
6012,
6013,
6127,
6128,
6331,
6333,
6339,
6347,
6356,
6357,
6442,
6443,
6646,
6648,
6653,
6662,
6671,
6672,
6720,
6721,
6921,
6923,
6929,
6938,
6947,
6948,
7010,
7011,
7118,
7120,
7126,
7134,
7143,
7144,
7181,
7182,
7385,
7387,
7393,
7402,
7412,
7413,
7450,
7451,
7648,
7650,
7656,
7664,
7674,
7675,
7719,
7720,
7919,
7921,
7927,
7936,
7946,
7947,
8027,
8028,
8213,
8215,
8221,
8230,
8239,
8240,
8281,
8282,
8415,
8417,
8422,
8430,
8440,
8441,
8480,
8481,
8686,
8688,
8693,
8702,
8711,
8712,
8757,
8758,
8961,
8963,
8969,
8978,
8988,
8989,
9058,
9059,
9258,
9260,
9266,
9275,
9285,
9286,
9345,
9346,
9544,
9546,
9552,
9561,
9570,
9571,
9618,
9619,
9822,
9824,
9829,
9837,
9847,
9848,
9893,
9894,
10098,
10100,
10106,
10115,
10124,
10125,
10161,
10162,
10364,
10367,
10373,
10382,
10391,
10392,
10440,
10441,
10640,
10643,
10649,
10658,
10668,
10669,
10711,
10712,
10879,
10881,
10886,
10895,
10905,
10906,
10958,
10959,
11147,
11149,
11155,
11164,
11174,
11175,
11227,
11228,
11409,
11411,
11417,
11425,
11435,
11436,
11482,
11483,
11688,
11690,
11695,
11704,
11713,
11714,
11755,
11756,
11957,
11959,
11965,
11973,
11982,
11983,
12018,
12019,
12215,
12217,
12222,
12230,
12240,
12241,
12291,
12292,
12478,
12480,
12485,
12494,
12504,
12505,
12547,
12548,
12748,
12750,
12755,
12764,
12774,
12775,
12822,
12823,
13026,
13028,
13034,
13043,
13053,
13054,
13122,
13123,
13326,
13328,
13334,
13343,
13352,
13353,
13423,
13424,
13628,
13630,
13636,
13645,
13655,
13656,
13702,
13703,
13879
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 13879,
"ccnet_original_nlines": 403,
"rps_doc_curly_bracket": 0.00007205000292742625,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3535424768924713,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04547056928277016,
"rps_doc_frac_lines_end_with_ellipsis": 0.11386138945817947,
"rps_doc_frac_no_alph_words": 0.19457173347473145,
"rps_doc_frac_unique_words": 0.2951729893684387,
"rps_doc_mean_word_length": 4.581375598907471,
"rps_doc_num_sentences": 168,
"rps_doc_symbol_to_word_ratio": 0.016919279471039772,
"rps_doc_unigram_entropy": 5.613300800323486,
"rps_doc_word_count": 2341,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04335663840174675,
"rps_doc_frac_chars_dupe_6grams": 0.020792540162801743,
"rps_doc_frac_chars_dupe_7grams": 0.0065268101170659065,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.014545449987053871,
"rps_doc_frac_chars_top_3gram": 0.016969699412584305,
"rps_doc_frac_chars_top_4gram": 0.0036363599356263876,
"rps_doc_books_importance": -1309.92578125,
"rps_doc_books_importance_length_correction": -1309.92578125,
"rps_doc_openwebtext_importance": -730.6272583007812,
"rps_doc_openwebtext_importance_length_correction": -730.6272583007812,
"rps_doc_wikipedia_importance": -524.5325317382812,
"rps_doc_wikipedia_importance_length_correction": -524.5325317382812
},
"fasttext": {
"dclm": 0.06329817324876785,
"english": 0.8841495513916016,
"fineweb_edu_approx": 1.2999552488327026,
"eai_general_math": 0.004654710181057453,
"eai_open_web_math": 0.12607169151306152,
"eai_web_code": 0.0026133100036531687
}
} | {
"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": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
8,818,294,052,211,118,000 | Wifi very unstable on Jetson Nano
I am using a Jetbot that is based on a Jetson Nano.
I have an EDIMAX adapter for the wifi. When I first turn on my Jetson Nano, (with it placed right next to the wifi router) I can ping it from another computer, the ping is low (around 3ms) but with lots of oscillations (up to 600ms). I then run the command to disable the power save mode on wlan0 as suggested numerous times in other issues here, and the problem seems to be solved… for about 10 seconds. After this, I get Network Unreachable.
Does anyone has a fix for this issue? I have tried basically everything I’ve seen on this site and nothing helped
Thanks in advance.
If you get too close to the router it wont work due to too much power. Never try to operate any radio device very close to the reciever unless it is specificly designed for that application. A few feet away should work fine.
I’ve moved it and it made no difference. After a few seconds the connection just drops.
I blacklisted a driver for my adapter (Evimax). Now what happens is that the Wifi runs for a few seconds (running great) then stops running for a few seconds, then it comes back to normal. I don’t know what is causing the issue, and I haven’t seen anyone with a similar problem.
What’s the power supply of your device?
I am just using a power bank. I’ve run some tests; with another Jetson Nano that has a different image. (They were supposed to be the same). With the same hardware, in one of the jetsons the connection works and in the other one it doesn’t. I initially suspected a driver issue but both images have the same drivers. I will try to investigate it further and bring more information here once I have something. I reckon that with the information I’ve given it is impossible to resolve any issue.
Any further information can be provided?
Have you confirmed it’s defect HW problem?
If yes, you may try with RMA: Jetson FAQ | NVIDIA Developer
Hello,
I simply gave up on using the Jetson while connected to wifi. I was to progress by letting it plugged to a ethernet cable while running, but since eventually the project will need it to be on Wi-fi we will maybe look for some other board.
I think the issue can be closed. | {
"url": "https://forums.developer.nvidia.com/t/wifi-very-unstable-on-jetson-nano/178167",
"source_domain": "forums.developer.nvidia.com",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "32868",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AUUREMT5WUGWZ7YT7ZOWEGJKOBR4PGKO",
"WARC-Concurrent-To": "<urn:uuid:b885a5b4-c42f-4f3d-baaa-0f5d907de80a>",
"WARC-Date": "2021-06-20T10:48:35Z",
"WARC-IP-Address": "64.62.250.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UVYOTIY4UU4FC4PH6Y63Z5PQWDDQUZE2",
"WARC-Record-ID": "<urn:uuid:18c438f4-69b0-4d7a-ab94-eb5963e4d709>",
"WARC-Target-URI": "https://forums.developer.nvidia.com/t/wifi-very-unstable-on-jetson-nano/178167",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eb19ce42-1478-46a7-8549-92d3037b4c42>"
},
"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-98.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,
34,
35,
87,
88,
532,
533,
647,
648,
667,
668,
893,
894,
982,
983,
1262,
1263,
1303,
1304,
1798,
1799,
1840,
1883,
1943,
1944,
1951,
1952,
2191,
2192
],
"line_end_idx": [
34,
35,
87,
88,
532,
533,
647,
648,
667,
668,
893,
894,
982,
983,
1262,
1263,
1303,
1304,
1798,
1799,
1840,
1883,
1943,
1944,
1951,
1952,
2191,
2192,
2224
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2224,
"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.47826087474823,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.057971011847257614,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12836438417434692,
"rps_doc_frac_unique_words": 0.49757280945777893,
"rps_doc_mean_word_length": 4.235436916351318,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.002070389920845628,
"rps_doc_unigram_entropy": 4.884740829467773,
"rps_doc_word_count": 412,
"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.022922640666365623,
"rps_doc_frac_chars_top_3gram": 0.018911169841885567,
"rps_doc_frac_chars_top_4gram": 0.01604584977030754,
"rps_doc_books_importance": -225.248779296875,
"rps_doc_books_importance_length_correction": -225.248779296875,
"rps_doc_openwebtext_importance": -134.52703857421875,
"rps_doc_openwebtext_importance_length_correction": -134.52703857421875,
"rps_doc_wikipedia_importance": -100.7083969116211,
"rps_doc_wikipedia_importance_length_correction": -100.7083969116211
},
"fasttext": {
"dclm": 0.06559568643569946,
"english": 0.9640424847602844,
"fineweb_edu_approx": 1.1120004653930664,
"eai_general_math": 0.847756028175354,
"eai_open_web_math": 0.3618440628051758,
"eai_web_code": 0.3672104477882385
}
} | {
"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": "004.0194",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,275,000,541,456,377,600 | 101
Switching Protocols
Resmi
Protokol transmisi diubah atas permintaan klien
Penjelasan umum tentang kode status 101
Bayangkan Anda sedang berada di sebuah restoran dan ingin memesan minuman. Pelayan menghampiri Anda dan menanyakan pesanan Anda. Anda berkata, "Saya ingin segelas air putih, tetapi jika Anda memiliki jus jeruk segar, saya lebih suka itu." Di sini Anda pada dasarnya memberi pelayan dua pilihan dan memberi tahu bahwa Anda fleksibel. Permintaan untuk berpindah protokol juga bekerja dengan cara yang sama.
Ketika browser web atau alat klien lainnya mengirimkan permintaan ke server, klien dapat menyarankan untuk berpindah ke protokol komunikasi yang berbeda karena percaya bahwa protokol yang lain akan lebih efisien atau lebih cocok. Sebagai contoh, klien yang awalnya menggunakan koneksi HTTP mungkin menyarankan untuk beralih ke WebSockets untuk menyediakan koneksi yang selalu terbuka untuk data waktu nyata.
Ketika server menerima saran ini, server akan merespons dengan kode status 101 Switching Protocols untuk memberi tahu klien, "Baiklah! Mari kita beralih protokol." Sejak saat itu, komunikasi antara klien dan server berlanjut melalui protokol baru yang telah disepakati.
Spesifikasi kode status HTTP 101
Kode status 101 Switching Protocols menunjukkan bahwa server memahami dan bersedia memenuhi permintaan klien, melalui bidang header Upgrade, untuk perubahan protokol aplikasi yang digunakan pada koneksi ini. Server HARUS membuat bidang header Upgrade dalam respons yang menunjukkan protokol mana yang akan dialihkan segera setelah baris kosong yang mengakhiri respons 101 Switching Protocols. Diasumsikan bahwa server hanya akan setuju untuk mengganti protokol jika memang menguntungkan. Sebagai contoh, beralih ke versi HTTP yang lebih baru mungkin lebih menguntungkan daripada versi yang lebih lama, dan beralih ke protokol sinkron waktu nyata mungkin lebih menguntungkan ketika mengirimkan sumber daya yang menggunakan fitur tersebut.
Sumber / Kutipan dari: Kode status HTTP 101 Switching Protocols ditentukan oleh bagian 6.2.2 dari RFC7231.
Bagaimana cara melempar kode status 101 dengan PHP?
Untuk melemparkan kode status HTTP 101 pada halaman web, fungsi PHP http_response_code dapat digunakan. Sintaksnya adalah sebagai berikut: http_response_code(101) (PHP 5 >= 5.4.0, PHP 7, PHP 8)
Menguji Kode Status HTTP 101
Untuk dapat menampilkan kode status HTTP (dalam hal ini 101 Switching Protocols) dan informasi lain di sisi klien, konsol pengembangan harus dibuka dengan F12. Kemudian arahkan ke tab "Jaringan". Sekarang halaman dapat dibuka, situs web (contoh index.php) akan terlihat di tab jaringan. Ini harus dipilih dan kemudian bagian Herder harus dipilih. Pengguna kemudian akan melihat hasil berikut:
Kode status 101 Switching Protocols
Ikhtisar
URL: https://http-statuscode.com/errorCodeExample.php?code=101
Status: 101 Switching Protocols
Itu: Network
Alamat IP: XX.XX.XX.XX
Kode status 101 Switching Protocols
Kompatibilitas browser dari kode status 101
Chrome no data
Edge no data
Firefox no data
Opera no data
Safari no data
Chrome Android no data
Firefox for Android no data
Opera Android no data
Safari on iOS no data
Internet no data
WebView Android no data
Konstanta dalam bahasa pemrograman
HttpStatusCode.SwitchingProtocols
http.StatusSwitchingProtocols
Response::HTTP_SWITCHING_PROTOCOLS
httplib.SWITCHING_PROTOCOLS
http.client.SWITCHING_PROTOCOLS
http.HTTPStatus.SWITCHING_PROTOCOLS
:switching_protocols
HttpServletResponse.SC_SWITCHING_PROTOCOLS
Meme yang menghibur tentang kode status HTTP 101
Penulis: Tony Brüser
Penulis: Tony Brüser
Tony Brüser adalah seorang pengembang web yang antusias dengan kegemaran pada kode status HTTP.
LinkedInGitHub | {
"url": "https://http-statuscode.com/id/code/1XX/101",
"source_domain": "http-statuscode.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "113452",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DKK5A36DBAU6BOXS7AVJWREUGZLSXLRB",
"WARC-Concurrent-To": "<urn:uuid:09cb0c99-e466-40e5-a8bb-4b01ec0032f4>",
"WARC-Date": "2024-07-22T02:47:55Z",
"WARC-IP-Address": "134.255.234.72",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IB7VCC73IRIOMNRZTVQ73BWW3SGXBKTA",
"WARC-Record-ID": "<urn:uuid:7ee0878d-d6fb-4b99-8407-79f05e50ed6c>",
"WARC-Target-URI": "https://http-statuscode.com/id/code/1XX/101",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:13bf5fe8-4315-4c51-b404-7938b2281cee>"
},
"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,
4,
5,
25,
26,
32,
80,
81,
121,
122,
527,
528,
936,
937,
1207,
1208,
1241,
1242,
1980,
1981,
2088,
2089,
2141,
2142,
2336,
2337,
2366,
2367,
2760,
2761,
2797,
2806,
2869,
2901,
2914,
2937,
2973,
2974,
3018,
3019,
3034,
3047,
3063,
3077,
3092,
3115,
3143,
3165,
3187,
3204,
3228,
3229,
3264,
3265,
3299,
3329,
3364,
3392,
3424,
3460,
3481,
3525,
3526,
3575,
3576,
3597,
3618,
3619,
3715,
3716
],
"line_end_idx": [
4,
5,
25,
26,
32,
80,
81,
121,
122,
527,
528,
936,
937,
1207,
1208,
1241,
1242,
1980,
1981,
2088,
2089,
2141,
2142,
2336,
2337,
2366,
2367,
2760,
2761,
2797,
2806,
2869,
2901,
2914,
2937,
2973,
2974,
3018,
3019,
3034,
3047,
3063,
3077,
3092,
3115,
3143,
3165,
3187,
3204,
3228,
3229,
3264,
3265,
3299,
3329,
3364,
3392,
3424,
3460,
3481,
3525,
3526,
3575,
3576,
3597,
3618,
3619,
3715,
3716,
3730
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3730,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.023064250126481056,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04612850025296211,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18616144359111786,
"rps_doc_frac_unique_words": 0.4657258093357086,
"rps_doc_mean_word_length": 6.266129016876221,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.017861366271973,
"rps_doc_word_count": 496,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03989703953266144,
"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.04504505172371864,
"rps_doc_frac_chars_top_3gram": 0.06081081181764603,
"rps_doc_frac_chars_top_4gram": 0.043436288833618164,
"rps_doc_books_importance": -349.3401184082031,
"rps_doc_books_importance_length_correction": -349.3401184082031,
"rps_doc_openwebtext_importance": -202.2944793701172,
"rps_doc_openwebtext_importance_length_correction": -202.2944793701172,
"rps_doc_wikipedia_importance": -173.9085235595703,
"rps_doc_wikipedia_importance_length_correction": -173.9085235595703
},
"fasttext": {
"dclm": 0.060636818408966064,
"english": 0.007675999775528908,
"fineweb_edu_approx": 1.7330825328826904,
"eai_general_math": 0.000010370000381954014,
"eai_open_web_math": 0.2944986820220947,
"eai_web_code": 0.5430143475532532
}
} | {
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
2,180,511,571,304,919,300 | 4
$\begingroup$
Shall I construct a stochastic process $X(t)$ such that $X(s+t)-X(s)\sim U(-t,t)$ ? Or is there already any similar formula?
$\endgroup$
1 Answer 1
3
$\begingroup$
Let $U$ be uniform in $[-1,1]$ and let $X_t=Ut$, which is uniform in $[-t,t]$. Then $$X_{t+s}-X_s=U(t+s)-Us=Ut$$ so this works. So it's not so much a stochastic process as just a random variable giving the slope of a line.
$\endgroup$
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://quant.stackexchange.com/questions/36665/is-there-uniform-stochastic-process/36666",
"source_domain": "quant.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "150325",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IXT2S66XKG3JB5VDOAU6D6N2OKK6PROW",
"WARC-Concurrent-To": "<urn:uuid:5a9de32d-6ab0-4731-bace-15d58bdd0e2a>",
"WARC-Date": "2024-05-21T22:24:30Z",
"WARC-IP-Address": "172.64.144.30",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HSRW7A4P2MA6EKRGXHLSSTD75WHOCD7U",
"WARC-Record-ID": "<urn:uuid:351e5e3e-78d5-4aaa-93e6-b3be42875bae>",
"WARC-Target-URI": "https://quant.stackexchange.com/questions/36665/is-there-uniform-stochastic-process/36666",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b9cb8fd3-6d52-47c8-a09d-36d6600e3220>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-29\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
16,
17,
142,
143,
155,
156,
167,
168,
170,
184,
185,
408,
409,
421,
422,
434,
435,
551,
552
],
"line_end_idx": [
2,
16,
17,
142,
143,
155,
156,
167,
168,
170,
184,
185,
408,
409,
421,
422,
434,
435,
551,
552,
642
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 642,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0.0031152600422501564,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33142855763435364,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04571428894996643,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.33142855763435364,
"rps_doc_frac_unique_words": 0.7549019455909729,
"rps_doc_mean_word_length": 4.470588207244873,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.256214141845703,
"rps_doc_word_count": 102,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04824560880661011,
"rps_doc_frac_chars_top_3gram": 0.07894737273454666,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -80.05227661132812,
"rps_doc_books_importance_length_correction": -90.54839324951172,
"rps_doc_openwebtext_importance": -43.218116760253906,
"rps_doc_openwebtext_importance_length_correction": -53.714229583740234,
"rps_doc_wikipedia_importance": -34.008174896240234,
"rps_doc_wikipedia_importance_length_correction": -44.50428771972656
},
"fasttext": {
"dclm": 0.8589848875999451,
"english": 0.8624945878982544,
"fineweb_edu_approx": 0.8978613018989563,
"eai_general_math": -0.000010009999641624745,
"eai_open_web_math": 0.025870680809020996,
"eai_web_code": -0.000010009999641624745
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "-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": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,462,428,769,323,832,000 | Arch manual pages
CLOCK_GETRES(3P) POSIX Programmer's Manual CLOCK_GETRES(3P)
This manual page is part of the POSIX Programmer's Manual. The Linux implementation of this interface may differ (consult the corresponding Linux manual page for details of Linux behavior), or the interface may not be implemented on Linux.
clock_getres, clock_gettime, clock_settime — clock and timer functions
#include <time.h>
int clock_getres(clockid_t clock_id, struct timespec *res);
int clock_gettime(clockid_t clock_id, struct timespec *tp);
int clock_settime(clockid_t clock_id, const struct timespec *tp);
The clock_getres() function shall return the resolution of any clock. Clock resolutions are implementation-defined and cannot be set by a process. If the argument res is not NULL, the resolution of the specified clock shall be stored in the location pointed to by res. If res is NULL, the clock resolution is not returned. If the time argument of clock_settime() is not a multiple of res, then the value is truncated to a multiple of res.
The clock_gettime() function shall return the current value tp for the specified clock, clock_id.
The clock_settime() function shall set the specified clock, clock_id, to the value specified by tp. Time values that are between two consecutive non-negative integer multiples of the resolution of the specified clock shall be truncated down to the smaller multiple of the resolution.
A clock may be system-wide (that is, visible to all processes) or per-process (measuring time that is meaningful only within a process). All implementations shall support a clock_id of CLOCK_REALTIME as defined in <time.h>. This clock represents the clock measuring real time for the system. For this clock, the values returned by clock_gettime() and specified by clock_settime() represent the amount of time (in seconds and nanoseconds) since the Epoch. An implementation may also support additional clocks. The interpretation of time values for these clocks is unspecified.
If the value of the CLOCK_REALTIME clock is set via clock_settime(), the new value of the clock shall be used to determine the time of expiration for absolute time services based upon the CLOCK_REALTIME clock. This applies to the time at which armed absolute timers expire. If the absolute time requested at the invocation of such a time service is before the new value of the clock, the time service shall expire immediately as if the clock had reached the requested time normally.
Setting the value of the CLOCK_REALTIME clock via clock_settime() shall have no effect on threads that are blocked waiting for a relative time service based upon this clock, including the nanosleep() function; nor on the expiration of relative timers based upon this clock. Consequently, these time services shall expire when the requested relative interval elapses, independently of the new or old value of the clock.
If the Monotonic Clock option is supported, all implementations shall support a clock_id of CLOCK_MONOTONIC defined in <time.h>. This clock represents the monotonic clock for the system. For this clock, the value returned by clock_gettime() represents the amount of time (in seconds and nanoseconds) since an unspecified point in the past (for example, system start-up time, or the Epoch). This point does not change after system start-up time. The value of the CLOCK_MONOTONIC clock cannot be set via clock_settime(). This function shall fail if it is invoked with a clock_id argument of CLOCK_MONOTONIC.
The effect of setting a clock via clock_settime() on armed per-process timers associated with a clock other than CLOCK_REALTIME is implementation-defined.
If the value of the CLOCK_REALTIME clock is set via clock_settime(), the new value of the clock shall be used to determine the time at which the system shall awaken a thread blocked on an absolute clock_nanosleep() call based upon the CLOCK_REALTIME clock. If the absolute time requested at the invocation of such a time service is before the new value of the clock, the call shall return immediately as if the clock had reached the requested time normally.
Setting the value of the CLOCK_REALTIME clock via clock_settime() shall have no effect on any thread that is blocked on a relative clock_nanosleep() call. Consequently, the call shall return when the requested relative interval elapses, independently of the new or old value of the clock.
Appropriate privileges to set a particular clock are implementation-defined.
If _POSIX_CPUTIME is defined, implementations shall support clock ID values obtained by invoking clock_getcpuclockid(), which represent the CPU-time clock of a given process. Implementations shall also support the special clockid_t value CLOCK_PROCESS_CPUTIME_ID, which represents the CPU-time clock of the calling process when invoking one of the clock_*() or timer_*() functions. For these clock IDs, the values returned by clock_gettime() and specified by clock_settime() represent the amount of execution time of the process associated with the clock. Changing the value of a CPU-time clock via clock_settime() shall have no effect on the behavior of the sporadic server scheduling policy (see Scheduling Policies).
If _POSIX_THREAD_CPUTIME is defined, implementations shall support clock ID values obtained by invoking pthread_getcpuclockid(), which represent the CPU-time clock of a given thread. Implementations shall also support the special clockid_t value CLOCK_THREAD_CPUTIME_ID, which represents the CPU-time clock of the calling thread when invoking one of the clock_*() or timer_*() functions. For these clock IDs, the values returned by clock_gettime() and specified by clock_settime() shall represent the amount of execution time of the thread associated with the clock. Changing the value of a CPU-time clock via clock_settime() shall have no effect on the behavior of the sporadic server scheduling policy (see Scheduling Policies).
A return value of 0 shall indicate that the call succeeded. A return value of −1 shall indicate that an error occurred, and errno shall be set to indicate the error.
The clock_getres(), clock_gettime(), and clock_settime() functions shall fail if:
EINVAL
The clock_id argument does not specify a known clock.
The clock_gettime() function shall fail if:
EOVERFLOW
The number of seconds will not fit in an object of type time_t.
The clock_settime() function shall fail if:
EINVAL
The tp argument to clock_settime() is outside the range for the given clock ID.
EINVAL
The tp argument specified a nanosecond value less than zero or greater than or equal to 1000 million.
EINVAL
The value of the clock_id argument is CLOCK_MONOTONIC.
The clock_settime() function may fail if:
EPERM
The requesting process does not have appropriate privileges to set the specified clock.
The following sections are informative.
None.
Note that the absolute value of the monotonic clock is meaningless (because its origin is arbitrary), and thus there is no need to set it. Furthermore, realtime applications can rely on the fact that the value of this clock is never set and, therefore, that time intervals measured with this clock will not be affected by calls to clock_settime().
None.
None.
Scheduling Policies, clock_getcpuclockid(), clock_nanosleep(), ctime(), mq_receive(), mq_send(), nanosleep(), pthread_mutex_timedlock(), sem_timedwait(), time(), timer_create(), timer_getoverrun()
The Base Definitions volume of POSIX.1‐2008, <time.h>
Portions of this text are reprinted and reproduced in electronic form from IEEE Std 1003.1, 2013 Edition, Standard for Information Technology -- Portable Operating System Interface (POSIX), The Open Group Base Specifications Issue 7, Copyright (C) 2013 by the Institute of Electrical and Electronics Engineers, Inc and The Open Group. (This is POSIX.1-2008 with the 2013 Technical Corrigendum 1 applied.) In the event of any discrepancy between this version and the original IEEE and The Open Group Standard, the original IEEE and The Open Group Standard is the referee document. The original Standard can be obtained online at http://www.unix.org/online.html .
Any typographical or formatting errors that appear in this page are most likely to have been introduced during the conversion of the source files to man page format. To report such errors, see https://www.kernel.org/doc/man-pages/reporting_bugs.html .
2013 IEEE/The Open Group | {
"url": "https://jlk.fjfi.cvut.cz/arch/manpages/man/core/man-pages/clock_getres.3p.en",
"source_domain": "jlk.fjfi.cvut.cz",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "15666",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3MEVLJTCWVHHYUB6T5WT3LSQGM6PQNH4",
"WARC-Concurrent-To": "<urn:uuid:c32aecab-533e-47e9-9012-75524302b06a>",
"WARC-Date": "2019-07-22T12:10:36Z",
"WARC-IP-Address": "147.32.8.170",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LLAVK432PGS2UWTZ3DTB27Y7K3B7GWWJ",
"WARC-Record-ID": "<urn:uuid:358788f6-fc87-4480-a480-df147b6783a5>",
"WARC-Target-URI": "https://jlk.fjfi.cvut.cz/arch/manpages/man/core/man-pages/clock_getres.3p.en",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:29952c1b-935e-44ca-8a41-29ee016fbf3b>"
},
"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,
18,
19,
79,
80,
320,
321,
392,
393,
411,
471,
531,
597,
598,
1037,
1038,
1136,
1137,
1421,
1422,
1998,
1999,
2482,
2483,
2902,
2903,
3509,
3510,
3665,
3666,
4124,
4125,
4414,
4415,
4492,
4493,
5213,
5214,
5945,
5946,
6112,
6113,
6195,
6202,
6256,
6257,
6301,
6302,
6312,
6376,
6377,
6421,
6422,
6429,
6509,
6516,
6618,
6625,
6680,
6681,
6723,
6724,
6730,
6818,
6819,
6859,
6860,
6866,
6867,
7215,
7216,
7222,
7223,
7229,
7230,
7427,
7428,
7482,
7483,
8145,
8146,
8398,
8399
],
"line_end_idx": [
18,
19,
79,
80,
320,
321,
392,
393,
411,
471,
531,
597,
598,
1037,
1038,
1136,
1137,
1421,
1422,
1998,
1999,
2482,
2483,
2902,
2903,
3509,
3510,
3665,
3666,
4124,
4125,
4414,
4415,
4492,
4493,
5213,
5214,
5945,
5946,
6112,
6113,
6195,
6202,
6256,
6257,
6301,
6302,
6312,
6376,
6377,
6421,
6422,
6429,
6509,
6516,
6618,
6625,
6680,
6681,
6723,
6724,
6730,
6818,
6819,
6859,
6860,
6866,
6867,
7215,
7216,
7222,
7223,
7229,
7230,
7427,
7428,
7482,
7483,
8145,
8146,
8398,
8399,
8423
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8423,
"ccnet_original_nlines": 82,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3861709237098694,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0326157882809639,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1630789339542389,
"rps_doc_frac_unique_words": 0.26236045360565186,
"rps_doc_mean_word_length": 5.359649181365967,
"rps_doc_num_sentences": 75,
"rps_doc_symbol_to_word_ratio": 0.000652319984510541,
"rps_doc_unigram_entropy": 4.89780855178833,
"rps_doc_word_count": 1254,
"rps_doc_frac_chars_dupe_10grams": 0.23404255509376526,
"rps_doc_frac_chars_dupe_5grams": 0.3611069917678833,
"rps_doc_frac_chars_dupe_6grams": 0.3462282419204712,
"rps_doc_frac_chars_dupe_7grams": 0.3462282419204712,
"rps_doc_frac_chars_dupe_8grams": 0.31602439284324646,
"rps_doc_frac_chars_dupe_9grams": 0.24520160257816315,
"rps_doc_frac_chars_top_2gram": 0.021574169397354126,
"rps_doc_frac_chars_top_3gram": 0.01934235915541649,
"rps_doc_frac_chars_top_4gram": 0.011605420149862766,
"rps_doc_books_importance": -733.6158447265625,
"rps_doc_books_importance_length_correction": -733.6158447265625,
"rps_doc_openwebtext_importance": -467.3840026855469,
"rps_doc_openwebtext_importance_length_correction": -467.3840026855469,
"rps_doc_wikipedia_importance": -308.72174072265625,
"rps_doc_wikipedia_importance_length_correction": -308.72174072265625
},
"fasttext": {
"dclm": 0.15133196115493774,
"english": 0.8255873322486877,
"fineweb_edu_approx": 2.0461487770080566,
"eai_general_math": 0.8538865447044373,
"eai_open_web_math": 0.46696776151657104,
"eai_web_code": 0.7315940856933594
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.27",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
3,904,890,414,710,629,000 | LOADING...
Log in and
comment
Username or Email
Password
Forgot password?
Or
Join and
publish
You're almost done! Define a user name and password.
Username
Email
Password
Senha
Register
Search:
User: BobAckerley
Page 1 of 20 1 2 3 4
Search: Search took 0.06 seconds; generated 7 minute(s) ago.
1. The double heat dissipation is the feature for...
The double heat dissipation is the feature for the K20 Pro. For gaming lovers, it's not only the best thing to happen, but it'll give them longer hours of sessions too!
2. Did anyone watch the video? The prototype and...
Did anyone watch the video? The prototype and renders are excellent from Intel.
3. But on the RAM side, the 12GB RAM model could...
But on the RAM side, the 12GB RAM model could make a cool competition for the OnePlus 7 Pro model as both come with the same variant too.
4. This is the umpteenth time that the renders are...
This is the umpteenth time that the renders are appearing online showcasing the placement of the rear cameras.
5. The good thing here is the fact that the...
The good thing here is the fact that the employees are now getting increased pay. For a company like Amazon that deals in billions of dollars per year, it's vital that they take of the people who...
6. I believe, if the news is coming from none other...
I believe, if the news is coming from none other than Jongpil Jung, it's very likely that we will soon see a new Chromebook from Samsung.
7. What we generally see is the launch announcement...
What we generally see is the launch announcement taking place on a certain day. But here, OnePlus has first announced that announcement will take place on April 23.
8. It's in the better interest of users of either...
It's in the better interest of users of either service. It's always good to see companies ending spats for that reason alone.
9. The Kirin 980 will be powering all the three...
The Kirin 980 will be powering all the three phones? Even the Lite variant??
10. What's the phone going to cost? And please...
What's the phone going to cost? And please provide a few more features and what the specs would be like.
11. Most time we take it for granted that having a 5G...
Most time we take it for granted that having a 5G variant of a model will mean just that extra 5G support, with everything else remaining as it is.
12. How do they calculate it? When there are, say, 10...
How do they calculate it? When there are, say, 10 phones running the Snapdragon 855, what makes the Red Nubia 3 as the fastest on the Snapdragon 855?
13. Oh God... this feature... I'd love to use it. But...
Oh God... this feature... I'd love to use it. But isn't helping me though, it needs your phone running Android Oreo or higher :( :(
14. Though both phones are now discontinued, it still...
Though both phones are now discontinued, it still is a great development to know that OP is offering the the latest Android major version.
15. LOL... True. Otherwise, the 48MP+13MP+8MP along...
LOL... True. Otherwise, the 48MP+13MP+8MP along with the features mentioned here wouldn't have spoken for themselves.
16. I think there's no point in asking Google to...
I think there's no point in asking Google to comment on this ban. They just rightly follow the local laws as they should be doing.
17. The A70 is priced at less than 30K and is a good...
The A70 is priced at less than 30K and is a good competitive price. Actually anything less than that works.
18. And the battery is accompanied by a fast charging...
And the battery is accompanied by a fast charging support too. 25W for the Galaxy A70 is quite thrilling.
19. That should be still well off. 6GB RAM should...
That should be still well off. 6GB RAM should deliver smooth functioning, at least with the Kirin 710 SoC. But yes, still there should be at least one option in the form of 4GB RAM.
20. Like one's here - will the taking the screenshot...
Like one's here - will the taking the screenshot feature be blocked forever or will there be any workaround for that?
21. It's a huge breakthrough to not only come to...
It's a huge breakthrough to not only come to conclusion, but also for studying further about the mysterious black hole.
22. Yeah true. Either way, I don't install the beta...
Yeah true. Either way, I don't install the beta version, for obvious reasons. So if I'm getting the stable version yet, I'm not out of luck!!!
23. I went through a few posts explaining. It's a bit...
I went through a few posts explaining. It's a bit confusing. Dual Active, Dual Standby? Single Standby, Dual Standby...
24. Any more details on the "Magnifying glass"...
Any more details on the "Magnifying glass" feature? I mean will it blur any image if I'm using it to view one?
25. After the introduction of the Huawei P30 series,...
After the introduction of the Huawei P30 series, especially the Pro variant, it's not only about clicking photos and shooting videos. It's all about zooming now.
Results 1 to 25 of 500
Page 1 of 20 1 2 3 4 | {
"url": "https://www.mobilescout.com/forum/search.php?s=52d3262399e46b6becb959d10010cc46&searchid=2909821",
"source_domain": "www.mobilescout.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "73722",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5O7ORDJ2GHMDMCKK3RENG7SYBC2DXOXN",
"WARC-Concurrent-To": "<urn:uuid:23b5a17c-795b-4cd0-9604-70eb3ec74646>",
"WARC-Date": "2019-06-25T11:27:40Z",
"WARC-IP-Address": "151.101.249.208",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:TW2VDYIVEYWINPI33VWMBTWXZLDWVFBA",
"WARC-Record-ID": "<urn:uuid:df95cb8b-8d3c-4aa9-bd8c-78cfd4ea2e64>",
"WARC-Target-URI": "https://www.mobilescout.com/forum/search.php?s=52d3262399e46b6becb959d10010cc46&searchid=2909821",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3909590f-5505-4f55-9c05-fc09d8c5db2e>"
},
"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-43-180-109.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,
11,
22,
30,
48,
57,
74,
77,
86,
94,
147,
156,
162,
171,
177,
186,
187,
195,
196,
214,
215,
236,
237,
298,
299,
354,
355,
528,
582,
583,
667,
721,
722,
864,
920,
921,
1036,
1085,
1086,
1289,
1346,
1347,
1489,
1546,
1547,
1716,
1771,
1772,
1902,
1955,
1956,
2037,
2089,
2090,
2199,
2258,
2259,
2411,
2470,
2471,
2625,
2684,
2685,
2821,
2880,
2881,
3024,
3081,
3082,
3204,
3258,
3259,
3394,
3452,
3453,
3565,
3624,
3625,
3735,
3790,
3791,
3977,
4035,
4036,
4158,
4212,
4213,
4337,
4394,
4395,
4542,
4601,
4602,
4726,
4778,
4779,
4894,
4952,
4953,
5119,
5142
],
"line_end_idx": [
11,
22,
30,
48,
57,
74,
77,
86,
94,
147,
156,
162,
171,
177,
186,
187,
195,
196,
214,
215,
236,
237,
298,
299,
354,
355,
528,
582,
583,
667,
721,
722,
864,
920,
921,
1036,
1085,
1086,
1289,
1346,
1347,
1489,
1546,
1547,
1716,
1771,
1772,
1902,
1955,
1956,
2037,
2089,
2090,
2199,
2258,
2259,
2411,
2470,
2471,
2625,
2684,
2685,
2821,
2880,
2881,
3024,
3081,
3082,
3204,
3258,
3259,
3394,
3452,
3453,
3565,
3624,
3625,
3735,
3790,
3791,
3977,
4035,
4036,
4158,
4212,
4213,
4337,
4394,
4395,
4542,
4601,
4602,
4726,
4778,
4779,
4894,
4952,
4953,
5119,
5142,
5162
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5162,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.417553186416626,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.042553190141916275,
"rps_doc_frac_lines_end_with_ellipsis": 0.2772277295589447,
"rps_doc_frac_no_alph_words": 0.21808511018753052,
"rps_doc_frac_unique_words": 0.4055555462837219,
"rps_doc_mean_word_length": 4.234444618225098,
"rps_doc_num_sentences": 117,
"rps_doc_symbol_to_word_ratio": 0.030141839757561684,
"rps_doc_unigram_entropy": 5.360568523406982,
"rps_doc_word_count": 900,
"rps_doc_frac_chars_dupe_10grams": 0.13434794545173645,
"rps_doc_frac_chars_dupe_5grams": 0.49094724655151367,
"rps_doc_frac_chars_dupe_6grams": 0.49094724655151367,
"rps_doc_frac_chars_dupe_7grams": 0.47257938981056213,
"rps_doc_frac_chars_dupe_8grams": 0.45473629236221313,
"rps_doc_frac_chars_dupe_9grams": 0.3272107243537903,
"rps_doc_frac_chars_top_2gram": 0.010495929978787899,
"rps_doc_frac_chars_top_3gram": 0.0036735800094902515,
"rps_doc_frac_chars_top_4gram": 0.004723169840872288,
"rps_doc_books_importance": -504.0848388671875,
"rps_doc_books_importance_length_correction": -504.0848388671875,
"rps_doc_openwebtext_importance": -314.9853515625,
"rps_doc_openwebtext_importance_length_correction": -314.9853515625,
"rps_doc_wikipedia_importance": -193.0823974609375,
"rps_doc_wikipedia_importance_length_correction": -193.0823974609375
},
"fasttext": {
"dclm": 0.1529407501220703,
"english": 0.9449877738952637,
"fineweb_edu_approx": 1.1250044107437134,
"eai_general_math": 0.07400994747877121,
"eai_open_web_math": 0.22555631399154663,
"eai_web_code": 0.01534717995673418
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "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": "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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
2,710,029,328,576,125,000 |
java - 如何将堆栈跟踪转换为字符串？
13 Answers
使用Throwable.printStackTrace（PrintWriter pw）将堆栈跟踪发送到适当的写入器。
import java.io.StringWriter;
import java.io.PrintWriter;
// ...
StringWriter sw = new StringWriter();
PrintWriter pw = new PrintWriter(sw);
e.printStackTrace(pw);
String sStackTrace = sw.toString(); // stack trace as a string
System.out.println(sStackTrace);
java stack-trace tostring
Throwable.getStackTrace()的结果转换为描述堆栈跟踪的字符串的最简单方法是什么？
如果您正在为Android开发，则更简单的方法是使用此操作：
import android.util.Log;
String stackTrace = Log.getStackTraceString(exception);
格式与getStacktrace相同，例如
09-24 16:09:07.042: I/System.out(4844): java.lang.NullPointerException
09-24 16:09:07.042: I/System.out(4844): at com.temp.ttscancel.MainActivity.onCreate(MainActivity.java:43)
09-24 16:09:07.042: I/System.out(4844): at android.app.Activity.performCreate(Activity.java:5248)
09-24 16:09:07.043: I/System.out(4844): at android.app.Instrumentation.callActivityOnCreate(Instrumentation.java:1110)
09-24 16:09:07.043: I/System.out(4844): at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:2162)
09-24 16:09:07.043: I/System.out(4844): at android.app.ActivityThread.handleLaunchActivity(ActivityThread.java:2257)
09-24 16:09:07.043: I/System.out(4844): at android.app.ActivityThread.access$800(ActivityThread.java:139)
09-24 16:09:07.043: I/System.out(4844): at android.app.ActivityThread$H.handleMessage(ActivityThread.java:1210)
09-24 16:09:07.043: I/System.out(4844): at android.os.Handler.dispatchMessage(Handler.java:102)
09-24 16:09:07.043: I/System.out(4844): at android.os.Looper.loop(Looper.java:136)
09-24 16:09:07.044: I/System.out(4844): at android.app.ActivityThread.main(ActivityThread.java:5097)
09-24 16:09:07.044: I/System.out(4844): at java.lang.reflect.Method.invokeNative(Native Method)
09-24 16:09:07.044: I/System.out(4844): at java.lang.reflect.Method.invoke(Method.java:515)
09-24 16:09:07.044: I/System.out(4844): at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:785)
09-24 16:09:07.044: I/System.out(4844): at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:601)
以下代码允许您以String格式获取整个stackTrace，而不使用像log4J或甚至java.util.Logger这样的API：
catch (Exception e) {
StackTraceElement[] stack = e.getStackTrace();
String exception = "";
for (StackTraceElement s : stack) {
exception = exception + s.toString() + "\n\t\t";
}
System.out.println(exception);
// then you can send the exception string to a external file.
}
这是一个可直接复制到代码中的版本：
import java.io.StringWriter;
import java.io.PrintWriter;
//Two lines of code to get the exception into a StringWriter
StringWriter sw = new StringWriter();
new Throwable().printStackTrace(new PrintWriter(sw));
//And to actually print it
logger.info("Current stack trace is:\n" + sw.toString());
或者，在一个catch块
} catch (Throwable t) {
StringWriter sw = new StringWriter();
t.printStackTrace(new PrintWriter(sw));
logger.info("Current stack trace is:\n" + sw.toString());
}
没有java.io.*可以这样做。
String trace = e.toString() + "\n";
for (StackTraceElement e1 : e.getStackTrace()) {
trace += "\t at " + e1.toString() + "\n";
}
然后trace变量保存你的堆栈跟踪。 输出也包含初始原因，输出与printStackTrace()相同
例如， printStackTrace()产生：
java.io.FileNotFoundException: / (Is a directory)
at java.io.FileOutputStream.open0(Native Method)
at java.io.FileOutputStream.open(FileOutputStream.java:270)
at java.io.FileOutputStream.<init>(FileOutputStream.java:213)
at java.io.FileOutputStream.<init>(FileOutputStream.java:101)
at Test.main(Test.java:9)
trace字符串保持，当打印到stdout
java.io.FileNotFoundException: / (Is a directory)
at java.io.FileOutputStream.open0(Native Method)
at java.io.FileOutputStream.open(FileOutputStream.java:270)
at java.io.FileOutputStream.<init>(FileOutputStream.java:213)
at java.io.FileOutputStream.<init>(FileOutputStream.java:101)
at Test.main(Test.java:9)
科特林
扩展Throwable类将为您提供String属性error.stackTraceString
val Throwable.stackTraceString: String
get() {
val sw = StringWriter()
val pw = PrintWriter(sw)
this.printStackTrace(pw)
return sw.toString()
}
第一组评论中的聪明狙击非常有趣，但这取决于你想要做什么。 如果你还没有正确的库，那么3行代码（如D. Wroblewski的答案）是完美的。 OTOH，如果你已经有了apache.commons库（就像大多数大项目一样），那么Amar的答案就更短了。 好吧，可能需要10分钟才能获得库并正确安装（如果您知道自己在做什么，可以少于1分钟）。 但时钟在滴答滴答，所以你可能没有时间空闲。 JarekPrzygódzki有一个有趣的警告 - “如果你不需要嵌套异常”。
但是如果我确实需要完整的堆栈跟踪，嵌套和全部？ 在这种情况下，秘诀是使用apache.common的getFullStackTrace（请参阅http://commons.apache.org/proper/commons-lang/javadocs/api-2.6/org/apache/commons/lang/exception/ExceptionUtils.html#getFullStackTrace%28java.lang.Throwable%29
它拯救了我的培根。 谢谢，阿马尔，提示！
Gala的答案扩大了，这也将包括例外的原因：
private String extrapolateStackTrace(Exception ex) {
Throwable e = ex;
String trace = e.toString() + "\n";
for (StackTraceElement e1 : e.getStackTrace()) {
trace += "\t at " + e1.toString() + "\n";
}
while (e.getCause() != null) {
e = e.getCause();
trace += "Cause by: " + e.toString() + "\n";
for (StackTraceElement e1 : e.getStackTrace()) {
trace += "\t at " + e1.toString() + "\n";
}
}
return trace;
}
老问题，但我只想添加特殊情况，你不想打印所有的堆栈 ，删除一些你不感兴趣的部分，排除某些类或包。
而不是PrintWriter使用SelectivePrintWriter
// This filters out this package and up.
String packageNameToFilter = "org.springframework";
StringWriter sw = new StringWriter();
PrintWriter pw = new SelectivePrintWriter(sw, packageNameToFilter);
e.printStackTrace(pw);
String sStackTrace = sw.toString();
System.out.println(sStackTrace);
其中SelectivePrintWriter类由以下项提供：
public class SelectivePrintWriter extends PrintWriter {
private boolean on = true;
private static final String AT = "\tat";
private String internal;
public SelectivePrintWriter(Writer out, String packageOrClassName) {
super(out);
internal = "\tat " + packageOrClassName;
}
public void println(Object obj) {
if (obj instanceof String) {
String txt = (String) obj;
if (!txt.startsWith(AT)) on = true;
else if (txt.startsWith(internal)) on = false;
if (on) super.println(txt);
} else {
super.println(obj);
}
}
}
请注意，这个类可以很容易地通过正则表达式， contains或其他标准进行过滤。 还要注意它取决于Throwable实现细节（不太可能改变，但仍然）。
警告：这可能有点偏离主题，但是哦...;）
我不知道最初的海报原因是什么原因是希望首先将堆栈跟踪作为字符串使用。 当堆栈跟踪应该在SLF4J / Logback LOG中结束时，但是这里没有或者应该抛出异常：
public void remove(List<String> ids) {
if(ids == null || ids.isEmpty()) {
LOG.warn(
"An empty list (or null) was passed to {}.remove(List). " +
"Clearly, this call is unneccessary, the caller should " +
"avoid making it. A stacktrace follows.",
getClass().getName(),
new Throwable ("Stacktrace")
);
return;
}
// actual work, remove stuff
}
我喜欢它，因为它不需要外部库（当然，除了日志记录的后端，无论如何大部分时间都会到位）。
解决方案是将数组的stackTrace转换为字符串数据类型。 看下面的例子：
import java.util.Arrays;
try{
}catch(Exception ex){
String stack = Arrays.toString(ex.getStackTrace());
System.out.println("stack "+ stack);
}
将堆栈跟踪打印到PrintStream，然后将其转换为字符串
// ...
catch (Exception e)
{
ByteArrayOutputStream out = new ByteArrayOutputStream();
e.printStackTrace(new PrintStream(out));
System.out.println(new String(out.toByteArray()));
}
Related | {
"url": "http://code.i-harness.com/zh-CN/q/118b07",
"source_domain": "code.i-harness.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "37995",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4BX7PHL2LXXRT3S7TFA62RS2NE6DEL4D",
"WARC-Concurrent-To": "<urn:uuid:91e25fe9-d78b-4e3f-a418-5d57635d9eb4>",
"WARC-Date": "2019-01-20T00:26:41Z",
"WARC-IP-Address": "163.43.80.109",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BL5R2XRO6FHV5WOFTI53CRLIBTAGCA4A",
"WARC-Record-ID": "<urn:uuid:efcf729d-d53d-4e31-8508-a8618b30103b>",
"WARC-Target-URI": "http://code.i-harness.com/zh-CN/q/118b07",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d80a2d2d-2ee4-4083-82aa-082d5762c0ab>"
},
"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-179-240-231.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,
1,
23,
24,
25,
26,
27,
38,
39,
98,
99,
128,
156,
157,
164,
165,
203,
241,
264,
327,
360,
386,
387,
439,
440,
441,
442,
443,
474,
475,
500,
501,
558,
559,
581,
582,
653,
761,
861,
982,
1102,
1221,
1329,
1443,
1541,
1626,
1729,
1827,
1921,
2046,
2152,
2153,
2154,
2155,
2156,
2157,
2158,
2226,
2227,
2249,
2300,
2327,
2367,
2424,
2430,
2465,
2531,
2533,
2534,
2535,
2536,
2554,
2555,
2585,
2613,
2614,
2675,
2713,
2767,
2768,
2795,
2853,
2854,
2867,
2868,
2892,
2934,
2978,
3040,
3042,
3043,
3044,
3045,
3063,
3064,
3121,
3122,
3171,
3217,
3222,
3223,
3275,
3276,
3301,
3302,
3352,
3405,
3469,
3535,
3601,
3631,
3632,
3654,
3655,
3705,
3759,
3824,
3891,
3958,
3989,
3990,
3991,
3992,
3996,
3997,
4045,
4046,
4085,
4095,
4123,
4152,
4181,
4206,
4210,
4211,
4212,
4213,
4445,
4446,
4677,
4678,
4699,
4700,
4701,
4702,
4703,
4726,
4727,
4780,
4802,
4842,
4895,
4945,
4951,
4986,
5012,
5065,
5122,
5176,
5186,
5192,
5210,
5212,
5213,
5214,
5215,
5264,
5265,
5302,
5303,
5344,
5396,
5397,
5435,
5503,
5526,
5563,
5596,
5597,
5628,
5629,
5685,
5716,
5761,
5790,
5791,
5864,
5884,
5933,
5939,
5940,
5978,
6015,
6054,
6102,
6161,
6201,
6218,
6250,
6260,
6266,
6268,
6269,
6345,
6346,
6347,
6348,
6349,
6371,
6372,
6455,
6456,
6495,
6534,
6552,
6624,
6696,
6751,
6785,
6826,
6837,
6838,
6854,
6860,
6861,
6894,
6896,
6897,
6941,
6942,
6943,
6944,
6945,
6984,
6985,
7010,
7011,
7016,
7017,
7039,
7095,
7136,
7138,
7139,
7140,
7141,
7172,
7173,
7180,
7181,
7201,
7203,
7265,
7310,
7365,
7367,
7368,
7369,
7370
],
"line_end_idx": [
1,
23,
24,
25,
26,
27,
38,
39,
98,
99,
128,
156,
157,
164,
165,
203,
241,
264,
327,
360,
386,
387,
439,
440,
441,
442,
443,
474,
475,
500,
501,
558,
559,
581,
582,
653,
761,
861,
982,
1102,
1221,
1329,
1443,
1541,
1626,
1729,
1827,
1921,
2046,
2152,
2153,
2154,
2155,
2156,
2157,
2158,
2226,
2227,
2249,
2300,
2327,
2367,
2424,
2430,
2465,
2531,
2533,
2534,
2535,
2536,
2554,
2555,
2585,
2613,
2614,
2675,
2713,
2767,
2768,
2795,
2853,
2854,
2867,
2868,
2892,
2934,
2978,
3040,
3042,
3043,
3044,
3045,
3063,
3064,
3121,
3122,
3171,
3217,
3222,
3223,
3275,
3276,
3301,
3302,
3352,
3405,
3469,
3535,
3601,
3631,
3632,
3654,
3655,
3705,
3759,
3824,
3891,
3958,
3989,
3990,
3991,
3992,
3996,
3997,
4045,
4046,
4085,
4095,
4123,
4152,
4181,
4206,
4210,
4211,
4212,
4213,
4445,
4446,
4677,
4678,
4699,
4700,
4701,
4702,
4703,
4726,
4727,
4780,
4802,
4842,
4895,
4945,
4951,
4986,
5012,
5065,
5122,
5176,
5186,
5192,
5210,
5212,
5213,
5214,
5215,
5264,
5265,
5302,
5303,
5344,
5396,
5397,
5435,
5503,
5526,
5563,
5596,
5597,
5628,
5629,
5685,
5716,
5761,
5790,
5791,
5864,
5884,
5933,
5939,
5940,
5978,
6015,
6054,
6102,
6161,
6201,
6218,
6250,
6260,
6266,
6268,
6269,
6345,
6346,
6347,
6348,
6349,
6371,
6372,
6455,
6456,
6495,
6534,
6552,
6624,
6696,
6751,
6785,
6826,
6837,
6838,
6854,
6860,
6861,
6894,
6896,
6897,
6941,
6942,
6943,
6944,
6945,
6984,
6985,
7010,
7011,
7016,
7017,
7039,
7095,
7136,
7138,
7139,
7140,
7141,
7172,
7173,
7180,
7181,
7201,
7203,
7265,
7310,
7365,
7367,
7368,
7369,
7370,
7377
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7377,
"ccnet_original_nlines": 258,
"rps_doc_curly_bracket": 0.005557809956371784,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09575104713439941,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014362660236656666,
"rps_doc_frac_lines_end_with_ellipsis": 0.007722009904682636,
"rps_doc_frac_no_alph_words": 0.576900064945221,
"rps_doc_frac_unique_words": 0.47629308700561523,
"rps_doc_mean_word_length": 11.506465911865234,
"rps_doc_num_sentences": 221,
"rps_doc_symbol_to_word_ratio": 0.00239378004334867,
"rps_doc_unigram_entropy": 4.942787170410156,
"rps_doc_word_count": 464,
"rps_doc_frac_chars_dupe_10grams": 0.13504402339458466,
"rps_doc_frac_chars_dupe_5grams": 0.16688518226146698,
"rps_doc_frac_chars_dupe_6grams": 0.15190111100673676,
"rps_doc_frac_chars_dupe_7grams": 0.15190111100673676,
"rps_doc_frac_chars_dupe_8grams": 0.13504402339458466,
"rps_doc_frac_chars_dupe_9grams": 0.13504402339458466,
"rps_doc_frac_chars_top_2gram": 0.04195541888475418,
"rps_doc_frac_chars_top_3gram": 0.035399891436100006,
"rps_doc_frac_chars_top_4gram": 0.03802210092544556,
"rps_doc_books_importance": -361.3391418457031,
"rps_doc_books_importance_length_correction": -361.3391418457031,
"rps_doc_openwebtext_importance": -243.92718505859375,
"rps_doc_openwebtext_importance_length_correction": -243.92718505859375,
"rps_doc_wikipedia_importance": -207.68728637695312,
"rps_doc_wikipedia_importance_length_correction": -207.68728637695312
},
"fasttext": {
"dclm": 0.8749542832374573,
"english": 0.1873478889465332,
"fineweb_edu_approx": 1.863386631011963,
"eai_general_math": 0.5040605068206787,
"eai_open_web_math": 0.10845475643873215,
"eai_web_code": 0.9646693468093872
}
} | {
"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": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,235,928,817,637,267,000 | DFU Mode vs Recovery Mode
DFU Mode vs Recovery Mode: What’s the Difference?
According to Apple, there are 1.65 million active iPhones out there.
If you have one of these iPhones, you may be having problems with your phone. To fix it, you might be wondering how to reset it.
There are two modes you can use to fix it: DFU mode vs recovery mode. But what is the difference? Keep reading to find out!
What is DFU Mode
DFU mode is also referred to as Device Firmware Update mode. This mode lets you restore your phone regardless of what state is in.
You’ll know that your phone is in this mode because the screen will be completely black even though the power is on.
You can use this for all kinds of things to help your phone, including if you’re upgrading or downgrading the software. You can even use it to reboot your device if it’s jailbroken.
What is Recovery Mode
On the other hand, recovery mode is more common for people who are using iOS. In order to update your phone or tablet, you have to put your phone into recovery mode.
Sometimes this is also called restore mode, and once you do it, your phone will go into iBoot bootloader mode. When this happens, the phone reverts back to its original settings.
This will fix any issues you’re having with your phone. It will wipe out any previous issues with the software and replace it with the more current version.
It can also fix issues like your iPhone not responding, not updating, or corrupt files. You can also use it if you forgot your password and need to reset your phone. However, all of the data that is on your phone will be lost.
You can also use this if the device was previously jailbroken and you need to update it with the most current version of the software. Once your phone comes out of recovery mode, you’ll have to latest version of iOS installed as well.
Differences of DFU and Recovery Mode
While both can be used to fix your iOS software, there are a few main differences between the two modes.
One of them is that recovery mode is software booting, so it’ll be updated whenever you update your iOS. However, DFU mode is a hardware fix, and it will only be updated whenever you get a new phone.
When you go into DFU mode, it won’t even use the iBoot process because it’s only a software program. This will also keep you from downloading an older version of iOS for security reasons, but you may be able to bypass it with your DFU mode.
You’ll also be able to get different information with each mode. The recovery mode will tell you the model of the device, the unique chip ID, the IMEI, and the serial number. However, the DFU mode can only tell you the chip ID and the model of the device.
How To Go Into DFU Mode
Now that you know the difference, you can learn how to put iPhone in DFU mode. You may need to look online for specific instructions for your model or device, but in general, these steps should work.
First, you have to hook up your iPhone to your computer and open iTunes. Then power your phone off to sleep like you normally would.
When you’ve done that, you should hold the power button and the home button at the same time for ten seconds. After ten seconds, you should let go of the power button but still hold the home button.
After a while, you’ll see a message on iTunes telling you that your phone has been detected. Once you click OK, your phone is then in DFU mode. The screen should be blank and you should not see the Apple logo on it.
If you want to get out of DFU mode, you just have to hold those same buttons together again until the iPhone isn’t listed on iTunes anymore. Then you’ll be able to use your phone just like before.
How To Go Into Recovery Mode
If you need to go into recovery mode for iPhone instead, the steps are actually pretty similar.
You should first turn off the device as you did before. Next, you’ll just press the home button and hold it. After that, you should connect your device to iTunes through your computer again.
If your device isn’t showing up, make sure that iTunes is closed on your computer before you plug it in. However, once you see your device pop up, you can force restart it.
Once you’ve done that, your phone should be stuck on the Apple logo screen. To get out of it, you may have to hold certain buttons to get out of it.
For example, if you have an iPhone 8 or above, you can press the Volume Up button, the down button, and then hold the side button. But if you have an iPhone 6s or below, you can just hold the lock and home button until it comes back to life.
Learn More About DFU Mode Vs Recovery Mode
These are only a few things to know about the difference between DFU mode vs recovery mode, but there are many more things to keep in mind.
We know that dealing with any kind of phone issue can be stressful, but we’re here to help you out.
If you enjoyed this article, make sure that you explore our website to find more articles just like this one! | {
"url": "https://simplycleaver.com/technology/difference-dfu-and-recovery-mode/",
"source_domain": "simplycleaver.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "52093",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZA4FFR4NULWTJSK2WTBBF2ECJQBJP3UC",
"WARC-Concurrent-To": "<urn:uuid:75a3b7b9-14e0-4609-a239-6a96d4a7b287>",
"WARC-Date": "2021-04-17T11:40:02Z",
"WARC-IP-Address": "35.213.128.74",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KCPPNQTBAB52WU6XVGSGJMTJW6PH2CCE",
"WARC-Record-ID": "<urn:uuid:592738de-f054-41fa-a3c2-995a4d24d09b>",
"WARC-Target-URI": "https://simplycleaver.com/technology/difference-dfu-and-recovery-mode/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:57954dd2-25cc-432b-84e9-aa7a653a0be6>"
},
"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-88.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,
26,
27,
77,
78,
147,
148,
277,
278,
402,
403,
420,
421,
552,
553,
670,
671,
853,
854,
876,
877,
1043,
1044,
1223,
1224,
1381,
1382,
1609,
1610,
1845,
1846,
1883,
1884,
1989,
1990,
2190,
2191,
2432,
2433,
2689,
2690,
2714,
2715,
2915,
2916,
3049,
3050,
3249,
3250,
3466,
3467,
3664,
3665,
3694,
3695,
3791,
3792,
3983,
3984,
4157,
4158,
4307,
4308,
4550,
4551,
4594,
4595,
4735,
4736,
4836,
4837
],
"line_end_idx": [
26,
27,
77,
78,
147,
148,
277,
278,
402,
403,
420,
421,
552,
553,
670,
671,
853,
854,
876,
877,
1043,
1044,
1223,
1224,
1381,
1382,
1609,
1610,
1845,
1846,
1883,
1884,
1989,
1990,
2190,
2191,
2432,
2433,
2689,
2690,
2714,
2715,
2915,
2916,
3049,
3050,
3249,
3250,
3466,
3467,
3664,
3665,
3694,
3695,
3791,
3792,
3983,
3984,
4157,
4158,
4307,
4308,
4550,
4551,
4594,
4595,
4735,
4736,
4836,
4837,
4946
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4946,
"ccnet_original_nlines": 70,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5106976628303528,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018604649230837822,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11813952773809433,
"rps_doc_frac_unique_words": 0.29935622215270996,
"rps_doc_mean_word_length": 4.156652450561523,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.931291580200195,
"rps_doc_word_count": 932,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06375838816165924,
"rps_doc_frac_chars_dupe_6grams": 0.012390290386974812,
"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.037170879542827606,
"rps_doc_frac_chars_top_3gram": 0.011615900322794914,
"rps_doc_frac_chars_top_4gram": 0.02194114960730076,
"rps_doc_books_importance": -585.998046875,
"rps_doc_books_importance_length_correction": -585.998046875,
"rps_doc_openwebtext_importance": -282.1983947753906,
"rps_doc_openwebtext_importance_length_correction": -282.1983947753906,
"rps_doc_wikipedia_importance": -251.8310089111328,
"rps_doc_wikipedia_importance_length_correction": -251.8310089111328
},
"fasttext": {
"dclm": 0.12359887361526489,
"english": 0.9461937546730042,
"fineweb_edu_approx": 1.701613426208496,
"eai_general_math": 0.1885843276977539,
"eai_open_web_math": 0.29746222496032715,
"eai_web_code": 0.2314334511756897
}
} | {
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
8,674,422,102,476,659,000 | Hide useless stats
Draw
Veteran
Veteran
Joined
Oct 11, 2015
Messages
83
Reaction score
1
First Language
French
Primarily Uses
Hi everyone !
I've already made a topic for the same thing with VX ACE not so long ago. I would like to hide stats I don't use in the Equip Window. ATK, MAT, AGI instead of ATK, DEF, MAT, MDF, AGI, LUK. I found "ParamId" in the js script but I don't know how to write stats one by one. If someone knows, feel free to post it there :)
Aluvien
Veteran
Veteran
Joined
Nov 14, 2014
Messages
33
Reaction score
15
First Language
English
Primarily Uses
I'm new to this too, but I figured I'd give this one a shot. The order of parameters is in objects_js:
Object.defineProperties(Game_BattlerBase.prototype, { // Hit Points hp: { get: function() { return this._hp; }, configurable: true }, // Magic Points mp: { get: function() { return this._mp; }, configurable: true }, // Tactical Points tp: { get: function() { return this._tp; }, configurable: true }, // Maximum Hit Points mhp: { get: function() { return this.param(0); }, configurable: true }, // Maximum Magic PointsAnd so on. You want ATK, MAT, and AGI, which conveniently, are parameters 1, 3, and 5. The most straightforward way to do this is to replace the counter code in Window_EquipStatus so that it skips the unwanted stats. Try this:
Window_EquipStatus.prototype.refresh = function() { this.contents.clear(); if (this._actor) { this.drawActorName(this._actor, this.textPadding(), 0); for (var i = 0; i < 6; i+=2) { this.drawItem(0, this.lineHeight() * (1 + i / 2), 2 + i); } }};Note that here, your stats are parameters 0, 2, and 4. In rpg_objects, ATK is parameter 1, so note for any future changes that item in this function is 1 lower than param in rpg_objects. The order, however, seems to be the same. Note also that I changed the y value for each line to adjust for the missing lines on the screen. Hope this helps!
Last edited by a moderator:
Draw
Veteran
Veteran
Joined
Oct 11, 2015
Messages
83
Reaction score
1
First Language
French
Primarily Uses
It works fine, thank you !
By the way, can we do it with other stats, but one by one ?
Something like that :
atk(x, y, lineHeight x 1)
mat(x, y, lineHeight x 2)
...
Aluvien
Veteran
Veteran
Joined
Nov 14, 2014
Messages
33
Reaction score
15
First Language
English
Primarily Uses
That is possible, but is slightly more complicated. If you look at the code above, the relevant line is:
this.drawItem(0, this.lineHeight() * (1 + i / 2), 2 + i);The first two arguments are clearly X and Y, but the last one is unclear. (It's important to note that the last argument is 2 + i, meaning that what I said in my last post is mistaken: ATK is parameter 2 here, not parameter 0.)
In order to find out what that argument is, we need to look for the drawItem function of Window_EquipStatus (since the function itself is "this.drawItem"):
Window_EquipStatus.prototype.drawItem = function(x, y, paramId) { this.drawParamName(x + this.textPadding(), y, paramId); if (this._actor) { this.drawCurrentParam(x + 140, y, paramId); } this.drawRightArrow(x + 188, y); if (this._tempActor) { this.drawNewParam(x + 222, y, paramId); }};This function takes three arguments: x, y, and parameter ID. Thus, you should be able to structure calls for individual parameters like this:
this.drawItem(0, this.lineHeight() * (1 + 1 / 2), 2) //Draws ATKSo that the code as a whole would be:
Window_EquipStatus.prototype.refresh = function() { this.contents.clear(); if (this._actor) { this.drawActorName(this._actor, this.textPadding(), 0); this.drawItem(0, this.lineHeight() * 1, 2); this.drawItem(0, this.lineHeight() * 2, 4); this.drawItem(0, this.lineHeight() * 3, 6); }};I removed the counter, since we're directly writing each command instead of iterating over a list. Note that because of this, I had to change how Y is calculated, since variable i no longer exists. This way you can put in individual lines for every parameter you want, and only have to change Y and paramId. Hope this helped.
Kane Hart
Elmlor.com
Veteran
Joined
Jun 27, 2014
Messages
656
Reaction score
166
First Language
English
Would be nice to have this made into a proper plugin for everyone to use. I myself hate seeing this:
Draw
Veteran
Veteran
Joined
Oct 11, 2015
Messages
83
Reaction score
1
First Language
French
Primarily Uses
Thank you, it works fine !
I hope it'll be usefull for all.
Last edited by a moderator:
Amuseum
Veteran
Veteran
Joined
Oct 27, 2015
Messages
71
Reaction score
66
First Language
English Chinese
Primarily Uses
RMXP
several steps. 1. create an array to hold the ids of the stats you want in specific order. 2. iterate through this new array. a temp var to hold the current id, not i, is passed to drawItem.
Last edited by a moderator:
junglechief
Veteran
Veteran
Joined
Nov 9, 2015
Messages
46
Reaction score
3
First Language
English
Running this right now. Trying to only show HP, Atk, Def, and Agi.
Window_EquipStatus.prototype.refresh = function() {
this.contents.clear();
if (this._actor) {
this.drawActorName(this._actor, this.textPadding(), 0);
this.drawItem(0, this.lineHeight() * 1, 2);
this.drawItem(0, this.lineHeight() * 2, 3);
this.drawItem(0, this.lineHeight() * 3, 6);
}
};
Doesn't appear to be doing anything.
Neo Soul Gamer
Veteran
Veteran
Joined
Aug 10, 2012
Messages
647
Reaction score
382
First Language
English
Primarily Uses
N/A
Running this right now. Trying to only show HP, Atk, Def, and Agi.
Window_EquipStatus.prototype.refresh = function() {
this.contents.clear();
if (this._actor) {
this.drawActorName(this._actor, this.textPadding(), 0);
this.drawItem(0, this.lineHeight() * 1, 2);
this.drawItem(0, this.lineHeight() * 2, 3);
this.drawItem(0, this.lineHeight() * 3, 6);
}
};
Doesn't appear to be doing anything.
Are you using Yanfly's Equip Core? This won't work if you are. There's something else you have to edit.
Neo Soul Gamer
Veteran
Veteran
Joined
Aug 10, 2012
Messages
647
Reaction score
382
First Language
English
Primarily Uses
N/A
Yes I am, you wouldn't happen to know what else needs to be added?
No, but I think I can figure it out in a bit. I also used the Equip Core plugin and ran some quick tests with and without it. It definitely overwrites whatever displays the parameters. I'll take a look shortly. Stay tuned for the edit.
EDIT:
Window_StatCompare.prototype.refresh = function() { this.contents.clear(); if (this._actor) { this.drawActorName(this._actor, this.textPadding(), 0); this.drawItem(0, this.lineHeight() * 1, 2);this.drawItem(0, this.lineHeight() * 3, 3);this.drawItem(0, this.lineHeight() * 5, 4); }};
Create a new plugin with this code and put it below Equip Core. Notice the numbers "1, 2" "3, 3" "5, 4" The first number (1, 3, and 5) is the spacing and placement of which row the parameters will be in. The second number (2, 3, and 4) is tied to the Parameter that you want to display. In this example, ATK, DEF, and MAT should show with a skipped row between them.
Hope this helps.
Last edited by a moderator:
junglechief
Veteran
Veteran
Joined
Nov 9, 2015
Messages
46
Reaction score
3
First Language
English
No, but I think I can figure it out in a bit. I also used the Equip Core plugin and ran some quick tests with and without it. It definitely overwrites whatever displays the parameters. I'll take a look shortly. Stay tuned for the edit.
EDIT:
Window_StatCompare.prototype.refresh = function() { this.contents.clear(); if (this._actor) { this.drawActorName(this._actor, this.textPadding(), 0); this.drawItem(0, this.lineHeight() * 1, 2);this.drawItem(0, this.lineHeight() * 3, 3);this.drawItem(0, this.lineHeight() * 5, 4); }};
Create a new plugin with this code and put it below Equip Core. Notice the numbers "1, 2" "3, 3" "5, 4" The first number (1, 3, and 5) is the spacing and placement of which row the parameters will be in. The second number (2, 3, and 4) is tied to the Parameter that you want to display. In this example, ATK, DEF, and MAT should show with a skipped row between them.
Hope this helps.
Got the equip screen to work, now which function draws the stats on the item screen.
Last edited by a moderator:
BloodletterQ
Chaotic Neutral Assassin
Veteran
Joined
Aug 15, 2012
Messages
1,532
Reaction score
1,175
First Language
English
Primarily Uses
N/A
So what do I do if I want to skip MP? Would that also remove the box for it?
Neo Soul Gamer
Veteran
Veteran
Joined
Aug 10, 2012
Messages
647
Reaction score
382
First Language
English
Primarily Uses
N/A
So what do I do if I want to skip MP? Would that also remove the box for it?
Can't really explain it any better than I did above. Each number is tied to a parameter. Aluvien also explains where you can find out which parameters are tied to which number in post #2. Take a look at the code, you'll definitely figure it out.
Users Who Are Viewing This Thread (Users: 0, Guests: 1)
Latest Threads
Latest Profile Posts
We are truly intellectuals.
Without using violence without weapons
Our group has as many as 1.3 million people and more than 1 hundred thousand talks.
We gathered in an hour, more than 4.5 Half a hundred thousand
I got a Sword.
I got an Axe.
I got two Swords.
Nothing to see here, just walking with my dog.
I haven’t worked on my game in a while. Tomorrow might be the day.
*squeals* :kaoblush:
I've been experimenting with improved memory management again, which allowed me to include items to increase player path length. These are both 44 grid spaces long, and stable. :LZSexcite:
I FINALLY DID IT! 5 years making my very first game and I just officially released it on STEAM..... OMG..... I can say I finished a game! The feelings!!!!!
Forum statistics
Threads
104,463
Messages
1,006,477
Members
135,971
Latest member
Akasheee
Top | {
"url": "https://forums.rpgmakerweb.com/index.php?threads/hide-useless-stats.46904/",
"source_domain": "forums.rpgmakerweb.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "135348",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PVPBYDWSO5N4Y4FNQQ26OJGXWKPOZ4VO",
"WARC-Concurrent-To": "<urn:uuid:1b8c73b3-9a93-415d-b52f-292f9ee49128>",
"WARC-Date": "2020-10-26T14:15:13Z",
"WARC-IP-Address": "45.79.217.141",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TW5V456LDA2YTPS2RP7YGSWFRRUCBUKR",
"WARC-Record-ID": "<urn:uuid:6a979a7d-aff9-4a71-a1cd-34b34153b434>",
"WARC-Target-URI": "https://forums.rpgmakerweb.com/index.php?threads/hide-useless-stats.46904/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:62843987-c8e7-486b-9cbc-33fd5af457d3>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-50.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,
25,
26,
34,
42,
49,
62,
71,
74,
89,
91,
106,
113,
128,
142,
143,
463,
465,
466,
474,
475,
483,
491,
498,
511,
520,
523,
538,
541,
556,
564,
579,
682,
683,
1328,
1329,
1917,
1919,
1947,
1948,
1953,
1954,
1962,
1970,
1977,
1990,
1999,
2002,
2017,
2019,
2034,
2041,
2056,
2083,
2084,
2144,
2145,
2167,
2168,
2194,
2195,
2221,
2222,
2226,
2228,
2229,
2237,
2238,
2246,
2254,
2261,
2274,
2283,
2286,
2301,
2304,
2319,
2327,
2342,
2447,
2448,
2733,
2734,
2890,
2891,
3319,
3320,
3422,
3423,
4034,
4036,
4037,
4047,
4048,
4059,
4067,
4074,
4087,
4096,
4100,
4115,
4119,
4134,
4142,
4243,
4244,
4246,
4247,
4252,
4253,
4261,
4269,
4276,
4289,
4298,
4301,
4316,
4318,
4333,
4340,
4355,
4382,
4383,
4416,
4418,
4446,
4447,
4455,
4456,
4464,
4472,
4479,
4492,
4501,
4504,
4519,
4522,
4537,
4553,
4568,
4573,
4764,
4766,
4794,
4795,
4807,
4808,
4816,
4824,
4831,
4843,
4852,
4855,
4870,
4872,
4887,
4895,
4963,
4964,
5016,
5017,
5044,
5045,
5068,
5069,
5133,
5134,
5186,
5187,
5233,
5234,
5286,
5287,
5293,
5294,
5297,
5298,
5300,
5301,
5338,
5340,
5341,
5356,
5357,
5365,
5373,
5380,
5393,
5402,
5406,
5421,
5425,
5440,
5448,
5463,
5467,
5535,
5536,
5588,
5589,
5616,
5617,
5640,
5641,
5705,
5706,
5758,
5759,
5805,
5806,
5858,
5859,
5865,
5866,
5869,
5870,
5872,
5873,
5910,
6014,
6016,
6017,
6032,
6033,
6041,
6049,
6056,
6069,
6078,
6082,
6097,
6101,
6116,
6124,
6139,
6143,
6210,
6446,
6447,
6453,
6454,
6761,
6762,
7129,
7130,
7147,
7149,
7177,
7178,
7190,
7191,
7199,
7207,
7214,
7226,
7235,
7238,
7253,
7255,
7270,
7278,
7514,
7515,
7521,
7522,
7829,
8196,
8197,
8214,
8299,
8301,
8329,
8330,
8343,
8344,
8369,
8377,
8384,
8397,
8406,
8412,
8427,
8433,
8448,
8456,
8471,
8475,
8552,
8554,
8555,
8570,
8571,
8579,
8587,
8594,
8607,
8616,
8620,
8635,
8639,
8654,
8662,
8677,
8681,
8758,
9005,
9007,
9008,
9064,
9065,
9080,
9081,
9102,
9103,
9131,
9170,
9254,
9316,
9317,
9318,
9319,
9334,
9348,
9366,
9413,
9480,
9501,
9502,
9503,
9692,
9848,
9849,
9866,
9867,
9875,
9883,
9892,
9902,
9910,
9918,
9932,
9941
],
"line_end_idx": [
19,
20,
25,
26,
34,
42,
49,
62,
71,
74,
89,
91,
106,
113,
128,
142,
143,
463,
465,
466,
474,
475,
483,
491,
498,
511,
520,
523,
538,
541,
556,
564,
579,
682,
683,
1328,
1329,
1917,
1919,
1947,
1948,
1953,
1954,
1962,
1970,
1977,
1990,
1999,
2002,
2017,
2019,
2034,
2041,
2056,
2083,
2084,
2144,
2145,
2167,
2168,
2194,
2195,
2221,
2222,
2226,
2228,
2229,
2237,
2238,
2246,
2254,
2261,
2274,
2283,
2286,
2301,
2304,
2319,
2327,
2342,
2447,
2448,
2733,
2734,
2890,
2891,
3319,
3320,
3422,
3423,
4034,
4036,
4037,
4047,
4048,
4059,
4067,
4074,
4087,
4096,
4100,
4115,
4119,
4134,
4142,
4243,
4244,
4246,
4247,
4252,
4253,
4261,
4269,
4276,
4289,
4298,
4301,
4316,
4318,
4333,
4340,
4355,
4382,
4383,
4416,
4418,
4446,
4447,
4455,
4456,
4464,
4472,
4479,
4492,
4501,
4504,
4519,
4522,
4537,
4553,
4568,
4573,
4764,
4766,
4794,
4795,
4807,
4808,
4816,
4824,
4831,
4843,
4852,
4855,
4870,
4872,
4887,
4895,
4963,
4964,
5016,
5017,
5044,
5045,
5068,
5069,
5133,
5134,
5186,
5187,
5233,
5234,
5286,
5287,
5293,
5294,
5297,
5298,
5300,
5301,
5338,
5340,
5341,
5356,
5357,
5365,
5373,
5380,
5393,
5402,
5406,
5421,
5425,
5440,
5448,
5463,
5467,
5535,
5536,
5588,
5589,
5616,
5617,
5640,
5641,
5705,
5706,
5758,
5759,
5805,
5806,
5858,
5859,
5865,
5866,
5869,
5870,
5872,
5873,
5910,
6014,
6016,
6017,
6032,
6033,
6041,
6049,
6056,
6069,
6078,
6082,
6097,
6101,
6116,
6124,
6139,
6143,
6210,
6446,
6447,
6453,
6454,
6761,
6762,
7129,
7130,
7147,
7149,
7177,
7178,
7190,
7191,
7199,
7207,
7214,
7226,
7235,
7238,
7253,
7255,
7270,
7278,
7514,
7515,
7521,
7522,
7829,
8196,
8197,
8214,
8299,
8301,
8329,
8330,
8343,
8344,
8369,
8377,
8384,
8397,
8406,
8412,
8427,
8433,
8448,
8456,
8471,
8475,
8552,
8554,
8555,
8570,
8571,
8579,
8587,
8594,
8607,
8616,
8620,
8635,
8639,
8654,
8662,
8677,
8681,
8758,
9005,
9007,
9008,
9064,
9065,
9080,
9081,
9102,
9103,
9131,
9170,
9254,
9316,
9317,
9318,
9319,
9334,
9348,
9366,
9413,
9480,
9501,
9502,
9503,
9692,
9848,
9849,
9866,
9867,
9875,
9883,
9892,
9902,
9910,
9918,
9932,
9941,
9944
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9944,
"ccnet_original_nlines": 343,
"rps_doc_curly_bracket": 0.004927590023726225,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28834620118141174,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03598972037434578,
"rps_doc_frac_lines_end_with_ellipsis": 0.0029069799929857254,
"rps_doc_frac_no_alph_words": 0.3581833839416504,
"rps_doc_frac_unique_words": 0.30922362208366394,
"rps_doc_mean_word_length": 4.840743064880371,
"rps_doc_num_sentences": 192,
"rps_doc_symbol_to_word_ratio": 0.001713800011202693,
"rps_doc_unigram_entropy": 5.514252185821533,
"rps_doc_word_count": 1507,
"rps_doc_frac_chars_dupe_10grams": 0.4355037808418274,
"rps_doc_frac_chars_dupe_5grams": 0.4700479805469513,
"rps_doc_frac_chars_dupe_6grams": 0.4640164375305176,
"rps_doc_frac_chars_dupe_7grams": 0.4555174708366394,
"rps_doc_frac_chars_dupe_8grams": 0.4555174708366394,
"rps_doc_frac_chars_dupe_9grams": 0.4355037808418274,
"rps_doc_frac_chars_top_2gram": 0.05181631073355675,
"rps_doc_frac_chars_top_3gram": 0.03015764057636261,
"rps_doc_frac_chars_top_4gram": 0.023851949721574783,
"rps_doc_books_importance": -1153.898681640625,
"rps_doc_books_importance_length_correction": -1153.898681640625,
"rps_doc_openwebtext_importance": -488.5269470214844,
"rps_doc_openwebtext_importance_length_correction": -488.5269470214844,
"rps_doc_wikipedia_importance": -452.6592102050781,
"rps_doc_wikipedia_importance_length_correction": -452.6592102050781
},
"fasttext": {
"dclm": 0.05149536952376366,
"english": 0.8130839467048645,
"fineweb_edu_approx": 1.385301947593689,
"eai_general_math": 0.34010547399520874,
"eai_open_web_math": 0.491494357585907,
"eai_web_code": 0.21738284826278687
}
} | {
"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": "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": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,426,873,071,200,381,000 | • After 15+ years, we've made a big change: Android Forums is now Early Bird Club. Learn more here.
Google account password
ngotseva
Lurker
Aug 23, 2016
6
0
Hello everyone,
maybe this question is stupid for some of you, but how can I change my google password on Android phone if I don`t remember my current pass and what happens then with the account. I mean I have to sign in again in all the apps or what?
Thanks for the answer!
Yes, I need to enter my current one. And second question is when I change the pass, I should log in again everywhere on my phone or what?
That depends on the app in question. With most but not all Google apps, than once you change the password of your primary Google account you will then need to re-enter the new password -- apps like the Google Play Store app and the Gmail app rely upon that primary Google account. But this also applies to other apps, it's all conditional. The Google Phone app will use your phone number as its identifier instead, but the Google Voice app is going to be tied to a Google account. And third-party apps are not going to be dependent on your primary Google account so they won't be affected, apps such as the MS Outlook app tie into a Microsoft account, the Instagram app will require your Instagram I.D./password, etc. Depending on which app, the situation will vary.
Upvote 0
BEST TECH IN 2023
We've been tracking upcoming products and ranking the best tech since 2007. Thanks for trusting our opinion: we get rewarded through affiliate links that earn us a commission and we invite you to learn more about us.
Smartphones | {
"url": "https://forum.earlybird.club/threads/google-account-password.1344427/",
"source_domain": "forum.earlybird.club",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "172668",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GYMJECIRZBNPFTBR4EGFCL2527TBTKMQ",
"WARC-Concurrent-To": "<urn:uuid:dd94326d-1425-49c1-b099-e50532db6b21>",
"WARC-Date": "2024-05-25T11:08:56Z",
"WARC-IP-Address": "157.230.209.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BJYWNDAQAADIGAS2NJL4BMXH5JIO5FUE",
"WARC-Record-ID": "<urn:uuid:d79dada3-a8e5-4407-a562-45ae0349780f>",
"WARC-Target-URI": "https://forum.earlybird.club/threads/google-account-password.1344427/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:696019cb-8827-4eaa-8cf9-ae7d87ca27c7>"
},
"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-211\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
102,
103,
127,
128,
137,
138,
145,
158,
160,
162,
178,
179,
415,
438,
440,
578,
1345,
1347,
1356,
1357,
1375,
1376,
1593,
1594
],
"line_end_idx": [
102,
103,
127,
128,
137,
138,
145,
158,
160,
162,
178,
179,
415,
438,
440,
578,
1345,
1347,
1356,
1357,
1375,
1376,
1593,
1594,
1605
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1605,
"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.436950147151947,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03812317177653313,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14662757515907288,
"rps_doc_frac_unique_words": 0.5360824465751648,
"rps_doc_mean_word_length": 4.323024272918701,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.733290195465088,
"rps_doc_word_count": 291,
"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.05166931822896004,
"rps_doc_frac_chars_top_3gram": 0.047694750130176544,
"rps_doc_frac_chars_top_4gram": 0.038155801594257355,
"rps_doc_books_importance": -132.0157012939453,
"rps_doc_books_importance_length_correction": -118.32318115234375,
"rps_doc_openwebtext_importance": -83.14019775390625,
"rps_doc_openwebtext_importance_length_correction": -83.14019775390625,
"rps_doc_wikipedia_importance": -65.63394927978516,
"rps_doc_wikipedia_importance_length_correction": -52.044551849365234
},
"fasttext": {
"dclm": 0.06400179862976074,
"english": 0.9415051341056824,
"fineweb_edu_approx": 1.2654924392700195,
"eai_general_math": 0.0014000500086694956,
"eai_open_web_math": 0.017264539375901222,
"eai_web_code": 0.0315023697912693
}
} | {
"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.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,563,456,186,013,921,000 | Close
What are you looking for?
cancel
Showing results for
Search instead for
Did you mean:
Original topic:
Sim card trays
(Topic created on: 02-10-2021 03:51 AM)
728 Views
sendittoamit
Pioneer
Options
Samsung I want to give some feedback the way you make dual sim phones that support micro sd and I hope your future phones will still support micro sd as I'm a note user and this is important for me. Now when you make a dual sim variant can you make sure people can use the dual sims and the micro sd together on your next phones? I don't like the idea of hybrid sim tray very inconvenient and I'm sure others would agree.
4 REPLIES 4
Mitzzz999
Hotshot
Options
It is annoying that I've seen some A range series have physical dual sim trays PLUS space for a micro SD slot.
Also I hate the idea of esims. I've had to do this for my Flip 3 but I like to switch between different devices depending on what I am doing or where I have to go.
Right now, there's a spike of muggings in the area and I prefer to put my sims in a more simple phone rather than take my Z Flip 3 out. In the last mugging they made the lad hard reset his phone at knife point.
BandOfBrothers
Samsung Members Star ★★
Options
Hi @sendittoamit
I totally understand and appreciate your viewpoint on this as many still do like using Sd cards, but Samsung do seem to be moving towards online vault options now especially on their Flagship phones and newer phones.
@Mitzzz999
That's awful and I feel for anyone put in that position.
Unfortunately nowadays these phones being expensive create an opportunity for some unscrupulous people to take advantage of an owner.
I remember when the fingerprint scanner was first introduced that some were then forcing the owner to unlock their phones before making off with them.
Personally I try not to use my phone in any areas that would leave me vulnerable to being mugged.
I also have my phone covered for loss or theft under my Home Contents insurance.
In regards to eSims I've not needed to use this option yet as I prefer a physical sim and some networks here in the UK seem to sometimes struggle with either initially setting them up or transferring an eSim from one phone to another.
Suppose I'm just stuck in my ways with some aspects of tech. 😉
Daily Driver > Samsung Galaxy s²⁴ Ultra 512Gb ~ Titanium Black.
The advice I offer is my own and does not represent Samsung’s position.
I'm here to help. " This is the way. "
sendittoamit
Pioneer
Options
I know sad but taking away sd card was a bad move lately I feel they are making all the wrong moves getting disappointed by the day been a Note user since day one. I think if they don't pull it off next year for me I'll be moving brand after being loyal to Samsung for last 10 years.
Mitzzz999
Hotshot
Options
You are right about the esim thing. I wanted my 3 number as the esim and don't wish to speak to an advisor, I just wanted to get it done via my online account or Web chat. It was literally around 9.30pm... 3 had poor online support but EE had a very clear and straightforward process online to do it and it worked immediately for me. Think it was a 50p charge to do it... to move from physical to esim.
I'll be very careful if I am out and about.
0 Likes | {
"url": "https://eu.community.samsung.com/t5/galaxy-note10-series/sim-card-trays/m-p/4081832",
"source_domain": "eu.community.samsung.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "230406",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OVKIGCUIRRIEUXT55D6HVX7L44X57CXU",
"WARC-Concurrent-To": "<urn:uuid:55762f43-0a08-4a8c-ac78-1bdbad2c8831>",
"WARC-Date": "2024-02-28T09:43:16Z",
"WARC-IP-Address": "13.32.208.39",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XR7VIXGW2ZDC7AKHEEPMN2WREPZYOJB3",
"WARC-Record-ID": "<urn:uuid:70eef9d3-334c-4350-829d-e6cc1e06cba6>",
"WARC-Target-URI": "https://eu.community.samsung.com/t5/galaxy-note10-series/sim-card-trays/m-p/4081832",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:89991993-b003-448a-85cf-dceda38f7a5d>"
},
"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,
6,
7,
33,
34,
41,
62,
82,
97,
98,
114,
115,
130,
131,
171,
181,
194,
202,
210,
632,
644,
654,
662,
670,
781,
782,
946,
947,
1158,
1173,
1197,
1205,
1206,
1224,
1225,
1443,
1444,
1456,
1457,
1514,
1515,
1649,
1650,
1801,
1802,
1901,
1902,
1983,
1984,
2219,
2220,
2284,
2285,
2286,
2350,
2351,
2423,
2462,
2463,
2476,
2484,
2492,
2776,
2786,
2794,
2802,
3205,
3249
],
"line_end_idx": [
6,
7,
33,
34,
41,
62,
82,
97,
98,
114,
115,
130,
131,
171,
181,
194,
202,
210,
632,
644,
654,
662,
670,
781,
782,
946,
947,
1158,
1173,
1197,
1205,
1206,
1224,
1225,
1443,
1444,
1456,
1457,
1514,
1515,
1649,
1650,
1801,
1802,
1901,
1902,
1983,
1984,
2219,
2220,
2284,
2285,
2286,
2350,
2351,
2423,
2462,
2463,
2476,
2484,
2492,
2776,
2786,
2794,
2802,
3205,
3249,
3256
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3256,
"ccnet_original_nlines": 67,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4512372612953186,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.055312950164079666,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11644832789897919,
"rps_doc_frac_unique_words": 0.4991735517978668,
"rps_doc_mean_word_length": 4.219834804534912,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.002911210060119629,
"rps_doc_unigram_entropy": 5.305721282958984,
"rps_doc_word_count": 605,
"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.010967490263283253,
"rps_doc_frac_chars_top_3gram": 0.020368190482258797,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -319.1547546386719,
"rps_doc_books_importance_length_correction": -319.1547546386719,
"rps_doc_openwebtext_importance": -205.64808654785156,
"rps_doc_openwebtext_importance_length_correction": -205.64808654785156,
"rps_doc_wikipedia_importance": -159.63046264648438,
"rps_doc_wikipedia_importance_length_correction": -159.63046264648438
},
"fasttext": {
"dclm": 0.022024570032954216,
"english": 0.9712443351745605,
"fineweb_edu_approx": 1.012800931930542,
"eai_general_math": 0.05457710847258568,
"eai_open_web_math": 0.2777528762817383,
"eai_web_code": 0.00627028988674283
}
} | {
"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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-6,952,875,795,267,064,000 | What s the difference between Docker for Windows and Docker on Windows
0 votes
What's the difference between Docker for Windows and Docker on Windows?
Oct 1, 2018 in Docker by Sophie may
• 10,530 points
462 views
1 answer to this question.
0 votes
Docker on Windows is a way to refer to just the Docker Engine running on Windows. I find it helpful to think of this as a Windows Container Host, so yes Windows containers only. This would be what you would run on a Windows Server 2016 machine. So maybe a better name is Docker for Windows Server which I believe people have used as well. I still prefer a Windows Container Host. Which means it only has the Docker Engine at the end of the day, doesn't even need to have any of the Docker clients.
Docker for Windows is a product meant for running both Linux and Windows containers on Windows. It's not meant for a production environment, and instead is meant for a desktop/client SKU of Windows, hence the Windows 10 requirement. So, you could think of this as Docker for Windows 10. Because Docker for Windows can run both container types.
answered Oct 1, 2018 by Tyrion anex
• 8,650 points
Related Questions In Docker
0 votes
1 answer
0 votes
1 answer
What is the difference between “expose” and “publish” in Docker?
Basically, you have three options: Neither specify EXPOSE nor -p -> ...READ MORE
answered Jul 18, 2018 in Docker by Nilesh
• 7,020 points
1,881 views
0 votes
2 answers
0 votes
3 answers
What is the difference between a Docker image and a container?
Images are read-only templates that contain a ...READ MORE
answered Aug 10, 2020 in Docker by Vishal
• 260 points
4,651 views
+2 votes
1 answer
+2 votes
1 answer
Deploy Docker Containers from Docker Cloud
To solve this problem, I followed advice ...READ MORE
answered Sep 3, 2018 in AWS by Priyaj
• 58,100 points
1,039 views
0 votes
1 answer
0 votes
1 answer
How to enable/ disable Hyper-V for Docker on Windows?
You can do this from command prompt ...READ MORE
answered Sep 10, 2018 in Docker by Tyrion anex
• 8,650 points
4,008 views | {
"url": "https://www.edureka.co/community/23459/whats-difference-between-docker-for-windows-docker-windows",
"source_domain": "www.edureka.co",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "141652",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WBVRDYXULXVC66V3D4HBULEEVZJ2PWJF",
"WARC-Concurrent-To": "<urn:uuid:cf8cef00-08e4-41e0-b354-657379f8e052>",
"WARC-Date": "2021-02-28T04:06:49Z",
"WARC-IP-Address": "54.192.30.25",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D7OWXUKBRK5T7EFLWXDACGM2GYD6TQK6",
"WARC-Record-ID": "<urn:uuid:e3ba491c-e463-441f-bd82-67011ab3cb34>",
"WARC-Target-URI": "https://www.edureka.co/community/23459/whats-difference-between-docker-for-windows-docker-windows",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c353950f-b963-4125-a4ef-0de7359eb7ea>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-128.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
71,
72,
80,
152,
188,
204,
214,
215,
242,
243,
251,
749,
750,
1094,
1130,
1145,
1146,
1174,
1175,
1183,
1192,
1200,
1209,
1210,
1275,
1276,
1357,
1358,
1400,
1415,
1427,
1435,
1445,
1453,
1463,
1464,
1527,
1528,
1587,
1588,
1630,
1643,
1655,
1664,
1673,
1682,
1691,
1692,
1735,
1736,
1790,
1791,
1829,
1845,
1857,
1865,
1874,
1882,
1891,
1892,
1946,
1947,
1996,
1997,
2044,
2059
],
"line_end_idx": [
71,
72,
80,
152,
188,
204,
214,
215,
242,
243,
251,
749,
750,
1094,
1130,
1145,
1146,
1174,
1175,
1183,
1192,
1200,
1209,
1210,
1275,
1276,
1357,
1358,
1400,
1415,
1427,
1435,
1445,
1453,
1463,
1464,
1527,
1528,
1587,
1588,
1630,
1643,
1655,
1664,
1673,
1682,
1691,
1692,
1735,
1736,
1790,
1791,
1829,
1845,
1857,
1865,
1874,
1882,
1891,
1892,
1946,
1947,
1996,
1997,
2044,
2059,
2070
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2070,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32134830951690674,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03595506027340889,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26292136311531067,
"rps_doc_frac_unique_words": 0.41018766164779663,
"rps_doc_mean_word_length": 4.335120677947998,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0.00898876041173935,
"rps_doc_unigram_entropy": 4.56930685043335,
"rps_doc_word_count": 373,
"rps_doc_frac_chars_dupe_10grams": 0.06679034978151321,
"rps_doc_frac_chars_dupe_5grams": 0.15955473482608795,
"rps_doc_frac_chars_dupe_6grams": 0.12739640474319458,
"rps_doc_frac_chars_dupe_7grams": 0.09894867241382599,
"rps_doc_frac_chars_dupe_8grams": 0.09894867241382599,
"rps_doc_frac_chars_dupe_9grams": 0.06679034978151321,
"rps_doc_frac_chars_top_2gram": 0.029684599488973618,
"rps_doc_frac_chars_top_3gram": 0.059369198977947235,
"rps_doc_frac_chars_top_4gram": 0.032158318907022476,
"rps_doc_books_importance": -226.86837768554688,
"rps_doc_books_importance_length_correction": -226.86837768554688,
"rps_doc_openwebtext_importance": -107.19780731201172,
"rps_doc_openwebtext_importance_length_correction": -107.19780731201172,
"rps_doc_wikipedia_importance": -105.35848999023438,
"rps_doc_wikipedia_importance_length_correction": -105.35848999023438
},
"fasttext": {
"dclm": 0.9156268835067749,
"english": 0.942970871925354,
"fineweb_edu_approx": 2.2637991905212402,
"eai_general_math": 0.18633389472961426,
"eai_open_web_math": 0.47969990968704224,
"eai_web_code": 0.000030040000638109632
}
} | {
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
3,478,924,686,128,497,700 | spy_ops
December 2009 - India blocked
25 million Chinese-made cell
phones to tighten security.
FACT: Nearly 50% of employees
spend more than 20% of their
time away from their desks driving the business with the use of cell phones.
FACT: 85% of adults now
carry a cell phone.
FACT: 24% of cell phone
users admit to sleeping with their cell phones so they won’t miss a text message or call.
FACT: China has over 720
million cell phones in operation.
FACT: Mobile browser users
have increased 143% and pages
viewed have increased 224%
year on year.
Cellular Spying Vendors
¨ Flexispy
¨ Mobile Spy
¨ E-Stealth
¨ Big Daddy Spy
¨ Cell Spy Pro
¨ Daddy’s Eye
¨ Mobi Stealth
¨ Brick House
security_lower_logo
cell_targetWe live in a 24/7/365 connected world. Cell phones have evolved into an essential part of our business and every day social lives. We are on our cell phones all the time – talking, texting and taking photos and videos. Consider the private conversations and information that you routinely share when using your cell phone. How would you feel if someone was listening to every word, reading every text.message or viewing your pictures and videos? It could be happening. Technology has given spies the ultimate listening device that has permeated throughout every organization. Software secretly loaded on cell phones now creates that ultimate listening device.
Independent Verification
This capability has been independently verified. A software package was purchased and installed on an individual’s cell phone. At that point the individual went about their normal daily activities. Within minutes information began being collected and forwarded to the monitoring point we defined. The GPS location of the device was also available to the monitoring device and several emails were also copied and transferred, as well as text messages in near real-time.
Now you can see just how vulnerable cell phone conversations can be! These cell phone software applications enable unscrupulous people to spy on compromised cell phones. Nothing is logged and the spy software leaves absolutely no trace of its existence or activity on the targets’ phone. Some of these cellular spying applications are so well crafted that they allow a specific text messages to be sent to the phone that will cause the
spyware to erase itself in order to avoid detection. Cell phone users and security professionals concerned about cellular spyware should monitor their phones' battery usage/life as that is the only indicator we can find of the phone being compromised. The only sure way to find out if there's a bug is to conduct cellular forensic analysis. To protect these devices users must keep their phone with you at all times and make sure the phone is password protected.
The average price for cellular spying software package is around $90 USD and it is widely available over the Internet. Spying applications are available for most of the popular cell phones including the iPhone and Blackberry. Right now the cellular spyware can only be installed onto a phone if it is physically connected to a computer. However, experts say it won't be long before cyber spying software will be remotely sent. In fact, there are rumors of a remote exploitation cellular spying application already.
NOTE: Organizations and individuals need to be aware that the use of cellular spying software violates many privacy laws and possibly even wiretapping laws.
Intelligence provided by Spy-Ops | {
"url": "http://securityrecruiter.com/cellular_spying.html",
"source_domain": "securityrecruiter.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "15707",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ICM36RZL65BW33RZD5YGUMH2ZFYD4ZOH",
"WARC-Concurrent-To": "<urn:uuid:69f575f6-4f4e-4fb6-98a6-8145a403f8b0>",
"WARC-Date": "2017-05-28T16:35:43Z",
"WARC-IP-Address": "142.4.23.199",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:OSNKRJPU5KNAVJDFPL265PLG2EESAF3I",
"WARC-Record-ID": "<urn:uuid:ff6e1a8f-aa76-46d7-baa3-8b65527b8e8f>",
"WARC-Target-URI": "http://securityrecruiter.com/cellular_spying.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9ba55dd7-ab2e-4e07-a5e2-7faa40167a19>"
},
"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,
8,
9,
39,
68,
96,
97,
127,
156,
233,
234,
258,
278,
279,
303,
393,
394,
419,
453,
454,
481,
511,
538,
552,
553,
555,
556,
580,
591,
604,
616,
632,
647,
661,
676,
690,
691,
711,
712,
1383,
1384,
1409,
1878,
1879,
2315,
2778,
2779,
3294,
3295,
3452,
3453
],
"line_end_idx": [
8,
9,
39,
68,
96,
97,
127,
156,
233,
234,
258,
278,
279,
303,
393,
394,
419,
453,
454,
481,
511,
538,
552,
553,
555,
556,
580,
591,
604,
616,
632,
647,
661,
676,
690,
691,
711,
712,
1383,
1384,
1409,
1878,
1879,
2315,
2778,
2779,
3294,
3295,
3452,
3453,
3485
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3485,
"ccnet_original_nlines": 50,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3804347813129425,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015527949668467045,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13664595782756805,
"rps_doc_frac_unique_words": 0.5185840725898743,
"rps_doc_mean_word_length": 5.021238803863525,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.229631423950195,
"rps_doc_word_count": 565,
"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.03172364830970764,
"rps_doc_frac_chars_top_3gram": 0.005639759823679924,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -325.2154846191406,
"rps_doc_books_importance_length_correction": -325.2154846191406,
"rps_doc_openwebtext_importance": -203.55552673339844,
"rps_doc_openwebtext_importance_length_correction": -203.55552673339844,
"rps_doc_wikipedia_importance": -146.8037109375,
"rps_doc_wikipedia_importance_length_correction": -146.8037109375
},
"fasttext": {
"dclm": 0.04524445906281471,
"english": 0.9440188407897949,
"fineweb_edu_approx": 2.075206995010376,
"eai_general_math": 0.01913285069167614,
"eai_open_web_math": 0.11891084909439087,
"eai_web_code": 0.007794620003551245
}
} | {
"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": "363.12",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Political activists"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"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": "4",
"label": "Missing Images or Figures"
}
},
"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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
3,601,600,800,891,846,700 | Sorry, we don't support your browser. Install a modern browser
Single sign-on (SSO) via SAML 2.0
Nolt supports Single sign-on using SAML 2.0. If you have an IdP that supports SAML 2.0 protocol, you can allow users to log in to Nolt board using our single sign-on mechanism. This guide will help you configure single-sign-on using SAML 2.0 for your Nolt board.
This feature is only available for enterprise customers.
Application setup in IdP
You have to add a new application (Nolt) in your IdP that uses SAML 2.0 for authentication. Just make sure to use the following configuration for the application.
1. Single sign-on URL:
https://YOUR_BOARD.nolt.io/sso/saml
2. Audience URI (SP Entity ID):
https://YOUR_BOARD.nolt.io
3. Redirect URL/Callback URL/ACS (Consumer) URL/Recipient URL:
It's compulsory to pass the Recipient URL from IdP which should be equal to the callback url. If you don't mention it (not a required field in IdP), some IdPs will automatically send the value of the Recipient URL as the ACS URL. If you mention make sure it is same as the ACS URL.
https://YOUR_BOARD.nolt.io/sso/saml
4. Attributes/Parameters
It's mandatory to pass the below fields with the same field-name as below (case sensitive).
• id
• name
• email
• noltUserRole (Optional)
• Custom Attributes (Optional)
You can set the custom attributes that will be shown in the user profile. You can use any field-name and field value for custom attributes.
The id should be unique for every user. The field picture (optional) can also be passed.
5. SAML signature element
SAML Assertion should be signed not the SAML response
6. Signature Algorithm
The Signature Algorithm should be RSA-SHA256 and the Digest Algorithm should be SHA256.
Integration in Nolt
Navigate to your board → IntegrationsSAML 2.0. Set up all the required fields to activate the integration.
1. IDP entity ID (Issuer URL):
Use the Identity Provider Issuer/Issuer URL of the Nolt application in your IdP.
2. SP Entity ID (Audience URI):
https://YOUR_BOARD.nolt.io
It should match the Audience URI of the Nolt application in IdP.
3. X509 Certificate:
Use the X.509 certificate of the Nolt application in your IdP.
4. Remote Login URL:
Use the Remote Login/Endpoint URL of the Nolt application in your IdP.
5. Remote logout URL (optional)
Add a Remote logout URL if you want to redirect users to a specific URL after they log out from their Nolt account.
6. User role structure (optional)
To add the additional user role parameter for making any SSO user a moderator or admin you can set this field. For the below response,
{ customParams: { noltUserRole: 'ADMIN' }}
The user role structure should be set as follows:
customParameters:noltUserRole
7. Custom Attributes (optional)
If you have any custom attributes, you need to set up this field.
{
email: '[email protected]',
customParams:{
employees: [{
employeeId: {
id: 3232324,
},
}]
}
}
For the above response from IdP the custom attributes needs to be setup as,
{ “Employee ID”: “customParams:employees:0:employeeId:id” }
8. Click Test and activate:
This should activate the SSO. To test the SSO try logging in as a new user.
Need help?
Please feel free to reach out at [email protected] for any help regarding SAML integration.
Related
Setting up SSO with Auth0
Setup single-sign-on (SSO) via Auth0.
Setting up SSO with Okta
Setup single-sign-on (SSO) via Okta.
Setting up SSO with OneLogin
Setup single-sign-on (SSO) via OneLogin. | {
"url": "https://nolt.io/help/sso-saml",
"source_domain": "nolt.io",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "35738",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2HGMZHXW5BPBP3GET6745IITPMTVVA2B",
"WARC-Concurrent-To": "<urn:uuid:8447bf8b-d894-462c-ab75-fafb532459ed>",
"WARC-Date": "2023-09-28T09:52:19Z",
"WARC-IP-Address": "104.26.8.5",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MXUYZ3ZVTZVBAUSDTUJ6EAG26HAQVL4B",
"WARC-Record-ID": "<urn:uuid:2b77f4ba-f914-4c07-b4d3-16a650540a8d>",
"WARC-Target-URI": "https://nolt.io/help/sso-saml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:36b5a469-0e76-403c-8325-b81711cca8ae>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-48\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
64,
65,
99,
100,
363,
364,
421,
422,
447,
448,
611,
612,
637,
677,
711,
742,
807,
1093,
1133,
1160,
1256,
1265,
1276,
1288,
1318,
1353,
1499,
1592,
1620,
1678,
1703,
1795,
1796,
1816,
1817,
1924,
1925,
1958,
2043,
2077,
2108,
2177,
2200,
2267,
2290,
2365,
2399,
2519,
2555,
2694,
2741,
2795,
2829,
2863,
2933,
2939,
2969,
2990,
3012,
3040,
3069,
3086,
3101,
3111,
3117,
3122,
3127,
3207,
3271,
3301,
3381,
3382,
3393,
3394,
3482,
3483,
3491,
3492,
3518,
3556,
3557,
3582,
3619,
3620,
3649
],
"line_end_idx": [
64,
65,
99,
100,
363,
364,
421,
422,
447,
448,
611,
612,
637,
677,
711,
742,
807,
1093,
1133,
1160,
1256,
1265,
1276,
1288,
1318,
1353,
1499,
1592,
1620,
1678,
1703,
1795,
1796,
1816,
1817,
1924,
1925,
1958,
2043,
2077,
2108,
2177,
2200,
2267,
2290,
2365,
2399,
2519,
2555,
2694,
2741,
2795,
2829,
2863,
2933,
2939,
2969,
2990,
3012,
3040,
3069,
3086,
3101,
3111,
3117,
3122,
3127,
3207,
3271,
3301,
3381,
3382,
3393,
3394,
3482,
3483,
3491,
3492,
3518,
3556,
3557,
3582,
3619,
3620,
3649,
3689
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3689,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0.003795070108026266,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28700128197669983,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07464607059955597,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2702702581882477,
"rps_doc_frac_unique_words": 0.37064218521118164,
"rps_doc_mean_word_length": 4.913761615753174,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.874131202697754,
"rps_doc_word_count": 545,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04294249042868614,
"rps_doc_frac_chars_dupe_6grams": 0.03472740948200226,
"rps_doc_frac_chars_dupe_7grams": 0.03472740948200226,
"rps_doc_frac_chars_dupe_8grams": 0.023898430168628693,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01792382076382637,
"rps_doc_frac_chars_top_3gram": 0.01344287022948265,
"rps_doc_frac_chars_top_4gram": 0.029873039573431015,
"rps_doc_books_importance": -302.4568786621094,
"rps_doc_books_importance_length_correction": -302.4568786621094,
"rps_doc_openwebtext_importance": -175.30422973632812,
"rps_doc_openwebtext_importance_length_correction": -175.30422973632812,
"rps_doc_wikipedia_importance": -152.86865234375,
"rps_doc_wikipedia_importance_length_correction": -152.86865234375
},
"fasttext": {
"dclm": 0.04084723815321922,
"english": 0.731862485408783,
"fineweb_edu_approx": 1.145107626914978,
"eai_general_math": 0.12200211733579636,
"eai_open_web_math": 0.256994366645813,
"eai_web_code": 0.18775039911270142
}
} | {
"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.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-3,660,294,624,650,854,000 | Writing an ObcJ function/calling it from C++
Jones
Unregistered
Post: #1
Essentially, that's what I'd like to do. The function will be simple, it just needs to make a simple dialog box with one button (I still have to learn how to do this...). I already know how to do this with the Windows API, just not Cocoa because I never directly use it myself. I'd like to be able to call this function from C++ code too, although I know ObjC structures it's functions differently.
What if I wrote the ObjC function, and then made a #define func(args) type layer for the function, would that work?
(Perhaps this is a stupid question, but ObjC is so different from C and C++ it seems like they'd never work together. Thanks!)
Quote this message in a reply
Member
Posts: 257
Joined: 2004.06
Post: #2
Jones Wrote:(Perhaps this is a stupid question, but ObjC is so different from C and C++ it seems like they'd never work together. Thanks!)
Uh, actually, they do work together. Quite well, actually, and it's something I do a lot. If you're calling C/C++ code from another file, you can just call it (after including the header file or declaring it somehow in your Obj-C source file). Calling Obj-C code from C/C++ is a little trickier but it's doable. Poke around Apple's Developer website for sample code and documentation that talks about mixing Obj-C and C/C++.
The brains and fingers behind Malarkey Software (plus caretaker of the world's two brattiest felines).
Quote this message in a reply
Moderator
Posts: 3,571
Joined: 2003.06
Post: #3
If I may suggest, since you don't have much experience with Cocoa, why not just make a few programs out of nothing *but* Cocoa to really get your feet wet with it. That will make integration with other languages much easier to understand. Cocoa all by itself kicks major amounts of bootay. No, really, it does. Give it a try!
Quote this message in a reply
Member
Posts: 567
Joined: 2004.07
Post: #4
you could just use a simple carbon function... lemme find it...
oh yes, here it is.
Code:
#ifdef WIN32
#include <windows.h>
#elif defined __APPLE__
#include <Carbon/Carbon.h>
#endif
#include <cstdarg>
#include <iostream>
#include <sstream>
void ErrorMessage(const std::string &message);
void ErrorMessage(const std::string &message)
{
#ifdef WIN32
MessageBox(NULL, message.c_str(), "Error", MB_ICONERROR | MB_OK);
#elif defined __APPLE__
Str255 msg;
c2pstrcpy(msg, message.c_str());
StandardAlert(kAlertStopAlert, "\pError",
(ConstStr255Param)msg, NULL, NULL);
#else
std::cerr << "Error: " << error_text << std::endl;
#endif
}
shouldn't be too hard to adapt it for your purposes. No use in creating a C/C++ wrapper for objc, when you can just use the native functions.
It's not magic, it's Ruby.
Quote this message in a reply
Jones
Unregistered
Post: #5
Nayr, that's *just* what I was looking for!
Thanks mate! Smile
Quote this message in a reply
Jones
Unregistered
Post: #6
Disaster strikes:
I ashamed to say that I can't even get this dialog to display correctly. LOL Rolleyes
One simple call of:
Code:
StandardAlert( kAlertCautionAlert,
(const unsigned char*)title,
(const unsigned char*)message, NULL, NULL);
Causes an application crash with multiple errors, like:
Quote:2006-11-18 11:55:46.154 OpenGL[16185] *** _NSAutoreleaseNoPool(): Object 0x3711b0 of class NSCarbonWindowContentView autoreleased with no pool in place - just leaking
2006-11-18 11:55:46.177 OpenGL[16185] *** _NSAutoreleaseNoPool(): Object 0xa370d7d8 of class NSCFString autoreleased with no pool in place - just leaking
2006-11-18 11:55:46.208 OpenGL[16185] *** _NSAutoreleaseNoPool(): Object 0x374100 of class NSCFDictionary autoreleased with no pool in place - just leaking
But many more than just three... those look like Cocoa errors. Perhaps Carbon and Cocoa are duking it out? I was under the impression that GLUT used Carbon. Huh
Thanks!
Quote this message in a reply
Moderator
Posts: 3,571
Joined: 2003.06
Post: #7
GLUT is based on Cocoa on OS X -- because Cocoa kicks major bootay. Cocoa and Carbon work together just fine. It looks like you did some Cocoa stuff without first creating an NSAutoReleasePool.
[edit] You could do that like this:
NSAutoreleasePool *myAutoReleasePool = [[NSAutoreleasePool alloc] init];
// do Cocoa stuff
[myAutoReleasePool release];
[/edit]
Quote this message in a reply
Jones
Unregistered
Post: #8
*Becomes baffled by Cocoa code.* ZZZ
I think I've come up with another solution involving using a seperate executable. It sounds weird, but it's mainly for debugging purposes...
That code, BTW, would be much easier to use in an SDL app. I use GLUT apps when designing components and SDL when snapping them together for demonstrations, and later, games. It's a bit of a messy system, but it works for me. Smile
Quote this message in a reply
Member
Posts: 567
Joined: 2004.07
Post: #9
that code I gave you before will work in an sdl app. I'm not sure why it doesn't in your glut app...try it in SDL before giving up on it. That error will haunt you if you use cocoa, anyway.
It's not magic, it's Ruby.
Quote this message in a reply
Moderator
Posts: 3,571
Joined: 2003.06
Post: #10
Jones Wrote:*Becomes baffled by Cocoa code.* ZZZ
An NSAutoReleasePool is a really cool way to manage memory but it isn't an intuitive technique to grasp on first glance. It's essentially just a list of objects which you would like to have released when you release the pool. As you may know, Cocoa objects have the notion of a retain count. A retain count of zero means that the runtime should destroy the object. To set the object's retain count, you can retain, release, and autorelease. In short (really short), retain means add one to the retain count, release means subtract one from the retain count, and autorelease means subtract one from the retain count later -- typically at the end of the application's current execution cycle, when the release message is sent to the autorelease pool you created. Autorelease is handy because often times an object will initialize itself but has no interest in itself, but needs to make sure it stays around long enough for the object that called it in the first place to do something with it. Also, many objects are used in a transient fashion, such as an NSString used as an argument to another string for a moment. Calling release on objects like that all the time becomes redundant, so for convenience, many classes return autoreleased objects. If there isn't a list of autoreleases (an autoReleasePool) then there is no way to tell the runtime to release them and they become memory leaks.
Quote this message in a reply
Member
Posts: 567
Joined: 2004.07
Post: #11
ok, try this:
1. change your main function's file's extension to '.mm' from '.cpp', '.cxx', '.cc', '.C', etc.
2. add "#import <Foundation/Foundation.h>" to the beginning of your file.
3. add "NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];" to the first line of the main function.
4. add "[pool release];" to the last line before your return in the main function.
5. add the foundation framework to the project, if you're using xcode.
6. compile! it might work. Not sure why this should pop up in the first place; doesn't GLUT sue cocoa?
It's not magic, it's Ruby.
Quote this message in a reply
Jones
Unregistered
Post: #12
Nayr Wrote:ok, try this:
1. change your main function's file's extension to '.mm' from '.cpp', '.cxx', '.cc', '.C', etc.
2. add "#import <Foundation/Foundation.h>" to the beginning of your file.
3. add "NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];" to the first line of the main function.
4. add "[pool release];" to the last line before your return in the main function.
5. add the foundation framework to the project, if you're using xcode.
6. compile! it might work. Not sure why this should pop up in the first place; doesn't GLUT sue cocoa?
Somehow that sounds like the kind of solution Microsoft might use. It's quick, but it might break in the future. No offense, of course. Smile
Somehow telling xCode to compile a bunch of c++ dependent code as ObjC sounds like 2000 compiler errors. Annoyed
Quote this message in a reply
Member
Posts: 567
Joined: 2004.07
Post: #13
it's actually objective-c++. It should work fine; it IS a hack, though, only good to hold you over till you find the way you're supposed to do it.
It's not magic, it's Ruby.
Quote this message in a reply
Luminary
Posts: 5,143
Joined: 2002.04
Post: #14
Write a header file like this:
Code:
#ifndef MyHeaderName_h
#define MyHeaderName_h
#if defined(__cplusplus)
extern "C" {
#endif
extern void myCFunctionPrototype(int arg0, const char *arg1, double arg2orWhatever);
#if defined(__cplusplus)
}
#endif
#endif
Now write an implementation file for that header:
Code:
#include "MyHeaderName.h"
void myCFunctionPrototype(int arg0, const char *arg1, double arg2orWhatever)
{
// your code goes here
}
If you name that implementation file .c, you can write C code; if you name it .cc, .cpp, .cxx, etc. you can write C++ code; if you name it .m you can write ObjC code, if you name it .mm you can write ObjC++ code. You can include the header in files written in any of those languages, too.
This is the "old-fashioned" way of mixing C++ and ObjC, but it has the advantage that it keeps the code in the other language nice and isolated from the rest of your code.
Oh, and the NSAutoreleasePool messages are not the cause of your crashes; a fundamental lack of understanding of C vs. Pascal strings, combined with a cavalier attitude toward compiler errors and warnings, is the cause of your crashes.
Also, don't use StandardAlert; it's ancient, nasty, and deprecated. There are better ways of doing it (just say whether you want Cocoa or Carbon code).
And no, GLUT on Mac OS X does not use Carbon internally; it's implemented using Cocoa. You can download the source from Apple.
Quote this message in a reply
Sage
Posts: 1,403
Joined: 2005.07
Post: #15
Jones Wrote:Somehow that sounds like the kind of solution Microsoft might use. It's quick, but it might break in the future. No offense, of course. Smile
Somehow telling xCode to compile a bunch of c++ dependent code as ObjC sounds like 2000 compiler errors. Annoyed
what on earth are you talking about, this is THE way to do it. Its a very clean and good solution.
Sir, e^iπ + 1 = 0, hence God exists; reply!
Quote this message in a reply
Post Reply
Possibly Related Threads...
Thread: Author Replies: Views: Last Post
Writing libraries vs writing apps. Najdorf 8 4,850 Nov 13, 2008 02:32 PM
Last Post: backslash
Better way of calling a function in another class? brush 5 4,295 Jun 12, 2008 11:23 PM
Last Post: AnotherJake
Problem drawing pictures after calling RunApplicationEventLoop petr6534 5 4,483 Feb 8, 2005 06:58 PM
Last Post: petr6534 | {
"url": "http://idevgames.com/forums/thread-3711.html",
"source_domain": "idevgames.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "51409",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4LYCZNKT3OPW7TAJHLU6LHGUSQ5H4URI",
"WARC-Concurrent-To": "<urn:uuid:459d33b5-1c1f-47ad-bbc0-43b41b0de143>",
"WARC-Date": "2014-07-29T12:56:15Z",
"WARC-IP-Address": "209.36.35.59",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4JWJAZGPLZDWRBGPMLZDUWSXL4PAJ2F7",
"WARC-Record-ID": "<urn:uuid:fc0c70f5-5d2f-4851-aed7-9c1355a482e6>",
"WARC-Target-URI": "http://idevgames.com/forums/thread-3711.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c7142e36-0816-4163-92c5-36ba73b374f7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-146-231-18.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,
45,
46,
52,
65,
67,
76,
475,
476,
592,
593,
720,
750,
757,
768,
784,
793,
932,
933,
1358,
1359,
1462,
1492,
1502,
1515,
1531,
1540,
1866,
1896,
1903,
1914,
1930,
1939,
2003,
2004,
2024,
2025,
2031,
2044,
2065,
2089,
2116,
2123,
2124,
2143,
2163,
2182,
2183,
2230,
2276,
2278,
2295,
2369,
2397,
2417,
2458,
2508,
2573,
2583,
2642,
2653,
2655,
2656,
2798,
2799,
2826,
2856,
2862,
2875,
2877,
2886,
2930,
2931,
2950,
2980,
2986,
2999,
3001,
3010,
3028,
3029,
3115,
3116,
3136,
3142,
3180,
3233,
3301,
3302,
3358,
3359,
3532,
3686,
3842,
3843,
4004,
4005,
4013,
4043,
4053,
4066,
4082,
4091,
4285,
4286,
4322,
4323,
4396,
4397,
4415,
4416,
4445,
4446,
4454,
4484,
4490,
4503,
4505,
4514,
4551,
4552,
4693,
4694,
4926,
4956,
4963,
4974,
4990,
4999,
5189,
5190,
5217,
5247,
5257,
5270,
5286,
5296,
5345,
6737,
6767,
6774,
6785,
6801,
6811,
6825,
6921,
6995,
7104,
7187,
7258,
7361,
7362,
7389,
7419,
7425,
7438,
7440,
7450,
7475,
7571,
7645,
7754,
7837,
7908,
8011,
8012,
8154,
8155,
8268,
8298,
8305,
8316,
8332,
8342,
8489,
8490,
8517,
8547,
8556,
8569,
8585,
8595,
8626,
8627,
8633,
8656,
8679,
8680,
8705,
8718,
8725,
8726,
8811,
8812,
8837,
8839,
8846,
8847,
8854,
8855,
8905,
8906,
8912,
8938,
8939,
9016,
9018,
9045,
9047,
9048,
9337,
9338,
9510,
9511,
9747,
9748,
9900,
9901,
10028,
10058,
10063,
10076,
10092,
10102,
10256,
10257,
10370,
10371,
10470,
10471,
10516,
10546,
10558,
10559,
10587,
10628,
10703,
10724,
10813,
10836,
10939
],
"line_end_idx": [
45,
46,
52,
65,
67,
76,
475,
476,
592,
593,
720,
750,
757,
768,
784,
793,
932,
933,
1358,
1359,
1462,
1492,
1502,
1515,
1531,
1540,
1866,
1896,
1903,
1914,
1930,
1939,
2003,
2004,
2024,
2025,
2031,
2044,
2065,
2089,
2116,
2123,
2124,
2143,
2163,
2182,
2183,
2230,
2276,
2278,
2295,
2369,
2397,
2417,
2458,
2508,
2573,
2583,
2642,
2653,
2655,
2656,
2798,
2799,
2826,
2856,
2862,
2875,
2877,
2886,
2930,
2931,
2950,
2980,
2986,
2999,
3001,
3010,
3028,
3029,
3115,
3116,
3136,
3142,
3180,
3233,
3301,
3302,
3358,
3359,
3532,
3686,
3842,
3843,
4004,
4005,
4013,
4043,
4053,
4066,
4082,
4091,
4285,
4286,
4322,
4323,
4396,
4397,
4415,
4416,
4445,
4446,
4454,
4484,
4490,
4503,
4505,
4514,
4551,
4552,
4693,
4694,
4926,
4956,
4963,
4974,
4990,
4999,
5189,
5190,
5217,
5247,
5257,
5270,
5286,
5296,
5345,
6737,
6767,
6774,
6785,
6801,
6811,
6825,
6921,
6995,
7104,
7187,
7258,
7361,
7362,
7389,
7419,
7425,
7438,
7440,
7450,
7475,
7571,
7645,
7754,
7837,
7908,
8011,
8012,
8154,
8155,
8268,
8298,
8305,
8316,
8332,
8342,
8489,
8490,
8517,
8547,
8556,
8569,
8585,
8595,
8626,
8627,
8633,
8656,
8679,
8680,
8705,
8718,
8725,
8726,
8811,
8812,
8837,
8839,
8846,
8847,
8854,
8855,
8905,
8906,
8912,
8938,
8939,
9016,
9018,
9045,
9047,
9048,
9337,
9338,
9510,
9511,
9747,
9748,
9900,
9901,
10028,
10058,
10063,
10076,
10092,
10102,
10256,
10257,
10370,
10371,
10470,
10471,
10516,
10546,
10558,
10559,
10587,
10628,
10703,
10724,
10813,
10836,
10939,
10958
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 10958,
"ccnet_original_nlines": 240,
"rps_doc_curly_bracket": 0.000547549978364259,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3379143178462982,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03112369030714035,
"rps_doc_frac_lines_end_with_ellipsis": 0.012448130175471306,
"rps_doc_frac_no_alph_words": 0.28294259309768677,
"rps_doc_frac_unique_words": 0.32041049003601074,
"rps_doc_mean_word_length": 4.702394485473633,
"rps_doc_num_sentences": 152,
"rps_doc_symbol_to_word_ratio": 0.018189169466495514,
"rps_doc_unigram_entropy": 5.655396461486816,
"rps_doc_word_count": 1754,
"rps_doc_frac_chars_dupe_10grams": 0.2344810962677002,
"rps_doc_frac_chars_dupe_5grams": 0.3203200697898865,
"rps_doc_frac_chars_dupe_6grams": 0.30419495701789856,
"rps_doc_frac_chars_dupe_7grams": 0.29837536811828613,
"rps_doc_frac_chars_dupe_8grams": 0.2881910800933838,
"rps_doc_frac_chars_dupe_9grams": 0.26357904076576233,
"rps_doc_frac_chars_top_2gram": 0.005819589830935001,
"rps_doc_frac_chars_top_3gram": 0.029097959399223328,
"rps_doc_frac_chars_top_4gram": 0.03273520991206169,
"rps_doc_books_importance": -1112.8973388671875,
"rps_doc_books_importance_length_correction": -1112.8973388671875,
"rps_doc_openwebtext_importance": -523.2301025390625,
"rps_doc_openwebtext_importance_length_correction": -523.2301025390625,
"rps_doc_wikipedia_importance": -412.4344177246094,
"rps_doc_wikipedia_importance_length_correction": -412.4344177246094
},
"fasttext": {
"dclm": 0.3599075675010681,
"english": 0.8694072961807251,
"fineweb_edu_approx": 1.8614901304244995,
"eai_general_math": 0.4667046070098877,
"eai_open_web_math": 0.3558635711669922,
"eai_web_code": 0.01911449059844017
}
} | {
"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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
739,935,511,124,810,100 | WC_Eval_Math{}WC 1.0
Class WC_Eval_Math. Supports basic math only (removed eval function).
Based on EvalMath by Miles Kaufman Copyright (C) 2005 Miles Kaufmann http://www.twmagic.com/.
Хуков нет.
Использование
$WC_Eval_Math = new WC_Eval_Math();
// use class methods
Методы
1. private static debugPrintCallingFunction()
2. public static evaluate( $expr )
3. private static nfx( $expr )
4. private static pfx( $tokens, $vars = array() )
5. private static trigger( $msg )
Код WC_Eval_Math{} WC 6.4.1
class WC_Eval_Math {
/**
* Last error.
*
* @var string
*/
public static $last_error = null;
/**
* Variables (and constants).
*
* @var array
*/
public static $v = array( 'e' => 2.71, 'pi' => 3.14 );
/**
* User-defined functions.
*
* @var array
*/
public static $f = array();
/**
* Constants.
*
* @var array
*/
public static $vb = array( 'e', 'pi' );
/**
* Built-in functions.
*
* @var array
*/
public static $fb = array();
/**
* Evaluate maths string.
*
* @param string $expr
* @return mixed
*/
public static function evaluate( $expr ) {
self::$last_error = null;
$expr = trim( $expr );
if ( substr( $expr, -1, 1 ) == ';' ) {
$expr = substr( $expr, 0, strlen( $expr ) -1 ); // strip semicolons at the end
}
// ===============
// is it a variable assignment?
if ( preg_match( '/^\s*([a-z]\w*)\s*=\s*(.+)$/', $expr, $matches ) ) {
if ( in_array( $matches[1], self::$vb ) ) { // make sure we're not assigning to a constant
return self::trigger( "cannot assign to constant '$matches[1]'" );
}
if ( ( $tmp = self::pfx( self::nfx( $matches[2] ) ) ) === false ) {
return false; // get the result and make sure it's good
}
self::$v[ $matches[1] ] = $tmp; // if so, stick it in the variable array
return self::$v[ $matches[1] ]; // and return the resulting value
// ===============
// is it a function assignment?
} elseif ( preg_match( '/^\s*([a-z]\w*)\s*\(\s*([a-z]\w*(?:\s*,\s*[a-z]\w*)*)\s*\)\s*=\s*(.+)$/', $expr, $matches ) ) {
$fnn = $matches[1]; // get the function name
if ( in_array( $matches[1], self::$fb ) ) { // make sure it isn't built in
return self::trigger( "cannot redefine built-in function '$matches[1]()'" );
}
$args = explode( ",", preg_replace( "/\s+/", "", $matches[2] ) ); // get the arguments
if ( ( $stack = self::nfx( $matches[3] ) ) === false ) {
return false; // see if it can be converted to postfix
}
$stack_size = count( $stack );
for ( $i = 0; $i < $stack_size; $i++ ) { // freeze the state of the non-argument variables
$token = $stack[ $i ];
if ( preg_match( '/^[a-z]\w*$/', $token ) and ! in_array( $token, $args ) ) {
if ( array_key_exists( $token, self::$v ) ) {
$stack[ $i ] = self::$v[ $token ];
} else {
return self::trigger( "undefined variable '$token' in function definition" );
}
}
}
self::$f[ $fnn ] = array( 'args' => $args, 'func' => $stack );
return true;
// ===============
} else {
return self::pfx( self::nfx( $expr ) ); // straight up evaluation, woo
}
}
/**
* Convert infix to postfix notation.
*
* @param string $expr
*
* @return array|string
*/
private static function nfx( $expr ) {
$index = 0;
$stack = new WC_Eval_Math_Stack;
$output = array(); // postfix form of expression, to be passed to pfx()
$expr = trim( $expr );
$ops = array( '+', '-', '*', '/', '^', '_' );
$ops_r = array( '+' => 0, '-' => 0, '*' => 0, '/' => 0, '^' => 1 ); // right-associative operator?
$ops_p = array( '+' => 0, '-' => 0, '*' => 1, '/' => 1, '_' => 1, '^' => 2 ); // operator precedence
$expecting_op = false; // we use this in syntax-checking the expression
// and determining when a - is a negation
if ( preg_match( "/[^\w\s+*^\/()\.,-]/", $expr, $matches ) ) { // make sure the characters are all good
return self::trigger( "illegal character '{$matches[0]}'" );
}
while ( 1 ) { // 1 Infinite Loop ;)
$op = substr( $expr, $index, 1 ); // get the first character at the current index
// find out if we're currently at the beginning of a number/variable/function/parenthesis/operand
$ex = preg_match( '/^([A-Za-z]\w*\(?|\d+(?:\.\d*)?|\.\d+|\()/', substr( $expr, $index ), $match );
// ===============
if ( '-' === $op and ! $expecting_op ) { // is it a negation instead of a minus?
$stack->push( '_' ); // put a negation on the stack
$index++;
} elseif ( '_' === $op ) { // we have to explicitly deny this, because it's legal on the stack
return self::trigger( "illegal character '_'" ); // but not in the input expression
// ===============
} elseif ( ( in_array( $op, $ops ) or $ex ) and $expecting_op ) { // are we putting an operator on the stack?
if ( $ex ) { // are we expecting an operator but have a number/variable/function/opening parenthesis?
$op = '*';
$index--; // it's an implicit multiplication
}
// heart of the algorithm:
while ( $stack->count > 0 and ( $o2 = $stack->last() ) and in_array( $o2, $ops ) and ( $ops_r[ $op ] ? $ops_p[ $op ] < $ops_p[ $o2 ] : $ops_p[ $op ] <= $ops_p[ $o2 ] ) ) {
$output[] = $stack->pop(); // pop stuff off the stack into the output
}
// many thanks: https://en.wikipedia.org/wiki/Reverse_Polish_notation#The_algorithm_in_detail
$stack->push( $op ); // finally put OUR operator onto the stack
$index++;
$expecting_op = false;
// ===============
} elseif ( ')' === $op && $expecting_op ) { // ready to close a parenthesis?
while ( ( $o2 = $stack->pop() ) != '(' ) { // pop off the stack back to the last (
if ( is_null( $o2 ) ) {
return self::trigger( "unexpected ')'" );
} else {
$output[] = $o2;
}
}
if ( preg_match( "/^([A-Za-z]\w*)\($/", $stack->last( 2 ), $matches ) ) { // did we just close a function?
$fnn = $matches[1]; // get the function name
$arg_count = $stack->pop(); // see how many arguments there were (cleverly stored on the stack, thank you)
$output[] = $stack->pop(); // pop the function and push onto the output
if ( in_array( $fnn, self::$fb ) ) { // check the argument count
if ( $arg_count > 1 ) {
return self::trigger( "too many arguments ($arg_count given, 1 expected)" );
}
} elseif ( array_key_exists( $fnn, self::$f ) ) {
if ( count( self::$f[ $fnn ]['args'] ) != $arg_count ) {
return self::trigger( "wrong number of arguments ($arg_count given, " . count( self::$f[ $fnn ]['args'] ) . " expected)" );
}
} else { // did we somehow push a non-function on the stack? this should never happen
return self::trigger( "internal error" );
}
}
$index++;
// ===============
} elseif ( ',' === $op and $expecting_op ) { // did we just finish a function argument?
while ( ( $o2 = $stack->pop() ) != '(' ) {
if ( is_null( $o2 ) ) {
return self::trigger( "unexpected ','" ); // oops, never had a (
} else {
$output[] = $o2; // pop the argument expression stuff and push onto the output
}
}
// make sure there was a function
if ( ! preg_match( "/^([A-Za-z]\w*)\($/", $stack->last( 2 ), $matches ) ) {
return self::trigger( "unexpected ','" );
}
$stack->push( $stack->pop() + 1 ); // increment the argument count
$stack->push( '(' ); // put the ( back on, we'll need to pop back to it again
$index++;
$expecting_op = false;
// ===============
} elseif ( '(' === $op and ! $expecting_op ) {
$stack->push( '(' ); // that was easy
$index++;
// ===============
} elseif ( $ex and ! $expecting_op ) { // do we now have a function/variable/number?
$expecting_op = true;
$val = $match[1];
if ( preg_match( "/^([A-Za-z]\w*)\($/", $val, $matches ) ) { // may be func, or variable w/ implicit multiplication against parentheses...
if ( in_array( $matches[1], self::$fb ) or array_key_exists( $matches[1], self::$f ) ) { // it's a func
$stack->push( $val );
$stack->push( 1 );
$stack->push( '(' );
$expecting_op = false;
} else { // it's a var w/ implicit multiplication
$val = $matches[1];
$output[] = $val;
}
} else { // it's a plain old var or num
$output[] = $val;
}
$index += strlen( $val );
// ===============
} elseif ( ')' === $op ) { // miscellaneous error checking
return self::trigger( "unexpected ')'" );
} elseif ( in_array( $op, $ops ) and ! $expecting_op ) {
return self::trigger( "unexpected operator '$op'" );
} else { // I don't even want to know what you did to get here
return self::trigger( "an unexpected error occurred" );
}
if ( strlen( $expr ) == $index ) {
if ( in_array( $op, $ops ) ) { // did we end with an operator? bad.
return self::trigger( "operator '$op' lacks operand" );
} else {
break;
}
}
while ( substr( $expr, $index, 1 ) == ' ' ) { // step the index past whitespace (pretty much turns whitespace
$index++; // into implicit multiplication if no operator is there)
}
}
while ( ! is_null( $op = $stack->pop() ) ) { // pop everything off the stack and push onto output
if ( '(' === $op ) {
return self::trigger( "expecting ')'" ); // if there are (s on the stack, ()s were unbalanced
}
$output[] = $op;
}
return $output;
}
/**
* Evaluate postfix notation.
*
* @param mixed $tokens
* @param array $vars
*
* @return mixed
*/
private static function pfx( $tokens, $vars = array() ) {
if ( false == $tokens ) {
return false;
}
$stack = new WC_Eval_Math_Stack;
foreach ( $tokens as $token ) { // nice and easy
// if the token is a binary operator, pop two values off the stack, do the operation, and push the result back on
if ( in_array( $token, array( '+', '-', '*', '/', '^' ) ) ) {
if ( is_null( $op2 = $stack->pop() ) ) {
return self::trigger( "internal error" );
}
if ( is_null( $op1 = $stack->pop() ) ) {
return self::trigger( "internal error" );
}
switch ( $token ) {
case '+':
$stack->push( $op1 + $op2 );
break;
case '-':
$stack->push( $op1 - $op2 );
break;
case '*':
$stack->push( $op1 * $op2 );
break;
case '/':
if ( 0 == $op2 ) {
return self::trigger( 'division by zero' );
}
$stack->push( $op1 / $op2 );
break;
case '^':
$stack->push( pow( $op1, $op2 ) );
break;
}
// if the token is a unary operator, pop one value off the stack, do the operation, and push it back on
} elseif ( '_' === $token ) {
$stack->push( -1 * $stack->pop() );
// if the token is a function, pop arguments off the stack, hand them to the function, and push the result back on
} elseif ( ! preg_match( "/^([a-z]\w*)\($/", $token, $matches ) ) {
if ( is_numeric( $token ) ) {
$stack->push( $token );
} elseif ( array_key_exists( $token, self::$v ) ) {
$stack->push( self::$v[ $token ] );
} elseif ( array_key_exists( $token, $vars ) ) {
$stack->push( $vars[ $token ] );
} else {
return self::trigger( "undefined variable '$token'" );
}
}
}
// when we're out of tokens, the stack should have a single element, the final result
if ( 1 != $stack->count ) {
return self::trigger( "internal error" );
}
return $stack->pop();
}
/**
* Trigger an error, but nicely, if need be.
*
* @param string $msg
*
* @return bool
*/
private static function trigger( $msg ) {
self::$last_error = $msg;
if ( ! Constants::is_true( 'DOING_AJAX' ) && Constants::is_true( 'WP_DEBUG' ) ) {
echo "\nError found in:";
self::debugPrintCallingFunction();
trigger_error( $msg, E_USER_WARNING );
}
return false;
}
/**
* Prints the file name, function name, and
* line number which called your function
* (not this function, then one that called
* it to begin with)
*/
private static function debugPrintCallingFunction() {
$file = 'n/a';
$func = 'n/a';
$line = 'n/a';
$debugTrace = debug_backtrace();
if ( isset( $debugTrace[1] ) ) {
$file = $debugTrace[1]['file'] ? $debugTrace[1]['file'] : 'n/a';
$line = $debugTrace[1]['line'] ? $debugTrace[1]['line'] : 'n/a';
}
if ( isset( $debugTrace[2] ) ) {
$func = $debugTrace[2]['function'] ? $debugTrace[2]['function'] : 'n/a';
}
echo "\n$file, $func, $line\n";
}
} | {
"url": "https://wp-kama.ru/plugin/woocommerce/function/WC_Eval_Math",
"source_domain": "wp-kama.ru",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "115077",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:APDI2SKSAYB73KMIYYAARW4TB4FDO3H5",
"WARC-Concurrent-To": "<urn:uuid:ed2af312-2f13-4719-afa0-60590f60df50>",
"WARC-Date": "2022-05-26T10:56:50Z",
"WARC-IP-Address": "45.130.41.31",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6EMVN5RV3VZYF2BQSD6BDNOOFIK24ZJN",
"WARC-Record-ID": "<urn:uuid:b6cfc0b5-07cd-400f-9590-2207b208e1d2>",
"WARC-Target-URI": "https://wp-kama.ru/plugin/woocommerce/function/WC_Eval_Math",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c4716b82-b826-410b-bd48-a2ccb2105313>"
},
"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-196\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,
21,
22,
92,
93,
187,
188,
199,
200,
214,
215,
251,
272,
273,
280,
281,
329,
366,
399,
451,
487,
488,
516,
517,
538,
539,
544,
560,
564,
580,
585,
620,
621,
626,
657,
661,
676,
681,
737,
738,
743,
771,
775,
790,
795,
824,
825,
830,
845,
849,
864,
869,
910,
911,
916,
940,
944,
959,
964,
994,
995,
1000,
1027,
1031,
1056,
1074,
1079,
1123,
1151,
1176,
1217,
1299,
1303,
1324,
1358,
1431,
1525,
1596,
1601,
1672,
1732,
1737,
1813,
1882,
1904,
1939,
2061,
2109,
2187,
2268,
2273,
2363,
2423,
2482,
2487,
2521,
2615,
2642,
2724,
2775,
2816,
2830,
2914,
2921,
2927,
2932,
2998,
3014,
3036,
3047,
3121,
3125,
3128,
3129,
3134,
3173,
3177,
3202,
3206,
3231,
3236,
3276,
3277,
3291,
3326,
3400,
3425,
3426,
3476,
3577,
3680,
3681,
3755,
3799,
3905,
3969,
3973,
3974,
4012,
4097,
4198,
4300,
4322,
4406,
4462,
4476,
4574,
4662,
4685,
4798,
4904,
4920,
4970,
4976,
5007,
5183,
5258,
5264,
5362,
5430,
5444,
5471,
5494,
5574,
5661,
5690,
5738,
5752,
5775,
5782,
5788,
5899,
5949,
6061,
6138,
6208,
6238,
6322,
6330,
6385,
6448,
6579,
6587,
6678,
6726,
6733,
6739,
6753,
6776,
6867,
6914,
6943,
7014,
7028,
7113,
7120,
7126,
7164,
7244,
7291,
7297,
7368,
7450,
7464,
7491,
7514,
7564,
7606,
7620,
7643,
7731,
7757,
7779,
7922,
8031,
8059,
8084,
8111,
8140,
8195,
8221,
8245,
8252,
8296,
8319,
8325,
8355,
8378,
8440,
8486,
8546,
8603,
8669,
8729,
8734,
8772,
8844,
8905,
8918,
8930,
8936,
8941,
9054,
9153,
9158,
9162,
9262,
9286,
9384,
9389,
9409,
9413,
9431,
9434,
9435,
9440,
9471,
9475,
9501,
9525,
9529,
9547,
9552,
9611,
9639,
9656,
9660,
9695,
9696,
9747,
9864,
9929,
9974,
10021,
10027,
10072,
10119,
10125,
10149,
10164,
10199,
10212,
10227,
10262,
10275,
10290,
10325,
10338,
10353,
10378,
10429,
10437,
10472,
10485,
10500,
10541,
10554,
10560,
10668,
10701,
10741,
10860,
10931,
10965,
10994,
11050,
11091,
11144,
11182,
11195,
11255,
11261,
11266,
11270,
11358,
11388,
11433,
11437,
11461,
11464,
11465,
11470,
11516,
11520,
11544,
11548,
11565,
11570,
11613,
11641,
11725,
11754,
11792,
11834,
11838,
11854,
11857,
11858,
11863,
11908,
11951,
11997,
12019,
12024,
12079,
12096,
12113,
12130,
12165,
12200,
12268,
12336,
12340,
12375,
12451,
12455,
12489,
12492
],
"line_end_idx": [
21,
22,
92,
93,
187,
188,
199,
200,
214,
215,
251,
272,
273,
280,
281,
329,
366,
399,
451,
487,
488,
516,
517,
538,
539,
544,
560,
564,
580,
585,
620,
621,
626,
657,
661,
676,
681,
737,
738,
743,
771,
775,
790,
795,
824,
825,
830,
845,
849,
864,
869,
910,
911,
916,
940,
944,
959,
964,
994,
995,
1000,
1027,
1031,
1056,
1074,
1079,
1123,
1151,
1176,
1217,
1299,
1303,
1324,
1358,
1431,
1525,
1596,
1601,
1672,
1732,
1737,
1813,
1882,
1904,
1939,
2061,
2109,
2187,
2268,
2273,
2363,
2423,
2482,
2487,
2521,
2615,
2642,
2724,
2775,
2816,
2830,
2914,
2921,
2927,
2932,
2998,
3014,
3036,
3047,
3121,
3125,
3128,
3129,
3134,
3173,
3177,
3202,
3206,
3231,
3236,
3276,
3277,
3291,
3326,
3400,
3425,
3426,
3476,
3577,
3680,
3681,
3755,
3799,
3905,
3969,
3973,
3974,
4012,
4097,
4198,
4300,
4322,
4406,
4462,
4476,
4574,
4662,
4685,
4798,
4904,
4920,
4970,
4976,
5007,
5183,
5258,
5264,
5362,
5430,
5444,
5471,
5494,
5574,
5661,
5690,
5738,
5752,
5775,
5782,
5788,
5899,
5949,
6061,
6138,
6208,
6238,
6322,
6330,
6385,
6448,
6579,
6587,
6678,
6726,
6733,
6739,
6753,
6776,
6867,
6914,
6943,
7014,
7028,
7113,
7120,
7126,
7164,
7244,
7291,
7297,
7368,
7450,
7464,
7491,
7514,
7564,
7606,
7620,
7643,
7731,
7757,
7779,
7922,
8031,
8059,
8084,
8111,
8140,
8195,
8221,
8245,
8252,
8296,
8319,
8325,
8355,
8378,
8440,
8486,
8546,
8603,
8669,
8729,
8734,
8772,
8844,
8905,
8918,
8930,
8936,
8941,
9054,
9153,
9158,
9162,
9262,
9286,
9384,
9389,
9409,
9413,
9431,
9434,
9435,
9440,
9471,
9475,
9501,
9525,
9529,
9547,
9552,
9611,
9639,
9656,
9660,
9695,
9696,
9747,
9864,
9929,
9974,
10021,
10027,
10072,
10119,
10125,
10149,
10164,
10199,
10212,
10227,
10262,
10275,
10290,
10325,
10338,
10353,
10378,
10429,
10437,
10472,
10485,
10500,
10541,
10554,
10560,
10668,
10701,
10741,
10860,
10931,
10965,
10994,
11050,
11091,
11144,
11182,
11195,
11255,
11261,
11266,
11270,
11358,
11388,
11433,
11437,
11461,
11464,
11465,
11470,
11516,
11520,
11544,
11548,
11565,
11570,
11613,
11641,
11725,
11754,
11792,
11834,
11838,
11854,
11857,
11858,
11863,
11908,
11951,
11997,
12019,
12024,
12079,
12096,
12113,
12130,
12165,
12200,
12268,
12336,
12340,
12375,
12451,
12455,
12489,
12492,
12493
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 12493,
"ccnet_original_nlines": 357,
"rps_doc_curly_bracket": 0.012006719596683979,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16883942484855652,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003815579926595092,
"rps_doc_frac_lines_end_with_ellipsis": 0.0027932999655604362,
"rps_doc_frac_no_alph_words": 0.5494435429573059,
"rps_doc_frac_unique_words": 0.28449612855911255,
"rps_doc_mean_word_length": 5.229457378387451,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0.0006359299877658486,
"rps_doc_unigram_entropy": 5.277791500091553,
"rps_doc_word_count": 1290,
"rps_doc_frac_chars_dupe_10grams": 0.01126594003289938,
"rps_doc_frac_chars_dupe_5grams": 0.12348058074712753,
"rps_doc_frac_chars_dupe_6grams": 0.07471094280481339,
"rps_doc_frac_chars_dupe_7grams": 0.034983690828084946,
"rps_doc_frac_chars_dupe_8grams": 0.02075304090976715,
"rps_doc_frac_chars_dupe_9grams": 0.01126594003289938,
"rps_doc_frac_chars_top_2gram": 0.05292024835944176,
"rps_doc_frac_chars_top_3gram": 0.008894160389900208,
"rps_doc_frac_chars_top_4gram": 0.011858879588544369,
"rps_doc_books_importance": -1441.926513671875,
"rps_doc_books_importance_length_correction": -1441.926513671875,
"rps_doc_openwebtext_importance": -900.5361938476562,
"rps_doc_openwebtext_importance_length_correction": -900.5361938476562,
"rps_doc_wikipedia_importance": -630.754150390625,
"rps_doc_wikipedia_importance_length_correction": -630.754150390625
},
"fasttext": {
"dclm": 0.8913992047309875,
"english": 0.3610968291759491,
"fineweb_edu_approx": 1.8099008798599243,
"eai_general_math": 0.8934127688407898,
"eai_open_web_math": 0.28001517057418823,
"eai_web_code": 0.9922974109649658
}
} | {
"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": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,225,233,976,474,202,000 | top of page
Fitness Freaks
Public·75 members
Luke Bell
Luke Bell
M3 Data Recovery Full Version Crack + License Key: How to Avoid the Risks and Find the Best Solution
, , , , , , etc. Here is the second table: Article with HTML formatting --- M3 Data Recovery Crack License Key: Is It Worth It?
Data loss is a common and frustrating problem that can happen to anyone. Whether it is due to accidental deletion, formatting, partition error, virus attack, or other reasons, losing your important files can be a nightmare. Fortunately, there are many data recovery software tools that can help you recover your lost data from various devices and situations. One of them is M3 Data Recovery.
m3 data recovery crack license key
M3 Data Recovery is a professional and easy-to-use data recovery software that can recover deleted or lost files from hard drives, external drives, memory cards, USB flash drives, and other storage media. It can also recover data from RAW, inaccessible, corrupted, or damaged partitions. It supports various file systems, such as NTFS, FAT32, exFAT, EXT2/EXT3/EXT4, and more.
However, M3 Data Recovery is not a free software. You need to purchase a license key to activate its full features and recover unlimited data. The price of M3 Data Recovery ranges from $59.99 to $299.99 per year, depending on the edition and the number of devices you want to use it on.
Some people may think that this price is too high or unaffordable for them. They may look for ways to get M3 Data Recovery for free or at a lower cost. They may search for M3 Data Recovery crack license key on the internet, hoping to find a way to bypass the activation process and use the software without paying anything.
But is this a wise and safe choice? What are the risks and consequences of using M3 Data Recovery crack license key? Are there any alternatives to using M3 Data Recovery crack license key? In this article, we will answer these questions and help you make an informed decision.
What is M3 Data Recovery?
M3 Data Recovery is a data recovery software developed by M3 Technic Inc., a company that specializes in data security solutions. It was first released in 2010 and has been updated regularly since then. It has four main modules:
• Data Recovery: This module can recover deleted or lost files from various devices and situations, such as formatted drive, RAW drive, corrupted drive, deleted partition, lost partition, etc.
• RAW Drive Recovery: This module can fix RAW drive and convert RAW to NTFS/FAT32 without data loss.
• BitLocker Recovery: This module can recover data from BitLocker encrypted drive that is formatted, corrupted, failed, inaccessible, or deleted.
• Lost Partition Recovery: This module can quickly find out the deleted or lost partitions and restore them with original data.
M3 Data Recovery has a simple and intuitive user interface that guides you through the recovery process step by step. You can preview the recoverable files before saving them to a safe location. You can also pause, resume, or stop the scanning process at any time. M3 Data Recovery supports Windows 10/8/7/Vista/XP and Windows Server 2019/2016/2012/2008/2003.
Features and benefits of M3 Data Recovery
Some of the features and benefits of M3 Data Recovery are:
• It can recover various types of files, such as photos, videos, music, documents, emails, archives, etc.
• It can recover data from different kinds of devices, such as hard drives, SSDs, external drives, memory cards, USB flash drives, etc.
• It can recover data from different kinds of situations, such as accidental deletion, formatting, partition error, virus attack, system crash, power failure, etc.
• It can fix RAW drive and convert RAW to NTFS/FAT32 without data loss.
• It can recover data from BitLocker encrypted drive that is formatted, corrupted, failed, inaccessible, or deleted.
• It can quickly find out the deleted or lost partitions and restore them with original data.
• It has a simple and intuitive user interface that guides you through the recovery process step by step.
• It allows you to preview the recoverable files before saving them to a safe location.
• It allows you to pause, resume, or stop the scanning process at any time.
• It supports Windows 10/8/7/Vista/XP and Windows Server 2019/2016/2012/2008/2003.
Limitations and drawbacks of M3 Data Recovery
However, M3 Data Recovery also has some limitations and drawbacks that you should be aware of:
• It is not a free software. You need to purchase a license key to activate its full features and recover unlimited data. The price of M3 Data Recovery ranges from $59.99 to $299.99 per year, depending on the edition and the number of devices you want to use it on.
• It does not guarantee 100% data recovery. Some files may be overwritten, corrupted, or damaged beyond recovery. The success rate of data recovery depends on various factors, such as the cause of data loss, the condition of the device, the file system type, the file size, etc.
• It may take a long time to scan and recover large amounts of data. The scanning speed and the recovery time depend on the size of the device, the amount of data, the complexity of the situation, etc.
• It may not be compatible with some devices or file systems. For example, it does not support Mac OS X or Linux operating systems. It also does not support HFS+, APFS, ReFS, XFS, Btrfs, or other file systems that are not commonly used in Windows.
What is M3 Data Recovery crack license key?
M3 Data Recovery crack license key is a term that refers to a hacked or pirated version of M3 Data Recovery software that can be used without paying for it. It usually involves modifying or bypassing the activation process of M3 Data Recovery software by using a fake or stolen license key.
M3 Data Recovery crack license key can be found on some websites that offer free downloads of cracked software. These websites may claim that they provide M3 Data Recovery crack license key for free or at a lower cost than the official website. They may also claim that they provide M3 Data Recovery crack license key with full features and no limitations.
How does M3 Data Recovery crack license key work?
M3 Data Recovery crack license key works by tricking the software into thinking that it is activated with a valid license key. There are different methods that can be used to create or use M3 Data Recovery crack license key:
• Keygen: A keygen is a program that can generate random license keys for M3 Data Recovery software. The user can run the keygen and enter the generated license key into the software to activate it.
• Patch: A patch is a program that can modify or replace some files or codes in M3 Data Recovery software. The user can run the patch and apply it to the software to activate it.
• Loader: A loader is a program that can load M3 Data Recovery software with a pre-activated license key. The user can run the loader and launch the software with it to activate it.
• Cracked version: A cracked version is a copy of M3 Data Recovery software that has been already activated with a license key. The user can download and install the cracked version and use it without any activation.
Why do some people look for M3 Data Recovery crack license key?
Some people may look for M3 Data Recovery crack license key for various reasons, such as:
• They want to save money and avoid paying for the official license key of M3 Data Recovery software.
• They want to test the full features and performance of M3 Data Recovery software before buying it.
• They want to recover their lost data as soon as possible and do not have time or patience to purchase the official license key of M3 Data Recovery software.
• They do not trust the official website or the payment methods of M3 Data Recovery software.
• They do not care about the legal issues or ethical concerns of using M3 Data Recovery crack license key.
What are the risks and consequences of using M3 Data Recovery crack license key?
However, using M3 Data Recovery crack license key is not a wise or safe choice. It can bring many risks and consequences that can outweigh the benefits. Some of the risks and consequences of using M3 Data Recovery crack license key are:
Legal issues and ethical concerns of using M3 Data Recovery crack license key
Using M3 Data Recovery crack license key is illegal and unethical. It violates the intellectual property rights and the terms of service of M3 Technic Inc., the developer of M3 Data Recovery software. It also infringes the copyright laws and the anti-piracy laws of your country or region.
If you use M3 Data Recovery crack license key, you may face legal actions or penalties from M3 Technic Inc. or the authorities. You may be sued, fined, or even jailed for using M3 Data Recovery crack license key. You may also damage your reputation and credibility as a professional or a user.
Besides, using M3 Data Recovery crack license key is unfair and disrespectful to the developers and the creators of M3 Data Recovery software. They have spent a lot of time, effort, and money to develop and update M3 Data Recovery software. They deserve to be rewarded and supported for their work. By using M3 Data Recovery crack license key, you are depriving them of their rightful income and recognition.
Technical problems and data loss risks of using M3 Data Recovery crack license key
Using M3 Data Recovery crack license key can also cause technical problems and data loss risks. Since M3 Data Recovery crack license key is not an official or authorized version of M3 Data Recovery software, it may not work properly or stably on your device. It may have bugs, errors, or compatibility issues that can affect the performance and functionality of M3 Data Recovery software.
If you use M3 Data Recovery crack license key, you may encounter problems such as:
• The software may fail to scan or recover your data.
• The software may crash or freeze during the scanning or recovery process.
• The software may damage or overwrite your data during the scanning or recovery process.
• The software may recover incomplete, corrupted, or wrong data.
• The software may not be able to recover all types of files, devices, or situations.
These problems can result in further data loss or data corruption. You may lose your important files permanently or irreversibly. You may also waste your time and energy trying to fix these problems or find another solution.
Security threats and malware infections of using M3 Data Recovery crack license key
Using M3 Data Recovery crack license key can also expose you to security threats and malware infections. Since M3 Data Recovery crack license key is obtained from untrusted sources, such as websites that offer free downloads of cracked software, it may contain viruses, trojans, worms, spyware, ransomware, adware, or other malicious programs that can harm your device or data.
If you use M3 Data Recovery crack license key, you may face dangers such as:
• Your device may be infected with malware that can slow down, damage, or take over your device.
• Your data may be stolen, encrypted, deleted, or leaked by malware that can access your device or data.
• Your privacy may be violated by malware that can monitor your online activities, collect your personal information, or send spam messages to your contacts.
• Your security may be compromised by malware that can open backdoors, disable antivirus software, or download more malware to your device.
These dangers can jeopardize your device, data, privacy, and security. You may lose your valuable files or personal information. You may also face legal troubles or financial losses if your data is used for illegal or fraudulent purposes.
What are the alternatives to using M3 Data Recovery crack license key?
As you can see, using M3 Data Recovery crack license key is not worth it. It can bring more harm than good to you and your device. It can also disrespect and harm the developers and the creators of M3 Data Recovery software. Therefore, we strongly advise you not to use M3 Data Recovery crack license key.
Instead, we suggest you to use some alternatives to using M3 Data Recovery crack license key. These alternatives are legal, ethical, safe, and reliable. They can help you recover your lost data without risking your device, data, privacy, or security. Some of the alternatives to using M3 Data Recovery crack license key are:
Use the free version or the trial version of M3 Data Recovery
One of the alternatives to using M3 Data Recovery crack license key is to use the free version or the trial version of M3 Data Recovery software. These versions are official and authorized versions of M3 Data Recovery software that can be downloaded from the official website of M3 Technic Inc.
The free version of M3 Data Recovery software allows you to recover up to 1 GB of data for free. It has all the features and functions of the paid version, except for the BitLocker recovery module. It also has no time limit or expiration date.
The trial version of M3 Data Recovery software allows you to scan and preview your data for free. It has all the features and functions of the paid version, including the BitLocker recovery module. However, it has a time limit of 30 days and a data recovery limit of 100 MB.
By using the free version or the trial version of M3 Data Recovery software, you can test the performance and functionality of M3 Data Recovery software before buying it. You can also recover some of your data for free or at a low cost. You can also enjoy the technical support and updates from M3 Technic Inc.
Purchase the official license key of M3 Data Recovery with a discount
Another alternative to using M3 Data Recovery crack license key is to purchase the official license key of M3 Data Recovery software with a discount. This way, you can activate the full features and recover unlimited data with M3 Data Recovery software at a lower price than the original price.
To purchase the official license key of M3 Data Recovery software with a discount, you can visit the official website of M3 Technic Inc. and check for any promotions or coupons that they offer. You can also visit some reputable websites that sell genuine license keys of M3 Data Recovery software with discounts.
By purchasing the official license key of M3 Data Recovery software with a discount, you can save money and avoid paying for the full price of M3 Data Recovery software. You can also support the developers and the creators of M3 Data Recovery software and appreciate their work. You can also enjoy the technical support and updates from M3 Technic Inc.
Use other reliable and reputable data recovery software
The last alternative to using M3 Data Recovery crack license key is to use other reliable and reputable data recovery software that can help you recover your lost data from various devices and situations. There are many data recovery software tools that are available on the market, both free and paid.
To use other reliable and reputable data recovery software, you can do some research and comparison on different data recovery software tools that suit your needs and preferences. You can check their features, benefits, limitations, drawbacks, prices, reviews, ratings, etc. You can also download their free versions or trial versions to test their performance and functionality before buying them.
By using other reliable and reputable data recovery software, you can have more options and choices to recover your lost data from various devices and situations. You can also find some data recovery software tools that are cheaper or better than M3 Data Recovery software.
Conclusion
Summary of the main points
In conclusion, we have discussed what is M3 Data Recovery crack license key, why do some people look for it, what are the risks and consequences of using it, and what are the alternatives to using it. Here are the main points that we have covered:
• M3 Data Recovery is a professional and easy-to-use data recovery software that can recover deleted or lost files from various devices and situations.M3 Data Recovery crack license key is a hacked or pirated version of M3 Data Recovery software that can be used without paying for it. It usually involves modifying or bypassing the activation process of M3 Data Recovery software by using a fake or stolen license key.
• Some people may look for M3 Data Recovery crack license key to save money, test the software, recover their data quickly, or avoid the official website or payment methods.
• Using M3 Data Recovery crack license key is illegal, unethical, unsafe, and unreliable. It can bring legal issues, ethical concerns, technical problems, data loss risks, security threats, and malware infections.
• The alternatives to using M3 Data Recovery crack license key are to use the free version or the trial version of M3 Data Recovery software, to purchase the official license key of M3 Data Recovery software with a discount, or to use other reliable and reputable data recovery software.
Recommendations and suggestions
Based on the main points that we have covered, we recommend and suggest you to:
• Avoid using M3 Data Recovery crack license key at all costs. It is not worth the risks and consequences that it can bring to you and your device.
• Respect and support the developers and the creators of M3 Data Recovery software. They have worked hard to provide you with a quality product that can help you recover your lost data.
• Choose one of the alternatives to using M3 Data Recovery crack license key that suits your needs and preferences. They are legal, ethical, safe, and reliable ways to recover your lost data from various devices and situations.
Call to action and closing remarks
We hope that this article has helped you understand what is M3 Data Recovery crack license key, why do some people look for it, what are the risks and consequences of using it, and what are the alternatives to using it. We also hope that this article has helped you make an informed decision on how to recover your lost data from various devices and situations.
If you have any questions or comments about this article, please feel free to contact us. We would love to hear from you and help you with your data recovery needs.
If you are ready to recover your lost data from various devices and situations, please visit the official website of M3 Technic Inc. and download the free version or the trial version of M3 Data Recovery software. You can also purchase the official license key of M3 Data Recovery software with a discount from their website or from some reputable websites that sell genuine license keys.
Thank you for reading this article. We wish you all the best in your data recovery journey.
FAQs
Here are some frequently asked questions (FAQs) about M3 Data Recovery crack license key:
Q: Is M3 Data Recovery safe?
A: The official version of M3 Data Recovery software is safe to use. It does not contain any viruses, malware, or spyware. It also does not damage or overwrite your data during the scanning or recovery process. However, the cracked version of M3 Data Recovery software is not safe to us
About
Welcome to the group! You can connect with other members, ge...
Members
Group Page: Groups_SingleGroup
bottom of page | {
"url": "https://www.interestopedia.org/group/fitness-freaks/discussion/5f33e4fb-505e-4e15-bfa3-1e8fa25f06be",
"source_domain": "www.interestopedia.org",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "1050482",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QKAGE63IUI5I2KJRAD2BX64KNKXDZF5X",
"WARC-Concurrent-To": "<urn:uuid:a6857fb0-ca47-4c37-913a-c15a9bd0e1c2>",
"WARC-Date": "2024-08-12T00:30:25Z",
"WARC-IP-Address": "34.149.87.45",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4ZAGIXFLJWHD64HMEHEPMI7ES7GBB4AH",
"WARC-Record-ID": "<urn:uuid:f1806bdf-088e-4d00-93cf-c2200b69f3d7>",
"WARC-Target-URI": "https://www.interestopedia.org/group/fitness-freaks/discussion/5f33e4fb-505e-4e15-bfa3-1e8fa25f06be",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:08fcbcdc-7bd0-476e-8d44-d927f95bdc30>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-90\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
12,
13,
28,
29,
47,
57,
67,
68,
169,
170,
171,
172,
300,
301,
302,
694,
695,
696,
697,
698,
733,
734,
735,
736,
1112,
1113,
1114,
1401,
1402,
1403,
1727,
1728,
1729,
2006,
2007,
2008,
2034,
2035,
2036,
2037,
2038,
2267,
2268,
2269,
2270,
2465,
2466,
2467,
2468,
2571,
2572,
2573,
2574,
2722,
2723,
2724,
2725,
2855,
2856,
2857,
2858,
3218,
3219,
3220,
3262,
3263,
3264,
3265,
3266,
3325,
3326,
3327,
3328,
3436,
3437,
3438,
3439,
3577,
3578,
3579,
3580,
3746,
3747,
3748,
3749,
3823,
3824,
3825,
3826,
3945,
3946,
3947,
3948,
4044,
4045,
4046,
4047,
4155,
4156,
4157,
4158,
4248,
4249,
4250,
4251,
4329,
4330,
4331,
4332,
4417,
4418,
4419,
4420,
4466,
4467,
4468,
4469,
4470,
4565,
4566,
4567,
4568,
4836,
4837,
4838,
4839,
5120,
5121,
5122,
5123,
5327,
5328,
5329,
5330,
5580,
5581,
5582,
5583,
5627,
5628,
5629,
5630,
5631,
5922,
5923,
5924,
6281,
6282,
6283,
6333,
6334,
6335,
6336,
6337,
6562,
6563,
6564,
6565,
6766,
6767,
6768,
6769,
6950,
6951,
6952,
6953,
7137,
7138,
7139,
7140,
7359,
7360,
7361,
7362,
7426,
7427,
7428,
7429,
7430,
7520,
7521,
7522,
7523,
7627,
7628,
7629,
7630,
7733,
7734,
7735,
7736,
7897,
7898,
7899,
7900,
7996,
7997,
7998,
7999,
8108,
8109,
8110,
8111,
8192,
8193,
8194,
8195,
8196,
8433,
8434,
8435,
8513,
8514,
8515,
8516,
8517,
8807,
8808,
8809,
9103,
9104,
9105,
9514,
9515,
9516,
9599,
9600,
9601,
9602,
9603,
9992,
9993,
9994,
10077,
10078,
10079,
10080,
10136,
10137,
10138,
10139,
10217,
10218,
10219,
10220,
10312,
10313,
10314,
10315,
10382,
10383,
10384,
10385,
10473,
10474,
10475,
10476,
10701,
10702,
10703,
10787,
10788,
10789,
10790,
10791,
11169,
11170,
11171,
11248,
11249,
11250,
11251,
11350,
11351,
11352,
11353,
11460,
11461,
11462,
11463,
11623,
11624,
11625,
11626,
11768,
11769,
11770,
11771,
12010,
12011,
12012,
12083,
12084,
12085,
12086,
12087,
12393,
12394,
12395,
12720,
12721,
12722,
12784,
12785,
12786,
12787,
12788,
13083,
13084,
13085,
13329,
13330,
13331,
13606,
13607,
13608,
13919,
13920,
13921,
13991,
13992,
13993,
13994,
13995,
14290,
14291,
14292,
14605,
14606,
14607,
14960,
14961,
14962,
15018,
15019,
15020,
15021,
15022,
15325,
15326,
15327,
15726,
15727,
15728,
16002,
16003,
16004,
16015,
16016,
16017,
16018,
16019,
16046,
16047,
16048,
16049,
16050,
16298,
16299,
16300,
16301,
16723,
16724,
16725,
16726,
16902,
16903,
16904,
16905,
17121,
17122,
17123,
17124,
17414,
17415,
17416,
17417,
17449,
17450,
17451,
17452,
17453,
17533,
17534,
17535,
17536,
17686,
17687,
17688,
17689,
17877,
17878,
17879,
17880,
18110,
18111,
18112,
18113,
18148,
18149,
18150,
18151,
18152,
18514,
18515,
18516,
18681,
18682,
18683,
19072,
19073,
19074,
19166,
19167,
19168,
19173,
19174,
19175,
19176,
19177,
19267,
19268,
19269,
19298,
19299,
19300,
19301,
19302,
19589,
19590,
19591,
19597,
19598,
19662,
19663,
19671,
19672,
19703
],
"line_end_idx": [
12,
13,
28,
29,
47,
57,
67,
68,
169,
170,
171,
172,
300,
301,
302,
694,
695,
696,
697,
698,
733,
734,
735,
736,
1112,
1113,
1114,
1401,
1402,
1403,
1727,
1728,
1729,
2006,
2007,
2008,
2034,
2035,
2036,
2037,
2038,
2267,
2268,
2269,
2270,
2465,
2466,
2467,
2468,
2571,
2572,
2573,
2574,
2722,
2723,
2724,
2725,
2855,
2856,
2857,
2858,
3218,
3219,
3220,
3262,
3263,
3264,
3265,
3266,
3325,
3326,
3327,
3328,
3436,
3437,
3438,
3439,
3577,
3578,
3579,
3580,
3746,
3747,
3748,
3749,
3823,
3824,
3825,
3826,
3945,
3946,
3947,
3948,
4044,
4045,
4046,
4047,
4155,
4156,
4157,
4158,
4248,
4249,
4250,
4251,
4329,
4330,
4331,
4332,
4417,
4418,
4419,
4420,
4466,
4467,
4468,
4469,
4470,
4565,
4566,
4567,
4568,
4836,
4837,
4838,
4839,
5120,
5121,
5122,
5123,
5327,
5328,
5329,
5330,
5580,
5581,
5582,
5583,
5627,
5628,
5629,
5630,
5631,
5922,
5923,
5924,
6281,
6282,
6283,
6333,
6334,
6335,
6336,
6337,
6562,
6563,
6564,
6565,
6766,
6767,
6768,
6769,
6950,
6951,
6952,
6953,
7137,
7138,
7139,
7140,
7359,
7360,
7361,
7362,
7426,
7427,
7428,
7429,
7430,
7520,
7521,
7522,
7523,
7627,
7628,
7629,
7630,
7733,
7734,
7735,
7736,
7897,
7898,
7899,
7900,
7996,
7997,
7998,
7999,
8108,
8109,
8110,
8111,
8192,
8193,
8194,
8195,
8196,
8433,
8434,
8435,
8513,
8514,
8515,
8516,
8517,
8807,
8808,
8809,
9103,
9104,
9105,
9514,
9515,
9516,
9599,
9600,
9601,
9602,
9603,
9992,
9993,
9994,
10077,
10078,
10079,
10080,
10136,
10137,
10138,
10139,
10217,
10218,
10219,
10220,
10312,
10313,
10314,
10315,
10382,
10383,
10384,
10385,
10473,
10474,
10475,
10476,
10701,
10702,
10703,
10787,
10788,
10789,
10790,
10791,
11169,
11170,
11171,
11248,
11249,
11250,
11251,
11350,
11351,
11352,
11353,
11460,
11461,
11462,
11463,
11623,
11624,
11625,
11626,
11768,
11769,
11770,
11771,
12010,
12011,
12012,
12083,
12084,
12085,
12086,
12087,
12393,
12394,
12395,
12720,
12721,
12722,
12784,
12785,
12786,
12787,
12788,
13083,
13084,
13085,
13329,
13330,
13331,
13606,
13607,
13608,
13919,
13920,
13921,
13991,
13992,
13993,
13994,
13995,
14290,
14291,
14292,
14605,
14606,
14607,
14960,
14961,
14962,
15018,
15019,
15020,
15021,
15022,
15325,
15326,
15327,
15726,
15727,
15728,
16002,
16003,
16004,
16015,
16016,
16017,
16018,
16019,
16046,
16047,
16048,
16049,
16050,
16298,
16299,
16300,
16301,
16723,
16724,
16725,
16726,
16902,
16903,
16904,
16905,
17121,
17122,
17123,
17124,
17414,
17415,
17416,
17417,
17449,
17450,
17451,
17452,
17453,
17533,
17534,
17535,
17536,
17686,
17687,
17688,
17689,
17877,
17878,
17879,
17880,
18110,
18111,
18112,
18113,
18148,
18149,
18150,
18151,
18152,
18514,
18515,
18516,
18681,
18682,
18683,
19072,
19073,
19074,
19166,
19167,
19168,
19173,
19174,
19175,
19176,
19177,
19267,
19268,
19269,
19298,
19299,
19300,
19301,
19302,
19589,
19590,
19591,
19597,
19598,
19662,
19663,
19671,
19672,
19703,
19717
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 19717,
"ccnet_original_nlines": 438,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3550955355167389,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0395435206592083,
"rps_doc_frac_lines_end_with_ellipsis": 0.0022778999991714954,
"rps_doc_frac_no_alph_words": 0.12977707386016846,
"rps_doc_frac_unique_words": 0.17710843682289124,
"rps_doc_mean_word_length": 4.687047958374023,
"rps_doc_num_sentences": 177,
"rps_doc_symbol_to_word_ratio": 0.0002653900010045618,
"rps_doc_unigram_entropy": 5.10598611831665,
"rps_doc_word_count": 3320,
"rps_doc_frac_chars_dupe_10grams": 0.3294132947921753,
"rps_doc_frac_chars_dupe_5grams": 0.5637170076370239,
"rps_doc_frac_chars_dupe_6grams": 0.5318424105644226,
"rps_doc_frac_chars_dupe_7grams": 0.4999036192893982,
"rps_doc_frac_chars_dupe_8grams": 0.4376325309276581,
"rps_doc_frac_chars_dupe_9grams": 0.38930660486221313,
"rps_doc_frac_chars_top_2gram": 0.09716598689556122,
"rps_doc_frac_chars_top_3gram": 0.09626630693674088,
"rps_doc_frac_chars_top_4gram": 0.07711587101221085,
"rps_doc_books_importance": -1857.2874755859375,
"rps_doc_books_importance_length_correction": -1857.2874755859375,
"rps_doc_openwebtext_importance": -1209.42626953125,
"rps_doc_openwebtext_importance_length_correction": -1209.42626953125,
"rps_doc_wikipedia_importance": -884.6867065429688,
"rps_doc_wikipedia_importance_length_correction": -884.6867065429688
},
"fasttext": {
"dclm": 0.02195465937256813,
"english": 0.912360668182373,
"fineweb_edu_approx": 1.7449989318847656,
"eai_general_math": 0.08963686227798462,
"eai_open_web_math": 0.11212480068206787,
"eai_web_code": 0.04896790161728859
}
} | {
"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": "344.73048",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Martial law"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "9",
"label": "FAQ"
}
},
"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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
715,835,221,204,704,400 | /[escript]/trunk/escript/py_src/generateutil
ViewVC logotype
Contents of /trunk/escript/py_src/generateutil
Parent Directory Parent Directory | Revision Log Revision Log
Revision 536 - (show annotations)
Fri Feb 17 03:20:53 2006 UTC (13 years, 6 months ago) by gross
File size: 139688 byte(s)
symmetric and nonsymmetric part functions added
1 #!/usr/bin/python
2 # $Id$
3
4 """
5 program generates parts of the util.py and the test_util.py script
6 """
7 test_header=""
8 test_header+="import unittest\n"
9 test_header+="import numarray\n"
10 test_header+="from esys.escript import *\n"
11 test_header+="from esys.finley import Rectangle\n"
12 test_header+="class Test_util2(unittest.TestCase):\n"
13 test_header+=" RES_TOL=1.e-7\n"
14 test_header+=" def setUp(self):\n"
15 test_header+=" self.__dom =Rectangle(11,11,2)\n"
16 test_header+=" self.functionspace = FunctionOnBoundary(self.__dom)\n"
17 test_tail=""
18 test_tail+="suite = unittest.TestSuite()\n"
19 test_tail+="suite.addTest(unittest.makeSuite(Test_util2))\n"
20 test_tail+="unittest.TextTestRunner(verbosity=2).run(suite)\n"
21
22 case_set=["float","array","constData","taggedData","expandedData","Symbol"]
23 shape_set=[ (),(2,), (4,5), (6,2,2),(3,2,3,4)]
24
25 t_prog=""
26 t_prog_with_tags=""
27 t_prog_failing=""
28 u_prog=""
29
30 def wherepos(arg):
31 if arg>0.:
32 return 1.
33 else:
34 return 0.
35
36
37 class OPERATOR:
38 def __init__(self,nickname,rng=[-1000.,1000],test_expr="",math_expr=None,
39 numarray_expr="",symbol_expr=None,diff=None,name=""):
40 self.nickname=nickname
41 self.rng=rng
42 self.test_expr=test_expr
43 if math_expr==None:
44 self.math_expr=test_expr.replace("%a1%","arg")
45 else:
46 self.math_expr=math_expr
47 self.numarray_expr=numarray_expr
48 self.symbol_expr=symbol_expr
49 self.diff=diff
50 self.name=name
51
52 import random
53 import numarray
54 import math
55 finc=1.e-6
56
57 def getResultCaseForBin(case0,case1):
58 if case0=="float":
59 if case1=="float":
60 case="float"
61 elif case1=="array":
62 case="array"
63 elif case1=="constData":
64 case="constData"
65 elif case1=="taggedData":
66 case="taggedData"
67 elif case1=="expandedData":
68 case="expandedData"
69 elif case1=="Symbol":
70 case="Symbol"
71 else:
72 raise ValueError,"unknown case1=%s"%case1
73 elif case0=="array":
74 if case1=="float":
75 case="array"
76 elif case1=="array":
77 case="array"
78 elif case1=="constData":
79 case="constData"
80 elif case1=="taggedData":
81 case="taggedData"
82 elif case1=="expandedData":
83 case="expandedData"
84 elif case1=="Symbol":
85 case="Symbol"
86 else:
87 raise ValueError,"unknown case1=%s"%case1
88 elif case0=="constData":
89 if case1=="float":
90 case="constData"
91 elif case1=="array":
92 case="constData"
93 elif case1=="constData":
94 case="constData"
95 elif case1=="taggedData":
96 case="taggedData"
97 elif case1=="expandedData":
98 case="expandedData"
99 elif case1=="Symbol":
100 case="Symbol"
101 else:
102 raise ValueError,"unknown case1=%s"%case1
103 elif case0=="taggedData":
104 if case1=="float":
105 case="taggedData"
106 elif case1=="array":
107 case="taggedData"
108 elif case1=="constData":
109 case="taggedData"
110 elif case1=="taggedData":
111 case="taggedData"
112 elif case1=="expandedData":
113 case="expandedData"
114 elif case1=="Symbol":
115 case="Symbol"
116 else:
117 raise ValueError,"unknown case1=%s"%case1
118 elif case0=="expandedData":
119 if case1=="float":
120 case="expandedData"
121 elif case1=="array":
122 case="expandedData"
123 elif case1=="constData":
124 case="expandedData"
125 elif case1=="taggedData":
126 case="expandedData"
127 elif case1=="expandedData":
128 case="expandedData"
129 elif case1=="Symbol":
130 case="Symbol"
131 else:
132 raise ValueError,"unknown case1=%s"%case1
133 elif case0=="Symbol":
134 if case1=="float":
135 case="Symbol"
136 elif case1=="array":
137 case="Symbol"
138 elif case1=="constData":
139 case="Symbol"
140 elif case1=="taggedData":
141 case="Symbol"
142 elif case1=="expandedData":
143 case="Symbol"
144 elif case1=="Symbol":
145 case="Symbol"
146 else:
147 raise ValueError,"unknown case1=%s"%case1
148 else:
149 raise ValueError,"unknown case0=%s"%case0
150 return case
151
152
153 def makeArray(shape,rng):
154 l=rng[1]-rng[0]
155 out=numarray.zeros(shape,numarray.Float64)
156 if len(shape)==0:
157 out=l*random.random()+rng[0]
158 elif len(shape)==1:
159 for i0 in range(shape[0]):
160 out[i0]=l*random.random()+rng[0]
161 elif len(shape)==2:
162 for i0 in range(shape[0]):
163 for i1 in range(shape[1]):
164 out[i0,i1]=l*random.random()+rng[0]
165 elif len(shape)==3:
166 for i0 in range(shape[0]):
167 for i1 in range(shape[1]):
168 for i2 in range(shape[2]):
169 out[i0,i1,i2]=l*random.random()+rng[0]
170 elif len(shape)==4:
171 for i0 in range(shape[0]):
172 for i1 in range(shape[1]):
173 for i2 in range(shape[2]):
174 for i3 in range(shape[3]):
175 out[i0,i1,i2,i3]=l*random.random()+rng[0]
176 elif len(shape)==5:
177 for i0 in range(shape[0]):
178 for i1 in range(shape[1]):
179 for i2 in range(shape[2]):
180 for i3 in range(shape[3]):
181 for i4 in range(shape[4]):
182 out[i0,i1,i2,i3,i4]=l*random.random()+rng[0]
183 else:
184 raise SystemError,"rank is restricted to 5"
185 return out
186
187 def makeNumberedArray(shape,s=1.):
188 out=numarray.zeros(shape,numarray.Float64)
189 if len(shape)==0:
190 out=s*1.
191 elif len(shape)==1:
192 for i0 in range(shape[0]):
193 out[i0]=s*i0
194 elif len(shape)==2:
195 for i0 in range(shape[0]):
196 for i1 in range(shape[1]):
197 out[i0,i1]=s*(i1+shape[1]*i0)
198 elif len(shape)==3:
199 for i0 in range(shape[0]):
200 for i1 in range(shape[1]):
201 for i2 in range(shape[2]):
202 out[i0,i1,i2]=s*(i2+shape[2]*i1+shape[2]*shape[1]*i0)
203 elif len(shape)==4:
204 for i0 in range(shape[0]):
205 for i1 in range(shape[1]):
206 for i2 in range(shape[2]):
207 for i3 in range(shape[3]):
208 out[i0,i1,i2,i3]=s*(i3+shape[3]*i2+shape[3]*shape[2]*i1+shape[3]*shape[2]*shape[1]*i0)
209 else:
210 raise SystemError,"rank is restricted to 4"
211 return out
212
213 def makeResult(val,test_expr):
214 if isinstance(val,float):
215 out=eval(test_expr.replace("%a1%","val"))
216 elif len(val.shape)==0:
217 out=eval(test_expr.replace("%a1%","val"))
218 elif len(val.shape)==1:
219 out=numarray.zeros(val.shape,numarray.Float64)
220 for i0 in range(val.shape[0]):
221 out[i0]=eval(test_expr.replace("%a1%","val[i0]"))
222 elif len(val.shape)==2:
223 out=numarray.zeros(val.shape,numarray.Float64)
224 for i0 in range(val.shape[0]):
225 for i1 in range(val.shape[1]):
226 out[i0,i1]=eval(test_expr.replace("%a1%","val[i0,i1]"))
227 elif len(val.shape)==3:
228 out=numarray.zeros(val.shape,numarray.Float64)
229 for i0 in range(val.shape[0]):
230 for i1 in range(val.shape[1]):
231 for i2 in range(val.shape[2]):
232 out[i0,i1,i2]=eval(test_expr.replace("%a1%","val[i0,i1,i2]"))
233 elif len(val.shape)==4:
234 out=numarray.zeros(val.shape,numarray.Float64)
235 for i0 in range(val.shape[0]):
236 for i1 in range(val.shape[1]):
237 for i2 in range(val.shape[2]):
238 for i3 in range(val.shape[3]):
239 out[i0,i1,i2,i3]=eval(test_expr.replace("%a1%","val[i0,i1,i2,i3]"))
240 else:
241 raise SystemError,"rank is restricted to 4"
242 return out
243
244 def makeResult2(val0,val1,test_expr):
245 if isinstance(val0,float):
246 if isinstance(val1,float):
247 out=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1"))
248 elif len(val1.shape)==0:
249 out=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1"))
250 elif len(val1.shape)==1:
251 out=numarray.zeros(val1.shape,numarray.Float64)
252 for i0 in range(val1.shape[0]):
253 out[i0]=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1[i0]"))
254 elif len(val1.shape)==2:
255 out=numarray.zeros(val1.shape,numarray.Float64)
256 for i0 in range(val1.shape[0]):
257 for i1 in range(val1.shape[1]):
258 out[i0,i1]=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1[i0,i1]"))
259 elif len(val1.shape)==3:
260 out=numarray.zeros(val1.shape,numarray.Float64)
261 for i0 in range(val1.shape[0]):
262 for i1 in range(val1.shape[1]):
263 for i2 in range(val1.shape[2]):
264 out[i0,i1,i2]=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1[i0,i1,i2]"))
265 elif len(val1.shape)==4:
266 out=numarray.zeros(val1.shape,numarray.Float64)
267 for i0 in range(val1.shape[0]):
268 for i1 in range(val1.shape[1]):
269 for i2 in range(val1.shape[2]):
270 for i3 in range(val1.shape[3]):
271 out[i0,i1,i2,i3]=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1[i0,i1,i2,i3]"))
272 else:
273 raise SystemError,"rank of val1 is restricted to 4"
274 elif len(val0.shape)==0:
275 if isinstance(val1,float):
276 out=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1"))
277 elif len(val1.shape)==0:
278 out=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1"))
279 elif len(val1.shape)==1:
280 out=numarray.zeros(val1.shape,numarray.Float64)
281 for i0 in range(val1.shape[0]):
282 out[i0]=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1[i0]"))
283 elif len(val1.shape)==2:
284 out=numarray.zeros(val1.shape,numarray.Float64)
285 for i0 in range(val1.shape[0]):
286 for i1 in range(val1.shape[1]):
287 out[i0,i1]=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1[i0,i1]"))
288 elif len(val1.shape)==3:
289 out=numarray.zeros(val1.shape,numarray.Float64)
290 for i0 in range(val1.shape[0]):
291 for i1 in range(val1.shape[1]):
292 for i2 in range(val1.shape[2]):
293 out[i0,i1,i2]=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1[i0,i1,i2]"))
294 elif len(val1.shape)==4:
295 out=numarray.zeros(val1.shape,numarray.Float64)
296 for i0 in range(val1.shape[0]):
297 for i1 in range(val1.shape[1]):
298 for i2 in range(val1.shape[2]):
299 for i3 in range(val1.shape[3]):
300 out[i0,i1,i2,i3]=eval(test_expr.replace("%a1%","val0").replace("%a2%","val1[i0,i1,i2,i3]"))
301 else:
302 raise SystemError,"rank of val1 is restricted to 4"
303 elif len(val0.shape)==1:
304 if isinstance(val1,float):
305 out=numarray.zeros(val0.shape,numarray.Float64)
306 for i0 in range(val0.shape[0]):
307 out[i0]=eval(test_expr.replace("%a1%","val0[i0]").replace("%a2%","val1"))
308 elif len(val1.shape)==0:
309 out=numarray.zeros(val0.shape,numarray.Float64)
310 for i0 in range(val0.shape[0]):
311 out[i0]=eval(test_expr.replace("%a1%","val0[i0]").replace("%a2%","val1"))
312 elif len(val1.shape)==1:
313 out=numarray.zeros(val0.shape,numarray.Float64)
314 for i0 in range(val0.shape[0]):
315 out[i0]=eval(test_expr.replace("%a1%","val0[i0]").replace("%a2%","val1[i0]"))
316 elif len(val1.shape)==2:
317 out=numarray.zeros(val0.shape+val1.shape[1:],numarray.Float64)
318 for i0 in range(val0.shape[0]):
319 for j1 in range(val1.shape[1]):
320 out[i0,j1]=eval(test_expr.replace("%a1%","val0[i0]").replace("%a2%","val1[i0,j1]"))
321 elif len(val1.shape)==3:
322 out=numarray.zeros(val0.shape+val1.shape[1:],numarray.Float64)
323 for i0 in range(val0.shape[0]):
324 for j1 in range(val1.shape[1]):
325 for j2 in range(val1.shape[2]):
326 out[i0,j1,j2]=eval(test_expr.replace("%a1%","val0[i0]").replace("%a2%","val1[i0,j1,j2]"))
327 elif len(val1.shape)==4:
328 out=numarray.zeros(val0.shape+val1.shape[1:],numarray.Float64)
329 for i0 in range(val0.shape[0]):
330 for j1 in range(val1.shape[1]):
331 for j2 in range(val1.shape[2]):
332 for j3 in range(val1.shape[3]):
333 out[i0,j1,j2,j3]=eval(test_expr.replace("%a1%","val0[i0]").replace("%a2%","val1[i0,j1,j2,j3]"))
334 else:
335 raise SystemError,"rank of val1 is restricted to 4"
336 elif len(val0.shape)==2:
337 if isinstance(val1,float):
338 out=numarray.zeros(val0.shape,numarray.Float64)
339 for i0 in range(val0.shape[0]):
340 for i1 in range(val0.shape[1]):
341 out[i0,i1]=eval(test_expr.replace("%a1%","val0[i0,i1]").replace("%a2%","val1"))
342 elif len(val1.shape)==0:
343 out=numarray.zeros(val0.shape,numarray.Float64)
344 for i0 in range(val0.shape[0]):
345 for i1 in range(val0.shape[1]):
346 out[i0,i1]=eval(test_expr.replace("%a1%","val0[i0,i1]").replace("%a2%","val1"))
347 elif len(val1.shape)==1:
348 out=numarray.zeros(val0.shape,numarray.Float64)
349 for i0 in range(val0.shape[0]):
350 for i1 in range(val0.shape[1]):
351 out[i0,i1]=eval(test_expr.replace("%a1%","val0[i0,i1]").replace("%a2%","val1[i0]"))
352 elif len(val1.shape)==2:
353 out=numarray.zeros(val0.shape+val1.shape[2:],numarray.Float64)
354 for i0 in range(val0.shape[0]):
355 for i1 in range(val0.shape[1]):
356 out[i0,i1]=eval(test_expr.replace("%a1%","val0[i0,i1]").replace("%a2%","val1[i0,i1]"))
357 elif len(val1.shape)==3:
358 out=numarray.zeros(val0.shape+val1.shape[2:],numarray.Float64)
359 for i0 in range(val0.shape[0]):
360 for i1 in range(val0.shape[1]):
361 for j2 in range(val1.shape[2]):
362 out[i0,i1,j2]=eval(test_expr.replace("%a1%","val0[i0,i1]").replace("%a2%","val1[i0,i1,j2]"))
363 elif len(val1.shape)==4:
364 out=numarray.zeros(val0.shape+val1.shape[2:],numarray.Float64)
365 for i0 in range(val0.shape[0]):
366 for i1 in range(val0.shape[1]):
367 for j2 in range(val1.shape[2]):
368 for j3 in range(val1.shape[3]):
369 out[i0,i1,j2,j3]=eval(test_expr.replace("%a1%","val0[i0,i1]").replace("%a2%","val1[i0,i1,j2,j3]"))
370 else:
371 raise SystemError,"rank of val1 is restricted to 4"
372 elif len(val0.shape)==3:
373 if isinstance(val1,float):
374 out=numarray.zeros(val0.shape,numarray.Float64)
375 for i0 in range(val0.shape[0]):
376 for i1 in range(val0.shape[1]):
377 for i2 in range(val0.shape[2]):
378 out[i0,i1,i2]=eval(test_expr.replace("%a1%","val0[i0,i1,i2]").replace("%a2%","val1"))
379 elif len(val1.shape)==0:
380 out=numarray.zeros(val0.shape,numarray.Float64)
381 for i0 in range(val0.shape[0]):
382 for i1 in range(val0.shape[1]):
383 for i2 in range(val0.shape[2]):
384 out[i0,i1,i2]=eval(test_expr.replace("%a1%","val0[i0,i1,i2]").replace("%a2%","val1"))
385 elif len(val1.shape)==1:
386 out=numarray.zeros(val0.shape,numarray.Float64)
387 for i0 in range(val0.shape[0]):
388 for i1 in range(val0.shape[1]):
389 for i2 in range(val0.shape[2]):
390 out[i0,i1,i2]=eval(test_expr.replace("%a1%","val0[i0,i1,i2]").replace("%a2%","val1[i0]"))
391 elif len(val1.shape)==2:
392 out=numarray.zeros(val0.shape+val1.shape[2:],numarray.Float64)
393 for i0 in range(val0.shape[0]):
394 for i1 in range(val0.shape[1]):
395 for i2 in range(val0.shape[2]):
396 out[i0,i1,i2]=eval(test_expr.replace("%a1%","val0[i0,i1,i2]").replace("%a2%","val1[i0,i1]"))
397 elif len(val1.shape)==3:
398 out=numarray.zeros(val0.shape,numarray.Float64)
399 for i0 in range(val0.shape[0]):
400 for i1 in range(val0.shape[1]):
401 for i2 in range(val0.shape[2]):
402 out[i0,i1,i2]=eval(test_expr.replace("%a1%","val0[i0,i1,i2]").replace("%a2%","val1[i0,i1,i2]"))
403 elif len(val1.shape)==4:
404 out=numarray.zeros(val0.shape+val1.shape[3:],numarray.Float64)
405 for i0 in range(val0.shape[0]):
406 for i1 in range(val0.shape[1]):
407 for i2 in range(val0.shape[2]):
408 for j3 in range(val1.shape[3]):
409 out[i0,i1,i2,j3]=eval(test_expr.replace("%a1%","val0[i0,i1,i2]").replace("%a2%","val1[i0,i1,i2,j3]"))
410 else:
411 raise SystemError,"rank of val1 is rargs[1]estricted to 4"
412 elif len(val0.shape)==4:
413 if isinstance(val1,float):
414 out=numarray.zeros(val0.shape,numarray.Float64)
415 for i0 in range(val0.shape[0]):
416 for i1 in range(val0.shape[1]):
417 for i2 in range(val0.shape[2]):
418 for i3 in range(val0.shape[3]):
419 out[i0,i1,i2,i3]=eval(test_expr.replace("%a1%","val0[i0,i1,i2,i3]").replace("%a2%","val1"))
420 elif len(val1.shape)==0:
421 out=numarray.zeros(val0.shape,numarray.Float64)
422 for i0 in range(val0.shape[0]):
423 for i1 in range(val0.shape[1]):
424 for i2 in range(val0.shape[2]):
425 for i3 in range(val0.shape[3]):
426 out[i0,i1,i2,i3]=eval(test_expr.replace("%a1%","val0[i0,i1,i2,i3]").replace("%a2%","val1"))
427 elif len(val1.shape)==1:
428 out=numarray.zeros(val0.shape,numarray.Float64)
429 for i0 in range(val0.shape[0]):
430 for i1 in range(val0.shape[1]):
431 for i2 in range(val0.shape[2]):
432 for i3 in range(val0.shape[3]):
433 out[i0,i1,i2,i3]=eval(test_expr.replace("%a1%","val0[i0,i1,i2,i3]").replace("%a2%","val1[i0]"))
434 elif len(val1.shape)==2:
435 out=numarray.zeros(val0.shape+val1.shape[2:],numarray.Float64)
436 for i0 in range(val0.shape[0]):
437 for i1 in range(val0.shape[1]):
438 for i2 in range(val0.shape[2]):
439 for i3 in range(val0.shape[3]):
440 out[i0,i1,i2,i3]=eval(test_expr.replace("%a1%","val0[i0,i1,i2,i3]").replace("%a2%","val1[i0,i1]"))
441 elif len(val1.shape)==3:
442 out=numarray.zeros(val0.shape,numarray.Float64)
443 for i0 in range(val0.shape[0]):
444 for i1 in range(val0.shape[1]):
445 for i2 in range(val0.shape[2]):
446 for i3 in range(val0.shape[3]):
447 out[i0,i1,i2,i3]=eval(test_expr.replace("%a1%","val0[i0,i1,i2,i3]").replace("%a2%","val1[i0,i1,i2]"))
448 elif len(val1.shape)==4:
449 out=numarray.zeros(val0.shape,numarray.Float64)
450 for i0 in range(val0.shape[0]):
451 for i1 in range(val0.shape[1]):
452 for i2 in range(val0.shape[2]):
453 for i3 in range(val0.shape[3]):
454 out[i0,i1,i2,i3]=eval(test_expr.replace("%a1%","val0[i0,i1,i2,i3]").replace("%a2%","val1[i0,i1,i2,i3]"))
455 else:
456 raise SystemError,"rank of val1 is restricted to 4"
457 else:
458 raise SystemError,"rank is restricted to 4"
459 return out
460
461
462 def mkText(case,name,a,a1=None,use_tagging_for_expanded_data=False):
463 t_out=""
464 if case=="float":
465 if isinstance(a,float):
466 t_out+=" %s=%s\n"%(name,a)
467 elif a.rank==0:
468 t_out+=" %s=%s\n"%(name,a)
469 else:
470 t_out+=" %s=numarray.array(%s)\n"%(name,a.tolist())
471 elif case=="array":
472 if isinstance(a,float):
473 t_out+=" %s=numarray.array(%s)\n"%(name,a)
474 elif a.rank==0:
475 t_out+=" %s=numarray.array(%s)\n"%(name,a)
476 else:
477 t_out+=" %s=numarray.array(%s)\n"%(name,a.tolist())
478 elif case=="constData":
479 if isinstance(a,float):
480 t_out+=" %s=Data(%s,self.functionspace)\n"%(name,a)
481 elif a.rank==0:
482 t_out+=" %s=Data(%s,self.functionspace)\n"%(name,a)
483 else:
484 t_out+=" %s=Data(numarray.array(%s),self.functionspace)\n"%(name,a.tolist())
485 elif case=="taggedData":
486 if isinstance(a,float):
487 t_out+=" %s=Data(%s,self.functionspace)\n"%(name,a)
488 t_out+=" %s.setTaggedValue(1,%s)\n"%(name,a1)
489 elif a.rank==0:
490 t_out+=" %s=Data(%s,self.functionspace)\n"%(name,a)
491 t_out+=" %s.setTaggedValue(1,%s)\n"%(name,a1)
492 else:
493 t_out+=" %s=Data(numarray.array(%s),self.functionspace)\n"%(name,a.tolist())
494 t_out+=" %s.setTaggedValue(1,numarray.array(%s))\n"%(name,a1.tolist())
495 elif case=="expandedData":
496 if use_tagging_for_expanded_data:
497 if isinstance(a,float):
498 t_out+=" %s=Data(%s,self.functionspace)\n"%(name,a)
499 t_out+=" %s.setTaggedValue(1,%s)\n"%(name,a1)
500 elif a.rank==0:
501 t_out+=" %s=Data(%s,self.functionspace)\n"%(name,a)
502 t_out+=" %s.setTaggedValue(1,%s)\n"%(name,a1)
503 else:
504 t_out+=" %s=Data(numarray.array(%s),self.functionspace)\n"%(name,a.tolist())
505 t_out+=" %s.setTaggedValue(1,numarray.array(%s))\n"%(name,a1.tolist())
506 t_out+=" %s.expand()\n"%name
507 else:
508 t_out+=" msk_%s=whereNegative(self.functionspace.getX()[0]-0.5)\n"%name
509 if isinstance(a,float):
510 t_out+=" %s=msk_%s*(%s)+(1.-msk_%s)*(%s)\n"%(name,name,a,name,a1)
511 elif a.rank==0:
512 t_out+=" %s=msk_%s*numarray.array(%s)+(1.-msk_%s)*numarray.array(%s)\n"%(name,name,a,name,a1)
513 else:
514 t_out+=" %s=msk_%s*numarray.array(%s)+(1.-msk_%s)*numarray.array(%s)\n"%(name,name,a.tolist(),name,a1.tolist())
515 elif case=="Symbol":
516 if isinstance(a,float):
517 t_out+=" %s=Symbol(shape=())\n"%(name)
518 elif a.rank==0:
519 t_out+=" %s=Symbol(shape=())\n"%(name)
520 else:
521 t_out+=" %s=Symbol(shape=%s)\n"%(name,str(a.shape))
522
523 return t_out
524
525 def mkTypeAndShapeTest(case,sh,argstr):
526 text=""
527 if case=="float":
528 text+=" self.failUnless(isinstance(%s,float),\"wrong type of result.\")\n"%argstr
529 elif case=="array":
530 text+=" self.failUnless(isinstance(%s,numarray.NumArray),\"wrong type of result.\")\n"%argstr
531 text+=" self.failUnlessEqual(%s.shape,%s,\"wrong shape of result.\")\n"%(argstr,str(sh))
532 elif case in ["constData","taggedData","expandedData"]:
533 text+=" self.failUnless(isinstance(%s,Data),\"wrong type of result.\")\n"%argstr
534 text+=" self.failUnlessEqual(%s.getShape(),%s,\"wrong shape of result.\")\n"%(argstr,str(sh))
535 elif case=="Symbol":
536 text+=" self.failUnless(isinstance(%s,Symbol),\"wrong type of result.\")\n"%argstr
537 text+=" self.failUnlessEqual(%s.getShape(),%s,\"wrong shape of result.\")\n"%(argstr,str(sh))
538 return text
539
540 def mkCode(txt,args=[],intend=""):
541 s=txt.split("\n")
542 if len(s)>1:
543 out=""
544 for l in s:
545 out+=intend+l+"\n"
546 else:
547 out="%sreturn %s\n"%(intend,txt)
548 c=1
549 for r in args:
550 out=out.replace("%%a%s%%"%c,r)
551 return out
552 #=======================================================================================================
553 # nonsymmetric part
554 #=======================================================================================================
555 from esys.escript import *
556 for name in ["symmetric", "nonsymmetric"]:
557 f=1.
558 if name=="nonsymmetric": f=-1
559 for case0 in ["array","Symbol","constData","taggedData","expandedData"]:
560 for sh0 in [ (3,3), (2,3,2,3)]:
561 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
562 tname="test_%s_%s_rank%s"%(name,case0,len(sh0))
563 text+=" def %s(self):\n"%tname
564 a_0=makeNumberedArray(sh0,s=1.)
565 r_0=(a_0+f*transpose(a_0))/2.
566 if case0 in ["taggedData", "expandedData"]:
567 a1_0=makeNumberedArray(sh0,s=-1.)
568 r1_0=(a1_0+f*transpose(a1_0))/2.
569 else:
570 a1_0=a_0
571 r1_0=r_0
572 text+=mkText(case0,"arg",a_0,a1_0)
573 text+=" res=%s(arg)\n"%name
574 if case0=="Symbol":
575 text+=mkText("array","s",a_0,a1_0)
576 text+=" sub=res.substitute({arg:s})\n"
577 res="sub"
578 text+=mkText("array","ref",r_0,r1_0)
579 else:
580 res="res"
581 text+=mkText(case0,"ref",r_0,r1_0)
582 text+=mkTypeAndShapeTest(case0,sh0,"res")
583 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
584
585 if case0 == "taggedData" :
586 t_prog_with_tags+=text
587 else:
588 t_prog+=text
589 print test_header
590 print t_prog
591 # print t_prog_with_tags
592 print test_tail
593 1/0
594
595 #=======================================================================================================
596 # eigenvalues
597 #=======================================================================================================
598 import numarray.linear_algebra
599 name="eigenvalues"
600 for case0 in ["array","Symbol","constData","taggedData","expandedData"]:
601 for sh0 in [ (1,1), (2,2), (3,3)]:
602 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
603 tname="test_%s_%s_dim%s"%(name,case0,sh0[0])
604 text+=" def %s(self):\n"%tname
605 a_0=makeArray(sh0,[-1.,1])
606 a_0=(a_0+numarray.transpose(a_0))/2.
607 ev=numarray.linear_algebra.eigenvalues(a_0)
608 ev.sort()
609 if case0 in ["taggedData", "expandedData"]:
610 a1_0=makeArray(sh0,[-1.,1])
611 a1_0=(a1_0+numarray.transpose(a1_0))/2.
612 ev1=numarray.linear_algebra.eigenvalues(a1_0)
613 ev1.sort()
614 else:
615 a1_0=a_0
616 ev1=ev
617 text+=mkText(case0,"arg",a_0,a1_0)
618 text+=" res=%s(arg)\n"%name
619 if case0=="Symbol":
620 text+=mkText("array","s",a_0,a1_0)
621 text+=" sub=res.substitute({arg:s})\n"
622 res="sub"
623 text+=mkText("array","ref",ev,ev1)
624 else:
625 res="res"
626 text+=mkText(case0,"ref",ev,ev1)
627 text+=mkTypeAndShapeTest(case0,(sh0[0],),"res")
628 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
629
630 if case0 == "taggedData" :
631 t_prog_with_tags+=text
632 else:
633 t_prog+=text
634 print test_header
635 # print t_prog
636 print t_prog_with_tags
637 print test_tail
638 1/0
639
640 #=======================================================================================================
641 # slicing
642 #=======================================================================================================
643 for case0 in ["constData","taggedData","expandedData","Symbol"]:
644 for sh0 in [ (3,), (3,4), (3,4,3) ,(4,3,5,3)]:
645 # get perm:
646 if len(sh0)==2:
647 check=[[1,0]]
648 elif len(sh0)==3:
649 check=[[1,0,2],
650 [1,2,0],
651 [2,1,0],
652 [2,0,2],
653 [0,2,1]]
654 elif len(sh0)==4:
655 check=[[0,1,3,2],
656 [0,2,1,3],
657 [0,2,3,1],
658 [0,3,2,1],
659 [0,3,1,2] ,
660 [1,0,2,3],
661 [1,0,3,2],
662 [1,2,0,3],
663 [1,2,3,0],
664 [1,3,2,0],
665 [1,3,0,2],
666 [2,0,1,3],
667 [2,0,3,1],
668 [2,1,0,3],
669 [2,1,3,0],
670 [2,3,1,0],
671 [2,3,0,1],
672 [3,0,1,2],
673 [3,0,2,1],
674 [3,1,0,2],
675 [3,1,2,0],
676 [3,2,1,0],
677 [3,2,0,1]]
678 else:
679 check=[]
680
681 # create the test cases:
682 processed=[]
683 l=["R","U","L","P","C","N"]
684 c=[""]
685 for i in range(len(sh0)):
686 tmp=[]
687 for ci in c:
688 tmp+=[ci+li for li in l]
689 c=tmp
690 # SHUFFLE
691 c2=[]
692 while len(c)>0:
693 i=int(random.random()*len(c))
694 c2.append(c[i])
695 del c[i]
696 c=c2
697 for ci in c:
698 t=""
699 sh=()
700 for i in range(len(ci)):
701 if ci[i]=="R":
702 s="%s:%s"%(1,sh0[i]-1)
703 sh=sh+(sh0[i]-2,)
704 if ci[i]=="U":
705 s=":%s"%(sh0[i]-1)
706 sh=sh+(sh0[i]-1,)
707 if ci[i]=="L":
708 s="2:"
709 sh=sh+(sh0[i]-2,)
710 if ci[i]=="P":
711 s="%s"%(int(sh0[i]/2))
712 if ci[i]=="C":
713 s=":"
714 sh=sh+(sh0[i],)
715 if ci[i]=="N":
716 s=""
717 sh=sh+(sh0[i],)
718 if len(s)>0:
719 if not t=="": t+=","
720 t+=s
721 N_found=False
722 noN_found=False
723 process=len(t)>0
724 for i in ci:
725 if i=="N":
726 if not noN_found and N_found: process=False
727 N_found=True
728 else:
729 if N_found: process=False
730 noNfound=True
731 # is there a similar one processed allready
732 if process and ci.find("N")==-1:
733 for ci2 in processed:
734 for chi in check:
735 is_perm=True
736 for i in range(len(chi)):
737 if not ci[i]==ci2[chi[i]]: is_perm=False
738 if is_perm: process=False
739 # if not process: print ci," rejected"
740 if process:
741 processed.append(ci)
742 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
743 tname="test_getslice_%s_rank%s_%s"%(case0,len(sh0),ci)
744 text+=" def %s(self):\n"%tname
745 a_0=makeNumberedArray(sh0,s=1)
746 if case0 in ["taggedData", "expandedData"]:
747 a1_0=makeNumberedArray(sh0,s=-1.)
748 else:
749 a1_0=a_0
750 r=eval("a_0[%s]"%t)
751 r1=eval("a1_0[%s]"%t)
752 text+=mkText(case0,"arg",a_0,a1_0)
753 text+=" res=arg[%s]\n"%t
754 if case0=="Symbol":
755 text+=mkText("array","s",a_0,a1_0)
756 text+=" sub=res.substitute({arg:s})\n"
757 res="sub"
758 text+=mkText("array","ref",r,r1)
759 else:
760 res="res"
761 text+=mkText(case0,"ref",r,r1)
762 text+=mkTypeAndShapeTest(case0,sh,"res")
763 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
764
765 if case0 == "taggedData" :
766 t_prog_with_tags+=text
767 else:
768 t_prog+=text
769
770 print test_header
771 # print t_prog
772 print t_prog_with_tags
773 print test_tail
774 1/0
775 #============================================================================================
776 def innerTEST(arg0,arg1):
777 if isinstance(arg0,float):
778 out=numarray.array(arg0*arg1)
779 else:
780 out=(arg0*arg1).sum()
781 return out
782
783 def outerTEST(arg0,arg1):
784 if isinstance(arg0,float):
785 out=numarray.array(arg0*arg1)
786 elif isinstance(arg1,float):
787 out=numarray.array(arg0*arg1)
788 else:
789 out=numarray.outerproduct(arg0,arg1).resize(arg0.shape+arg1.shape)
790 return out
791
792 def tensorProductTest(arg0,arg1,sh_s):
793 if isinstance(arg0,float):
794 out=numarray.array(arg0*arg1)
795 elif isinstance(arg1,float):
796 out=numarray.array(arg0*arg1)
797 elif len(sh_s)==0:
798 out=numarray.outerproduct(arg0,arg1).resize(arg0.shape+arg1.shape)
799 else:
800 l=len(sh_s)
801 sh0=arg0.shape[:arg0.rank-l]
802 sh1=arg1.shape[l:]
803 ls,l0,l1=1,1,1
804 for i in sh_s: ls*=i
805 for i in sh0: l0*=i
806 for i in sh1: l1*=i
807 out1=numarray.outerproduct(arg0,arg1).resize((l0,ls,ls,l1))
808 out2=numarray.zeros((l0,l1),numarray.Float)
809 for i0 in range(l0):
810 for i1 in range(l1):
811 for i in range(ls): out2[i0,i1]+=out1[i0,i,i,i1]
812 out=out2.resize(sh0+sh1)
813 return out
814
815 def testMatrixMult(arg0,arg1,sh_s):
816 return numarray.matrixmultiply(arg0,arg1)
817
818
819 def testTensorMult(arg0,arg1,sh_s):
820 if len(arg0)==2:
821 return numarray.matrixmultiply(arg0,arg1)
822 else:
823 if arg1.rank==4:
824 out=numarray.zeros((arg0.shape[0],arg0.shape[1],arg1.shape[2],arg1.shape[3]),numarray.Float)
825 for i0 in range(arg0.shape[0]):
826 for i1 in range(arg0.shape[1]):
827 for i2 in range(arg0.shape[2]):
828 for i3 in range(arg0.shape[3]):
829 for j2 in range(arg1.shape[2]):
830 for j3 in range(arg1.shape[3]):
831 out[i0,i1,j2,j3]+=arg0[i0,i1,i2,i3]*arg1[i2,i3,j2,j3]
832 elif arg1.rank==3:
833 out=numarray.zeros((arg0.shape[0],arg0.shape[1],arg1.shape[2]),numarray.Float)
834 for i0 in range(arg0.shape[0]):
835 for i1 in range(arg0.shape[1]):
836 for i2 in range(arg0.shape[2]):
837 for i3 in range(arg0.shape[3]):
838 for j2 in range(arg1.shape[2]):
839 out[i0,i1,j2]+=arg0[i0,i1,i2,i3]*arg1[i2,i3,j2]
840 elif arg1.rank==2:
841 out=numarray.zeros((arg0.shape[0],arg0.shape[1]),numarray.Float)
842 for i0 in range(arg0.shape[0]):
843 for i1 in range(arg0.shape[1]):
844 for i2 in range(arg0.shape[2]):
845 for i3 in range(arg0.shape[3]):
846 out[i0,i1]+=arg0[i0,i1,i2,i3]*arg1[i2,i3]
847 return out
848
849 def testReduce(arg0,init_val,test_expr,post_expr):
850 out=init_val
851 if isinstance(arg0,float):
852 out=eval(test_expr.replace("%a1%","arg0"))
853 elif arg0.rank==0:
854 out=eval(test_expr.replace("%a1%","arg0"))
855 elif arg0.rank==1:
856 for i0 in range(arg0.shape[0]):
857 out=eval(test_expr.replace("%a1%","arg0[i0]"))
858 elif arg0.rank==2:
859 for i0 in range(arg0.shape[0]):
860 for i1 in range(arg0.shape[1]):
861 out=eval(test_expr.replace("%a1%","arg0[i0,i1]"))
862 elif arg0.rank==3:
863 for i0 in range(arg0.shape[0]):
864 for i1 in range(arg0.shape[1]):
865 for i2 in range(arg0.shape[2]):
866 out=eval(test_expr.replace("%a1%","arg0[i0,i1,i2]"))
867 elif arg0.rank==4:
868 for i0 in range(arg0.shape[0]):
869 for i1 in range(arg0.shape[1]):
870 for i2 in range(arg0.shape[2]):
871 for i3 in range(arg0.shape[3]):
872 out=eval(test_expr.replace("%a1%","arg0[i0,i1,i2,i3]"))
873 return eval(post_expr)
874
875 def clipTEST(arg0,mn,mx):
876 if isinstance(arg0,float):
877 return max(min(arg0,mx),mn)
878 out=numarray.zeros(arg0.shape,numarray.Float64)
879 if arg0.rank==1:
880 for i0 in range(arg0.shape[0]):
881 out[i0]=max(min(arg0[i0],mx),mn)
882 elif arg0.rank==2:
883 for i0 in range(arg0.shape[0]):
884 for i1 in range(arg0.shape[1]):
885 out[i0,i1]=max(min(arg0[i0,i1],mx),mn)
886 elif arg0.rank==3:
887 for i0 in range(arg0.shape[0]):
888 for i1 in range(arg0.shape[1]):
889 for i2 in range(arg0.shape[2]):
890 out[i0,i1,i2]=max(min(arg0[i0,i1,i2],mx),mn)
891 elif arg0.rank==4:
892 for i0 in range(arg0.shape[0]):
893 for i1 in range(arg0.shape[1]):
894 for i2 in range(arg0.shape[2]):
895 for i3 in range(arg0.shape[3]):
896 out[i0,i1,i2,i3]=max(min(arg0[i0,i1,i2,i3],mx),mn)
897 return out
898 def minimumTEST(arg0,arg1):
899 if isinstance(arg0,float):
900 if isinstance(arg1,float):
901 if arg0>arg1:
902 return arg1
903 else:
904 return arg0
905 else:
906 arg0=numarray.ones(arg1.shape)*arg0
907 else:
908 if isinstance(arg1,float):
909 arg1=numarray.ones(arg0.shape)*arg1
910 out=numarray.zeros(arg0.shape,numarray.Float64)
911 if arg0.rank==0:
912 if arg0>arg1:
913 out=arg1
914 else:
915 out=arg0
916 elif arg0.rank==1:
917 for i0 in range(arg0.shape[0]):
918 if arg0[i0]>arg1[i0]:
919 out[i0]=arg1[i0]
920 else:
921 out[i0]=arg0[i0]
922 elif arg0.rank==2:
923 for i0 in range(arg0.shape[0]):
924 for i1 in range(arg0.shape[1]):
925 if arg0[i0,i1]>arg1[i0,i1]:
926 out[i0,i1]=arg1[i0,i1]
927 else:
928 out[i0,i1]=arg0[i0,i1]
929 elif arg0.rank==3:
930 for i0 in range(arg0.shape[0]):
931 for i1 in range(arg0.shape[1]):
932 for i2 in range(arg0.shape[2]):
933 if arg0[i0,i1,i2]>arg1[i0,i1,i2]:
934 out[i0,i1,i2]=arg1[i0,i1,i2]
935 else:
936 out[i0,i1,i2]=arg0[i0,i1,i2]
937 elif arg0.rank==4:
938 for i0 in range(arg0.shape[0]):
939 for i1 in range(arg0.shape[1]):
940 for i2 in range(arg0.shape[2]):
941 for i3 in range(arg0.shape[3]):
942 if arg0[i0,i1,i2,i3]>arg1[i0,i1,i2,i3]:
943 out[i0,i1,i2,i3]=arg1[i0,i1,i2,i3]
944 else:
945 out[i0,i1,i2,i3]=arg0[i0,i1,i2,i3]
946 return out
947
948 def unrollLoops(a,b,o,arg,tap="",x="x"):
949 out=""
950 if a.rank==1:
951 z=""
952 for i99 in range(a.shape[0]):
953 if not z=="": z+="+"
954 if o=="1":
955 z+="(%s)*%s[%s]"%(a[i99]+b[i99],x,i99)
956 else:
957 z+="(%s)*%s[%s]**o+(%s)*%s[%s]"%(a[i99],x,i99,b[i99],x,i99)
958
959 out+=tap+"%s=%s\n"%(arg,z)
960
961 elif a.rank==2:
962 for i0 in range(a.shape[0]):
963 z=""
964 for i99 in range(a.shape[1]):
965 if not z=="": z+="+"
966 if o=="1":
967 z+="(%s)*x[%s]"%(a[i0,i99]+b[i0,i99],i99)
968 else:
969 z+="(%s)*%s[%s]**o+(%s)*%s[%s]"%(a[i0,i99],x,i99,b[i0,i99],x,i99)
970
971 out+=tap+"%s[%s]=%s\n"%(arg,i0,z)
972 elif a.rank==3:
973 for i0 in range(a.shape[0]):
974 for i1 in range(a.shape[1]):
975 z=""
976 for i99 in range(a.shape[2]):
977 if not z=="": z+="+"
978 if o=="1":
979 z+="(%s)*%s[%s]"%(a[i0,i1,i99]+b[i0,i1,i99],x,i99)
980 else:
981 z+="(%s)*%s[%s]**o+(%s)*%s[%s]"%(a[i0,i1,i99],x,i99,b[i0,i1,i99],x,i99)
982
983 out+=tap+"%s[%s,%s]=%s\n"%(arg,i0,i1,z)
984 elif a.rank==4:
985 for i0 in range(a.shape[0]):
986 for i1 in range(a.shape[1]):
987 for i2 in range(a.shape[2]):
988 z=""
989 for i99 in range(a.shape[3]):
990 if not z=="": z+="+"
991 if o=="1":
992 z+="(%s)*%s[%s]"%(a[i0,i1,i2,i99]+b[i0,i1,i2,i99],x,i99)
993 else:
994 z+="(%s)*%s[%s]**o+(%s)*%s[%s]"%(a[i0,i1,i2,i99],x,i99,b[i0,i1,i2,i99],x,i99)
995
996 out+=tap+"%s[%s,%s,%s]=%s\n"%(arg,i0,i1,i2,z)
997 elif a.rank==5:
998 for i0 in range(a.shape[0]):
999 for i1 in range(a.shape[1]):
1000 for i2 in range(a.shape[2]):
1001 for i3 in range(a.shape[3]):
1002 z=""
1003 for i99 in range(a.shape[4]):
1004 if not z=="": z+="+"
1005 if o=="1":
1006 z+="(%s)*%s[%s]"%(a[i0,i1,i2,i3,i99]+b[i0,i1,i2,i3,i99],x,i99)
1007 else:
1008 z+="(%s)*%s[%s]**o+(%s)*%s[%s]"%(a[i0,i1,i2,i3,i99],x,i99,b[i0,i1,i2,i3,i99],x,i99)
1009
1010 out+=tap+"%s[%s,%s,%s,%s]=%s\n"%(arg,i0,i1,i2,i3,z)
1011 return out
1012
1013 def unrollLoopsOfGrad(a,b,o,arg,tap=""):
1014 out=""
1015 if a.rank==1:
1016 for i99 in range(a.shape[0]):
1017 if o=="1":
1018 out+=tap+"%s[%s]=(%s)\n"%(arg,i99,a[i99]+b[i99])
1019 else:
1020 out+=tap+"%s[%s]=o*(%s)*x_ref[%s]**(o-1)+(%s)\n"%(arg,i99,a[i99],i99,b[i99])
1021
1022 elif a.rank==2:
1023 for i0 in range(a.shape[0]):
1024 for i99 in range(a.shape[1]):
1025 if o=="1":
1026 out+=tap+"%s[%s,%s]=(%s)\n"%(arg,i0,i99,a[i0,i99]+b[i0,i99])
1027 else:
1028 out+=tap+"%s[%s,%s]=o*(%s)*x_ref[%s]**(o-1)+(%s)\n"%(arg,i0,i99,a[i0,i99],i99,b[i0,i99])
1029
1030 elif a.rank==3:
1031 for i0 in range(a.shape[0]):
1032 for i1 in range(a.shape[1]):
1033 for i99 in range(a.shape[2]):
1034 if o=="1":
1035 out+=tap+"%s[%s,%s,%s]=(%s)\n"%(arg,i0,i1,i99,a[i0,i1,i99]+b[i0,i1,i99])
1036 else:
1037 out+=tap+"%s[%s,%s,%s]=o*(%s)*x_ref[%s]**(o-1)+(%s)\n"%(arg,i0,i1,i99,a[i0,i1,i99],i99,b[i0,i1,i99])
1038
1039 elif a.rank==4:
1040 for i0 in range(a.shape[0]):
1041 for i1 in range(a.shape[1]):
1042 for i2 in range(a.shape[2]):
1043 for i99 in range(a.shape[3]):
1044 if o=="1":
1045 out+=tap+"%s[%s,%s,%s,%s]=(%s)\n"%(arg,i0,i1,i2,i99,a[i0,i1,i2,i99]+b[i0,i1,i2,i99])
1046 else:
1047 out+=tap+"%s[%s,%s,%s,%s]=o*(%s)*x_ref[%s]**(o-1)+(%s)\n"%(arg,i0,i1,i2,i99,a[i0,i1,i2,i99],i99,b[i0,i1,i2,i99])
1048 return out
1049 def unrollLoopsOfDiv(a,b,o,arg,tap=""):
1050 out=tap+arg+"="
1051 if o=="1":
1052 z=0.
1053 for i99 in range(a.shape[0]):
1054 z+=b[i99,i99]+a[i99,i99]
1055 out+="(%s)"%z
1056 else:
1057 z=0.
1058 for i99 in range(a.shape[0]):
1059 z+=b[i99,i99]
1060 if i99>0: out+="+"
1061 out+="o*(%s)*x_ref[%s]**(o-1)"%(a[i99,i99],i99)
1062 out+="+(%s)"%z
1063 return out
1064
1065 def unrollLoopsOfInteriorIntegral(a,b,where,arg,tap=""):
1066 if where=="Function":
1067 xfac_o=1.
1068 xfac_op=0.
1069 z_fac=1./2.
1070 z_fac_s=""
1071 zo_fac_s="/(o+1.)"
1072 elif where=="FunctionOnBoundary":
1073 xfac_o=1.
1074 xfac_op=0.
1075 z_fac=1.
1076 z_fac_s="*dim"
1077 zo_fac_s="*(1+2.*(dim-1.)/(o+1.))"
1078 elif where in ["FunctionOnContactZero","FunctionOnContactOne"]:
1079 xfac_o=0.
1080 xfac_op=1.
1081 z_fac=1./2.
1082 z_fac_s=""
1083 zo_fac_s="/(o+1.)"
1084 out=""
1085 if a.rank==1:
1086 zo=0.
1087 zop=0.
1088 z=0.
1089 for i99 in range(a.shape[0]):
1090 if i99==0:
1091 zo+= xfac_o*a[i99]
1092 zop+= xfac_op*a[i99]
1093 else:
1094 zo+=a[i99]
1095 z+=b[i99]
1096
1097 out+=tap+"%s=(%s)%s+(%s)%s"%(arg,zo,zo_fac_s,z*z_fac,z_fac_s)
1098 if zop==0.:
1099 out+="\n"
1100 else:
1101 out+="+(%s)*0.5**o\n"%zop
1102 elif a.rank==2:
1103 for i0 in range(a.shape[0]):
1104 zo=0.
1105 zop=0.
1106 z=0.
1107 for i99 in range(a.shape[1]):
1108 if i99==0:
1109 zo+= xfac_o*a[i0,i99]
1110 zop+= xfac_op*a[i0,i99]
1111 else:
1112 zo+=a[i0,i99]
1113 z+=b[i0,i99]
1114
1115 out+=tap+"%s[%s]=(%s)%s+(%s)%s"%(arg,i0,zo,zo_fac_s,z*z_fac,z_fac_s)
1116 if zop==0.:
1117 out+="\n"
1118 else:
1119 out+="+(%s)*0.5**o\n"%zop
1120 elif a.rank==3:
1121 for i0 in range(a.shape[0]):
1122 for i1 in range(a.shape[1]):
1123 zo=0.
1124 zop=0.
1125 z=0.
1126 for i99 in range(a.shape[2]):
1127 if i99==0:
1128 zo+= xfac_o*a[i0,i1,i99]
1129 zop+= xfac_op*a[i0,i1,i99]
1130 else:
1131 zo+=a[i0,i1,i99]
1132 z+=b[i0,i1,i99]
1133
1134 out+=tap+"%s[%s,%s]=(%s)%s+(%s)%s"%(arg,i0,i1,zo,zo_fac_s,z*z_fac,z_fac_s)
1135 if zop==0.:
1136 out+="\n"
1137 else:
1138 out+="+(%s)*0.5**o\n"%zop
1139 elif a.rank==4:
1140 for i0 in range(a.shape[0]):
1141 for i1 in range(a.shape[1]):
1142 for i2 in range(a.shape[2]):
1143 zo=0.
1144 zop=0.
1145 z=0.
1146 for i99 in range(a.shape[3]):
1147 if i99==0:
1148 zo+= xfac_o*a[i0,i1,i2,i99]
1149 zop+= xfac_op*a[i0,i1,i2,i99]
1150
1151 else:
1152 zo+=a[i0,i1,i2,i99]
1153 z+=b[i0,i1,i2,i99]
1154
1155 out+=tap+"%s[%s,%s,%s]=(%s)%s+(%s)%s"%(arg,i0,i1,i2,zo,zo_fac_s,z*z_fac,z_fac_s)
1156 if zop==0.:
1157 out+="\n"
1158 else:
1159 out+="+(%s)*0.5**o\n"%zop
1160
1161 elif a.rank==5:
1162 for i0 in range(a.shape[0]):
1163 for i1 in range(a.shape[1]):
1164 for i2 in range(a.shape[2]):
1165 for i3 in range(a.shape[3]):
1166 zo=0.
1167 zop=0.
1168 z=0.
1169 for i99 in range(a.shape[4]):
1170 if i99==0:
1171 zo+= xfac_o*a[i0,i1,i2,i3,i99]
1172 zop+= xfac_op*a[i0,i1,i2,i3,i99]
1173
1174 else:
1175 zo+=a[i0,i1,i2,i3,i99]
1176 z+=b[i0,i1,i2,i3,i99]
1177 out+=tap+"%s[%s,%s,%s,%s]=(%s)%s+(%s)%s"%(arg,i0,i1,i2,i3,zo,zo_fac_s,z*z_fac,z_fac_s)
1178 if zop==0.:
1179 out+="\n"
1180 else:
1181 out+="+(%s)*0.5**o\n"%zop
1182
1183 return out
1184 def unrollLoopsSimplified(b,arg,tap=""):
1185 out=""
1186 if isinstance(b,float) or b.rank==0:
1187 out+=tap+"%s=(%s)*x[0]\n"%(arg,str(b))
1188
1189 elif b.rank==1:
1190 for i0 in range(b.shape[0]):
1191 out+=tap+"%s[%s]=(%s)*x[%s]\n"%(arg,i0,b[i0],i0)
1192 elif b.rank==2:
1193 for i0 in range(b.shape[0]):
1194 for i1 in range(b.shape[1]):
1195 out+=tap+"%s[%s,%s]=(%s)*x[%s]\n"%(arg,i0,i1,b[i0,i1],i1)
1196 elif b.rank==3:
1197 for i0 in range(b.shape[0]):
1198 for i1 in range(b.shape[1]):
1199 for i2 in range(b.shape[2]):
1200 out+=tap+"%s[%s,%s,%s]=(%s)*x[%s]\n"%(arg,i0,i1,i2,b[i0,i1,i2],i2)
1201 elif b.rank==4:
1202 for i0 in range(b.shape[0]):
1203 for i1 in range(b.shape[1]):
1204 for i2 in range(b.shape[2]):
1205 for i3 in range(b.shape[3]):
1206 out+=tap+"%s[%s,%s,%s,%s]=(%s)*x[%s]\n"%(arg,i0,i1,i2,i3,b[i0,i1,i2,i3],i3)
1207 return out
1208
1209 def unrollLoopsOfL2(b,where,arg,tap=""):
1210 out=""
1211 z=[]
1212 if isinstance(b,float) or b.rank==0:
1213 z.append(b**2)
1214 elif b.rank==1:
1215 for i0 in range(b.shape[0]):
1216 z.append(b[i0]**2)
1217 elif b.rank==2:
1218 for i1 in range(b.shape[1]):
1219 s=0
1220 for i0 in range(b.shape[0]):
1221 s+=b[i0,i1]**2
1222 z.append(s)
1223 elif b.rank==3:
1224 for i2 in range(b.shape[2]):
1225 s=0
1226 for i0 in range(b.shape[0]):
1227 for i1 in range(b.shape[1]):
1228 s+=b[i0,i1,i2]**2
1229 z.append(s)
1230
1231 elif b.rank==4:
1232 for i3 in range(b.shape[3]):
1233 s=0
1234 for i0 in range(b.shape[0]):
1235 for i1 in range(b.shape[1]):
1236 for i2 in range(b.shape[2]):
1237 s+=b[i0,i1,i2,i3]**2
1238 z.append(s)
1239 if where=="Function":
1240 xfac_o=1.
1241 xfac_op=0.
1242 z_fac_s=""
1243 zo_fac_s=""
1244 zo_fac=1./3.
1245 elif where=="FunctionOnBoundary":
1246 xfac_o=1.
1247 xfac_op=0.
1248 z_fac_s="*dim"
1249 zo_fac_s="*(2.*dim+1.)/3."
1250 zo_fac=1.
1251 elif where in ["FunctionOnContactZero","FunctionOnContactOne"]:
1252 xfac_o=0.
1253 xfac_op=1.
1254 z_fac_s=""
1255 zo_fac_s=""
1256 zo_fac=1./3.
1257 zo=0.
1258 zop=0.
1259 for i99 in range(len(z)):
1260 if i99==0:
1261 zo+=xfac_o*z[i99]
1262 zop+=xfac_op*z[i99]
1263 else:
1264 zo+=z[i99]
1265 out+=tap+"%s=sqrt((%s)%s"%(arg,zo*zo_fac,zo_fac_s)
1266 if zop==0.:
1267 out+=")\n"
1268 else:
1269 out+="+(%s))\n"%(zop*0.5**2)
1270 return out
1271 #=======================================================================================================
1272 # transpose
1273 #=======================================================================================================
1274 def transposeTest(r,offset):
1275 if isinstance(r,float): return r
1276 s=r.shape
1277 s1=1
1278 for i in s[:offset]: s1*=i
1279 s2=1
1280 for i in s[offset:]: s2*=i
1281 out=numarray.reshape(r,(s1,s2))
1282 out.transpose()
1283 return numarray.resize(out,s[offset:]+s[:offset])
1284
1285 name,tt="transpose",transposeTest
1286 for case0 in ["array","Symbol","constData","taggedData","expandedData"]:
1287 for sh0 in [ (), (3,), (4,5), (6,2,2),(3,2,3,4)]:
1288 for offset in range(len(sh0)+1):
1289 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1290 tname="test_%s_%s_rank%s_offset%s"%(name,case0,len(sh0),offset)
1291 text+=" def %s(self):\n"%tname
1292 sh_t=sh0[offset:]+sh0[:offset]
1293
1294 # sh_t=list(sh0)
1295 # sh_t[offset+1]=sh_t[offset]
1296 # sh_t=tuple(sh_t)
1297 # sh_r=[]
1298 # for i in range(offset): sh_r.append(sh0[i])
1299 # for i in range(offset+2,len(sh0)): sh_r.append(sh0[i])
1300 # sh_r=tuple(sh_r)
1301
1302 a_0=makeArray(sh0,[-1.,1])
1303 if case0 in ["taggedData", "expandedData"]:
1304 a1_0=makeArray(sh0,[-1.,1])
1305 else:
1306 a1_0=a_0
1307 r=tt(a_0,offset)
1308 r1=tt(a1_0,offset)
1309 text+=mkText(case0,"arg",a_0,a1_0)
1310 text+=" res=%s(arg,%s)\n"%(name,offset)
1311 if case0=="Symbol":
1312 text+=mkText("array","s",a_0,a1_0)
1313 text+=" sub=res.substitute({arg:s})\n"
1314 res="sub"
1315 text+=mkText("array","ref",r,r1)
1316 else:
1317 res="res"
1318 text+=mkText(case0,"ref",r,r1)
1319 text+=mkTypeAndShapeTest(case0,sh_t,"res")
1320 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
1321
1322 if case0 == "taggedData" :
1323 t_prog_with_tags+=text
1324 else:
1325 t_prog+=text
1326
1327 print test_header
1328 # print t_prog
1329 print t_prog_with_tags
1330 print test_tail
1331 1/0
1332 #=======================================================================================================
1333 # L2
1334 #=======================================================================================================
1335 for where in ["Function","FunctionOnBoundary","FunctionOnContactZero","FunctionOnContactOne"]:
1336 for data in ["Data","Symbol"]:
1337 for sh in [ (),(2,), (4,5), (6,2,2),(4,5,3,2)]:
1338 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1339 tname="test_L2_on%s_from%s_rank%s"%(where,data,len(sh))
1340 text+=" def %s(self):\n"%tname
1341 text+=" \"\"\"\n"
1342 text+=" tests L2-norm of %s on the %s\n\n"%(data,where)
1343 text+=" assumptions: self.domain supports integration on %s\n"%where
1344 text+=" \"\"\"\n"
1345 text+=" dim=self.domain.getDim()\n"
1346 text+=" w=%s(self.domain)\n"%where
1347 text+=" x=w.getX()\n"
1348 o="1"
1349 if len(sh)>0:
1350 sh_2=sh[:len(sh)-1]+(2,)
1351 sh_3=sh[:len(sh)-1]+(3,)
1352 b_2=makeArray(sh[:len(sh)-1]+(2,),[-1.,1])
1353 b_3=makeArray(sh[:len(sh)-1]+(3,),[-1.,1])
1354 else:
1355 sh_2=()
1356 sh_3=()
1357 b_2=makeArray(sh,[-1.,1])
1358 b_3=makeArray(sh,[-1.,1])
1359
1360 if data=="Symbol":
1361 val="s"
1362 res="sub"
1363 else:
1364 val="arg"
1365 res="res"
1366 text+=" if dim==2:\n"
1367 if data=="Symbol":
1368 text+=" arg=Symbol(shape=%s,dim=dim)\n"%str(sh_2)
1369
1370 text+=" %s=Data(0,%s,w)\n"%(val,sh_2)
1371 text+=unrollLoopsSimplified(b_2,val,tap=" ")
1372 text+=unrollLoopsOfL2(b_2,where,"ref",tap=" ")
1373 text+="\n else:\n"
1374 if data=="Symbol":
1375 text+=" arg=Symbol(shape=%s,dim=dim)\n"%str(sh_3)
1376 text+=" %s=Data(0,%s,w)\n"%(val,sh_3)
1377 text+=unrollLoopsSimplified(b_3,val,tap=" ")
1378 text+=unrollLoopsOfL2(b_3,where,"ref",tap=" ")
1379 text+="\n res=L2(arg)\n"
1380 if data=="Symbol":
1381 text+=" sub=res.substitute({arg:s})\n"
1382 text+=" self.failUnless(isinstance(res,Symbol),\"wrong type of result.\")\n"
1383 text+=" self.failUnlessEqual(res.getShape(),(),\"wrong shape of result.\")\n"
1384 else:
1385 text+=" self.failUnless(isinstance(res,float),\"wrong type of result.\")\n"
1386 text+=" self.failUnlessAlmostEqual(%s,ref,int(-log10(self.RES_TOL)),\"wrong result\")\n"%res
1387 t_prog+=text
1388 print t_prog
1389 1/0
1390
1391 #=======================================================================================================
1392 # div
1393 #=======================================================================================================
1394 for where in ["Function","FunctionOnBoundary","FunctionOnContactZero","FunctionOnContactOne"]:
1395 for data in ["Data","Symbol"]:
1396 for case in ["ContinuousFunction","Solution","ReducedSolution"]:
1397 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1398 tname="test_div_on%s_from%s_%s"%(where,data,case)
1399 text+=" def %s(self):\n"%tname
1400 text+=" \"\"\"\n"
1401 text+=" tests divergence of %s on the %s\n\n"%(data,where)
1402 text+=" assumptions: %s(self.domain) exists\n"%case
1403 text+=" self.domain supports div on %s\n"%where
1404 text+=" \"\"\"\n"
1405 if case=="ReducedSolution":
1406 text+=" o=1\n"
1407 o="1"
1408 else:
1409 text+=" o=self.order\n"
1410 o="o"
1411 text+=" dim=self.domain.getDim()\n"
1412 text+=" w_ref=%s(self.domain)\n"%where
1413 text+=" x_ref=w_ref.getX()\n"
1414 text+=" w=%s(self.domain)\n"%case
1415 text+=" x=w.getX()\n"
1416 a_2=makeArray((2,2),[-1.,1])
1417 b_2=makeArray((2,2),[-1.,1])
1418 a_3=makeArray((3,3),[-1.,1])
1419 b_3=makeArray((3,3),[-1.,1])
1420 if data=="Symbol":
1421 text+=" arg=Symbol(shape=(dim,),dim=dim)\n"
1422 val="s"
1423 res="sub"
1424 else:
1425 val="arg"
1426 res="res"
1427 text+=" %s=Vector(0,w)\n"%val
1428 text+=" if dim==2:\n"
1429 text+=unrollLoops(a_2,b_2,o,val,tap=" ")
1430 text+=unrollLoopsOfDiv(a_2,b_2,o,"ref",tap=" ")
1431 text+="\n else:\n"
1432
1433 text+=unrollLoops(a_3,b_3,o,val,tap=" ")
1434 text+=unrollLoopsOfDiv(a_3,b_3,o,"ref",tap=" ")
1435 text+="\n res=div(arg,where=w_ref)\n"
1436 if data=="Symbol":
1437 text+=" sub=res.substitute({arg:s})\n"
1438 text+=" self.failUnless(isinstance(res,%s),\"wrong type of result.\")\n"%data
1439 text+=" self.failUnlessEqual(res.getShape(),(),\"wrong shape of result.\")\n"
1440 text+=" self.failUnlessEqual(%s.getFunctionSpace(),w_ref,\"wrong function space of result.\")\n"%res
1441 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
1442
1443
1444 t_prog+=text
1445 print t_prog
1446 1/0
1447
1448 #=======================================================================================================
1449 # interpolation
1450 #=======================================================================================================
1451 for where in ["Function","FunctionOnBoundary","FunctionOnContactZero","FunctionOnContactOne","Solution","ReducedSolution"]:
1452 for data in ["Data","Symbol"]:
1453 for case in ["ContinuousFunction","Solution","ReducedSolution","Function","FunctionOnBoundary","FunctionOnContactZero","FunctionOnContactOne"]:
1454 for sh in [ (),(2,), (4,5), (6,2,2),(4,5,3,2)]:
1455 if where==case or \
1456 ( case in ["ContinuousFunction","Solution","ReducedSolution"] and where in ["Function","FunctionOnBoundary","FunctionOnContactZero","FunctionOnContactOne"] ) or \
1457 ( case in ["FunctionOnContactZero","FunctionOnContactOne"] and where in ["FunctionOnContactZero","FunctionOnContactOne"] ) or \
1458 (case=="ContinuousFunction" and where in ["Solution","ReducedSolution"]) or \
1459 (case=="Solution" and where=="ReducedSolution") :
1460
1461
1462 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1463 tname="test_interpolation_on%s_from%s_%s_rank%s"%(where,data,case,len(sh))
1464 text+=" def %s(self):\n"%tname
1465 text+=" \"\"\"\n"
1466 text+=" tests interpolation for rank %s %s onto the %s\n\n"%(len(sh),data,where)
1467 text+=" assumptions: self.domain supports inpterpolation from %s onto %s\n"%(case,where)
1468 text+=" \"\"\"\n"
1469 if case=="ReducedSolution" or where=="ReducedSolution":
1470 text+=" o=1\n"
1471 o="1"
1472 else:
1473 text+=" o=self.order\n"
1474 o="o"
1475 text+=" dim=self.domain.getDim()\n"
1476 text+=" w_ref=%s(self.domain)\n"%where
1477 text+=" x_ref=w_ref.getX()\n"
1478 text+=" w=%s(self.domain)\n"%case
1479 text+=" x=w.getX()\n"
1480 a_2=makeArray(sh+(2,),[-1.,1])
1481 b_2=makeArray(sh+(2,),[-1.,1])
1482 a_3=makeArray(sh+(3,),[-1.,1])
1483 b_3=makeArray(sh+(3,),[-1.,1])
1484 if data=="Symbol":
1485 text+=" arg=Symbol(shape=%s,dim=dim)\n"%str(sh)
1486 val="s"
1487 res="sub"
1488 else:
1489 val="arg"
1490 res="res"
1491 text+=" %s=Data(0,%s,w)\n"%(val,str(sh))
1492 text+=" ref=Data(0,%s,w_ref)\n"%str(sh)
1493 text+=" if dim==2:\n"
1494 text+=unrollLoops(a_2,b_2,o,val,tap=" ")
1495 text+=unrollLoops(a_2,b_2,o,"ref",tap=" ",x="x_ref")
1496 text+=" else:\n"
1497
1498 text+=unrollLoops(a_3,b_3,o,val,tap=" ")
1499 text+=unrollLoops(a_3,b_3,o,"ref",tap=" ",x="x_ref")
1500 text+=" res=interpolate(arg,where=w_ref)\n"
1501 if data=="Symbol":
1502 text+=" sub=res.substitute({arg:s})\n"
1503 text+=" self.failUnless(isinstance(res,%s),\"wrong type of result.\")\n"%data
1504 text+=" self.failUnlessEqual(%s.getFunctionSpace(),w_ref,\"wrong functionspace of result.\")\n"%res
1505 text+=" self.failUnlessEqual(res.getShape(),%s,\"wrong shape of result.\")\n"%str(sh)
1506 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
1507 t_prog+=text
1508 print test_header
1509 print t_prog
1510 print test_tail
1511 1/0
1512
1513 #=======================================================================================================
1514 # grad
1515 #=======================================================================================================
1516 for where in ["Function","FunctionOnBoundary","FunctionOnContactZero","FunctionOnContactOne"]:
1517 for data in ["Data","Symbol"]:
1518 for case in ["ContinuousFunction","Solution","ReducedSolution"]:
1519 for sh in [ (),(2,), (4,5), (6,2,2)]:
1520 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1521 tname="test_grad_on%s_from%s_%s_rank%s"%(where,data,case,len(sh))
1522 text+=" def %s(self):\n"%tname
1523 text+=" \"\"\"\n"
1524 text+=" tests gradient for rank %s %s on the %s\n\n"%(len(sh),data,where)
1525 text+=" assumptions: %s(self.domain) exists\n"%case
1526 text+=" self.domain supports gardient on %s\n"%where
1527 text+=" \"\"\"\n"
1528 if case=="ReducedSolution":
1529 text+=" o=1\n"
1530 o="1"
1531 else:
1532 text+=" o=self.order\n"
1533 o="o"
1534 text+=" dim=self.domain.getDim()\n"
1535 text+=" w_ref=%s(self.domain)\n"%where
1536 text+=" x_ref=w_ref.getX()\n"
1537 text+=" w=%s(self.domain)\n"%case
1538 text+=" x=w.getX()\n"
1539 a_2=makeArray(sh+(2,),[-1.,1])
1540 b_2=makeArray(sh+(2,),[-1.,1])
1541 a_3=makeArray(sh+(3,),[-1.,1])
1542 b_3=makeArray(sh+(3,),[-1.,1])
1543 if data=="Symbol":
1544 text+=" arg=Symbol(shape=%s,dim=dim)\n"%str(sh)
1545 val="s"
1546 res="sub"
1547 else:
1548 val="arg"
1549 res="res"
1550 text+=" %s=Data(0,%s,w)\n"%(val,str(sh))
1551 text+=" ref=Data(0,%s+(dim,),w_ref)\n"%str(sh)
1552 text+=" if dim==2:\n"
1553 text+=unrollLoops(a_2,b_2,o,val,tap=" ")
1554 text+=unrollLoopsOfGrad(a_2,b_2,o,"ref",tap=" ")
1555 text+=" else:\n"
1556
1557 text+=unrollLoops(a_3,b_3,o,val,tap=" ")
1558 text+=unrollLoopsOfGrad(a_3,b_3,o,"ref",tap=" ")
1559 text+=" res=grad(arg,where=w_ref)\n"
1560 if data=="Symbol":
1561 text+=" sub=res.substitute({arg:s})\n"
1562 text+=" self.failUnless(isinstance(res,%s),\"wrong type of result.\")\n"%data
1563 text+=" self.failUnlessEqual(res.getShape(),%s+(dim,),\"wrong shape of result.\")\n"%str(sh)
1564 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
1565
1566
1567 t_prog+=text
1568 print test_header
1569 print t_prog
1570 print test_tail
1571 1/0
1572
1573
1574 #=======================================================================================================
1575 # integrate
1576 #=======================================================================================================
1577 for where in ["Function","FunctionOnBoundary","FunctionOnContactZero","FunctionOnContactOne"]:
1578 for data in ["Data","Symbol"]:
1579 for case in ["ContinuousFunction","Solution","ReducedSolution","Function","FunctionOnBoundary","FunctionOnContactZero","FunctionOnContactOne"]:
1580 for sh in [ (),(2,), (4,5), (6,2,2),(4,5,3,2)]:
1581 if (not case in ["Function","FunctionOnBoundary","FunctionOnContactZero","FunctionOnContactOne"]) or where==case:
1582 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1583 tname="test_integrate_on%s_from%s_%s_rank%s"%(where,data,case,len(sh))
1584 text+=" def %s(self):\n"%tname
1585 text+=" \"\"\"\n"
1586 text+=" tests integral of rank %s %s on the %s\n\n"%(len(sh),data,where)
1587 text+=" assumptions: %s(self.domain) exists\n"%case
1588 text+=" self.domain supports integral on %s\n"%where
1589
1590 text+=" \"\"\"\n"
1591 if case=="ReducedSolution":
1592 text+=" o=1\n"
1593 o="1"
1594 else:
1595 text+=" o=self.order\n"
1596 o="o"
1597 text+=" dim=self.domain.getDim()\n"
1598 text+=" w_ref=%s(self.domain)\n"%where
1599 text+=" w=%s(self.domain)\n"%case
1600 text+=" x=w.getX()\n"
1601 a_2=makeArray(sh+(2,),[-1.,1])
1602 b_2=makeArray(sh+(2,),[-1.,1])
1603 a_3=makeArray(sh+(3,),[-1.,1])
1604 b_3=makeArray(sh+(3,),[-1.,1])
1605 if data=="Symbol":
1606 text+=" arg=Symbol(shape=%s)\n"%str(sh)
1607 val="s"
1608 res="sub"
1609 else:
1610 val="arg"
1611 res="res"
1612
1613 text+=" %s=Data(0,%s,w)\n"%(val,str(sh))
1614 if not len(sh)==0:
1615 text+=" ref=numarray.zeros(%s,numarray.Float)\n"%str(sh)
1616 text+=" if dim==2:\n"
1617 text+=unrollLoops(a_2,b_2,o,val,tap=" ")
1618 text+=unrollLoopsOfInteriorIntegral(a_2,b_2,where,"ref",tap=" ")
1619 text+=" else:\n"
1620
1621 text+=unrollLoops(a_3,b_3,o,val,tap=" ")
1622 text+=unrollLoopsOfInteriorIntegral(a_3,b_3,where,"ref",tap=" ")
1623 if case in ["ContinuousFunction","Solution","ReducedSolution"]:
1624 text+=" res=integrate(arg,where=w_ref)\n"
1625 else:
1626 text+=" res=integrate(arg)\n"
1627
1628 if data=="Symbol":
1629 text+=" sub=res.substitute({arg:s})\n"
1630 if len(sh)==0 and data=="Data":
1631 text+=" self.failUnless(isinstance(%s,float),\"wrong type of result.\")\n"%res
1632 else:
1633 if data=="Symbol":
1634 text+=" self.failUnless(isinstance(res,Symbol),\"wrong type of result.\")\n"
1635 text+=" self.failUnlessEqual(res.getShape(),%s,\"wrong shape of result.\")\n"%str(sh)
1636 else:
1637 text+=" self.failUnless(isinstance(res,numarray.NumArray),\"wrong type of result.\")\n"
1638 text+=" self.failUnlessEqual(res.shape,%s,\"wrong shape of result.\")\n"%str(sh)
1639 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
1640
1641
1642 t_prog+=text
1643 print test_header
1644 print t_prog
1645 print test_tail
1646 1/0
1647 #=======================================================================================================
1648 # inverse
1649 #=======================================================================================================
1650 name="inverse"
1651 for case0 in ["array","Symbol","constData","taggedData","expandedData"]:
1652 for sh0 in [ (1,1), (2,2), (3,3)]:
1653 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1654 tname="test_%s_%s_dim%s"%(name,case0,sh0[0])
1655 text+=" def %s(self):\n"%tname
1656 a_0=makeArray(sh0,[-1.,1])
1657 for i in range(sh0[0]): a_0[i,i]+=2
1658 if case0 in ["taggedData", "expandedData"]:
1659 a1_0=makeArray(sh0,[-1.,1])
1660 for i in range(sh0[0]): a1_0[i,i]+=3
1661 else:
1662 a1_0=a_0
1663
1664 text+=mkText(case0,"arg",a_0,a1_0)
1665 text+=" res=%s(arg)\n"%name
1666 if case0=="Symbol":
1667 text+=mkText("array","s",a_0,a1_0)
1668 text+=" sub=res.substitute({arg:s})\n"
1669 res="sub"
1670 ref="s"
1671 else:
1672 ref="arg"
1673 res="res"
1674 text+=mkTypeAndShapeTest(case0,sh0,"res")
1675 text+=" self.failUnless(Lsup(matrixmult(%s,%s)-kronecker(%s))<=self.RES_TOL,\"wrong result\")\n"%(res,ref,sh0[0])
1676
1677 if case0 == "taggedData" :
1678 t_prog_with_tags+=text
1679 else:
1680 t_prog+=text
1681
1682 print test_header
1683 # print t_prog
1684 print t_prog_with_tags
1685 print test_tail
1686 1/0
1687
1688 #=======================================================================================================
1689 # trace
1690 #=======================================================================================================
1691 def traceTest(r,offset):
1692 sh=r.shape
1693 r1=1
1694 for i in range(offset): r1*=sh[i]
1695 r2=1
1696 for i in range(offset+2,len(sh)): r2*=sh[i]
1697 r_s=numarray.reshape(r,(r1,sh[offset],sh[offset],r2))
1698 s=numarray.zeros([r1,r2],numarray.Float)
1699 for i1 in range(r1):
1700 for i2 in range(r2):
1701 for j in range(sh[offset]): s[i1,i2]+=r_s[i1,j,j,i2]
1702 return s.resize(sh[:offset]+sh[offset+2:])
1703 name,tt="trace",traceTest
1704 for case0 in ["array","Symbol","constData","taggedData","expandedData"]:
1705 for sh0 in [ (4,5), (6,2,2),(3,2,3,4)]:
1706 for offset in range(len(sh0)-1):
1707 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1708 tname="test_%s_%s_rank%s_offset%s"%(name,case0,len(sh0),offset)
1709 text+=" def %s(self):\n"%tname
1710 sh_t=list(sh0)
1711 sh_t[offset+1]=sh_t[offset]
1712 sh_t=tuple(sh_t)
1713 sh_r=[]
1714 for i in range(offset): sh_r.append(sh0[i])
1715 for i in range(offset+2,len(sh0)): sh_r.append(sh0[i])
1716 sh_r=tuple(sh_r)
1717 a_0=makeArray(sh_t,[-1.,1])
1718 if case0 in ["taggedData", "expandedData"]:
1719 a1_0=makeArray(sh_t,[-1.,1])
1720 else:
1721 a1_0=a_0
1722 r=tt(a_0,offset)
1723 r1=tt(a1_0,offset)
1724 text+=mkText(case0,"arg",a_0,a1_0)
1725 text+=" res=%s(arg,%s)\n"%(name,offset)
1726 if case0=="Symbol":
1727 text+=mkText("array","s",a_0,a1_0)
1728 text+=" sub=res.substitute({arg:s})\n"
1729 res="sub"
1730 text+=mkText("array","ref",r,r1)
1731 else:
1732 res="res"
1733 text+=mkText(case0,"ref",r,r1)
1734 text+=mkTypeAndShapeTest(case0,sh_r,"res")
1735 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
1736
1737 if case0 == "taggedData" :
1738 t_prog_with_tags+=text
1739 else:
1740 t_prog+=text
1741
1742 print test_header
1743 # print t_prog
1744 print t_prog_with_tags
1745 print test_tail
1746 1/0
1747
1748 #=======================================================================================================
1749 # clip
1750 #=======================================================================================================
1751 oper_L=[["clip",clipTEST]]
1752 for oper in oper_L:
1753 for case0 in ["float","array","Symbol","constData","taggedData","expandedData"]:
1754 for sh0 in [ (),(2,), (4,5), (6,2,2),(3,2,3,4)]:
1755 if len(sh0)==0 or not case0=="float":
1756 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1757 tname="test_%s_%s_rank%s"%(oper[0],case0,len(sh0))
1758 text+=" def %s(self):\n"%tname
1759 a_0=makeArray(sh0,[-1.,1])
1760 if case0 in ["taggedData", "expandedData"]:
1761 a1_0=makeArray(sh0,[-1.,1])
1762 else:
1763 a1_0=a_0
1764
1765 r=oper[1](a_0,-0.3,0.5)
1766 r1=oper[1](a1_0,-0.3,0.5)
1767 text+=mkText(case0,"arg",a_0,a1_0)
1768 text+=" res=%s(arg,-0.3,0.5)\n"%oper[0]
1769 if case0=="Symbol":
1770 text+=mkText("array","s",a_0,a1_0)
1771 text+=" sub=res.substitute({arg:s})\n"
1772 res="sub"
1773 text+=mkText("array","ref",r,r1)
1774 else:
1775 res="res"
1776 text+=mkText(case0,"ref",r,r1)
1777 text+=mkTypeAndShapeTest(case0,sh0,"res")
1778 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
1779
1780 if case0 == "taggedData" :
1781 t_prog_with_tags+=text
1782 else:
1783 t_prog+=text
1784
1785 print test_header
1786 # print t_prog
1787 print t_prog_with_tags
1788 print test_tail
1789 1/0
1790
1791 #=======================================================================================================
1792 # maximum, minimum, clipping
1793 #=======================================================================================================
1794 oper_L=[ ["maximum",maximumTEST],
1795 ["minimum",minimumTEST]]
1796 for oper in oper_L:
1797 for case0 in ["float","array","Symbol","constData","taggedData","expandedData"]:
1798 for sh1 in [ (),(2,), (4,5), (6,2,2),(3,2,3,4)]:
1799 for case1 in ["float","array","Symbol","constData","taggedData","expandedData"]:
1800 for sh0 in [ (),(2,), (4,5), (6,2,2),(3,2,3,4)]:
1801 if (len(sh0)==0 or not case0=="float") and (len(sh1)==0 or not case1=="float") \
1802 and (sh0==sh1 or len(sh0)==0 or len(sh1)==0) :
1803 use_tagging_for_expanded_data= case0=="taggedData" or case1=="taggedData"
1804
1805 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1806 tname="test_%s_%s_rank%s_%s_rank%s"%(oper[0],case0,len(sh0),case1,len(sh1))
1807 text+=" def %s(self):\n"%tname
1808 a_0=makeArray(sh0,[-1.,1])
1809 if case0 in ["taggedData", "expandedData"]:
1810 a1_0=makeArray(sh0,[-1.,1])
1811 else:
1812 a1_0=a_0
1813
1814 a_1=makeArray(sh1,[-1.,1])
1815 if case1 in ["taggedData", "expandedData"]:
1816 a1_1=makeArray(sh1,[-1.,1])
1817 else:
1818 a1_1=a_1
1819 r=oper[1](a_0,a_1)
1820 r1=oper[1](a1_0,a1_1)
1821 text+=mkText(case0,"arg0",a_0,a1_0,use_tagging_for_expanded_data)
1822 text+=mkText(case1,"arg1",a_1,a1_1,use_tagging_for_expanded_data)
1823 text+=" res=%s(arg0,arg1)\n"%oper[0]
1824 case=getResultCaseForBin(case0,case1)
1825 if case=="Symbol":
1826 c0_res,c1_res=case0,case1
1827 subs="{"
1828 if case0=="Symbol":
1829 text+=mkText("array","s0",a_0,a1_0)
1830 subs+="arg0:s0"
1831 c0_res="array"
1832 if case1=="Symbol":
1833 text+=mkText("array","s1",a_1,a1_1)
1834 if not subs.endswith("{"): subs+=","
1835 subs+="arg1:s1"
1836 c1_res="array"
1837 subs+="}"
1838 text+=" sub=res.substitute(%s)\n"%subs
1839 res="sub"
1840 text+=mkText(getResultCaseForBin(c0_res,c1_res),"ref",r,r1)
1841 else:
1842 res="res"
1843 text+=mkText(case,"ref",r,r1)
1844 if len(sh0)>len(sh1):
1845 text+=mkTypeAndShapeTest(case,sh0,"res")
1846 else:
1847 text+=mkTypeAndShapeTest(case,sh1,"res")
1848 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
1849
1850 if case0 == "taggedData" or case1 == "taggedData":
1851 t_prog_with_tags+=text
1852 else:
1853 t_prog+=text
1854
1855 print test_header
1856 # print t_prog
1857 print t_prog_with_tags
1858 print test_tail
1859 1/0
1860
1861
1862 #=======================================================================================================
1863 # outer inner
1864 #=======================================================================================================
1865 oper=["outer",outerTEST]
1866 # oper=["inner",innerTEST]
1867 for case0 in ["float","array","Symbol","constData","taggedData","expandedData"]:
1868 for sh1 in [ (),(2,), (4,5), (6,2,2),(3,2,3,4)]:
1869 for case1 in ["float","array","Symbol","constData","taggedData","expandedData"]:
1870 for sh0 in [ (),(2,), (4,5), (6,2,2),(3,2,3,4)]:
1871 if (len(sh0)==0 or not case0=="float") and (len(sh1)==0 or not case1=="float") \
1872 and len(sh0+sh1)<5:
1873 use_tagging_for_expanded_data= case0=="taggedData" or case1=="taggedData"
1874
1875 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1876 tname="test_%s_%s_rank%s_%s_rank%s"%(oper[0],case0,len(sh0),case1,len(sh1))
1877 text+=" def %s(self):\n"%tname
1878 a_0=makeArray(sh0,[-1.,1])
1879 if case0 in ["taggedData", "expandedData"]:
1880 a1_0=makeArray(sh0,[-1.,1])
1881 else:
1882 a1_0=a_0
1883
1884 a_1=makeArray(sh1,[-1.,1])
1885 if case1 in ["taggedData", "expandedData"]:
1886 a1_1=makeArray(sh1,[-1.,1])
1887 else:
1888 a1_1=a_1
1889 r=oper[1](a_0,a_1)
1890 r1=oper[1](a1_0,a1_1)
1891 text+=mkText(case0,"arg0",a_0,a1_0,use_tagging_for_expanded_data)
1892 text+=mkText(case1,"arg1",a_1,a1_1,use_tagging_for_expanded_data)
1893 text+=" res=%s(arg0,arg1)\n"%oper[0]
1894 case=getResultCaseForBin(case0,case1)
1895 if case=="Symbol":
1896 c0_res,c1_res=case0,case1
1897 subs="{"
1898 if case0=="Symbol":
1899 text+=mkText("array","s0",a_0,a1_0)
1900 subs+="arg0:s0"
1901 c0_res="array"
1902 if case1=="Symbol":
1903 text+=mkText("array","s1",a_1,a1_1)
1904 if not subs.endswith("{"): subs+=","
1905 subs+="arg1:s1"
1906 c1_res="array"
1907 subs+="}"
1908 text+=" sub=res.substitute(%s)\n"%subs
1909 res="sub"
1910 text+=mkText(getResultCaseForBin(c0_res,c1_res),"ref",r,r1)
1911 else:
1912 res="res"
1913 text+=mkText(case,"ref",r,r1)
1914 text+=mkTypeAndShapeTest(case,sh0+sh1,"res")
1915 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
1916
1917 if case0 == "taggedData" or case1 == "taggedData":
1918 t_prog_with_tags+=text
1919 else:
1920 t_prog+=text
1921
1922 print test_header
1923 # print t_prog
1924 print t_prog_with_tags
1925 print test_tail
1926 1/0
1927
1928 #=======================================================================================================
1929 # local reduction
1930 #=======================================================================================================
1931 for oper in [["length",0.,"out+%a1%**2","math.sqrt(out)"],
1932 ["maxval",-1.e99,"max(out,%a1%)","out"],
1933 ["minval",1.e99,"min(out,%a1%)","out"] ]:
1934 for case in case_set:
1935 for sh in shape_set:
1936 if not case=="float" or len(sh)==0:
1937 text=""
1938 text+=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1939 tname="def test_%s_%s_rank%s"%(oper[0],case,len(sh))
1940 text+=" %s(self):\n"%tname
1941 a=makeArray(sh,[-1.,1.])
1942 a1=makeArray(sh,[-1.,1.])
1943 r1=testReduce(a1,oper[1],oper[2],oper[3])
1944 r=testReduce(a,oper[1],oper[2],oper[3])
1945
1946 text+=mkText(case,"arg",a,a1)
1947 text+=" res=%s(arg)\n"%oper[0]
1948 if case=="Symbol":
1949 text+=mkText("array","s",a,a1)
1950 text+=" sub=res.substitute({arg:s})\n"
1951 text+=mkText("array","ref",r,r1)
1952 res="sub"
1953 else:
1954 text+=mkText(case,"ref",r,r1)
1955 res="res"
1956 if oper[0]=="length":
1957 text+=mkTypeAndShapeTest(case,(),"res")
1958 else:
1959 if case=="float" or case=="array":
1960 text+=mkTypeAndShapeTest("float",(),"res")
1961 else:
1962 text+=mkTypeAndShapeTest(case,(),"res")
1963 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
1964 if case == "taggedData":
1965 t_prog_with_tags+=text
1966 else:
1967 t_prog+=text
1968 print test_header
1969 # print t_prog
1970 print t_prog_with_tags
1971 print test_tail
1972 1/0
1973
1974 #=======================================================================================================
1975 # tensor multiply
1976 #=======================================================================================================
1977 # oper=["generalTensorProduct",tensorProductTest]
1978 # oper=["matrixmult",testMatrixMult]
1979 oper=["tensormult",testTensorMult]
1980
1981 for case0 in ["float","array","Symbol","constData","taggedData","expandedData"]:
1982 for sh0 in [ (),(2,), (4,5), (6,2,2),(3,2,3,4)]:
1983 for case1 in ["float","array","Symbol","constData","taggedData","expandedData"]:
1984 for sh1 in [ (),(2,), (4,5), (6,2,2),(3,2,3,4)]:
1985 for sh_s in [ (),(3,), (2,3), (2,4,3),(4,2,3,2)]:
1986 if (len(sh0+sh_s)==0 or not case0=="float") and (len(sh1+sh_s)==0 or not case1=="float") \
1987 and len(sh0+sh1)<5 and len(sh0+sh_s)<5 and len(sh1+sh_s)<5:
1988 # if len(sh_s)==1 and len(sh0+sh_s)==2 and (len(sh_s+sh1)==1 or len(sh_s+sh1)==2)): # test for matrixmult
1989 if ( len(sh_s)==1 and len(sh0+sh_s)==2 and ( len(sh1+sh_s)==2 or len(sh1+sh_s)==1 )) or (len(sh_s)==2 and len(sh0+sh_s)==4 and (len(sh1+sh_s)==2 or len(sh1+sh_s)==3 or len(sh1+sh_s)==4)): # test for tensormult
1990 case=getResultCaseForBin(case0,case1)
1991 use_tagging_for_expanded_data= case0=="taggedData" or case1=="taggedData"
1992 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
1993 # tname="test_generalTensorProduct_%s_rank%s_%s_rank%s_offset%s"%(case0,len(sh0+sh_s),case1,len(sh_s+sh1),len(sh_s))
1994 #tname="test_matrixmult_%s_rank%s_%s_rank%s"%(case0,len(sh0+sh_s),case1,len(sh_s+sh1))
1995 tname="test_tensormult_%s_rank%s_%s_rank%s"%(case0,len(sh0+sh_s),case1,len(sh_s+sh1))
1996 # if tname=="test_generalTensorProduct_array_rank1_array_rank2_offset1":
1997 # print tnametest_generalTensorProduct_Symbol_rank1_Symbol_rank3_offset1
1998 text+=" def %s(self):\n"%tname
1999 a_0=makeArray(sh0+sh_s,[-1.,1])
2000 if case0 in ["taggedData", "expandedData"]:
2001 a1_0=makeArray(sh0+sh_s,[-1.,1])
2002 else:
2003 a1_0=a_0
2004
2005 a_1=makeArray(sh_s+sh1,[-1.,1])
2006 if case1 in ["taggedData", "expandedData"]:
2007 a1_1=makeArray(sh_s+sh1,[-1.,1])
2008 else:
2009 a1_1=a_1
2010 r=oper[1](a_0,a_1,sh_s)
2011 r1=oper[1](a1_0,a1_1,sh_s)
2012 text+=mkText(case0,"arg0",a_0,a1_0,use_tagging_for_expanded_data)
2013 text+=mkText(case1,"arg1",a_1,a1_1,use_tagging_for_expanded_data)
2014 #text+=" res=matrixmult(arg0,arg1)\n"
2015 text+=" res=tensormult(arg0,arg1)\n"
2016 #text+=" res=generalTensorProduct(arg0,arg1,offset=%s)\n"%(len(sh_s))
2017 if case=="Symbol":
2018 c0_res,c1_res=case0,case1
2019 subs="{"
2020 if case0=="Symbol":
2021 text+=mkText("array","s0",a_0,a1_0)
2022 subs+="arg0:s0"
2023 c0_res="array"
2024 if case1=="Symbol":
2025 text+=mkText("array","s1",a_1,a1_1)
2026 if not subs.endswith("{"): subs+=","
2027 subs+="arg1:s1"
2028 c1_res="array"
2029 subs+="}"
2030 text+=" sub=res.substitute(%s)\n"%subs
2031 res="sub"
2032 text+=mkText(getResultCaseForBin(c0_res,c1_res),"ref",r,r1)
2033 else:
2034 res="res"
2035 text+=mkText(case,"ref",r,r1)
2036 text+=mkTypeAndShapeTest(case,sh0+sh1,"res")
2037 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
2038 if case0 == "taggedData" or case1 == "taggedData":
2039 t_prog_with_tags+=text
2040 else:
2041 t_prog+=text
2042 print test_header
2043 # print t_prog
2044 print t_prog_with_tags
2045 print test_tail
2046 1/0
2047 #=======================================================================================================
2048 # basic binary operation overloading (tests only!)
2049 #=======================================================================================================
2050 oper_range=[-5.,5.]
2051 for oper in [["add" ,"+",[-5.,5.]],
2052 ["sub" ,"-",[-5.,5.]],
2053 ["mult","*",[-5.,5.]],
2054 ["div" ,"/",[-5.,5.]],
2055 ["pow" ,"**",[0.01,5.]]]:
2056 for case0 in case_set:
2057 for sh0 in shape_set:
2058 for case1 in case_set:
2059 for sh1 in shape_set:
2060 if not case0=="array" and \
2061 (not case0=="float" or len(sh0)==0) and (not case1=="float" or len(sh1)==0) and \
2062 (sh0==() or sh1==() or sh1==sh0) and \
2063 not (case0 in ["float","array"] and case1 in ["float","array"]):
2064 use_tagging_for_expanded_data= case0=="taggedData" or case1=="taggedData"
2065 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
2066 tname="test_%s_overloaded_%s_rank%s_%s_rank%s"%(oper[0],case0,len(sh0),case1,len(sh1))
2067 text+=" def %s(self):\n"%tname
2068 a_0=makeArray(sh0,oper[2])
2069 if case0 in ["taggedData", "expandedData"]:
2070 a1_0=makeArray(sh0,oper[2])
2071 else:
2072 a1_0=a_0
2073
2074 a_1=makeArray(sh1,oper[2])
2075 if case1 in ["taggedData", "expandedData"]:
2076 a1_1=makeArray(sh1,oper[2])
2077 else:
2078 a1_1=a_1
2079 r1=makeResult2(a1_0,a1_1,"%a1%"+oper[1]+"%a2%")
2080 r=makeResult2(a_0,a_1,"%a1%"+oper[1]+"%a2%")
2081 text+=mkText(case0,"arg0",a_0,a1_0,use_tagging_for_expanded_data)
2082 text+=mkText(case1,"arg1",a_1,a1_1,use_tagging_for_expanded_data)
2083 text+=" res=arg0%sarg1\n"%oper[1]
2084
2085 case=getResultCaseForBin(case0,case1)
2086 if case=="Symbol":
2087 c0_res,c1_res=case0,case1
2088 subs="{"
2089 if case0=="Symbol":
2090 text+=mkText("array","s0",a_0,a1_0)
2091 subs+="arg0:s0"
2092 c0_res="array"
2093 if case1=="Symbol":
2094 text+=mkText("array","s1",a_1,a1_1)
2095 if not subs.endswith("{"): subs+=","
2096 subs+="arg1:s1"
2097 c1_res="array"
2098 subs+="}"
2099 text+=" sub=res.substitute(%s)\n"%subs
2100 res="sub"
2101 text+=mkText(getResultCaseForBin(c0_res,c1_res),"ref",r,r1)
2102 else:
2103 res="res"
2104 text+=mkText(case,"ref",r,r1)
2105 if isinstance(r,float):
2106 text+=mkTypeAndShapeTest(case,(),"res")
2107 else:
2108 text+=mkTypeAndShapeTest(case,r.shape,"res")
2109 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
2110
2111 if case0 in [ "constData","taggedData","expandedData"] and case1 == "Symbol":
2112 t_prog_failing+=text
2113 else:
2114 if case0 == "taggedData" or case1 == "taggedData":
2115 t_prog_with_tags+=text
2116 else:
2117 t_prog+=text
2118
2119
2120 print test_header
2121 # print t_prog
2122 # print t_prog_with_tags
2123 print t_prog_failing
2124 print test_tail
2125 1/0
2126 #=======================================================================================================
2127 # basic binary operations (tests only!)
2128 #=======================================================================================================
2129 oper_range=[-5.,5.]
2130 for oper in [["add" ,"+",[-5.,5.]],
2131 ["mult","*",[-5.,5.]],
2132 ["quotient" ,"/",[-5.,5.]],
2133 ["power" ,"**",[0.01,5.]]]:
2134 for case0 in case_set:
2135 for case1 in case_set:
2136 for sh in shape_set:
2137 for sh_p in shape_set:
2138 if len(sh_p)>0:
2139 resource=[-1,1]
2140 else:
2141 resource=[1]
2142 for sh_d in resource:
2143 if sh_d>0:
2144 sh0=sh
2145 sh1=sh+sh_p
2146 else:
2147 sh1=sh
2148 sh0=sh+sh_p
2149
2150 if (not case0=="float" or len(sh0)==0) and (not case1=="float" or len(sh1)==0) and \
2151 len(sh0)<5 and len(sh1)<5:
2152 use_tagging_for_expanded_data= case0=="taggedData" or case1=="taggedData"
2153 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
2154 tname="test_%s_%s_rank%s_%s_rank%s"%(oper[0],case0,len(sh0),case1,len(sh1))
2155 text+=" def %s(self):\n"%tname
2156 a_0=makeArray(sh0,oper[2])
2157 if case0 in ["taggedData", "expandedData"]:
2158 a1_0=makeArray(sh0,oper[2])
2159 else:
2160 a1_0=a_0
2161
2162 a_1=makeArray(sh1,oper[2])
2163 if case1 in ["taggedData", "expandedData"]:
2164 a1_1=makeArray(sh1,oper[2])
2165 else:
2166 a1_1=a_1
2167 r1=makeResult2(a1_0,a1_1,"%a1%"+oper[1]+"%a2%")
2168 r=makeResult2(a_0,a_1,"%a1%"+oper[1]+"%a2%")
2169 text+=mkText(case0,"arg0",a_0,a1_0,use_tagging_for_expanded_data)
2170 text+=mkText(case1,"arg1",a_1,a1_1,use_tagging_for_expanded_data)
2171 text+=" res=%s(arg0,arg1)\n"%oper[0]
2172
2173 case=getResultCaseForBin(case0,case1)
2174 if case=="Symbol":
2175 c0_res,c1_res=case0,case1
2176 subs="{"
2177 if case0=="Symbol":
2178 text+=mkText("array","s0",a_0,a1_0)
2179 subs+="arg0:s0"
2180 c0_res="array"
2181 if case1=="Symbol":
2182 text+=mkText("array","s1",a_1,a1_1)
2183 if not subs.endswith("{"): subs+=","
2184 subs+="arg1:s1"
2185 c1_res="array"
2186 subs+="}"
2187 text+=" sub=res.substitute(%s)\n"%subs
2188 res="sub"
2189 text+=mkText(getResultCaseForBin(c0_res,c1_res),"ref",r,r1)
2190 else:
2191 res="res"
2192 text+=mkText(case,"ref",r,r1)
2193 if isinstance(r,float):
2194 text+=mkTypeAndShapeTest(case,(),"res")
2195 else:
2196 text+=mkTypeAndShapeTest(case,r.shape,"res")
2197 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
2198
2199 if case0 == "taggedData" or case1 == "taggedData":
2200 t_prog_with_tags+=text
2201 else:
2202 t_prog+=text
2203 print test_header
2204 # print t_prog
2205 print t_prog_with_tags
2206 print test_tail
2207 1/0
2208
2209 # print t_prog_with_tagsoper_range=[-5.,5.]
2210 for oper in [["add" ,"+",[-5.,5.]],
2211 ["sub" ,"-",[-5.,5.]],
2212 ["mult","*",[-5.,5.]],
2213 ["div" ,"/",[-5.,5.]],
2214 ["pow" ,"**",[0.01,5.]]]:
2215 for case0 in case_set:
2216 for sh0 in shape_set:
2217 for case1 in case_set:
2218 for sh1 in shape_set:
2219 if (not case0=="float" or len(sh0)==0) and (not case1=="float" or len(sh1)==0) and \
2220 (sh0==() or sh1==() or sh1==sh0) and \
2221 not (case0 in ["float","array"] and case1 in ["float","array"]):
2222 text=" #+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n"
2223 tname="test_%s_%s_rank%s_%s_rank%s"%(oper[0],case0,len(sh0),case1,len(sh1))
2224 text+=" def %s(self):\n"%tname
2225 a_0=makeArray(sh0,oper[2])
2226 if case0 in ["taggedData", "expandedData"]:
2227 a1_0=makeArray(sh0,oper[2])
2228 else:
2229 a1_0=a_0
2230
2231 a_1=makeArray(sh1,oper[2])
2232 if case1 in ["taggedData", "expandedData"]:
2233 a1_1=makeArray(sh1,oper[2])
2234 else:
2235 a1_1=a_1
2236 r1=makeResult2(a1_0,a1_1,"%a1%"+oper[1]+"%a2%")
2237 r=makeResult2(a_0,a_1,"%a1%"+oper[1]+"%a2%")
2238 text+=mkText(case0,"arg0",a_0,a1_0)
2239 text+=mkText(case1,"arg1",a_1,a1_1)
2240 text+=" res=arg0%sarg1\n"%oper[1]
2241
2242 case=getResultCaseForBin(case0,case1)
2243 if case=="Symbol":
2244 c0_res,c1_res=case0,case1
2245 subs="{"
2246 if case0=="Symbol":
2247 text+=mkText("array","s0",a_0,a1_0)
2248 subs+="arg0:s0"
2249 c0_res="array"
2250 if case1=="Symbol":
2251 text+=mkText("array","s1",a_1,a1_1)
2252 if not subs.endswith("{"): subs+=","
2253 subs+="arg1:s1"
2254 c1_res="array"
2255 subs+="}"
2256 text+=" sub=res.substitute(%s)\n"%subs
2257 res="sub"
2258 text+=mkText(getResultCaseForBin(c0_res,c1_res),"ref",r,r1)
2259 else:
2260 res="res"
2261 text+=mkText(case,"ref",r,r1)
2262 if isinstance(r,float):
2263 text+=mkTypeAndShapeTest(case,(),"res")
2264 else:
2265 text+=mkTypeAndShapeTest(case,r.shape,"res")
2266 text+=" self.failUnless(Lsup(%s-ref)<=self.RES_TOL*Lsup(ref),\"wrong result\")\n"%res
2267
2268 if case0 in [ "constData","taggedData","expandedData"] and case1 == "Symbol":
2269 t_prog_failing+=text
2270 else:
2271 if case0 == "taggedData" or case1 == "taggedData":
2272 t_prog_with_tags+=text
2273 else:
2274 t_prog+=text
2275 | {
"url": "https://svn.geocomp.uq.edu.au/escript/trunk/escript/py_src/generateutil?view=markup&sortby=author&pathrev=536",
"source_domain": "svn.geocomp.uq.edu.au",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "1048968",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VIYLAQLUJQYU2OSFWA2A2NPBZ6ZNTF3L",
"WARC-Concurrent-To": "<urn:uuid:853a7c50-07de-4e3d-8206-0824e9cdae3d>",
"WARC-Date": "2019-08-24T18:56:27Z",
"WARC-IP-Address": "130.102.167.21",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:FYTDDFOK5HXM5DJ5VS7L4RHHHATPATJA",
"WARC-Record-ID": "<urn:uuid:2d2ccc38-0e82-47c5-b328-a49a7af7449d>",
"WARC-Target-URI": "https://svn.geocomp.uq.edu.au/escript/trunk/escript/py_src/generateutil?view=markup&sortby=author&pathrev=536",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1f85847b-7502-46db-95a5-ce2b69d89c9f>"
},
"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-214.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
45,
61,
62,
109,
110,
172,
173,
174,
208,
271,
297,
345,
365,
374,
376,
382,
451,
457,
474,
509,
544,
591,
645,
702,
737,
775,
827,
900,
916,
963,
1027,
1093,
1096,
1175,
1225,
1228,
1241,
1264,
1285,
1298,
1301,
1323,
1337,
1350,
1359,
1372,
1375,
1378,
1397,
1474,
1531,
1557,
1573,
1601,
1624,
1674,
1683,
1711,
1747,
1779,
1797,
1815,
1818,
1835,
1854,
1869,
1883,
1886,
1927,
1949,
1971,
1987,
2011,
2027,
2055,
2075,
2104,
2125,
2156,
2179,
2204,
2221,
2230,
2275,
2299,
2321,
2337,
2361,
2377,
2405,
2425,
2454,
2475,
2506,
2529,
2554,
2571,
2580,
2625,
2653,
2675,
2695,
2719,
2739,
2767,
2787,
2816,
2837,
2868,
2891,
2916,
2934,
2944,
2990,
3020,
3043,
3065,
3090,
3112,
3141,
3163,
3193,
3215,
3247,
3271,
3297,
3315,
3325,
3371,
3403,
3426,
3450,
3475,
3499,
3528,
3552,
3582,
3606,
3638,
3662,
3688,
3706,
3716,
3762,
3788,
3811,
3829,
3854,
3872,
3901,
3919,
3949,
3967,
3999,
4017,
4043,
4061,
4071,
4117,
4127,
4173,
4189,
4193,
4197,
4227,
4247,
4294,
4316,
4349,
4373,
4404,
4441,
4465,
4496,
4527,
4567,
4591,
4622,
4653,
4684,
4727,
4751,
4782,
4813,
4844,
4875,
4921,
4945,
4976,
5007,
5038,
5069,
5100,
5149,
5159,
5207,
5222,
5226,
5265,
5312,
5334,
5347,
5371,
5402,
5419,
5443,
5474,
5505,
5539,
5563,
5594,
5625,
5656,
5714,
5738,
5769,
5800,
5831,
5862,
5953,
5963,
6011,
6026,
6030,
6065,
6095,
6141,
6169,
6215,
6243,
6294,
6329,
6383,
6411,
6462,
6497,
6532,
6592,
6620,
6671,
6706,
6741,
6776,
6842,
6870,
6921,
6956,
6991,
7026,
7061,
7133,
7143,
7191,
7206,
7210,
7252,
7283,
7314,
7384,
7413,
7483,
7512,
7564,
7600,
7678,
7707,
7759,
7795,
7831,
7915,
7944,
7996,
8032,
8068,
8104,
8194,
8223,
8275,
8311,
8347,
8383,
8419,
8515,
8525,
8581,
8610,
8641,
8711,
8740,
8810,
8839,
8891,
8927,
9005,
9034,
9086,
9122,
9158,
9242,
9271,
9323,
9359,
9395,
9431,
9521,
9550,
9602,
9638,
9674,
9710,
9746,
9842,
9852,
9908,
9937,
9968,
10020,
10056,
10134,
10163,
10215,
10251,
10329,
10358,
10410,
10446,
10528,
10557,
10624,
10660,
10696,
10784,
10813,
10880,
10916,
10952,
10988,
11082,
11111,
11178,
11214,
11250,
11286,
11322,
11422,
11432,
11488,
11517,
11548,
11600,
11636,
11672,
11756,
11785,
11837,
11873,
11909,
11993,
12022,
12074,
12110,
12146,
12234,
12263,
12330,
12366,
12402,
12493,
12522,
12589,
12625,
12661,
12697,
12794,
12823,
12890,
12926,
12962,
12998,
13034,
13137,
13147,
13203,
13232,
13263,
13315,
13351,
13387,
13423,
13513,
13542,
13594,
13630,
13666,
13702,
13792,
13821,
13873,
13909,
13945,
13981,
14075,
14104,
14171,
14207,
14243,
14279,
14376,
14405,
14457,
14493,
14529,
14565,
14665,
14694,
14761,
14797,
14833,
14869,
14905,
15011,
15021,
15084,
15113,
15144,
15196,
15232,
15268,
15304,
15340,
15436,
15465,
15517,
15553,
15589,
15625,
15661,
15757,
15786,
15838,
15874,
15910,
15946,
15982,
16082,
16111,
16178,
16214,
16250,
16286,
16322,
16425,
16454,
16506,
16542,
16578,
16614,
16650,
16756,
16785,
16837,
16873,
16909,
16945,
16981,
17090,
17100,
17156,
17166,
17214,
17229,
17233,
17237,
17310,
17323,
17345,
17373,
17404,
17424,
17455,
17465,
17521,
17545,
17573,
17620,
17640,
17687,
17697,
17753,
17781,
17809,
17865,
17885,
17941,
17951,
18032,
18061,
18089,
18145,
18195,
18215,
18271,
18321,
18331,
18412,
18487,
18518,
18556,
18584,
18640,
18690,
18710,
18766,
18816,
18826,
18907,
18982,
19015,
19025,
19101,
19129,
19199,
19219,
19317,
19327,
19443,
19468,
19496,
19539,
19559,
19602,
19612,
19668,
19672,
19689,
19693,
19737,
19749,
19771,
19857,
19881,
19979,
20072,
20132,
20217,
20315,
20340,
20427,
20525,
20541,
20545,
20584,
20606,
20623,
20634,
20650,
20673,
20683,
20720,
20728,
20747,
20782,
20797,
20906,
20930,
21039,
21070,
21117,
21126,
21160,
21237,
21273,
21358,
21410,
21445,
21481,
21515,
21563,
21601,
21638,
21648,
21661,
21674,
21713,
21745,
21769,
21808,
21851,
21865,
21906,
21916,
21930,
21969,
22015,
22105,
22109,
22140,
22167,
22177,
22194,
22216,
22233,
22262,
22282,
22290,
22294,
22403,
22421,
22530,
22565,
22588,
22665,
22704,
22789,
22838,
22873,
22904,
22945,
22993,
23007,
23055,
23087,
23131,
23181,
23196,
23206,
23219,
23230,
23269,
23301,
23325,
23364,
23407,
23421,
23460,
23470,
23484,
23521,
23573,
23663,
23667,
23698,
23725,
23735,
23752,
23774,
23793,
23820,
23840,
23848,
23852,
23961,
23975,
24084,
24153,
24204,
24220,
24240,
24258,
24280,
24300,
24313,
24326,
24339,
24352,
24374,
24396,
24411,
24426,
24441,
24457,
24472,
24487,
24502,
24517,
24532,
24547,
24562,
24577,
24592,
24607,
24622,
24637,
24652,
24667,
24682,
24697,
24712,
24727,
24737,
24750,
24754,
24783,
24800,
24832,
24843,
24873,
24884,
24901,
24930,
24940,
24954,
24964,
24984,
25018,
25038,
25051,
25060,
25077,
25086,
25096,
25125,
25144,
25171,
25193,
25212,
25235,
25257,
25276,
25287,
25309,
25328,
25355,
25374,
25384,
25404,
25423,
25432,
25452,
25469,
25494,
25503,
25521,
25541,
25562,
25579,
25594,
25642,
25659,
25669,
25699,
25717,
25765,
25802,
25828,
25850,
25867,
25897,
25942,
25972,
26015,
26031,
26056,
26141,
26200,
26235,
26270,
26318,
26356,
26366,
26379,
26403,
26429,
26468,
26497,
26521,
26560,
26603,
26617,
26654,
26664,
26678,
26713,
26758,
26848,
26852,
26883,
26910,
26920,
26937,
26941,
26963,
26982,
27009,
27029,
27037,
27135,
27165,
27196,
27230,
27240,
27266,
27281,
27285,
27315,
27346,
27380,
27413,
27447,
27457,
27528,
27543,
27547,
27590,
27621,
27655,
27688,
27722,
27745,
27816,
27826,
27842,
27875,
27898,
27917,
27942,
27966,
27990,
28054,
28102,
28127,
28152,
28205,
28234,
28249,
28253,
28293,
28339,
28343,
28347,
28387,
28408,
28454,
28464,
28485,
28582,
28618,
28654,
28690,
28726,
28762,
28798,
28856,
28879,
28962,
28998,
29034,
29070,
29106,
29142,
29194,
29217,
29286,
29322,
29358,
29394,
29430,
29476,
29491,
29495,
29550,
29567,
29598,
29645,
29668,
29715,
29738,
29774,
29825,
29848,
29884,
29920,
29974,
29997,
30033,
30069,
30105,
30162,
30185,
30221,
30257,
30293,
30329,
30389,
30416,
30420,
30450,
30481,
30513,
30565,
30586,
30622,
30659,
30682,
30718,
30754,
30797,
30820,
30856,
30892,
30928,
30977,
31000,
31036,
31072,
31108,
31144,
31199,
31214,
31246,
31277,
31308,
31326,
31342,
31352,
31368,
31378,
31418,
31428,
31459,
31499,
31551,
31572,
31590,
31603,
31613,
31626,
31649,
31685,
31711,
31732,
31742,
31763,
31786,
31822,
31858,
31890,
31917,
31927,
31954,
31977,
32013,
32049,
32085,
32123,
32156,
32166,
32199,
32222,
32258,
32294,
32330,
32366,
32410,
32449,
32459,
32498,
32513,
32517,
32562,
32573,
32591,
32600,
32634,
32659,
32674,
32717,
32727,
32791,
32795,
32826,
32830,
32850,
32883,
32892,
32926,
32951,
32966,
33012,
33022,
33092,
33096,
33134,
33154,
33187,
33220,
33229,
33263,
33288,
33303,
33358,
33368,
33444,
33448,
33492,
33512,
33545,
33578,
33611,
33620,
33654,
33679,
33694,
33755,
33765,
33847,
33851,
33901,
33921,
33954,
33987,
34021,
34055,
34065,
34100,
34126,
34142,
34210,
34221,
34310,
34315,
34372,
34388,
34393,
34439,
34451,
34470,
34505,
34521,
34575,
34586,
34668,
34673,
34694,
34728,
34763,
34779,
34845,
34856,
34950,
34955,
34976,
35010,
35044,
35079,
35095,
35173,
35184,
35290,
35295,
35316,
35350,
35384,
35418,
35453,
35469,
35559,
35570,
35688,
35704,
35749,
35770,
35786,
35796,
35831,
35861,
35880,
35891,
35901,
35936,
35955,
35979,
36032,
36052,
36068,
36073,
36135,
36162,
36177,
36193,
36210,
36226,
36250,
36289,
36304,
36320,
36334,
36354,
36394,
36463,
36478,
36494,
36511,
36527,
36551,
36563,
36582,
36593,
36605,
36615,
36650,
36666,
36690,
36716,
36727,
36743,
36758,
36763,
36830,
36847,
36862,
36873,
36904,
36925,
36959,
36970,
36982,
36992,
37027,
37043,
37070,
37099,
37110,
37129,
37147,
37152,
37226,
37243,
37258,
37269,
37300,
37321,
37355,
37389,
37400,
37412,
37422,
37457,
37473,
37503,
37535,
37546,
37568,
37589,
37594,
37674,
37691,
37706,
37717,
37748,
37769,
37803,
37837,
37871,
37882,
37894,
37904,
37939,
37955,
37988,
38023,
38028,
38039,
38064,
38088,
38093,
38179,
38196,
38211,
38222,
38253,
38258,
38279,
38313,
38347,
38381,
38415,
38426,
38438,
38448,
38483,
38499,
38535,
38573,
38578,
38589,
38617,
38644,
38736,
38753,
38768,
38779,
38810,
38815,
38831,
38877,
38889,
38931,
38975,
38980,
39001,
39035,
39089,
39110,
39144,
39178,
39241,
39262,
39296,
39330,
39364,
39436,
39457,
39491,
39525,
39559,
39593,
39674,
39690,
39695,
39741,
39753,
39763,
39805,
39825,
39846,
39880,
39904,
39925,
39959,
39968,
40002,
40022,
40039,
40060,
40094,
40103,
40137,
40171,
40194,
40211,
40216,
40237,
40271,
40280,
40314,
40348,
40382,
40408,
40425,
40452,
40467,
40483,
40499,
40516,
40534,
40573,
40588,
40604,
40624,
40656,
40671,
40740,
40755,
40771,
40787,
40804,
40822,
40833,
40845,
40876,
40892,
40915,
40940,
40951,
40967,
41023,
41040,
41056,
41067,
41101,
41117,
41227,
41244,
41354,
41388,
41426,
41441,
41451,
41483,
41493,
41525,
41562,
41583,
41638,
41643,
41682,
41760,
41815,
41853,
41939,
42008,
42044,
42080,
42085,
42107,
42142,
42166,
42181,
42232,
42294,
42318,
42323,
42355,
42404,
42437,
42448,
42462,
42484,
42508,
42548,
42593,
42618,
42658,
42702,
42717,
42755,
42766,
42781,
42817,
42865,
42956,
42961,
42993,
43021,
43032,
43050,
43055,
43078,
43098,
43126,
43147,
43156,
43266,
43276,
43386,
43486,
43522,
43575,
43661,
43722,
43758,
43781,
43842,
43916,
43939,
43980,
44020,
44047,
44058,
44077,
44107,
44137,
44185,
44233,
44244,
44257,
44270,
44301,
44332,
44337,
44361,
44374,
44389,
44400,
44415,
44430,
44457,
44481,
44536,
44541,
44584,
44634,
44686,
44710,
44734,
44789,
44832,
44882,
44934,
44964,
44988,
45032,
45114,
45197,
45208,
45289,
45387,
45405,
45423,
45432,
45437,
45547,
45558,
45668,
45768,
45804,
45874,
45960,
46015,
46051,
46074,
46138,
46195,
46248,
46271,
46304,
46324,
46335,
46346,
46375,
46386,
46427,
46471,
46506,
46545,
46572,
46606,
46640,
46674,
46708,
46732,
46781,
46794,
46809,
46820,
46835,
46850,
46885,
46912,
46958,
47011,
47035,
47040,
47086,
47139,
47182,
47206,
47250,
47333,
47416,
47522,
47613,
47618,
47623,
47641,
47659,
47668,
47673,
47783,
47804,
47914,
48043,
48079,
48228,
48281,
48306,
48474,
48607,
48690,
48745,
48750,
48755,
48841,
48921,
48957,
48980,
49066,
49160,
49183,
49244,
49264,
49275,
49286,
49315,
49326,
49367,
49411,
49446,
49485,
49512,
49548,
49584,
49620,
49656,
49680,
49733,
49746,
49761,
49772,
49787,
49802,
49848,
49893,
49920,
49966,
50024,
50046,
50051,
50097,
50155,
50204,
50228,
50272,
50355,
50460,
50551,
50642,
50660,
50683,
50701,
50722,
50731,
50736,
50846,
50858,
50968,
51068,
51104,
51174,
51217,
51303,
51374,
51410,
51433,
51512,
51569,
51627,
51650,
51683,
51703,
51714,
51725,
51754,
51765,
51806,
51850,
51885,
51924,
51951,
51987,
52023,
52059,
52095,
52119,
52172,
52185,
52200,
52211,
52226,
52241,
52287,
52339,
52366,
52412,
52466,
52488,
52493,
52539,
52593,
52635,
52659,
52703,
52786,
52884,
52975,
52980,
52985,
53003,
53026,
53044,
53065,
53074,
53079,
53084,
53194,
53211,
53321,
53421,
53457,
53606,
53659,
53778,
53864,
53940,
53976,
53999,
54077,
54134,
54192,
54197,
54220,
54253,
54273,
54284,
54295,
54324,
54335,
54376,
54420,
54459,
54486,
54522,
54558,
54594,
54630,
54654,
54699,
54712,
54727,
54738,
54753,
54768,
54773,
54819,
54843,
54905,
54932,
54978,
55048,
55070,
55075,
55121,
55191,
55260,
55307,
55318,
55353,
55358,
55382,
55426,
55463,
55547,
55558,
55582,
55664,
55755,
55766,
55859,
55945,
56036,
56041,
56046,
56064,
56087,
56105,
56126,
56135,
56245,
56260,
56370,
56390,
56468,
56508,
56594,
56644,
56680,
56712,
56753,
56802,
56835,
56877,
56888,
56902,
56907,
56947,
56980,
57005,
57045,
57089,
57104,
57117,
57128,
57143,
57158,
57205,
57324,
57329,
57361,
57389,
57400,
57418,
57423,
57446,
57466,
57494,
57515,
57524,
57529,
57639,
57652,
57762,
57792,
57808,
57818,
57857,
57867,
57916,
57975,
58021,
58047,
58073,
58131,
58179,
58210,
58288,
58333,
58371,
58457,
58526,
58562,
58582,
58615,
58637,
58650,
58699,
58759,
58781,
58814,
58863,
58897,
58908,
58922,
58944,
58968,
59008,
59053,
59078,
59118,
59162,
59177,
59215,
59226,
59241,
59277,
59325,
59416,
59421,
59453,
59481,
59492,
59510,
59515,
59538,
59558,
59586,
59607,
59616,
59621,
59731,
59743,
59853,
59885,
59910,
59996,
60050,
60093,
60179,
60235,
60271,
60303,
60352,
60385,
60396,
60410,
60415,
60444,
60475,
60515,
60560,
60585,
60625,
60669,
60684,
60722,
60733,
60748,
60784,
60831,
60922,
60927,
60959,
60987,
60998,
61016,
61021,
61044,
61064,
61092,
61113,
61122,
61127,
61237,
61271,
61381,
61420,
61450,
61475,
61561,
61615,
61701,
61755,
61841,
61893,
61972,
61977,
62063,
62144,
62180,
62212,
62261,
62294,
62305,
62319,
62324,
62356,
62405,
62438,
62449,
62463,
62487,
62514,
62585,
62656,
62698,
62741,
62765,
62796,
62810,
62835,
62876,
62897,
62917,
62942,
62983,
63025,
63046,
63066,
63081,
63125,
63140,
63205,
63216,
63231,
63266,
63293,
63339,
63350,
63396,
63487,
63492,
63548,
63576,
63587,
63605,
63610,
63633,
63653,
63681,
63702,
63711,
63716,
63721,
63831,
63850,
63960,
63990,
64022,
64108,
64162,
64248,
64302,
64388,
64413,
64492,
64497,
64583,
64664,
64700,
64732,
64781,
64814,
64825,
64839,
64844,
64876,
64925,
64958,
64969,
64983,
65007,
65034,
65105,
65176,
65218,
65261,
65285,
65316,
65330,
65355,
65396,
65417,
65437,
65462,
65503,
65545,
65566,
65586,
65601,
65645,
65660,
65725,
65736,
65751,
65786,
65836,
65927,
65932,
65988,
66016,
66027,
66045,
66050,
66073,
66093,
66121,
66142,
66151,
66156,
66266,
66289,
66399,
66463,
66509,
66556,
66583,
66609,
66650,
66663,
66750,
66808,
66840,
66870,
66901,
66948,
66993,
66998,
67033,
67069,
67093,
67129,
67173,
67211,
67226,
67237,
67272,
67287,
67314,
67359,
67370,
67410,
67458,
67469,
67514,
67605,
67635,
67663,
67674,
67692,
67715,
67735,
67763,
67784,
67793,
67798,
67908,
67931,
68041,
68096,
68138,
68178,
68183,
68269,
68323,
68409,
68463,
68518,
68614,
68679,
68790,
69005,
69048,
69127,
69213,
69335,
69427,
69518,
69596,
69674,
69710,
69747,
69796,
69834,
69845,
69859,
69864,
69901,
69950,
69988,
69999,
70013,
70042,
70074,
70145,
70216,
70259,
70301,
70376,
70400,
70431,
70445,
70470,
70511,
70532,
70552,
70577,
70618,
70660,
70681,
70701,
70716,
70760,
70775,
70840,
70851,
70866,
70901,
70951,
71042,
71098,
71126,
71137,
71155,
71178,
71198,
71226,
71247,
71256,
71366,
71422,
71532,
71557,
71598,
71626,
71654,
71682,
71713,
71741,
71768,
71796,
71823,
71856,
71943,
71987,
72057,
72136,
72222,
72314,
72350,
72382,
72431,
72464,
72475,
72489,
72494,
72526,
72575,
72608,
72619,
72633,
72686,
72736,
72807,
72878,
72917,
72922,
72965,
72989,
73020,
73034,
73059,
73100,
73121,
73141,
73166,
73207,
73249,
73270,
73290,
73305,
73349,
73364,
73429,
73440,
73455,
73490,
73519,
73564,
73575,
73625,
73716,
73721,
73804,
73830,
73841,
73897,
73925,
73936,
73954,
73959,
73964,
73987,
74007,
74037,
74063,
74084,
74093,
74203,
74248,
74358,
74383,
74424,
74452,
74485,
74518,
74546,
74574,
74600,
74628,
74649,
74670,
74681,
74699,
74726,
74742,
74754,
74771,
74782,
74794,
74811,
74816,
74906,
74938,
75017,
75103,
75184,
75220,
75252,
75301,
75334,
75345,
75359,
75364,
75396,
75445,
75478,
75489,
75503,
75556,
75606,
75677,
75748,
75790,
75795,
75838,
75862,
75893,
75907,
75932,
75973,
75994,
76014,
76039,
76080,
76122,
76143,
76163,
76178,
76222,
76237,
76302,
76313,
76328,
76363,
76392,
76437,
76448,
76498,
76589,
76594,
76650,
76678,
76689,
76707,
76730,
76750,
76778,
76799,
76808,
76813,
76862,
76903,
76931,
76959,
76987,
77018,
77046,
77073,
77101,
77128,
77218,
77262,
77332,
77418,
77499,
77535,
77567,
77616,
77649,
77660,
77674,
77679,
77711,
77760,
77793,
77804,
77818,
77871,
77921,
77962,
78003,
78042,
78047,
78090,
78114,
78145,
78159,
78184,
78225,
78246,
78266,
78291,
78332,
78374,
78395,
78415,
78430,
78474,
78489,
78554,
78565,
78580,
78615,
78644,
78689,
78700,
78750,
78841,
78846,
78929,
78955,
78966,
79022,
79050,
79061,
79079
],
"line_end_idx": [
45,
61,
62,
109,
110,
172,
173,
174,
208,
271,
297,
345,
365,
374,
376,
382,
451,
457,
474,
509,
544,
591,
645,
702,
737,
775,
827,
900,
916,
963,
1027,
1093,
1096,
1175,
1225,
1228,
1241,
1264,
1285,
1298,
1301,
1323,
1337,
1350,
1359,
1372,
1375,
1378,
1397,
1474,
1531,
1557,
1573,
1601,
1624,
1674,
1683,
1711,
1747,
1779,
1797,
1815,
1818,
1835,
1854,
1869,
1883,
1886,
1927,
1949,
1971,
1987,
2011,
2027,
2055,
2075,
2104,
2125,
2156,
2179,
2204,
2221,
2230,
2275,
2299,
2321,
2337,
2361,
2377,
2405,
2425,
2454,
2475,
2506,
2529,
2554,
2571,
2580,
2625,
2653,
2675,
2695,
2719,
2739,
2767,
2787,
2816,
2837,
2868,
2891,
2916,
2934,
2944,
2990,
3020,
3043,
3065,
3090,
3112,
3141,
3163,
3193,
3215,
3247,
3271,
3297,
3315,
3325,
3371,
3403,
3426,
3450,
3475,
3499,
3528,
3552,
3582,
3606,
3638,
3662,
3688,
3706,
3716,
3762,
3788,
3811,
3829,
3854,
3872,
3901,
3919,
3949,
3967,
3999,
4017,
4043,
4061,
4071,
4117,
4127,
4173,
4189,
4193,
4197,
4227,
4247,
4294,
4316,
4349,
4373,
4404,
4441,
4465,
4496,
4527,
4567,
4591,
4622,
4653,
4684,
4727,
4751,
4782,
4813,
4844,
4875,
4921,
4945,
4976,
5007,
5038,
5069,
5100,
5149,
5159,
5207,
5222,
5226,
5265,
5312,
5334,
5347,
5371,
5402,
5419,
5443,
5474,
5505,
5539,
5563,
5594,
5625,
5656,
5714,
5738,
5769,
5800,
5831,
5862,
5953,
5963,
6011,
6026,
6030,
6065,
6095,
6141,
6169,
6215,
6243,
6294,
6329,
6383,
6411,
6462,
6497,
6532,
6592,
6620,
6671,
6706,
6741,
6776,
6842,
6870,
6921,
6956,
6991,
7026,
7061,
7133,
7143,
7191,
7206,
7210,
7252,
7283,
7314,
7384,
7413,
7483,
7512,
7564,
7600,
7678,
7707,
7759,
7795,
7831,
7915,
7944,
7996,
8032,
8068,
8104,
8194,
8223,
8275,
8311,
8347,
8383,
8419,
8515,
8525,
8581,
8610,
8641,
8711,
8740,
8810,
8839,
8891,
8927,
9005,
9034,
9086,
9122,
9158,
9242,
9271,
9323,
9359,
9395,
9431,
9521,
9550,
9602,
9638,
9674,
9710,
9746,
9842,
9852,
9908,
9937,
9968,
10020,
10056,
10134,
10163,
10215,
10251,
10329,
10358,
10410,
10446,
10528,
10557,
10624,
10660,
10696,
10784,
10813,
10880,
10916,
10952,
10988,
11082,
11111,
11178,
11214,
11250,
11286,
11322,
11422,
11432,
11488,
11517,
11548,
11600,
11636,
11672,
11756,
11785,
11837,
11873,
11909,
11993,
12022,
12074,
12110,
12146,
12234,
12263,
12330,
12366,
12402,
12493,
12522,
12589,
12625,
12661,
12697,
12794,
12823,
12890,
12926,
12962,
12998,
13034,
13137,
13147,
13203,
13232,
13263,
13315,
13351,
13387,
13423,
13513,
13542,
13594,
13630,
13666,
13702,
13792,
13821,
13873,
13909,
13945,
13981,
14075,
14104,
14171,
14207,
14243,
14279,
14376,
14405,
14457,
14493,
14529,
14565,
14665,
14694,
14761,
14797,
14833,
14869,
14905,
15011,
15021,
15084,
15113,
15144,
15196,
15232,
15268,
15304,
15340,
15436,
15465,
15517,
15553,
15589,
15625,
15661,
15757,
15786,
15838,
15874,
15910,
15946,
15982,
16082,
16111,
16178,
16214,
16250,
16286,
16322,
16425,
16454,
16506,
16542,
16578,
16614,
16650,
16756,
16785,
16837,
16873,
16909,
16945,
16981,
17090,
17100,
17156,
17166,
17214,
17229,
17233,
17237,
17310,
17323,
17345,
17373,
17404,
17424,
17455,
17465,
17521,
17545,
17573,
17620,
17640,
17687,
17697,
17753,
17781,
17809,
17865,
17885,
17941,
17951,
18032,
18061,
18089,
18145,
18195,
18215,
18271,
18321,
18331,
18412,
18487,
18518,
18556,
18584,
18640,
18690,
18710,
18766,
18816,
18826,
18907,
18982,
19015,
19025,
19101,
19129,
19199,
19219,
19317,
19327,
19443,
19468,
19496,
19539,
19559,
19602,
19612,
19668,
19672,
19689,
19693,
19737,
19749,
19771,
19857,
19881,
19979,
20072,
20132,
20217,
20315,
20340,
20427,
20525,
20541,
20545,
20584,
20606,
20623,
20634,
20650,
20673,
20683,
20720,
20728,
20747,
20782,
20797,
20906,
20930,
21039,
21070,
21117,
21126,
21160,
21237,
21273,
21358,
21410,
21445,
21481,
21515,
21563,
21601,
21638,
21648,
21661,
21674,
21713,
21745,
21769,
21808,
21851,
21865,
21906,
21916,
21930,
21969,
22015,
22105,
22109,
22140,
22167,
22177,
22194,
22216,
22233,
22262,
22282,
22290,
22294,
22403,
22421,
22530,
22565,
22588,
22665,
22704,
22789,
22838,
22873,
22904,
22945,
22993,
23007,
23055,
23087,
23131,
23181,
23196,
23206,
23219,
23230,
23269,
23301,
23325,
23364,
23407,
23421,
23460,
23470,
23484,
23521,
23573,
23663,
23667,
23698,
23725,
23735,
23752,
23774,
23793,
23820,
23840,
23848,
23852,
23961,
23975,
24084,
24153,
24204,
24220,
24240,
24258,
24280,
24300,
24313,
24326,
24339,
24352,
24374,
24396,
24411,
24426,
24441,
24457,
24472,
24487,
24502,
24517,
24532,
24547,
24562,
24577,
24592,
24607,
24622,
24637,
24652,
24667,
24682,
24697,
24712,
24727,
24737,
24750,
24754,
24783,
24800,
24832,
24843,
24873,
24884,
24901,
24930,
24940,
24954,
24964,
24984,
25018,
25038,
25051,
25060,
25077,
25086,
25096,
25125,
25144,
25171,
25193,
25212,
25235,
25257,
25276,
25287,
25309,
25328,
25355,
25374,
25384,
25404,
25423,
25432,
25452,
25469,
25494,
25503,
25521,
25541,
25562,
25579,
25594,
25642,
25659,
25669,
25699,
25717,
25765,
25802,
25828,
25850,
25867,
25897,
25942,
25972,
26015,
26031,
26056,
26141,
26200,
26235,
26270,
26318,
26356,
26366,
26379,
26403,
26429,
26468,
26497,
26521,
26560,
26603,
26617,
26654,
26664,
26678,
26713,
26758,
26848,
26852,
26883,
26910,
26920,
26937,
26941,
26963,
26982,
27009,
27029,
27037,
27135,
27165,
27196,
27230,
27240,
27266,
27281,
27285,
27315,
27346,
27380,
27413,
27447,
27457,
27528,
27543,
27547,
27590,
27621,
27655,
27688,
27722,
27745,
27816,
27826,
27842,
27875,
27898,
27917,
27942,
27966,
27990,
28054,
28102,
28127,
28152,
28205,
28234,
28249,
28253,
28293,
28339,
28343,
28347,
28387,
28408,
28454,
28464,
28485,
28582,
28618,
28654,
28690,
28726,
28762,
28798,
28856,
28879,
28962,
28998,
29034,
29070,
29106,
29142,
29194,
29217,
29286,
29322,
29358,
29394,
29430,
29476,
29491,
29495,
29550,
29567,
29598,
29645,
29668,
29715,
29738,
29774,
29825,
29848,
29884,
29920,
29974,
29997,
30033,
30069,
30105,
30162,
30185,
30221,
30257,
30293,
30329,
30389,
30416,
30420,
30450,
30481,
30513,
30565,
30586,
30622,
30659,
30682,
30718,
30754,
30797,
30820,
30856,
30892,
30928,
30977,
31000,
31036,
31072,
31108,
31144,
31199,
31214,
31246,
31277,
31308,
31326,
31342,
31352,
31368,
31378,
31418,
31428,
31459,
31499,
31551,
31572,
31590,
31603,
31613,
31626,
31649,
31685,
31711,
31732,
31742,
31763,
31786,
31822,
31858,
31890,
31917,
31927,
31954,
31977,
32013,
32049,
32085,
32123,
32156,
32166,
32199,
32222,
32258,
32294,
32330,
32366,
32410,
32449,
32459,
32498,
32513,
32517,
32562,
32573,
32591,
32600,
32634,
32659,
32674,
32717,
32727,
32791,
32795,
32826,
32830,
32850,
32883,
32892,
32926,
32951,
32966,
33012,
33022,
33092,
33096,
33134,
33154,
33187,
33220,
33229,
33263,
33288,
33303,
33358,
33368,
33444,
33448,
33492,
33512,
33545,
33578,
33611,
33620,
33654,
33679,
33694,
33755,
33765,
33847,
33851,
33901,
33921,
33954,
33987,
34021,
34055,
34065,
34100,
34126,
34142,
34210,
34221,
34310,
34315,
34372,
34388,
34393,
34439,
34451,
34470,
34505,
34521,
34575,
34586,
34668,
34673,
34694,
34728,
34763,
34779,
34845,
34856,
34950,
34955,
34976,
35010,
35044,
35079,
35095,
35173,
35184,
35290,
35295,
35316,
35350,
35384,
35418,
35453,
35469,
35559,
35570,
35688,
35704,
35749,
35770,
35786,
35796,
35831,
35861,
35880,
35891,
35901,
35936,
35955,
35979,
36032,
36052,
36068,
36073,
36135,
36162,
36177,
36193,
36210,
36226,
36250,
36289,
36304,
36320,
36334,
36354,
36394,
36463,
36478,
36494,
36511,
36527,
36551,
36563,
36582,
36593,
36605,
36615,
36650,
36666,
36690,
36716,
36727,
36743,
36758,
36763,
36830,
36847,
36862,
36873,
36904,
36925,
36959,
36970,
36982,
36992,
37027,
37043,
37070,
37099,
37110,
37129,
37147,
37152,
37226,
37243,
37258,
37269,
37300,
37321,
37355,
37389,
37400,
37412,
37422,
37457,
37473,
37503,
37535,
37546,
37568,
37589,
37594,
37674,
37691,
37706,
37717,
37748,
37769,
37803,
37837,
37871,
37882,
37894,
37904,
37939,
37955,
37988,
38023,
38028,
38039,
38064,
38088,
38093,
38179,
38196,
38211,
38222,
38253,
38258,
38279,
38313,
38347,
38381,
38415,
38426,
38438,
38448,
38483,
38499,
38535,
38573,
38578,
38589,
38617,
38644,
38736,
38753,
38768,
38779,
38810,
38815,
38831,
38877,
38889,
38931,
38975,
38980,
39001,
39035,
39089,
39110,
39144,
39178,
39241,
39262,
39296,
39330,
39364,
39436,
39457,
39491,
39525,
39559,
39593,
39674,
39690,
39695,
39741,
39753,
39763,
39805,
39825,
39846,
39880,
39904,
39925,
39959,
39968,
40002,
40022,
40039,
40060,
40094,
40103,
40137,
40171,
40194,
40211,
40216,
40237,
40271,
40280,
40314,
40348,
40382,
40408,
40425,
40452,
40467,
40483,
40499,
40516,
40534,
40573,
40588,
40604,
40624,
40656,
40671,
40740,
40755,
40771,
40787,
40804,
40822,
40833,
40845,
40876,
40892,
40915,
40940,
40951,
40967,
41023,
41040,
41056,
41067,
41101,
41117,
41227,
41244,
41354,
41388,
41426,
41441,
41451,
41483,
41493,
41525,
41562,
41583,
41638,
41643,
41682,
41760,
41815,
41853,
41939,
42008,
42044,
42080,
42085,
42107,
42142,
42166,
42181,
42232,
42294,
42318,
42323,
42355,
42404,
42437,
42448,
42462,
42484,
42508,
42548,
42593,
42618,
42658,
42702,
42717,
42755,
42766,
42781,
42817,
42865,
42956,
42961,
42993,
43021,
43032,
43050,
43055,
43078,
43098,
43126,
43147,
43156,
43266,
43276,
43386,
43486,
43522,
43575,
43661,
43722,
43758,
43781,
43842,
43916,
43939,
43980,
44020,
44047,
44058,
44077,
44107,
44137,
44185,
44233,
44244,
44257,
44270,
44301,
44332,
44337,
44361,
44374,
44389,
44400,
44415,
44430,
44457,
44481,
44536,
44541,
44584,
44634,
44686,
44710,
44734,
44789,
44832,
44882,
44934,
44964,
44988,
45032,
45114,
45197,
45208,
45289,
45387,
45405,
45423,
45432,
45437,
45547,
45558,
45668,
45768,
45804,
45874,
45960,
46015,
46051,
46074,
46138,
46195,
46248,
46271,
46304,
46324,
46335,
46346,
46375,
46386,
46427,
46471,
46506,
46545,
46572,
46606,
46640,
46674,
46708,
46732,
46781,
46794,
46809,
46820,
46835,
46850,
46885,
46912,
46958,
47011,
47035,
47040,
47086,
47139,
47182,
47206,
47250,
47333,
47416,
47522,
47613,
47618,
47623,
47641,
47659,
47668,
47673,
47783,
47804,
47914,
48043,
48079,
48228,
48281,
48306,
48474,
48607,
48690,
48745,
48750,
48755,
48841,
48921,
48957,
48980,
49066,
49160,
49183,
49244,
49264,
49275,
49286,
49315,
49326,
49367,
49411,
49446,
49485,
49512,
49548,
49584,
49620,
49656,
49680,
49733,
49746,
49761,
49772,
49787,
49802,
49848,
49893,
49920,
49966,
50024,
50046,
50051,
50097,
50155,
50204,
50228,
50272,
50355,
50460,
50551,
50642,
50660,
50683,
50701,
50722,
50731,
50736,
50846,
50858,
50968,
51068,
51104,
51174,
51217,
51303,
51374,
51410,
51433,
51512,
51569,
51627,
51650,
51683,
51703,
51714,
51725,
51754,
51765,
51806,
51850,
51885,
51924,
51951,
51987,
52023,
52059,
52095,
52119,
52172,
52185,
52200,
52211,
52226,
52241,
52287,
52339,
52366,
52412,
52466,
52488,
52493,
52539,
52593,
52635,
52659,
52703,
52786,
52884,
52975,
52980,
52985,
53003,
53026,
53044,
53065,
53074,
53079,
53084,
53194,
53211,
53321,
53421,
53457,
53606,
53659,
53778,
53864,
53940,
53976,
53999,
54077,
54134,
54192,
54197,
54220,
54253,
54273,
54284,
54295,
54324,
54335,
54376,
54420,
54459,
54486,
54522,
54558,
54594,
54630,
54654,
54699,
54712,
54727,
54738,
54753,
54768,
54773,
54819,
54843,
54905,
54932,
54978,
55048,
55070,
55075,
55121,
55191,
55260,
55307,
55318,
55353,
55358,
55382,
55426,
55463,
55547,
55558,
55582,
55664,
55755,
55766,
55859,
55945,
56036,
56041,
56046,
56064,
56087,
56105,
56126,
56135,
56245,
56260,
56370,
56390,
56468,
56508,
56594,
56644,
56680,
56712,
56753,
56802,
56835,
56877,
56888,
56902,
56907,
56947,
56980,
57005,
57045,
57089,
57104,
57117,
57128,
57143,
57158,
57205,
57324,
57329,
57361,
57389,
57400,
57418,
57423,
57446,
57466,
57494,
57515,
57524,
57529,
57639,
57652,
57762,
57792,
57808,
57818,
57857,
57867,
57916,
57975,
58021,
58047,
58073,
58131,
58179,
58210,
58288,
58333,
58371,
58457,
58526,
58562,
58582,
58615,
58637,
58650,
58699,
58759,
58781,
58814,
58863,
58897,
58908,
58922,
58944,
58968,
59008,
59053,
59078,
59118,
59162,
59177,
59215,
59226,
59241,
59277,
59325,
59416,
59421,
59453,
59481,
59492,
59510,
59515,
59538,
59558,
59586,
59607,
59616,
59621,
59731,
59743,
59853,
59885,
59910,
59996,
60050,
60093,
60179,
60235,
60271,
60303,
60352,
60385,
60396,
60410,
60415,
60444,
60475,
60515,
60560,
60585,
60625,
60669,
60684,
60722,
60733,
60748,
60784,
60831,
60922,
60927,
60959,
60987,
60998,
61016,
61021,
61044,
61064,
61092,
61113,
61122,
61127,
61237,
61271,
61381,
61420,
61450,
61475,
61561,
61615,
61701,
61755,
61841,
61893,
61972,
61977,
62063,
62144,
62180,
62212,
62261,
62294,
62305,
62319,
62324,
62356,
62405,
62438,
62449,
62463,
62487,
62514,
62585,
62656,
62698,
62741,
62765,
62796,
62810,
62835,
62876,
62897,
62917,
62942,
62983,
63025,
63046,
63066,
63081,
63125,
63140,
63205,
63216,
63231,
63266,
63293,
63339,
63350,
63396,
63487,
63492,
63548,
63576,
63587,
63605,
63610,
63633,
63653,
63681,
63702,
63711,
63716,
63721,
63831,
63850,
63960,
63990,
64022,
64108,
64162,
64248,
64302,
64388,
64413,
64492,
64497,
64583,
64664,
64700,
64732,
64781,
64814,
64825,
64839,
64844,
64876,
64925,
64958,
64969,
64983,
65007,
65034,
65105,
65176,
65218,
65261,
65285,
65316,
65330,
65355,
65396,
65417,
65437,
65462,
65503,
65545,
65566,
65586,
65601,
65645,
65660,
65725,
65736,
65751,
65786,
65836,
65927,
65932,
65988,
66016,
66027,
66045,
66050,
66073,
66093,
66121,
66142,
66151,
66156,
66266,
66289,
66399,
66463,
66509,
66556,
66583,
66609,
66650,
66663,
66750,
66808,
66840,
66870,
66901,
66948,
66993,
66998,
67033,
67069,
67093,
67129,
67173,
67211,
67226,
67237,
67272,
67287,
67314,
67359,
67370,
67410,
67458,
67469,
67514,
67605,
67635,
67663,
67674,
67692,
67715,
67735,
67763,
67784,
67793,
67798,
67908,
67931,
68041,
68096,
68138,
68178,
68183,
68269,
68323,
68409,
68463,
68518,
68614,
68679,
68790,
69005,
69048,
69127,
69213,
69335,
69427,
69518,
69596,
69674,
69710,
69747,
69796,
69834,
69845,
69859,
69864,
69901,
69950,
69988,
69999,
70013,
70042,
70074,
70145,
70216,
70259,
70301,
70376,
70400,
70431,
70445,
70470,
70511,
70532,
70552,
70577,
70618,
70660,
70681,
70701,
70716,
70760,
70775,
70840,
70851,
70866,
70901,
70951,
71042,
71098,
71126,
71137,
71155,
71178,
71198,
71226,
71247,
71256,
71366,
71422,
71532,
71557,
71598,
71626,
71654,
71682,
71713,
71741,
71768,
71796,
71823,
71856,
71943,
71987,
72057,
72136,
72222,
72314,
72350,
72382,
72431,
72464,
72475,
72489,
72494,
72526,
72575,
72608,
72619,
72633,
72686,
72736,
72807,
72878,
72917,
72922,
72965,
72989,
73020,
73034,
73059,
73100,
73121,
73141,
73166,
73207,
73249,
73270,
73290,
73305,
73349,
73364,
73429,
73440,
73455,
73490,
73519,
73564,
73575,
73625,
73716,
73721,
73804,
73830,
73841,
73897,
73925,
73936,
73954,
73959,
73964,
73987,
74007,
74037,
74063,
74084,
74093,
74203,
74248,
74358,
74383,
74424,
74452,
74485,
74518,
74546,
74574,
74600,
74628,
74649,
74670,
74681,
74699,
74726,
74742,
74754,
74771,
74782,
74794,
74811,
74816,
74906,
74938,
75017,
75103,
75184,
75220,
75252,
75301,
75334,
75345,
75359,
75364,
75396,
75445,
75478,
75489,
75503,
75556,
75606,
75677,
75748,
75790,
75795,
75838,
75862,
75893,
75907,
75932,
75973,
75994,
76014,
76039,
76080,
76122,
76143,
76163,
76178,
76222,
76237,
76302,
76313,
76328,
76363,
76392,
76437,
76448,
76498,
76589,
76594,
76650,
76678,
76689,
76707,
76730,
76750,
76778,
76799,
76808,
76813,
76862,
76903,
76931,
76959,
76987,
77018,
77046,
77073,
77101,
77128,
77218,
77262,
77332,
77418,
77499,
77535,
77567,
77616,
77649,
77660,
77674,
77679,
77711,
77760,
77793,
77804,
77818,
77871,
77921,
77962,
78003,
78042,
78047,
78090,
78114,
78145,
78159,
78184,
78225,
78246,
78266,
78291,
78332,
78374,
78395,
78415,
78430,
78474,
78489,
78554,
78565,
78580,
78615,
78644,
78689,
78700,
78750,
78841,
78846,
78929,
78955,
78966,
79022,
79050,
79061,
79079,
79083
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 79083,
"ccnet_original_nlines": 2286,
"rps_doc_curly_bracket": 0.0005563800223171711,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.13135647773742676,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0017340800259262323,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5598907470703125,
"rps_doc_frac_unique_words": 0.47189369797706604,
"rps_doc_mean_word_length": 7.280916690826416,
"rps_doc_num_sentences": 994,
"rps_doc_symbol_to_word_ratio": 0.004985480103641748,
"rps_doc_unigram_entropy": 6.7857465744018555,
"rps_doc_word_count": 6849,
"rps_doc_frac_chars_dupe_10grams": 0.005053440108895302,
"rps_doc_frac_chars_dupe_5grams": 0.056670740246772766,
"rps_doc_frac_chars_dupe_6grams": 0.02512684091925621,
"rps_doc_frac_chars_dupe_7grams": 0.012934410013258457,
"rps_doc_frac_chars_dupe_8grams": 0.010768639855086803,
"rps_doc_frac_chars_dupe_9grams": 0.005053440108895302,
"rps_doc_frac_chars_top_2gram": 0.008021339774131775,
"rps_doc_frac_chars_top_3gram": 0.011229869909584522,
"rps_doc_frac_chars_top_4gram": 0.010588159784674644,
"rps_doc_books_importance": -10834.830078125,
"rps_doc_books_importance_length_correction": -10834.830078125,
"rps_doc_openwebtext_importance": -5580.5185546875,
"rps_doc_openwebtext_importance_length_correction": -5580.5185546875,
"rps_doc_wikipedia_importance": -4098.98388671875,
"rps_doc_wikipedia_importance_length_correction": -4098.98388671875
},
"fasttext": {
"dclm": 0.041675031185150146,
"english": 0.2962798774242401,
"fineweb_edu_approx": 1.5633490085601807,
"eai_general_math": 0.2169092893600464,
"eai_open_web_math": 0.3078776001930237,
"eai_web_code": 0.3030548095703125
}
} | {
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
478,202,984,047,064,800 | 1
I have situation like this
template<class T> class Vector {
T *data;
uint _size, _counter;
public:
class Iterator;
template<template<class> class C> Vector(typename C<T>::Iterator it1,
typename C<T>::Iterator it2) {
data = NULL;
_size = _counter = 0;
for(typename C<T>::Iterator it = it1; it != it2 && it != end(); it++)
push(*it);
}
};
that is my own Vector class and the constructor mimics behaviour of vector (u can construct it with range of data supplied using interators) but add requirement that the container is to be template of the same type as the one under construction. I get error
5.cpp:16:36: error: no matching function for call to ‘Vector::Vector(Vector::Iterator, Vector::Iterator)’ 5.cpp:16:36: note: candidates are: In file included from 5.cpp:2:0:
5.hpp:17:37: note: template class typedef C C> Vector::Vector(typename C::Iterator, typename C::Iterator)
5.hpp:17:37: note: template argument deduction/substitution failed:
5.cpp:16:36: note: couldn't deduce template parameter ‘template class typedef C C’ In file included from 5.cpp:2:0:
5.hpp:11:3: note: Vector::Vector() [with T = int]
5.hpp:11:3: note: candidate expects 0 arguments, 2 provided
5.hpp:7:25: note: Vector::Vector(const Vector&)
5.hpp:7:25: note: candidate expects 1 argument, 2 provided
Need some help in here.
• What's that template<template<class> class C>? – Alexander Shukaev Apr 18 '13 at 21:12
• constructor is template method with parameter C that is itself a template with one parameter name irrevelant. – lord.didger Apr 18 '13 at 21:14
• it != end(). That can't be right. – jrok Apr 18 '13 at 21:15
• I presume you are defining the class Iterator; below the function definition? – indeterminately sequenced Apr 18 '13 at 21:15
• It looks like you have a case of non-deducible context here. In a nutshell, you cannot deduce C out of C<T>::iterator. It is in fact useless, you are not even mention it in the body of the function. Parameterize by the iterator type, never by the container type. – n. 'pronouns' m. Apr 18 '13 at 21:15
3
In:
template<template<class> class C> Vector(typename C<T>::Iterator it1,
typename C<T>::Iterator it2)
the compiler does not deduce type C from typename C<T>::Iterator because it is what is called nondeduced context.
See §14.8.2.4 Deducing template arguments from a type [temp.deduct.type]:
4 The nondeduced contexts are:
— The nested-name-specifier of a type that was specified using a qualified-id.
— A type that is a template-id in which one or more of the template-arguments is an expression that references a template-parameter.
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://stackoverflow.com/questions/16093073/template-argument-for-a-function-in-template-class",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "143785",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:62BWS4F6JWLQV3V7RBLW4KV72L25TF2D",
"WARC-Concurrent-To": "<urn:uuid:b23b8c44-8ea2-4986-a4f2-9b82c9426ccb>",
"WARC-Date": "2020-01-21T02:31:55Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UST53JN6DUVHMN56GF7MNEY4YCLJ3442",
"WARC-Record-ID": "<urn:uuid:66fc27b4-81f3-4e8d-804b-1e5d838102f0>",
"WARC-Target-URI": "https://stackoverflow.com/questions/16093073/template-argument-for-a-function-in-template-class",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b790637c-8880-4950-aa89-940bafe673de>"
},
"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-103.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
30,
31,
64,
75,
99,
107,
125,
197,
271,
288,
314,
388,
405,
409,
412,
413,
671,
672,
846,
847,
953,
954,
1022,
1023,
1139,
1140,
1190,
1191,
1251,
1252,
1300,
1301,
1360,
1361,
1385,
1386,
1477,
1625,
1690,
1820,
2126,
2128,
2129,
2133,
2134,
2205,
2278,
2279,
2393,
2394,
2468,
2469,
2500,
2501,
2580,
2581,
2714,
2715,
2727,
2728,
2828,
2829
],
"line_end_idx": [
2,
3,
30,
31,
64,
75,
99,
107,
125,
197,
271,
288,
314,
388,
405,
409,
412,
413,
671,
672,
846,
847,
953,
954,
1022,
1023,
1139,
1140,
1190,
1191,
1251,
1252,
1300,
1301,
1360,
1361,
1385,
1386,
1477,
1625,
1690,
1820,
2126,
2128,
2129,
2133,
2134,
2205,
2278,
2279,
2393,
2394,
2468,
2469,
2500,
2501,
2580,
2581,
2714,
2715,
2727,
2728,
2828,
2829,
2919
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2919,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0.001370329991914332,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21751411259174347,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04802260175347328,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.39406779408454895,
"rps_doc_frac_unique_words": 0.47826087474823,
"rps_doc_mean_word_length": 5.082125663757324,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.9517822265625,
"rps_doc_word_count": 414,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11359316110610962,
"rps_doc_frac_chars_dupe_6grams": 0.08460076153278351,
"rps_doc_frac_chars_dupe_7grams": 0.07129278033971786,
"rps_doc_frac_chars_dupe_8grams": 0.07129278033971786,
"rps_doc_frac_chars_dupe_9grams": 0.07129278033971786,
"rps_doc_frac_chars_top_2gram": 0.011882130056619644,
"rps_doc_frac_chars_top_3gram": 0.016634980216622353,
"rps_doc_frac_chars_top_4gram": 0.02138783037662506,
"rps_doc_books_importance": -266.7497253417969,
"rps_doc_books_importance_length_correction": -266.7497253417969,
"rps_doc_openwebtext_importance": -166.91497802734375,
"rps_doc_openwebtext_importance_length_correction": -166.91497802734375,
"rps_doc_wikipedia_importance": -148.33328247070312,
"rps_doc_wikipedia_importance_length_correction": -148.33328247070312
},
"fasttext": {
"dclm": 0.023813549429178238,
"english": 0.7621837258338928,
"fineweb_edu_approx": 2.3959715366363525,
"eai_general_math": 0.013559579849243164,
"eai_open_web_math": 0.06196177005767822,
"eai_web_code": 0.0010665099835023284
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
114,602,735,617,030,320 | Создание структуры каталогов iso-образа и создание iso-образа
Severnyj
Команда форума
Супер-Модератор
Ассоциация VN/VIP
Сообщения
8,495
Реакции
5,653
Баллы
753
В этой статье мы рассмотрим самое начало и самый конец в последовательности действий по созданию образа диска:
• Создание структуры каталогов образа диска
• Создание образа диска в формате .iso
Создание структуры каталога выпоняется командным сценарием copype.cmd запущенным с определенными параметрами.
Запустите Командную строку средств развертывания с правами Администратора и введите в окне консоли команду:
Код:
copype.cmd <arch> <destination>
, где arch - архитектура образа WinPE (x86, x64 или ia64), destination - директория в которую бует скопирована структура каталога образа, файл winpe.wim с которым в дальнейшем мы будем работать с помощью утилиты DISM и файл etfsboot.com, являющийся загрузочным файлом формата El Torito.
например:
Код:
copype.cmd x86 c:\winpe
Данный сценарий создает следующую структуру каталогов и скопирует все необходимые файлы для этой архитектуры.
\winpe
\winpe\ISO
\winpe\mount
Папка \ISO содержит все файлы, необходимые для создания ISO-файла с помощью средства Oscdimg, за исключением образа Windows PE (boot.wim). Необходимо создать свой особый образ boot.wim с помощью используемого по умолчанию образа Windows PE (winpe.wim) и скопировать или экспортировать файл boot.wim в папку \ISO\sources. Папка \mount используется для подключения образов Windows PE с помощью средства DISM.
После данной операции выполняются операции:
• Подключение (монтирование) образа winpe.wim с помощью утилиты DISM (читаем здесь)
• Настройка образа интегрирование пакетов и драйверов (то же по ссылке выше)
• Копирование в образ пользовательских программ (см. здесь)
• Редактирование файлов, используемых для автозагрузки приложений (см. здесь)
• Отключение (демонтирование) образа с внесением изменений в файл winpe.wim (см. здесь)
После всей выполненной работы необходимо скопировать или экспортировать файл winpe.wim в директорию:
Код:
\ISO\sources
например:
Код:
C:\winpe\ISO\sources
под именем boot.wim.
Можно просто скопировать файл через проводник или командой copy, например так:
Код:
copy c:\winpe_x86\winpe.wim c:\winpe_x86\ISO\sources\boot.wim
, однако лучше экспортировать его с помощью программы ImageX. Почему лучше? Потому что при редактировании образа winpe.wim программа dism добавляет в файл при сохранении слишком много лишней индексирующей информации и в результате файл winpe.wim при нескольких операциях монтирования-демонтирования ощутимо увеличивается в размерах, что сказывается не в положительную сторону расхода оперативной памяти при заходе в среду предустановки с диска, содержащего такой образ. По этой причине использование экспорта предпочтительнее обычного копирования.
Следует отметить, что если в директории \ISO\sources уже существует файл boot.wim, например скопированный туда ранее, перед процедурой экспорта необходимо этот файл удалить, иначе экспорт произведен не будет, несмотря на то, что ошибок программа ImageX не выдаст и все будет выглядеть прилично. Итак командуем:
Код:
imagex /export <путь к папке destination>\winpe.wim 1 <путь к папке destination>\ISO\sources\boot.wim "Windows PE 3.0" /compress maximum
например:
Код:
imagex /export c:\winpe\winpe.wim 1 c:\winpe\ISO\sources\boot.wim "Windows PE 3.0" /compress maximum
- утилита поддерживает сжатие образа, поэтому образ будет не только оптимизирован, но и сжат.
Теперь, после того, как структура каталогов создана полностью, необходимо создать образ диска в формате iso для дальнейшей записи на CD.
Проводить это действие мы будем с помощью консольной утилиты Oscdimg, скомандуем:
Код:
oscdimg -n -o -h -b<путь к папке destination>\etfsboot.com <путь к папке destination\ISO> <путь до сохраняемого образа>
например:
Код:
oscdimg -n -o -h -bC:\winpe\etfsboot.com C:\winpe\ISO C:\winpe\winpe_x86.iso
- здесь параметрами командной строки мы задали включение в образ скрытых и системных файлов, оптимизацию образа, запись загрузчика etfsboot.com (обратите внимание на отсутствие пробела) и собственно создали файл образа диска в папке C:\winpe\
На этом описание процедуры создания структуры каталогов iso-образа и создания iso-образа завершено.
До скорых встреч!!!
Сверху Снизу | {
"url": "https://safezone.cc/threads/sozdanie-struktury-katalogov-iso-obraza-i-sozdanie-iso-obraza.19309/",
"source_domain": "safezone.cc",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "68463",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FLJ34QEWAGDOMVCUYJZRASL5FRUYIUR2",
"WARC-Concurrent-To": "<urn:uuid:80e662fa-acd6-4988-bf47-46158ba01864>",
"WARC-Date": "2020-08-13T15:24:54Z",
"WARC-IP-Address": "52.164.202.115",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XP43BDRK5NDPJJEL52GVU4A7C5KUSJXI",
"WARC-Record-ID": "<urn:uuid:410db15a-936d-4be9-b7ee-4bd0f474138b>",
"WARC-Target-URI": "https://safezone.cc/threads/sozdanie-struktury-katalogov-iso-obraza-i-sozdanie-iso-obraza.19309/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db22bdc1-2f74-4534-b2d8-d3e6a224ba2a>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-195.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,
62,
63,
72,
73,
88,
104,
122,
132,
138,
146,
152,
158,
162,
273,
274,
320,
361,
362,
472,
473,
581,
582,
587,
619,
906,
907,
917,
918,
923,
947,
1057,
1058,
1059,
1066,
1077,
1090,
1497,
1498,
1542,
1628,
1707,
1769,
1849,
1939,
1940,
2041,
2042,
2047,
2060,
2070,
2071,
2076,
2097,
2118,
2119,
2198,
2199,
2204,
2266,
2814,
2815,
3126,
3127,
3132,
3269,
3279,
3280,
3285,
3386,
3480,
3481,
3618,
3619,
3701,
3702,
3707,
3827,
3837,
3838,
3843,
3920,
4163,
4164,
4264,
4265,
4285,
4287
],
"line_end_idx": [
62,
63,
72,
73,
88,
104,
122,
132,
138,
146,
152,
158,
162,
273,
274,
320,
361,
362,
472,
473,
581,
582,
587,
619,
906,
907,
917,
918,
923,
947,
1057,
1058,
1059,
1066,
1077,
1090,
1497,
1498,
1542,
1628,
1707,
1769,
1849,
1939,
1940,
2041,
2042,
2047,
2060,
2070,
2071,
2076,
2097,
2118,
2119,
2198,
2199,
2204,
2266,
2814,
2815,
3126,
3127,
3132,
3269,
3279,
3280,
3285,
3386,
3480,
3481,
3618,
3619,
3701,
3702,
3707,
3827,
3837,
3838,
3843,
3920,
4163,
4164,
4264,
4265,
4285,
4287,
4299
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4299,
"ccnet_original_nlines": 87,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.019583839923143387,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0342717282474041,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.806609570980072,
"rps_doc_frac_unique_words": 0.5622710585594177,
"rps_doc_mean_word_length": 6.47802209854126,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.367705821990967,
"rps_doc_word_count": 546,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.022052589803934097,
"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.015832630917429924,
"rps_doc_frac_chars_top_3gram": 0.008481759577989578,
"rps_doc_frac_chars_top_4gram": 0.015832630917429924,
"rps_doc_books_importance": -267.1520690917969,
"rps_doc_books_importance_length_correction": -267.1520690917969,
"rps_doc_openwebtext_importance": -160.8968048095703,
"rps_doc_openwebtext_importance_length_correction": -160.8968048095703,
"rps_doc_wikipedia_importance": -186.66542053222656,
"rps_doc_wikipedia_importance_length_correction": -186.66542053222656
},
"fasttext": {
"dclm": 0.608421802520752,
"english": 0.000035090000892523676,
"fineweb_edu_approx": 2.444366455078125,
"eai_general_math": -0.000009299999874201603,
"eai_open_web_math": 0.1662953495979309,
"eai_web_code": 0.5259523391723633
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
997,300,848,220,983,800 | Swap elements of ArrayList with Java collections
Java 8Object Oriented ProgrammingProgramming
In order to swap elements of ArrayList with Java collections, we need to use the Collections.swap() method. It swaps the elements at the specified positions in the list.
Declaration −The java.util.Collections.swap() method is declared as follows −
public static void swap(List <?> list, int i, int j)
where i is the index of the first element to be swapped, j is the index of the other element to be swapped and list is the list where the swapping takes place.
Let us see a program to swap elements of ArrayList with Java collections −
Example
Live Demo
import java.util.*;
public class Example {
public static void main (String[] args) {
ArrayList<Integer> list = new ArrayList<Integer>();
list.add(10);
list.add(20);
list.add(30);
list.add(40);
list.add(50);
System.out.println("Original list : " + list);
Collections.swap(list, 3, 1); // swapping element at index 3 i.e. 40 and index 1 i.e. 20
System.out.println("List after swapping : " + list);
}
}
Output
Original list : [10, 20, 30, 40, 50]
List after swapping : [10, 40, 30, 20, 50]
raja
Updated on 25-Jun-2020 14:31:53
Advertisements | {
"url": "https://www.tutorialspoint.com/swap-elements-of-arraylist-with-java-collections",
"source_domain": "www.tutorialspoint.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "31080",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C4LLSSUKL3Q4JLQP6U4JU7SPNVWAA4AR",
"WARC-Concurrent-To": "<urn:uuid:37523c21-7f2a-49d0-9714-b4caeb282b5d>",
"WARC-Date": "2022-08-09T10:57:56Z",
"WARC-IP-Address": "192.229.210.176",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TA4HJXTXSBLIFOXWBMFOCWP7MRYU6Y57",
"WARC-Record-ID": "<urn:uuid:1e7551e0-c267-47d1-8c76-cfbc7315d581>",
"WARC-Target-URI": "https://www.tutorialspoint.com/swap-elements-of-arraylist-with-java-collections",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6e175f0f-8724-4794-9afc-635c017bf3d6>"
},
"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-91\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,
49,
50,
95,
96,
266,
267,
345,
346,
399,
400,
560,
561,
636,
637,
645,
646,
657,
658,
678,
701,
746,
804,
824,
844,
864,
884,
904,
957,
1052,
1111,
1116,
1118,
1119,
1126,
1127,
1164,
1207,
1212,
1244,
1245
],
"line_end_idx": [
49,
50,
95,
96,
266,
267,
345,
346,
399,
400,
560,
561,
636,
637,
645,
646,
657,
658,
678,
701,
746,
804,
824,
844,
864,
884,
904,
957,
1052,
1111,
1116,
1118,
1119,
1126,
1127,
1164,
1207,
1212,
1244,
1245,
1259
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1259,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0.0031771198846399784,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20962199568748474,
"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.3986254334449768,
"rps_doc_frac_unique_words": 0.5380117297172546,
"rps_doc_mean_word_length": 5.222222328186035,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.2835516929626465,
"rps_doc_word_count": 171,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.17917132377624512,
"rps_doc_frac_chars_dupe_6grams": 0.14557671546936035,
"rps_doc_frac_chars_dupe_7grams": 0.14557671546936035,
"rps_doc_frac_chars_dupe_8grams": 0.09854423254728317,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04031354933977127,
"rps_doc_frac_chars_top_3gram": 0.047032471746206284,
"rps_doc_frac_chars_top_4gram": 0.07726763933897018,
"rps_doc_books_importance": -91.07865142822266,
"rps_doc_books_importance_length_correction": -91.07865142822266,
"rps_doc_openwebtext_importance": -55.47792434692383,
"rps_doc_openwebtext_importance_length_correction": -55.47792434692383,
"rps_doc_wikipedia_importance": -49.2650260925293,
"rps_doc_wikipedia_importance_length_correction": -49.2650260925293
},
"fasttext": {
"dclm": 0.04077320918440819,
"english": 0.5721737742424011,
"fineweb_edu_approx": 2.355076313018799,
"eai_general_math": 0.03015357069671154,
"eai_open_web_math": 0.2613913416862488,
"eai_web_code": 0.9998750686645508
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,025,405,192,561,100,000 | billing question... constultant pays for client.. how do i turn off auto rebill I set up a client with one care, and put the 49.95 charge on my credit card.<br>I do not want this to automatically rebill at end of year.<br><br>My client will have to make other arrangements to pay at that point.<br>They are fearful of internet credit card charges and that is why they did not want to use thier own card.<br><br>They're renewal next year is a secondary issue.<br>I just want to get my credit card info off of the account becuase I am not setup to track billing of small items like this.<br><br>thanks for your help.<br><br>Joe Silverman© 2009 Microsoft Corporation. All rights reserved.Fri, 06 Feb 2009 14:34:37 Z70c52417-e2db-4b61-a4a0-2e56a68e7297https://social.microsoft.com/Forums/en-US/70c52417-e2db-4b61-a4a0-2e56a68e7297/billing-question-constultant-pays-for-client-how-do-i-turn-off-auto-rebill?forum=onecareinstallandactivate#70c52417-e2db-4b61-a4a0-2e56a68e7297https://social.microsoft.com/Forums/en-US/70c52417-e2db-4b61-a4a0-2e56a68e7297/billing-question-constultant-pays-for-client-how-do-i-turn-off-auto-rebill?forum=onecareinstallandactivate#70c52417-e2db-4b61-a4a0-2e56a68e7297JoeDatastreamhttps://social.microsoft.com:443/profile/joedatastream/?type=forumbilling question... constultant pays for client.. how do i turn off auto rebill I set up a client with one care, and put the 49.95 charge on my credit card.<br>I do not want this to automatically rebill at end of year.<br><br>My client will have to make other arrangements to pay at that point.<br>They are fearful of internet credit card charges and that is why they did not want to use thier own card.<br><br>They're renewal next year is a secondary issue.<br>I just want to get my credit card info off of the account becuase I am not setup to track billing of small items like this.<br><br>thanks for your help.<br><br>Joe SilvermanFri, 06 Feb 2009 03:15:08 Z2009-02-06T03:15:08Zhttps://social.microsoft.com/Forums/en-US/70c52417-e2db-4b61-a4a0-2e56a68e7297/billing-question-constultant-pays-for-client-how-do-i-turn-off-auto-rebill?forum=onecareinstallandactivate#d3c2d2e5-0e77-43ce-b49a-4ef016fe2557https://social.microsoft.com/Forums/en-US/70c52417-e2db-4b61-a4a0-2e56a68e7297/billing-question-constultant-pays-for-client-how-do-i-turn-off-auto-rebill?forum=onecareinstallandactivate#d3c2d2e5-0e77-43ce-b49a-4ef016fe2557Stephen Bootshttps://social.microsoft.com:443/profile/stephen%20boots/?type=forumbilling question... constultant pays for client.. how do i turn off auto rebill By setting up the account with a LiveID and you Billing information, you created an account for you.<br>There are three ways to resolve this.<br>1. Change the credit card and contact information for the Billing account at <a href="https://billing.microsoft.com">https://billing.microsoft.com</a> to be the information for your customer (note that the credit card must be valid) so that your customer will be billed for renewal.<br>2. When the subscription is close to renewal, cancel it by contacting OneCare customer service. Your customer will then need to create their own subscription directly.<br>3. Obtain a retail copy of OneCare for the customer and renew at the above URL with the key which will add 12 months to the subscription at which point it will no longer be able to be renewed since the service will no longer be available for purchase after Morro is available in the latter half of 2009. The current subscription will be fully supported until it ends or until the end of 2010.<br><br>Personally, I would recommend the 1st option.<br>-steve<hr class="sig">Microsoft MVP Windows Live / Windows Live OneCare & Live Mesh Forum ModeratorFri, 06 Feb 2009 14:34:22 Z2009-02-06T14:34:22Z | {
"url": "https://social.microsoft.com/Forums/en-US/onecareinstallandactivate/thread/70c52417-e2db-4b61-a4a0-2e56a68e7297?outputAs=rss",
"source_domain": "social.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "5964",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NHXSDZLP5RATYRK4NYMAPXN6C4E4VUAV",
"WARC-Concurrent-To": "<urn:uuid:f7637c99-e6cb-49a0-971a-99e6a3e3de5a>",
"WARC-Date": "2022-01-29T04:08:27Z",
"WARC-IP-Address": "23.57.143.141",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:2ALMI2VY36QFVTOO2FPZO6RJETZ3YACC",
"WARC-Record-ID": "<urn:uuid:55b8d967-8975-4abb-a0ef-8f32d610bf6a>",
"WARC-Target-URI": "https://social.microsoft.com/Forums/en-US/onecareinstallandactivate/thread/70c52417-e2db-4b61-a4a0-2e56a68e7297?outputAs=rss",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9585dba9-b934-4859-8819-1c88cead7d41>"
},
"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-106\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
],
"line_end_idx": [
3762
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3762,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2761276066303253,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022002199664711952,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31463146209716797,
"rps_doc_frac_unique_words": 0.4046511650085449,
"rps_doc_mean_word_length": 7.013953685760498,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0.007700770162045956,
"rps_doc_unigram_entropy": 4.8132452964782715,
"rps_doc_word_count": 430,
"rps_doc_frac_chars_dupe_10grams": 0.3325596749782562,
"rps_doc_frac_chars_dupe_5grams": 0.3325596749782562,
"rps_doc_frac_chars_dupe_6grams": 0.3325596749782562,
"rps_doc_frac_chars_dupe_7grams": 0.3325596749782562,
"rps_doc_frac_chars_dupe_8grams": 0.3325596749782562,
"rps_doc_frac_chars_dupe_9grams": 0.3325596749782562,
"rps_doc_frac_chars_top_2gram": 0.01989389955997467,
"rps_doc_frac_chars_top_3gram": 0.022877980023622513,
"rps_doc_frac_chars_top_4gram": 0.0258620698004961,
"rps_doc_books_importance": -418.9136047363281,
"rps_doc_books_importance_length_correction": -418.9136047363281,
"rps_doc_openwebtext_importance": -227.8579864501953,
"rps_doc_openwebtext_importance_length_correction": -227.8579864501953,
"rps_doc_wikipedia_importance": -164.97116088867188,
"rps_doc_wikipedia_importance_length_correction": -164.97116088867188
},
"fasttext": {
"dclm": 0.026971880346536636,
"english": 0.768918514251709,
"fineweb_edu_approx": 0.8791544437408447,
"eai_general_math": 0.04719715937972069,
"eai_open_web_math": 0.0347895585000515,
"eai_web_code": 0.02600603923201561
}
} | {
"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": "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": "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": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-9,201,693,296,016,507,000 | Merge from cvs-trunk-mirror to mozilla-central.
[email protected]
Mon, 28 Jan 2008 17:32:29 -0800
changeset 10836 d403bde8a07cdbd9c5dc3c578751bf77a5e796ce
parent 10368 f12729556fbb28e016c5aaafb9b480b041a55ffa (current diff)
parent 10835 55d574a32683b2b54fb406e97b0ccd17645fc71e (diff)
child 10837 1b97a74034d15c57739eb92ca5471fd91329b267
push id1
push userroot
push dateTue, 26 Apr 2011 22:38:44 +0000
treeherdermozilla-beta@bfdb6e623a36 [default view] [failures only]
perfherder[talos] [build metrics] [platform microbench] (compared to previous push)
milestone1.9b3pre
Merge from cvs-trunk-mirror to mozilla-central.
browser/app/default.xpm
browser/branding/unofficial/default.xpm
client.mk
client.py
config/autoconf.mk.in
config/rules.mk
configure.in
extensions/inspector/resources/locale/sv-SE/search/findFiles.dtd
extensions/inspector/resources/locale/sv-SE/search/junkImgs.dtd
gfx/cairo/cairo/src/cairo-operator.c
intl/unicharutil/public/nsIOrderIdFormater.h
intl/unicharutil/src/nsCharsList.h
intl/unicharutil/src/nsCharsOrderIdFormater.cpp
intl/unicharutil/src/nsCharsOrderIdFormater.h
intl/unicharutil/src/nsRangeCharsList.cpp
intl/unicharutil/src/nsRangeCharsList.h
intl/unicharutil/src/nsStringCharsList.cpp
intl/unicharutil/src/nsStringCharsList.h
js/src/js.cpp
js/src/jsapi.cpp
js/src/jsarray.cpp
js/src/jsatom.cpp
js/src/jsbool.cpp
js/src/jsdbgapi.cpp
js/src/jsemit.cpp
js/src/jsfun.cpp
js/src/jsgc.cpp
js/src/jsinterp.cpp
js/src/jsiter.cpp
js/src/jslock.cpp
js/src/jsobj.cpp
js/src/jsopcode.cpp
js/src/jsparse.cpp
js/src/jsstr.cpp
js/src/jsxml.cpp
modules/libpr0n/test/unit/image2jpg16x16-win.png
modules/libpr0n/test/unit/image2jpg32x32-win.png
other-licenses/branding/firefox/default.xpm
toolkit/themes/winstripe/global/icons/autocomplete-dropmark-arrow.png
toolkit/themes/winstripe/global/icons/autocomplete-dropmark-bkgnd-mid-bottom.png
toolkit/themes/winstripe/global/icons/autocomplete-dropmark-bkgnd-mid-top.png
toolkit/themes/winstripe/global/icons/autocomplete-dropmark-bkgnd.png
widget/public/nsIMenu.h
widget/public/nsIMenuItem.h
widget/src/cocoa/nsIChangeManager.idl
widget/src/cocoa/nsIMenuCommandDispatcher.idl
widget/src/gtk2/nsIPrintJobGTK.h
widget/src/gtk2/nsPrintJobFactoryGTK.cpp
widget/src/gtk2/nsPrintJobFactoryGTK.h
widget/src/gtk2/nsPrintJobGTK.cpp
widget/src/gtk2/nsPrintJobGTK.h
xulrunner/app/default.xpm
--- a/README.txt
+++ b/README.txt
@@ -1,306 +1,20 @@
-==============================================================
-
-= = = = = = = = = = Mozilla Read Me = = = = = = = = = = =
-
-==============================================================
-
-Mozilla is subject to the terms detailed in the license
-agreement accompanying it.
-
-This Read Me file contains information about system
-requirements and installation instructions for the Windows,
-Mac OS, and Linux builds of Mozilla.
-
-For more info on Mozilla, see www.mozilla.org. To submit bugs
-or other feedback, see the Navigator QA menu and check out
-Bugzilla at http://bugzilla.mozilla.org for links to known
-bugs, bug-writing guidelines, and more. You can also get help
-with Bugzilla by pointing your IRC client to #mozillazine
-at irc.mozilla.org.
-
-
-==============================================================
-
- Getting Mozilla
-
-==============================================================
-
-You can download nightly builds of Mozilla from the
-Mozilla.org FTP site at
-
- ftp://ftp.mozilla.org/pub/mozilla.org/mozilla/nightly/
-
-For the very latest builds, see
-
- ftp://ftp.mozilla.org/pub/mozilla.org/mozilla/nightly/latest-trunk
+For information on how to build Mozilla from the source code, see:
-Keep in mind that nightly builds, which are used by
-Mozilla.org developers for testing, may be buggy. If you are
-looking for a more polished version of Mozilla, Mozilla.org
-releases Milestone builds of Mozilla every six weeks or so
-that you can download from
-
- http://www.mozilla.org/releases
-
-Be sure to read the Mozilla release notes for information
-on known problems and installation issues with Mozilla.
-The release notes can be found at the preceding URL along
-with the milestone releases themselves.
-
-Note: Please use Talkback builds whenever possible. These
-builds allow transmission of crash data back to Mozilla
-developers, improved crash analysis, and posting of crash
-information to our crash-data newsgroup.
-
-
-==============================================================
-
- System Requirements
-
-==============================================================
-
-*All Platforms
-
- To view and use the new streamlined "Modern" theme,
- your display monitor should be set to display
- thousands of colors. For users who cannot set their
- displays to use more than 256 colors, Mozilla.org
- recommends using the "Classic" theme for Mozilla.
-
- To select the Modern theme after you have installed
- Mozilla, from the Navigator browser, open the View
- menu, and then open then open the Apply Theme submenu
- and choose Modern.
-
-*Mac OS
+ http://developer.mozilla.org/en/docs/Build_Documentation
- -Mac OS X or later
- -PowerPC processor (266 MHz or faster recommended)
- -64 MB RAM
- -36 MB of free hard disk space
-
-*Windows
-
- -Windows 95, 98, Me, NT4, 2000 or XP
- -Intel Pentium class processor (233 MHz or faster
- recommended)
- -64 MB RAM
- -26 MB free hard disk space
-
-*Linux
-
- -The following library versions (or compatible) are
- required: glibc 2.1, XFree86 3.3.x, GTK 1.2.x, Glib
- 1.2.x, Libstdc++ 2.9.0. Red Hat Linux 6.0,
- Debian 2.1, and SuSE 6.2 (or later) installations
- should work.
- -Red Hat 6.x users who want to install the Mozilla
- RPM must have at least version 4.0.2 of rpm
- installed.
- -Intel Pentium class processor (233 MHz or faster
- recommended)
- -64MB RAM
- -26MB free hard disk space
-
-
-==============================================================
-
- Installation Instructions
-
-==============================================================
+To have your bug fix / feature added to Mozilla, you should create a patch and
+submit it to Bugzilla (http://bugzilla.mozilla.org). Instructions are at:
-For Mac OS and Windows users, it is strongly recommended that
-you exit all programs before running the setup program. Also,
-you should temporarily disable virus-detection software.
-
-For Linux users, note that the installation instructions use
-the bash shell. If you're not using bash, adjust the commands
-accordingly.
-
-For all platforms, install into a clean (new) directory.
-Installing on top of previously released builds may cause
-problems.
-
-Note: These instructions do not tell you how to build Mozilla.
-For info on building the Mozilla source, see
-
- http://www.mozilla.org/source.html
-
-
-Windows Installation Instructions
----------------------------------
-
-Note: For Windows NT/2000/XP systems, you need Administrator
-privileges to install Mozilla. If you see an "Error 5" message
-during installation, make sure you're running the installation
-with Administrator privileges.
-
-
- To install Mozilla by downloading the Mozilla installer,
- follow these steps:
-
- 1. Click the the mozilla-win32-installer.exe link on
- the site you're downloading Mozilla from to download
- the installer file to your machine.
-
- 2. Navigate to where you downloaded the file and
- double-click the Mozilla program icon on your machine
- to begin the Setup program.
-
- 3. Follow the on-screen instructions in the setup
- program. The program starts automatically the first
- time.
+ http://developer.mozilla.org/en/docs/Creating_a_patch
+ http://developer.mozilla.org/en/docs/Getting_your_patch_in_the_tree
-
- To install Mozilla by downloading the .zip file and
- installing manually, follow these steps:
-
- 1. Click the mozilla-win32-talkback.zip link or the
- mozilla-win32.zip link on the site you're down-
- loading Mozilla from to download the .zip file to
- your machine.
-
- 2. Navigate to where you downloaded the file and
- double-click the compressed file.
-
- Note: This step assumes you already have a recent
- version of WinZip installed, and that you know how to
- use it. If not, you can get WinZip and information
- about the program at www.winzip.com.
-
- 3. Extract the .zip file to a directory such as
- C:\Program Files\mozilla.org\Mozilla.
-
- 4. To start Mozilla, navigate to the directory you
- extracted Mozilla to and double-click the Mozilla.exe
- icon.
-
-
-Mac OS X Installation Instructions
-----------------------------------
-
- To install Mozilla by downloading the Mozilla disk image,
- follow these steps:
-
- 1. Click the mozilla-mac-MachO.dmg.gz link to download
- it to your machine. By default, the download file is
- downloaded to your desktop.
-
- 2. Once you have downloaded the .dmg.gz file, drag it
- onto Stuffit Expander to decompress it. If the disk
- image doesn't mount automatically, double-click on the
- .dmg file to mount it. If that fails, and the file
- does not look like a disk image file, do a "Show Info"
- on the file, and, in the "Open with application"
- category, choose Disk Copy. In Mac OS 10.2, you can
- use "Open with" from the context menu.
-
- 3. Once the disk image mounts, open it, and drag the
- Mozilla icon onto your hard disk.
-
- 4. We recommend that you copy it to the Applications
- folder.
-
- 5. Now Eject the disk image.
-
- 6. If you like, you can drag Mozilla to your dock to
- have it easily accessible at all times. You might also
- wish to select Mozilla as your default browser in the
- Internet system preferences pane (under the Web tab).
-
-
-Linux Installation Instructions
--------------------------------
-
-Note: If you install in the default directory (which is
-usually /usr/local/mozilla), or any other directory where
-only the root user normally has write-access, you must
-start Mozilla first as root before other users can start
-the program. Doing so generates a set of files required
-for later use by other users.
-
-
- To install Mozilla by downloading the Mozilla installer,
- follow these steps:
-
- 1. Create a directory named mozilla (mkdir mozilla)
- and change to that directory (cd mozilla).
+If you have a question about developing Mozilla, and can't find the solution
+on http://developer.mozilla.org, you can try asking your question in a
+mozilla.* Usenet group, or on IRC at irc.mozilla.org. [The Mozilla news groups
+are accessible on Google Groups, or news.mozilla.org with a NNTP reader.]
- 2. Click the link on the site you're downloading
- Mozilla from to download the installer file
- (called mozilla-1686-pc-linux-gnu-installer.tar.gz)
- to your machine.
-
- 3. Change to the mozilla directory (cd mozilla) and
- decompress the archive with the following command:
-
- tar zxvf moz*.tar.gz
-
- The installer is now located in a subdirectory of
- Mozilla named mozilla-installer.
-
- 4. Change to the mozilla-installer directory
- (cd mozilla-installer) and run the installer with the
- ./mozilla-installer command.
-
- 5. Follow the instructions in the install wizard for
- installing Mozilla.
-
- Note: If you have a slower machine, be aware that the
- installation may take some time. In this case, the
- installation progress may appear to hang indefinitely,
- even though the installation is still in process.
-
- 6. To start Mozilla, change to the directory where you
- installed it and run the ./mozilla command.
-
-
- To install Mozilla by downloading the tar.gz file:
-
- 1. Create a directory named "mozilla" (mkdir mozilla)
- and change to that directory (cd mozilla).
-
- 2. Click the link on the site you're downloading
- Mozilla from to download the non-installer
- (mozilla*.tar.gz) file into the mozilla directory.
+You can download nightly development builds from the the Mozilla FTP server.
+Keep in mind that nightly builds, which are used by Mozilla developers for
+testing, may be buggy. Firefox nightlies, for example, can be found at:
- 3. Change to the mozilla directory (cd mozilla) and
- decompress the file with the following command:
-
- tar zxvf moz*.tar.gz
-
- This creates a "mozilla" directory under your mozilla
- directory.
-
- 4. Change to the mozilla directory (cd mozilla).
-
- 5. Run Mozilla with the following run script:
-
- ./mozilla
-
-
- To hook up Mozilla complete with icon to the GNOME Panel,
- follow these steps:
-
- 1. Click the GNOME Main Menu button, open the Panel menu,
- and then open the Add to Panel submenu and choose Launcher.
-
- 2. Right-click the icon for Mozilla on the Panel and
- enter the following command:
- directory_name./mozilla
-
- where directory_name is the name of the directory
- you downloaded mozilla to. For example, the default
- directory that Mozilla suggests is /usr/local/mozilla.
-
- 3. Type in a name for the icon, and type in a comment
- if you wish.
-
- 4. Click the icon button and type in the following as
- the icon's location:
-
- directory_name/icons/mozicon50.xpm
-
- where directory name is the directory where you
- installed Mozilla. For example, the default directory
- is /usr/local/mozilla/icons/mozicon50.xpm.
+ ftp://ftp.mozilla.org/pub/firefox/nightly/latest-trunk/
--- a/accessible/public/nsIAccessibleEvent.idl
+++ b/accessible/public/nsIAccessibleEvent.idl
@@ -564,8 +564,22 @@ interface nsIAccessibleTextChangeEvent :
interface nsIAccessibleCaretMoveEvent: nsIAccessibleEvent
{
/**
* Return caret offset.
*/
readonly attribute long caretOffset;
};
+[scriptable, uuid(a9485c7b-5861-4695-8441-fab0235b205d)]
+interface nsIAccessibleTableChangeEvent: nsIAccessibleEvent
+{
+ /**
+ * Return the row or column index.
+ */
+ readonly attribute long rowOrColIndex;
+
+ /**
+ * Return the number of rows or cols
+ */
+ readonly attribute long numRowsOrCols;
+};
+
--- a/accessible/public/nsIAccessibleProvider.idl
+++ b/accessible/public/nsIAccessibleProvider.idl
@@ -47,16 +47,22 @@
[scriptable, uuid(3f7f9194-c625-4a85-8148-6d92d34897fa)]
interface nsIAccessibleProvider : nsISupports
{
/**
* Constants set of common use.
*/
+ /** Do not create an accessible for this object
+ * This is useful if an ancestor binding already implements nsIAccessibleProvider,
+ * but no accessible is desired for the inheriting binding
+ */
+ const long NoAccessible = 0;
+
/** For elements that spawn a new document. For example now it is used by
<xul:iframe>, <xul:browser> and <xul:editor>. */
const long OuterDoc = 0x00000001;
/**
* Constants set is used by XUL controls.
*/
@@ -73,42 +79,43 @@ interface nsIAccessibleProvider : nsISup
const long XULListbox = 0x0000100B;
const long XULListitem = 0x0000100C;
const long XULListHead = 0x00001024;
const long XULListHeader = 0x00001025;
const long XULMenubar = 0x0000100D;
const long XULMenuitem = 0x0000100E;
const long XULMenupopup = 0x0000100F;
const long XULMenuSeparator = 0x00001010;
- const long XULProgressMeter = 0x00001011;
- const long XULScale = 0x00001012;
- const long XULStatusBar = 0x00001013;
- const long XULRadioButton = 0x00001014;
- const long XULRadioGroup = 0x00001015;
+ const long XULPane = 0x00001011;
+ const long XULProgressMeter = 0x00001012;
+ const long XULScale = 0x00001013;
+ const long XULStatusBar = 0x00001014;
+ const long XULRadioButton = 0x00001015;
+ const long XULRadioGroup = 0x00001016;
/** The single tab in a dialog or tabbrowser/editor interface */
- const long XULTab = 0x00001016;
+ const long XULTab = 0x00001017;
/** A combination of a tabs object and a tabpanels object */
- const long XULTabBox = 0x00001017;
+ const long XULTabBox = 0x00001018;
/** The collection of tab objects, useable in the TabBox and independant of
as well */
- const long XULTabs = 0x00001018;
+ const long XULTabs = 0x00001019;
- const long XULText = 0x00001019;
- const long XULTextBox = 0x0000101A;
- const long XULThumb = 0x0000101B;
- const long XULTree = 0x0000101C;
- const long XULTreeColumns = 0x0000101D;
- const long XULTreeColumnItem = 0x0000101E;
- const long XULToolbar = 0x0000101F;
- const long XULToolbarSeparator = 0x00001020;
- const long XULTooltip = 0x00001021;
- const long XULToolbarButton = 0x00001022;
+ const long XULText = 0x0000101A;
+ const long XULTextBox = 0x0000101B;
+ const long XULThumb = 0x0000101C;
+ const long XULTree = 0x0000101D;
+ const long XULTreeColumns = 0x0000101E;
+ const long XULTreeColumnItem = 0x0000101F;
+ const long XULToolbar = 0x00001020;
+ const long XULToolbarSeparator = 0x00001021;
+ const long XULTooltip = 0x00001022;
+ const long XULToolbarButton = 0x00001023;
/**
* Constants set is used by XForms elements.
*/
/** Used for xforms elements that provide accessible object for itself as
* well for anonymous content. This property are used for upload,
--- a/accessible/public/nsIAccessibleRole.idl
+++ b/accessible/public/nsIAccessibleRole.idl
@@ -105,19 +105,19 @@ interface nsIAccessibleRole : nsISupport
/**
* Represents the window frame, which contains child objects such as
* a title bar, client, and other objects contained in a window. The role
* is supported automatically by MS Windows.
*/
const unsigned long ROLE_WINDOW = 9;
/**
- * XXX: document this.
+ * A sub-document (<frame> or <iframe>)
*/
- const unsigned long ROLE_CLIENT = 10;
+ const unsigned long ROLE_INTERNAL_FRAME = 10;
/**
* Represents a menu, which presents a list of options from which the user can
* make a selection to perform an action. It is used for role="menu".
*/
const unsigned long ROLE_MENUPOPUP = 11;
/**
--- a/accessible/public/nsPIAccessible.idl
+++ b/accessible/public/nsPIAccessible.idl
@@ -40,17 +40,17 @@
interface nsIAccessible;
interface nsIAccessibleEvent;
%{C++
struct nsRoleMapEntry;
%}
[ptr] native nsRoleMapEntryPtr(nsRoleMapEntry);
-[uuid(2d552ed0-3f38-4c7f-94c1-419de4d693ed)]
+[uuid(893ee16d-c157-4d5f-b236-60b3b2bef6a5)]
interface nsPIAccessible : nsISupports
{
/**
* Set accessible parent.
*/
void setParent(in nsIAccessible aAccParent);
/**
@@ -78,22 +78,20 @@ interface nsPIAccessible : nsISupports
*/
void invalidateChildren();
/**
* Fire accessible event.
*
* @param aEvent - DOM event
* @param aTarget - target of DOM event
- * @param aData - additional information for accessible event.
*
* XXX: eventually this method will be removed (see bug 377022)
*/
- void fireToolkitEvent(in unsigned long aEvent, in nsIAccessible aTarget,
- in voidPtr aData);
+ void fireToolkitEvent(in unsigned long aEvent, in nsIAccessible aTarget);
/**
* Fire accessible event.
*/
void fireAccessibleEvent(in nsIAccessibleEvent aAccEvent);
/**
* Return true if there are accessible children in anonymous content
--- a/accessible/src/atk/nsAccessibleWrap.cpp
+++ b/accessible/src/atk/nsAccessibleWrap.cpp
@@ -297,16 +297,17 @@ nsAccessibleWrap::nsAccessibleWrap(nsIDO
#endif
MAI_LOG_DEBUG(("==nsAccessibleWrap creating: this=%p,total=%d left=%d\n",
(void*)this, mAccWrapCreated,
(mAccWrapCreated-mAccWrapDeleted)));
}
nsAccessibleWrap::~nsAccessibleWrap()
{
+ NS_ASSERTION(!mAtkObject, "ShutdownAtkObject() is not called");
#ifdef MAI_LOGGING
++mAccWrapDeleted;
#endif
MAI_LOG_DEBUG(("==nsAccessibleWrap deleting: this=%p,total=%d left=%d\n",
(void*)this, mAccWrapDeleted,
(mAccWrapCreated-mAccWrapDeleted)));
}
@@ -1109,19 +1110,16 @@ nsAccessibleWrap::FireAccessibleEvent(ns
nsCOMPtr<nsIAccessible> accessible;
aEvent->GetAccessible(getter_AddRefs(accessible));
NS_ENSURE_TRUE(accessible, NS_ERROR_FAILURE);
PRUint32 type = 0;
rv = aEvent->GetEventType(&type);
NS_ENSURE_SUCCESS(rv, rv);
- nsAccEvent *event = reinterpret_cast<nsAccEvent*>(aEvent);
- void *eventData = event->mEventData;
-
AtkObject *atkObj = nsAccessibleWrap::GetAtkObject(accessible);
// We don't create ATK objects for nsIAccessible plain text leaves,
// just return NS_OK in such case
if (!atkObj) {
NS_ASSERTION(type == nsIAccessibleEvent::EVENT_ASYNCH_SHOW ||
type == nsIAccessibleEvent::EVENT_ASYNCH_HIDE ||
type == nsIAccessibleEvent::EVENT_DOM_CREATE ||
@@ -1130,29 +1128,24 @@ nsAccessibleWrap::FireAccessibleEvent(ns
return NS_OK;
}
nsAccessibleWrap *accWrap = GetAccessibleWrap(atkObj);
if (!accWrap) {
return NS_OK; // Node is shut down
}
- AtkTableChange * pAtkTableChange = nsnull;
-
switch (type) {
case nsIAccessibleEvent::EVENT_STATE_CHANGE:
return FireAtkStateChangeEvent(aEvent, atkObj);
case nsIAccessibleEvent::EVENT_TEXT_REMOVED:
case nsIAccessibleEvent::EVENT_TEXT_INSERTED:
return FireAtkTextChangedEvent(aEvent, atkObj);
- case nsIAccessibleEvent::EVENT_PROPERTY_CHANGED:
- return FireAtkPropChangedEvent(aEvent, atkObj);
-
case nsIAccessibleEvent::EVENT_FOCUS:
{
MAI_LOG_DEBUG(("\n\nReceived: EVENT_FOCUS\n"));
nsRefPtr<nsRootAccessible> rootAccWrap = accWrap->GetRootAccessible();
if (rootAccWrap && rootAccWrap->mActivated) {
atk_focus_tracker_notify(atkObj);
// Fire state change event for focus
nsCOMPtr<nsIAccessibleStateChangeEvent> stateChangeEvent =
@@ -1204,83 +1197,93 @@ nsAccessibleWrap::FireAccessibleEvent(ns
} break;
case nsIAccessibleEvent::EVENT_TABLE_MODEL_CHANGED:
MAI_LOG_DEBUG(("\n\nReceived: EVENT_TABLE_MODEL_CHANGED\n"));
g_signal_emit_by_name(atkObj, "model_changed");
break;
case nsIAccessibleEvent::EVENT_TABLE_ROW_INSERT:
+ {
MAI_LOG_DEBUG(("\n\nReceived: EVENT_TABLE_ROW_INSERT\n"));
- NS_ASSERTION(eventData, "Event needs event data");
- if (!eventData)
- break;
+ nsCOMPtr<nsIAccessibleTableChangeEvent> tableEvent = do_QueryInterface(aEvent);
+ NS_ENSURE_TRUE(tableEvent, NS_ERROR_FAILURE);
- pAtkTableChange = reinterpret_cast<AtkTableChange *>(eventData);
+ PRInt32 rowIndex, numRows;
+ tableEvent->GetRowOrColIndex(&rowIndex);
+ tableEvent->GetNumRowsOrCols(&numRows);
g_signal_emit_by_name(atkObj,
"row_inserted",
// After which the rows are inserted
- pAtkTableChange->index,
+ rowIndex,
// The number of the inserted
- pAtkTableChange->count);
- break;
+ numRows);
+ } break;
case nsIAccessibleEvent::EVENT_TABLE_ROW_DELETE:
+ {
MAI_LOG_DEBUG(("\n\nReceived: EVENT_TABLE_ROW_DELETE\n"));
- NS_ASSERTION(eventData, "Event needs event data");
- if (!eventData)
- break;
+ nsCOMPtr<nsIAccessibleTableChangeEvent> tableEvent = do_QueryInterface(aEvent);
+ NS_ENSURE_TRUE(tableEvent, NS_ERROR_FAILURE);
- pAtkTableChange = reinterpret_cast<AtkTableChange *>(eventData);
+ PRInt32 rowIndex, numRows;
+ tableEvent->GetRowOrColIndex(&rowIndex);
+ tableEvent->GetNumRowsOrCols(&numRows);
g_signal_emit_by_name(atkObj,
"row_deleted",
// After which the rows are deleted
- pAtkTableChange->index,
+ rowIndex,
// The number of the deleted
- pAtkTableChange->count);
- break;
+ numRows);
+ } break;
case nsIAccessibleEvent::EVENT_TABLE_ROW_REORDER:
+ {
MAI_LOG_DEBUG(("\n\nReceived: EVENT_TABLE_ROW_REORDER\n"));
g_signal_emit_by_name(atkObj, "row_reordered");
break;
+ }
case nsIAccessibleEvent::EVENT_TABLE_COLUMN_INSERT:
+ {
MAI_LOG_DEBUG(("\n\nReceived: EVENT_TABLE_COLUMN_INSERT\n"));
- NS_ASSERTION(eventData, "Event needs event data");
- if (!eventData)
- break;
+ nsCOMPtr<nsIAccessibleTableChangeEvent> tableEvent = do_QueryInterface(aEvent);
+ NS_ENSURE_TRUE(tableEvent, NS_ERROR_FAILURE);
- pAtkTableChange = reinterpret_cast<AtkTableChange *>(eventData);
+ PRInt32 colIndex, numCols;
+ tableEvent->GetRowOrColIndex(&colIndex);
+ tableEvent->GetNumRowsOrCols(&numCols);
g_signal_emit_by_name(atkObj,
"column_inserted",
// After which the columns are inserted
- pAtkTableChange->index,
+ colIndex,
// The number of the inserted
- pAtkTableChange->count);
- break;
+ numCols);
+ } break;
case nsIAccessibleEvent::EVENT_TABLE_COLUMN_DELETE:
+ {
MAI_LOG_DEBUG(("\n\nReceived: EVENT_TABLE_COLUMN_DELETE\n"));
- NS_ASSERTION(eventData, "Event needs event data");
- if (!eventData)
- break;
+ nsCOMPtr<nsIAccessibleTableChangeEvent> tableEvent = do_QueryInterface(aEvent);
+ NS_ENSURE_TRUE(tableEvent, NS_ERROR_FAILURE);
- pAtkTableChange = reinterpret_cast<AtkTableChange *>(eventData);
+ PRInt32 colIndex, numCols;
+ tableEvent->GetRowOrColIndex(&colIndex);
+ tableEvent->GetNumRowsOrCols(&numCols);
g_signal_emit_by_name(atkObj,
"column_deleted",
// After which the columns are deleted
- pAtkTableChange->index,
+ colIndex,
// The number of the deleted
- pAtkTableChange->count);
- break;
+ numCols);
+ } break;
case nsIAccessibleEvent::EVENT_TABLE_COLUMN_REORDER:
MAI_LOG_DEBUG(("\n\nReceived: EVENT_TABLE_COLUMN_REORDER\n"));
g_signal_emit_by_name(atkObj, "column_reordered");
break;
case nsIAccessibleEvent::EVENT_SECTION_CHANGED:
MAI_LOG_DEBUG(("\n\nReceived: EVENT_SECTION_CHANGED\n"));
@@ -1432,86 +1435,16 @@ nsAccessibleWrap::FireAtkTextChangedEven
isFromUserInput ? "" : kNonUserInputEvent, NULL);
g_signal_emit_by_name(aObject, signal_name, start, length);
g_free (signal_name);
return NS_OK;
}
nsresult
-nsAccessibleWrap::FireAtkPropChangedEvent(nsIAccessibleEvent *aEvent,
- AtkObject *aObject)
-{
- MAI_LOG_DEBUG(("\n\nReceived: EVENT_PROPERTY_CHANGED\n"));
-
- AtkPropertyChange *pAtkPropChange;
- AtkPropertyValues values = { NULL };
- nsAccessibleWrap *oldAccWrap = nsnull, *newAccWrap = nsnull;
-
- nsAccEvent *event = reinterpret_cast<nsAccEvent*>(aEvent);
-
- pAtkPropChange = reinterpret_cast<AtkPropertyChange *>(event->mEventData);
- values.property_name = sAtkPropertyNameArray[pAtkPropChange->type];
-
- NS_ASSERTION(pAtkPropChange, "Event needs event data");
- if (!pAtkPropChange)
- return NS_OK;
-
- MAI_LOG_DEBUG(("\n\nthe type of EVENT_PROPERTY_CHANGED: %d\n\n",
- pAtkPropChange->type));
-
- switch (pAtkPropChange->type) {
- case PROP_TABLE_CAPTION:
- case PROP_TABLE_SUMMARY:
-
- if (pAtkPropChange->oldvalue)
- oldAccWrap = reinterpret_cast<nsAccessibleWrap *>
- (pAtkPropChange->oldvalue);
-
- if (pAtkPropChange->newvalue)
- newAccWrap = reinterpret_cast<nsAccessibleWrap *>
- (pAtkPropChange->newvalue);
-
- if (oldAccWrap && newAccWrap) {
- g_value_init(&values.old_value, G_TYPE_POINTER);
- g_value_set_pointer(&values.old_value,
- oldAccWrap->GetAtkObject());
- g_value_init(&values.new_value, G_TYPE_POINTER);
- g_value_set_pointer(&values.new_value,
- newAccWrap->GetAtkObject());
- }
- break;
-
- case PROP_TABLE_COLUMN_DESCRIPTION:
- case PROP_TABLE_COLUMN_HEADER:
- case PROP_TABLE_ROW_HEADER:
- case PROP_TABLE_ROW_DESCRIPTION:
- g_value_init(&values.new_value, G_TYPE_INT);
- g_value_set_int(&values.new_value,
- *reinterpret_cast<gint *>
- (pAtkPropChange->newvalue));
- break;
-
- //Perhaps need more cases in the future
- default:
- g_value_init (&values.old_value, G_TYPE_POINTER);
- g_value_set_pointer (&values.old_value, pAtkPropChange->oldvalue);
- g_value_init (&values.new_value, G_TYPE_POINTER);
- g_value_set_pointer (&values.new_value, pAtkPropChange->newvalue);
- }
-
- char *signal_name = g_strconcat("property_change::",
- values.property_name, NULL);
- g_signal_emit_by_name(aObject, signal_name, &values, NULL);
- g_free (signal_name);
-
- return NS_OK;
-}
-
-nsresult
nsAccessibleWrap::FireAtkShowHideEvent(nsIAccessibleEvent *aEvent,
AtkObject *aObject, PRBool aIsAdded)
{
if (aIsAdded)
MAI_LOG_DEBUG(("\n\nReceived: Show event\n"));
else
MAI_LOG_DEBUG(("\n\nReceived: Hide event\n"));
--- a/accessible/src/atk/nsRoleMap.h
+++ b/accessible/src/atk/nsRoleMap.h
@@ -51,17 +51,17 @@ static const PRUint32 atkRoleMap[] = {
ATK_ROLE_MENU_BAR, // nsIAccessibleRole::ROLE_MENUBAR 2
ATK_ROLE_SCROLL_BAR, // nsIAccessibleRole::ROLE_SCROLLBAR 3
ATK_ROLE_UNKNOWN, // nsIAccessibleRole::ROLE_GRIP 4
ATK_ROLE_UNKNOWN, // nsIAccessibleRole::ROLE_SOUND 5
ATK_ROLE_UNKNOWN, // nsIAccessibleRole::ROLE_CURSOR 6
ATK_ROLE_UNKNOWN, // nsIAccessibleRole::ROLE_CARET 7
ATK_ROLE_ALERT, // nsIAccessibleRole::ROLE_ALERT 8
ATK_ROLE_WINDOW, // nsIAccessibleRole::ROLE_WINDOW 9
- ATK_ROLE_PANEL, // nsIAccessibleRole::ROLE_CLIENT 10
+ ATK_ROLE_INTERNAL_FRAME, // nsIAccessibleRole::ROLE_INTERNAL_FRAME 10
ATK_ROLE_MENU, // nsIAccessibleRole::ROLE_MENUPOPUP 11
ATK_ROLE_MENU_ITEM, // nsIAccessibleRole::ROLE_MENUITEM 12
ATK_ROLE_TOOL_TIP, // nsIAccessibleRole::ROLE_TOOLTIP 13
ATK_ROLE_EMBEDDED, // nsIAccessibleRole::ROLE_APPLICATION 14
ATK_ROLE_DOCUMENT_FRAME, // nsIAccessibleRole::ROLE_DOCUMENT 15
ATK_ROLE_PANEL, // nsIAccessibleRole::ROLE_PANE 16
ATK_ROLE_CHART, // nsIAccessibleRole::ROLE_CHART 17
ATK_ROLE_DIALOG, // nsIAccessibleRole::ROLE_DIALOG 18
--- a/accessible/src/atk/nsRootAccessibleWrap.cpp
+++ b/accessible/src/atk/nsRootAccessibleWrap.cpp
@@ -41,10 +41,16 @@
#include "nsMai.h"
#include "nsRootAccessibleWrap.h"
nsNativeRootAccessibleWrap::nsNativeRootAccessibleWrap(AtkObject *aAccessible):
nsRootAccessible(nsnull, nsnull)
{
g_object_ref(aAccessible);
- nsAccessibleWrap::mAtkObject = aAccessible;
+ mAtkObject = aAccessible;
}
+
+nsNativeRootAccessibleWrap::~nsNativeRootAccessibleWrap()
+{
+ g_object_unref(mAtkObject);
+ mAtkObject = nsnull;
+}
--- a/accessible/src/atk/nsRootAccessibleWrap.h
+++ b/accessible/src/atk/nsRootAccessibleWrap.h
@@ -50,11 +50,12 @@ typedef nsRootAccessible nsRootAccessibl
* The instance of nsNativeRootAccessibleWrap is a child of MaiAppRoot instance.
* It is added into root when the toplevel window is created, and removed
* from root when the toplevel window is destroyed.
*/
class nsNativeRootAccessibleWrap: public nsRootAccessible
{
public:
nsNativeRootAccessibleWrap(AtkObject *aAccessible);
+ ~nsNativeRootAccessibleWrap();
};
#endif /* __NS_ROOT_ACCESSIBLE_WRAP_H__ */
--- a/accessible/src/base/nsAccessibilityAtomList.h
+++ b/accessible/src/base/nsAccessibilityAtomList.h
@@ -77,16 +77,18 @@ ACCESSIBILITY_ATOM(deckFrame, "DeckFrame
ACCESSIBILITY_ATOM(inlineBlockFrame, "InlineBlockFrame")
ACCESSIBILITY_ATOM(inlineFrame, "InlineFrame")
ACCESSIBILITY_ATOM(objectFrame, "ObjectFrame")
ACCESSIBILITY_ATOM(scrollFrame, "ScrollFrame")
ACCESSIBILITY_ATOM(textFrame, "TextFrame")
ACCESSIBILITY_ATOM(tableCaptionFrame, "TableCaptionFrame")
ACCESSIBILITY_ATOM(tableCellFrame, "TableCellFrame")
ACCESSIBILITY_ATOM(tableOuterFrame, "TableOuterFrame")
+ACCESSIBILITY_ATOM(tableRowGroupFrame, "TableRowGroupFrame")
+ACCESSIBILITY_ATOM(tableRowFrame, "TableRowFrame")
// Alphabetical list of tag names
ACCESSIBILITY_ATOM(a, "a")
ACCESSIBILITY_ATOM(abbr, "abbr")
ACCESSIBILITY_ATOM(acronym, "acronym")
ACCESSIBILITY_ATOM(area, "area")
ACCESSIBILITY_ATOM(autocomplete, "autocomplete")
ACCESSIBILITY_ATOM(blockquote, "blockquote")
--- a/accessible/src/base/nsAccessibilityService.cpp
+++ b/accessible/src/base/nsAccessibilityService.cpp
@@ -1191,16 +1191,44 @@ nsresult nsAccessibilityService::InitAcc
nsCOMPtr<nsPIAccessible> privateAccessible =
do_QueryInterface(privateAccessNode);
privateAccessible->SetRoleMapEntry(aRoleMapEntry);
NS_ADDREF(*aAccessibleOut = aAccessibleIn);
}
return rv;
}
+static PRBool HasRelatedContent(nsIContent *aContent)
+{
+ nsAutoString id;
+ if (!aContent || !nsAccUtils::GetID(aContent, id) || id.IsEmpty()) {
+ return PR_FALSE;
+ }
+
+ nsIAtom *relationAttrs[] = {nsAccessibilityAtoms::aria_labelledby,
+ nsAccessibilityAtoms::aria_describedby,
+ nsAccessibilityAtoms::aria_owns,
+ nsAccessibilityAtoms::aria_controls,
+ nsAccessibilityAtoms::aria_flowto};
+ if (nsAccUtils::FindNeighbourPointingToNode(aContent, relationAttrs, NS_ARRAY_LENGTH(relationAttrs))) {
+ return PR_TRUE;
+ }
+
+ nsIContent *ancestorContent = aContent;
+ nsAutoString activeID;
+ while ((ancestorContent = ancestorContent->GetParent()) != nsnull) {
+ if (ancestorContent->GetAttr(kNameSpaceID_None, nsAccessibilityAtoms::aria_activedescendant, activeID)) {
+ // ancestor has activedescendant property, this content could be active
+ return PR_TRUE;
+ }
+ }
+
+ return PR_FALSE;
+}
+
NS_IMETHODIMP nsAccessibilityService::GetAccessible(nsIDOMNode *aNode,
nsIPresShell *aPresShell,
nsIWeakReference *aWeakShell,
nsIFrame **aFrameHint,
PRBool *aIsHidden,
nsIAccessible **aAccessible)
{
NS_ENSURE_ARG_POINTER(aAccessible);
@@ -1390,51 +1418,46 @@ NS_IMETHODIMP nsAccessibilityService::Ge
nsIAccessibleRole::ROLE_EQUATION);
}
} else if (!newAcc) { // HTML accessibles
PRBool tryTagNameOrFrame = PR_TRUE;
if (!content->IsFocusable()) {
// If we're in unfocusable table-related subcontent, check for the
// Presentation role on the containing table
- nsIAtom *tag = content->Tag();
- if (tag == nsAccessibilityAtoms::td ||
- tag == nsAccessibilityAtoms::th ||
- tag == nsAccessibilityAtoms::tr ||
- tag == nsAccessibilityAtoms::tbody ||
- tag == nsAccessibilityAtoms::tfoot ||
- tag == nsAccessibilityAtoms::thead) {
+ if (frame->GetType() == nsAccessibilityAtoms::tableCaptionFrame ||
+ frame->GetType() == nsAccessibilityAtoms::tableCellFrame ||
+ frame->GetType() == nsAccessibilityAtoms::tableRowGroupFrame ||
+ frame->GetType() == nsAccessibilityAtoms::tableRowFrame) {
+
nsIContent *tableContent = content;
- nsAutoString tableRole;
while ((tableContent = tableContent->GetParent()) != nsnull) {
- if (tableContent->Tag() == nsAccessibilityAtoms::table) {
- // Table that we're a descendant of is not styled as a table,
- // and has no table accessible for an ancestor, or
- // table that we're a descendant of is presentational
+ nsIFrame *tableFrame = aPresShell->GetPrimaryFrameFor(tableContent);
+ if (tableFrame &&
+ tableFrame->GetType() == nsAccessibilityAtoms::tableOuterFrame) {
nsCOMPtr<nsIDOMNode> tableNode(do_QueryInterface(tableContent));
if (tableNode) {
nsRoleMapEntry *tableRoleMapEntry =
nsAccUtils::GetRoleMapEntry(tableNode);
if (tableRoleMapEntry &&
- tableRoleMapEntry != &nsARIAMap::gLandmarkRoleMap) {
+ tableRoleMapEntry != &nsARIAMap::gLandmarkRoleMap)
tryTagNameOrFrame = PR_FALSE;
- break;
- }
- }
-
- nsIFrame *tableFrame =
- aPresShell->GetPrimaryFrameFor(tableContent);
- if (!tableFrame ||
- tableFrame->GetType() != nsAccessibilityAtoms::tableOuterFrame) {
- tryTagNameOrFrame = PR_FALSE;
}
break;
}
+
+ if (tableContent->Tag() == nsAccessibilityAtoms::table) {
+ tryTagNameOrFrame = PR_FALSE;
+ break;
+ }
}
+
+ if (!tableContent)
+ tryTagNameOrFrame = PR_FALSE;
}
}
if (tryTagNameOrFrame) {
// Prefer to use markup (mostly tag name, perhaps attributes) to
// decide if and what kind of accessible to create.
// The method creates accessibles for table related content too therefore
// we do not call it if accessibles for table related content are
@@ -1468,17 +1491,18 @@ NS_IMETHODIMP nsAccessibilityService::Ge
// If no accessible, see if we need to create a generic accessible because
// of some property that makes this object interesting
// We don't do this for <body>, <html>, <window>, <dialog> etc. which
// correspond to the doc accessible and will be created in any case
if (!newAcc && content->Tag() != nsAccessibilityAtoms::body && content->GetParent() &&
(content->IsFocusable() ||
(isHTML && nsAccUtils::HasListener(content, NS_LITERAL_STRING("click"))) ||
- HasUniversalAriaProperty(content, aWeakShell) || roleMapEntry)) {
+ HasUniversalAriaProperty(content, aWeakShell) || roleMapEntry) ||
+ HasRelatedContent(content)) {
// This content is focusable or has an interesting dynamic content accessibility property.
// If it's interesting we need it in the accessibility hierarchy so that events or
// other accessibles can point to it, or so that it can hold a state, etc.
if (isHTML) {
// Interesting HTML container which may have selectable text and/or embedded objects
CreateHyperTextAccessible(frame, getter_AddRefs(newAcc));
}
else { // XUL, SVG, MathML etc.
@@ -1601,16 +1625,18 @@ nsresult nsAccessibilityService::GetAcce
return CreateOuterDocAccessible(aNode, aAccessible);
nsCOMPtr<nsIWeakReference> weakShell;
GetShellFromNode(aNode, getter_AddRefs(weakShell));
switch (type)
{
#ifdef MOZ_XUL
+ case nsIAccessibleProvider::NoAccessible:
+ return NS_OK;
// XUL controls
case nsIAccessibleProvider::XULAlert:
*aAccessible = new nsXULAlertAccessible(aNode, weakShell);
break;
case nsIAccessibleProvider::XULButton:
*aAccessible = new nsXULButtonAccessible(aNode, weakShell);
break;
case nsIAccessibleProvider::XULCheckbox:
@@ -1685,16 +1711,19 @@ nsresult nsAccessibilityService::GetAcce
}
#endif
*aAccessible = new nsXULMenupopupAccessible(aNode, weakShell);
break;
}
case nsIAccessibleProvider::XULMenuSeparator:
*aAccessible = new nsXULMenuSeparatorAccessible(aNode, weakShell);
break;
+ case nsIAccessibleProvider::XULPane:
+ *aAccessible = new nsEnumRoleAccessible(aNode, weakShell, nsIAccessibleRole::ROLE_PANE);
+ break;
case nsIAccessibleProvider::XULProgressMeter:
*aAccessible = new nsXULProgressMeterAccessible(aNode, weakShell);
break;
case nsIAccessibleProvider::XULStatusBar:
*aAccessible = new nsXULStatusBarAccessible(aNode, weakShell);
break;
case nsIAccessibleProvider::XULScale:
*aAccessible = new nsXULSliderAccessible(aNode, weakShell);
--- a/accessible/src/base/nsAccessibilityService.h
+++ b/accessible/src/base/nsAccessibilityService.h
@@ -147,17 +147,17 @@ static const char kRoleNames[][20] = {
"menubar", //ROLE_MENUBAR
"scrollbar", //ROLE_SCROLLBAR
"grip", //ROLE_GRIP
"sound", //ROLE_SOUND
"cursor", //ROLE_CURSOR
"caret", //ROLE_CARET
"alert", //ROLE_ALERT
"window", //ROLE_WINDOW
- "client", //ROLE_CLIENT
+ "internal frame", //ROLE_INTERNAL_FRAME
"menupopup", //ROLE_MENUPOPUP
"menuitem", //ROLE_MENUITEM
"tooltip", //ROLE_TOOLTIP
"application", //ROLE_APPLICATION
"document", //ROLE_DOCUMENT
"pane", //ROLE_PANE
"chart", //ROLE_CHART
"dialog", //ROLE_DIALOG
--- a/accessible/src/base/nsAccessibilityUtils.cpp
+++ b/accessible/src/base/nsAccessibilityUtils.cpp
@@ -252,17 +252,17 @@ nsAccUtils::FireAccEvent(PRUint32 aEvent
PRBool aIsAsynch)
{
NS_ENSURE_ARG(aAccessible);
nsCOMPtr<nsPIAccessible> pAccessible(do_QueryInterface(aAccessible));
NS_ASSERTION(pAccessible, "Accessible doesn't implement nsPIAccessible");
nsCOMPtr<nsIAccessibleEvent> event =
- new nsAccEvent(aEventType, aAccessible, nsnull, aIsAsynch);
+ new nsAccEvent(aEventType, aAccessible, aIsAsynch);
NS_ENSURE_TRUE(event, NS_ERROR_OUT_OF_MEMORY);
return pAccessible->FireAccessibleEvent(event);
}
PRBool
nsAccUtils::IsAncestorOf(nsIDOMNode *aPossibleAncestorNode,
nsIDOMNode *aPossibleDescendantNode)
@@ -582,16 +582,26 @@ nsAccUtils::GetID(nsIContent *aContent,
}
nsIContent*
nsAccUtils::FindNeighbourPointingToNode(nsIContent *aForNode,
nsIAtom *aRelationAttr,
nsIAtom *aTagName,
PRUint32 aAncestorLevelsToSearch)
{
+ return FindNeighbourPointingToNode(aForNode, &aRelationAttr, 1, aTagName, aAncestorLevelsToSearch);
+}
+
+nsIContent*
+nsAccUtils::FindNeighbourPointingToNode(nsIContent *aForNode,
+ nsIAtom **aRelationAttrs,
+ PRUint32 aAttrNum,
+ nsIAtom *aTagName,
+ PRUint32 aAncestorLevelsToSearch)
+{
nsCOMPtr<nsIContent> binding;
nsAutoString controlID;
if (!nsAccUtils::GetID(aForNode, controlID)) {
binding = aForNode->GetBindingParent();
if (binding == aForNode)
return nsnull;
aForNode->GetAttr(kNameSpaceID_None, nsAccessibilityAtoms::anonid, controlID);
@@ -633,68 +643,85 @@ nsAccUtils::FindNeighbourPointingToNode(
return nsnull;
nsCOMPtr<nsIContent> content = do_QueryInterface(node);
if (!content)
return nsnull;
if (content != prevSearched) {
labelContent = FindDescendantPointingToID(&controlID, content,
- aRelationAttr, nsnull, aTagName);
+ aRelationAttrs, aAttrNum,
+ nsnull, aTagName);
}
}
break;
}
labelContent = FindDescendantPointingToID(&controlID, aForNode,
- aRelationAttr, prevSearched, aTagName);
+ aRelationAttrs, aAttrNum,
+ prevSearched, aTagName);
prevSearched = aForNode;
}
return labelContent;
}
// Pass in aAriaProperty = null and aRelationAttr == nsnull if any <label> will do
nsIContent*
nsAccUtils::FindDescendantPointingToID(const nsString *aId,
nsIContent *aLookContent,
- nsIAtom *aRelationAttr,
+ nsIAtom **aRelationAttrs,
+ PRUint32 aAttrNum,
nsIContent *aExcludeContent,
nsIAtom *aTagType)
{
// Surround id with spaces for search
nsCAutoString idWithSpaces(' ');
LossyAppendUTF16toASCII(*aId, idWithSpaces);
idWithSpaces += ' ';
return FindDescendantPointingToIDImpl(idWithSpaces, aLookContent,
- aRelationAttr, aExcludeContent, aTagType);
+ aRelationAttrs, aAttrNum,
+ aExcludeContent, aTagType);
+}
+
+nsIContent*
+nsAccUtils::FindDescendantPointingToID(const nsString *aId,
+ nsIContent *aLookContent,
+ nsIAtom *aRelationAttr,
+ nsIContent *aExcludeContent,
+ nsIAtom *aTagType)
+{
+ return FindDescendantPointingToID(aId, aLookContent, &aRelationAttr, 1, aExcludeContent, aTagType);
}
nsIContent*
nsAccUtils::FindDescendantPointingToIDImpl(nsCString& aIdWithSpaces,
nsIContent *aLookContent,
- nsIAtom *aRelationAttr,
+ nsIAtom **aRelationAttrs,
+ PRUint32 aAttrNum,
nsIContent *aExcludeContent,
nsIAtom *aTagType)
{
NS_ENSURE_TRUE(aLookContent, nsnull);
- NS_ENSURE_TRUE(aRelationAttr, nsnull);
+ NS_ENSURE_TRUE(aRelationAttrs && *aRelationAttrs, nsnull);
if (!aTagType || aLookContent->Tag() == aTagType) {
// Tag matches
- // Check for ID in the attribute aRelationAttr, which can be a list
- nsAutoString idList;
- if (aLookContent->GetAttr(kNameSpaceID_None, aRelationAttr, idList)) {
- idList.Insert(' ', 0); // Surround idlist with spaces for search
- idList.Append(' ');
- // idList is now a set of id's with spaces around each,
- // and id also has spaces around it.
- // If id is a substring of idList then we have a match
- if (idList.Find(aIdWithSpaces) != -1) {
- return aLookContent;
+ // Check for ID in the attributes aRelationAttrs, which can be a list
+ for (PRUint32 i = 0; i < aAttrNum; i++) {
+ nsAutoString idList;
+ if (aLookContent->GetAttr(kNameSpaceID_None, aRelationAttrs[i], idList)) {
+ idList.Insert(' ', 0); // Surround idlist with spaces for search
+ idList.Append(' ');
+ // idList is now a set of id's with spaces around each,
+ // and id also has spaces around it.
+ // If id is a substring of idList then we have a match
+ if (idList.Find(aIdWithSpaces) != -1) {
+ return aLookContent;
+ }
}
}
if (aTagType) {
// Don't bother to search descendants of an element with matching tag.
// That would be like looking for a nested <label> or <description>
return nsnull;
}
}
@@ -702,17 +729,18 @@ nsAccUtils::FindDescendantPointingToIDIm
// Recursively search descendants for match
PRUint32 count = 0;
nsIContent *child;
nsIContent *labelContent = nsnull;
while ((child = aLookContent->GetChildAt(count++)) != nsnull) {
if (child != aExcludeContent) {
labelContent = FindDescendantPointingToIDImpl(aIdWithSpaces, child,
- aRelationAttr, aExcludeContent, aTagType);
+ aRelationAttrs, aAttrNum,
+ aExcludeContent, aTagType);
if (labelContent) {
return labelContent;
}
}
}
return nsnull;
}
--- a/accessible/src/base/nsAccessibilityUtils.h
+++ b/accessible/src/base/nsAccessibilityUtils.h
@@ -272,49 +272,75 @@ public:
*/
static nsRoleMapEntry* GetRoleMapEntry(nsIDOMNode *aNode);
/**
* Search element in neighborhood of the given element by tag name and
* attribute value that equals to ID attribute of the given element.
* ID attribute can be either 'id' attribute or 'anonid' if the element is
* anonymous.
+ * The first matched content will be returned.
*
* @param aForNode - the given element the search is performed for
- * @param aRelationAttr - attribute name of searched element, ignored if aAriaProperty passed in
+ * @param aRelationAttrs - an array of attributes, element is attribute name of searched element, ignored if aAriaProperty passed in
+ * @param aAttrNum - how many attributes in aRelationAttrs
* @param aTagName - tag name of searched element, or nsnull for any -- ignored if aAriaProperty passed in
* @param aAncestorLevelsToSearch - points how is the neighborhood of the
* given element big.
*/
static nsIContent *FindNeighbourPointingToNode(nsIContent *aForNode,
- nsIAtom *aRelationAttr,
+ nsIAtom **aRelationAttrs,
+ PRUint32 aAttrNum,
+ nsIAtom *aTagName = nsnull,
+ PRUint32 aAncestorLevelsToSearch = 5);
+
+ /**
+ * Overloaded version of FindNeighbourPointingToNode to accept only one
+ * relation attribute.
+ */
+ static nsIContent *FindNeighbourPointingToNode(nsIContent *aForNode,
+ nsIAtom *aRelationAttr,
nsIAtom *aTagName = nsnull,
PRUint32 aAncestorLevelsToSearch = 5);
/**
* Search for element that satisfies the requirements in subtree of the given
* element. The requirements are tag name, attribute name and value of
* attribute.
+ * The first matched content will be returned.
*
* @param aId - value of searched attribute
* @param aLookContent - element that search is performed inside
- * @param aRelationAttr - searched attribute
- * @param if both aAriaProperty and aRelationAttr are null, then any element with aTagType will do
+ * @param aRelationAttrs - an array of searched attributes
+ * @param aAttrNum - how many attributes in aRelationAttrs
+ * @param if both aAriaProperty and aRelationAttrs are null, then any element with aTagType will do
* @param aExcludeContent - element that is skiped for search
* @param aTagType - tag name of searched element, by default it is 'label' --
* ignored if aAriaProperty passed in
*/
static nsIContent *FindDescendantPointingToID(const nsString *aId,
nsIContent *aLookContent,
+ nsIAtom **aRelationAttrs,
+ PRUint32 aAttrNum = 1,
+ nsIContent *aExcludeContent = nsnull,
+ nsIAtom *aTagType = nsAccessibilityAtoms::label);
+
+ /**
+ * Overloaded version of FindDescendantPointingToID to accept only one
+ * relation attribute.
+ */
+ static nsIContent *FindDescendantPointingToID(const nsString *aId,
+ nsIContent *aLookContent,
nsIAtom *aRelationAttr,
nsIContent *aExcludeContent = nsnull,
nsIAtom *aTagType = nsAccessibilityAtoms::label);
// Helper for FindDescendantPointingToID(), same args
static nsIContent *FindDescendantPointingToIDImpl(nsCString& aIdWithSpaces,
nsIContent *aLookContent,
- nsIAtom *aRelationAttrs,
+ nsIAtom **aRelationAttrs,
+ PRUint32 aAttrNum = 1,
nsIContent *aExcludeContent = nsnull,
nsIAtom *aTagType = nsAccessibilityAtoms::label);
};
#endif
--- a/accessible/src/base/nsAccessible.cpp
+++ b/accessible/src/base/nsAccessible.cpp
@@ -824,17 +824,17 @@ NS_IMETHODIMP nsAccessible::TestChildCac
{
#ifndef DEBUG_A11Y
return NS_OK;
#else
// All cached accessible nodes should be in the parent
// It will assert if not all the children were created
// when they were first cached, and no invalidation
// ever corrected parent accessible's child cache.
- if (mAccChildCount == eChildCountUninitialized) {
+ if (mAccChildCount <= 0) {
return NS_OK;
}
nsCOMPtr<nsIAccessible> sibling = mFirstChild;
while (sibling != aCachedChild) {
NS_ASSERTION(sibling, "[TestChildCache] Never ran into the same child that we started from");
if (!sibling)
return NS_ERROR_FAILURE;
@@ -1904,25 +1904,24 @@ PRBool nsAccessible::IsNodeRelevant(nsID
do_GetService("@mozilla.org/accessibilityService;1");
NS_ENSURE_TRUE(accService, PR_FALSE);
nsCOMPtr<nsIDOMNode> relevantNode;
accService->GetRelevantContentNodeFor(aNode, getter_AddRefs(relevantNode));
return aNode == relevantNode;
}
NS_IMETHODIMP
-nsAccessible::FireToolkitEvent(PRUint32 aEvent, nsIAccessible *aTarget,
- void * aData)
+nsAccessible::FireToolkitEvent(PRUint32 aEvent, nsIAccessible *aTarget)
{
// Don't fire event for accessible that has been shut down.
if (!mWeakShell)
return NS_ERROR_FAILURE;
nsCOMPtr<nsIAccessibleEvent> accEvent =
- new nsAccEvent(aEvent, aTarget, aData);
+ new nsAccEvent(aEvent, aTarget);
NS_ENSURE_TRUE(accEvent, NS_ERROR_OUT_OF_MEMORY);
return FireAccessibleEvent(accEvent);
}
NS_IMETHODIMP
nsAccessible::FireAccessibleEvent(nsIAccessibleEvent *aEvent)
{
@@ -1959,17 +1958,17 @@ NS_IMETHODIMP nsAccessible::GetFinalRole
else if (*aRole == nsIAccessibleRole::ROLE_PUSHBUTTON) {
nsCOMPtr<nsIContent> content = do_QueryInterface(mDOMNode);
if (content) {
if (content->HasAttr(kNameSpaceID_None, nsAccessibilityAtoms::aria_pressed)) {
// For aria-pressed="false" or aria-pressed="true"
// For simplicity, any pressed attribute indicates it's a toggle button
*aRole = nsIAccessibleRole::ROLE_TOGGLE_BUTTON;
}
- else if (content->AttrValueIs(kNameSpaceID_None, nsAccessibilityAtoms::aria_secret,
+ else if (content->AttrValueIs(kNameSpaceID_None, nsAccessibilityAtoms::aria_haspopup,
nsAccessibilityAtoms::_true, eCaseMatters)) {
// For button with aria-haspopup="true"
*aRole = nsIAccessibleRole::ROLE_BUTTONMENU;
}
}
}
else if (*aRole == nsIAccessibleRole::ROLE_LISTBOX) {
// A listbox inside of a combo box needs a special role because of ATK mapping to menu
--- a/accessible/src/base/nsAccessibleEventData.cpp
+++ b/accessible/src/base/nsAccessibleEventData.cpp
@@ -55,25 +55,25 @@
#include "nsPresContext.h"
PRBool nsAccEvent::gLastEventFromUserInput = PR_FALSE;
nsIDOMNode* nsAccEvent::gLastEventNodeWeak = 0;
NS_IMPL_ISUPPORTS1(nsAccEvent, nsIAccessibleEvent)
nsAccEvent::nsAccEvent(PRUint32 aEventType, nsIAccessible *aAccessible,
- void *aEventData, PRBool aIsAsynch):
- mEventType(aEventType), mAccessible(aAccessible), mEventData(aEventData)
+ PRBool aIsAsynch):
+ mEventType(aEventType), mAccessible(aAccessible)
{
CaptureIsFromUserInput(aIsAsynch);
}
nsAccEvent::nsAccEvent(PRUint32 aEventType, nsIDOMNode *aDOMNode,
- void *aEventData, PRBool aIsAsynch):
- mEventType(aEventType), mDOMNode(aDOMNode), mEventData(aEventData)
+ PRBool aIsAsynch):
+ mEventType(aEventType), mDOMNode(aDOMNode)
{
CaptureIsFromUserInput(aIsAsynch);
}
void nsAccEvent::GetLastEventAttributes(nsIDOMNode *aNode,
nsIPersistentProperties *aAttributes)
{
if (aNode == gLastEventNodeWeak) {
@@ -269,34 +269,34 @@ nsAccEvent::GetAccessibleByNode()
// nsAccStateChangeEvent
NS_IMPL_ISUPPORTS_INHERITED1(nsAccStateChangeEvent, nsAccEvent,
nsIAccessibleStateChangeEvent)
nsAccStateChangeEvent::
nsAccStateChangeEvent(nsIAccessible *aAccessible,
PRUint32 aState, PRBool aIsExtraState,
PRBool aIsEnabled):
- nsAccEvent(::nsIAccessibleEvent::EVENT_STATE_CHANGE, aAccessible, nsnull),
+ nsAccEvent(::nsIAccessibleEvent::EVENT_STATE_CHANGE, aAccessible),
mState(aState), mIsExtraState(aIsExtraState), mIsEnabled(aIsEnabled)
{
}
nsAccStateChangeEvent::
nsAccStateChangeEvent(nsIDOMNode *aNode,
PRUint32 aState, PRBool aIsExtraState,
PRBool aIsEnabled):
- nsAccEvent(::nsIAccessibleEvent::EVENT_STATE_CHANGE, aNode, nsnull),
+ nsAccEvent(::nsIAccessibleEvent::EVENT_STATE_CHANGE, aNode),
mState(aState), mIsExtraState(aIsExtraState), mIsEnabled(aIsEnabled)
{
}
nsAccStateChangeEvent::
nsAccStateChangeEvent(nsIDOMNode *aNode,
PRUint32 aState, PRBool aIsExtraState):
- nsAccEvent(::nsIAccessibleEvent::EVENT_STATE_CHANGE, aNode, nsnull),
+ nsAccEvent(::nsIAccessibleEvent::EVENT_STATE_CHANGE, aNode),
mState(aState), mIsExtraState(aIsExtraState)
{
// Use GetAccessibleByNode() because we do not want to store an accessible
// since it leads to problems with delayed events in the case when
// an accessible gets reorder event before delayed event is processed.
nsCOMPtr<nsIAccessible> accessible(GetAccessibleByNode());
if (accessible) {
PRUint32 state = 0, extraState = 0;
@@ -332,17 +332,17 @@ nsAccStateChangeEvent::IsEnabled(PRBool
// nsAccTextChangeEvent
NS_IMPL_ISUPPORTS_INHERITED1(nsAccTextChangeEvent, nsAccEvent,
nsIAccessibleTextChangeEvent)
nsAccTextChangeEvent::
nsAccTextChangeEvent(nsIAccessible *aAccessible,
PRInt32 aStart, PRUint32 aLength, PRBool aIsInserted, PRBool aIsAsynch):
nsAccEvent(aIsInserted ? nsIAccessibleEvent::EVENT_TEXT_INSERTED : nsIAccessibleEvent::EVENT_TEXT_REMOVED,
- aAccessible, nsnull, aIsAsynch),
+ aAccessible, aIsAsynch),
mStart(aStart), mLength(aLength), mIsInserted(aIsInserted)
{
nsCOMPtr<nsIAccessibleText> textAccessible = do_QueryInterface(aAccessible);
NS_ASSERTION(textAccessible, "Should not be firing test change event for non-text accessible!!!");
if (textAccessible) {
textAccessible->GetText(aStart, aStart + aLength, mModifiedText);
}
}
@@ -376,29 +376,59 @@ nsAccTextChangeEvent::GetModifiedText(ns
}
// nsAccCaretMoveEvent
NS_IMPL_ISUPPORTS_INHERITED1(nsAccCaretMoveEvent, nsAccEvent,
nsIAccessibleCaretMoveEvent)
nsAccCaretMoveEvent::
nsAccCaretMoveEvent(nsIAccessible *aAccessible, PRInt32 aCaretOffset) :
- nsAccEvent(::nsIAccessibleEvent::EVENT_TEXT_CARET_MOVED, aAccessible, nsnull, PR_TRUE), // Currently always asynch
+ nsAccEvent(::nsIAccessibleEvent::EVENT_TEXT_CARET_MOVED, aAccessible, PR_TRUE), // Currently always asynch
mCaretOffset(aCaretOffset)
{
}
nsAccCaretMoveEvent::
nsAccCaretMoveEvent(nsIDOMNode *aNode) :
- nsAccEvent(::nsIAccessibleEvent::EVENT_TEXT_CARET_MOVED, aNode, nsnull, PR_TRUE), // Currently always asynch
+ nsAccEvent(::nsIAccessibleEvent::EVENT_TEXT_CARET_MOVED, aNode, PR_TRUE), // Currently always asynch
mCaretOffset(-1)
{
}
NS_IMETHODIMP
nsAccCaretMoveEvent::GetCaretOffset(PRInt32* aCaretOffset)
{
NS_ENSURE_ARG_POINTER(aCaretOffset);
*aCaretOffset = mCaretOffset;
return NS_OK;
}
+// nsAccTableChangeEvent
+NS_IMPL_ISUPPORTS_INHERITED1(nsAccTableChangeEvent, nsAccEvent,
+ nsIAccessibleTableChangeEvent)
+
+nsAccTableChangeEvent::
+ nsAccTableChangeEvent(nsIAccessible *aAccessible, PRUint32 aEventType,
+ PRInt32 aRowOrColIndex, PRInt32 aNumRowsOrCols, PRBool aIsAsynch):
+ nsAccEvent(aEventType, aAccessible, aIsAsynch),
+ mRowOrColIndex(aRowOrColIndex), mNumRowsOrCols(aNumRowsOrCols)
+{
+}
+
+NS_IMETHODIMP
+nsAccTableChangeEvent::GetRowOrColIndex(PRInt32* aRowOrColIndex)
+{
+ NS_ENSURE_ARG_POINTER(aRowOrColIndex);
+
+ *aRowOrColIndex = mRowOrColIndex;
+ return NS_OK;
+}
+
+NS_IMETHODIMP
+nsAccTableChangeEvent::GetNumRowsOrCols(PRInt32* aNumRowsOrCols)
+{
+ NS_ENSURE_ARG_POINTER(aNumRowsOrCols);
+
+ *aNumRowsOrCols = mNumRowsOrCols;
+ return NS_OK;
+}
+
--- a/accessible/src/base/nsAccessibleEventData.h
+++ b/accessible/src/base/nsAccessibleEventData.h
@@ -49,26 +49,26 @@
#include "nsString.h"
class nsIPresShell;
class nsAccEvent: public nsIAccessibleEvent
{
public:
// Initialize with an nsIAccessible
- nsAccEvent(PRUint32 aEventType, nsIAccessible *aAccessible, void *aEventData, PRBool aIsAsynch = PR_FALSE);
+ nsAccEvent(PRUint32 aEventType, nsIAccessible *aAccessible, PRBool aIsAsynch = PR_FALSE);
// Initialize with an nsIDOMNode
- nsAccEvent(PRUint32 aEventType, nsIDOMNode *aDOMNode, void *aEventData, PRBool aIsAsynch = PR_FALSE);
+ nsAccEvent(PRUint32 aEventType, nsIDOMNode *aDOMNode, PRBool aIsAsynch = PR_FALSE);
virtual ~nsAccEvent() {}
NS_DECL_ISUPPORTS
NS_DECL_NSIACCESSIBLEEVENT
static void GetLastEventAttributes(nsIDOMNode *aNode,
- nsIPersistentProperties *aAttributes);
+ nsIPersistentProperties *aAttributes);
protected:
already_AddRefed<nsIAccessible> GetAccessibleByNode();
void CaptureIsFromUserInput(PRBool aIsAsynch);
PRBool mIsFromUserInput;
private:
@@ -91,18 +91,16 @@ public:
PRBool aForceIsFromUserInput = PR_FALSE);
/**
* The input state was previously stored with the nsIAccessibleEvent,
* so use that state now -- call this when about to flush an event that
* was waiting in an event queue
*/
static void PrepareForEvent(nsIAccessibleEvent *aEvent);
-
- void *mEventData;
};
class nsAccStateChangeEvent: public nsAccEvent,
public nsIAccessibleStateChangeEvent
{
public:
nsAccStateChangeEvent(nsIAccessible *aAccessible,
PRUint32 aState, PRBool aIsExtraState,
@@ -153,18 +151,26 @@ public:
NS_DECL_ISUPPORTS_INHERITED
NS_FORWARD_NSIACCESSIBLEEVENT(nsAccEvent::)
NS_DECL_NSIACCESSIBLECARETMOVEEVENT
private:
PRInt32 mCaretOffset;
};
-// XXX todo: We might want to use XPCOM interfaces instead of struct
-// e.g., nsAccessibleTableChangeEvent: public nsIAccessibleTableChangeEvent
+class nsAccTableChangeEvent : public nsAccEvent,
+ public nsIAccessibleTableChangeEvent {
+public:
+ nsAccTableChangeEvent(nsIAccessible *aAccessible, PRUint32 aEventType,
+ PRInt32 aRowOrColIndex, PRInt32 aNumRowsOrCols,
+ PRBool aIsAsynch);
-struct AtkTableChange {
- PRUint32 index; // the start row/column after which the rows are inserted/deleted.
- PRUint32 count; // the number of inserted/deleted rows/columns
+ NS_DECL_ISUPPORTS
+ NS_FORWARD_NSIACCESSIBLEEVENT(nsAccEvent::)
+ NS_DECL_NSIACCESSIBLETABLECHANGEEVENT
+
+private:
+ PRUint32 mRowOrColIndex; // the start row/column after which the rows are inserted/deleted.
+ PRUint32 mNumRowsOrCols; // the number of inserted/deleted rows/columns
};
#endif
--- a/accessible/src/base/nsBaseWidgetAccessible.cpp
+++ b/accessible/src/base/nsBaseWidgetAccessible.cpp
@@ -141,23 +141,28 @@ nsLinkableAccessible::GetState(PRUint32
*aState |= nsIAccessibleStates::STATE_TRAVERSED;
}
}
}
return NS_OK;
}
-NS_IMETHODIMP nsLinkableAccessible::GetValue(nsAString& _retval)
+NS_IMETHODIMP nsLinkableAccessible::GetValue(nsAString& aValue)
{
+ aValue.Truncate();
+ nsHyperTextAccessible::GetValue(aValue);
+ if (!aValue.IsEmpty())
+ return NS_OK;
+
if (mIsLink) {
nsCOMPtr<nsIDOMNode> linkNode(do_QueryInterface(mActionContent));
nsCOMPtr<nsIPresShell> presShell(do_QueryReferent(mWeakShell));
if (linkNode && presShell)
- return presShell->GetLinkLocation(linkNode, _retval);
+ return presShell->GetLinkLocation(linkNode, aValue);
}
return NS_ERROR_NOT_IMPLEMENTED;
}
/* PRUint8 getAccNumActions (); */
NS_IMETHODIMP nsLinkableAccessible::GetNumActions(PRUint8 *aNumActions)
{
--- a/accessible/src/base/nsCaretAccessible.cpp
+++ b/accessible/src/base/nsCaretAccessible.cpp
@@ -83,16 +83,20 @@ nsresult nsCaretAccessible::ClearControl
mCurrentControlSelection = nsnull;
mCurrentControl = nsnull;
return selPrivate->RemoveSelectionListener(this);
}
nsresult nsCaretAccessible::SetControlSelectionListener(nsIDOMNode *aCurrentNode)
{
+ NS_ENSURE_TRUE(mRootAccessible, NS_ERROR_FAILURE);
+
+ ClearControlSelectionListener();
+
mCurrentControl = aCurrentNode;
mLastTextAccessible = nsnull;
// When focus moves such that the caret is part of a new frame selection
// this removes the old selection listener and attaches a new one for the current focus
nsCOMPtr<nsIPresShell> presShell =
mRootAccessible->GetPresShellFor(aCurrentNode);
if (!presShell)
@@ -116,26 +120,27 @@ nsresult nsCaretAccessible::SetControlSe
nsCOMPtr<nsISelectionController> selCon;
frame->GetSelectionController(presContext, getter_AddRefs(selCon));
NS_ENSURE_TRUE(selCon, NS_ERROR_FAILURE);
nsCOMPtr<nsISelection> domSel;
selCon->GetSelection(nsISelectionController::SELECTION_NORMAL, getter_AddRefs(domSel));
- ClearControlSelectionListener();
nsCOMPtr<nsISelectionPrivate> selPrivate(do_QueryInterface(domSel));
NS_ENSURE_TRUE(selPrivate, NS_ERROR_FAILURE);
mCurrentControlSelection = do_GetWeakReference(domSel);
return selPrivate->AddSelectionListener(this);
}
nsresult nsCaretAccessible::AddDocSelectionListener(nsIDOMDocument *aDoc)
{
+ NS_ENSURE_TRUE(mRootAccessible, NS_ERROR_FAILURE);
+
nsCOMPtr<nsIDocument> doc = do_QueryInterface(aDoc);
NS_ENSURE_TRUE(doc, NS_ERROR_FAILURE);
nsCOMPtr<nsISelectionController> selCon = do_QueryInterface(doc->GetPrimaryShell());
NS_ENSURE_TRUE(selCon, NS_ERROR_FAILURE);
nsCOMPtr<nsISelection> domSel;
selCon->GetSelection(nsISelectionController::SELECTION_NORMAL, getter_AddRefs(domSel));
nsCOMPtr<nsISelectionPrivate> selPrivate = do_QueryInterface(domSel);
@@ -166,17 +171,17 @@ NS_IMETHODIMP nsCaretAccessible::NotifyS
mLastUsedSelection = do_GetWeakReference(aSel);
nsCOMPtr<nsIDocument> doc = do_QueryInterface(aDoc);
NS_ENSURE_TRUE(doc, NS_OK);
nsIPresShell *presShell = doc->GetPrimaryShell();
NS_ENSURE_TRUE(presShell, NS_OK);
- // Get first nnsIAccessibleText in parent chain and fire caret-move, selection-change event for it
+ // Get first nsIAccessibleText in parent chain and fire caret-move, selection-change event for it
nsCOMPtr<nsIAccessible> accessible;
nsIAccessibilityService *accService = mRootAccessible->GetAccService();
NS_ENSURE_TRUE(accService, NS_ERROR_FAILURE);
// Get accessible from selection's focus node or its parent
nsCOMPtr<nsIDOMNode> focusNode;
aSel->GetFocusNode(getter_AddRefs(focusNode));
if (!focusNode) {
mLastTextAccessible = nsnull;
@@ -243,16 +248,17 @@ NS_IMETHODIMP nsCaretAccessible::NotifyS
}
nsRect
nsCaretAccessible::GetCaretRect(nsIWidget **aOutWidget)
{
nsRect caretRect;
NS_ENSURE_TRUE(aOutWidget, caretRect);
*aOutWidget = nsnull;
+ NS_ENSURE_TRUE(mRootAccessible, caretRect);
if (!mLastTextAccessible) {
return caretRect; // Return empty rect
}
nsCOMPtr<nsIAccessNode> lastAccessNode(do_QueryInterface(mLastTextAccessible));
NS_ENSURE_TRUE(lastAccessNode, caretRect);
--- a/accessible/src/base/nsDocAccessible.cpp
+++ b/accessible/src/base/nsDocAccessible.cpp
@@ -686,16 +686,17 @@ nsresult nsDocAccessible::RemoveEventLis
RemoveScrollListener();
// Remove document observer
mDocument->RemoveObserver(this);
if (mScrollWatchTimer) {
mScrollWatchTimer->Cancel();
mScrollWatchTimer = nsnull;
+ NS_RELEASE_THIS(); // Kung fu death grip
}
nsRefPtr<nsRootAccessible> rootAccessible(GetRootAccessible());
if (rootAccessible) {
nsRefPtr<nsCaretAccessible> caretAccessible = rootAccessible->GetCaretAccessible();
if (caretAccessible) {
nsCOMPtr<nsIDOMDocument> domDoc = do_QueryInterface(mDocument);
caretAccessible->RemoveDocSelectionListener(domDoc);
@@ -822,16 +823,17 @@ void nsDocAccessible::ScrollTimerCallbac
// Therefore, we wait for no scroll events to occur between 2 ticks of this timer
// That indicates a pause in scrolling, so we fire the accessibilty scroll event
nsAccUtils::FireAccEvent(nsIAccessibleEvent::EVENT_SCROLLING_END, docAcc);
docAcc->mScrollPositionChangedTicks = 0;
if (docAcc->mScrollWatchTimer) {
docAcc->mScrollWatchTimer->Cancel();
docAcc->mScrollWatchTimer = nsnull;
+ NS_RELEASE(docAcc); // Release kung fu death grip
}
}
}
void nsDocAccessible::AddScrollListener()
{
nsCOMPtr<nsIPresShell> presShell(do_QueryReferent(mWeakShell));
@@ -874,16 +876,17 @@ NS_IMETHODIMP nsDocAccessible::ScrollPos
// then the ::Notify() method will fire the accessibility event for scroll position changes
const PRUint32 kScrollPosCheckWait = 50;
if (mScrollWatchTimer) {
mScrollWatchTimer->SetDelay(kScrollPosCheckWait); // Create new timer, to avoid leaks
}
else {
mScrollWatchTimer = do_CreateInstance("@mozilla.org/timer;1");
if (mScrollWatchTimer) {
+ NS_ADDREF_THIS(); // Kung fu death grip
mScrollWatchTimer->InitWithFuncCallback(ScrollTimerCallback, this,
kScrollPosCheckWait,
nsITimer::TYPE_REPEATING_SLACK);
}
}
mScrollPositionChangedTicks = 1;
return NS_OK;
}
@@ -1025,29 +1028,29 @@ nsDocAccessible::AttributeChangedImpl(ns
// Need to find the right event to use here, SELECTION_WITHIN would
// seem right but we had started using it for something else
nsCOMPtr<nsIAccessNode> multiSelectAccessNode =
do_QueryInterface(multiSelect);
nsCOMPtr<nsIDOMNode> multiSelectDOMNode;
multiSelectAccessNode->GetDOMNode(getter_AddRefs(multiSelectDOMNode));
NS_ASSERTION(multiSelectDOMNode, "A new accessible without a DOM node!");
FireDelayedToolkitEvent(nsIAccessibleEvent::EVENT_SELECTION_WITHIN,
- multiSelectDOMNode, nsnull, eAllowDupes);
+ multiSelectDOMNode, eAllowDupes);
static nsIContent::AttrValuesArray strings[] =
{&nsAccessibilityAtoms::_empty, &nsAccessibilityAtoms::_false, nsnull};
if (aContent->FindAttrValueIn(kNameSpaceID_None, aAttribute,
strings, eCaseMatters) >= 0) {
FireDelayedToolkitEvent(nsIAccessibleEvent::EVENT_SELECTION_REMOVE,
- targetNode, nsnull);
+ targetNode);
return;
}
FireDelayedToolkitEvent(nsIAccessibleEvent::EVENT_SELECTION_ADD,
- targetNode, nsnull);
+ targetNode);
}
}
if (aAttribute == nsAccessibilityAtoms::contenteditable) {
nsCOMPtr<nsIAccessibleStateChangeEvent> editableChangeEvent =
new nsAccStateChangeEvent(targetNode,
nsIAccessibleStates::EXT_STATE_EDITABLE,
PR_TRUE);
@@ -1147,17 +1150,17 @@ nsDocAccessible::ARIAAttributeChanged(ns
nsIAccessibleStates::STATE_READONLY,
PR_FALSE);
FireDelayedAccessibleEvent(event);
return;
}
if (aAttribute == nsAccessibilityAtoms::aria_valuenow) {
FireDelayedToolkitEvent(nsIAccessibleEvent::EVENT_VALUE_CHANGE,
- targetNode, nsnull);
+ targetNode);
return;
}
if (aAttribute == nsAccessibilityAtoms::aria_multiselectable &&
aContent->HasAttr(kNameSpaceID_None, nsAccessibilityAtoms::role)) {
// This affects whether the accessible supports nsIAccessibleSelectable.
// COM says we cannot change what interfaces are supported on-the-fly,
// so invalidate this object. A new one will be created on demand.
@@ -1376,22 +1379,21 @@ nsDocAccessible::CreateTextChangeEventFo
new nsAccTextChangeEvent(aContainerAccessible, offset, length, aIsInserting, aIsAsynch);
NS_IF_ADDREF(event);
return event;
}
nsresult nsDocAccessible::FireDelayedToolkitEvent(PRUint32 aEvent,
nsIDOMNode *aDOMNode,
- void *aData,
EDupeEventRule aAllowDupes,
PRBool aIsAsynch)
{
nsCOMPtr<nsIAccessibleEvent> event =
- new nsAccEvent(aEvent, aDOMNode, aData, PR_TRUE);
+ new nsAccEvent(aEvent, aDOMNode, PR_TRUE);
NS_ENSURE_TRUE(event, NS_ERROR_OUT_OF_MEMORY);
return FireDelayedAccessibleEvent(event, aAllowDupes, aIsAsynch);
}
nsresult
nsDocAccessible::FireDelayedAccessibleEvent(nsIAccessibleEvent *aEvent,
EDupeEventRule aAllowDupes,
@@ -1617,88 +1619,103 @@ void nsDocAccessible::FlushEventsCallbac
// A lot of crashes were happening here, so now we're reffing the doc
// now until the events are flushed
accessibleDoc->FlushPendingEvents();
}
}
void nsDocAccessible::RefreshNodes(nsIDOMNode *aStartNode)
{
+ if (mAccessNodeCache.Count() <= 1) {
+ return; // All we have is a doc accessible. There is nothing to invalidate, quit early
+ }
+
nsCOMPtr<nsIAccessNode> accessNode;
GetCachedAccessNode(aStartNode, getter_AddRefs(accessNode));
- nsCOMPtr<nsIDOMNode> nextNode, iterNode;
// Shut down accessible subtree, which may have been created for
// anonymous content subtree
nsCOMPtr<nsIAccessible> accessible(do_QueryInterface(accessNode));
if (accessible) {
+ // Fire menupopup end if a menu goes away
+ PRUint32 role = Role(accessible);
+ if (role == nsIAccessibleRole::ROLE_MENUPOPUP) {
+ nsCOMPtr<nsIDOMNode> domNode;
+ accessNode->GetDOMNode(getter_AddRefs(domNode));
+ nsCOMPtr<nsIDOMXULPopupElement> popup(do_QueryInterface(domNode));
+ if (!popup) {
+ // Popup elements already fire these via DOMMenuInactive
+ // handling in nsRootAccessible::HandleEvent
+ nsAccUtils::FireAccEvent(nsIAccessibleEvent::EVENT_MENUPOPUP_END,
+ accessible);
+ }
+ }
nsCOMPtr<nsPIAccessible> privateAccessible = do_QueryInterface(accessible);
NS_ASSERTION(privateAccessible, "No nsPIAccessible for nsIAccessible");
nsCOMPtr<nsIAccessible> childAccessible;
// we only need to shutdown the accessibles here if one of them has been created
privateAccessible->GetCachedFirstChild(getter_AddRefs(childAccessible));
if (childAccessible) {
nsCOMPtr<nsIArray> children;
// use GetChildren() to fetch children at one time, instead of using
// GetNextSibling(), because after we shutdown the first child,
// mNextSibling will be set null.
accessible->GetChildren(getter_AddRefs(children));
PRUint32 childCount;
children->GetLength(&childCount);
+ nsCOMPtr<nsIDOMNode> possibleAnonNode;
for (PRUint32 index = 0; index < childCount; index++) {
nsCOMPtr<nsIAccessNode> childAccessNode;
children->QueryElementAt(index, NS_GET_IID(nsIAccessNode),
getter_AddRefs(childAccessNode));
- childAccessNode->GetDOMNode(getter_AddRefs(iterNode));
- nsCOMPtr<nsIContent> iterContent = do_QueryInterface(iterNode);
+ childAccessNode->GetDOMNode(getter_AddRefs(possibleAnonNode));
+ nsCOMPtr<nsIContent> iterContent = do_QueryInterface(possibleAnonNode);
if (iterContent && (iterContent->IsNativeAnonymous() ||
iterContent->GetBindingParent())) {
// GetBindingParent() check is a perf win -- make sure we don't
// shut down the same subtree twice since we'll reach non-anon content via
// DOM traversal later in this method
- RefreshNodes(iterNode);
+ RefreshNodes(possibleAnonNode);
}
}
}
+ }
- // Shutdown ordinary content subtree as well -- there may be
- // access node children which are not full accessible objects
- aStartNode->GetFirstChild(getter_AddRefs(nextNode));
- while (nextNode) {
- nextNode.swap(iterNode);
- RefreshNodes(iterNode);
- iterNode->GetNextSibling(getter_AddRefs(nextNode));
- }
+ // Shutdown ordinary content subtree as well -- there may be
+ // access node children which are not full accessible objects
+ nsCOMPtr<nsIDOMNode> nextNode, iterNode;
+ aStartNode->GetFirstChild(getter_AddRefs(nextNode));
+ while (nextNode) {
+ nextNode.swap(iterNode);
+ RefreshNodes(iterNode);
+ iterNode->GetNextSibling(getter_AddRefs(nextNode));
+ }
+
+ if (!accessNode)
+ return;
- // Don't shutdown our doc object!
- if (accessNode && accessNode != static_cast<nsIAccessNode*>(this)) {
- // Fire menupopup end if a menu goes away
- PRUint32 role = Role(accessible);
- if (role == nsIAccessibleRole::ROLE_MENUPOPUP) {
- nsCOMPtr<nsIDOMNode> domNode;
- accessNode->GetDOMNode(getter_AddRefs(domNode));
- nsCOMPtr<nsIDOMXULPopupElement> popup(do_QueryInterface(domNode));
- if (!popup) {
- // Popup elements already fire these via DOMMenuInactive
- // handling in nsRootAccessible::HandleEvent
- nsAccUtils::FireAccEvent(nsIAccessibleEvent::EVENT_MENUPOPUP_END,
- accessible);
- }
- }
- // Shut down the actual accessible or access node
- void *uniqueID;
- accessNode->GetUniqueID(&uniqueID);
- nsCOMPtr<nsPIAccessNode> privateAccessNode(do_QueryInterface(accessNode));
- privateAccessNode->Shutdown();
- // Remove from hash table as well
- mAccessNodeCache.Remove(uniqueID);
- }
+ if (accessNode == this) {
+ // Don't shutdown our doc object -- this may just be from the finished loading.
+ // We will completely shut it down when the pagehide event is received
+ // However, we must invalidate the doc accessible's children in order to be sure
+ // all pointers to them are correct
+ InvalidateChildren();
+ return;
}
+
+ // Shut down the actual accessible or access node
+ void *uniqueID;
+ accessNode->GetUniqueID(&uniqueID);
+ nsCOMPtr<nsPIAccessNode> privateAccessNode(do_QueryInterface(accessNode));
+ privateAccessNode->Shutdown();
+
+ // Remove from hash table as well
+ mAccessNodeCache.Remove(uniqueID);
}
NS_IMETHODIMP nsDocAccessible::InvalidateCacheSubtree(nsIContent *aChild,
PRUint32 aChangeEventType)
{
PRBool isHiding =
aChangeEventType == nsIAccessibleEvent::EVENT_ASYNCH_HIDE ||
aChangeEventType == nsIAccessibleEvent::EVENT_DOM_DESTROY;
@@ -1737,47 +1754,39 @@ NS_IMETHODIMP nsDocAccessible::Invalidat
// doc accessible. In this case we optimize
// by not firing SHOW/HIDE/REORDER events for every document mutation
// caused by page load, since AT is not going to want to grab the
// document and listen to these changes until after the page is first loaded
// Leave early, and ensure mAccChildCount stays uninitialized instead of 0,
// which it is if anyone asks for its children right now.
return InvalidateChildren();
}
- if (aChangeEventType == nsIAccessibleEvent::EVENT_DOM_CREATE) {
- nsIEventStateManager *esm = presShell->GetPresContext()->EventStateManager();
- NS_ENSURE_TRUE(esm, NS_ERROR_FAILURE);
- if (!esm->IsHandlingUserInputExternal()) {
- // Adding content during page load, but not caused by user input
- // Just invalidate accessible hierarchy and return,
- // otherwise the page load time slows down way too much
- nsCOMPtr<nsIAccessible> containerAccessible;
- GetAccessibleInParentChain(childNode, PR_FALSE, getter_AddRefs(containerAccessible));
- if (!containerAccessible) {
- containerAccessible = this;
- }
- nsCOMPtr<nsPIAccessible> privateContainer = do_QueryInterface(containerAccessible);
- return privateContainer->InvalidateChildren();
- }
- // else: user input, so we must fall through and for full handling,
- // e.g. fire the mutation events. Note: user input could cause DOM_CREATE
- // during page load if user typed into an input field or contentEditable area
- }
+ nsIEventStateManager *esm = presShell->GetPresContext()->EventStateManager();
+ NS_ENSURE_TRUE(esm, NS_ERROR_FAILURE);
+ if (!esm->IsHandlingUserInputExternal()) {
+ // Changes during page load, but not caused by user input
+ // Just invalidate accessible hierarchy and return,
+ // otherwise the page load time slows down way too much
+ nsCOMPtr<nsIAccessible> containerAccessible;
+ GetAccessibleInParentChain(childNode, PR_FALSE, getter_AddRefs(containerAccessible));
+ if (!containerAccessible) {
+ containerAccessible = this;
+ }
+ nsCOMPtr<nsPIAccessible> privateContainer = do_QueryInterface(containerAccessible);
+ return privateContainer->InvalidateChildren();
+ }
+ // else: user input, so we must fall through and for full handling,
+ // e.g. fire the mutation events. Note: user input could cause DOM_CREATE
+ // during page load if user typed into an input field or contentEditable area
}
// Update last change state information
nsCOMPtr<nsIAccessNode> childAccessNode;
GetCachedAccessNode(childNode, getter_AddRefs(childAccessNode));
nsCOMPtr<nsIAccessible> childAccessible = do_QueryInterface(childAccessNode);
- if (!childAccessible && !isHiding) {
- // If not about to hide it, make sure there's an accessible so we can fire an
- // event for it
- GetAccService()->GetAttachedAccessibleFor(childNode,
- getter_AddRefs(childAccessible));
- }
#ifdef DEBUG_A11Y
nsAutoString localName;
childNode->GetLocalName(localName);
const char *hasAccessible = childAccessible ? " (acc)" : "";
if (aChangeEventType == nsIAccessibleEvent::EVENT_ASYNCH_HIDE) {
printf("[Hide %s %s]\n", NS_ConvertUTF16toUTF8(localName).get(), hasAccessible);
}
@@ -1865,32 +1874,32 @@ NS_IMETHODIMP nsDocAccessible::Invalidat
}
// Fire EVENT_SHOW, EVENT_MENUPOPUP_START for newly visible content.
// Fire after a short timer, because we want to make sure the view has been
// updated to make this accessible content visible. If we don't wait,
// the assistive technology may receive the event and then retrieve
// nsIAccessibleStates::STATE_INVISIBLE for the event's accessible object.
PRUint32 additionEvent = isAsynch ? nsIAccessibleEvent::EVENT_ASYNCH_SHOW :
nsIAccessibleEvent::EVENT_DOM_CREATE;
- FireDelayedToolkitEvent(additionEvent, childNode, nsnull,
+ FireDelayedToolkitEvent(additionEvent, childNode,
eCoalesceFromSameSubtree, isAsynch);
// Check to see change occured in an ARIA menu, and fire an EVENT_MENUPOPUP_START if it did
nsRoleMapEntry *roleMapEntry = nsAccUtils::GetRoleMapEntry(childNode);
if (roleMapEntry && roleMapEntry->role == nsIAccessibleRole::ROLE_MENUPOPUP) {
FireDelayedToolkitEvent(nsIAccessibleEvent::EVENT_MENUPOPUP_START,
- childNode, nsnull, eAllowDupes, isAsynch);
+ childNode, eAllowDupes, isAsynch);
}
// Check to see if change occured inside an alert, and fire an EVENT_ALERT if it did
nsIContent *ancestor = aChild;
while (PR_TRUE) {
if (roleMapEntry && roleMapEntry->role == nsIAccessibleRole::ROLE_ALERT) {
nsCOMPtr<nsIDOMNode> alertNode(do_QueryInterface(ancestor));
- FireDelayedToolkitEvent(nsIAccessibleEvent::EVENT_ALERT, alertNode, nsnull,
+ FireDelayedToolkitEvent(nsIAccessibleEvent::EVENT_ALERT, alertNode,
eRemoveDupes, isAsynch);
break;
}
ancestor = ancestor->GetParent();
nsCOMPtr<nsIDOMNode> ancestorNode = do_QueryInterface(ancestor);
if (!ancestorNode) {
break;
}
@@ -1899,17 +1908,17 @@ NS_IMETHODIMP nsDocAccessible::Invalidat
}
if (!isShowing) {
// Fire an event so the assistive technology knows the children have changed
// This is only used by older MSAA clients. Newer ones should derive this
// from SHOW and HIDE so that they don't fetch extra objects
if (childAccessible) {
nsCOMPtr<nsIAccessibleEvent> reorderEvent =
- new nsAccEvent(nsIAccessibleEvent::EVENT_REORDER, containerAccessible, nsnull, PR_TRUE);
+ new nsAccEvent(nsIAccessibleEvent::EVENT_REORDER, containerAccessible, PR_TRUE);
NS_ENSURE_TRUE(reorderEvent, NS_ERROR_OUT_OF_MEMORY);
FireDelayedAccessibleEvent(reorderEvent, eCoalesceFromSameSubtree, isAsynch);
}
}
return NS_OK;
}
@@ -1975,17 +1984,17 @@ nsDocAccessible::FireShowHideEvents(nsID
if (accessible) {
// Found an accessible, so fire the show/hide on it and don't
// look further into this subtree
PRBool isAsynch = aEventType == nsIAccessibleEvent::EVENT_ASYNCH_HIDE ||
aEventType == nsIAccessibleEvent::EVENT_ASYNCH_SHOW;
nsCOMPtr<nsIAccessibleEvent> event =
- new nsAccEvent(aEventType, accessible, nsnull, isAsynch);
+ new nsAccEvent(aEventType, accessible, isAsynch);
NS_ENSURE_TRUE(event, NS_ERROR_OUT_OF_MEMORY);
if (aForceIsFromUserInput) {
nsAccEvent::PrepareForEvent(aDOMNode, aForceIsFromUserInput);
}
if (aDelay) {
return FireDelayedAccessibleEvent(event, eCoalesceFromSameSubtree, isAsynch);
}
return FireAccessibleEvent(event);
--- a/accessible/src/base/nsDocAccessible.h
+++ b/accessible/src/base/nsDocAccessible.h
@@ -103,28 +103,27 @@ class nsDocAccessible : public nsHyperTe
enum EDupeEventRule { eAllowDupes, eCoalesceFromSameSubtree, eRemoveDupes };
/**
* Non-virtual method to fire a delayed event after a 0 length timeout
*
* @param aEvent - the nsIAccessibleEvent event type
* @param aDOMNode - DOM node the accesible event should be fired for
- * @param aData - any additional data for the event
* @param aAllowDupes - eAllowDupes: more than one event of the same type is allowed.
* eCoalesceFromSameSubtree: if two events are in the same subtree,
* only the event on ancestor is used
* eRemoveDupes (default): events of the same type are discarded
* (the last one is used)
*
* @param aIsAsyn - set to PR_TRUE if this is not being called from code
* synchronous with a DOM event
*/
nsresult FireDelayedToolkitEvent(PRUint32 aEvent, nsIDOMNode *aDOMNode,
- void *aData, EDupeEventRule aAllowDupes = eRemoveDupes,
+ EDupeEventRule aAllowDupes = eRemoveDupes,
PRBool aIsAsynch = PR_FALSE);
/**
* Fire accessible event in timeout.
*
* @param aEvent - the event to fire
* @param aAllowDupes - if false then delayed events of the same type and
* for the same DOM node in the event queue won't
--- a/accessible/src/base/nsOuterDocAccessible.cpp
+++ b/accessible/src/base/nsOuterDocAccessible.cpp
@@ -69,17 +69,17 @@ NS_IMETHODIMP nsOuterDocAccessible::GetN
}
}
return rv;
}
/* unsigned long getRole (); */
NS_IMETHODIMP nsOuterDocAccessible::GetRole(PRUint32 *aRole)
{
- *aRole = nsIAccessibleRole::ROLE_CLIENT;
+ *aRole = nsIAccessibleRole::ROLE_INTERNAL_FRAME;
return NS_OK;
}
NS_IMETHODIMP
nsOuterDocAccessible::GetState(PRUint32 *aState, PRUint32 *aExtraState)
{
nsAccessible::GetState(aState, aExtraState);
*aState &= ~nsIAccessibleStates::STATE_FOCUSABLE;
@@ -111,17 +111,17 @@ void nsOuterDocAccessible::CacheChildren
if (!mWeakShell) {
mAccChildCount = eChildCountUninitialized;
return; // This outer doc node has been shut down
}
if (mAccChildCount != eChildCountUninitialized) {
return;
}
- SetFirstChild(nsnull);
+ InvalidateChildren();
mAccChildCount = 0;
// In these variable names, "outer" relates to the nsOuterDocAccessible
// as opposed to the nsDocAccessibleWrap which is "inner".
// The outer node is a something like a <browser>, <frame>, <iframe>, <page> or
// <editor> tag, whereas the inner node corresponds to the inner document root.
nsCOMPtr<nsIContent> content(do_QueryInterface(mDOMNode));
--- a/accessible/src/base/nsRootAccessible.cpp
+++ b/accessible/src/base/nsRootAccessible.cpp
@@ -425,17 +425,17 @@ void nsRootAccessible::TryFireEarlyLoadE
if (state & nsIAccessibleStates::STATE_BUSY) {
// Don't fire page load events on subdocuments for initial page load of entire page
return;
}
}
// No frames or iframes, so we can fire the doc load finished event early
FireDelayedToolkitEvent(nsIAccessibleEvent::EVENT_INTERNAL_LOAD, aDocNode,
- nsnull, eRemoveDupes);
+ eRemoveDupes);
}
PRBool nsRootAccessible::FireAccessibleFocusEvent(nsIAccessible *aAccessible,
nsIDOMNode *aNode,
nsIDOMEvent *aFocusEvent,
PRBool aForceEvent,
PRBool aIsAsynch)
{
@@ -514,17 +514,17 @@ PRBool nsRootAccessible::FireAccessibleF
nsAccUtils::FireAccEvent(nsIAccessibleEvent::EVENT_MENU_START, menuBarAccessible);
}
}
}
}
}
else if (mCurrentARIAMenubar) {
nsCOMPtr<nsIAccessibleEvent> menuEndEvent =
- new nsAccEvent(nsIAccessibleEvent::EVENT_MENU_END, mCurrentARIAMenubar, nsnull, PR_FALSE);
+ new nsAccEvent(nsIAccessibleEvent::EVENT_MENU_END, mCurrentARIAMenubar, PR_FALSE);
if (menuEndEvent) {
FireDelayedAccessibleEvent(menuEndEvent, eAllowDupes, PR_FALSE);
}
mCurrentARIAMenubar = nsnull;
}
NS_IF_RELEASE(gLastFocusedNode);
gLastFocusedNode = finalFocusNode;
@@ -538,17 +538,17 @@ PRBool nsRootAccessible::FireAccessibleF
// Suppress document focus, because real DOM focus will be fired next,
// and that's what we care about
// Make sure we never fire focus for the nsRootAccessible (mDOMNode)
return PR_FALSE;
}
}
FireDelayedToolkitEvent(nsIAccessibleEvent::EVENT_FOCUS,
- finalFocusNode, nsnull, eRemoveDupes, aIsAsynch);
+ finalFocusNode, eRemoveDupes, aIsAsynch);
return PR_TRUE;
}
void nsRootAccessible::FireCurrentFocusEvent()
{
nsCOMPtr<nsIDOMNode> focusedNode = GetCurrentFocus();
if (!focusedNode) {
@@ -592,16 +592,19 @@ NS_IMETHODIMP nsRootAccessible::HandleEv
nsresult nsRootAccessible::HandleEventWithTarget(nsIDOMEvent* aEvent,
nsIDOMNode* aTargetNode)
{
nsAutoString eventType;
aEvent->GetType(eventType);
nsAutoString localName;
aTargetNode->GetLocalName(localName);
+#ifdef MOZ_XUL
+ PRBool isTree = localName.EqualsLiteral("tree");
+#endif
#ifdef DEBUG_A11Y
// Very useful for debugging, please leave this here.
if (eventType.EqualsLiteral("AlertActive")) {
printf("\ndebugging %s events for %s", NS_ConvertUTF16toUTF8(eventType).get(), NS_ConvertUTF16toUTF8(localName).get());
}
if (localName.LowerCaseEqualsLiteral("textbox")) {
printf("\ndebugging %s events for %s", NS_ConvertUTF16toUTF8(eventType).get(), NS_ConvertUTF16toUTF8(localName).get());
}
@@ -637,35 +640,75 @@ nsresult nsRootAccessible::HandleEventWi
if (eventType.EqualsLiteral("DOMContentLoaded")) {
// Don't create the doc accessible until load scripts have a chance to set
// role attribute for <body> or <html> element, because the value of
// role attribute will be cached when the doc accessible is Init()'d
TryFireEarlyLoadEvent(aTargetNode);
return NS_OK;
}
+#ifdef MOZ_XUL
if (eventType.EqualsLiteral("TreeViewChanged")) { // Always asynch, always from user input
- if (!localName.EqualsLiteral("tree"))
+ if (!isTree)
return NS_OK;
nsCOMPtr<nsIContent> treeContent = do_QueryInterface(aTargetNode);
nsAccEvent::PrepareForEvent(aTargetNode, PR_TRUE);
return accService->InvalidateSubtreeFor(eventShell, treeContent,
nsIAccessibleEvent::EVENT_ASYNCH_SIGNIFICANT_CHANGE);
}
+#endif
+
+ if (eventType.EqualsLiteral("popuphiding")) {
+ // If accessible focus was on or inside popup that closes,
+ // then restore it to true current focus.
+ // This is the case when we've been getting DOMMenuItemActive events
+ // inside of a combo box that closes. The real focus is on the combo box.
+ // It's also the case when a popup gets focus in ATK -- when it closes
+ // we need to fire an event to restore focus to where it was
+ if (!gLastFocusedNode) {
+ return NS_OK;
+ }
+ if (gLastFocusedNode != aTargetNode) {
+ // Was not focused on popup
+ nsCOMPtr<nsIDOMNode> parentOfFocus;
+ gLastFocusedNode->GetParentNode(getter_AddRefs(parentOfFocus));
+ if (parentOfFocus != aTargetNode) {
+ return NS_OK; // And was not focused on an item inside the popup
+ }
+ }
+ // Focus was on or inside of a popup that's being hidden
+ FireCurrentFocusEvent();
+ return NS_OK;
+ }
+
+ if (aTargetNode == mDOMNode && mDOMNode != gLastFocusedNode && eventType.EqualsLiteral("focus")) {
+ // Got focus event for the window, we will make sure that an accessible
+ // focus event for initial focus is fired. We do this on a short timer
+ // because the initial focus may not have been set yet.
+ if (!mFireFocusTimer) {
+ mFireFocusTimer = do_CreateInstance("@mozilla.org/timer;1");
+ }
+ if (mFireFocusTimer) {
+ mFireFocusTimer->InitWithFuncCallback(FireFocusCallback, this,
+ 0, nsITimer::TYPE_ONE_SHOT);
+ }
+ return NS_OK;
+ }
nsCOMPtr<nsIAccessible> accessible;
accService->GetAccessibleInShell(aTargetNode, eventShell,
getter_AddRefs(accessible));
nsCOMPtr<nsPIAccessible> privAcc(do_QueryInterface(accessible));
if (!privAcc)
return NS_OK;
+#ifdef MOZ_XUL
if (eventType.EqualsLiteral("TreeRowCountChanged")) {
- if (!localName.EqualsLiteral("tree"))
+ if (!isTree)
return NS_OK;
nsCOMPtr<nsIDOMDataContainerEvent> dataEvent(do_QueryInterface(aEvent));
NS_ENSURE_STATE(dataEvent);
nsCOMPtr<nsIVariant> indexVariant;
dataEvent->GetData(NS_LITERAL_STRING("index"),
getter_AddRefs(indexVariant));
@@ -680,16 +723,17 @@ nsresult nsRootAccessible::HandleEventWi
indexVariant->GetAsInt32(&index);
countVariant->GetAsInt32(&count);
nsCOMPtr<nsIAccessibleTreeCache> treeAccCache(do_QueryInterface(accessible));
NS_ENSURE_STATE(treeAccCache);
return treeAccCache->InvalidateCache(index, count);
}
+#endif
if (eventType.EqualsLiteral("RadioStateChange")) {
PRUint32 state = State(accessible);
// radiogroup in prefWindow is exposed as a list,
// and panebutton is exposed as XULListitem in A11y.
// nsXULListitemAccessible::GetState uses STATE_SELECTED in this case,
// so we need to check nsIAccessibleStates::STATE_SELECTED also.
@@ -718,17 +762,17 @@ nsresult nsRootAccessible::HandleEventWi
PR_FALSE, isEnabled);
return privAcc->FireAccessibleEvent(accEvent);
}
nsCOMPtr<nsIAccessible> treeItemAccessible;
#ifdef MOZ_XUL
// If it's a tree element, need the currently selected item
- if (localName.EqualsLiteral("tree")) {
+ if (isTree) {
nsCOMPtr<nsIDOMXULMultiSelectControlElement> multiSelect =
do_QueryInterface(aTargetNode);
if (multiSelect) {
PRInt32 treeIndex = -1;
multiSelect->GetCurrentIndex(&treeIndex);
if (treeIndex >= 0) {
nsCOMPtr<nsIAccessibleTreeCache> treeCache(do_QueryInterface(accessible));
if (!treeCache ||
@@ -774,29 +818,16 @@ nsresult nsRootAccessible::HandleEventWi
return nsAccUtils::FireAccEvent(nsIAccessibleEvent::EVENT_SELECTION,
treeItemAccessible);
}
}
else
#endif
if (eventType.EqualsLiteral("focus")) {
- if (aTargetNode == mDOMNode && mDOMNode != gLastFocusedNode) {
- // Got focus event for the window, we will make sure that an accessible
- // focus event for initial focus is fired. We do this on a short timer
- // because the initial focus may not have been set yet.
- if (!mFireFocusTimer) {
- mFireFocusTimer = do_CreateInstance("@mozilla.org/timer;1");
- }
- if (mFireFocusTimer) {
- mFireFocusTimer->InitWithFuncCallback(FireFocusCallback, this,
- 0, nsITimer::TYPE_ONE_SHOT);
- }
- }
-
// Keep a reference to the target node. We might want to change
// it to the individual radio button or selected item, and send
// the focus event to that.
nsCOMPtr<nsIDOMNode> focusedItem(aTargetNode);
if (!treeItemAccessible) {
nsCOMPtr<nsIDOMXULSelectControlElement> selectControl =
do_QueryInterface(aTargetNode);
@@ -842,46 +873,29 @@ nsresult nsRootAccessible::HandleEventWi
// AT's expect to get an EVENT_SHOW for the tooltip.
// In event callback the tooltip's accessible will be ready.
event = nsIAccessibleEvent::EVENT_ASYNCH_SHOW;
}
if (event) {
nsAccUtils::FireAccEvent(event, accessible);
}
}
-
- else if (eventType.EqualsLiteral("popuphiding")) {
- // If accessible focus was on or inside popup that closes,
- // then restore it to true current focus.
- // This is the case when we've been getting DOMMenuItemActive events
- // inside of a combo box that closes. The real focus is on the combo box.
- // It's also the case when a popup gets focus in ATK -- when it closes
- // we need to fire an event to restore focus to where it was
- if (!gLastFocusedNode) {
- return NS_OK;
- }
- if (gLastFocusedNode != aTargetNode) {
- // Was not focused on popup
- nsCOMPtr<nsIDOMNode> parentOfFocus;
- gLastFocusedNode->GetParentNode(getter_AddRefs(parentOfFocus));
- if (parentOfFocus != aTargetNode) {
- return NS_OK; // And was not focused on an item inside the popup
- }
- }
- // Focus was on or inside of a popup that's being hidden
- FireCurrentFocusEvent();
- }
else if (eventType.EqualsLiteral("DOMMenuInactive")) {
if (Role(accessible) == nsIAccessibleRole::ROLE_MENUPOPUP) {
nsAccUtils::FireAccEvent(nsIAccessibleEvent::EVENT_MENUPOPUP_END,
accessible);
}
}
else if (eventType.EqualsLiteral("DOMMenuItemActive")) {
if (!treeItemAccessible) {
+#ifdef MOZ_XUL
+ if (isTree) {
+ return NS_OK; // Tree with nothing selected
+ }
+#endif
nsCOMPtr<nsPIAccessNode> menuAccessNode = do_QueryInterface(accessible);
NS_ENSURE_TRUE(menuAccessNode, NS_ERROR_FAILURE);
nsIFrame* menuFrame = menuAccessNode->GetFrame();
NS_ENSURE_TRUE(menuFrame, NS_ERROR_FAILURE);
nsIMenuFrame* imenuFrame;
CallQueryInterface(menuFrame, &imenuFrame);
// QI failed for nsIMenuFrame means it's not on menu bar
if (imenuFrame && imenuFrame->IsOnMenuBar() &&
--- a/accessible/src/html/nsHTMLTableAccessible.cpp
+++ b/accessible/src/html/nsHTMLTableAccessible.cpp
@@ -852,39 +852,32 @@ nsHTMLTableAccessible::GetTableNode(nsID
NS_IF_ADDREF(*_retval);
return rv;
}
return NS_ERROR_FAILURE;
}
nsresult
-nsHTMLTableAccessible::GetTableLayout(nsITableLayout **aLayoutObject)
+nsHTMLTableAccessible::GetTableLayout(nsITableLayout **aTableLayout)
{
- *aLayoutObject = nsnull;
-
- nsresult rv = NS_OK;
+ *aTableLayout = nsnull;
nsCOMPtr<nsIDOMNode> tableNode;
- rv = GetTableNode(getter_AddRefs(tableNode));
- NS_ENSURE_SUCCESS(rv, rv);
-
- nsCOMPtr<nsIContent> content(do_QueryInterface(tableNode));
- NS_ENSURE_TRUE(content, NS_ERROR_FAILURE);
+ GetTableNode(getter_AddRefs(tableNode));
+ nsCOMPtr<nsIContent> tableContent(do_QueryInterface(tableNode));
+ if (!tableContent) {
+ return NS_ERROR_FAILURE; // Table shut down
+ }
- nsIDocument *doc = content->GetDocument();
- NS_ENSURE_TRUE(doc, NS_ERROR_FAILURE);
-
- nsIPresShell *presShell = doc->GetPrimaryShell();
+ nsCOMPtr<nsIPresShell> shell = GetPresShell();
+ NS_ENSURE_TRUE(shell, NS_ERROR_FAILURE);
- nsCOMPtr<nsISupports> layoutObject;
- rv = presShell->GetLayoutObjectFor(content, getter_AddRefs(layoutObject));
- NS_ENSURE_SUCCESS(rv, rv);
-
- return CallQueryInterface(layoutObject, aLayoutObject);
+ nsIFrame *frame = shell->GetPrimaryFrameFor(tableContent);
+ return frame ? CallQueryInterface(frame, aTableLayout) : NS_ERROR_FAILURE;
}
nsresult
nsHTMLTableAccessible::GetCellAt(PRInt32 aRowIndex,
PRInt32 aColIndex,
nsIDOMElement* &aCell)
{
PRInt32 startRowIndex = 0, startColIndex = 0,
--- a/accessible/src/html/nsHyperTextAccessible.cpp
+++ b/accessible/src/html/nsHyperTextAccessible.cpp
@@ -91,17 +91,20 @@ nsresult nsHyperTextAccessible::QueryInt
if (aIID.Equals(NS_GET_IID(nsHyperTextAccessible))) {
*aInstancePtr = static_cast<nsHyperTextAccessible*>(this);
NS_ADDREF_THIS();
return NS_OK;
}
if (mRoleMapEntry &&
(mRoleMapEntry->role == nsIAccessibleRole::ROLE_GRAPHIC ||
- mRoleMapEntry->role == nsIAccessibleRole::ROLE_IMAGE_MAP)) {
+ mRoleMapEntry->role == nsIAccessibleRole::ROLE_IMAGE_MAP ||
+ mRoleMapEntry->role == nsIAccessibleRole::ROLE_SLIDER ||
+ mRoleMapEntry->role == nsIAccessibleRole::ROLE_PROGRESSBAR ||
+ mRoleMapEntry->role == nsIAccessibleRole::ROLE_SEPARATOR)) {
// ARIA roles that these interfaces are not appropriate for
return nsAccessible::QueryInterface(aIID, aInstancePtr);
}
if (aIID.Equals(NS_GET_IID(nsIAccessibleText))) {
*aInstancePtr = static_cast<nsIAccessibleText*>(this);
NS_ADDREF_THIS();
return NS_OK;
@@ -560,17 +563,20 @@ nsresult nsHyperTextAccessible::DOMPoint
PRInt32* aHyperTextOffset,
nsIAccessible **aFinalAccessible,
PRBool aIsEndOffset)
{
// Turn a DOM Node and offset into an offset into this hypertext.
// On failure, return null. On success, return the DOM node which contains the offset.
NS_ENSURE_ARG_POINTER(aHyperTextOffset);
*aHyperTextOffset = 0;
- NS_ENSURE_ARG_POINTER(aNode);
+
+ if (!aNode) {
+ return NS_ERROR_FAILURE;
+ }
if (aFinalAccessible) {
*aFinalAccessible = nsnull;
}
PRUint32 addTextOffset = 0;
nsCOMPtr<nsIDOMNode> findNode;
unsigned short nodeType;
@@ -614,16 +620,27 @@ nsresult nsHyperTextAccessible::DOMPoint
findNode = do_QueryInterface(parentContent); // Case #2: there are no children
}
}
// Get accessible for this findNode, or if that node isn't accessible, use the
// accessible for the next DOM node which has one (based on forward depth first search)
nsCOMPtr<nsIAccessible> descendantAccessible;
if (findNode) {
+ nsCOMPtr<nsIContent> findContent = do_QueryInterface(findNode);
+ if (findContent->IsNodeOfType(nsINode::eHTML) &&
+ findContent->NodeInfo()->Equals(nsAccessibilityAtoms::br)) {
+ nsIContent *parent = findContent->GetParent();
+ if (parent && parent->IsNativeAnonymous() && parent->GetChildCount() == 1) {
+ // This <br> is the only node in a text control, therefore it is the hacky
+ // "bogus node" used when there is no text in a control
+ *aHyperTextOffset = 0;
+ return NS_OK;
+ }
+ }
descendantAccessible = GetFirstAvailableAccessible(findNode);
}
// From the descendant, go up and get the immediate child of this hypertext
nsCOMPtr<nsIAccessible> childAccessible;
while (descendantAccessible) {
nsCOMPtr<nsIAccessible> parentAccessible;
descendantAccessible->GetParent(getter_AddRefs(parentAccessible));
if (this == parentAccessible) {
@@ -982,16 +999,23 @@ nsresult nsHyperTextAccessible::GetTextH
// For BOUNDARY_LINE_END, make sure we start of this line
startOffset = endOffset = finalStartOffset + (aBoundaryType == BOUNDARY_LINE_END);
nsCOMPtr<nsIAccessible> endAcc;
nsIFrame *endFrame = GetPosAndText(startOffset, endOffset, nsnull, nsnull,
nsnull, getter_AddRefs(endAcc));
if (!endFrame) {
return NS_ERROR_FAILURE;
}
+ if (endAcc && Role(endAcc) == nsIAccessibleRole::ROLE_STATICTEXT) {
+ // Static text like list bullets will ruin our forward calculation,
+ // since the caret cannot be in the static text. Start just after the static text.
+ startOffset = endOffset = finalStartOffset + (aBoundaryType == BOUNDARY_LINE_END) + TextLength(endAcc);
+ endFrame = GetPosAndText(startOffset, endOffset, nsnull, nsnull,
+ nsnull, getter_AddRefs(endAcc));
+ }
finalEndOffset = GetRelativeOffset(presShell, endFrame, endOffset, endAcc,
amount, eDirNext, needsStart);
NS_ENSURE_TRUE(endOffset >= 0, NS_ERROR_FAILURE);
if (finalEndOffset == aOffset) {
if (aType == eGetAt && amount == eSelectWord) {
// Fix word error for the first character in word: PeekOffset() will return the previous word when
// aOffset points to the first character of the word, but accessibility APIs want the current word
// that the first character is in
--- a/accessible/src/mac/nsRoleMap.h
+++ b/accessible/src/mac/nsRoleMap.h
@@ -47,17 +47,17 @@ static const NSString* AXRoles [] = {
NSAccessibilityMenuBarRole, // ROLE_MENUBAR. (irrelevant on OS X; the menubar will always be native and on the top of the screen.)
NSAccessibilityScrollBarRole, // ROLE_SCROLLBAR. we might need to make this its own mozAccessible, to support the children objects (valueindicator, down/up buttons).
NSAccessibilitySplitterRole, // ROLE_GRIP
NSAccessibilityUnknownRole, // ROLE_SOUND. unused on OS X
NSAccessibilityUnknownRole, // ROLE_CURSOR. unused on OS X
NSAccessibilityUnknownRole, // ROLE_CARET. unused on OS X
NSAccessibilityWindowRole, // ROLE_ALERT
NSAccessibilityWindowRole, // ROLE_WINDOW. irrelevant on OS X; all window a11y is handled by the system.
- @"AXWebArea", // ROLE_CLIENT
+ @"AXWebArea", // ROLE_INTERNAL_FRAME
NSAccessibilityMenuRole, // ROLE_MENUPOPUP. the parent of menuitems
NSAccessibilityMenuItemRole, // ROLE_MENUITEM.
@"AXHelpTag", // ROLE_TOOLTIP. 10.4+ only, so we re-define the constant.
NSAccessibilityGroupRole, // ROLE_APPLICATION. unused on OS X. the system will take care of this.
NSAccessibilityGroupRole, // ROLE_DOCUMENT
NSAccessibilityGroupRole, // ROLE_PANE
NSAccessibilityUnknownRole, // ROLE_CHART
NSAccessibilityWindowRole, // ROLE_DIALOG. there's a dialog subrole.
--- a/accessible/src/msaa/nsRoleMap.h
+++ b/accessible/src/msaa/nsRoleMap.h
@@ -90,18 +90,18 @@ static const WindowsRoleMapItem gWindows
{ ROLE_SYSTEM_CARET, ROLE_SYSTEM_CARET },
// nsIAccessibleRole::ROLE_ALERT
{ ROLE_SYSTEM_ALERT, ROLE_SYSTEM_ALERT },
// nsIAccessibleRole::ROLE_WINDOW
{ ROLE_SYSTEM_WINDOW, ROLE_SYSTEM_WINDOW },
- // nsIAccessibleRole::ROLE_CLIENT
- { USE_ROLE_STRING, IA2_ROLE_UNKNOWN},
+ // nsIAccessibleRole::ROLE_INTERNAL_FRAME
+ { USE_ROLE_STRING, IA2_ROLE_INTERNAL_FRAME},
// nsIAccessibleRole::ROLE_MENUPOPUP
{ ROLE_SYSTEM_MENUPOPUP, ROLE_SYSTEM_MENUPOPUP },
// nsIAccessibleRole::ROLE_MENUITEM
{ ROLE_SYSTEM_MENUITEM, ROLE_SYSTEM_MENUITEM },
// nsIAccessibleRole::ROLE_TOOLTIP
@@ -424,17 +424,17 @@ static const WindowsRoleMapItem gWindows
// nsIAccessibleRole::ROLE_IMAGE_MAP
{ ROLE_SYSTEM_GRAPHIC, ROLE_SYSTEM_GRAPHIC },
// nsIAccessibleRole::ROLE_OPTION
{ ROLE_SYSTEM_LISTITEM, ROLE_SYSTEM_LISTITEM },
// nsIAccessibleRole::ROLE_RICH_OPTION
- { ROLE_SYSTEM_LIST, ROLE_SYSTEM_LIST },
+ { ROLE_SYSTEM_LISTITEM, ROLE_SYSTEM_LISTITEM },
// nsIAccessibleRole::ROLE_LISTBOX
{ ROLE_SYSTEM_LIST, ROLE_SYSTEM_LIST },
// nsIAccessibleRole::ROLE_LAST_ENTRY
{ ROLE_WINDOWS_LAST_ENTRY, ROLE_WINDOWS_LAST_ENTRY }
};
--- a/accessible/src/xforms/nsXFormsFormControlsAccessible.cpp
+++ b/accessible/src/xforms/nsXFormsFormControlsAccessible.cpp
@@ -46,17 +46,17 @@ nsXFormsLabelAccessible::
{
}
NS_IMETHODIMP
nsXFormsLabelAccessible::GetRole(PRUint32 *aRole)
{
NS_ENSURE_ARG_POINTER(aRole);
- *aRole = nsIAccessibleRole::ROLE_STATICTEXT;
+ *aRole = nsIAccessibleRole::ROLE_LABEL;
return NS_OK;
}
NS_IMETHODIMP
nsXFormsLabelAccessible::GetName(nsAString& aName)
{
nsAutoString name;
nsresult rv = GetTextFromRelationID(nsAccessibilityAtoms::aria_labelledby, name);
--- a/accessible/src/xul/nsXULAlertAccessible.cpp
+++ b/accessible/src/xul/nsXULAlertAccessible.cpp
@@ -59,8 +59,16 @@ nsXULAlertAccessible::GetState(PRUint32
nsresult rv = nsAccessible::GetState(aState, aExtraState);
NS_ENSURE_SUCCESS(rv, rv);
if (mDOMNode) {
*aState |= nsIAccessibleStates::STATE_ALERT_MEDIUM; // XUL has no markup for low, medium or high
}
return NS_OK;
}
+NS_IMETHODIMP
+nsXULAlertAccessible::GetName(nsAString& aName)
+{
+ // Screen readers need to read contents of alert, not the accessible name.
+ // If we have both some screen readers will read the alert twice.
+ aName.Truncate();
+ return NS_OK;
+}
--- a/accessible/src/xul/nsXULAlertAccessible.h
+++ b/accessible/src/xul/nsXULAlertAccessible.h
@@ -45,11 +45,12 @@
class nsXULAlertAccessible : public nsAccessibleWrap
{
public:
nsXULAlertAccessible(nsIDOMNode* aNode, nsIWeakReference* aShell);
NS_DECL_ISUPPORTS_INHERITED
NS_IMETHOD GetRole(PRUint32 *aRole);
NS_IMETHOD GetState(PRUint32 *aState, PRUint32 *aExtraState);
+ NS_IMETHOD GetName(nsAString& aName);
};
#endif
--- a/accessible/src/xul/nsXULMenuAccessible.cpp
+++ b/accessible/src/xul/nsXULMenuAccessible.cpp
@@ -481,17 +481,19 @@ nsXULMenuitemAccessible::GetDefaultKeyBi
NS_IMETHODIMP nsXULMenuitemAccessible::GetRole(PRUint32 *aRole)
{
nsCOMPtr<nsIDOMXULContainerElement> xulContainer(do_QueryInterface(mDOMNode));
if (xulContainer) {
*aRole = nsIAccessibleRole::ROLE_PARENT_MENUITEM;
return NS_OK;
}
- if (mParent && Role(mParent) == nsIAccessibleRole::ROLE_COMBOBOX_LIST) {
+ nsCOMPtr<nsIAccessible> parent;
+ GetParent(getter_AddRefs(parent));
+ if (parent && Role(parent) == nsIAccessibleRole::ROLE_COMBOBOX_LIST) {
*aRole = nsIAccessibleRole::ROLE_COMBOBOX_OPTION;
return NS_OK;
}
*aRole = nsIAccessibleRole::ROLE_MENUITEM;
nsCOMPtr<nsIDOMElement> element(do_QueryInterface(mDOMNode));
if (!element)
return NS_ERROR_FAILURE;
@@ -711,24 +713,28 @@ nsXULMenupopupAccessible::GetName(nsAStr
}
NS_IMETHODIMP nsXULMenupopupAccessible::GetRole(PRUint32 *aRole)
{
nsCOMPtr<nsIContent> content(do_QueryInterface(mDOMNode));
if (!content) {
return NS_ERROR_FAILURE;
}
- if ((mParent && Role(mParent) == nsIAccessibleRole::ROLE_COMBOBOX) ||
- content->AttrValueIs(kNameSpaceID_None, nsAccessibilityAtoms::type,
- nsAccessibilityAtoms::autocomplete, eIgnoreCase)) {
- *aRole = nsIAccessibleRole::ROLE_COMBOBOX_LIST;
+ nsCOMPtr<nsIAccessible> parent;
+ GetParent(getter_AddRefs(parent));
+ if (parent) {
+ // Some widgets like the search bar have several popups, owned by buttons
+ PRUint32 role = Role(parent);
+ if (role == nsIAccessibleRole::ROLE_COMBOBOX ||
+ role == nsIAccessibleRole::ROLE_PUSHBUTTON) {
+ *aRole = nsIAccessibleRole::ROLE_COMBOBOX_LIST;
+ return NS_OK;
+ }
}
- else {
- *aRole = nsIAccessibleRole::ROLE_MENUPOPUP;
- }
+ *aRole = nsIAccessibleRole::ROLE_MENUPOPUP;
return NS_OK;
}
// ------------------------ Menu Bar -----------------------------
nsXULMenubarAccessible::nsXULMenubarAccessible(nsIDOMNode* aDOMNode, nsIWeakReference* aShell):
nsAccessibleWrap(aDOMNode, aShell)
{
--- a/accessible/src/xul/nsXULSelectAccessible.cpp
+++ b/accessible/src/xul/nsXULSelectAccessible.cpp
@@ -36,16 +36,17 @@
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
#include "nsXULSelectAccessible.h"
#include "nsAccessibilityService.h"
#include "nsIContent.h"
#include "nsIDOMXULMenuListElement.h"
+#include "nsIDOMXULPopupElement.h"
#include "nsIDOMXULSelectCntrlItemEl.h"
#include "nsIDOMXULSelectCntrlEl.h"
#include "nsIDOMXULTextboxElement.h"
#include "nsIPresShell.h"
#include "nsIServiceManager.h"
#include "nsCaseTreatment.h"
////////////////////////////////////////////////////////////////////////////////
@@ -189,19 +190,30 @@ NS_IMETHODIMP nsXULListboxAccessible::Ge
nsCOMPtr<nsIDOMXULSelectControlItemElement> selectedItem;
select->GetSelectedItem(getter_AddRefs(selectedItem));
if (selectedItem)
return selectedItem->GetLabel(_retval);
}
return NS_ERROR_FAILURE;
}
-NS_IMETHODIMP nsXULListboxAccessible::GetRole(PRUint32 *_retval)
+NS_IMETHODIMP nsXULListboxAccessible::GetRole(PRUint32 *aRole)
{
- *_retval = nsIAccessibleRole::ROLE_LIST;
+ nsCOMPtr<nsIContent> content = do_QueryInterface(mDOMNode);
+ if (content) {
+ // A richlistbox is used with the new autocomplete URL bar,
+ // and has a parent popup <panel>
+ nsCOMPtr<nsIDOMXULPopupElement> xulPopup =
+ do_QueryInterface(content->GetParent());
+ if (xulPopup) {
+ *aRole = nsIAccessibleRole::ROLE_COMBOBOX_LIST;
+ return NS_OK;
+ }
+ }
+ *aRole = nsIAccessibleRole::ROLE_LIST;
return NS_OK;
}
/** ----- nsXULListitemAccessible ----- */
/** Constructor */
nsXULListitemAccessible::nsXULListitemAccessible(nsIDOMNode* aDOMNode, nsIWeakReference* aShell):
nsXULMenuitemAccessible(aDOMNode, aShell)
@@ -245,16 +257,18 @@ NS_IMETHODIMP nsXULListitemAccessible::G
/**
*
*/
NS_IMETHODIMP nsXULListitemAccessible::GetRole(PRUint32 *aRole)
{
if (mIsCheckbox)
*aRole = nsIAccessibleRole::ROLE_CHECKBUTTON;
+ else if (mParent && Role(mParent) == nsIAccessibleRole::ROLE_COMBOBOX_LIST)
+ *aRole = nsIAccessibleRole::ROLE_COMBOBOX_OPTION;
else
*aRole = nsIAccessibleRole::ROLE_RICH_OPTION;
return NS_OK;
}
/**
*
*/
--- a/accessible/src/xul/nsXULTextAccessible.cpp
+++ b/accessible/src/xul/nsXULTextAccessible.cpp
@@ -56,23 +56,19 @@ nsHyperTextAccessibleWrap(aDomNode, aShe
/* wstring getName (); */
NS_IMETHODIMP nsXULTextAccessible::GetName(nsAString& aName)
{
nsCOMPtr<nsIContent> content(do_QueryInterface(mDOMNode));
if (!content) {
return NS_ERROR_FAILURE; // Node shut down
}
- if (!content->GetAttr(kNameSpaceID_None, nsAccessibilityAtoms::value,
- aName)) {
- // if the value doesn't exist, flatten the inner content as the name (for descriptions)
- return AppendFlatStringFromSubtree(content, &aName);
- }
- // otherwise, use the value attribute as the name (for labels)
- return NS_OK;
+ // if the value attr doesn't exist, the screen reader must get the accessible text
+ // from the accessible text interface or from the children
+ return content->GetAttr(kNameSpaceID_None, nsAccessibilityAtoms::value, aName);
}
NS_IMETHODIMP
nsXULTextAccessible::GetState(PRUint32 *aState, PRUint32 *aExtraState)
{
nsresult rv = nsHyperTextAccessibleWrap::GetState(aState, aExtraState);
NS_ENSURE_SUCCESS(rv, rv);
@@ -171,23 +167,19 @@ NS_IMETHODIMP nsXULLinkAccessible::GetNa
return AppendFlatStringFromSubtree(content, &aName);
}
// otherwise, use the value attribute as the name (for labels)
return NS_OK;
}
NS_IMETHODIMP nsXULLinkAccessible::GetRole(PRUint32 *aRole)
{
- if (mIsLink) {
- *aRole = nsIAccessibleRole::ROLE_LINK;
- } else {
- // default to calling the link a button; might have javascript
- *aRole = nsIAccessibleRole::ROLE_PUSHBUTTON;
- }
- // should there be a third case where it becomes just text?
+ // We used to say ROLE_BUTTON if there was no href, but then screen readers
+ // would tell users to hit the space bar for activation, which is wrong for a link
+ *aRole = nsIAccessibleRole::ROLE_LINK;
return NS_OK;
}
void nsXULLinkAccessible::CacheActionContent()
{
// not a link if no content
nsCOMPtr<nsIContent> mTempContent = do_QueryInterface(mDOMNode);
if (!mTempContent) {
--- a/accessible/src/xul/nsXULTreeAccessible.cpp
+++ b/accessible/src/xul/nsXULTreeAccessible.cpp
@@ -558,19 +558,21 @@ nsXULTreeAccessible::GetCachedTreeitemAc
// invalidateCache(in PRInt32 aRow, in PRInt32 aCount)
NS_IMETHODIMP
nsXULTreeAccessible::InvalidateCache(PRInt32 aRow, PRInt32 aCount)
{
// Do not invalidate the cache if rows have been inserted.
if (aCount > 0)
return NS_OK;
+ NS_ENSURE_TRUE(mTree && mTreeView, NS_ERROR_FAILURE);
+
nsCOMPtr<nsITreeColumns> cols;
nsresult rv = mTree->GetColumns(getter_AddRefs(cols));
- NS_ENSURE_SUCCESS(rv, rv);
+ NS_ENSURE_STATE(cols);
#ifdef MOZ_ACCESSIBILITY_ATK
PRInt32 colsCount = 0;
rv = cols->GetCount(&colsCount);
NS_ENSURE_SUCCESS(rv, rv);
#else
nsCOMPtr<nsITreeColumn> col;
rv = cols->GetKeyColumn(getter_AddRefs(col));
@@ -592,17 +594,17 @@ nsXULTreeAccessible::InvalidateCache(PRI
nsCOMPtr<nsIAccessNode> accessNode;
GetCacheEntry(*mAccessNodeCache, key, getter_AddRefs(accessNode));
if (accessNode) {
nsCOMPtr<nsIAccessible> accessible(do_QueryInterface(accessNode));
nsCOMPtr<nsIAccessibleEvent> event =
new nsAccEvent(nsIAccessibleEvent::EVENT_DOM_DESTROY,
- accessible, nsnull, PR_FALSE);
+ accessible, PR_FALSE);
FireAccessibleEvent(event);
mAccessNodeCache->Remove(key);
}
}
}
PRInt32 newRowCount = 0;
--- a/browser/app/Makefile.in
+++ b/browser/app/Makefile.in
@@ -313,20 +313,17 @@ libs:: $(ICON_FILES)
$(INSTALL) $^ $(DIST)/bin/icons
install::
$(SYSINSTALL) $(IFLAGS1) $(ICON_FILES) $(DESTDIR)$(mozappdir)/icons
endif
ifeq ($(MOZ_WIDGET_TOOLKIT),gtk2)
libs::
- $(INSTALL) $(DIST)/branding/default.xpm $(DIST)/bin/chrome/icons/default
-
-install::
- $(SYSINSTALL) $(IFLAGS1) $(DIST)/branding/default.xpm $(DESTDIR)$(mozappdir)/chrome/icons/default
+ $(INSTALL) $(DIST)/branding/default16.png $(DIST)/bin/chrome/icons/default
endif
export::
ifndef MOZ_BRANDING_DIRECTORY
$(NSINSTALL) -D $(DIST)/branding
ifeq ($(OS_ARCH),WINNT)
cp $(srcdir)/firefox.ico $(DIST)/branding/firefox.ico
cp $(srcdir)/firefox.ico $(DIST)/branding/app.ico
@@ -342,17 +339,17 @@ ifneq (,$(filter mac cocoa,$(MOZ_WIDGET_
endif
ifneq (,$(filter gtk2,$(MOZ_WIDGET_TOOLKIT)))
cp $(srcdir)/mozicon128.png $(DIST)/branding/mozicon128.png
cp $(srcdir)/mozicon16.xpm $(DIST)/branding/mozicon16.xpm
cp $(srcdir)/mozicon50.xpm $(DIST)/branding/mozicon50.xpm
cp $(srcdir)/document.png $(DIST)/branding/document.png
endif
ifeq ($(MOZ_WIDGET_TOOLKIT),gtk2)
- cp $(srcdir)/default.xpm $(DIST)/branding/default.xpm
+ cp $(srcdir)/default16.png $(DIST)/branding/default16.png
endif
ifeq ($(OS_ARCH),OS2)
cp $(srcdir)/firefox-os2.ico $(DIST)/branding/firefox.ico
cp $(srcdir)/firefox-os2.ico $(DIST)/branding/app.ico
cp $(srcdir)/document-os2.ico $(DIST)/branding/document.ico
endif
endif
@@ -375,16 +372,19 @@ clean clobber repackage::
rm -rf $(DIST)/$(APP_NAME).app
ifdef LIBXUL_SDK
APPFILES = Resources
else
APPFILES = MacOS
endif
+libs:: $(srcdir)/profile/prefs.js
+ $(INSTALL) $^ $(DIST)/bin/defaults/profile
+
libs repackage:: $(PROGRAM) application.ini
mkdir -p $(DIST)/$(APP_NAME).app/Contents/MacOS
rsync -a --exclude CVS --exclude "*.in" $(srcdir)/macbuild/Contents $(DIST)/$(APP_NAME).app --exclude English.lproj
mkdir -p $(DIST)/$(APP_NAME).app/Contents/Resources/$(AB).lproj
rsync -a --exclude CVS --exclude "*.in" $(srcdir)/macbuild/Contents/Resources/English.lproj/ $(DIST)/$(APP_NAME).app/Contents/Resources/$(AB).lproj
sed -e "s/%APP_VERSION%/$(APP_VERSION)/" -e "s/%APP_NAME%/$(APP_NAME)/" $(srcdir)/macbuild/Contents/Info.plist.in > $(DIST)/$(APP_NAME).app/Contents/Info.plist
sed -e "s/%APP_VERSION%/$(APP_VERSION)/" -e "s/%APP_NAME%/$(APP_NAME)/" $(srcdir)/macbuild/Contents/Resources/English.lproj/InfoPlist.strings.in | iconv -f UTF-8 -t UTF-16 > $(DIST)/$(APP_NAME).app/Contents/Resources/$(AB).lproj/InfoPlist.strings
rsync -a $(DIST)/bin/ $(DIST)/$(APP_NAME).app/Contents/$(APPFILES)
@@ -414,22 +414,16 @@ endif
libs::
ifeq ($(OS_ARCH),WINNT)
$(PERL) -pe 's/(?<!\r)\n/\r\n/g;' < $(topsrcdir)/LICENSE > $(DIST)/bin/LICENSE
else
$(INSTALL) $(topsrcdir)/LICENSE $(DIST)/bin
endif
-libs:: $(srcdir)/profile/prefs.js
- $(INSTALL) $^ $(DIST)/bin/defaults/profile
-
-install:: $(srcdir)/profile/prefs.js
- $(SYSINSTALL) $(IFLAGS1) $^ $(DESTDIR)$(mozappdir)/defaults/profile
-
ifdef LIBXUL_SDK
ifndef SKIP_COPY_XULRUNNER
libs::
ifeq (cocoa,$(MOZ_WIDGET_TOOLKIT))
rsync -a --copy-unsafe-links $(LIBXUL_DIST)/XUL.framework $(DIST)/$(APP_NAME).app/Contents/Frameworks
else
$(NSINSTALL) -D $(DIST)/bin/xulrunner
(cd $(LIBXUL_SDK)/bin && tar $(TAR_CREATE_FLAGS) - .) | (cd $(DIST)/bin/xulrunner && tar -xf -)
deleted file mode 100644
--- a/browser/app/default.xpm
+++ /dev/null
@@ -1,1144 +0,0 @@
-/* XPM */
-static char * mozicon50_xpm[] = {
-"48 48 1093 2",
-" c None",
-". c #2099CF",
-"+ c #2CA7D9",
-"@ c #33AEDD",
-"# c #34B2E1",
-"$ c #35B8E5",
-"% c #2FBAE8",
-"& c #26B5E4",
-"* c #199FD6",
-"= c #177DB8",
-"- c #2C8FC4",
-"; c #43A0CE",
-"> c #55ADD6",
-", c #5CB5DD",
-"' c #61C4E8",
-") c #63CBED",
-"! c #64CFF1",
-"~ c #63D1F2",
-"{ c #5ECCEF",
-"] c #57C3E9",
-"^ c #4EB8E1",
-"/ c #3CABD9",
-"( c #2A9ED1",
-"_ c #1991C9",
-": c #0F7CBA",
-"< c #166EAC",
-"[ c #3387BC",
-"} c #4797C6",
-"| c #51A0CC",
-"1 c #56A7D2",
-"2 c #5BAED7",
-"3 c #60B6DD",
-"4 c #67CDEE",
-"5 c #69D3F2",
-"6 c #6BD4F4",
-"7 c #69D3F4",
-"8 c #63CDEF",
-"9 c #5AC0E6",
-"0 c #51B6DF",
-"a c #49ACD8",
-"b c #42A2D1",
-"c c #3898CA",
-"d c #298CC2",
-"e c #167EB9",
-"f c #0B5A9C",
-"g c #2674AE",
-"h c #3D87BA",
-"i c #4590C0",
-"j c #4B97C6",
-"k c #519FCB",
-"l c #58A6D1",
-"m c #5DADD5",
-"n c #62B3DA",
-"o c #69C3E6",
-"p c #6ED4F2",
-"q c #6FD6F4",
-"r c #6ED5F4",
-"s c #6AD3F2",
-"t c #5FC3E7",
-"u c #53B2DC",
-"v c #4BA8D5",
-"w c #439FCE",
-"x c #3B95C7",
-"y c #338BC0",
-"z c #2B82B9",
-"A c #1D76B1",
-"B c #0C69A9",
-"C c #10599A",
-"D c #2D71AA",
-"E c #377CB2",
-"F c #3D84B8",
-"G c #458DBE",
-"H c #4B95C4",
-"I c #529CC9",
-"J c #59A4CF",
-"K c #5FABD4",
-"L c #65B1D8",
-"M c #6BC2E4",
-"N c #71D5F3",
-"O c #73D6F3",
-"P c #72D5F3",
-"Q c #6DD1F0",
-"R c #5FBBE2",
-"S c #54ADD8",
-"T c #4CA4D2",
-"U c #439ACB",
-"V c #3B91C4",
-"W c #3487BD",
-"X c #2D7EB7",
-"Y c #2675AF",
-"Z c #1E6CA9",
-"` c #0F5FA0",
-" . c #055296",
-".. c #115394",
-"+. c #2767A2",
-"@. c #2F70A9",
-"#. c #3679AF",
-"$. c #3C81B5",
-"%. c #448ABC",
-"&. c #4A92C2",
-"*. c #519AC7",
-"=. c #58A2CD",
-"-. c #5FA9D2",
-";. c #65B0D7",
-">. c #6EC8E9",
-",. c #74D4F2",
-"'. c #76D6F3",
-"). c #75D6F3",
-"!. c #71D3F1",
-"~. c #62BCE1",
-"{. c #54A9D5",
-"]. c #4C9FCE",
-"^. c #4396C8",
-"/. c #3B8CC1",
-"(. c #3483BA",
-"_. c #2C7AB3",
-":. c #2670AC",
-"<. c #1F68A6",
-"[. c #195F9F",
-"}. c #0D5497",
-"|. c #04488D",
-"1. c #0F4A8D",
-"2. c #1F5A98",
-"3. c #2663A0",
-"4. c #2D6DA6",
-"5. c #3475AD",
-"6. c #3B7EB3",
-"7. c #4287B9",
-"8. c #4990C1",
-"9. c #51A4CF",
-"0. c #569FCA",
-"a. c #5DA6CF",
-"b. c #66B5DB",
-"c. c #6FD1F0",
-"d. c #75D4F1",
-"e. c #79D5F2",
-"f. c #75D3F1",
-"g. c #63BBE0",
-"h. c #54A4D1",
-"i. c #4B9BCB",
-"j. c #4391C4",
-"k. c #3B88BD",
-"l. c #337FB6",
-"m. c #2C76B0",
-"n. c #266CA9",
-"o. c #1F64A3",
-"p. c #1A5B9C",
-"q. c #145396",
-"r. c #0A498E",
-"s. c #034C8F",
-"t. c #085293",
-"u. c #164D8E",
-"v. c #1D5695",
-"w. c #24609C",
-"x. c #2A69A3",
-"y. c #3271AA",
-"z. c #387AAF",
-"A. c #429FCC",
-"B. c #4CBFE4",
-"C. c #52C4E8",
-"D. c #57AFD7",
-"E. c #5DB3DA",
-"F. c #65C5E7",
-"G. c #6DD0EE",
-"H. c #72D2EF",
-"I. c #78D4F0",
-"J. c #7BD5F1",
-"K. c #76D2EF",
-"L. c #6AC5E6",
-"M. c #55A5D1",
-"N. c #4A95C6",
-"O. c #428CC0",
-"P. c #3A83B9",
-"Q. c #337AB3",
-"R. c #2C71AD",
-"S. c #2568A6",
-"T. c #1F5F9F",
-"U. c #1D65A3",
-"V. c #269ACA",
-"W. c #1C84BA",
-"X. c #0D7DB5",
-"Y. c #0298CC",
-"Z. c #0296CA",
-"`. c #0C5998",
-" + c #14498A",
-".+ c #1B609C",
-"++ c #2498C8",
-"@+ c #2977AF",
-"#+ c #2F75AC",
-"$+ c #3575AC",
-"%+ c #40ABD5",
-"&+ c #49BFE4",
-"*+ c #50C3E7",
-"=+ c #56C5E8",
-"-+ c #5DC8EA",
-";+ c #63CBEB",
-">+ c #69CEED",
-",+ c #6ED0EE",
-"'+ c #73D2EF",
-")+ c #77D3EF",
-"!+ c #72CEEC",
-"~+ c #5AA7D1",
-"{+ c #4F99C9",
-"]+ c #4891C3",
-"^+ c #4087BC",
-"/+ c #387EB5",
-"(+ c #3277B1",
-"_+ c #2B70AB",
-":+ c #2463A2",
-"<+ c #1E5B9C",
-"[+ c #185395",
-"}+ c #165496",
-"|+ c #10498D",
-"1+ c #105F9E",
-"2+ c #0A9ECF",
-"3+ c #0088C0",
-"4+ c #038DC3",
-"5+ c #0A4A8C",
-"6+ c #114E8E",
-"7+ c #1989BD",
-"8+ c #22AAD7",
-"9+ c #28A2D0",
-"0+ c #2C71A9",
-"a+ c #3380B5",
-"b+ c #3EB9E1",
-"c+ c #45BDE3",
-"d+ c #4CC0E5",
-"e+ c #53C3E7",
-"f+ c #59C6E8",
-"g+ c #5EC9EA",
-"h+ c #64CBEB",
-"i+ c #69CDEC",
-"j+ c #6ECFED",
-"k+ c #70D0ED",
-"l+ c #64BDE1",
-"m+ c #55A6D1",
-"n+ c #3D82B8",
-"o+ c #3D8BBE",
-"p+ c #49AFD8",
-"q+ c #378DBF",
-"r+ c #225F9E",
-"s+ c #1D5698",
-"t+ c #174E92",
-"u+ c #12468B",
-"v+ c #0E3F85",
-"w+ c #115F9D",
-"x+ c #15A2D1",
-"y+ c #0395C9",
-"z+ c #0088C1",
-"A+ c #0190C6",
-"B+ c #079ACC",
-"C+ c #0FA0D0",
-"D+ c #169ECF",
-"E+ c #1D99CC",
-"F+ c #25AAD7",
-"G+ c #2BA0CE",
-"H+ c #32AED8",
-"I+ c #3AB7DF",
-"J+ c #41BBE1",
-"K+ c #47BEE3",
-"L+ c #4EC1E5",
-"M+ c #53C4E7",
-"N+ c #5FC8E9",
-"O+ c #63CAEA",
-"P+ c #67CBEB",
-"Q+ c #69CBEA",
-"R+ c #62BCE0",
-"S+ c #5AAFD7",
-"T+ c #478DBF",
-"U+ c #4084B9",
-"V+ c #3A7CB4",
-"W+ c #3E8CBF",
-"X+ c #4DBADF",
-"Y+ c #3383B8",
-"Z+ c #215B9B",
-"`+ c #1B5295",
-" @ c #164A8E",
-".@ c #114288",
-"+@ c #0D3A82",
-"@@ c #0E4C8E",
-"#@ c #1380B7",
-"$@ c #0D96C9",
-"%@ c #0089C1",
-"&@ c #007BB8",
-"*@ c #0085BE",
-"=@ c #008CC4",
-"-@ c #0496C9",
-";@ c #0B9DCF",
-">@ c #1168AB",
-",@ c #174F99",
-"'@ c #21AAD7",
-")@ c #28AED9",
-"!@ c #2FB1DB",
-"~@ c #36B5DE",
-"{@ c #3CB8E0",
-"]@ c #42BBE2",
-"^@ c #49BEE4",
-"/@ c #54C3E6",
-"(@ c #59C5E7",
-"_@ c #5DC7E8",
-":@ c #5FC5E7",
-"<@ c #53A9D3",
-"[@ c #4B96C6",
-"}@ c #478FC2",
-"|@ c #4186BB",
-"1@ c #3C7FB5",
-"2@ c #3676AF",
-"3@ c #306EA9",
-"4@ c #3889BD",
-"5@ c #44AFD8",
-"6@ c #2F84B9",
-"7@ c #194D91",
-"8@ c #15458A",
-"9@ c #144D90",
-"0@ c #0C367E",
-"a@ c #0C4086",
-"b@ c #1797C8",
-"c@ c #1295C8",
-"d@ c #0487C0",
-"e@ c #0079B6",
-"f@ c #0081BC",
-"g@ c #0E9ACC",
-"h@ c #1597CA",
-"i@ c #1CA7D5",
-"j@ c #23ABD8",
-"k@ c #2AAFDA",
-"l@ c #31B2DC",
-"m@ c #37B5DE",
-"n@ c #3DB8E0",
-"o@ c #43BBE2",
-"p@ c #49BEE3",
-"q@ c #4EC0E4",
-"r@ c #53C2E5",
-"s@ c #57C4E6",
-"t@ c #4EAAD4",
-"u@ c #4696C5",
-"v@ c #438FC0",
-"w@ c #4088BC",
-"x@ c #3C80B6",
-"y@ c #3778B1",
-"z@ c #3270AB",
-"A@ c #2C68A5",
-"B@ c #3D9AC8",
-"C@ c #46BADF",
-"D@ c #3DB0D8",
-"E@ c #287CB2",
-"F@ c #164D90",
-"G@ c #299ECC",
-"H@ c #1B79B0",
-"I@ c #1A8CBF",
-"J@ c #199BCC",
-"K@ c #1392C6",
-"L@ c #0A86BE",
-"M@ c #0079B7",
-"N@ c #006AAC",
-"O@ c #0074B3",
-"P@ c #007CB9",
-"Q@ c #0083BE",
-"R@ c #008BC2",
-"S@ c #0393C8",
-"T@ c #099CCD",
-"U@ c #10A1D1",
-"V@ c #17A4D3",
-"W@ c #1EA8D6",
-"X@ c #25ABD8",
-"Y@ c #2BAFDA",
-"Z@ c #37B5DD",
-"`@ c #3DB8DF",
-" # c #42BAE1",
-".# c #48BCE2",
-"+# c #4CBEE3",
-"@# c #50C0E4",
-"## c #48A8D3",
-"$# c #3F8EC0",
-"%# c #3C87BC",
-"&# c #3A81B7",
-"*# c #3679B1",
-"=# c #3171AC",
-"-# c #2D6AA6",
-";# c #2862A0",
-"># c #40A5D1",
-",# c #43B8DE",
-"'# c #3DB5DC",
-")# c #38B1DA",
-"!# c #2D9ECC",
-"~# c #2B9FCE",
-"{# c #246AAA",
-"]# c #1F96C7",
-"^# c #1996C9",
-"/# c #138DC3",
-"(# c #0E84BC",
-"_# c #0175B4",
-":# c #0068AC",
-"<# c #0070B1",
-"[# c #0077B5",
-"}# c #007FBA",
-"|# c #0086BF",
-"1# c #018DC4",
-"2# c #0596C9",
-"3# c #0B9DCE",
-"4# c #12A1D1",
-"5# c #1897C8",
-"6# c #1E96C7",
-"7# c #25A0CE",
-"8# c #2B90C2",
-"9# c #31A4D0",
-"0# c #37B4DD",
-"a# c #3CB7DF",
-"b# c #41B9E0",
-"c# c #45BBE0",
-"d# c #49BCE1",
-"e# c #4BBBE0",
-"f# c #419FCC",
-"g# c #3C91C2",
-"h# c #337AB1",
-"i# c #3072AC",
-"j# c #2C6BA7",
-"k# c #2864A1",
-"l# c #255F9E",
-"m# c #3FAAD4",
-"n# c #40B6DC",
-"o# c #3AB3DB",
-"p# c #35B0D8",
-"q# c #2F86BD",
-"r# c #29599F",
-"s# c #237DB7",
-"t# c #1E99CA",
-"u# c #1892C5",
-"v# c #1389C0",
-"w# c #0E7FBA",
-"x# c #0473B2",
-"y# c #0065AA",
-"z# c #0064A9",
-"A# c #006BAD",
-"B# c #0072B2",
-"C# c #0080BC",
-"D# c #0082BC",
-"E# c #028DC4",
-"F# c #0796C9",
-"G# c #0D88BD",
-"H# c #1372AB",
-"I# c #1982B8",
-"J# c #1F79B0",
-"K# c #247BB1",
-"L# c #2A86B9",
-"M# c #31B1DA",
-"N# c #36B3DC",
-"O# c #3AB5DD",
-"P# c #3FB7DE",
-"Q# c #42B9DF",
-"R# c #45BAE0",
-"S# c #48BBE0",
-"T# c #47B6DD",
-"U# c #3689BC",
-"V# c #2D72AB",
-"W# c #2C73AC",
-"X# c #2F7DB3",
-"Y# c #399BC9",
-"Z# c #3FB4DB",
-"`# c #3CB3DA",
-" $ c #37B0D9",
-".$ c #32AED7",
-"+$ c #2CA8D3",
-"@$ c #277EB8",
-"#$ c #229CCC",
-"$$ c #1D95C8",
-"%$ c #188DC2",
-"&$ c #1384BD",
-"*$ c #0D7AB6",
-"=$ c #066FB0",
-"-$ c #0057A0",
-";$ c #005FA5",
-">$ c #0066AA",
-",$ c #006DAF",
-"'$ c #006EAC",
-")$ c #004C8E",
-"!$ c #005595",
-"~$ c #025999",
-"{$ c #085D9B",
-"]$ c #0D64A0",
-"^$ c #1369A4",
-"/$ c #196EA7",
-"($ c #1E73AA",
-"_$ c #2376AD",
-":$ c #2AA0CE",
-"<$ c #2FAFD9",
-"[$ c #34B1DB",
-"}$ c #38B3DC",
-"|$ c #3BB5DC",
-"1$ c #3EB6DD",
-"2$ c #40B7DD",
-"3$ c #42B7DD",
-"4$ c #43B7DE",
-"5$ c #43B7DD",
-"6$ c #40B5DC",
-"7$ c #3DB4DB",
-"8$ c #3AB2DA",
-"9$ c #33AED6",
-"0$ c #2EABD5",
-"a$ c #29A5D2",
-"b$ c #259ECD",
-"c$ c #2094C6",
-"d$ c #1C8DC2",
-"e$ c #1787BE",
-"f$ c #127EB9",
-"g$ c #0D75B3",
-"h$ c #076AAC",
-"i$ c #005FA6",
-"j$ c #00539D",
-"k$ c #005AA2",
-"l$ c #0060A6",
-"m$ c #0068AB",
-"n$ c #0063A5",
-"o$ c #004487",
-"p$ c #004386",
-"q$ c #004789",
-"r$ c #004B8D",
-"s$ c #045192",
-"t$ c #095997",
-"u$ c #0E5F9C",
-"v$ c #1365A0",
-"w$ c #1869A4",
-"x$ c #1D6EA7",
-"y$ c #2274AB",
-"z$ c #28A6D2",
-"A$ c #2DAED8",
-"B$ c #31AFD9",
-"C$ c #34B1DA",
-"D$ c #37B2DB",
-"E$ c #39B3DB",
-"F$ c #3BB4DB",
-"G$ c #3CB4DB",
-"H$ c #3BB3DA",
-"I$ c #38B1D9",
-"J$ c #35AFD8",
-"K$ c #32ADD6",
-"L$ c #2EAAD4",
-"M$ c #2BA5D1",
-"N$ c #2795C5",
-"O$ c #2374AA",
-"P$ c #1E5691",
-"Q$ c #1A4C89",
-"R$ c #156AA5",
-"S$ c #1078B5",
-"T$ c #0B6FAF",
-"U$ c #0665A9",
-"V$ c #004A97",
-"W$ c #004D9A",
-"X$ c #00509A",
-"Y$ c #00579F",
-"Z$ c #0062A7",
-"`$ c #00468A",
-" % c #00387C",
-".% c #003C7F",
-"+% c #004083",
-"@% c #044D8E",
-"#% c #095493",
-"$% c #0E5A98",
-"%% c #13609C",
-"&% c #18659F",
-"*% c #1C6BA4",
-"=% c #219FCD",
-"-% c #25AAD5",
-";% c #29ABD6",
-">% c #2DADD7",
-",% c #30AED8",
-"'% c #32AFD8",
-")% c #34B0D8",
-"!% c #34AED7",
-"~% c #30ABD4",
-"{% c #2DA8D2",
-"]% c #2BA3CF",
-"^% c #289DCC",
-"/% c #2494C5",
-"(% c #20659E",
-"_% c #1C4684",
-":% c #183D7C",
-"<% c #133B7A",
-"[% c #0F5695",
-"}% c #0A5FA1",
-"|% c #055FA5",
-"1% c #00559F",
-"2% c #004D99",
-"3% c #004896",
-"4% c #002E74",
-"5% c #003C82",
-"6% c #004E94",
-"7% c #003377",
-"8% c #003175",
-"9% c #003578",
-"0% c #003B7F",
-"a% c #003F82",
-"b% c #014285",
-"c% c #044889",
-"d% c #094E8E",
-"e% c #0D5493",
-"f% c #125997",
-"g% c #167FB4",
-"h% c #1A96C7",
-"i% c #1EA5D2",
-"j% c #22A7D3",
-"k% c #25A9D4",
-"l% c #28AAD5",
-"m% c #2AAAD5",
-"n% c #2CABD6",
-"o% c #2DACD6",
-"p% c #2EACD5",
-"q% c #2DA9D3",
-"r% c #2CA6D1",
-"s% c #299FCD",
-"t% c #279ACA",
-"u% c #2495C7",
-"v% c #218FC3",
-"w% c #1D86BC",
-"x% c #1A4683",
-"y% c #163574",
-"z% c #112C6C",
-"A% c #0D2464",
-"B% c #082D6F",
-"C% c #044E94",
-"D% c #004F9A",
-"E% c #004292",
-"F% c #00347D",
-"G% c #002266",
-"H% c #002669",
-"I% c #00286C",
-"J% c #002B6F",
-"K% c #002E72",
-"L% c #003478",
-"M% c #00377B",
-"N% c #003A7E",
-"O% c #013D80",
-"P% c #044285",
-"Q% c #084889",
-"R% c #0D4D8D",
-"S% c #115492",
-"T% c #15609B",
-"U% c #189ACB",
-"V% c #1CA0CF",
-"W% c #1FA2CF",
-"X% c #21A3D1",
-"Y% c #24A4D1",
-"Z% c #25A5D1",
-"`% c #27A4D1",
-" & c #28A4D1",
-".& c #28A0CE",
-"+& c #289ECC",
-"@& c #2596C8",
-"#& c #2392C5",
-"$& c #208DC2",
-"%& c #1D87BD",
-"&& c #1A75AE",
-"*& c #173978",
-"=& c #132E6D",
-"-& c #0F2565",
-";& c #0B1D5D",
-">& c #071555",
-",& c #021151",
-"'& c #001F61",
-")& c #00276D",
-"!& c #003D8E",
-"~& c #003B89",
-"{& c #001E62",
-"]& c #002063",
-"^& c #002569",
-"/& c #002D72",
-"(& c #003074",
-"_& c #003579",
-":& c #033C7F",
-"<& c #074183",
-"[& c #0B4787",
-"}& c #0F5392",
-"|& c #1391C5",
-"1& c #1695C8",
-"2& c #1998CA",
-"3& c #1C99CA",
-"4& c #1E9ACB",
-"5& c #209BCB",
-"6& c #219BCB",
-"7& c #229ACA",
-"8& c #2399C9",
-"9& c #2397C8",
-"0& c #2394C6",
-"a& c #2291C4",
-"b& c #1E89C0",
-"c& c #1C84BC",
-"d& c #1A5B97",
-"e& c #174C89",
-"f& c #142D6C",
-"g& c #102665",
-"h& c #0C1E5D",
-"i& c #081756",
-"j& c #040F4F",
-"k& c #000847",
-"l& c #000541",
-"m& c #00033D",
-"n& c #00368A",
-"o& c #00256E",
-"p& c #00185A",
-"q& c #001A5D",
-"r& c #001D60",
-"s& c #001F63",
-"t& c #002568",
-"u& c #00276B",
-"v& c #00296D",
-"w& c #002B70",
-"x& c #003276",
-"y& c #023579",
-"z& c #063A7D",
-"A& c #0A5997",
-"B& c #0D87BF",
-"C& c #108AC1",
-"D& c #138CC3",
-"E& c #168EC4",
-"F& c #188FC4",
-"G& c #1A90C4",
-"H& c #1C90C4",
-"I& c #1D8FC4",
-"J& c #1D8EC3",
-"K& c #1D8CC2",
-"L& c #1D8AC0",
-"M& c #1C87BE",
-"N& c #1B83BC",
-"O& c #1A7FB9",
-"P& c #1864A0",
-"Q& c #164987",
-"R& c #132C6A",
-"S& c #102564",
-"T& c #0D1E5D",
-"U& c #091756",
-"V& c #06104E",
-"W& c #020947",
-"X& c #000441",
-"Y& c #00023C",
-"Z& c #000038",
-"`& c #003086",
-" * c #001A5E",
-".* c #001354",
-"+* c #001658",
-"@* c #001D5F",
-"#* c #001F62",
-"$* c #002164",
-"%* c #002367",
-"&* c #002D71",
-"** c #014C8E",
-"=* c #0474B2",
-"-* c #077CB9",
-";* c #0B80BA",
-">* c #0E82BB",
-",* c #1083BC",
-"'* c #1285BD",
-")* c #1485BE",
-"!* c #1686BD",
-"~* c #1785BD",
-"{* c #1884BC",
-"]* c #1882BB",
-"^* c #1880B9",
-"/* c #187DB7",
-"(* c #177AB6",
-"_* c #1571AF",
-":* c #143676",
-"<* c #122968",
-"[* c #0F2362",
-"}* c #0D1D5C",
-"|* c #0A1755",
-"1* c #030A47",
-"2* c #000239",
-"3* c #002A82",
-"4* c #00175D",
-"5* c #00104F",
-"6* c #001252",
-"7* c #001454",
-"8* c #001657",
-"9* c #00195C",
-"0* c #001C5E",
-"a* c #001D61",
-"b* c #002165",
-"c* c #002366",
-"d* c #002468",
-"e* c #006CAE",
-"f* c #006FB0",
-"g* c #0271B1",
-"h* c #0574B3",
-"i* c #0877B4",
-"j* c #0B78B5",
-"k* c #0F7AB6",
-"l* c #107AB7",
-"m* c #127AB6",
-"n* c #1279B5",
-"o* c #1377B4",
-"p* c #1375B3",
-"q* c #1372B1",
-"r* c #126FAF",
-"s* c #115797",
-"t* c #0F2766",
-"u* c #0D2160",
-"v* c #0B1B5A",
-"w* c #091554",
-"x* c #06104D",
-"y* c #030A46",
-"z* c #000540",
-"A* c #000036",
-"B* c #00237E",
-"C* c #002980",
-"D* c #002372",
-"E* c #001A60",
-"F* c #001659",
-"G* c #001358",
-"H* c #001A5F",
-"I* c #002064",
-"J* c #001B5E",
-"K* c #005397",
-"L* c #0065A9",
-"M* c #0067AB",
-"N* c #0069AC",
-"O* c #026AAD",
-"P* c #046CAE",
-"Q* c #0768AB",
-"R* c #0965A9",
-"S* c #0A6EAF",
-"T* c #0C6EAE",
-"U* c #0D6DAE",
-"V* c #0D6CAD",
-"W* c #0D6AAB",
-"X* c #0D67AA",
-"Y* c #0D64A7",
-"Z* c #0C498C",
-"`* c #0A1E5E",
-" = c #091856",
-".= c #071350",
-"+= c #050D4B",
-"@= c #020844",
-"#= c #00043F",
-"$= c #00023B",
-"%= c #000037",
-"&= c #000035",
-"*= c #000034",
-"== c #001A77",
-"-= c #00237D",
-";= c #002881",
-">= c #002D84",
-",= c #00287F",
-"'= c #000B6C",
-")= c #00388A",
-"!= c #003785",
-"~= c #001556",
-"{= c #001759",
-"]= c #00195B",
-"^= c #001C5F",
-"/= c #001C60",
-"(= c #004B91",
-"_= c #004287",
-":= c #00569C",
-"<= c #0061A7",
-"[= c #023187",
-"}= c #033388",
-"|= c #0563A7",
-"1= c #0662A7",
-"2= c #0762A7",
-"3= c #0860A6",
-"4= c #085EA4",
-"5= c #085CA3",
-"6= c #084388",
-"7= c #071B5B",
-"8= c #061453",
-"9= c #04104D",
-"0= c #030B48",
-"a= c #010742",
-"b= c #00033E",
-"c= c #00013A",
-"d= c #000033",
-"e= c #000032",
-"f= c #001C79",
-"g= c #00217C",
-"h= c #002780",
-"i= c #002B83",
-"j= c #003589",
-"k= c #001D63",
-"l= c #000F4F",
-"m= c #000F4E",
-"n= c #001050",
-"o= c #001152",
-"p= c #001353",
-"q= c #001455",
-"r= c #002F74",
-"s= c #00529A",
-"t= c #0058A1",
-"u= c #00529D",
-"v= c #0156A0",
-"w= c #02569F",
-"x= c #02549E",
-"y= c #03529D",
-"z= c #034F9A",
-"A= c #032062",
-"B= c #020F4E",
-"C= c #010C49",
-"D= c #000845",
-"E= c #00033C",
-"F= c #000138",
-"G= c #000135",
-"H= c #001474",
-"I= c #001F7B",
-"J= c #00247E",
-"K= c #002D83",
-"L= c #001051",
-"M= c #000A46",
-"N= c #000B48",
-"O= c #000C4A",
-"P= c #000D4B",
-"Q= c #000E4D",
-"R= c #001151",
-"S= c #001253",
-"T= c #00377E",
-"U= c #004E9A",
-"V= c #004C98",
-"W= c #00408C",
-"X= c #000946",
-"Y= c #00053F",
-"Z= c #000137",
-"`= c #000031",
-" - c #000030",
-".- c #001373",
-"+- c #001876",
-"@- c #001D79",
-"#- c #00267F",
-"$- c #000D4D",
-"%- c #000741",
-"&- c #000843",
-"*- c #000945",
-"=- c #000A47",
-"-- c #000B49",
-";- c #000D4C",
-">- c #002F77",
-",- c #00327A",
-"'- c #002267",
-")- c #002166",
-"!- c #00256A",
-"~- c #003D89",
-"{- c #004393",
-"]- c #003F90",
-"^- c #003C8D",
-"/- c #003382",
-"(- c #003587",
-"_- c #002069",
-":- c #00033A",
-"<- c #000136",
-"[- c #00002F",
-"}- c #000C6E",
-"|- c #001171",
-"1- c #001574",
-"2- c #001E7A",
-"3- c #00196A",
-"4- c #00053E",
-"5- c #000640",
-"6- c #000742",
-"7- c #00185B",
-"8- c #003787",
-"9- c #00398C",
-"0- c #00378B",
-"a- c #003388",
-"b- c #002779",
-"c- c #00063F",
-"d- c #00002D",
-"e- c #00096C",
-"f- c #000D6F",
-"g- c #001271",
-"h- c #001675",
-"i- c #001872",
-"j- c #000338",
-"k- c #00043A",
-"l- c #00043B",
-"m- c #00053D",
-"n- c #000844",
-"o- c #000944",
-"p- c #002573",
-"q- c #002E85",
-"r- c #002C83",
-"s- c #001E71",
-"t- c #00002E",
-"u- c #00002C",
-"v- c #000266",
-"w- c #00066A",
-"x- c #000A6D",
-"y- c #000E70",
-"z- c #000C58",
-"A- c #000643",
-"B- c #000337",
-"C- c #000236",
-"D- c #000339",
-"E- c #00053C",
-"F- c #00063E",
-"G- c #00073F",
-"H- c #00145A",
-"I- c #001C78",
-"J- c #000743",
-"K- c #00002A",
-"L- c #00005F",
-"M- c #000267",
-"N- c #000A6C",
-"O- c #000952",
-"P- c #000131",
-"Q- c #000132",
-"R- c #000133",
-"S- c #000134",
-"T- c #000235",
-"U- c #00196E",
-"V- c #001D7A",
-"W- c #001B78",
-"X- c #001977",
-"Y- c #001775",
-"Z- c #001473",
-"`- c #000E66",
-" ; c #00002B",
-".; c #000029",
-"+; c #000053",
-"@; c #00005E",
-"#; c #000265",
-"$; c #000464",
-"%; c #000130",
-"&; c #001160",
-"*; c #001164",
-"=; c #001674",
-"-; c #001272",
-";; c #001071",
-">; c #000E6F",
-",; c #000B6E",
-"'; c #00086C",
-"); c #00045F",
-"!; c #000152",
-"~; c #000046",
-"{; c #000051",
-"]; c #00005A",
-"^; c #00012F",
-"/; c #000542",
-"(; c #00106E",
-"_; c #001070",
-":; c #000F70",
-"<; c #00086B",
-"[; c #000367",
-"}; c #000163",
-"|; c #00005B",
-"1; c #000052",
-"2; c #000047",
-"3; c #000041",
-"4; c #000028",
-"5; c #000021",
-"6; c #000025",
-"7; c #00003E",
-"8; c #00003A",
-"9; c #00075A",
-"0; c #00076B",
-"a; c #000569",
-"b; c #000368",
-"c; c #000162",
-"d; c #00005C",
-"e; c #000054",
-"f; c #00004C",
-"g; c #000042",
-"h; c #000039",
-"i; c #000026",
-"j; c #000023",
-"k; c #000017",
-"l; c #00001C",
-"m; c #00004D",
-"n; c #000055",
-"o; c #000027",
-"p; c #00003D",
-"q; c #000058",
-"r; c #00004E",
-"s; c #000048",
-"t; c #000019",
-"u; c #000012",
-"v; c #00001D",
-"w; c #00001F",
-"x; c #000044",
-"y; c #000008",
-"z; c #000018",
-"A; c #000024",
-"B; c #000015",
-"C; c #000022",
-"D; c #00000F",
-"E; c #000004",
-"F; c #000007",
-"G; c #000009",
-"H; c #00000C",
-"I; c #00000D",
-"J; c #00000E",
-"K; c #00000A",
-"L; c #000003",
-"M; c #000000",
-"N; c #000001",
-"O; c #000005",
-"P; c #00000B",
-" ",
-" ",
-" . + @ # $ % & * ",
-" = - ; > , ' ) ! ~ { ] ^ / ( _ : ",
-" < [ } | 1 2 3 4 5 6 7 8 9 0 a b c d e ",
-" f g h i j k l m n o p q r s t u v w x y z A B ",
-" C D E F G H I J K L M N O P Q R S T U V W X Y Z ` . ",
-" ..+.@.#.$.%.&.*.=.-.;.>.,.'.).!.~.{.].^./.(._.:.<.[.}.|. ",
-" 1.2.3.4.5.6.7.8.9.0.a.b.c.d.e.e.f.g.h.i.j.k.l.m.n.o.p.q.r.s. ",
-" t.u.v.w.x.y.z.A.B.C.D.E.F.G.H.I.J.K.L.M.N.O.P.Q.R.S.T.U.V.W.X.Y. ",
-" Z.`. +.+++@+#+$+%+&+*+=+-+;+>+,+'+)+!+~+{+]+^+/+(+_+:+<+[+}+|+1+2+ ",
-" 3+4+5+6+7+8+9+0+a+b+c+d+e+f+g+h+i+j+k+k+l+m+]+n+o+p+q+r+s+t+u+v+w+x+y+ ",
-" z+A+B+C+D+E+F+G+H+I+J+K+L+M+f+N+O+P+Q+R+S+T+U+V+W+X+Y+Z+`+ @.@+@@@#@$@%@ ",
-" &@*@=@-@;@>@,@'@)@!@~@{@]@^@L+/@(@_@:@<@[@}@|@1@2@3@4@5@6@7@8@9@0@a@b@c@d@ ",
-" e@f@z+A+B+g@h@i@j@k@l@m@n@o@p@q@r@s@t@u@v@w@x@y@z@A@B@C@D@E@F@G@H@I@J@K@L@M@ ",
-" N@O@P@Q@R@S@T@U@V@W@X@Y@l@Z@`@ #.#+#@###$#%#&#*#=#-#;#>#,#'#)#!#~#{#]#^#/#(#_# ",
-" :#<#[#}#|#1#2#3#4#5#6#7#8#9#0#a#b#c#d#e#f#g#h#i#j#k#l#m#n#o#p#q#r#s#t#u#v#w#x#y# ",
-" z#A#B#M@C#D#E#F#G#H#I#J#K#L#M#N#O#P#Q#R#S#T#U#V#W#X#Y#Z#`# $.$+$@$#$$$%$&$*$=$z# ",
-" -$;$>$,$O@'$)$!$~${$]$^$/$($_$:$<$[$}$|$1$2$3$4$5$3$6$7$8$ $9$0$a$b$c$d$e$f$g$h$i$ ",
-" j$k$l$m$n$o$p$q$r$s$t$u$v$w$x$y$z$A$B$C$D$E$F$G$G$H$8$I$J$K$L$M$N$O$P$Q$R$S$T$U$k$V$ ",
-" W$X$Y$Z$`$ %.%+%p$q$@%#%$%%%&%*%=%-%;%>%,%'%)%p#p#J$!%K$~%{%]%^%/%(%_%:%<%[%}%|%1%2% ",
-" 3%4%5%6%7%8%9% %0%a%b%c%d%e%f%g%h%i%j%k%l%m%n%o%p%0$q%r%]%s%t%u%v%w%x%y%z%A%B%C%D%3% ",
-" E%F%G%H%I%J%K%8%L%M%N%O%P%Q%R%S%T%U%V%W%X%Y%Z%`% &9+.&+&V.@&#&$&%&&&*&=&-&;&>&,&'&)& ",
-" !&~&{&]&G%^&I%J%/&(&7%_& %:&<&[&}&|&1&2&3&4&5&6&7&8&9&0&a&$&b&c&d&e&f&g&h&i&j&k&l&m& ",
-" n&o&p&q&r&s&G%t&u&v&w&K%(&x&y&z&A&B&C&D&E&F&G&H&I&J&K&L&M&N&O&P&Q&R&S&T&U&V&W&X&Y&Z& ",
-" `& *.*+*p&q&@*#*$*%*^&u&v&J%&***=*-*;*>*,*'*)*!*~*{*]*^*/*(*_*:*<*[*}*|*V&1*l&Y&Z&2* ",
-" 3*4*5*6*7*8*p&9*0*a*s&b*c*d*v&e*f*g*h*i*j**$k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*Y&Z&A*z* ",
-" B*C*D*E*F*G*H*I*+*p&9*J*r&{&x&K*L*M*N*O*P*Q*R*S*T*U*V*W*X*Y*Z*`* =.=+=@=#=$=%=&=*= ",
-" ==-=;=>=,='=)=!=J*.*~=+*{=]=^=/=(=_=:=l$<=[=}=|=1=2=3=4=5=6=7=8=9=0=a=b=c=%=&=d=e= ",
-" f=g=h=i=3*j=k=l=m=n=o=p=q=~=8*r=^=b*s=t=j$u=-$v=w=x=y=z=A=B=C=D=z*E=F=A*&=d=e=G= ",
-" H===I=J=;=K=L=M=N=O=P=Q=l=n=R=6*S=.*T=D%D%D%U=2%V=V$3%W=J*L=X=Y=$=Z=&=*=e=`= - ",
-" .-+-@-g=#-$-%-&-*-M==---O=P=;-Q=m=>-,-'-)-!-~-{-E%]-^-/-(-_-:-<-*=d=e=`=[-[- ",
-" }-|-1-==2-3-4-4-5-%-6-&-*-X==-=-N=q&;-O=O=O=7-8-9-0-j=a-`&b-c-d=e=`= -[-d-$= ",
-" e-f-g-h-i-4-j-k-l-m-4-c-5-%-6-6-&-&-n-o-o-*-M=p-q-r-3*h=s-X=`= -[-t-u-u- ",
-" v-w-x-y-g-z-A-B-C-j-D-:-l-l-E-m-4-F-F-c-c-c-G-H-#-J=g=I=I-J-t-t-d-u-K- ",
-" L-M-w-N-f-O-P-Q-R-S-T-C-C-B-j-D-D-:-k-l-k-D=U-V-W-X-Y-Z-`-[- ; ;.;u- ",
-" +;@;#;$; ;u-d-t-[- -%;P-Q-R-R-S-B-z*&;*;Y-=;H=-;;;>;,;';);!;%=d- ",
-" ~;{;];u-.;K- ; ;u-d-d-d-t-t-^;/;(;_;;;:;f-}-x-<;w-[;};|;1;2; ",
-" A*%=3;4;5;6;u-7;8;u-K- ; ; ; ;^;9;<;0;w-a;b;v-c;d;e;f;g;h; ",
-" i;j;k;l;d=m;1;n;d= ;i;o;o;o;o;p;@;d;q;+;r;s;3;h;`=K- ",
-" t;u;k;o;e=Z&%=5;*=l;v;v;v;w; ;x;3;p;Z&d=d-i;w; ",
-" y;u;z;v;5;A;A;B;u;u;u;j; ;.;i;C;v;z;u;D; ",
-" E;E;F;G;H;I;I;I;H;D;J;H;K;F;E;K; ",
-" y;L;M;M;N;N;M;N;O;P; ",
-" ",
-" ",
-" ",
-" "};
new file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..9f8274b1371921d92f2651cb9511d66b008b607a
GIT binary patch
literal 722
zc$@*!0xkWCP)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00009a7bBm000XU
z000XU0RWnu7ytkQgh@m}R5*>5lS@cc0Te*bn|br~sWW3^qZUS1B!n48&_}U?pu$`P
zwGgrhjB3}eMPNzLrWURWT13$zBElk~f~2U7(9%RiQZm2I|NESo_idA6X+>vs;c^d`
z`vJfN!35!FY~eo;<^!|q&~7v{i5v=$mIra#e8S031OF0;0Ol2MG5)HpRBmfRQ#7<W
z2YnAa&2|Qbc8tFY%yulSt@l%2-Jk{bc(C~N(ZNUJXn%Bb)2*h*j#I4_Zcni@J~JES
z&au#P9f-Ibeo~=sQHh***)wQ#T<TO+YuWyNr;i_W*VL}F`wH!oV=H6h{;n6Z?>=AV
z{e|IqfkkLX5t{DzkdxB{dp_K_dOq{Ir+;-kk*uxusx{>$1@20(Q(Pe!r9Owf#Zy(@
zP0P)l^8zb?d2N-8XmElz54tbvN7rO5_PtpQ%*JM<KmaYCB0M%rPL`45vSd_M)N8J~
zyNo@{iU7j7sVq!oq0P;ix&zkc1_}$Eq-;KBlNt1h5b;P7_ohlbo<cOMYkf|VjsVxi
zUna8ASIzhE27P9lm=%P84`o*kQb`fkIu}_4jC2}fViGdB#-#$)C}L>Xf|5p+iim_`
z<jYDa@O!Z7I(kB8?rk5rfg#W}&%zxn5c?KJ3godk9E5{txh#p#Uy+Nw*z6+a$S`Ve
zFRGjZQ=3^Th~N8yarPrc#oI}ZLNbCG4Wan_DBd!VbC6AdnFqwD3tL!(PF{+TwH!uI
zSW#n;PeURB85`saAeRCo{v3iGkXC;e0OKPVN(v*k18fe=3<w%1B4kFvNWOw-8%%{@
z(K9W@(*V|1(6@l;0%00>0*Tu|^v`w6m_RB8oXaJD0B=VW0A4+5-T(jq07*qoM6N<$
Ef*YVbfB*mh
--- a/browser/app/profile/firefox.js
+++ b/browser/app/profile/firefox.js
@@ -63,16 +63,25 @@ pref("xpinstall.dialog.progress.type.chr
// their extensions are being updated and thus reregistered every time the app is
// started.
pref("extensions.ignoreMTimeChanges", false);
// Enables some extra Extension System Logging (can reduce performance)
pref("extensions.logging.enabled", false);
// Hides the install button in the add-ons mgr
pref("extensions.hideInstallButton", true);
+// Preferences for the Get Add-ons pane
+pref("extensions.getAddons.showPane", true);
+pref("extensions.getAddons.browseAddons", "https://%LOCALE%.add-ons.mozilla.com/%LOCALE%/%APP%");
+pref("extensions.getAddons.maxResults", 5);
+pref("extensions.getAddons.recommended.browseURL", "https://%LOCALE%.add-ons.mozilla.com/%LOCALE%/%APP%/recommended");
+pref("extensions.getAddons.recommended.url", "https://services.addons.mozilla.org/%LOCALE%/%APP%/api/list/featured/all/10");
+pref("extensions.getAddons.search.browseURL", "https://%LOCALE%.add-ons.mozilla.com/%LOCALE%/%APP%/search?q=%TERMS%");
+pref("extensions.getAddons.search.url", "https://services.addons.mozilla.org/%LOCALE%/%APP%/api/search/%TERMS%");
+
// Blocklist preferences
pref("extensions.blocklist.enabled", true);
pref("extensions.blocklist.interval", 86400);
pref("extensions.blocklist.url", "https://addons.mozilla.org/blocklist/1/%APP_ID%/%APP_VERSION%/");
pref("extensions.blocklist.detailsURL", "http://%LOCALE%.www.mozilla.com/%LOCALE%/blocklist/");
// Dictionary download preference
pref("browser.dictionaries.download.url", "https://%LOCALE%.add-ons.mozilla.com/%LOCALE%/firefox/%VERSION%/dictionaries/");
@@ -212,16 +221,17 @@ pref("browser.download.manager.showAlert
pref("browser.download.manager.retention", 2);
pref("browser.download.manager.showWhenStarting", true);
pref("browser.download.manager.useWindow", true);
pref("browser.download.manager.closeWhenDone", false);
pref("browser.download.manager.openDelay", 0);
pref("browser.download.manager.focusWhenStarting", false);
pref("browser.download.manager.flashCount", 2);
pref("browser.download.manager.addToRecentDocs", true);
+pref("browser.download.manager.quitBehavior", 0);
// search engines URL
pref("browser.search.searchEnginesURL", "https://%LOCALE%.add-ons.mozilla.com/%LOCALE%/firefox/%VERSION%/search-engines/");
// pointer to the default engine name
pref("browser.search.defaultenginename", "chrome://browser-region/locale/region.properties");
// disable logging for the search service by default
@@ -330,24 +340,25 @@ pref("dom.disable_window_move_resize",
pref("dom.disable_window_flip", true);
// popups.policy 1=allow,2=reject
pref("privacy.popups.policy", 1);
pref("privacy.popups.usecustom", true);
pref("privacy.popups.firstTime", true);
pref("privacy.popups.showBrowserMessage", true);
-pref("privacy.item.history", true);
-pref("privacy.item.formdata", true);
-pref("privacy.item.passwords", false);
-pref("privacy.item.downloads", true);
-pref("privacy.item.cookies", false);
-pref("privacy.item.cache", true);
-pref("privacy.item.siteprefs", false);
-pref("privacy.item.sessions", true);
+pref("privacy.item.history", true);
+pref("privacy.item.formdata", true);
+pref("privacy.item.passwords", false);
+pref("privacy.item.downloads", true);
+pref("privacy.item.cookies", false);
+pref("privacy.item.cache", true);
+pref("privacy.item.siteprefs", false);
+pref("privacy.item.sessions", true);
+pref("privacy.item.offlineApps", false);
pref("privacy.sanitize.sanitizeOnShutdown", false);
pref("privacy.sanitize.promptOnSanitize", true);
pref("network.proxy.share_proxy_settings", false); // use the same proxy settings for all protocols
pref("network.cookie.cookieBehavior", 1); // 0-Accept, 1-dontAcceptForeign, 2-dontUse
@@ -594,17 +605,55 @@ pref("browser.places.importBookmarksHTML
// if false, will add the "Smart Bookmarks" folder to the personal toolbar
pref("browser.places.createdSmartBookmarks", false);
// If true, will migrate uri post-data annotations to
// bookmark post-data annotations (bug 398914)
// XXX to be removed after beta 2 (bug 391419)
pref("browser.places.migratePostDataAnnotations", true);
+// the (maximum) number of the recent visits to sample
+// when calculating frecency
+pref("places.frecency.numVisits", 10);
+
+// Perform frecency recalculation after this amount of idle, repeating.
+// A value of zero disables updating of frecency on idle.
+// Default is 1 minute (60000ms).
+pref("places.frecency.updateIdleTime", 60000);
+
+// buckets (in days) for frecency calculation
+pref("places.frecency.firstBucketCutoff", 4);
+pref("places.frecency.secondBucketCutoff", 14);
+pref("places.frecency.thirdBucketCutoff", 31);
+pref("places.frecency.fourthBucketCutoff", 90);
+
+// weights for buckets for frecency calculations
+pref("places.frecency.firstBucketWeight", 100);
+pref("places.frecency.secondBucketWeight", 70);
+pref("places.frecency.thirdBucketWeight", 50);
+pref("places.frecency.fourthBucketWeight", 30);
+pref("places.frecency.defaultBucketWeight", 10);
+
+// bonus (in percent) for visit transition types for frecency calculations
+pref("places.frecency.embedVisitBonus", 0);
+pref("places.frecency.linkVisitBonus", 120);
+pref("places.frecency.typedVisitBonus", 200);
+pref("places.frecency.bookmarkVisitBonus", 140);
+pref("places.frecency.downloadVisitBonus", 0);
+pref("places.frecency.permRedirectVisitBonus", 0);
+pref("places.frecency.tempRedirectVisitBonus", 0);
+pref("places.frecency.defaultVisitBonus", 0);
+
+// bonus (in percent) for place types for frecency calculations
+pref("places.frecency.unvisitedBookmarkBonus", 140);
+pref("places.frecency.unvisitedTypedBonus", 200);
+
// Controls behavior of the "Add Exception" dialog launched from SSL error pages
// 0 - don't pre-populate anything
// 1 - pre-populate site URL, but don't fetch certificate
// 2 - pre-populate site URL and pre-fetch certificate
pref("browser.ssl_override_behavior", 1);
// replace newlines with spaces when pasting into <input type="text"> fields
pref("editor.singleLine.pasteNewlines", 2);
+// The breakpad report server to link to in about:crashes
+pref("breakpad.reportURL", "http://crash-stats.mozilla.com/report/index/");
--- a/browser/app/splash.rc
+++ b/browser/app/splash.rc
@@ -63,21 +63,23 @@ END
#define IDC_CELL 4103
#define IDC_COPY 4104
#define IDC_ALIAS 4105
#define IDC_ZOOMIN 4106
#define IDC_ZOOMOUT 4107
#define IDC_COLRESIZE 4108
#define IDC_ROWRESIZE 4109
#define IDC_VERTICALTEXT 4110
+#define IDC_NONE 4112
IDC_GRAB CURSOR DISCARDABLE "../../widget/src/build/res/grab.cur"
IDC_GRABBING CURSOR DISCARDABLE "../../widget/src/build/res/grabbing.cur"
IDC_CELL CURSOR DISCARDABLE "../../widget/src/build/res/cell.cur"
IDC_COPY CURSOR DISCARDABLE "../../widget/src/build/res/copy.cur"
IDC_ALIAS CURSOR DISCARDABLE "../../widget/src/build/res/aliasb.cur"
IDC_ZOOMIN CURSOR DISCARDABLE "../../widget/src/build/res/zoom_in.cur"
IDC_ZOOMOUT CURSOR DISCARDABLE "../../widget/src/build/res/zoom_out.cur"
IDC_COLRESIZE CURSOR DISCARDABLE "../../widget/src/build/res/col_resize.cur"
IDC_ROWRESIZE CURSOR DISCARDABLE "../../widget/src/build/res/row_resize.cur"
IDC_VERTICALTEXT CURSOR DISCARDABLE "../../widget/src/build/res/vertical_text.cur"
+IDC_NONE CURSOR DISCARDABLE "../../widget/src/build/res/none.cur"
#endif
--- a/browser/app/splashos2.rc
+++ b/browser/app/splashos2.rc
@@ -66,12 +66,13 @@ POINTER IDC_CELL "..\\..\\widg
POINTER IDC_COPY "..\\..\\widget\\src\\os2\\res\\copy.ptr"
POINTER IDC_ALIAS "..\\..\\widget\\src\\os2\\res\\aliasb.ptr"
POINTER IDC_ZOOMIN "..\\..\\widget\\src\\os2\\res\\zoom_in.ptr"
POINTER IDC_ZOOMOUT "..\\..\\widget\\src\\os2\\res\\zoom_out.ptr"
POINTER IDC_ARROWWAIT "..\\..\\widget\\src\\os2\\res\\arrow_wait.ptr"
POINTER IDC_CROSS "..\\..\\widget\\src\\os2\\res\\crosshair.ptr"
POINTER IDC_HELP "..\\..\\widget\\src\\os2\\res\\help.ptr"
+POINTER IDC_NONE "..\\..\\widget\\src\\os2\\res\\none.ptr"
ICON IDC_DNDURL "..\\..\\widget\\src\\os2\\res\\dndurl.ico"
ICON IDC_DNDTEXT "..\\..\\widget\\src\\os2\\res\\dndtext.ico"
#endif
--- a/browser/base/content/aboutDialog.css
+++ b/browser/base/content/aboutDialog.css
@@ -74,17 +74,17 @@
margin-top: 0;
-moz-margin-end: 0;
margin-bottom: 10px;
-moz-margin-start: 17px;
}
#copyright {
margin-top: 0;
- -moz-margin-end: 0;
+ -moz-margin-end: 16px;
margin-bottom: 3px;
-moz-margin-start: 16px;
}
button[dlgtype="extra2"] {
-moz-margin-start: 13px;
}
--- a/browser/base/content/aboutDialog.xul
+++ b/browser/base/content/aboutDialog.xul
@@ -70,17 +70,17 @@
<script type="application/x-javascript" src="chrome://browser/content/aboutDialog.js"/>
<deck id="modes" flex="1">
<vbox flex="1" id="clientBox">
#expand <label id="version" value="&aboutVersion; __MOZ_APP_VERSION__"/>
<label id="distribution"/>
<label id="distributionId"/>
- <description id="copyright">©rightText;</description>
+ <description id="copyright">©rightInfo;</description>
<textbox id="userAgent" multiline="true" readonly="true"/>
</vbox>
<vbox flex="1" id="creditsBox">
<iframe id="creditsIframe" flex="1"/>
</vbox>
</deck>
<separator class="groove" id="groove"/>
new file mode 100644
--- /dev/null
+++ b/browser/base/content/bindings.xml
@@ -0,0 +1,80 @@
+<?xml version="1.0"?>
+
+# -*- Mode: HTML -*-
+# ***** BEGIN LICENSE BLOCK *****
+# Version: MPL 1.1/GPL 2.0/LGPL 2.1
+#
+# The contents of this file are subject to the Mozilla Public License Version
+# 1.1 (the "License"); you may not use this file except in compliance with
+# the License. You may obtain a copy of the License at
+# http://www.mozilla.org/MPL/
+#
+# Software distributed under the License is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
+# for the specific language governing rights and limitations under the
+# License.
+#
+# The Original Code is mozilla.org browser.
+#
+# The Initial Developer of the Original Code is
+# Simon Bünzli <[email protected]>
+# Portions created by the Initial Developer are Copyright (C) 2007 - 2008
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#
+# Alternatively, the contents of this file may be used under the terms of
+# either the GNU General Public License Version 2 or later (the "GPL"), or
+# the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
+# in which case the provisions of the GPL or the LGPL are applicable instead
+# of those above. If you wish to allow use of your version of this file only
+# under the terms of either the GPL or the LGPL, and not to allow others to
+# use your version of this file under the terms of the MPL, indicate your
+# decision by deleting the provisions above and replace them with the notice
+# and other provisions required by the GPL or the LGPL. If you do not delete
+# the provisions above, a recipient may use your version of this file under
+# the terms of any one of the MPL, the GPL or the LGPL.
+#
+# ***** END LICENSE BLOCK *****
+
+<!DOCTYPE bindings SYSTEM "chrome://global/locale/global.dtd">
+
+<bindings xmlns="http://www.mozilla.org/xbl"
+ xmlns:xul="http://www.mozilla.org/keymaster/gatekeeper/there.is.only.xul"
+ xmlns:xbl="http://www.mozilla.org/xbl"
+>
+ <binding id="unified-back-forward-button-wrapper" display="xul:menu"
+ extends="chrome://global/content/bindings/toolbarbutton.xml#menu">
+ <content>
+ <children includes="toolbarbutton|observes|template|menupopup|tooltip"/>
+ <xul:dropmarker type="menu-button"
+ class="toolbarbutton-menubutton-dropmarker"
+ chromedir="&locale.dir;"
+ xbl:inherits="align,dir,pack,orient,disabled,toolbarmode,buttonstyle"
+ />
+ </content>
+
+ <implementation>
+ <constructor><![CDATA[
+ this._updateUnifiedState();
+ ]]></constructor>
+
+ <method name="_updateUnifiedState">
+ <body><![CDATA[
+ var canGoBack = !document.getElementById("Browser:Back").hasAttribute("disabled");
+ var canGoForward = !document.getElementById("Browser:Forward").hasAttribute("disabled");
+
+ if (canGoBack || canGoForward)
+ this.removeAttribute("disabled");
+ else
+ this.setAttribute("disabled", "true");
+ ]]></body>
+ </method>
+ </implementation>
+
+ <handlers>
+ <!-- observing state changes of the child buttons -->
+ <handler event="broadcast" action="this._updateUnifiedState();"/>
+ </handlers>
+ </binding>
+</bindings>
--- a/browser/base/content/browser-context.inc
+++ b/browser/base/content/browser-context.inc
@@ -49,18 +49,18 @@
accesskey="&openLinkCmd.accesskey;"
oncommand="gContextMenu.openLink();"/>
<menuitem id="context-openlinkintab"
label="&openLinkCmdInTab.label;"
accesskey="&openLinkCmdInTab.accesskey;"
oncommand="gContextMenu.openLinkInTab();"/>
<menuseparator id="context-sep-open"/>
<menuitem id="context-bookmarklink"
- label="&bookmarkLinkCmd.label;"
- accesskey="&bookmarkLinkCmd.accesskey;"
+ label="&bookmarkThisLinkCmd.label;"
+ accesskey="&bookmarkThisLinkCmd.accesskey;"
oncommand="gContextMenu.bookmarkLink();"/>
<menuitem id="context-savelink"
label="&saveLinkCmd.label;"
accesskey="&saveLinkCmd.accesskey;"
oncommand="gContextMenu.saveLink();"/>
<menuitem id="context-sendlink"
label="&sendLinkCmd.label;"
accesskey="&sendLinkCmd.accesskey;"
@@ -121,18 +121,18 @@
accesskey="&reloadCmd.accesskey;"
command="Browser:Reload"/>
<menuitem id="context-stop"
label="&stopCmd.label;"
accesskey="&stopCmd.accesskey;"
command="Browser:Stop"/>
<menuseparator id="context-sep-stop"/>
<menuitem id="context-bookmarkpage"
- label="&bookmarkPageCmd.label;"
- accesskey="&bookmarkPageCmd.accesskey;"
+ label="&bookmarkPageCmd2.label;"
+ accesskey="&bookmarkPageCmd2.accesskey;"
oncommand="gContextMenu.bookmarkThisPage();"/>
<menuitem id="context-savepage"
label="&savePageCmd.label;"
accesskey="&savePageCmd.accesskey2;"
oncommand="gContextMenu.savePageAs();"/>
<menuitem id="context-sendpage"
label="&sendPageCmd.label;"
accesskey="&sendPageCmd.accesskey;"
@@ -189,18 +189,18 @@
<menuitem label="&openFrameCmdInTab.label;"
accesskey="&openFrameCmdInTab.accesskey;"
oncommand="gContextMenu.openFrameInTab();"/>
<menuseparator/>
<menuitem label="&reloadFrameCmd.label;"
accesskey="&reloadFrameCmd.accesskey;"
oncommand="gContextMenu.reloadFrame();"/>
<menuseparator/>
- <menuitem label="&bookmarkFrameCmd.label;"
- accesskey="&bookmarkFrameCmd.accesskey;"
+ <menuitem label="&bookmarkThisFrameCmd.label;"
+ accesskey="&bookmarkThisFrameCmd.accesskey;"
oncommand="gContextMenu.addBookmarkForFrame();"/>
<menuitem label="&saveFrameCmd.label;"
accesskey="&saveFrameCmd.accesskey;"
oncommand="saveDocument(gContextMenu.target.ownerDocument);"/>
<menuseparator/>
<menuitem label="&printFrameCmd.label;"
accesskey="&printFrameCmd.accesskey;"
oncommand="gContextMenu.printFrame();"/>
@@ -235,19 +235,19 @@
accesskey="&viewPageInfoCmd.accesskey;"
oncommand="gContextMenu.viewInfo();"/>
<menuitem id="context-metadata"
label="&metadataCmd.label;"
accesskey="&metadataCmd.accesskey;"
oncommand="gContextMenu.showMetadata();"/>
<menuseparator id="spell-separator"/>
<menuitem id="spell-check-enabled"
- label="&spellEnable.label;"
+ label="&spellCheckEnable.label;"
type="checkbox"
- accesskey="&spellEnable.accesskey;"
+ accesskey="&spellCheckEnable.accesskey;"
oncommand="InlineSpellCheckerUI.toggleEnabled();"/>
#ifndef MOZ_WIDGET_COCOA
<menuitem id="spell-add-dictionaries-main"
label="&spellAddDictionaries.label;"
accesskey="&spellAddDictionaries.accesskey;"
oncommand="gContextMenu.addDictionaries();"/>
#endif
<menu id="spell-dictionaries"
--- a/browser/base/content/browser-menubar.inc
+++ b/browser/base/content/browser-menubar.inc
@@ -83,17 +83,19 @@
#endif
#endif
oncommand="goQuitApplication();"/>
</menupopup>
</menu>
<menu id="edit-menu" label="&editMenu.label;"
accesskey="&editMenu.accesskey;">
- <menupopup id="menu_EditPopup">
+ <menupopup id="menu_EditPopup"
+ onpopupshowing="updateEditUIVisibility()"
+ onpopuphidden="updateEditUIVisibility()">
<menuitem label="&undoCmd.label;"
key="key_undo"
accesskey="&undoCmd.accesskey;"
command="cmd_undo"/>
<menuitem label="&redoCmd.label;"
key="key_redo"
accesskey="&redoCmd.accesskey;"
command="cmd_redo"/>
--- a/browser/base/content/browser-places.js
+++ b/browser/base/content/browser-places.js
@@ -92,21 +92,18 @@ var PlacesCommandHook = {
case "popuphidden":
if (aEvent.originalTarget == this.panel) {
gEditItemOverlay.uninitPanel(true);
this._restoreCommandsState();
}
break;
case "keypress":
if (aEvent.keyCode == KeyEvent.DOM_VK_ESCAPE ||
- aEvent.keyCode == KeyEvent.DOM_VK_RETURN) {
- // focus the content area and hide the panel
- window.content.focus();
- this.panel.hidePopup();
- }
+ aEvent.keyCode == KeyEvent.DOM_VK_RETURN)
+ this.panel.hidePopup(); // hide the panel
break;
}
},
_overlayLoaded: false,
_overlayLoading: false,
showEditBookmarkPopup:
function PCH_showEditBookmarkPopup(aItemId, aAnchorElement, aPosition) {
@@ -203,17 +200,17 @@ var PlacesCommandHook = {
}
if (aShowEditUI) {
// dock the panel to the star icon when possible, otherwise dock
// it to the content area
if (aBrowser.contentWindow == window.content) {
var starIcon = aBrowser.ownerDocument.getElementById("star-button");
if (starIcon && isElementVisible(starIcon)) {
- this.showEditBookmarkPopup(itemId, starIcon, "after_start");
+ this.showEditBookmarkPopup(itemId, starIcon, "after_end");
return;
}
}
this.showEditBookmarkPopup(itemId, aBrowser, "overlap");
}
},
/**
--- a/browser/base/content/browser-sets.inc
+++ b/browser/base/content/browser-sets.inc
@@ -102,19 +102,17 @@
<command id="Browser:Reload" oncommand="if (event.shiftKey) BrowserReloadSkipCache(); else BrowserReload()" disabled="true"/>
<command id="Browser:ReloadSkipCache" oncommand="BrowserReloadSkipCache()" disabled="true"/>
<command id="cmd_fullZoomReduce" oncommand="FullZoom.reduce()"/>
<command id="cmd_fullZoomEnlarge" oncommand="FullZoom.enlarge()"/>
<command id="cmd_fullZoomReset" oncommand="FullZoom.reset()"/>
<command id="Browser:OpenLocation" oncommand="openLocation();"/>
<command id="Tools:Search" oncommand="BrowserSearch.webSearch();"/>
- <command id="Tools:Downloads" oncommand="toOpenWindowByType('Download:Manager',
- 'chrome://mozapps/content/downloads/downloads.xul',
- 'chrome,dialog=no,resizable');"/>
+ <command id="Tools:Downloads" oncommand="BrowserDownloadsUI();"/>
<command id="Tools:Addons" oncommand="BrowserOpenAddonsMgr();"/>
<command id="Tools:Sanitize"
oncommand="Cc[GLUE_CID].getService(Ci.nsIBrowserGlue).sanitize(window || null);"/>
<command id="History:UndoCloseTab" oncommand="undoCloseTab();"/>
</commandset>
<commandset id="placesCommands">
<command id="Browser:ShowAllBookmarks"
--- a/browser/base/content/browser.css
+++ b/browser/base/content/browser.css
@@ -18,16 +18,27 @@ toolbar[printpreview="true"] {
#PopupAutoComplete {
-moz-binding: url("chrome://browser/content/urlbarBindings.xml#browser-autocomplete-result-popup");
}
#PopupAutoCompleteRichResult {
-moz-binding: url("chrome://browser/content/urlbarBindings.xml#urlbar-rich-result-popup");
}
+/* ::::: Unified Back-/Forward Button ::::: */
+#unified-back-forward-button {
+ -moz-binding: url("chrome://browser/content/bindings.xml#unified-back-forward-button-wrapper");
+}
+#unified-back-forward-button > toolbarbutton > dropmarker {
+ display: none; /* we provide our own */
+}
+.unified-nav-current {
+ font-weight: bold;
+}
+
menuitem.spell-suggestion {
font-weight: bold;
}
#sidebar-box toolbarbutton.tabs-closebutton {
-moz-user-focus: normal;
}
--- a/browser/base/content/browser.js
+++ b/browser/base/content/browser.js
@@ -53,16 +53,22 @@
# use your version of this file under the terms of the MPL, indicate your
# decision by deleting the provisions above and replace them with the notice
# and other provisions required by the GPL or the LGPL. If you do not delete
# the provisions above, a recipient may use your version of this file under
# the terms of any one of the MPL, the GPL or the LGPL.
#
# ***** END LICENSE BLOCK *****
+let Ci = Components.interfaces;
+let Cu = Components.utils;
+Cu.import("resource://gre/modules/XPCOMUtils.jsm");
+Cu.import("resource://gre/modules/DownloadUtils.jsm");
+Cu.import("resource://gre/modules/PluralForm.jsm");
+
const kXULNS =
"http://www.mozilla.org/keymaster/gatekeeper/there.is.only.xul";
const nsIWebNavigation = Components.interfaces.nsIWebNavigation;
const MAX_HISTORY_MENU_ITEMS = 15;
// bookmark dialog features
@@ -94,31 +100,36 @@ var gMustLoadSidebar = false;
var gProgressMeterPanel = null;
var gProgressCollapseTimer = null;
var gPrefService = null;
var appCore = null;
var gBrowser = null;
var gNavToolbox = null;
var gSidebarCommand = "";
var gInPrintPreviewMode = false;
+let gDownloadMgr = null;
// Global variable that holds the nsContextMenu instance.
var gContextMenu = null;
var gChromeState = null; // chrome state before we went into print preview
var gSanitizeListener = null;
var gAutoHideTabbarPrefListener = null;
var gBookmarkAllTabsHandler = null;
#ifdef XP_MACOSX
var gClickAndHoldTimer = null;
#endif
+#ifndef XP_MACOSX
+var gEditUIVisible = true;
+#endif
+
/**
* We can avoid adding multiple load event listeners and save some time by adding
* one listener that calls all real handlers.
*/
function pageShowEventHandlers(event)
{
// Filter out events that are not about the document load we are interested in
@@ -165,16 +176,55 @@ function UpdateBackForwardCommands(aWebN
if (forwardDisabled == aWebNavigation.canGoForward) {
if (forwardDisabled)
forwardBroadcaster.removeAttribute("disabled");
else
forwardBroadcaster.setAttribute("disabled", true);
}
}
+var UnifiedBackForwardButton = {
+ unify: function() {
+ var backButton = document.getElementById("back-button");
+ if (!backButton || !backButton.nextSibling || backButton.nextSibling.id != "forward-button")
+ return; // back and forward buttons aren't adjacent
+
+ var wrapper = document.createElement("toolbaritem");
+ wrapper.id = "unified-back-forward-button";
+ wrapper.className = "chromeclass-toolbar-additional";
+ wrapper.setAttribute("context", "backMenu");
+
+ var toolbar = backButton.parentNode;
+ toolbar.insertBefore(wrapper, backButton);
+
+ var forwardButton = backButton.nextSibling;
+ wrapper.appendChild(backButton);
+ wrapper.appendChild(forwardButton);
+
+ var popup = backButton.getElementsByTagName("menupopup")[0].cloneNode(true);
+ wrapper.appendChild(popup);
+
+ this._unified = true;
+ },
+
+ separate: function() {
+ if (!this._unified)
+ return;
+
+ var wrapper = document.getElementById("unified-back-forward-button");
+ var toolbar = wrapper.parentNode;
+
+ toolbar.insertBefore(wrapper.firstChild, wrapper); // Back button
+ toolbar.insertBefore(wrapper.firstChild, wrapper); // Forward button
+ toolbar.removeChild(wrapper);
+
+ this._unified = false;
+ }
+};
+
#ifdef XP_MACOSX
/**
* Click-and-Hold implementation for the Back and Forward buttons
* XXXmano: should this live in toolbarbutton.xml?
*/
function ClickAndHoldMouseDownCallback(aButton)
{
aButton.open = true;
@@ -884,17 +934,18 @@ function delayedStartup()
var os = Components.classes["@mozilla.org/observer-service;1"].getService(Components.interfaces.nsIObserverService);
os.addObserver(gSessionHistoryObserver, "browser:purge-session-history", false);
os.addObserver(gXPInstallObserver, "xpinstall-install-blocked", false);
if (!gPrefService)
gPrefService = Components.classes["@mozilla.org/preferences-service;1"]
.getService(Components.interfaces.nsIPrefBranch2);
BrowserOffline.init();
-
+ OfflineApps.init();
+
if (gURLBar && document.documentElement.getAttribute("chromehidden").indexOf("toolbar") != -1) {
gURLBar.setAttribute("readonly", "true");
gURLBar.setAttribute("enablehistory", "false");
}
gBrowser.addEventListener("pageshow", function(evt) { setTimeout(pageShowEventHandlers, 0, evt); }, true);
window.addEventListener("keypress", ctrlNumberTabSelection, false);
@@ -903,16 +954,17 @@ function delayedStartup()
Cc["@mozilla.org/login-manager;1"].getService(Ci.nsILoginManager);
if (gMustLoadSidebar) {
var sidebar = document.getElementById("sidebar");
var sidebarBox = document.getElementById("sidebar-box");
sidebar.setAttribute("src", sidebarBox.getAttribute("src"));
}
+ UnifiedBackForwardButton.unify();
UpdateUrlbarSearchSplitterState();
try {
placesMigrationTasks();
} catch(ex) {}
initBookmarksToolbar();
PlacesStarButton.init();
@@ -1044,23 +1096,43 @@ function delayedStartup()
gBookmarkAllTabsHandler = new BookmarkAllTabsHandler();
// Attach a listener to watch for "command" events bubbling up from error
// pages. This lets us fix bugs like 401575 which require error page UI to
// do privileged things, without letting error pages have any privilege
// themselves.
gBrowser.addEventListener("command", BrowserOnCommand, false);
+ // Delayed initialization of the livemarks update timer.
+ // Livemark updates don't need to start until after bookmark UI
+ // such as the toolbar has initialized. Starting 5 seconds after
+ // delayedStartup in order to stagger this before the download
+ // manager starts (see below).
+ setTimeout(function() PlacesUtils.livemarks.start(), 5000);
+
// Initialize the download manager some time after the app starts so that
// auto-resume downloads begin (such as after crashing or quitting with
// active downloads) and speeds up the first-load of the download manager UI.
// If the user manually opens the download manager before the timeout, the
// downloads will start right away, and getting the service again won't hurt.
- setTimeout(function() Cc["@mozilla.org/download-manager;1"].
- getService(Ci.nsIDownloadManager), 10000);
+ setTimeout(function() {
+ gDownloadMgr = Cc["@mozilla.org/download-manager;1"].
+ getService(Ci.nsIDownloadManager);
+
+ // Initialize the downloads monitor panel listener
+ gDownloadMgr.addListener(DownloadMonitorPanel);
+ DownloadMonitorPanel.init();
+ }, 10000);
+
+#ifndef XP_MACOSX
+ updateEditUIVisibility();
+ let placesContext = document.getElementById("placesContext");
+ placesContext.addEventListener("popupshowing", updateEditUIVisibility, false);
+ placesContext.addEventListener("popuphiding", updateEditUIVisibility, false);
+#endif
}
function BrowserShutdown()
{
try {
FullZoom.destroy();
}
catch(ex) {
@@ -1086,16 +1158,17 @@ function BrowserShutdown()
} catch (ex) {
Components.utils.reportError(ex);
}
if (gSanitizeListener)
gSanitizeListener.shutdown();
BrowserOffline.uninit();
+ OfflineApps.uninit();
var windowManager = Components.classes['@mozilla.org/appshell/window-mediator;1'].getService();
var windowManagerInterface = windowManager.QueryInterface(Components.interfaces.nsIWindowMediator);
var enumerator = windowManagerInterface.getEnumerator(null);
enumerator.getNext();
if (!enumerator.hasMoreElements()) {
document.persist("sidebar-box", "sidebarcommand");
document.persist("sidebar-box", "width");
@@ -1264,23 +1337,25 @@ function ctrlNumberTabSelection(event)
if (!(document.commandDispatcher.focusedElement instanceof HTMLAnchorElement)) {
// Don't let winxp beep on ALT+ENTER, since the URL bar uses it.
event.preventDefault();
return;
}
}
#ifdef XP_MACOSX
- if (!event.metaKey)
+ // Mac: Cmd+number
+ if (!event.metaKey || event.ctrlKey || event.altKey || event.shiftKey)
#else
#ifdef XP_UNIX
- // don't let tab selection clash with numeric accesskeys (bug 366084)
- if (!event.altKey || event.shiftKey)
+ // Linux: Alt+number
+ if (!event.altKey || event.ctrlKey || event.metaKey || event.shiftKey)
#else
- if (!event.ctrlKey)
+ // Windows: Ctrl+number
+ if (!event.ctrlKey || event.metaKey || event.altKey || event.shiftKey)
#endif
#endif
return;
// \d in a RegExp will find any Unicode character with the "decimal digit"
// property (Nd)
var regExp = /\d/;
if (!regExp.test(String.fromCharCode(event.charCode)))
@@ -1404,22 +1479,24 @@ function BrowserHandleShiftBackspace()
case 1:
goDoCommand("cmd_scrollPageDown");
break;
}
}
function BrowserBackMenu(event)
{
- return FillHistoryMenu(event.target, "back");
+ var menuType = UnifiedBackForwardButton._unified ? "unified" : "back";
+ return FillHistoryMenu(event.target, menuType);
}
function BrowserForwardMenu(event)
{
- return FillHistoryMenu(event.target, "forward");
+ var menuType = UnifiedBackForwardButton._unified ? "unified" : "forward";
+ return FillHistoryMenu(event.target, menuType);
}
function BrowserStop()
{
try {
const stopFlags = nsIWebNavigation.STOP_ALL;
getWebNavigation().stop(stopFlags);
}
@@ -1491,23 +1568,30 @@ function loadOneOrMoreURIs(aURIString)
// so that we don't disrupt startup
try {
gBrowser.loadTabs(aURIString.split("|"), false, true);
}
catch (e) {
}
}
-function openLocation()
+function focusAndSelectUrlBar()
{
if (gURLBar && isElementVisible(gURLBar) && !gURLBar.readOnly) {
gURLBar.focus();
gURLBar.select();
+ return true;
+ }
+ return false;
+}
+
+function openLocation()
+{
+ if (focusAndSelectUrlBar())
return;
- }
#ifdef XP_MACOSX
if (window.location.href != getBrowserURL()) {
var win = getTopWin();
if (win) {
// If there's an open browser window, it should handle this command
win.focus()
win.openLocation();
}
@@ -1899,20 +1983,35 @@ function URLBarSetURI(aURI) {
value = aURI.spec;
if (value == "about:blank") {
// Replace "about:blank" with an empty string
// only if there's no opener (bug 370555).
if (!content.opener)
value = "";
} else {
- // try to decode as UTF-8
- try {
- value = decodeURI(value).replace(/%/g, "%25");
- } catch(e) {}
+ // Try to decode as UTF-8 if there's no encoding sequence that we would break.
+ if (!/%25(?:3B|2F|3F|3A|40|26|3D|2B|24|2C|23)/i.test(value))
+ try {
+ value = decodeURI(value)
+ // 1. decodeURI decodes %25 to %, which creates unintended
+ // encoding sequences. Re-encode it, unless it's part of
+ // a sequence that survived decodeURI, i.e. one for:
+ // ';', '/', '?', ':', '@', '&', '=', '+', '$', ',', '#'
+ // (RFC 3987 section 3.2)
+ // 2. Re-encode whitespace so that it doesn't get eaten away
+ // by the location bar (bug 410726).
+ .replace(/%(?!3B|2F|3F|3A|40|26|3D|2B|24|2C|23)|[\r\n\t]/ig,
+ encodeURIComponent);
+ } catch (e) {}
+
+ // Encode bidirectional formatting characters.
+ // (RFC 3987 sections 3.2 and 4.1 paragraph 6)
+ value = value.replace(/[\u200e\u200f\u202a\u202b\u202c\u202d\u202e]/g,
+ encodeURIComponent);
state = "valid";
}
}
gURLBar.value = value;
SetPageProxyState(state);
}
@@ -2872,45 +2971,77 @@ const BrowserSearch = {
function FillHistoryMenu(aParent, aMenu)
{
// Remove old entries if any
deleteHistoryItems(aParent);
var webNav = getWebNavigation();
var sessionHistory = webNav.sessionHistory;
+ var bundle_browser = document.getElementById("bundle_browser");
var count = sessionHistory.count;
var index = sessionHistory.index;
var end;
var j;
var entry;
switch (aMenu)
{
case "back":
end = (index > MAX_HISTORY_MENU_ITEMS) ? index - MAX_HISTORY_MENU_ITEMS : 0;
if ((index - 1) < end) return false;
for (j = index - 1; j >= end; j--)
{
entry = sessionHistory.getEntryAtIndex(j, false);
if (entry)
- createMenuItem(aParent, j, entry.title);
+ createMenuItem(aParent, j, entry.title || entry.URI.spec,
+ bundle_browser.getString("tabHistory.goBack"));
}
break;
case "forward":
end = ((count-index) > MAX_HISTORY_MENU_ITEMS) ? index + MAX_HISTORY_MENU_ITEMS : count - 1;
if ((index + 1) > end) return false;
for (j = index + 1; j <= end; j++)
{
entry = sessionHistory.getEntryAtIndex(j, false);
if (entry)
- createMenuItem(aParent, j, entry.title);
+ createMenuItem(aParent, j, entry.title || entry.URI.spec,
+ bundle_browser.getString("tabHistory.goForward"));
}
break;
+ case "unified":
+ if (count <= 1) // don't display the popup for a single item
+ return false;
+
+ var half_length = Math.floor(MAX_HISTORY_MENU_ITEMS / 2);
+ var start = Math.max(index - half_length, 0);
+ end = Math.min(start == 0 ? MAX_HISTORY_MENU_ITEMS : index + half_length + 1, count);
+ if (end == count)
+ start = Math.max(count - MAX_HISTORY_MENU_ITEMS, 0);
+
+ var tooltips = [
+ bundle_browser.getString("tabHistory.goBack"),
+ bundle_browser.getString("tabHistory.current"),
+ bundle_browser.getString("tabHistory.goForward")
+ ];
+ var classNames = ["unified-nav-back", "unified-nav-current", "unified-nav-forward"];
+
+ for (var j = end - 1; j >= start; j--) {
+ entry = sessionHistory.getEntryAtIndex(j, false);
+ var tooltip = tooltips[j < index ? 0 : j == index ? 1 : 2];
+ var className = classNames[j < index ? 0 : j == index ? 1 : 2];
+ var item = createMenuItem(aParent, j, entry.title || entry.URI.spec, tooltip, className);
+
+ if (j == index) { // mark the current history item
+ item.setAttribute("type", "radio");
+ item.setAttribute("checked", "true");
+ }
+ }
+ break;
}
return true;
}
function addToUrlbarHistory(aUrlToAdd)
{
if (!aUrlToAdd)
@@ -2922,22 +3053,26 @@ function addToUrlbarHistory(aUrlToAdd)
if (aUrlToAdd.indexOf(" ") == -1) {
PlacesUtils.markPageAsTyped(aUrlToAdd);
}
}
catch(ex) {
}
}
-function createMenuItem( aParent, aIndex, aLabel)
+function createMenuItem(aParent, aIndex, aLabel, aTooltipText, aClassName)
{
var menuitem = document.createElement( "menuitem" );
menuitem.setAttribute( "label", aLabel );
menuitem.setAttribute( "index", aIndex );
- aParent.appendChild( menuitem );
+ if (aTooltipText)
+ menuitem.setAttribute("tooltiptext", aTooltipText);
+ if (aClassName)
+ menuitem.className = aClassName;
+ return aParent.appendChild(menuitem);
}
function deleteHistoryItems(aParent)
{
var children = aParent.childNodes;
for (var i = children.length - 1; i >= 0; --i)
{
var index = children[i].getAttribute("index");
@@ -2946,16 +3081,22 @@ function deleteHistoryItems(aParent)
}
}
function toJavaScriptConsole()
{
toOpenWindowByType("global:console", "chrome://global/content/console.xul");
}
+function BrowserDownloadsUI()
+{
+ Cc["@mozilla.org/download-manager-ui;1"].
+ getService(Ci.nsIDownloadManagerUI).show();
+}
+
function toOpenWindowByType(inType, uri, features)
{
var windowManager = Components.classes['@mozilla.org/appshell/window-mediator;1'].getService();
var windowManagerInterface = windowManager.QueryInterface(Components.interfaces.nsIWindowMediator);
var topWindow = windowManagerInterface.getMostRecentWindow(inType);
if (topWindow)
topWindow.focus();
@@ -3020,16 +3161,18 @@ function BrowserCustomizeToolbar()
// Disable the toolbar context menu items
var menubar = document.getElementById("main-menubar");
for (var i = 0; i < menubar.childNodes.length; ++i)
menubar.childNodes[i].setAttribute("disabled", true);
var cmd = document.getElementById("cmd_CustomizeToolbars");
cmd.setAttribute("disabled", "true");
+ UnifiedBackForwardButton.separate();
+
var splitter = document.getElementById("urlbar-search-splitter");
if (splitter)
splitter.parentNode.removeChild(splitter);
#ifdef TOOLBAR_CUSTOMIZATION_SHEET
var sheetFrame = document.getElementById("customizeToolbarSheetIFrame");
sheetFrame.hidden = false;
// XXXmano: there's apparently no better way to get this when the iframe is
@@ -3056,18 +3199,23 @@ function BrowserToolboxCustomizeDone(aTo
if (aToolboxChanged) {
gURLBar = document.getElementById("urlbar");
gProxyButton = document.getElementById("page-proxy-button");
gProxyFavIcon = document.getElementById("page-proxy-favicon");
gProxyDeck = document.getElementById("page-proxy-deck");
gHomeButton.updateTooltip();
gIdentityHandler._cacheElements();
window.XULBrowserWindow.init();
+
+#ifndef XP_MACOSX
+ updateEditUIVisibility();
+#endif
}
+ UnifiedBackForwardButton.unify();
UpdateUrlbarSearchSplitterState();
// Update the urlbar
if (gURLBar) {
URLBarSetURI();
XULBrowserWindow.asyncUpdateUI();
PlacesStarButton.updateState();
}
@@ -3096,16 +3244,77 @@ function BrowserToolboxCustomizeDone(aTo
initBookmarksToolbar();
#ifndef TOOLBAR_CUSTOMIZATION_SHEET
// XXX Shouldn't have to do this, but I do
window.focus();
#endif
}
+/**
+ * Update the global flag that tracks whether or not any edit UI (the Edit menu,
+ * edit-related items in the context menu, and edit-related toolbar buttons
+ * is visible, then update the edit commands' enabled state accordingly. We use
+ * this flag to skip updating the edit commands on focus or selection changes
+ * when no UI is visible to improve performance (including pageload performance,
+ * since focus changes when you load a new page).
+ *
+ * If UI is visible, we use goUpdateGlobalEditMenuItems to set the commands'
+ * enabled state so the UI will reflect it appropriately.
+ *
+ * If the UI isn't visible, we enable all edit commands so keyboard shortcuts
+ * still work and just lazily disable them as needed when the user presses a
+ * shortcut.
+ *
+ * This doesn't work on Mac, since Mac menus flash when users press their
+ * keyboard shortcuts, so edit UI is essentially always visible on the Mac,
+ * and we need to always update the edit commands. Thus on Mac this function
+ * is a no op.
+ */
+function updateEditUIVisibility()
+{
+#ifndef XP_MACOSX
+ let editMenuPopupState = document.getElementById("menu_EditPopup").state;
+ let contextMenuPopupState = document.getElementById("contentAreaContextMenu").state;
+ let placesContextMenuPopupState = document.getElementById("placesContext").state;
+
+ // The UI is visible if the Edit menu is opening or open, if the context menu
+ // is open, or if the toolbar has been customized to include the Cut, Copy,
+ // or Paste toolbar buttons.
+ gEditUIVisible = editMenuPopupState == "showing" ||
+ editMenuPopupState == "open" ||
+ contextMenuPopupState == "showing" ||
+ contextMenuPopupState == "open" ||
+ placesContextMenuPopupState == "showing" ||
+ placesContextMenuPopupState == "open" ||
+ document.getElementById("cut-button") ||
+ document.getElementById("copy-button") ||
+ document.getElementById("paste-button") ? true : false;
+
+ // If UI is visible, update the edit commands' enabled state to reflect
+ // whether or not they are actually enabled for the current focus/selection.
+ if (gEditUIVisible)
+ goUpdateGlobalEditMenuItems();
+
+ // Otherwise, enable all commands, so that keyboard shortcuts still work,
+ // then lazily determine their actual enabled state when the user presses
+ // a keyboard shortcut.
+ else {
+ goSetCommandEnabled("cmd_undo", true);
+ goSetCommandEnabled("cmd_redo", true);
+ goSetCommandEnabled("cmd_cut", true);
+ goSetCommandEnabled("cmd_copy", true);
+ goSetCommandEnabled("cmd_paste", true);
+ goSetCommandEnabled("cmd_selectAll", true);
+ goSetCommandEnabled("cmd_delete", true);
+ goSetCommandEnabled("cmd_switchTextDirection", true);
+ }
+#endif
+}
+
var FullScreen =
{
toggle: function()
{
// show/hide all menubars, toolbars, and statusbars (except the full screen toolbar)
this.showXULChrome("toolbar", window.fullScreen);
this.showXULChrome("statusbar", window.fullScreen);
document.getElementById("fullScreenItem").setAttribute("checked", !window.fullScreen);
@@ -3274,17 +3483,20 @@ nsBrowserStatusHandler.prototype =
setDefaultStatus : function(status)
{
this.defaultStatus = status;
this.updateStatusField();
},
setOverLink : function(link, b)
{
- this.overLink = link;
+ // Encode bidirectional formatting characters.
+ // (RFC 3987 sections 3.2 and 4.1 paragraph 6)
+ this.overLink = link.replace(/[\u200e\u200f\u202a\u202b\u202c\u202d\u202e]/g,
+ encodeURIComponent);
this.updateStatusField();
},
updateStatusField : function()
{
var text = this.overLink || this.status || this.jsStatus || this.jsDefaultStatus || this.defaultStatus;
// check the current value so we don't trigger an attribute change
@@ -3358,16 +3570,21 @@ nsBrowserStatusHandler.prototype =
else if (aStateFlags & nsIWebProgressListener.STATE_STOP) {
if (aStateFlags & nsIWebProgressListener.STATE_IS_NETWORK) {
if (aWebProgress.DOMWindow == content) {
if (aRequest)
this.endDocumentLoad(aRequest, aStatus);
var browser = gBrowser.mCurrentBrowser;
if (!gBrowser.mTabbedMode && !browser.mIconURL)
gBrowser.useDefaultIcon(gBrowser.mCurrentTab);
+
+ if (Components.isSuccessCode(aStatus) &&
+ content.document.documentElement.getAttribute("manifest")) {
+ OfflineApps.offlineAppRequested(content);
+ }
}
}
// This (thanks to the filter) is a network stop or the last
// request stop outside of loading the document, stop throbbers
// and progress bars and such
if (aRequest) {
var msg = "";
@@ -4816,16 +5033,127 @@ var BrowserOffline = {
var offlineLocked = gPrefService.prefIsLocked("network.online");
if (offlineLocked)
this._uiElement.setAttribute("disabled", "true");
this._uiElement.setAttribute("checked", aOffline);
}
};
+var OfflineApps = {
+ /////////////////////////////////////////////////////////////////////////////
+ // OfflineApps Public Methods
+ init: function ()
+ {
+ // XXX: empty init left as a placeholder for patch in bug 397417
+ },
+
+ uninit: function ()
+ {
+ // XXX: empty uninit left as a placeholder for patch in bug 397417
+ },
+
+ /////////////////////////////////////////////////////////////////////////////
+ // OfflineApps Implementation Methods
+
+ // XXX: _getBrowserWindowForContentWindow and _getBrowserForContentWindow
+ // were taken from browser/components/feeds/src/WebContentConverter.
+ _getBrowserWindowForContentWindow: function(aContentWindow) {
+ return aContentWindow.QueryInterface(Ci.nsIInterfaceRequestor)
+ .getInterface(Ci.nsIWebNavigation)
+ .QueryInterface(Ci.nsIDocShellTreeItem)
+ .rootTreeItem
+ .QueryInterface(Ci.nsIInterfaceRequestor)
+ .getInterface(Ci.nsIDOMWindow)
+ .wrappedJSObject;
+ },
+
+ _getBrowserForContentWindow: function(aBrowserWindow, aContentWindow) {
+ // This depends on pseudo APIs of browser.js and tabbrowser.xml
+ aContentWindow = aContentWindow.top;
+ var browsers = aBrowserWindow.getBrowser().browsers;
+ for (var i = 0; i < browsers.length; ++i) {
+ if (browsers[i].contentWindow == aContentWindow)
+ return browsers[i];
+ }
+ },
+
+ offlineAppRequested: function(aContentWindow) {
+ var browserWindow = this._getBrowserWindowForContentWindow(aContentWindow);
+ var browser = this._getBrowserForContentWindow(browserWindow,
+ aContentWindow);
+
+ var currentURI = browser.webNavigation.currentURI;
+ var pm = Cc["@mozilla.org/permissionmanager;1"].
+ getService(Ci.nsIPermissionManager);
+
+ // don't bother showing UI if the user has already made a decision
+ if (pm.testExactPermission(currentURI, "offline-app") !=
+ Ci.nsIPermissionManager.UNKNOWN_ACTION)
+ return;
+
+ try {
+ if (gPrefService.getBoolPref("offline-apps.allow_by_default")) {
+ // all pages can use offline capabilities, no need to ask the user
+ return;
+ }
+ } catch(e) {
+ // this pref isn't set by default, ignore failures
+ }
+
+ var notificationBox = gBrowser.getNotificationBox(browser);
+ var notification = notificationBox.getNotificationWithValue("offline-app-requested");
+ if (!notification) {
+ var bundle_browser = document.getElementById("bundle_browser");
+
+ var buttons = [{
+ label: bundle_browser.getString("offlineApps.allow"),
+ accessKey: bundle_browser.getString("offlineApps.allowAccessKey"),
+ callback: function() { OfflineApps.allowSite(); }
+ }];
+
+ const priority = notificationBox.PRIORITY_INFO_LOW;
+ var message = bundle_browser.getFormattedString("offlineApps.available",
+ [ currentURI.host ]);
+ notificationBox.appendNotification(message, "offline-app-requested",
+ "chrome://browser/skin/Info.png",
+ priority, buttons);
+ }
+ },
+
+ allowSite: function() {
+ var currentURI = gBrowser.selectedBrowser.webNavigation.currentURI;
+ var pm = Cc["@mozilla.org/permissionmanager;1"].
+ getService(Ci.nsIPermissionManager);
+ pm.add(currentURI, "offline-app", Ci.nsIPermissionManager.ALLOW_ACTION);
+
+ // When a site is enabled while loading, <link rel="offline-resource">
+ // resources will start fetching immediately. This one time we need to
+ // do it ourselves.
+ this._startFetching();
+ },
+
+ _startFetching: function() {
+ var manifest = content.document.documentElement.getAttribute("manifest");
+ if (!manifest)
+ return;
+
+ var ios = Cc["@mozilla.org/network/io-service;1"].
+ getService(Ci.nsIIOService);
+
+ var contentURI = ios.newURI(content.location.href, null, null);
+ var manifestURI = ios.newURI(manifest, content.document.characterSet,
+ contentURI);
+
+ var updateService = Cc["@mozilla.org/offlinecacheupdate-service;1"].
+ getService(Ci.nsIOfflineCacheUpdateService);
+ updateService.scheduleUpdate(manifestURI, contentURI);
+ }
+};
+
function WindowIsClosing()
{
var browser = getBrowser();
var cn = browser.tabContainer.childNodes;
var numtabs = cn.length;
var reallyClose = true;
for (var i = 0; reallyClose && i < numtabs; ++i) {
@@ -5738,26 +6066,33 @@ IdentityHandler.prototype = {
body = this._stringBundle.getString("identity.unknown.body");
}
// Push the appropriate strings out to the UI
this._identityPopupContent.textContent = body;
this._identityPopupContentSupp.textContent = supplemental;
this._identityPopupContentVerif.textContent = verifier;
},
-
+
+ hideIdentityPopup : function() {
+ this._identityPopup.hidePopup();
+ },
+
/**
* Click handler for the identity-box element in primary chrome.
*/
- handleIdentityClick : function(event) {
+ handleIdentityButtonEvent : function(event) {
+
event.stopPropagation();
-
- if (event.button != 0)
- return; // We only want left-clicks
-
+
+ if ((event.type == "click" && event.button != 0) ||
+ (event.type == "keypress" && event.charCode != KeyEvent.DOM_VK_SPACE &&
+ event.keyCode != KeyEvent.DOM_VK_RETURN))
+ return; // Left click, space or enter only
+
// Make sure that the display:none style we set in xul is removed now that
// the popup is actually needed
this._identityPopup.hidden = false;
// Tell the popup to consume dismiss clicks, to avoid bug 395314
this._identityPopup.popupBoxObject
.setConsumeRollupEvent(Ci.nsIPopupBoxObject.ROLLUP_CONSUME);
@@ -5775,8 +6110,115 @@ var gIdentityHandler;
* Returns the singleton instance of the identity handler class. Should always be
* used instead of referencing the global variable directly or creating new instances
*/
function getIdentityHandler() {
if (!gIdentityHandler)
gIdentityHandler = new IdentityHandler();
return gIdentityHandler;
}
+
+let DownloadMonitorPanel = {
+ //////////////////////////////////////////////////////////////////////////////
+ //// DownloadMonitorPanel Member Variables
+
+ _panel: null,
+ _activeStr: null,
+ _pausedStr: null,
+ _lastTime: Infinity,
+
+ //////////////////////////////////////////////////////////////////////////////
+ //// DownloadMonitorPanel Public Methods
+
+ /**
+ * Initialize the status panel and member variables
+ */
+ init: function DMP_init() {
+ // Initialize "private" member variables
+ this._panel = document.getElementById("download-monitor");
+
+ // Cache the status strings
+ let (bundle = document.getElementById("bundle_browser")) {
+ this._activeStr = bundle.getString("activeDownloads");
+ this._pausedStr = bundle.getString("pausedDownloads");
+ }
+
+ this.updateStatus();
+ },
+
+ /**
+ * Update status based on the number of active and paused downloads
+ */
+ updateStatus: function DMP_updateStatus() {
+ let numActive = gDownloadMgr.activeDownloadCount;
+
+ // Hide the panel and reset the "last time" if there's no downloads
+ if (numActive == 0) {
+ this._panel.hidden = true;
+ this._lastTime = Infinity;
+
+ return;
+ }
+
+ // Find the download with the longest remaining time
+ let numPaused = 0;
+ let maxTime = -Infinity;
+ let dls = gDownloadMgr.activeDownloads;
+ while (dls.hasMoreElements()) {
+ let dl = dls.getNext().QueryInterface(Ci.nsIDownload);
+ if (dl.state == gDownloadMgr.DOWNLOAD_DOWNLOADING) {
+ // Figure out if this download takes longer
+ if (dl.speed > 0 && dl.size > 0)
+ maxTime = Math.max(maxTime, (dl.size - dl.amountTransferred) / dl.speed);
+ else
+ maxTime = -1;
+ }
+ else if (dl.state == gDownloadMgr.DOWNLOAD_PAUSED)
+ numPaused++;
+ }
+
+ // Get the remaining time string and last sec for time estimation
+ let timeLeft;
+ [timeLeft, this._lastSec] = DownloadUtils.getTimeLeft(maxTime, this._lastSec);
+
+ // Figure out how many downloads are currently downloading
+ let numDls = numActive - numPaused;
+ let status = this._activeStr;
+
+ // If all downloads are paused, show the paused message instead
+ if (numDls == 0) {
+ numDls = numPaused;
+ status = this._pausedStr;
+ }
+
+ // Get the correct plural form and insert the number of downloads and time
+ // left message if necessary
+ status = PluralForm.get(numDls, status);
+ status = status.replace("#1", numDls);
+ status = status.replace("#2", timeLeft);
+
+ // Update the panel and show it
+ this._panel.label = status;
+ this._panel.hidden = false;
+ },
+
+ //////////////////////////////////////////////////////////////////////////////
+ //// nsIDownloadProgressListener
+
+ /**
+ * Update status for download progress changes
+ */
+ onProgressChange: function() {
+ this.updateStatus();
+ },
+
+ /**
+ * Update status for download state changes
+ */
+ onDownloadStateChange: function() {
+ this.updateStatus();
+ },
+
+ //////////////////////////////////////////////////////////////////////////////
+ //// nsISupports
+
+ QueryInterface: XPCOMUtils.generateQI([Ci.nsIDownloadProgressListener]),
+};
--- a/browser/base/content/browser.xul
+++ b/browser/base/content/browser.xul
@@ -101,17 +101,18 @@
<!-- for search and content formfill/pw manager -->
<panel type="autocomplete" chromedir="&locale.dir;" id="PopupAutoComplete" noautofocus="true" hidden="true"/>
<!-- for url bar autocomplete -->
<panel type="autocomplete-richlistbox" chromedir="&locale.dir;" id="PopupAutoCompleteRichResult" noautofocus="true" hidden="true"/>
<panel id="editBookmarkPanel" orient="vertical" hidden="true"
- onpopupshown="PlacesCommandHook.editBookmarkPanelShown();">
+ onpopupshown="PlacesCommandHook.editBookmarkPanelShown();"
+ label="&bookmarkPageCmd2.label;">
<vbox id="editBookmarkPanelContent" flex="1"/>
<hbox flex="1">
<spacer flex="1"/>
<button id="editBookmarkPanelDeleteButton"
label="&editBookmark.delete.label;"
oncommand="PlacesCommandHook.deleteButtonOnCommand();"/>
<button id="editBookmarkPanelDoneButton"
label="&editBookmark.done.label;"
@@ -132,46 +133,49 @@
onpopupshowing="gPopupBlockerObserver.fillPopupList(event);">
<menuitem observes="blockedPopupAllowSite"/>
<menuitem observes="blockedPopupEditSettings"/>
<menuitem observes="blockedPopupDontShowMessage"/>
<menuseparator observes="blockedPopupsSeparator"/>
</popup>
<popup id="contentAreaContextMenu"
- onpopupshowing="if (event.target != this) return true; gContextMenu = new nsContextMenu(this, window.getBrowser()); return gContextMenu.shouldDisplay;"
- onpopuphiding="if (event.target == this) { gContextMenu = null; }">
+ onpopupshowing="if (event.target != this) return true; updateEditUIVisibility(); gContextMenu = new nsContextMenu(this, window.getBrowser()); return gContextMenu.shouldDisplay;"
+ onpopuphiding="if (event.target == this) { gContextMenu = null; updateEditUIVisibility(); }">
#include browser-context.inc
</popup>
<popup id="placesContext"/>
<!-- Popup for site identity information -->
- <panel id="identity-popup" position="after_start" hidden="true" noautofocus="true">
+ <panel id="identity-popup" position="after_start" hidden="true" noautofocus="true"
+ onpopupshown="document.getElementById('identity-popup-more-info-link').focus();"
+ onpopuphidden="focusAndSelectUrlBar();" norestorefocus="true">
<hbox id="identity-popup-container" align="top">
<image id="identity-popup-icon"/>
<vbox id="identity-popup-content-box">
<!-- Title Bar -->
- <label id="identity-popup-title"/>
+ <label id="identity-popup-title" control="identity-popup"/>
<!-- Content area -->
<description id="identity-popup-content"/>
<description id="identity-popup-content-supplemental"/>
<description id="identity-popup-content-verifier"/>
<hbox id="identity-popup-encryption" flex="1">
<vbox>
<image id="identity-popup-encryption-icon"/>
<spacer flex="1"/>
</vbox>
<description id="identity-popup-encryption-label" flex="1"/>
</hbox>
<spacer flex="1"/>
<!-- Footer link to page info -->
<label id="identity-popup-more-info-link"
class="text-link plain"
value="&identity.moreInfoLinkText;"
+ onblur="getIdentityHandler().hideIdentityPopup();"
onclick="getIdentityHandler().handleMoreInfoClick(event);"/>
</vbox>
</hbox>
</panel>
<tooltip id="urlTooltip">
<label crop="center" flex="1"/>
</tooltip>
@@ -264,18 +268,19 @@
maxrows="10"
newlines="stripsurroundingwhitespace"
oninput="URLBarOnInput(event);"
ontextentered="return handleURLBarCommand(param);"
ontextreverted="return handleURLBarRevert();"
pageproxystate="invalid">
<!-- Use onclick instead of normal popup= syntax since the popup
code fires onmousedown, and hence eats our favicon drag events -->
- <box id="identity-box"
- onclick="getIdentityHandler().handleIdentityClick(event);">
+ <box id="identity-box" role="button"
+ onclick="getIdentityHandler().handleIdentityButtonEvent(event);"
+ onkeypress="getIdentityHandler().handleIdentityButtonEvent(event);">
<hbox align="center">
<deck id="page-proxy-deck" onclick="PageProxyClickHandler(event);">
<image id="page-proxy-button"
ondraggesture="PageProxyDragGesture(event);"
tooltiptext="&proxyIcon.tooltip;"/>
<image id="page-proxy-favicon" validate="never"
ondraggesture="PageProxyDragGesture(event);"
onload="this.parentNode.selectedIndex = 1;
@@ -460,16 +465,19 @@
</panel>
#endif
<findbar browserid="content" id="FindToolbar"/>
<statusbar class="chromeclass-status" id="status-bar"
ondragdrop="nsDragAndDrop.drop(event, contentAreaDNDObserver);">
<statusbarpanel id="statusbar-display" label="" flex="1"/>
+ <statusbarpanel id="download-monitor" class="statusbarpanel-iconic-text"
+ tooltiptext="&downloadMonitor.tooltip;" hidden="true"
+ ondblclick="doCommand();" command="Tools:Downloads"/>
<statusbarpanel class="statusbarpanel-progress" collapsed="true" id="statusbar-progresspanel">
<progressmeter class="progressmeter-statusbar" id="statusbar-icon" mode="normal" value="0"/>
</statusbarpanel>
<statusbarpanel id="security-button" class="statusbarpanel-iconic-text"
ondblclick="if (event.button == 0) displaySecurityInfo();"/>
<statusbarpanel id="page-report-button" type="menu"
class="statusbarpanel-menu-iconic"
tooltiptext="&pageReportIcon.tooltip;">
--- a/browser/base/content/credits.xhtml
+++ b/browser/base/content/credits.xhtml
@@ -459,17 +459,17 @@
<li>Radiant Core</li>
<li>silverorange</li>
<li>Revver</li>
<li></li>
<li>MozillaZine Community</li>
</ul>
</div>
- <p id="gecko" class="center">&credit.poweredByGecko;®</p>
+ <p id="gecko" class="center">&credit.poweredByGeckoReg;</p>
<p class="footnote">
&brandFullName;™ &license.part0; ©1998-2008 &license.part1;
<a href="" link="about:credits" onclick="visitLink(event);">&license.contrib;</a>,
&license.part2;
<a href="" link="about:license" onclick="visitLink(event);">about:license</a>
&license.part3;</p>
--- a/browser/base/content/nsContextMenu.js
+++ b/browser/base/content/nsContextMenu.js
@@ -78,16 +78,21 @@ function nsContextMenu(aXulMenu, aBrowse
this.inFrame = false;
this.hasBGImage = false;
this.isTextSelected = false;
this.isContentSelected = false;
this.inDirList = false;
this.shouldDisplay = true;
this.isDesignMode = false;
this.possibleSpellChecking = false;
+ this.ellipsis = "\u2026";
+ try {
+ this.ellipsis = gPrefService.getComplexValue("intl.ellipsis",
+ Ci.nsIPrefLocalizedString).data;
+ } catch (e) { }
// Initialize new menu.
this.initMenu(aXulMenu, aBrowser);
}
// Prototype for nsContextMenu "class."
nsContextMenu.prototype = {
// onDestroy is a no-op at this point.
@@ -244,17 +249,17 @@ nsContextMenu.prototype = {
var hostLabel = "";
try {
hostLabel = uri.host;
} catch (ex) { }
if (hostLabel) {
var shortenedUriHost = hostLabel.replace(/^www\./i,"");
if (shortenedUriHost.length > 15)
- shortenedUriHost = shortenedUriHost.substr(0,15) + "...";
+ shortenedUriHost = shortenedUriHost.substr(0,15) + this.ellipsis;
blockImage.label = gNavigatorBundle.getFormattedString("blockImages", [shortenedUriHost]);
if (this.isImageBlocked())
blockImage.setAttribute("checked", "true");
else
blockImage.removeAttribute("checked");
}
}
@@ -834,19 +839,20 @@ nsContextMenu.prototype = {
},
toggleImageBlocking: function(aBlock) {
var permissionmanager = Cc["@mozilla.org/permissionmanager;1"].
getService(Ci.nsIPermissionManager);
var uri = this.target.QueryInterface(Ci.nsIImageLoadingContent).currentURI;
- permissionmanager.add(uri, "image",
- aBlock ? Ci.nsIPermissionManager.DENY_ACTION :
- Ci.nsIPermissionManager.ALLOW_ACTION);
+ if (aBlock)
+ permissionmanager.add(uri, "image", Ci.nsIPermissionManager.DENY_ACTION);
+ else
+ permissionmanager.remove(uri.host, "image");
var brandBundle = document.getElementById("bundle_brand");
var app = brandBundle.getString("brandShortName");
var bundle_browser = document.getElementById("bundle_browser");
var message = bundle_browser.getFormattedString(aBlock ?
"imageBlockedWarning" : "imageAllowedWarning", [app, uri.host]);
var notificationBox = this.browser.getNotificationBox();
@@ -1030,17 +1036,17 @@ nsContextMenu.prototype = {
// Get 16 characters, so that we can trim the selection if it's greater
// than 15 chars
var selectedText = getBrowserSelection(16);
if (!selectedText)
return false;
if (selectedText.length > 15)
- selectedText = selectedText.substr(0,15) + "...";
+ selectedText = selectedText.substr(0,15) + this.ellipsis;
// Use the current engine if the search bar is visible, the default
// engine otherwise.
var engineName = "";
var ss = Cc["@mozilla.org/browser/search-service;1"].
getService(Ci.nsIBrowserSearchService);
if (isElementVisible(BrowserSearch.searchBar))
engineName = ss.currentEngine.name;
--- a/browser/base/content/pageinfo/pageInfo.js
+++ b/browser/base/content/pageinfo/pageInfo.js
@@ -818,107 +818,97 @@ function onImageSelect()
makePreview(tree.view.selection.currentIndex);
}
}
function makePreview(row)
{
var imageTree = document.getElementById("imagetree");
var item = getSelectedImage(imageTree);
- var col = imageTree.columns["image-address"];
- var url = gImageView.getCellText(row, col);
- // image-bg
+ var url = gImageView.data[row][COL_IMAGE_ADDRESS];
var isBG = gImageView.data[row][COL_IMAGE_BG];
setItemValue("imageurltext", url);
- if (item.hasAttribute("title"))
- setItemValue("imagetitletext", item.title);
- else
- setItemValue("imagetitletext", null);
-
- if (item.hasAttribute("longDesc"))
- setItemValue("imagelongdesctext", item.longDesc);
- else
- setItemValue("imagelongdesctext", null);
+ var imageText;
+ if (!isBG &&
+#ifdef MOZ_SVG
+ !(item instanceof SVGImageElement) &&
+#endif
+ !(gDocument instanceof ImageDocument)) {
+ imageText = item.title || item.alt;
- if (item.hasAttribute("alt"))
- setItemValue("imagealttext", item.alt);
- else if (item instanceof HTMLImageElement || isBG)
- setItemValue("imagealttext", null);
- else
- setItemValue("imagealttext", getValueText(item));
+ if (!imageText && !(item instanceof HTMLImageElement))
+ imageText = getValueText(item);
+ }
+ setItemValue("imagetext", imageText);
-#ifdef MOZ_SVG
- if (item instanceof SVGImageElement) {
- setItemValue("imagetitletext", null);
- setItemValue("imagelongdesctext", null);
- setItemValue("imagealttext", null);
- }
-#endif
+ setItemValue("imagelongdesctext", item.longDesc);
// get cache info
- var sourceText = gBundle.getString("generalNotCached");
var cacheKey = url.replace(/#.*$/, "");
try {
// open for READ, in non-blocking mode
var cacheEntryDescriptor = httpCacheSession.openCacheEntry(cacheKey, ACCESS_READ, false);
- if (cacheEntryDescriptor)
- switch (cacheEntryDescriptor.deviceID) {
- case "disk":
- sourceText = gBundle.getString("generalDiskCache");
- break;
- case "memory":
- sourceText = gBundle.getString("generalMemoryCache");
- break;
- default:
- sourceText = cacheEntryDescriptor.deviceID;
- break;
- }
}
catch(ex) {
try {
// open for READ, in non-blocking mode
cacheEntryDescriptor = ftpCacheSession.openCacheEntry(cacheKey, ACCESS_READ, false);
- if (cacheEntryDescriptor)
- switch (cacheEntryDescriptor.deviceID) {
- case "disk":
- sourceText = gBundle.getString("generalDiskCache");
- break;
- case "memory":
- sourceText = gBundle.getString("generalMemoryCache");
- break;
- default:
- sourceText = cacheEntryDescriptor.deviceID;
- break;
- }
}
catch(ex2) { }
}
- setItemValue("imagesourcetext", sourceText);
// find out the file size
var sizeText;
if (cacheEntryDescriptor) {
- var pageSize = cacheEntryDescriptor.dataSize;
- var kbSize = Math.round(pageSize / 1024 * 100) / 100;
+ var imageSize = cacheEntryDescriptor.dataSize;
+ var kbSize = Math.round(imageSize / 1024 * 100) / 100;
sizeText = gBundle.getFormattedString("generalSize",
- [formatNumber(kbSize), formatNumber(pageSize)]);
+ [formatNumber(kbSize), formatNumber(imageSize)]);
}
+ else
+ sizeText = gBundle.getString("mediaUnknownNotCached");
setItemValue("imagesizetext", sizeText);
var mimeType;
+ var numFrames = 1;
if (item instanceof HTMLObjectElement ||
item instanceof HTMLEmbedElement ||
item instanceof HTMLLinkElement)
mimeType = item.type;
+
+ if (!mimeType && item instanceof nsIImageLoadingContent) {
+ var imageRequest = item.getRequest(nsIImageLoadingContent.CURRENT_REQUEST);
+ if (imageRequest) {
+ mimeType = imageRequest.mimeType;
+ var image = imageRequest.image;
+ if (image)
+ numFrames = image.numFrames;
+ }
+ }
if (!mimeType)
- mimeType = getContentTypeFromImgRequest(item) ||
- getContentTypeFromHeaders(cacheEntryDescriptor);
+ mimeType = getContentTypeFromHeaders(cacheEntryDescriptor);
+ if (mimeType) {
+ // We found the type, try to display it nicely
+ var imageMimeType = /^image\/(.*)/.exec(mimeType);
+ if (imageMimeType) {
+ mimeType = imageMimeType[1].toUpperCase();
+ if (numFrames > 1)
+ mimeType = gBundle.getFormattedString("mediaAnimatedImageType",
+ [mimeType, numFrames]);
+ else
+ mimeType = gBundle.getFormattedString("mediaImageType", [mimeType]);
+ }
+ }
+ else {
+ // We couldn't find the type, fall back to the value in the treeview
+ mimeType = gImageView.data[row][COL_IMAGE_TYPE];
+ }
setItemValue("imagetypetext", mimeType);
var imageContainer = document.getElementById("theimagecontainer");
var oldImage = document.getElementById("thepreviewimage");
const regex = /^(https?|ftp|file|gopher|about|chrome|resource):/;
var isProtocolAllowed = regex.test(url);
if (/^data:/.test(url) && /^image\//.test(mimeType))
@@ -969,28 +959,31 @@ function makePreview(row)
else {
// fallback image for protocols not allowed (e.g., data: or javascript:)
// or elements not [yet] handled (e.g., object, embed).
document.getElementById("brokenimagecontainer").collapsed = false;
document.getElementById("theimagecontainer").collapsed = true;
}
var imageSize = "";
- if (url)
- imageSize = gBundle.getFormattedString("mediaSize",
- [formatNumber(width),
- formatNumber(height)]);
- setItemValue("imageSize", imageSize);
-
- var physSize = "";
- if (width != physWidth || height != physHeight)
- physSize = gBundle.getFormattedString("mediaSize",
- [formatNumber(physWidth),
- formatNumber(physHeight)]);
- setItemValue("physSize", physSize);
+ if (url) {
+ if (width != physWidth || height != physHeight) {
+ imageSize = gBundle.getFormattedString("mediaDimensionsScaled",
+ [formatNumber(physWidth),
+ formatNumber(physHeight),
+ formatNumber(width),
+ formatNumber(height)]);
+ }
+ else {
+ imageSize = gBundle.getFormattedString("mediaDimensions",
+ [formatNumber(width),
+ formatNumber(height)]);
+ }
+ }
+ setItemValue("imagedimensiontext", imageSize);
makeBlockImage(url);
imageContainer.removeChild(oldImage);
imageContainer.appendChild(newImage);
}
function makeBlockImage(url)
@@ -1042,31 +1035,16 @@ function getContentTypeFromHeaders(cache
{
if (!cacheEntryDescriptor)
return null;
return (/^Content-Type:\s*(.*?)\s*(?:\;|$)/mi
.exec(cacheEntryDescriptor.getMetaDataElement("response-head")))[1];
}
-function getContentTypeFromImgRequest(item)
-{
- var httpRequest;
-
- try {
- var imageItem = item.QueryInterface(nsIImageLoadingContent);
- var imageRequest = imageItem.getRequest(nsIImageLoadingContent.CURRENT_REQUEST);
- if (imageRequest)
- httpRequest = imageRequest.mimeType;
- }
- catch (ex) { } // This never happened. ;)
-
- return httpRequest;
-}
-
//******** Other Misc Stuff
// Modified from the Links Panel v2.3, http://segment7.net/mozilla/links/links.html
// parse a node to extract the contents of the node
function getValueText(node)
{
var valueText = "";
// form input elements don't generally contain information that is useful to our callers, so return nothing
--- a/browser/base/content/pageinfo/pageInfo.xul
+++ b/browser/base/content/pageinfo/pageInfo.xul
@@ -227,67 +227,52 @@
<splitter class="tree-splitter"/>
<treecol sortSeparators="true" hidden="true" persist="hidden width" flex="1"
width="1" id="image-count" label="&mediaCount;"/>
</treecols>
<treechildren flex="1"/>
</tree>
<splitter orient="vertical" id="mediaSplitter"/>
<vbox flex="1" id="mediaPreviewBox" collapsed="true">
- <grid>
+ <grid id="mediaGrid">
<columns>
- <column/>
+ <column id="mediaLabelColumn"/>
<column class="gridSeparator"/>
<column flex="1"/>
</columns>
<rows>
<row>
- <label control="imageurltext" value="&mediaURL;"/>
+ <label control="imageurltext" value="&mediaLocation;"/>
<separator/>
<textbox readonly="true" id="imageurltext"/>
</row>
<row>
- <label control="imagetitletext" value="&mediaTitle;"/>
- <separator/>
- <textbox readonly="true" id="imagetitletext"/>
- </row>
- <row>
- <label control="imagealttext" value="&mediaAlt;"/>
- <separator/>
- <textbox readonly="true" id="imagealttext"/>
- </row>
- <row>
- <label control="imagelongdesctext" value="&mediaLongdesc;"/>
- <separator/>
- <textbox readonly="true" id="imagelongdesctext"/>
- </row>
- <row>
<label control="imagetypetext" value="&generalType;"/>
<separator/>
<textbox readonly="true" id="imagetypetext"/>
</row>
<row>
- <label control="imagesourcetext" value="&generalSource;"/>
- <separator/>
- <textbox readonly="true" id="imagesourcetext"/>
- </row>
- <row>
<label control="imagesizetext" value="&generalSize;"/>
<separator/>
<textbox readonly="true" id="imagesizetext"/>
</row>
<row>
- <label control="imageSize" value="&mediaDimensions;"/>
+ <label control="imagedimensiontext" value="&mediaDimension;"/>
<separator/>
- <textbox readonly="true" id="imageSize"/>
+ <textbox readonly="true" id="imagedimensiontext"/>
</row>
<row>
- <label control="physSize" value="&mediaPhysDimensions;"/>
+ <label control="imagetext" value="&mediaText;"/>
<separator/>
- <textbox readonly="true" id="physSize"/>
+ <textbox readonly="true" id="imagetext"/>
+ </row>
+ <row>
+ <label control="imagelongdesctext" value="&mediaLongdesc;"/>
+ <separator/>
+ <textbox readonly="true" id="imagelongdesctext"/>
</row>
</rows>
</grid>
<hbox align="end">
<vbox>
<checkbox id="blockImage" hidden="true" oncommand="onBlockImage()"
accesskey="&mediaBlockImage.accesskey;"/>
<label control="thepreviewimage" value="&mediaPreview;" class="header"/>
--- a/browser/base/content/sanitize.js
+++ b/browser/base/content/sanitize.js
@@ -118,16 +118,38 @@ Sanitizer.prototype = {
},
get canClear()
{
return true;
}
},
+ offlineApps: {
+ clear: function ()
+ {
+ const Cc = Components.classes;
+ const Ci = Components.interfaces;
+ var cacheService = Cc["@mozilla.org/network/cache-service;1"].
+ getService(Ci.nsICacheService);
+ try {
+ cacheService.evictEntries(Ci.nsICache.STORE_OFFLINE);
+ } catch(er) {}
+
+ var storageManagerService = Cc["@mozilla.org/dom/storagemanager;1"].
+ getService(Ci.nsIDOMStorageManager);
+ storageManagerService.clearOfflineApps();
+ },
+
+ get canClear()
+ {
+ return true;
+ }
+ },
+
history: {
clear: function ()
{
var globalHistory = Components.classes["@mozilla.org/browser/global-history;2"]
.getService(Components.interfaces.nsIBrowserHistory);
globalHistory.removeAllPages();
try {
--- a/browser/base/content/sanitize.xul
+++ b/browser/base/content/sanitize.xul
@@ -119,16 +119,17 @@
<preferences id="sanitizePreferences">
<preference id="privacy.item.history" name="privacy.item.history" type="bool" readonly="true"/>
<preference id="privacy.item.formdata" name="privacy.item.formdata" type="bool" readonly="true"/>
<preference id="privacy.item.passwords" name="privacy.item.passwords" type="bool" readonly="true"/>
<preference id="privacy.item.downloads" name="privacy.item.downloads" type="bool" readonly="true"/>
<preference id="privacy.item.cookies" name="privacy.item.cookies" type="bool" readonly="true"/>
<preference id="privacy.item.cache" name="privacy.item.cache" type="bool" readonly="true"/>
+ <preference id="privacy.item.offlineApps" name="privacy.item.offlineApps" type="bool"/>
<preference id="privacy.item.sessions" name="privacy.item.sessions" type="bool" readonly="true"/>
</preferences>
<description>&sanitizeItems.label;</description>
<checkbox label="&itemHistory.label;"
accesskey="&itemHistory.accesskey;"
preference="privacy.item.history"
@@ -144,16 +145,20 @@
<checkbox label="&itemCache.label;"
accesskey="&itemCache.accesskey;"
preference="privacy.item.cache"
onsyncfrompreference="return gSanitizePromptDialog.onReadGeneric();"/>
<checkbox label="&itemCookies.label;"
accesskey="&itemCookies.accesskey;"
preference="privacy.item.cookies"
onsyncfrompreference="return gSanitizePromptDialog.onReadGeneric();"/>
+ <checkbox label="&itemOfflineApps.label;"
+ accesskey="&itemOfflineApps.accesskey;"
+ preference="privacy.item.offlineApps"
+ onsyncfrompreference="return gSanitizePromptDialog.onReadGeneric();"/>
<checkbox label="&itemPasswords.label;"
accesskey="&itemPasswords.accesskey;"
preference="privacy.item.passwords"
onsyncfrompreference="return gSanitizePromptDialog.onReadGeneric();"/>
<checkbox label="&itemSessions.label;"
accesskey="&itemSessions.accesskey;"
preference="privacy.item.sessions"
onsyncfrompreference="return gSanitizePromptDialog.onReadGeneric();"/>
--- a/browser/base/content/tabbrowser.xml
+++ b/browser/base/content/tabbrowser.xml
@@ -87,18 +87,18 @@
tbattr="tabbrowser-multiple"
oncommand="var tabbrowser = this.parentNode.parentNode.parentNode.parentNode;
tabbrowser.reloadAllTabs(tabbrowser.mContextTab);"/>
<xul:menuitem label="&closeOtherTabs.label;" accesskey="&closeOtherTabs.accesskey;"
tbattr="tabbrowser-multiple"
oncommand="var tabbrowser = this.parentNode.parentNode.parentNode.parentNode;
tabbrowser.removeAllTabsBut(tabbrowser.mContextTab);"/>
<xul:menuseparator/>
- <xul:menuitem label="&bookmarkCurTab.label;"
- accesskey="&bookmarkCurTab.accesskey;"
+ <xul:menuitem label="&bookmarkThisTab.label;"
+ accesskey="&bookmarkThisTab.accesskey;"
oncommand="BookmarkThisTab();"/>
<xul:menuitem label="&bookmarkAllTabs.label;"
accesskey="&bookmarkAllTabs.accesskey;"
command="Browser:BookmarkAllTabs"/>
<xul:menuitem label="&undoCloseTab.label;"
accesskey="&undoCloseTab.accesskey;"
command="History:UndoCloseTab"
anonid="undoCloseTabMenuItem"/>
@@ -2123,19 +2123,20 @@
</method>
<!-- throws exception for unknown schemes -->
<method name="loadURIWithFlags">
<parameter name="aURI"/>
<parameter name="aFlags"/>
<parameter name="aReferrerURI"/>
<parameter name="aCharset"/>
+ <parameter name="aPostData"/>
<body>
<![CDATA[
- return this.mCurrentBrowser.loadURIWithFlags(aURI, aFlags, aReferrerURI, aCharset);
+ return this.mCurrentBrowser.loadURIWithFlags(aURI, aFlags, aReferrerURI, aCharset, aPostData);
]]>
</body>
</method>
<method name="goHome">
<body>
<![CDATA[
return this.mCurrentBrowser.goHome();
--- a/browser/base/jar.mn
+++ b/browser/base/jar.mn
@@ -8,16 +8,17 @@ browser.jar:
#endif
% overlay chrome://global/content/viewSource.xul chrome://browser/content/viewSourceOverlay.xul
% overlay chrome://global/content/viewPartialSource.xul chrome://browser/content/viewSourceOverlay.xul
% style chrome://global/content/customizeToolbar.xul chrome://browser/content/browser.css
% style chrome://global/content/customizeToolbar.xul chrome://browser/skin/
* content/browser/aboutDialog.xul (content/aboutDialog.xul)
* content/browser/aboutDialog.js (content/aboutDialog.js)
content/browser/aboutDialog.css (content/aboutDialog.css)
+* content/browser/bindings.xml (content/bindings.xml)
* content/browser/browser.css (content/browser.css)
* content/browser/browser.js (content/browser.js)
* content/browser/browser.xul (content/browser.xul)
* content/browser/credits.xhtml (content/credits.xhtml)
* content/browser/EULA.js (content/EULA.js)
* content/browser/EULA.xhtml (content/EULA.xhtml)
* content/browser/EULA.xul (content/EULA.xul)
* content/browser/metaData.js (content/metaData.js)
--- a/browser/branding/unofficial/Makefile.in
+++ b/browser/branding/unofficial/Makefile.in
@@ -15,17 +15,17 @@ DIRS = \
locales \
$(NULL)
PREF_JS_EXPORTS = $(srcdir)/pref/firefox-branding.js
include $(topsrcdir)/config/rules.mk
BROWSER_APP_FILES = \
- default.xpm \
+ default16.png \
mozicon128.png \
mozicon16.xpm \
mozicon50.xpm \
firefox.ico \
document.ico \
$(NULL)
export::
deleted file mode 100644
--- a/browser/branding/unofficial/default.xpm
+++ /dev/null
@@ -1,1144 +0,0 @@
-/* XPM */
-static char * mozicon50_xpm[] = {
-"48 48 1093 2",
-" c None",
-". c #2099CF",
-"+ c #2CA7D9",
-"@ c #33AEDD",
-"# c #34B2E1",
-"$ c #35B8E5",
-"% c #2FBAE8",
-"& c #26B5E4",
-"* c #199FD6",
-"= c #177DB8",
-"- c #2C8FC4",
-"; c #43A0CE",
-"> c #55ADD6",
-", c #5CB5DD",
-"' c #61C4E8",
-") c #63CBED",
-"! c #64CFF1",
-"~ c #63D1F2",
-"{ c #5ECCEF",
-"] c #57C3E9",
-"^ c #4EB8E1",
-"/ c #3CABD9",
-"( c #2A9ED1",
-"_ c #1991C9",
-": c #0F7CBA",
-"< c #166EAC",
-"[ c #3387BC",
-"} c #4797C6",
-"| c #51A0CC",
-"1 c #56A7D2",
-"2 c #5BAED7",
-"3 c #60B6DD",
-"4 c #67CDEE",
-"5 c #69D3F2",
-"6 c #6BD4F4",
-"7 c #69D3F4",
-"8 c #63CDEF",
-"9 c #5AC0E6",
-"0 c #51B6DF",
-"a c #49ACD8",
-"b c #42A2D1",
-"c c #3898CA",
-"d c #298CC2",
-"e c #167EB9",
-"f c #0B5A9C",
-"g c #2674AE",
-"h c #3D87BA",
-"i c #4590C0",
-"j c #4B97C6",
-"k c #519FCB",
-"l c #58A6D1",
-"m c #5DADD5",
-"n c #62B3DA",
-"o c #69C3E6",
-"p c #6ED4F2",
-"q c #6FD6F4",
-"r c #6ED5F4",
-"s c #6AD3F2",
-"t c #5FC3E7",
-"u c #53B2DC",
-"v c #4BA8D5",
-"w c #439FCE",
-"x c #3B95C7",
-"y c #338BC0",
-"z c #2B82B9",
-"A c #1D76B1",
-"B c #0C69A9",
-"C c #10599A",
-"D c #2D71AA",
-"E c #377CB2",
-"F c #3D84B8",
-"G c #458DBE",
-"H c #4B95C4",
-"I c #529CC9",
-"J c #59A4CF",
-"K c #5FABD4",
-"L c #65B1D8",
-"M c #6BC2E4",
-"N c #71D5F3",
-"O c #73D6F3",
-"P c #72D5F3",
-"Q c #6DD1F0",
-"R c #5FBBE2",
-"S c #54ADD8",
-"T c #4CA4D2",
-"U c #439ACB",
-"V c #3B91C4",
-"W c #3487BD",
-"X c #2D7EB7",
-"Y c #2675AF",
-"Z c #1E6CA9",
-"` c #0F5FA0",
-" . c #055296",
-".. c #115394",
-"+. c #2767A2",
-"@. c #2F70A9",
-"#. c #3679AF",
-"$. c #3C81B5",
-"%. c #448ABC",
-"&. c #4A92C2",
-"*. c #519AC7",
-"=. c #58A2CD",
-"-. c #5FA9D2",
-";. c #65B0D7",
-">. c #6EC8E9",
-",. c #74D4F2",
-"'. c #76D6F3",
-"). c #75D6F3",
-"!. c #71D3F1",
-"~. c #62BCE1",
-"{. c #54A9D5",
-"]. c #4C9FCE",
-"^. c #4396C8",
-"/. c #3B8CC1",
-"(. c #3483BA",
-"_. c #2C7AB3",
-":. c #2670AC",
-"<. c #1F68A6",
-"[. c #195F9F",
-"}. c #0D5497",
-"|. c #04488D",
-"1. c #0F4A8D",
-"2. c #1F5A98",
-"3. c #2663A0",
-"4. c #2D6DA6",
-"5. c #3475AD",
-"6. c #3B7EB3",
-"7. c #4287B9",
-"8. c #4990C1",
-"9. c #51A4CF",
-"0. c #569FCA",
-"a. c #5DA6CF",
-"b. c #66B5DB",
-"c. c #6FD1F0",
-"d. c #75D4F1",
-"e. c #79D5F2",
-"f. c #75D3F1",
-"g. c #63BBE0",
-"h. c #54A4D1",
-"i. c #4B9BCB",
-"j. c #4391C4",
-"k. c #3B88BD",
-"l. c #337FB6",
-"m. c #2C76B0",
-"n. c #266CA9",
-"o. c #1F64A3",
-"p. c #1A5B9C",
-"q. c #145396",
-"r. c #0A498E",
-"s. c #034C8F",
-"t. c #085293",
-"u. c #164D8E",
-"v. c #1D5695",
-"w. c #24609C",
-"x. c #2A69A3",
-"y. c #3271AA",
-"z. c #387AAF",
-"A. c #429FCC",
-"B. c #4CBFE4",
-"C. c #52C4E8",
-"D. c #57AFD7",
-"E. c #5DB3DA",
-"F. c #65C5E7",
-"G. c #6DD0EE",
-"H. c #72D2EF",
-"I. c #78D4F0",
-"J. c #7BD5F1",
-"K. c #76D2EF",
-"L. c #6AC5E6",
-"M. c #55A5D1",
-"N. c #4A95C6",
-"O. c #428CC0",
-"P. c #3A83B9",
-"Q. c #337AB3",
-"R. c #2C71AD",
-"S. c #2568A6",
-"T. c #1F5F9F",
-"U. c #1D65A3",
-"V. c #269ACA",
-"W. c #1C84BA",
-"X. c #0D7DB5",
-"Y. c #0298CC",
-"Z. c #0296CA",
-"`. c #0C5998",
-" + c #14498A",
-".+ c #1B609C",
-"++ c #2498C8",
-"@+ c #2977AF",
-"#+ c #2F75AC",
-"$+ c #3575AC",
-"%+ c #40ABD5",
-"&+ c #49BFE4",
-"*+ c #50C3E7",
-"=+ c #56C5E8",
-"-+ c #5DC8EA",
-";+ c #63CBEB",
-">+ c #69CEED",
-",+ c #6ED0EE",
-"'+ c #73D2EF",
-")+ c #77D3EF",
-"!+ c #72CEEC",
-"~+ c #5AA7D1",
-"{+ c #4F99C9",
-"]+ c #4891C3",
-"^+ c #4087BC",
-"/+ c #387EB5",
-"(+ c #3277B1",
-"_+ c #2B70AB",
-":+ c #2463A2",
-"<+ c #1E5B9C",
-"[+ c #185395",
-"}+ c #165496",
-"|+ c #10498D",
-"1+ c #105F9E",
-"2+ c #0A9ECF",
-"3+ c #0088C0",
-"4+ c #038DC3",
-"5+ c #0A4A8C",
-"6+ c #114E8E",
-"7+ c #1989BD",
-"8+ c #22AAD7",
-"9+ c #28A2D0",
-"0+ c #2C71A9",
-"a+ c #3380B5",
-"b+ c #3EB9E1",
-"c+ c #45BDE3",
-"d+ c #4CC0E5",
-"e+ c #53C3E7",
-"f+ c #59C6E8",
-"g+ c #5EC9EA",
-"h+ c #64CBEB",
-"i+ c #69CDEC",
-"j+ c #6ECFED",
-"k+ c #70D0ED",
-"l+ c #64BDE1",
-"m+ c #55A6D1",
-"n+ c #3D82B8",
-"o+ c #3D8BBE",
-"p+ c #49AFD8",
-"q+ c #378DBF",
-"r+ c #225F9E",
-"s+ c #1D5698",
-"t+ c #174E92",
-"u+ c #12468B",
-"v+ c #0E3F85",
-"w+ c #115F9D",
-"x+ c #15A2D1",
-"y+ c #0395C9",
-"z+ c #0088C1",
-"A+ c #0190C6",
-"B+ c #079ACC",
-"C+ c #0FA0D0",
-"D+ c #169ECF",
-"E+ c #1D99CC",
-"F+ c #25AAD7",
-"G+ c #2BA0CE",
-"H+ c #32AED8",
-"I+ c #3AB7DF",
-"J+ c #41BBE1",
-"K+ c #47BEE3",
-"L+ c #4EC1E5",
-"M+ c #53C4E7",
-"N+ c #5FC8E9",
-"O+ c #63CAEA",
-"P+ c #67CBEB",
-"Q+ c #69CBEA",
-"R+ c #62BCE0",
-"S+ c #5AAFD7",
-"T+ c #478DBF",
-"U+ c #4084B9",
-"V+ c #3A7CB4",
-"W+ c #3E8CBF",
-"X+ c #4DBADF",
-"Y+ c #3383B8",
-"Z+ c #215B9B",
-"`+ c #1B5295",
-" @ c #164A8E",
-".@ c #114288",
-"+@ c #0D3A82",
-"@@ c #0E4C8E",
-"#@ c #1380B7",
-"$@ c #0D96C9",
-"%@ c #0089C1",
-"&@ c #007BB8",
-"*@ c #0085BE",
-"=@ c #008CC4",
-"-@ c #0496C9",
-";@ c #0B9DCF",
-">@ c #1168AB",
-",@ c #174F99",
-"'@ c #21AAD7",
-")@ c #28AED9",
-"!@ c #2FB1DB",
-"~@ c #36B5DE",
-"{@ c #3CB8E0",
-"]@ c #42BBE2",
-"^@ c #49BEE4",
-"/@ c #54C3E6",
-"(@ c #59C5E7",
-"_@ c #5DC7E8",
-":@ c #5FC5E7",
-"<@ c #53A9D3",
-"[@ c #4B96C6",
-"}@ c #478FC2",
-"|@ c #4186BB",
-"1@ c #3C7FB5",
-"2@ c #3676AF",
-"3@ c #306EA9",
-"4@ c #3889BD",
-"5@ c #44AFD8",
-"6@ c #2F84B9",
-"7@ c #194D91",
-"8@ c #15458A",
-"9@ c #144D90",
-"0@ c #0C367E",
-"a@ c #0C4086",
-"b@ c #1797C8",
-"c@ c #1295C8",
-"d@ c #0487C0",
-"e@ c #0079B6",
-"f@ c #0081BC",
-"g@ c #0E9ACC",
-"h@ c #1597CA",
-"i@ c #1CA7D5",
-"j@ c #23ABD8",
-"k@ c #2AAFDA",
-"l@ c #31B2DC",
-"m@ c #37B5DE",
-"n@ c #3DB8E0",
-"o@ c #43BBE2",
-"p@ c #49BEE3",
-"q@ c #4EC0E4",
-"r@ c #53C2E5",
-"s@ c #57C4E6",
-"t@ c #4EAAD4",
-"u@ c #4696C5",
-"v@ c #438FC0",
-"w@ c #4088BC",
-"x@ c #3C80B6",
-"y@ c #3778B1",
-"z@ c #3270AB",
-"A@ c #2C68A5",
-"B@ c #3D9AC8",
-"C@ c #46BADF",
-"D@ c #3DB0D8",
-"E@ c #287CB2",
-"F@ c #164D90",
-"G@ c #299ECC",
-"H@ c #1B79B0",
-"I@ c #1A8CBF",
-"J@ c #199BCC",
-"K@ c #1392C6",
-"L@ c #0A86BE",
-"M@ c #0079B7",
-"N@ c #006AAC",
-"O@ c #0074B3",
-"P@ c #007CB9",
-"Q@ c #0083BE",
-"R@ c #008BC2",
-"S@ c #0393C8",
-"T@ c #099CCD",
-"U@ c #10A1D1",
-"V@ c #17A4D3",
-"W@ c #1EA8D6",
-"X@ c #25ABD8",
-"Y@ c #2BAFDA",
-"Z@ c #37B5DD",
-"`@ c #3DB8DF",
-" # c #42BAE1",
-".# c #48BCE2",
-"+# c #4CBEE3",
-"@# c #50C0E4",
-"## c #48A8D3",
-"$# c #3F8EC0",
-"%# c #3C87BC",
-"&# c #3A81B7",
-"*# c #3679B1",
-"=# c #3171AC",
-"-# c #2D6AA6",
-";# c #2862A0",
-"># c #40A5D1",
-",# c #43B8DE",
-"'# c #3DB5DC",
-")# c #38B1DA",
-"!# c #2D9ECC",
-"~# c #2B9FCE",
-"{# c #246AAA",
-"]# c #1F96C7",
-"^# c #1996C9",
-"/# c #138DC3",
-"(# c #0E84BC",
-"_# c #0175B4",
-":# c #0068AC",
-"<# c #0070B1",
-"[# c #0077B5",
-"}# c #007FBA",
-"|# c #0086BF",
-"1# c #018DC4",
-"2# c #0596C9",
-"3# c #0B9DCE",
-"4# c #12A1D1",
-"5# c #1897C8",
-"6# c #1E96C7",
-"7# c #25A0CE",
-"8# c #2B90C2",
-"9# c #31A4D0",
-"0# c #37B4DD",
-"a# c #3CB7DF",
-"b# c #41B9E0",
-"c# c #45BBE0",
-"d# c #49BCE1",
-"e# c #4BBBE0",
-"f# c #419FCC",
-"g# c #3C91C2",
-"h# c #337AB1",
-"i# c #3072AC",
-"j# c #2C6BA7",
-"k# c #2864A1",
-"l# c #255F9E",
-"m# c #3FAAD4",
-"n# c #40B6DC",
-"o# c #3AB3DB",
-"p# c #35B0D8",
-"q# c #2F86BD",
-"r# c #29599F",
-"s# c #237DB7",
-"t# c #1E99CA",
-"u# c #1892C5",
-"v# c #1389C0",
-"w# c #0E7FBA",
-"x# c #0473B2",
-"y# c #0065AA",
-"z# c #0064A9",
-"A# c #006BAD",
-"B# c #0072B2",
-"C# c #0080BC",
-"D# c #0082BC",
-"E# c #028DC4",
-"F# c #0796C9",
-"G# c #0D88BD",
-"H# c #1372AB",
-"I# c #1982B8",
-"J# c #1F79B0",
-"K# c #247BB1",
-"L# c #2A86B9",
-"M# c #31B1DA",
-"N# c #36B3DC",
-"O# c #3AB5DD",
-"P# c #3FB7DE",
-"Q# c #42B9DF",
-"R# c #45BAE0",
-"S# c #48BBE0",
-"T# c #47B6DD",
-"U# c #3689BC",
-"V# c #2D72AB",
-"W# c #2C73AC",
-"X# c #2F7DB3",
-"Y# c #399BC9",
-"Z# c #3FB4DB",
-"`# c #3CB3DA",
-" $ c #37B0D9",
-".$ c #32AED7",
-"+$ c #2CA8D3",
-"@$ c #277EB8",
-"#$ c #229CCC",
-"$$ c #1D95C8",
-"%$ c #188DC2",
-"&$ c #1384BD",
-"*$ c #0D7AB6",
-"=$ c #066FB0",
-"-$ c #0057A0",
-";$ c #005FA5",
-">$ c #0066AA",
-",$ c #006DAF",
-"'$ c #006EAC",
-")$ c #004C8E",
-"!$ c #005595",
-"~$ c #025999",
-"{$ c #085D9B",
-"]$ c #0D64A0",
-"^$ c #1369A4",
-"/$ c #196EA7",
-"($ c #1E73AA",
-"_$ c #2376AD",
-":$ c #2AA0CE",
-"<$ c #2FAFD9",
-"[$ c #34B1DB",
-"}$ c #38B3DC",
-"|$ c #3BB5DC",
-"1$ c #3EB6DD",
-"2$ c #40B7DD",
-"3$ c #42B7DD",
-"4$ c #43B7DE",
-"5$ c #43B7DD",
-"6$ c #40B5DC",
-"7$ c #3DB4DB",
-"8$ c #3AB2DA",
-"9$ c #33AED6",
-"0$ c #2EABD5",
-"a$ c #29A5D2",
-"b$ c #259ECD",
-"c$ c #2094C6",
-"d$ c #1C8DC2",
-"e$ c #1787BE",
-"f$ c #127EB9",
-"g$ c #0D75B3",
-"h$ c #076AAC",
-"i$ c #005FA6",
-"j$ c #00539D",
-"k$ c #005AA2",
-"l$ c #0060A6",
-"m$ c #0068AB",
-"n$ c #0063A5",
-"o$ c #004487",
-"p$ c #004386",
-"q$ c #004789",
-"r$ c #004B8D",
-"s$ c #045192",
-"t$ c #095997",
-"u$ c #0E5F9C",
-"v$ c #1365A0",
-"w$ c #1869A4",
-"x$ c #1D6EA7",
-"y$ c #2274AB",
-"z$ c #28A6D2",
-"A$ c #2DAED8",
-"B$ c #31AFD9",
-"C$ c #34B1DA",
-"D$ c #37B2DB",
-"E$ c #39B3DB",
-"F$ c #3BB4DB",
-"G$ c #3CB4DB",
-"H$ c #3BB3DA",
-"I$ c #38B1D9",
-"J$ c #35AFD8",
-"K$ c #32ADD6",
-"L$ c #2EAAD4",
-"M$ c #2BA5D1",
-"N$ c #2795C5",
-"O$ c #2374AA",
-"P$ c #1E5691",
-"Q$ c #1A4C89",
-"R$ c #156AA5",
-"S$ c #1078B5",
-"T$ c #0B6FAF",
-"U$ c #0665A9",
-"V$ c #004A97",
-"W$ c #004D9A",
-"X$ c #00509A",
-"Y$ c #00579F",
-"Z$ c #0062A7",
-"`$ c #00468A",
-" % c #00387C",
-".% c #003C7F",
-"+% c #004083",
-"@% c #044D8E",
-"#% c #095493",
-"$% c #0E5A98",
-"%% c #13609C",
-"&% c #18659F",
-"*% c #1C6BA4",
-"=% c #219FCD",
-"-% c #25AAD5",
-";% c #29ABD6",
-">% c #2DADD7",
-",% c #30AED8",
-"'% c #32AFD8",
-")% c #34B0D8",
-"!% c #34AED7",
-"~% c #30ABD4",
-"{% c #2DA8D2",
-"]% c #2BA3CF",
-"^% c #289DCC",
-"/% c #2494C5",
-"(% c #20659E",
-"_% c #1C4684",
-":% c #183D7C",
-"<% c #133B7A",
-"[% c #0F5695",
-"}% c #0A5FA1",
-"|% c #055FA5",
-"1% c #00559F",
-"2% c #004D99",
-"3% c #004896",
-"4% c #002E74",
-"5% c #003C82",
-"6% c #004E94",
-"7% c #003377",
-"8% c #003175",
-"9% c #003578",
-"0% c #003B7F",
-"a% c #003F82",
-"b% c #014285",
-"c% c #044889",
-"d% c #094E8E",
-"e% c #0D5493",
-"f% c #125997",
-"g% c #167FB4",
-"h% c #1A96C7",
-"i% c #1EA5D2",
-"j% c #22A7D3",
-"k% c #25A9D4",
-"l% c #28AAD5",
-"m% c #2AAAD5",
-"n% c #2CABD6",
-"o% c #2DACD6",
-"p% c #2EACD5",
-"q% c #2DA9D3",
-"r% c #2CA6D1",
-"s% c #299FCD",
-"t% c #279ACA",
-"u% c #2495C7",
-"v% c #218FC3",
-"w% c #1D86BC",
-"x% c #1A4683",
-"y% c #163574",
-"z% c #112C6C",
-"A% c #0D2464",
-"B% c #082D6F",
-"C% c #044E94",
-"D% c #004F9A",
-"E% c #004292",
-"F% c #00347D",
-"G% c #002266",
-"H% c #002669",
-"I% c #00286C",
-"J% c #002B6F",
-"K% c #002E72",
-"L% c #003478",
-"M% c #00377B",
-"N% c #003A7E",
-"O% c #013D80",
-"P% c #044285",
-"Q% c #084889",
-"R% c #0D4D8D",
-"S% c #115492",
-"T% c #15609B",
-"U% c #189ACB",
-"V% c #1CA0CF",
-"W% c #1FA2CF",
-"X% c #21A3D1",
-"Y% c #24A4D1",
-"Z% c #25A5D1",
-"`% c #27A4D1",
-" & c #28A4D1",
-".& c #28A0CE",
-"+& c #289ECC",
-"@& c #2596C8",
-"#& c #2392C5",
-"$& c #208DC2",
-"%& c #1D87BD",
-"&& c #1A75AE",
-"*& c #173978",
-"=& c #132E6D",
-"-& c #0F2565",
-";& c #0B1D5D",
-">& c #071555",
-",& c #021151",
-"'& c #001F61",
-")& c #00276D",
-"!& c #003D8E",
-"~& c #003B89",
-"{& c #001E62",
-"]& c #002063",
-"^& c #002569",
-"/& c #002D72",
-"(& c #003074",
-"_& c #003579",
-":& c #033C7F",
-"<& c #074183",
-"[& c #0B4787",
-"}& c #0F5392",
-"|& c #1391C5",
-"1& c #1695C8",
-"2& c #1998CA",
-"3& c #1C99CA",
-"4& c #1E9ACB",
-"5& c #209BCB",
-"6& c #219BCB",
-"7& c #229ACA",
-"8& c #2399C9",
-"9& c #2397C8",
-"0& c #2394C6",
-"a& c #2291C4",
-"b& c #1E89C0",
-"c& c #1C84BC",
-"d& c #1A5B97",
-"e& c #174C89",
-"f& c #142D6C",
-"g& c #102665",
-"h& c #0C1E5D",
-"i& c #081756",
-"j& c #040F4F",
-"k& c #000847",
-"l& c #000541",
-"m& c #00033D",
-"n& c #00368A",
-"o& c #00256E",
-"p& c #00185A",
-"q& c #001A5D",
-"r& c #001D60",
-"s& c #001F63",
-"t& c #002568",
-"u& c #00276B",
-"v& c #00296D",
-"w& c #002B70",
-"x& c #003276",
-"y& c #023579",
-"z& c #063A7D",
-"A& c #0A5997",
-"B& c #0D87BF",
-"C& c #108AC1",
-"D& c #138CC3",
-"E& c #168EC4",
-"F& c #188FC4",
-"G& c #1A90C4",
-"H& c #1C90C4",
-"I& c #1D8FC4",
-"J& c #1D8EC3",
-"K& c #1D8CC2",
-"L& c #1D8AC0",
-"M& c #1C87BE",
-"N& c #1B83BC",
-"O& c #1A7FB9",
-"P& c #1864A0",
-"Q& c #164987",
-"R& c #132C6A",
-"S& c #102564",
-"T& c #0D1E5D",
-"U& c #091756",
-"V& c #06104E",
-"W& c #020947",
-"X& c #000441",
-"Y& c #00023C",
-"Z& c #000038",
-"`& c #003086",
-" * c #001A5E",
-".* c #001354",
-"+* c #001658",
-"@* c #001D5F",
-"#* c #001F62",
-"$* c #002164",
-"%* c #002367",
-"&* c #002D71",
-"** c #014C8E",
-"=* c #0474B2",
-"-* c #077CB9",
-";* c #0B80BA",
-">* c #0E82BB",
-",* c #1083BC",
-"'* c #1285BD",
-")* c #1485BE",
-"!* c #1686BD",
-"~* c #1785BD",
-"{* c #1884BC",
-"]* c #1882BB",
-"^* c #1880B9",
-"/* c #187DB7",
-"(* c #177AB6",
-"_* c #1571AF",
-":* c #143676",
-"<* c #122968",
-"[* c #0F2362",
-"}* c #0D1D5C",
-"|* c #0A1755",
-"1* c #030A47",
-"2* c #000239",
-"3* c #002A82",
-"4* c #00175D",
-"5* c #00104F",
-"6* c #001252",
-"7* c #001454",
-"8* c #001657",
-"9* c #00195C",
-"0* c #001C5E",
-"a* c #001D61",
-"b* c #002165",
-"c* c #002366",
-"d* c #002468",
-"e* c #006CAE",
-"f* c #006FB0",
-"g* c #0271B1",
-"h* c #0574B3",
-"i* c #0877B4",
-"j* c #0B78B5",
-"k* c #0F7AB6",
-"l* c #107AB7",
-"m* c #127AB6",
-"n* c #1279B5",
-"o* c #1377B4",
-"p* c #1375B3",
-"q* c #1372B1",
-"r* c #126FAF",
-"s* c #115797",
-"t* c #0F2766",
-"u* c #0D2160",
-"v* c #0B1B5A",
-"w* c #091554",
-"x* c #06104D",
-"y* c #030A46",
-"z* c #000540",
-"A* c #000036",
-"B* c #00237E",
-"C* c #002980",
-"D* c #002372",
-"E* c #001A60",
-"F* c #001659",
-"G* c #001358",
-"H* c #001A5F",
-"I* c #002064",
-"J* c #001B5E",
-"K* c #005397",
-"L* c #0065A9",
-"M* c #0067AB",
-"N* c #0069AC",
-"O* c #026AAD",
-"P* c #046CAE",
-"Q* c #0768AB",
-"R* c #0965A9",
-"S* c #0A6EAF",
-"T* c #0C6EAE",
-"U* c #0D6DAE",
-"V* c #0D6CAD",
-"W* c #0D6AAB",
-"X* c #0D67AA",
-"Y* c #0D64A7",
-"Z* c #0C498C",
-"`* c #0A1E5E",
-" = c #091856",
-".= c #071350",
-"+= c #050D4B",
-"@= c #020844",
-"#= c #00043F",
-"$= c #00023B",
-"%= c #000037",
-"&= c #000035",
-"*= c #000034",
-"== c #001A77",
-"-= c #00237D",
-";= c #002881",
-">= c #002D84",
-",= c #00287F",
-"'= c #000B6C",
-")= c #00388A",
-"!= c #003785",
-"~= c #001556",
-"{= c #001759",
-"]= c #00195B",
-"^= c #001C5F",
-"/= c #001C60",
-"(= c #004B91",
-"_= c #004287",
-":= c #00569C",
-"<= c #0061A7",
-"[= c #023187",
-"}= c #033388",
-"|= c #0563A7",
-"1= c #0662A7",
-"2= c #0762A7",
-"3= c #0860A6",
-"4= c #085EA4",
-"5= c #085CA3",
-"6= c #084388",
-"7= c #071B5B",
-"8= c #061453",
-"9= c #04104D",
-"0= c #030B48",
-"a= c #010742",
-"b= c #00033E",
-"c= c #00013A",
-"d= c #000033",
-"e= c #000032",
-"f= c #001C79",
-"g= c #00217C",
-"h= c #002780",
-"i= c #002B83",
-"j= c #003589",
-"k= c #001D63",
-"l= c #000F4F",
-"m= c #000F4E",
-"n= c #001050",
-"o= c #001152",
-"p= c #001353",
-"q= c #001455",
-"r= c #002F74",
-"s= c #00529A",
-"t= c #0058A1",
-"u= c #00529D",
-"v= c #0156A0",
-"w= c #02569F",
-"x= c #02549E",
-"y= c #03529D",
-"z= c #034F9A",
-"A= c #032062",
-"B= c #020F4E",
-"C= c #010C49",
-"D= c #000845",
-"E= c #00033C",
-"F= c #000138",
-"G= c #000135",
-"H= c #001474",
-"I= c #001F7B",
-"J= c #00247E",
-"K= c #002D83",
-"L= c #001051",
-"M= c #000A46",
-"N= c #000B48",
-"O= c #000C4A",
-"P= c #000D4B",
-"Q= c #000E4D",
-"R= c #001151",
-"S= c #001253",
-"T= c #00377E",
-"U= c #004E9A",
-"V= c #004C98",
-"W= c #00408C",
-"X= c #000946",
-"Y= c #00053F",
-"Z= c #000137",
-"`= c #000031",
-" - c #000030",
-".- c #001373",
-"+- c #001876",
-"@- c #001D79",
-"#- c #00267F",
-"$- c #000D4D",
-"%- c #000741",
-"&- c #000843",
-"*- c #000945",
-"=- c #000A47",
-"-- c #000B49",
-";- c #000D4C",
-">- c #002F77",
-",- c #00327A",
-"'- c #002267",
-")- c #002166",
-"!- c #00256A",
-"~- c #003D89",
-"{- c #004393",
-"]- c #003F90",
-"^- c #003C8D",
-"/- c #003382",
-"(- c #003587",
-"_- c #002069",
-":- c #00033A",
-"<- c #000136",
-"[- c #00002F",
-"}- c #000C6E",
-"|- c #001171",
-"1- c #001574",
-"2- c #001E7A",
-"3- c #00196A",
-"4- c #00053E",
-"5- c #000640",
-"6- c #000742",
-"7- c #00185B",
-"8- c #003787",
-"9- c #00398C",
-"0- c #00378B",
-"a- c #003388",
-"b- c #002779",
-"c- c #00063F",
-"d- c #00002D",
-"e- c #00096C",
-"f- c #000D6F",
-"g- c #001271",
-"h- c #001675",
-"i- c #001872",
-"j- c #000338",
-"k- c #00043A",
-"l- c #00043B",
-"m- c #00053D",
-"n- c #000844",
-"o- c #000944",
-"p- c #002573",
-"q- c #002E85",
-"r- c #002C83",
-"s- c #001E71",
-"t- c #00002E",
-"u- c #00002C",
-"v- c #000266",
-"w- c #00066A",
-"x- c #000A6D",
-"y- c #000E70",
-"z- c #000C58",
-"A- c #000643",
-"B- c #000337",
-"C- c #000236",
-"D- c #000339",
-"E- c #00053C",
-"F- c #00063E",
-"G- c #00073F",
-"H- c #00145A",
-"I- c #001C78",
-"J- c #000743",
-"K- c #00002A",
-"L- c #00005F",
-"M- c #000267",
-"N- c #000A6C",
-"O- c #000952",
-"P- c #000131",
-"Q- c #000132",
-"R- c #000133",
-"S- c #000134",
-"T- c #000235",
-"U- c #00196E",
-"V- c #001D7A",
-"W- c #001B78",
-"X- c #001977",
-"Y- c #001775",
-"Z- c #001473",
-"`- c #000E66",
-" ; c #00002B",
-".; c #000029",
-"+; c #000053",
-"@; c #00005E",
-"#; c #000265",
-"$; c #000464",
-"%; c #000130",
-"&; c #001160",
-"*; c #001164",
-"=; c #001674",
-"-; c #001272",
-";; c #001071",
-">; c #000E6F",
-",; c #000B6E",
-"'; c #00086C",
-"); c #00045F",
-"!; c #000152",
-"~; c #000046",
-"{; c #000051",
-"]; c #00005A",
-"^; c #00012F",
-"/; c #000542",
-"(; c #00106E",
-"_; c #001070",
-":; c #000F70",
-"<; c #00086B",
-"[; c #000367",
-"}; c #000163",
-"|; c #00005B",
-"1; c #000052",
-"2; c #000047",
-"3; c #000041",
-"4; c #000028",
-"5; c #000021",
-"6; c #000025",
-"7; c #00003E",
-"8; c #00003A",
-"9; c #00075A",
-"0; c #00076B",
-"a; c #000569",
-"b; c #000368",
-"c; c #000162",
-"d; c #00005C",
-"e; c #000054",
-"f; c #00004C",
-"g; c #000042",
-"h; c #000039",
-"i; c #000026",
-"j; c #000023",
-"k; c #000017",
-"l; c #00001C",
-"m; c #00004D",
-"n; c #000055",
-"o; c #000027",
-"p; c #00003D",
-"q; c #000058",
-"r; c #00004E",
-"s; c #000048",
-"t; c #000019",
-"u; c #000012",
-"v; c #00001D",
-"w; c #00001F",
-"x; c #000044",
-"y; c #000008",
-"z; c #000018",
-"A; c #000024",
-"B; c #000015",
-"C; c #000022",
-"D; c #00000F",
-"E; c #000004",
-"F; c #000007",
-"G; c #000009",
-"H; c #00000C",
-"I; c #00000D",
-"J; c #00000E",
-"K; c #00000A",
-"L; c #000003",
-"M; c #000000",
-"N; c #000001",
-"O; c #000005",
-"P; c #00000B",
-" ",
-" ",
-" . + @ # $ % & * ",
-" = - ; > , ' ) ! ~ { ] ^ / ( _ : ",
-" < [ } | 1 2 3 4 5 6 7 8 9 0 a b c d e ",
-" f g h i j k l m n o p q r s t u v w x y z A B ",
-" C D E F G H I J K L M N O P Q R S T U V W X Y Z ` . ",
-" ..+.@.#.$.%.&.*.=.-.;.>.,.'.).!.~.{.].^./.(._.:.<.[.}.|. ",
-" 1.2.3.4.5.6.7.8.9.0.a.b.c.d.e.e.f.g.h.i.j.k.l.m.n.o.p.q.r.s. ",
-" t.u.v.w.x.y.z.A.B.C.D.E.F.G.H.I.J.K.L.M.N.O.P.Q.R.S.T.U.V.W.X.Y. ",
-" Z.`. +.+++@+#+$+%+&+*+=+-+;+>+,+'+)+!+~+{+]+^+/+(+_+:+<+[+}+|+1+2+ ",
-" 3+4+5+6+7+8+9+0+a+b+c+d+e+f+g+h+i+j+k+k+l+m+]+n+o+p+q+r+s+t+u+v+w+x+y+ ",
-" z+A+B+C+D+E+F+G+H+I+J+K+L+M+f+N+O+P+Q+R+S+T+U+V+W+X+Y+Z+`+ @.@+@@@#@$@%@ ",
-" &@*@=@-@;@>@,@'@)@!@~@{@]@^@L+/@(@_@:@<@[@}@|@1@2@3@4@5@6@7@8@9@0@a@b@c@d@ ",
-" e@f@z+A+B+g@h@i@j@k@l@m@n@o@p@q@r@s@t@u@v@w@x@y@z@A@B@C@D@E@F@G@H@I@J@K@L@M@ ",
-" N@O@P@Q@R@S@T@U@V@W@X@Y@l@Z@`@ #.#+#@###$#%#&#*#=#-#;#>#,#'#)#!#~#{#]#^#/#(#_# ",
-" :#<#[#}#|#1#2#3#4#5#6#7#8#9#0#a#b#c#d#e#f#g#h#i#j#k#l#m#n#o#p#q#r#s#t#u#v#w#x#y# ",
-" z#A#B#M@C#D#E#F#G#H#I#J#K#L#M#N#O#P#Q#R#S#T#U#V#W#X#Y#Z#`# $.$+$@$#$$$%$&$*$=$z# ",
-" -$;$>$,$O@'$)$!$~${$]$^$/$($_$:$<$[$}$|$1$2$3$4$5$3$6$7$8$ $9$0$a$b$c$d$e$f$g$h$i$ ",
-" j$k$l$m$n$o$p$q$r$s$t$u$v$w$x$y$z$A$B$C$D$E$F$G$G$H$8$I$J$K$L$M$N$O$P$Q$R$S$T$U$k$V$ ",
-" W$X$Y$Z$`$ %.%+%p$q$@%#%$%%%&%*%=%-%;%>%,%'%)%p#p#J$!%K$~%{%]%^%/%(%_%:%<%[%}%|%1%2% ",
-" 3%4%5%6%7%8%9% %0%a%b%c%d%e%f%g%h%i%j%k%l%m%n%o%p%0$q%r%]%s%t%u%v%w%x%y%z%A%B%C%D%3% ",
-" E%F%G%H%I%J%K%8%L%M%N%O%P%Q%R%S%T%U%V%W%X%Y%Z%`% &9+.&+&V.@&#&$&%&&&*&=&-&;&>&,&'&)& ",
-" !&~&{&]&G%^&I%J%/&(&7%_& %:&<&[&}&|&1&2&3&4&5&6&7&8&9&0&a&$&b&c&d&e&f&g&h&i&j&k&l&m& ",
-" n&o&p&q&r&s&G%t&u&v&w&K%(&x&y&z&A&B&C&D&E&F&G&H&I&J&K&L&M&N&O&P&Q&R&S&T&U&V&W&X&Y&Z& ",
-" `& *.*+*p&q&@*#*$*%*^&u&v&J%&***=*-*;*>*,*'*)*!*~*{*]*^*/*(*_*:*<*[*}*|*V&1*l&Y&Z&2* ",
-" 3*4*5*6*7*8*p&9*0*a*s&b*c*d*v&e*f*g*h*i*j**$k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*Y&Z&A*z* ",
-" B*C*D*E*F*G*H*I*+*p&9*J*r&{&x&K*L*M*N*O*P*Q*R*S*T*U*V*W*X*Y*Z*`* =.=+=@=#=$=%=&=*= ",
-" ==-=;=>=,='=)=!=J*.*~=+*{=]=^=/=(=_=:=l$<=[=}=|=1=2=3=4=5=6=7=8=9=0=a=b=c=%=&=d=e= ",
-" f=g=h=i=3*j=k=l=m=n=o=p=q=~=8*r=^=b*s=t=j$u=-$v=w=x=y=z=A=B=C=D=z*E=F=A*&=d=e=G= ",
-" H===I=J=;=K=L=M=N=O=P=Q=l=n=R=6*S=.*T=D%D%D%U=2%V=V$3%W=J*L=X=Y=$=Z=&=*=e=`= - ",
-" .-+-@-g=#-$-%-&-*-M==---O=P=;-Q=m=>-,-'-)-!-~-{-E%]-^-/-(-_-:-<-*=d=e=`=[-[- ",
-" }-|-1-==2-3-4-4-5-%-6-&-*-X==-=-N=q&;-O=O=O=7-8-9-0-j=a-`&b-c-d=e=`= -[-d-$= ",
-" e-f-g-h-i-4-j-k-l-m-4-c-5-%-6-6-&-&-n-o-o-*-M=p-q-r-3*h=s-X=`= -[-t-u-u- ",
-" v-w-x-y-g-z-A-B-C-j-D-:-l-l-E-m-4-F-F-c-c-c-G-H-#-J=g=I=I-J-t-t-d-u-K- ",
-" L-M-w-N-f-O-P-Q-R-S-T-C-C-B-j-D-D-:-k-l-k-D=U-V-W-X-Y-Z-`-[- ; ;.;u- ",
-" +;@;#;$; ;u-d-t-[- -%;P-Q-R-R-S-B-z*&;*;Y-=;H=-;;;>;,;';);!;%=d- ",
-" ~;{;];u-.;K- ; ;u-d-d-d-t-t-^;/;(;_;;;:;f-}-x-<;w-[;};|;1;2; ",
-" A*%=3;4;5;6;u-7;8;u-K- ; ; ; ;^;9;<;0;w-a;b;v-c;d;e;f;g;h; ",
-" i;j;k;l;d=m;1;n;d= ;i;o;o;o;o;p;@;d;q;+;r;s;3;h;`=K- ",
-" t;u;k;o;e=Z&%=5;*=l;v;v;v;w; ;x;3;p;Z&d=d-i;w; ",
-" y;u;z;v;5;A;A;B;u;u;u;j; ;.;i;C;v;z;u;D; ",
-" E;E;F;G;H;I;I;I;H;D;J;H;K;F;E;K; ",
-" y;L;M;M;N;N;M;N;O;P; ",
-" ",
-" ",
-" ",
-" "};
new file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..e74f5cf2e442458ea5c621e654f853a65031d1b5
GIT binary patch
literal 744
zc$@*~0vG*>P)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00009a7bBm000XT
z000XT0n*)m`~Uy~nn^@KR5*==lgn?6VHC!H-*vvZwQ8oV>GVQLHEyY3gAn5KA6SrB
zSXi>LCy`)b!@^2p!_uO55@|(<jl{LY0%bZ=I-U9EKJ#7P_qA}V`&pfwJkOKo<eW$2
zZ#8}{#kSGDNFpk|hmSw;<V@vHFzwfYbKv5xp-p2a2F3=q_l)$V0^Lya?~4m_ujZ!Q
zr*AI>cTPNBiZ_;u#de-OJ-lw!)irCg8wS&fWOik*(G@jKQEhgsP)_)Pccc^F?5f=K
zqi-brJN@XjQ?b#(GfpC6g$bK*SsaDL2z-QFL#wz%MVN?Bj9=m8&BH%C*l}S!o7Y}9
zNBZr^V46rKg%yjSLO~_BNcqD8`tl@|cLij`(q#Yg?V_>z28FwgFAjQ_9YeR{Ez6{;
z6z<0|rFw^jdYeMNM72~$Pj}I~e=EtcAuPkmup)g3zywVEa5wWs!WSQ@IyQPThS)Mj
zXCRF|njw}=<68#47a(SHC_M?%*b7`XVPBkua+<;i5FuV7h8vF&Ms3=TgQIKcN+K#P
zynKnygGU6_CMY8V=qAhy%5FgO6Id3sns{~uksY8jTf)&Kh636?!M*#mb2)<YA_(6H
zlnFB}T6^A*T)hTagGwGui*V)@je3W+9mj}TX!#uC`7=bbiV{BP`fDW01SIa<B(m!u
zri8{K=r+uhppZv6QABDGqy?G@VHL0xQoHrzjG{J6JGq}QkwFw8D1!{3S%Inx%@9O4
zw0-c3fVd6C^H2-Feqz0aYP}@z_8}L$Q3fbLHNeV%?1xGbI(5LGf!uK@6#fv6o}I8_
z8iqp{RnV&-t6*HgDi4Myp=aYi!vv(D>i}rGKpO&0fp`mQ3hL89?SBGGa}xR5clff@
aZ}l0cBPG#LK)$~K0000<MNUMnLSTXkrBPl0
--- a/browser/components/nsBrowserGlue.js
+++ b/browser/components/nsBrowserGlue.js
@@ -504,17 +504,17 @@ BrowserGlue.prototype = {
// See XXX note above
// bmsvc.runInBatchMode(callback, null);
}
catch(ex) {
Components.utils.reportError(ex);
}
finally {
prefBranch.setBoolPref("browser.places.createdSmartBookmarks", true);
- prefBranch.savePrefFile(null);
+ prefBranch.QueryInterface(Ci.nsIPrefService).savePrefFile(null);
}
},
// for XPCOM
classDescription: "Firefox Browser Glue Service",
classID: Components.ID("{eab9012e-5f74-4cbc-b2b5-a590235513cc}"),
contractID: "@mozilla.org/browser/browserglue;1",
--- a/browser/components/places/content/controller.js
+++ b/browser/components/places/content/controller.js
@@ -420,16 +420,17 @@ PlacesController.prototype = {
switch(nodeType) {
case Ci.nsINavHistoryResultNode.RESULT_TYPE_QUERY:
nodeData["query"] = true;
break;
case Ci.nsINavHistoryResultNode.RESULT_TYPE_DYNAMIC_CONTAINER:
nodeData["dynamiccontainer"] = true;
break;
case Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER:
+ case Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER_SHORTCUT:
nodeData["folder"] = true;
break;
case Ci.nsINavHistoryResultNode.RESULT_TYPE_HOST:
nodeData["host"] = true;
break;
case Ci.nsINavHistoryResultNode.RESULT_TYPE_SEPARATOR:
nodeData["separator"] = true;
break;
--- a/browser/components/places/content/editBookmarkOverlay.js
+++ b/browser/components/places/content/editBookmarkOverlay.js
@@ -433,24 +433,24 @@ var gEditItemOverlay = {
},
_updateTags: function EIO__updateTags() {
var currentTags = PlacesUtils.tagging.getTagsForURI(this._uri, { });
var tags = this._getTagsArrayFromTagField();
if (tags.length > 0 || currentTags.length > 0) {
var tagsToRemove = [];
var tagsToAdd = [];
- var t;
- for each (t in currentTags) {
- if (tags.indexOf(t) == -1)
- tagsToRemove.push(t);
+ var i;
+ for (i = 0; i < currentTags.length; i++) {
+ if (tags.indexOf(currentTags[i]) == -1)
+ tagsToRemove.push(currentTags[i]);
}
- for each (t in tags) {
- if (currentTags.indexOf(t) == -1)
- tagsToAdd.push(t);
+ for (i = 0; i < tags.length; i++) {
+ if (currentTags.indexOf(tags[i]) == -1)
+ tagsToAdd.push(tags[i]);
}
if (tagsToAdd.length > 0)
PlacesUtils.tagging.tagURI(this._uri, tagsToAdd);
if (tagsToRemove.length > 0)
PlacesUtils.tagging.untagURI(this._uri, tagsToRemove);
}
},
@@ -638,27 +638,28 @@ var gEditItemOverlay = {
container != PlacesUtils.toolbarFolderId &&
container != PlacesUtils.bookmarksMenuFolderId)
this._markFolderAsRecentlyUsed(container);
}
// Update folder-tree selection
if (!this._folderTree.collapsed) {
var selectedNode = this._folderTree.selectedNode;
- if (!selectedNode || selectedNode.itemId != container)
+ if (!selectedNode ||
+ PlacesUtils.getConcreteItemId(selectedNode) != container)
this._folderTree.selectItems([container]);
}
},
onFolderTreeSelect: function EIO_onFolderTreeSelect() {
var selectedNode = this._folderTree.selectedNode;
if (!selectedNode)
return;
- var folderId = selectedNode.itemId;
+ var folderId = PlacesUtils.getConcreteItemId(selectedNode);
if (this._getFolderIdFromMenuList() == folderId)
return;
var folderItem = this._getFolderMenuItem(folderId);
this._folderMenuList.selectedItem = folderItem;
folderItem.doCommand();
},
@@ -677,17 +678,18 @@ var gEditItemOverlay = {
if (tagsSelector.collapsed)
return;
while (tagsSelector.hasChildNodes())
tagsSelector.removeChild(tagsSelector.lastChild);
var tagsInField = this._getTagsArrayFromTagField();
var allTags = PlacesUtils.tagging.allTags;
- for each (var tag in allTags) {
+ for (var i = 0; i < allTags.length; i++) {
+ var tag = allTags[i];
var elt = document.createElement("listitem");
elt.setAttribute("type", "checkbox");
elt.setAttribute("label", tag);
if (tagsInField.indexOf(tag) != -1)
elt.setAttribute("checked", "true");
tagsSelector.appendChild(elt);
}
--- a/browser/components/places/content/menu.xml
+++ b/browser/components/places/content/menu.xml
@@ -506,27 +506,27 @@
<getter><![CDATA[
if (this._cachedInsertionPoint !== undefined)
return this._cachedInsertionPoint;
// By default, the insertion point is at the top level, at the end.
var index = -1;
var folderId = 0;
if (PlacesUtils.nodeIsFolder(this._resultNode))
- folderId = this._resultNode.itemId;
+ folderId = PlacesUtils.getConcreteItemId(this._resultNode);
if (this.hasSelection) {
if (PlacesUtils.nodeIsFolder(this.selectedNode)) {
// If there is a folder selected, the insertion point is the
// end of the folder.
- folderId = this.selectedNode.itemId;
+ folderId = PlacesUtils.getConcreteItemId(this.selectedNode);
} else {
// If there is another type of node selected, the insertion point
// is after that node.
- folderId = this.selectedNode.parent.itemId;
+ folderId = PlacesUtils.getConcreteItemId(this.selectedNode.parent);
index = PlacesUtils.getIndexOfNode(this.selectedNode)
}
}
this._cachedInsertionPoint = new InsertionPoint(folderId, index);
return this._cachedInsertionPoint;
]]></getter>
</property>
--- a/browser/components/places/content/toolbar.xml
+++ b/browser/components/places/content/toolbar.xml
@@ -390,27 +390,27 @@
<!-- nsIPlacesView -->
<property name="insertionPoint">
<getter><![CDATA[
if (this._cachedInsertionPoint !== undefined)
return this._cachedInsertionPoint;
// By default, the insertion point is at the top level, at the end.
var index = -1;
- var folderId = this._result.root.itemId;
+ var folderId = PlacesUtils.getConcreteItemId(this._result.root);
if (this.hasSelection) {
if (PlacesUtils.nodeIsFolder(this.selectedNode)) {
// If there is a folder selected, the insertion point is the
// end of the folder.
- folderId = this.selectedNode.itemId;
+ folderId = PlacesUtils.getConcreteItemId(this.selectedNode);
} else {
// If there is another type of node selected, the insertion point
// is after that node.
- index = PlacesUtils.getIndexOfNode(this.selectedNode)
+ index = PlacesUtils.getIndexOfNode(this.selectedNode);
}
}
this._cachedInsertionPoint = new InsertionPoint(folderId, index, 1);
return this._cachedInsertionPoint;
]]></getter>
</property>
<!-- nsIPlacesView -->
@@ -751,40 +751,48 @@
if (PlacesUtils.nodeIsFolder(xulNode.node) &&
!PlacesUtils.nodeIsReadOnly(xulNode.node)) {
NS_ASSERT(xulNode.getAttribute("type") == "menu");
// This is a folder. If the mouse is in the left 25% of the
// node, drop to the left of the folder. If it's in the middle
// 50%, drop into the folder. If it's past that, drop to the right.
if (event.clientX < xulNode.boxObject.x + (xulNode.boxObject.width * 0.25)) {
// Drop to the left of this folder.
- dropPoint.ip = new InsertionPoint(result.root.itemId, i, -1);
+ dropPoint.ip =
+ new InsertionPoint(PlacesUtils.getConcreteItemId(result.root),
+ i, -1);
dropPoint.beforeIndex = i;
return dropPoint;
}
else if (event.clientX < xulNode.boxObject.x + (xulNode.boxObject.width * 0.75)) {
// Drop inside this folder.
- dropPoint.ip = new InsertionPoint(xulNode.node.itemId, -1, 1);
+ dropPoint.ip =
+ new InsertionPoint(PlacesUtils.getConcreteItemId(xulNode.node),
+ -1, 1);
dropPoint.beforeIndex = i;
dropPoint.folderNode = xulNode;
return dropPoint;
}
} else{
// This is a non-folder node. If the mouse is left of the middle,
// drop to the left of the folder. If it's right, drop to the right.
if (event.clientX < xulNode.boxObject.x + (xulNode.boxObject.width / 2)) {
// Drop to the left of this bookmark.
- dropPoint.ip = new InsertionPoint(result.root.itemId, i, -1);
+ dropPoint.ip =
+ new InsertionPoint(PlacesUtils.getConcreteItemId(result.root),
+ i, -1);
dropPoint.beforeIndex = i;
return dropPoint;
}
}
}
// Should drop to the right of the last node.
- dropPoint.ip = new InsertionPoint(result.root.itemId, -1, 1);
+ dropPoint.ip =
+ new InsertionPoint(PlacesUtils.getConcreteItemId(result.root),
+ -1, 1);
dropPoint.beforeIndex = -1;
return dropPoint;
},
onDragStart: function TBV_DO_onDragStart(event, xferData, dragAction) {
if (event.target.localName == "toolbarbutton" &&
event.target.getAttribute("type") == "menu") {
#ifdef XP_WIN
--- a/browser/components/places/content/tree.xml
+++ b/browser/components/places/content/tree.xml
@@ -507,36 +507,35 @@
// If the sole selection is an open container, insert into it rather
// than adjacent to it. Note that this only applies to _single_
// selections - if the last element within a multi-selection is an
// open folder, insert _adajacent_ to the selection.
//
// If the sole selection is the bookmarks toolbar folder, we insert
// into it even if it is not opened
+ var itemId =
+ PlacesUtils.getConcreteItemId(resultView.nodeForTreeIndex(max.value));
if (this.hasSingleSelection && resultView.isContainer(max.value) &&
(resultView.isContainerOpen(max.value) ||
- resultView.nodeForTreeIndex(max.value)
- .itemId == PlacesUtils.bookmarksMenuFolderId))
+ itemId == PlacesUtils.bookmarksMenuFolderId))
orientation = NHRVO.DROP_ON;
this._cachedInsertionPoint =
this._getInsertionPoint(max.value, orientation);
return this._cachedInsertionPoint;
]]></getter>
</property>
<method name="_disallowInsertion">
<parameter name="aContainer"/>
<body><![CDATA[
// Disallow insertion of items under readonly folders
- // Disallow insertion of items under the places root
return (!PlacesUtils.nodeIsFolder(aContainer) ||
- PlacesUtils.nodeIsReadOnly(aContainer) ||
- aContainer.itemId == PlacesUtils.placesRootId);
+ PlacesUtils.nodeIsReadOnly(aContainer));
]]></body>
</method>
<method name="_getInsertionPoint">
<parameter name="index"/>
<parameter name="orientation"/>
<body><![CDATA[
var result = this.getResult();
@@ -576,17 +575,18 @@
var lsi = PlacesUtils.getIndexOfNode(lastSelected);
index = orientation == NHRVO.DROP_BEFORE ? lsi : lsi + 1;
}
}
if (this._disallowInsertion(container))
return null;
- return new InsertionPoint(container.itemId, index, orientation);
+ return new InsertionPoint(PlacesUtils.getConcreteItemId(container),
+ index, orientation);
]]></body>
</method>
<!-- nsIPlacesView -->
<field name="peerDropTypes">PlacesUtils.GENERIC_VIEW_DROP_TYPES</field>
<!-- nsIPlacesView -->
<field name="childDropTypes">PlacesUtils.GENERIC_VIEW_DROP_TYPES</field>
@@ -622,17 +622,23 @@
* from the IDs array, and add the found node to the nodes dictionary.
*
* NOTE: This method will leave open any node that had matching items
* in its subtree.
*/
function findNodes(node) {
var foundOne = false;
// See if node matches an ID we wanted; add to results.
+ // For simple folder queries, check both itemId and the concrete
+ // item id.
var index = ids.indexOf(node.itemId);
+ if (index == -1 &&
+ node.type == Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER_SHORTCUT)
+ index = ids.indexOf(asQuery(node).folderItemId);
+
if (index != -1) {
nodes.push(node);
foundOne = true;
ids.splice(index, 1);
}
if (ids.length == 0 || !PlacesUtils.nodeIsContainer(node) ||
nodesURIChecked.indexOf(node.uri) != -1)
--- a/browser/components/places/content/treeView.js
+++ b/browser/components/places/content/treeView.js
@@ -370,26 +370,27 @@ PlacesTreeView.prototype = {
if (!parent)
item.containerOpen = !item.containerOpen;
}
this._tree.endUpdateBatch();
// restore selection
if (previouslySelectedNodes.length > 0) {
- for each (var nodeInfo in previouslySelectedNodes) {
+ for (var i = 0; i < previouslySelectedNodes.length; i++) {
+ var nodeInfo = previouslySelectedNodes[i];
var index = nodeInfo.node.viewIndex;
// if the same node was used (happens on sorting-changes),
// just use viewIndex
if (index == -1) { // otherwise, try to find an equal node
- var itemId = nodeInfo.node.itemId;
+ var itemId = PlacesUtils.getConcreteItemId(nodeInfo.node);
if (itemId != 1) { // bookmark-nodes in queries case
for (i=0; i < newElements.length && index == -1; i++) {
- if (newElements[i].itemId == itemId)
+ if (PlacesUtils.getConcreteItemId(newElements[i]) == itemId)
index = newElements[i].viewIndex;
}
}
else { // history nodes
var uri = nodeInfo.node.uri;
if (uri) {
for (i=0; i < newElements.length && index == -1; i++) {
if (newElements[i].uri == uri)
@@ -587,20 +588,23 @@ PlacesTreeView.prototype = {
newViewIndex = viewIndex;
break;
}
}
if (newViewIndex < 0) {
// At the end of the child list without finding a visible sibling: This
// is a little harder because we don't know how many rows the last item
// in our list takes up (it could be a container with many children).
- var lastRowCount =
- this._countVisibleRowsForItem(aParent.getChild(aNewIndex - 1));
- newViewIndex =
- aParent.getChild(aNewIndex - 1).viewIndex + lastRowCount;
+ var prevChild = aParent.getChild(aNewIndex - 1);
+ newViewIndex = prevChild.viewIndex + this._countVisibleRowsForItem(prevChild);
+ // If we were in the same parent and we are swapping the order, we need to adjust
+ if (prevChild.parent == aItem.parent &&
+ aItem.viewIndex != -1 && // view index may not be set
+ prevChild.viewIndex > aItem.viewIndex)
+ newViewIndex--;
}
}
// Try collapsing with the previous node. Note that we do not have to try
// to redraw the surrounding rows (which we normally would because session
// boundaries may have changed) because when an item is merged, it will
// always be in the same session.
var showThis = { value: true };
@@ -680,17 +684,18 @@ PlacesTreeView.prototype = {
// if the item was exclusively selected, the node next to it will be
// selected
var selectNext = false;
var selection = this.selection;
if (selection.getRangeCount() == 1) {
var min = { }, max = { };
selection.getRangeAt(0, min, max);
- if (min.value == max.value)
+ if (min.value == max.value &&
+ this.nodeForTreeIndex(min.value) == aItem)
selectNext = true;
}
// this may have been a container, in which case it has a lot of rows
var count = this._countVisibleRowsForItem(aItem);
// We really want tail recursion here, since we sometimes do another
// remove after this when duplicates are being collapsed. This loop
@@ -774,17 +779,18 @@ PlacesTreeView.prototype = {
// remove the nodes, let itemInserted restore all of its contents
this._visibleElements.splice(oldViewIndex, count);
this._tree.rowCountChanged(oldViewIndex, -count);
this.itemInserted(aNewParent, aItem, aNewIndex);
// restore selection
if (nodesToSelect.length > 0) {
- for each (var node in nodesToSelect) {
+ for (var i = 0; i < nodesToSelect.length; i++) {
+ var node = nodesToSelect[i];
var index = node.viewIndex;
selection.rangedSelect(index, index, true);
}
selection.selectEventsSuppressed = false;
}
},
/**
@@ -1004,35 +1010,37 @@ PlacesTreeView.prototype = {
else
var columnType = aColumn.id;
if (columnType != "title")
return;
var node = this._visibleElements[aRow];
- // To disable the tree gestures for containers (e.g. double-click to open)
- // we don't mark container nodes as such in flat list mode. The container
- // appearance is desired though, so we add the container atom manually.
- if (this._flatList && PlacesUtils.nodeIsContainer(node))
- aProperties.AppendElement(this._getAtomFor("container"));
-
- if (PlacesUtils.nodeIsSeparator(node))
- aProperties.AppendElement(this._getAtomFor("separator"));
- else if (node.type == Ci.nsINavHistoryResultNode.RESULT_TYPE_QUERY)
- aProperties.AppendElement(this._getAtomFor("query"));
- else if (node.type == Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER) {
- if (PlacesUtils.annotations.itemHasAnnotation(node.itemId,
- LMANNO_FEEDURI))
- aProperties.AppendElement(this._getAtomFor("livemark"));
- else if (PlacesUtils.bookmarks.getFolderIdForItem(node.itemId) ==
- PlacesUtils.tagsFolderId) {
- aProperties.AppendElement(this._getAtomFor("tagContainer"));
+ var nodeType = node.type;
+ if (PlacesUtils.containerTypes.indexOf(nodeType) != -1) {
+ // To disable the tree gestures for containers (e.g. double-click to open)
+ // we don't mark container nodes as such in flat list mode. The container
+ // appearance is desired though, so we add the container atom manually.
+ if (this._flatList)
+ aProperties.AppendElement(this._getAtomFor("container"));
+ if (nodeType == Ci.nsINavHistoryResultNode.RESULT_TYPE_QUERY)
+ aProperties.AppendElement(this._getAtomFor("query"));
+ else if (nodeType == Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER ||
+ nodeType == Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER_SHORTCUT) {
+ if (PlacesUtils.annotations.itemHasAnnotation(node.itemId,
+ LMANNO_FEEDURI))
+ aProperties.AppendElement(this._getAtomFor("livemark"));
+ else if (PlacesUtils.bookmarks.getFolderIdForItem(node.itemId) ==
+ PlacesUtils.tagsFolderId)
+ aProperties.AppendElement(this._getAtomFor("tagContainer"));
}
}
+ else if (nodeType == Ci.nsINavHistoryResultNode.RESULT_TYPE_SEPARATOR)
+ aProperties.AppendElement(this._getAtomFor("separator"));
},
getColumnProperties: function(aColumn, aProperties) { },
isContainer: function PTV_isContainer(aRow) {
this._ensureValidRow(aRow);
if (this._flatList)
return false; // but see getCellProperties
--- a/browser/components/places/content/utils.js
+++ b/browser/components/places/content/utils.js
@@ -248,17 +248,18 @@ var PlacesUtils = {
/**
* Determines whether or not a ResultNode is a Bookmark folder or not.
* @param aNode
* A result node
* @returns true if the node is a Bookmark folder, false otherwise
*/
nodeIsFolder: function PU_nodeIsFolder(aNode) {
NS_ASSERT(aNode, "null node");
- return (aNode.type == Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER);
+ return (aNode.type == Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER ||
+ aNode.type == Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER_SHORTCUT);
},
/**
* Determines whether or not a ResultNode represents a bookmarked URI.
* @param aNode
* A result node
* @returns true if the node represents a bookmarked URI, false otherwise
*/
@@ -326,17 +327,17 @@ var PlacesUtils = {
* @param aNode
* A result node
* @returns true if the node is readonly, false otherwise
*/
nodeIsReadOnly: function PU_nodeIsReadOnly(aNode) {
NS_ASSERT(aNode, "null node");
if (this.nodeIsFolder(aNode))
- return this.bookmarks.getFolderReadonly(aNode.itemId);
+ return this.bookmarks.getFolderReadonly(asQuery(aNode).folderItemId);
if (this.nodeIsQuery(aNode))
return asQuery(aNode).childrenReadOnly;
return false;
},
/**
* Determines whether or not a ResultNode is a host folder or not
* @param aNode
@@ -350,16 +351,17 @@ var PlacesUtils = {
/**
* Determines whether or not a ResultNode is a container item or not
* @param aNode
* A result node
* @returns true if the node is a container item, false otherwise
*/
containerTypes: [Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER,
+ Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER_SHORTCUT,
Ci.nsINavHistoryResultNode.RESULT_TYPE_QUERY,
Ci.nsINavHistoryResultNode.RESULT_TYPE_HOST,
Ci.nsINavHistoryResultNode.RESULT_TYPE_DAY,
Ci.nsINavHistoryResultNode.RESULT_TYPE_DYNAMIC_CONTAINER],
nodeIsContainer: function PU_nodeIsContainer(aNode) {
NS_ASSERT(aNode, "null node");
return this.containerTypes.indexOf(aNode.type) != -1;
},
@@ -409,17 +411,27 @@ var PlacesUtils = {
* @param aNode
* The node to test.
* @returns true if the node is a readonly folder.
*/
isReadonlyFolder: function(aNode) {
NS_ASSERT(aNode, "null node");
return this.nodeIsFolder(aNode) &&
- this.bookmarks.getFolderReadonly(aNode.itemId);
+ this.bookmarks.getFolderReadonly(asQuery(aNode).folderItemId);
+ },
+
+ /**
+ * Gets the concrete item-id for the given node. Generally, this is just
+ * node.itemId, but for folder-shortcuts that's node.folderItemId.
+ */
+ getConcreteItemId: function PU_getConcreteItemId(aNode) {
+ if (aNode.type == Ci.nsINavHistoryResultNode.RESULT_TYPE_FOLDER_SHORTCUT)
+ return asQuery(aNode).folderItemId;
+ return aNode.itemId;
},
/**
* Gets the index of a node within its parent container
* @param aNode
* The node to look up
* @returns The index of the node within its parent container, or -1 if the
* node was not found or the node specified has no parent.
@@ -1561,18 +1573,19 @@ var PlacesUtils = {
/**
* Get the most recently added/modified bookmark for a URL, excluding items
* under tag or livemark containers. -1 is returned if no item is found.
*/
getMostRecentBookmarkForURI:
function PU_getMostRecentBookmarkForURI(aURI) {
var bmkIds = this.bookmarks.getBookmarkIdsForURI(aURI, {});
- for each (var bk in bmkIds) {
+ for (var i = 0; i < bmkIds.length; i++) {
// Find the first folder which isn't a tag container
+ var bk = bmkIds[i];
var parent = this.bookmarks.getFolderIdForItem(bk);
if (parent == this.unfiledBookmarksFolderId)
return bk;
var grandparent = this.bookmarks.getFolderIdForItem(parent);
if (grandparent != this.tagsFolderId &&
!this.annotations.itemHasAnnotation(parent, LMANNO_FEEDURI))
return bk;
@@ -1683,17 +1696,18 @@ var PlacesUtils = {
return reallyOpen;
},
/** aItemsToOpen needs to be an array of objects of the form:
* {uri: string, isBookmark: boolean}
*/
_openTabset: function PU__openTabset(aItemsToOpen, aEvent) {
var urls = [];
- for each (var item in aItemsToOpen) {
+ for (var i = 0; i < aItemsToOpen.length; i++) {
+ var item = aItemsToOpen[i];
if (item.isBookmark)
this.markPageAsFollowedBookmark(item.uri);
else
this.markPageAsTyped(item.uri);
urls.push(item.uri);
}
--- a/browser/components/preferences/advanced.js
+++ b/browser/components/preferences/advanced.js
@@ -50,16 +50,17 @@ var gAdvancedPane = {
var preference = document.getElementById("browser.preferences.advanced.selectedTabIndex");
if (preference.value === null)
return;
advancedPrefs.selectedIndex = preference.value;
this.updateAppUpdateItems();
this.updateAutoItems();
this.updateModeItems();
+ this.updateOfflineApps();
},
/**
* Stores the identity of the current tab in preferences so that the selected
* tab can be persisted between openings of the preferences window.
*/
tabSelectionChanged: function ()
{
@@ -174,16 +175,104 @@ var gAdvancedPane = {
{
var cacheService = Components.classes["@mozilla.org/network/cache-service;1"]
.getService(Components.interfaces.nsICacheService);
try {
cacheService.evictEntries(Components.interfaces.nsICache.STORE_ANYWHERE);
} catch(ex) {}
},
+ /**
+ * Updates the list of offline applications
+ */
+ updateOfflineApps: function ()
+ {
+ var pm = Components.classes["@mozilla.org/permissionmanager;1"]
+ .getService(Components.interfaces.nsIPermissionManager);
+
+ var list = document.getElementById("offlineAppsList");
+ while (list.firstChild) {
+ list.removeChild(list.firstChild);
+ }
+
+ var enumerator = pm.enumerator;
+ while (enumerator.hasMoreElements()) {
+ var perm = enumerator.getNext().QueryInterface(Components.interfaces.nsIPermission);
+ if (perm.type == "offline-app" &&
+ perm.capability != Components.interfaces.nsIPermissionManager.DEFAULT_ACTION &&
+ perm.capability != Components.interfaces.nsIPermissionManager.DENY_ACTION) {
+ var row = document.createElementNS(kXULNS, "listitem");
+ row.id = "";
+ row.className = "listitem";
+ row.setAttribute("label", perm.host);
+
+ list.appendChild(row);
+ }
+ }
+ },
+
+ offlineAppSelected: function()
+ {
+ var removeButton = document.getElementById("offlineAppsListRemove");
+ var list = document.getElementById("offlineAppsList");
+ if (list.selectedItem) {
+ removeButton.setAttribute("disabled", "false");
+ } else {
+ removeButton.setAttribute("disabled", "true");
+ }
+ },
+
+ removeOfflineApp: function()
+ {
+ var list = document.getElementById("offlineAppsList");
+ var item = list.selectedItem;
+ var host = item.getAttribute("label");
+
+ var prompts = Components.classes["@mozilla.org/embedcomp/prompt-service;1"]
+ .getService(Components.interfaces.nsIPromptService);
+ var flags = prompts.BUTTON_TITLE_IS_STRING * prompts.BUTTON_POS_0 +
+ prompts.BUTTON_TITLE_CANCEL * prompts.BUTTON_POS_1;
+
+ var bundle = document.getElementById("bundlePreferences");
+ var title = bundle.getString("offlineAppRemoveTitle");
+ var prompt = bundle.getFormattedString("offlineAppRemovePrompt", [host]);
+ var confirm = bundle.getString("offlineAppRemoveConfirm");
+ var result = prompts.confirmEx(window, title, prompt, flags, confirm,
+ null, null, null, {});
+ if (result != 0)
+ return;
+
+ // clear offline cache entries
+ var cacheService = Components.classes["@mozilla.org/network/cache-service;1"]
+ .getService(Components.interfaces.nsICacheService);
+ var cacheSession = cacheService.createSession("HTTP-offline",
+ Components.interfaces.nsICache.STORE_OFFLINE,
+ true)
+ .QueryInterface(Components.interfaces.nsIOfflineCacheSession);
+ cacheSession.clearKeysOwnedByDomain(host);
+ cacheSession.evictUnownedEntries();
+
+ // send out an offline-app-removed signal. The nsDOMStorage
+ // service will clear DOM storage for this host.
+ var obs = Components.classes["@mozilla.org/observer-service;1"]
+ .getService(Components.interfaces.nsIObserverService);
+ obs.notifyObservers(null, "offline-app-removed", host);
+
+ // remove the permission
+ var pm = Components.classes["@mozilla.org/permissionmanager;1"]
+ .getService(Components.interfaces.nsIPermissionManager);
+ pm.remove(host, "offline-app",
+ Components.interfaces.nsIPermissionManager.ALLOW_ACTION);
+ pm.remove(host, "offline-app",
+ Components.interfaces.nsIOfflineCacheUpdateService.ALLOW_NO_WARN);
+
+ list.removeChild(item);
+ gAdvancedPane.offlineAppSelected();
+ },
+
// UPDATE TAB
/*
* Preferences:
*
* app.update.enabled
* - true if updates to the application are enabled, false otherwise
* extensions.update.enabled
--- a/browser/components/preferences/advanced.xul
+++ b/browser/components/preferences/advanced.xul
@@ -19,16 +19,17 @@
# The Initial Developer of the Original Code is
# Ben Goodger.
# Portions created by the Initial Developer are Copyright (C) 2005
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Ben Goodger <[email protected]>
# Jeff Walden <[email protected]>
+# Ehsan Akhgari <[email protected]>
#
# Alternatively, the contents of this file may be used under the terms of
# either the GNU General Public License Version 2 or later (the "GPL"), or
# the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
# in which case the provisions of the GPL or the LGPL are applicable instead
# of those above. If you wish to allow use of your version of this file only
# under the terms of either the GPL or the LGPL, and not to allow others to
# use your version of this file under the terms of the MPL, indicate your
@@ -209,34 +210,53 @@
<hbox align="center">
<description flex="1" control="connectionSettings">&connectionDesc.label;</description>
<button id="connectionSettings" icon="network" label="&connectionSettings.label;"
accesskey="&connectionSettings.accesskey;"
oncommand="gAdvancedPane.showConnections();"/>
</hbox>
</groupbox>
- <!-- Cache -->
- <groupbox id="cacheGroup">
- <caption label="&cache.label;"/>
+ <!-- Cache/Offline apps -->
+ <groupbox id="offlineGroup">
+ <caption label="&offlineStorage.label;"/>
<hbox align="center">
<label id="useCacheBefore"
accesskey="&useCacheBefore.accesskey;">&useCacheBefore.label;</label>
<textbox id="cacheSize" type="number" size="2"
preference="browser.cache.disk.capacity"
onsyncfrompreference="return gAdvancedPane.readCacheSize();"
onsynctopreference="return gAdvancedPane.writeCacheSize();"
aria-labelledby="useCacheBefore cacheSize useCacheAfter"/>
<label id="useCacheAfter" flex="1">&useCacheAfter.label;</label>
<button id="clearCacheButton" icon="clear"
label="&clearCacheNow.label;" accesskey="&clearCacheNow.accesskey;"
oncommand="gAdvancedPane.clearCache();"/>
</hbox>
- </groupbox>
+ <hbox>
+ <vbox flex="1">
+
+ <label id="offlineAppsListLabel">&offlineAppsList.label;</label>
+ <listbox id="offlineAppsList"
+ style="height: &offlineAppsList.height;;"
+ flex="1"
+ aria-labelledby="offlineAppsListLabel"
+ onselect="gAdvancedPane.offlineAppSelected(event);">
+ </listbox>
+ </vbox>
+ <vbox pack="end">
+ <button id="offlineAppsListRemove"
+ disabled="true"
+ label="&offlineAppsListRemove.label;"
+ accesskey="&offlineAppsListRemove.accesskey;"
+ oncommand="gAdvancedPane.removeOfflineApp();"/>
+ </vbox>
+ </hbox>
+ </groupbox>
</tabpanel>
<!-- Update -->
<tabpanel id="updatePanel" orient="vertical" align="start">
<label control="autoUpdateGroup">&autoCheck.label;</label>
<vbox class="indent" id="autoUpdateGroup" role="group">
<checkbox id="enableAppUpdate"
label="&enableAppUpdate.label;"
@@ -310,17 +330,17 @@
</rows>
</grid>
</groupbox>
<!-- Certificates -->
<groupbox id="certificatesGroup">
<caption id="CertGroupCaption" label="&certificates.label;"/>
- <description id="CertSelectionDesc" control="certSelection">&certselect.description;</description>
+ <description id="CertSelectionDesc" control="certSelection">&certSelection.description;</description>
<!--
The values on these radio buttons may look like l12y issues, but
they're not - this preference uses *those strings* as its values.
I KID YOU NOT.
-->
<radiogroup id="certSelection" orient="horizontal" preftype="string"
preference="security.default_personal_cert" aria-abelledby="CertGroupCaption CertSelectionDesc">
--- a/browser/components/preferences/applications.js
+++ b/browser/components/preferences/applications.js
@@ -845,20 +845,26 @@ var gApplicationsPane = {
this._prefSvc.addObserver(PREF_FEED_SELECTED_READER, this, false);
// Listen for window unload so we can remove our preference observers.
window.addEventListener("unload", this, false);
// Figure out how we should be sorting the list. We persist sort settings
// across sessions, so we can't assume the default sort column/direction.
// XXX should we be using the XUL sort service instead?
- if (document.getElementById("typeColumn").hasAttribute("sortDirection"))
+ if (document.getElementById("actionColumn").hasAttribute("sortDirection")) {
+ this._sortColumn = document.getElementById("actionColumn");
+ // The typeColumn element always has a sortDirection attribute,
+ // either because it was persisted or because the default value
+ // from the xul file was used. If we are sorting on the other
+ // column, we should remove it.
+ document.getElementById("typeColumn").removeAttribute("sortDirection");
+ }
+ else
this._sortColumn = document.getElementById("typeColumn");
- else if (document.getElementById("actionColumn").hasAttribute("sortDirection"))
- this._sortColumn = document.getElementById("actionColumn");
// Load the data and build the list of handlers.
// By doing this in a timeout, we let the preferences dialog resize itself
// to an appropriate size before we add a bunch of items to the list.
// Otherwise, if there are many items, and the Applications prefpane
// is the one that gets displayed when the user first opens the dialog,
// the dialog might stretch too much in an attempt to fit them all in.
// XXX Shouldn't we perhaps just set a max-height on the richlistbox?
@@ -1011,29 +1017,30 @@ var gApplicationsPane = {
_rebuildVisibleTypes: function() {
// Reset the list of visible types and the visible type description counts.
this._visibleTypes = [];
this._visibleTypeDescriptionCount = {};
// Get the preferences that help determine what types to show.
var showPlugins = this._prefSvc.getBoolPref(PREF_SHOW_PLUGINS_IN_LIST);
- var hideTypesWithoutExtensions =
+ var hidePluginsWithoutExtensions =
this._prefSvc.getBoolPref(PREF_HIDE_PLUGINS_WITHOUT_EXTENSIONS);
for (let type in this._handledTypes) {
let handlerInfo = this._handledTypes[type];
- // Hide types without extensions if so prefed so we don't show a whole
- // bunch of obscure types handled by plugins on Mac.
+ // Hide plugins without associated extensions if so prefed so we don't
+ // show a whole bunch of obscure types handled by plugins on Mac.
// Note: though protocol types don't have extensions, we still show them;
- // the pref is only meant to be applied to MIME types.
- // FIXME: if the type has a plugin, should we also check the "suffixes"
- // property of the plugin? Filed as bug 395135.
- if (hideTypesWithoutExtensions &&
+ // the pref is only meant to be applied to MIME types, since plugins are
+ // only associated with MIME types.
+ // FIXME: should we also check the "suffixes" property of the plugin?
+ // Filed as bug 395135.
+ if (hidePluginsWithoutExtensions && handlerInfo.handledOnlyByPlugin &&
handlerInfo.wrappedHandlerInfo instanceof Ci.nsIMIMEInfo &&
!handlerInfo.primaryExtension)
continue;
// Hide types handled only by plugins if so prefed.
if (handlerInfo.handledOnlyByPlugin && !showPlugins)
continue;
--- a/browser/components/preferences/cookies.js
+++ b/browser/components/preferences/cookies.js
@@ -265,16 +265,28 @@ var gCookiesWindow = {
}
return null;
},
_removeItemAtIndex: function (aIndex, aCount)
{
var removeCount = aCount === undefined ? 1 : aCount;
if (this._filtered) {
+ // remove the cookies from the unfiltered set so that they
+ // don't reappear when the filter is changed. See bug 410863.
+ for (var i = aIndex; i < aIndex + removeCount; ++i) {
+ var item = this._filterSet[i];
+ var parent = gCookiesWindow._hosts[item.rawHost];
+ for (var j = 0; j < parent.cookies.length; ++j) {
+ if (item == parent.cookies[j]) {
+ parent.cookies.splice(j, 1);
+ break;
+ }
+ }
+ }
this._filterSet.splice(aIndex, removeCount);
return;
}
var item = this._getItemAtIndex(aIndex);
if (!item) return;
this._invalidateCache(aIndex - 1);
if (item.container)
--- a/browser/components/preferences/sanitize.xul
+++ b/browser/components/preferences/sanitize.xul
@@ -57,16 +57,17 @@
<preferences>
<preference id="privacy.item.history" name="privacy.item.history" type="bool"/>
<preference id="privacy.item.formdata" name="privacy.item.formdata" type="bool"/>
<preference id="privacy.item.passwords" name="privacy.item.passwords" type="bool"/>
<preference id="privacy.item.downloads" name="privacy.item.downloads" type="bool"/>
<preference id="privacy.item.cookies" name="privacy.item.cookies" type="bool"/>
<preference id="privacy.item.cache" name="privacy.item.cache" type="bool"/>
+ <preference id="privacy.item.offlineApps" name="privacy.item.offlineApps" type="bool"/>
<preference id="privacy.item.sessions" name="privacy.item.sessions" type="bool"/>
</preferences>
<description>&clearDataSettings.label;</description>
<checkbox label="&itemHistory.label;"
accesskey="&itemHistory.accesskey;"
preference="privacy.item.history"/>
@@ -77,16 +78,19 @@
accesskey="&itemFormSearchHistory.accesskey;"
preference="privacy.item.formdata"/>
<checkbox label="&itemCache.label;"
accesskey="&itemCache.accesskey;"
preference="privacy.item.cache"/>
<checkbox label="&itemCookies.label;"
accesskey="&itemCookies.accesskey;"
preference="privacy.item.cookies"/>
+ <checkbox label="&itemOfflineApps.label;"
+ accesskey="&itemOfflineApps.accesskey;"
+ preference="privacy.item.offlineApps"/>
<checkbox label="&itemPasswords.label;"
accesskey="&itemPasswords.accesskey;"
preference="privacy.item.passwords"/>
<checkbox label="&itemSessions.label;"
accesskey="&itemSessions.accesskey;"
preference="privacy.item.sessions"/>
</prefpane>
--- a/browser/components/safebrowsing/content/malware-warden.js
+++ b/browser/components/safebrowsing/content/malware-warden.js
@@ -85,22 +85,26 @@ function PROT_MalwareWarden() {
},
updateUrlRequested: function(url) { },
streamCompleted: function() { },
updateError: function(errorCode) { },
updateSuccess: function(requestedTimeout) { }
};
- dbService_.beginUpdate(listener);
- dbService_.beginStream();
- dbService_.updateStream(testUpdate);
- dbService_.finishStream();
- dbService_.finishUpdate();
-
+ try {
+ dbService_.beginUpdate(listener);
+ dbService_.beginStream();
+ dbService_.updateStream(testUpdate);
+ dbService_.finishStream();
+ dbService_.finishUpdate();
+ } catch(ex) {
+ // beginUpdate will throw harmlessly if there's an existing update
+ // in progress, ignore failures.
+ }
G_Debug(this, "malwareWarden initialized");
}
PROT_MalwareWarden.inherits(PROT_ListWarden);
/**
* Cleanup on shutdown.
*/
--- a/browser/components/search/content/search.xml
+++ b/browser/components/search/content/search.xml
@@ -21,16 +21,17 @@
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Pierre Chanial (v2) <[email protected]>
# Gavin Sharp (v3) <[email protected]>
# Ben Goodger <[email protected]>
# Pamela Greene <[email protected]>
# Michael Ventnor <[email protected]>
+# Ehsan Akhgari <[email protected]>
#
# Alternatively, the contents of this file may be used under the terms of
# either the GNU General Public License Version 2 or later (the "GPL"), or
# the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
# in which case the provisions of the GPL or the LGPL are applicable instead
# of those above. If you wish to allow use of your version of this file only
# under the terms of either the GPL or the LGPL, and not to allow others to
# use your version of this file under the terms of the MPL, indicate your
@@ -86,18 +87,17 @@
<xul:image class="searchbar-dropmarker-image"/>
<xul:menupopup class="searchbar-popup"
anonid="searchbar-popup"
position="after_start">
<xul:menuseparator/>
<xul:menuitem class="open-engine-manager"
anonid="open-engine-manager"
label="&cmd_engineManager.label;"
- oncommand="openManager(event);"
- accesskey="&cmd_engineManager.accesskey;"/>
+ oncommand="openManager(event);"/>
</xul:menupopup>
</xul:button>
<xul:hbox class="search-go-container">
<xul:image class="search-go-button"
anonid="search-go-button"
chromedir="&locale.dir;"
onclick="handleSearchCommand(event);"
tooltiptext="&searchEndCap.label;" />
@@ -547,17 +547,21 @@
this.focus();
this.select();
]]></handler>
<handler event="popupshowing" action="this.rebuildPopupDynamic();"/>
<handler event="DOMMouseScroll"
phase="capturing"
- action="this.selectEngine(event, (event.detail > 0));"/>
+#ifdef XP_MACOSX
+ action="if (event.metaKey) this.selectEngine(event, (event.detail > 0));"/>
+#else
+ action="if (event.ctrlKey) this.selectEngine(event, (event.detail > 0));"/>
+#endif
</handlers>
</binding>
<binding id="searchbar-textbox"
extends="chrome://global/content/bindings/autocomplete.xml#autocomplete">
<implementation implements="nsIObserver nsIDOMXULLabeledControlElement">
<constructor><![CDATA[
if (document.getBindingParent(this).parentNode.parentNode.localName ==
--- a/browser/components/search/nsSearchSuggestions.js
+++ b/browser/components/search/nsSearchSuggestions.js
@@ -422,17 +422,17 @@ SuggestAutoComplete.prototype = {
_startHistorySearch: function SAC_SHSearch(searchString, searchParam, previousResult) {
var formHistory =
Cc["@mozilla.org/autocomplete/search;1?name=form-history"].
createInstance(Ci.nsIAutoCompleteSearch);
formHistory.startSearch(searchString, searchParam, previousResult, this);
},
/**
- * Makes a note of the fact that we've recieved a backoff-triggering
+ * Makes a note of the fact that we've received a backoff-triggering
* response, so that we can adjust the backoff behavior appropriately.
*/
_noteServerError: function SAC__noteServeError() {
var currentTime = Date.now();
this._serverErrorLog.push(currentTime);
if (this._serverErrorLog.length > this._maxErrorsBeforeBackoff)
this._serverErrorLog.shift();
--- a/browser/components/sessionstore/src/nsSessionStore.js
+++ b/browser/components/sessionstore/src/nsSessionStore.js
@@ -860,18 +860,16 @@ SessionStoreService.prototype = {
browser.parentNode.__SS_data = tabData;
}
else {
tabData.entries[0] = { url: browser.currentURI.spec };
tabData.index = 1;
}
- tabData.zoom = browser.markupDocumentViewer.textZoom;
-
var disallow = [];
for (var i = 0; i < CAPABILITIES.length; i++)
if (!browser.docShell["allow" + CAPABILITIES[i]])
disallow.push(CAPABILITIES[i]);
if (disallow.length > 0)
tabData.disallow = disallow.join(",");
else if (tabData.disallow)
delete tabData.disallow;
@@ -1497,18 +1495,16 @@ SessionStoreService.prototype = {
if (!tabData.entries) {
tabData.entries = [];
}
if (tabData.extData) {
tab.__SS_extdata = tabData.extData;
}
- browser.markupDocumentViewer.textZoom = parseFloat(tabData.zoom || 1);
-
for (var i = 0; i < tabData.entries.length; i++) {
history.addEntry(this._deserializeHistoryEntry(tabData.entries[i], aIdMap), true);
}
// make sure to reset the capabilities and attributes, in case this tab gets reused
var disallow = (tabData.disallow)?tabData.disallow.split(","):[];
CAPABILITIES.forEach(function(aCapability) {
browser.docShell["allow" + aCapability] = disallow.indexOf(aCapability) == -1;
--- a/browser/fuel/src/fuelApplication.js
+++ b/browser/fuel/src/fuelApplication.js
@@ -1152,18 +1152,16 @@ function Application() {
this._info = Components.classes["@mozilla.org/xre/app-info;1"]
.getService(Ci.nsIXULAppInfo);
var os = Components.classes["@mozilla.org/observer-service;1"]
.getService(Ci.nsIObserverService);
os.addObserver(this, "final-ui-startup", false);
os.addObserver(this, "quit-application-requested", false);
- os.addObserver(this, "quit-application-granted", false);
- os.addObserver(this, "quit-application", false);
os.addObserver(this, "xpcom-shutdown", false);
}
//=================================================
// Application implementation
Application.prototype = {
// for nsIClassInfo + XPCOMUtils
classDescription: "Application",
@@ -1216,21 +1214,17 @@ Application.prototype = {
gShutdown.shift()();
}
// release our observers
var os = Components.classes["@mozilla.org/observer-service;1"]
.getService(Ci.nsIObserverService);
os.removeObserver(this, "final-ui-startup");
-
os.removeObserver(this, "quit-application-requested");
- os.removeObserver(this, "quit-application-granted");
- os.removeObserver(this, "quit-application");
-
os.removeObserver(this, "xpcom-shutdown");
this._info = null;
this._console = null;
this._prefs = null;
this._storage = null;
this._events = null;
this._extensions = null;
--- a/browser/installer/removed-files.in
+++ b/browser/installer/removed-files.in
@@ -34,16 +34,17 @@ searchplugins/eBay.src
searchplugins/eBay.gif
searchplugins/google.src
searchplugins/google.gif
searchplugins/yahoo.src
searchplugins/yahoo.gif
searchplugins/
#ifdef MOZ_ENABLE_LIBXUL
@DLL_PREFIX@xpcom_core@DLL_SUFFIX@
+@DLL_PREFIX@xpistub@DLL_SUFFIX@
components/@DLL_PREFIX@jar50@DLL_SUFFIX@
#ifdef XP_WIN
components/jsd3250.dll
components/xpinstal.dll
#else
components/@DLL_PREFIX@jsd@DLL_SUFFIX@
components/@DLL_PREFIX@xpinstall@DLL_SUFFIX@
#endif
@@ -54,17 +55,16 @@ XUL
#else
@DLL_PREFIX@xul@DLL_SUFFIX@
#endif
#endif
component.reg
components/compreg.dat
components/@DLL_PREFIX@myspell@DLL_SUFFIX@
components/@DLL_PREFIX@spellchecker@DLL_SUFFIX@
-components/spellchecker.xpt
components/@DLL_PREFIX@spellchk@DLL_SUFFIX@
components/xpti.dat
components/xptitemp.dat
components/nsBackgroundUpdateService.js
components/nsCloseAllWindows.js
#ifndef XP_MACOSX
components/autocomplete.xpt
#endif
@@ -85,16 +85,17 @@ components/talkback/talkback
components/talkback/talkback.so
components/talkback/XTalkback.ad
extensions/[email protected]/install.rdf
extensions/[email protected]/chrome.manifest
extensions/[email protected]/chrome/reporter.jar
extensions/[email protected]/defaults/preferences/reporter.js
extensions/[email protected]/components/inspector.xpt
extensions/[email protected]/components/@DLL_PREFIX@inspector@DLL_SUFFIX@
+extensions/[email protected]/chrome/icons/default/winInspectorMain.ico
uninstall/UninstallFirefox.exe
uninstall/UninstallDeerPark.exe
uninstall/uninst.exe
uninstall/uninstall.exe
components/myspell/en-US.dic
components/myspell/en-US.aff
searchplugins/DRAE.src
searchplugins/DRAE.png
@@ -517,18 +518,18 @@ extensions/[email protected]/componen
extensions/[email protected]/components/talkback/Talkback.app/Contents/Resources/KeyInfoSections.plist
extensions/[email protected]/components/talkback/Talkback.app/Contents/Resources/send.tiff
extensions/[email protected]/components/talkback/Talkback.app/Contents/Resources/sort_ascending.tiff
extensions/[email protected]/components/talkback/Talkback.app/Contents/Resources/sort_descending.tiff
extensions/[email protected]/components/talkback/Talkback.app/Contents/Resources/Talkback.icns
#else
extensions/[email protected]/components/talkback/talkback
extensions/[email protected]/components/talkback/XTalkback.ad
-extensions/[email protected]/components/master.ini
-extensions/[email protected]/components/talkback.so
+extensions/[email protected]/components/talkback/master.ini
+extensions/[email protected]/components/talkback/talkback.so
#endif
#endif
components/airbag.xpt
components/nsUrlClassifierTable.js
res/html/gopher-audio.gif
res/html/gopher-binary.gif
res/html/gopher-find.gif
res/html/gopher-image.gif
@@ -541,9 +542,40 @@ res/html/gopher-unknown.gif
res/fonts/mathfontCMEX10.properties
res/fonts/mathfontCMSY10.properties
res/fonts/mathfontMath1.properties
res/fonts/mathfontMath2.properties
res/fonts/mathfontMath4.properties
res/fonts/mathfontMTExtra.properties
res/fonts/mathfontPUA.properties
res/fonts/mathfontSymbol.properties
-
+res/fonts/fontEncoding.properties
+res/fonts/pangoFontEncoding.properties
+res/fonts/fontNameMap.properties
+@DLL_PREFIX@xpcom_compat@DLL_SUFFIX@
+components/nsDictionary.js
+components/nsXmlRpcClient.js
+components/nsInterfaceInfoToIDL.js
+chrome/chromelist.txt
+#ifdef XP_MACOSX
+LICENSE
+extensions/[email protected]/chrome/chromelist.txt
+components/accessibility.xpt
+components/gksvgrenderer.xpt
+components/jsconsole.xpt
+components/necko_data.xpt
+components/nsKillAll.js
+components/passwordmgr.xpt
+components/progressDlg.xpt
+components/search.xpt
+components/websrvcs.xpt
+components/widget_mac.xpt
+components/xml-rpc.xpt
+components/xpcom_obsolete.xpt
+init.d/README
+redo-prebinding.sh
+res/viewer.properties
+#endif
+#ifdef XP_UNIX
+readme.txt
+#endif
+dictionaries/PL.dic
+dictionaries/PL.aff
--- a/browser/installer/unix/config.it
+++ b/browser/installer/unix/config.it
@@ -755,16 +755,23 @@ Do Not Uninstall=FALSE
[Copy File8]
Timing=post smartupdate
Source=[$GRE_INSTALL_DIR]\freebl3.chk
Destination=[SETUP PATH]
Fail If Exists=FALSE
Do Not Uninstall=FALSE
+[Copy File9]
+Timing=post smartupdate
+Source=[$GRE_INSTALL_DIR]\nssutil3.dll
+Destination=[SETUP PATH]
+Fail If Exists=FALSE
+Do Not Uninstall=FALSE
+
[Path Lookup $GRE_INSTALL_DIR]
Path Reg Key Root=HKEY_LOCAL_MACHINE
Path Reg Key=Software\mozilla.org\GRE\$GreUniqueID$\Main
Path Reg Name=Install Directory
Strip Filename=FALSE
;Copy File SequentialX sections
--- a/browser/installer/unix/packages-static
+++ b/browser/installer/unix/packages-static
@@ -49,16 +49,17 @@ bin/application.ini
bin/platform.ini
bin/mozilla-xremote-client
bin/run-mozilla.sh
bin/plugins/libnullplugin.so
bin/res/cmessage.txt
bin/res/effective_tld_names.dat
bin/xpicleanup
bin/libsqlite3.so
+bin/README.txt
; [Components]
bin/components/alerts.xpt
bin/components/accessibility.xpt
bin/components/appshell.xpt
bin/components/appstartup.xpt
bin/components/autocomplete.xpt
bin/components/autoconfig.xpt
@@ -156,16 +157,17 @@ bin/components/pref.xpt
bin/components/progressDlg.xpt
bin/components/proxyObjInst.xpt
bin/components/toolkitremote.xpt
bin/components/rdf.xpt
bin/components/satchel.xpt
bin/components/saxparser.xpt
bin/components/search.xpt
bin/components/shistory.xpt
+bin/components/spellchecker.xpt
bin/components/storage.xpt
bin/components/profile.xpt
bin/components/toolkitprofile.xpt
bin/components/txtsvc.xpt
bin/components/txmgr.xpt
bin/components/uconv.xpt
bin/components/unicharutil.xpt
bin/components/uriloader.xpt
@@ -266,17 +268,17 @@ bin/chrome/browser.jar
bin/chrome/browser.manifest
bin/chrome/classic.jar
bin/chrome/classic.manifest
bin/extensions/{972ce4c6-7e08-4474-a285-3208198ce6fd}/install.rdf
bin/chrome/comm.jar
bin/chrome/comm.manifest
bin/chrome/toolkit.jar
bin/chrome/toolkit.manifest
-bin/chrome/icons/default/default.xpm
+bin/chrome/icons/default/default16.png
bin/chrome/reporter.manifest
bin/chrome/reporter.jar
bin/@PREF_DIR@/reporter.js
; shell icons
bin/icons/*.xpm
bin/icons/*.png
@@ -343,16 +345,17 @@ bin/components/dom_svg.xpt
; [Personal Security Manager]
;
bin/libnssckbi.so
bin/components/pipboot.xpt
bin/components/pipnss.xpt
bin/components/pippki.xpt
bin/libnss3.so
+bin/libnssutil3.so
bin/libsmime3.so
bin/libsoftokn3.chk
bin/libsoftokn3.so
bin/libfreebl3.chk
bin/libfreebl3.so
bin/libssl3.so
bin/libnssdbm3.so
bin/chrome/pipnss.jar
@@ -370,16 +373,18 @@ bin/libfreebl_32int64_3.so
; [Updater]
;
bin/updater
; [Crash Reporter]
;
bin/crashreporter
bin/crashreporter.ini
+bin/crashreporter-override.ini
+bin/Throbber-small.gif
; [Extensions]
;
bin/components/libnkgnomevfs.so
bin/components/libauth.so
; [Additional Developer Tools]
[adt]
--- a/browser/installer/windows/packages-static
+++ b/browser/installer/windows/packages-static
@@ -177,16 +177,17 @@ bin\components\unicharutil.xpt
bin\components\uriloader.xpt
bin\components\webBrowser_core.xpt
bin\components\webbrowserpersist.xpt
bin\components\webshell_idls.xpt
bin\components\widget.xpt
bin\components\windowds.xpt
bin\components\windowwatcher.xpt
bin\components\shellservice.xpt
+bin\components\spellchecker.xpt
bin\components\xpcom_base.xpt
bin\components\xpcom_system.xpt
bin\components\xpcom_components.xpt
bin\components\xpcom_ds.xpt
bin\components\xpcom_io.xpt
bin\components\xpcom_thread.xpt
bin\components\xpcom_xpti.xpt
bin\components\xpconnect.xpt
@@ -326,16 +327,17 @@ bin\res\svg.css
bin\components\dom_svg.xpt
; [Personal Security Manager]
;
bin\nssckbi.dll
bin\components\pipboot.xpt
bin\components\pipnss.xpt
bin\components\pippki.xpt
+bin\nssutil3.dll
bin\nss3.dll
bin\smime3.dll
bin\softokn3.chk
bin\softokn3.dll
bin\freebl3.chk
bin\freebl3.dll
bin\ssl3.dll
bin\nssdbm3.dll
@@ -344,16 +346,17 @@ bin\chrome\pippki.manifest
; [Updater]
;
bin\updater.exe
; [Crash Reporter]
bin\crashreporter.exe
bin\crashreporter.ini
+bin\crashreporter-override.ini
; [Additional Developer Tools]
[adt]
bin\extensions\[email protected]\install.rdf
bin\extensions\[email protected]\components\inspector-cmdline.js
bin\extensions\[email protected]\chrome.manifest
bin\extensions\[email protected]\chrome\inspector.jar
bin\extensions\[email protected]\defaults\preferences\inspector.js
--- a/browser/locales/Makefile.in
+++ b/browser/locales/Makefile.in
@@ -310,8 +310,13 @@ ifeq ($(OS_ARCH),WINNT)
else
ifneq (,$(filter mac cocoa,$(MOZ_WIDGET_TOOLKIT)))
$(SYSINSTALL) $(IFLAGS1) $^ $(FINAL_TARGET)/updater.app/Contents/MacOS
else
$(SYSINSTALL) $(IFLAGS1) $^ $(FINAL_TARGET)
endif
endif
endif
+
+ifdef MOZ_CRASHREPORTER
+libs:: $(addprefix $(LOCALE_SRCDIR)/,crashreporter/crashreporter-override.ini)
+ $(SYSINSTALL) $(IFLAGS1) $^ $(FINAL_TARGET)
+endif
--- a/browser/locales/en-US/chrome/browser/aboutDialog.dtd
+++ b/browser/locales/en-US/chrome/browser/aboutDialog.dtd
@@ -1,10 +1,9 @@
<!ENTITY aboutDialog.title "About &brandFullName;">
<!ENTITY copyright "Credits">
<!ENTITY copyright.accesskey "C">
<!ENTITY aboutLink "< About &brandFullName;">
<!ENTITY aboutLink.accesskey "A">
<!ENTITY aboutVersion "version">
-<!ENTITY copyrightText "©1998-2008 Contributors. All Rights Reserved. Firefox and the
+<!ENTITY copyrightInfo "©1998-2008 Contributors. All Rights Reserved. Firefox and the
Firefox logos are trademarks of the Mozilla Foundation. All rights
- reserved. Some trademark rights used under license from The
- Charlton Company.">
+ reserved.">
--- a/browser/locales/en-US/chrome/browser/browser.dtd
+++ b/browser/locales/en-US/chrome/browser/browser.dtd
@@ -44,16 +44,20 @@
<!ENTITY pageInfoCmd.accesskey "I">
<!ENTITY pageInfoCmd.commandkey "i">
<!ENTITY fullScreenCmd.label "Full Screen">
<!ENTITY fullScreenCmd.accesskey "F">
<!ENTITY fullScreenMinimize.tooltip "Minimize">
<!ENTITY fullScreenRestore.tooltip "Restore">
<!ENTITY fullScreenClose.tooltip "Close">
+<!ENTITY fullScreenAutohide.label "Hide Toolbars">
+<!ENTITY fullScreenAutohide.accesskey "H">
+<!ENTITY fullScreenExit.label "Exit Full Screen Mode">
+<!ENTITY fullScreenExit.accesskey "F">
<!ENTITY closeWindow.label "Close Window">
<!ENTITY closeWindow.accesskey "d">
<!ENTITY bookmarksMenu.label "Bookmarks">
<!ENTITY bookmarksMenu.accesskey "B">
<!ENTITY bookmarkThisPageCmd.label "Bookmark This Page">
<!ENTITY bookmarkThisPageCmd.commandkey "d">
@@ -222,28 +226,30 @@
<!ENTITY viewPageSourceCmd.label "View Page Source">
<!ENTITY viewPageSourceCmd.accesskey "V">
<!ENTITY viewFrameSourceCmd.label "View Frame Source">
<!ENTITY viewFrameSourceCmd.accesskey "V">
<!ENTITY viewPageInfoCmd.label "View Page Info">
<!ENTITY viewPageInfoCmd.accesskey "I">
<!ENTITY viewFrameInfoCmd.label "View Frame Info">
<!ENTITY viewFrameInfoCmd.accesskey "I">
+<!ENTITY showImageCmd.label "Show Image">
+<!ENTITY showImageCmd.accesskey "S">
<!ENTITY viewImageCmd.label "View Image">
<!ENTITY viewImageCmd.accesskey "I">
<!ENTITY viewBGImageCmd.label "View Background Image">
<!ENTITY viewBGImageCmd.accesskey "w">
<!ENTITY setDesktopBackgroundCmd.label "Set As Desktop Background…">
<!ENTITY setDesktopBackgroundCmd.accesskey "S">
-<!ENTITY bookmarkPageCmd.label "Bookmark This Page…">
-<!ENTITY bookmarkPageCmd.accesskey "m">
-<!ENTITY bookmarkLinkCmd.label "Bookmark This Link…">
-<!ENTITY bookmarkLinkCmd.accesskey "L">
-<!ENTITY bookmarkFrameCmd.label "Bookmark This Frame…">
-<!ENTITY bookmarkFrameCmd.accesskey "m">
+<!ENTITY bookmarkPageCmd2.label "Bookmark This Page">
+<!ENTITY bookmarkPageCmd2.accesskey "m">
+<!ENTITY bookmarkThisLinkCmd.label "Bookmark This Link">
+<!ENTITY bookmarkThisLinkCmd.accesskey "L">
+<!ENTITY bookmarkThisFrameCmd.label "Bookmark This Frame">
+<!ENTITY bookmarkThisFrameCmd.accesskey "m">
<!ENTITY sendPageCmd.label "Send Link…">
<!ENTITY sendPageCmd.accesskey "e">
<!ENTITY savePageCmd.label "Save Page As…">
<!ENTITY savePageCmd.accesskey "A">
<!-- alternate for content area context menu -->
<!ENTITY savePageCmd.accesskey2 "P">
<!ENTITY savePageCmd.commandkey "s">
<!ENTITY saveFrameCmd.label "Save Frame As…">
@@ -255,16 +261,18 @@
<!ENTITY sendLinkCmd.label "Send Link…">
<!ENTITY sendLinkCmd.accesskey "d">
<!ENTITY saveImageCmd.label "Save Image As…">
<!ENTITY saveImageCmd.accesskey "v">
<!ENTITY sendImageCmd.label "Send Image…">
<!ENTITY sendImageCmd.accesskey "n">
<!ENTITY copyLinkCmd.label "Copy Link Location">
<!ENTITY copyLinkCmd.accesskey "a">
+<!ENTITY copyLinkTextCmd.label "Copy Link Text">
+<!ENTITY copyLinkTextCmd.accesskey "x">
<!ENTITY copyImageCmd.label "Copy Image Location">
<!ENTITY copyImageCmd.accesskey "o">
<!ENTITY copyImageContentsCmd.label "Copy Image">
<!ENTITY copyImageContentsCmd.accesskey "y">
<!ENTITY blockImageCmd.accesskey "B">
<!ENTITY metadataCmd.label "Properties">
<!ENTITY metadataCmd.accesskey "P">
<!ENTITY copyEmailCmd.label "Copy Email Address">
@@ -278,16 +286,18 @@
<!ENTITY fullZoomEnlargeCmd.commandkey2 "="> <!-- + is above this key on many keyboards -->
<!ENTITY fullZoomReduceCmd.label "Zoom Out">
<!ENTITY fullZoomReduceCmd.accesskey "O">
<!ENTITY fullZoomReduceCmd.commandkey "-">
<!ENTITY fullZoomResetCmd.commandkey "0">
<!ENTITY fullZoomResetCmd.label "Reset">
<!ENTITY fullZoomResetCmd.accesskey "R">
+<!ENTITY fullZoomToggleCmd.label "Zoom Text Only">
+<!ENTITY fullZoomToggleCmd.accesskey "T">
<!ENTITY fullZoom.label "Zoom">
<!ENTITY fullZoom.accesskey "Z">
<!ENTITY newTabButton.tooltip "Open a new tab">
<!ENTITY newWindowButton.tooltip "Open a new window">
<!ENTITY sidebarCloseButton.tooltip "Close sidebar">
<!ENTITY cutButton.tooltip "Cut">
@@ -334,15 +344,17 @@
<!ENTITY findOnCmd.label "Find in This Page…">
<!ENTITY findOnCmd.accesskey "F">
<!ENTITY findOnCmd.commandkey "f">
<!ENTITY findAgainCmd.label "Find Again">
<!ENTITY findAgainCmd.accesskey "g">
<!ENTITY findAgainCmd.commandkey "g">
<!ENTITY findAgainCmd.commandkey2 "VK_F3">
-<!ENTITY spellAddDictionaries.label "Add dictionaries…">
+<!ENTITY spellAddDictionaries.label "Add Dictionaries…">
<!ENTITY spellAddDictionaries.accesskey "A">
<!ENTITY editBookmark.done.label "Done">
<!ENTITY editBookmark.delete.label "Delete">
<!ENTITY identity.moreInfoLinkText "Tell me more about this web site…">
+
+<!ENTITY downloadMonitor.tooltip "Double-click to open downloads window">
--- a/browser/locales/en-US/chrome/browser/browser.properties
+++ b/browser/locales/en-US/chrome/browser/browser.properties
@@ -76,34 +76,52 @@ updatesItem_pendingFallback=Apply Downloaded Update Now…
feedNoFeeds=Page has no feeds
feedShowFeedNew=Subscribe to '%S'…
feedHasFeedsNew=Subscribe to this page…
# History menu
menuOpenAllInTabs.label=Open All in Tabs
menuOpenAllInTabs.accesskey=o
+# Unified Back-/Forward Popup
+tabHistory.current=Stay on this page
+tabHistory.goBack=Go back to this page
+tabHistory.goForward=Go forward to this page
+
# Block autorefresh
refreshBlocked.goButton=Allow
refreshBlocked.goButton.accesskey=A
refreshBlocked.refreshLabel=%S prevented this page from automatically reloading.
refreshBlocked.redirectLabel=%S prevented this page from automatically redirecting to another page.
# Star button
starButtonOn.tooltip=Edit this bookmark
starButtonOff.tooltip=Bookmark this page
+# Offline web applications
+offlineApps.available=This website (%S) is offering to store data on your computer for offline use.
+offlineApps.allow=Allow
+offlineApps.allowAccessKey=A
+
# Identity information
identity.domainverified.title=Location Verified
identity.domainverified.body=You are currently visiting:
identity.domainverified.supplemental=Information identifying the owner of this web site may not have been validated.
identity.identified.title=Identity Verified
identity.identified.body=This web site is owned by:
identity.identified.verifier=Verified by: %S
identity.identified.state_and_country=%S, %S
identity.identified.title_with_country=%S (%S)
identity.unknown.title=Identity Unknown
identity.unknown.body=This web site does not supply identity information.
identity.encrypted=Your connection to this web site is encrypted to prevent eavesdropping.
identity.unencrypted=Your connection to this web site is not encrypted.
+
+# Downloads Monitor Panel
+# LOCALIZATION NOTE (activeDownloads, pausedDownloads): Semi-colon list of plural
+# forms. See: http://developer.mozilla.org/en/docs/Localization_and_Plurals
+# #1 number of downloads; #2 time left
+# examples: One active download (2 minutes remaining); 11 paused downloads
+activeDownloads=One active download (#2);#1 active downloads (#2)
+pausedDownloads=One paused download;#1 paused downloads
--- a/browser/locales/en-US/chrome/browser/credits.dtd
+++ b/browser/locales/en-US/chrome/browser/credits.dtd
@@ -11,9 +11,9 @@
<!-- localization credits look like this: -->
<!--
<!ENTITY credit.translation
"<h3>Translators</h3><ul><li>Name Here</li></ul>">
-->
<!ENTITY credit.translation "">
<!ENTITY credit.memory "In Fond Memory Of">
-<!ENTITY credit.poweredByGecko "Powered by Gecko™">
+<!ENTITY credit.poweredByGeckoReg "Powered by Gecko®">
--- a/browser/locales/en-US/chrome/browser/feeds/subscribe.properties
+++ b/browser/locales/en-US/chrome/browser/feeds/subscribe.properties
@@ -3,15 +3,46 @@ addHandler=Add "%S" (%S) as a Feed Reade
addHandlerAddButton=Add Feed Reader
addHandlerAddButtonAccesskey=A
handlerRegistered="%S" is already registered as a Feed Reader
liveBookmarks=Live Bookmarks
subscribeNow=Subscribe Now
chooseApplicationMenuItem=Choose Application…
chooseApplicationDialogTitle=Choose Application
alwaysUse=Always use %S to subscribe to feeds
+mediaLabel=Media files
+
+# LOCALIZATION NOTE: The next string is for the size of the enclosed media.
+# e.g. enclosureSizeText : "50.23 MB"
+# %1$S = size (in bytes or megabytes, ...)
+# %2$S = unit of measure (bytes, KB, MB, ...)
+enclosureSizeText=%1$S %2$S
+
+bytes=bytes
+kilobyte=KB
+megabyte=MB
+gigabyte=GB
+
+# LOCALIZATION NOTE: The next three strings explains to the user what they're
+# doing.
+# e.g. alwaysUseForVideoPodcasts : "Always use Miro to subscribe to video podcasts."
+# %S = application to use (Miro, iTunes, ...)
+alwaysUseForFeeds=Always use %S to subscribe to feeds.
+alwaysUseForPodcasts=Always use %S to subscribe to podcasts.
+alwaysUseForVideoPodcasts=Always use %S to subscribe to video podcasts.
+
+subscribeFeedUsing=Subscribe to this feed using
+subscribePodcastUsing=Subscribe to this podcast using
+subscribeVideoPodcastUsing=Subscribe to this video podcast using
+
+# "This is a "xyz" of frequently changing content on this site."
+feedsubscription1=This is a "%S" of frequently changing content on this site.
+feedsubscription2=You can subscribe to this %S to receive updates when this content changes.
+webFeed=feed
+videoPodcastFeed=video podcast
+audioPodcastFeed=podcast
# Protocol Handling
# "Add %appName (%appDomain) as an application for %protocolType links?"
addProtocolHandler=Add %S (%S) as an application for %S links?
addProtocolHandlerAddButton=Add Application
# "%appName has already been added as an application for %protocolType links."
protocolHandlerRegistered=%S has already been added as an application for %S links.
--- a/browser/locales/en-US/chrome/browser/pageInfo.dtd
+++ b/browser/locales/en-US/chrome/browser/pageInfo.dtd
@@ -60,26 +60,24 @@
<!ENTITY generalEncoding "Encoding:">
<!ENTITY generalMetaName "Name">
<!ENTITY generalMetaContent "Content">
<!ENTITY generalSecurityMore "More">
<!ENTITY generalSecurityMore.accesskey "o">
<!ENTITY mediaTab "Media">
<!ENTITY mediaTab.accesskey "M">
-<!ENTITY mediaURL "Address:">
-<!ENTITY mediaAlt "Alternate Text:">
+<!ENTITY mediaLocation "Location:">
+<!ENTITY mediaText "Associated Text:">
<!ENTITY mediaAltHeader "Alternate Text">
<!ENTITY mediaAddress "Address">
<!ENTITY mediaType "Type">
<!ENTITY mediaSize "Size">
<!ENTITY mediaCount "Count">
-<!ENTITY mediaDimensions "Specified Dimensions:">
-<!ENTITY mediaPhysDimensions "Actual Dimensions:">
-<!ENTITY mediaTitle "Title:">
+<!ENTITY mediaDimension "Dimensions:">
<!ENTITY mediaLongdesc "Long Description:">
<!ENTITY mediaBlockImage.accesskey "B">
<!ENTITY mediaSaveAs "Save As…">
<!ENTITY mediaSaveAs.accesskey "A">
<!ENTITY mediaSaveAs2.accesskey "e">
<!ENTITY mediaPreview "Media Preview:">
<!ENTITY feedTab "Feeds">
--- a/browser/locales/en-US/chrome/browser/pageInfo.properties
+++ b/browser/locales/en-US/chrome/browser/pageInfo.properties
@@ -52,16 +52,21 @@ mediaBGImg=Background
mediaObject=Object
mediaEmbed=Embed
mediaLink=Icon
mediaInput=Input
mediaFileSize=%S KB
mediaSize=%Spx \u00D7 %Spx
mediaSelectFolder=Select a Folder to Save the Images
mediaBlockImage=Block Images from %S
+mediaUnknownNotCached=Unknown (not cached)
+mediaImageType=%S Image
+mediaAnimatedImageType=%S Image (animated, %S frames)
+mediaDimensions=%Spx \u00D7 %Spx
+mediaDimensionsScaled=%Spx \u00D7 %Spx (scaled to %Spx \u00D7 %Spx)
generalQuirksMode=Quirks mode
generalStrictMode=Standards compliance mode
generalNotCached=Not cached
generalDiskCache=Disk cache
generalMemoryCache=Memory cache
generalSize=%S KB (%S bytes)
generalMetaTag=Meta (1 tag)
--- a/browser/locales/en-US/chrome/browser/places/places.properties
+++ b/browser/locales/en-US/chrome/browser/places/places.properties
@@ -65,17 +65,17 @@ view.sortBy.date.label=Sort by Visit Dat
view.sortBy.date.accesskey=V
view.sortBy.visitCount.label=Sort by Visit Count
view.sortBy.visitCount.accesskey=C
view.sortBy.keyword.label=Sort by Keyword
view.sortBy.keyword.accesskey=K
view.sortBy.description.label=Sort by Description
view.sortBy.description.accesskey=D
view.sortBy.dateAdded.label=Sort by Added
-view.sortBy.dateAdded.accesskey=A
+view.sortBy.dateAdded.accesskey=e
view.sortBy.lastModified.label=Sort by Last Modified
view.sortBy.lastModified.accesskey=M
view.sortBy.tags.label=Sort by Tags
view.sortBy.tags.accesskey=T
searchByDefault=Search in Bookmarks
searchCurrentDefault=Search in '%S'
findInPrefix=Find in '%S'…
--- a/browser/locales/en-US/chrome/browser/preferences/advanced.dtd
+++ b/browser/locales/en-US/chrome/browser/preferences/advanced.dtd
@@ -29,17 +29,17 @@
<!ENTITY networkTab.label "Network">
<!ENTITY connection.label "Connection">
<!ENTITY connectionDesc.label "Configure how &brandShortName; connects to the Internet">
<!ENTITY connectionSettings.label "Settings…">
<!ENTITY connectionSettings.accesskey "e">
-<!ENTITY cache.label "Cache">
+<!ENTITY offlineStorage.label "Offline Storage">
<!-- LOCALIZATION NOTE:
The entities useCacheBefore.label and useCacheAfter.label appear on a single
line in preferences as follows:
&useCacheBefore.label [ textbox for cache size in MB ] &useCacheAfter.label;
-->
<!ENTITY useCacheBefore.label "Use up to">
@@ -62,26 +62,31 @@
<!ENTITY askMe.accesskey "k">
<!ENTITY modeAutomatic.label "Automatically download and install the update">
<!ENTITY modeAutomatic.accesskey "d">
<!ENTITY modeAutoAddonWarn.label "Warn me if this will disable any of my add-ons">
<!ENTITY modeAutoAddonWarn.accesskey "W">
<!ENTITY updateHistory.label "Show Update History">
<!ENTITY updateHistory.accesskey "p">
+<!ENTITY offlineAppsList.label "The following websites have data installed for offline use:">
+<!ENTITY offlineAppsList.height "7em">
+<!ENTITY offlineAppsListRemove.label "Remove…">
+<!ENTITY offlineAppsListRemove.accesskey "R">
+<!ENTITY offlineAppRemove.confirm "Remove offline data">
<!ENTITY encryptionTab.label "Encryption">
<!ENTITY protocols.label "Protocols">
<!ENTITY useSSL3.label "Use SSL 3.0">
<!ENTITY useSSL3.accesskey "3">
<!ENTITY useTLS1.label "Use TLS 1.0">
<!ENTITY useTLS1.accesskey "1">
<!ENTITY certificates.label "Certificates">
-<!ENTITY certselect.description "When a web site requires a certificate:">
+<!ENTITY certSelection.description "When a server requests my personal certificate:">
<!ENTITY certs.auto "Select one automatically">
<!ENTITY certs.auto.accesskey "l">
<!ENTITY certs.ask "Ask me every time">
<!ENTITY certs.ask.accesskey "i">
<!ENTITY viewCerts.label "View Certificates">
<!ENTITY viewCerts.accesskey "s">
<!ENTITY viewCRLs.label "Revocation Lists">
<!ENTITY viewCRLs.accesskey "R">
--- a/browser/locales/en-US/chrome/browser/preferences/connection.dtd
+++ b/browser/locales/en-US/chrome/browser/preferences/connection.dtd
@@ -1,16 +1,18 @@
<!ENTITY connectionsDialog.title "Connection Settings">
<!ENTITY window.width "37em">
<!ENTITY window.macWidth "39em">
<!ENTITY proxyTitle.label "Configure Proxies to Access the Internet">
<!ENTITY directTypeRadio.label "Direct connection to the Internet">
<!ENTITY directTypeRadio.accesskey "d">
+<!ENTITY systemTypeRadio.label "Use system proxy settings">
+<!ENTITY systemTypeRadio.accesskey "y">
<!ENTITY WPADTypeRadio.label "Auto-detect proxy settings for this network">
<!ENTITY WPADTypeRadio.accesskey "w">
<!ENTITY manualTypeRadio.label "Manual proxy configuration:">
<!ENTITY manualTypeRadio.accesskey "m">
<!ENTITY autoTypeRadio.label "Automatic proxy configuration URL:">
<!ENTITY autoTypeRadio.accesskey "A">
<!ENTITY reload.label "Reload">
<!ENTITY reload.accesskey "e">
--- a/browser/locales/en-US/chrome/browser/preferences/preferences.properties
+++ b/browser/locales/en-US/chrome/browser/preferences/preferences.properties
@@ -45,16 +45,18 @@ chooseDownloadFolderTitle=Choose Downloa
#### Applications
fileEnding=%S file
saveFile=Save File
chooseApp=Choose application…
fpTitleChooseApp=Select Helper Application
webFeed=Web Feed
+videoPodcastFeed=Video Podcast
+audioPodcastFeed=Podcast
alwaysAsk=Always ask
# LOCALIZATION NOTE (pluginName):
# %1$S = plugin name (for example "QuickTime Plugin-in 7.2")
# %2$S = brandShortName from brand.properties (for example "Minefield")
pluginName=%S (in %S)
# LOCALIZATION NOTE (previewInApp, liveBookmarksInApp): %S = brandShortName
@@ -77,8 +79,13 @@ AtEndOfSession = at end of session
can=Allow
canSession=Allow for Session
cannot=Block
noCookieSelected=<no cookie selected>
cookiesAll=The following cookies are stored on your computer:
cookiesFiltered=The following cookies match your search:
removeCookies=Remove Cookies
removeCookie=Remove Cookie
+
+#### Offline apps
+offlineAppRemoveTitle=Remove offline website data
+offlineAppRemovePrompt=After removing this data, %S will not be available offline. Are you sure you want to remove this offline website?
+offlineAppRemoveConfirm=Remove offline data
--- a/browser/locales/en-US/chrome/browser/sanitize.dtd
+++ b/browser/locales/en-US/chrome/browser/sanitize.dtd
@@ -10,13 +10,15 @@
<!ENTITY itemFormSearchHistory.label "Saved Form and Search History">
<!ENTITY itemFormSearchHistory.accesskey "F">
<!ENTITY itemPasswords.label "Saved Passwords">
<!ENTITY itemPasswords.accesskey "P">
<!ENTITY itemCookies.label "Cookies">
<!ENTITY itemCookies.accesskey "C">
<!ENTITY itemCache.label "Cache">
<!ENTITY itemCache.accesskey "a">
+<!ENTITY itemOfflineApps.label "Offline Website Data">
+<!ENTITY itemOfflineApps.accesskey "O">
<!ENTITY itemDownloads.label "Download History">
<!ENTITY itemDownloads.accesskey "D">
<!ENTITY itemSessions.label "Authenticated Sessions">
<!ENTITY itemSessions.accesskey "S">
<!ENTITY window.width "30em">
--- a/browser/locales/en-US/chrome/browser/searchbar.dtd
+++ b/browser/locales/en-US/chrome/browser/searchbar.dtd
@@ -1,3 +1,2 @@
<!ENTITY cmd_engineManager.label "Manage Search Engines…">
-<!ENTITY cmd_engineManager.accesskey "M">
<!ENTITY searchEndCap.label "Search">
--- a/browser/locales/en-US/chrome/browser/tabbrowser.dtd
+++ b/browser/locales/en-US/chrome/browser/tabbrowser.dtd
@@ -7,12 +7,12 @@
<!ENTITY closeOtherTabs.label "Close Other Tabs">
<!ENTITY reloadAllTabs.label "Reload All Tabs">
<!ENTITY reloadAllTabs.accesskey "A">
<!ENTITY reloadTab.label "Reload Tab">
<!ENTITY reloadTab.accesskey "r">
<!ENTITY listAllTabs.label "List all tabs">
<!ENTITY bookmarkAllTabs.label "Bookmark All Tabs…">
<!ENTITY bookmarkAllTabs.accesskey "T">
-<!ENTITY bookmarkCurTab.label "Bookmark This Tab…">
-<!ENTITY bookmarkCurTab.accesskey "B">
+<!ENTITY bookmarkThisTab.label "Bookmark This Tab">
+<!ENTITY bookmarkThisTab.accesskey "B">
<!ENTITY undoCloseTab.label "Undo Close Tab">
<!ENTITY undoCloseTab.accesskey "U">
new file mode 100644
--- /dev/null
+++ b/browser/locales/en-US/crashreporter/crashreporter-override.ini
@@ -0,0 +1,5 @@
+# This file is in the UTF-8 encoding
+[Strings]
+# LOCALIZATION NOTE (CrashReporterProductErrorText2): The %s is replaced with a string containing detailed information.
+CrashReporterProductErrorText2=Firefox had a problem and crashed. We'll try to restore your tabs and windows when it restarts.\n\nUnfortunately the crash reporter is unable to submit a crash report.\n\nDetails: %s
+CrashReporterDescriptionText2=Firefox had a problem and crashed. We'll try to restore your tabs and windows when it restarts.\n\nTo help us diagnose and fix the problem, you can send us a crash report.
--- a/browser/locales/en-US/searchplugins/list.txt
+++ b/browser/locales/en-US/searchplugins/list.txt
@@ -1,6 +1,7 @@
amazondotcom
answers
creativecommons
eBay
google
+wikipedia
yahoo
new file mode 100644
--- /dev/null
+++ b/browser/locales/en-US/searchplugins/wikipedia.xml
@@ -0,0 +1,15 @@
+<SearchPlugin xmlns="http://www.mozilla.org/2006/browser/search/">
+<ShortName>Wikipedia (English)</ShortName>
+<Description>Wikipedia, the free encyclopedia</Description>
+<InputEncoding>UTF-8</InputEncoding>
+<Image width="16" height="16">data:image/x-icon;base64,AAABAAEAEBAQAAEABAAoAQAAFgAAACgAAAAQAAAAIAAAAAEABAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAEAgQAhIOEAMjHyABIR0gA6ejpAGlqaQCpqKkAKCgoAPz9%2FAAZGBkAmJiYANjZ2ABXWFcAent6ALm6uQA8OjwAiIiIiIiIiIiIiI4oiL6IiIiIgzuIV4iIiIhndo53KIiIiB%2FWvXoYiIiIfEZfWBSIiIEGi%2FfoqoiIgzuL84i9iIjpGIoMiEHoiMkos3FojmiLlUipYliEWIF%2BiDe0GoRa7D6GPbjcu1yIiIiIiIiIiIiIiIiIiIiIiIiIiIiIiIgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA</Image>
+<Url type="application/x-suggestions+json" method="GET" template="http://en.wikipedia.org/w/api.php">
+ <Param name="action" value="opensearch"/>
+ <Param name="search" value="{searchTerms}"/>
+</Url>
+<Url type="text/html" method="GET" template="http://en.wikipedia.org/wiki/Special:Search">
+ <Param name="search" value="{searchTerms}"/>
+ <Param name="sourceid" value="Mozilla-search"/>
+</Url>
+<SearchForm>http://en.wikipedia.org/wiki/Special:Search</SearchForm>
+</SearchPlugin>
index 63868c24ae64d68997644557079d371f9f088892..152e0475a8bde938586cc882d83a75283c4f1935
GIT binary patch
literal 570
zc$@(`0>%A_P)<h;3K|Lk000e1NJLTq000dD000dL1^@s6a_i)L00004b3#c}2nYxW
zd<bNS00009a7bBm000fw000fw0YWI7cmMzZ8FWQhbW?9;ba!ELWdL_~cP?peYja~^
zaAhuUa%Y?FJQ@H10k=s+K~yM_g_6H(6LA=apZn&nN$+y;^4n0sW{nOBL4=APIHlq&
z=-xlTF_V*?3K`Ww5S;uMTr*e@(LpH@HCjRZkv7`on%p;cxtxopmR5b|=i&YEeqN>3
zYVogWn@t6{0^9;#*{-uH{v(_RI_2{6gVjc331|SQe}PW`cMAFZ>1wr>SWGN}0zh;?
zYMadxa64%jm+JNU!jV)ODLs0<9=UvG&Z)oPB+%4U?P{%7jTZ|?MG#Es_xnic;rl)*
z%h;3JX7e&|uTrV#<>O^7iXw)CA)fS*a>B%)5ClHbm;2(~KeMu8q^&GJcD~c?cJbtx
zFbtUyqN*yY8Y3&seeu?wtgqiK6mz<jF&FfdhMa;Bpv5#qOhE{RX&B5UVY|*F;8^e5
z_RY7iH^;-lZctjvQ7mOK%mfKNPC}0pF`LH|0JiIlY}dIKMbUD9Yv<vcjZHb)m0>1p
zVWmy<WE@1ax9QK5+pe>9Zg^uY3}+|5e%gNAdHKQf#*@fQ8N^iOcUK(x5w`1e&kn9%
z4E(A6@!gl_8!z6E-N6V2<zTso$j^XNZL@iy+xhH>nDP|hCm`ml=&;Px?f?J)07*qo
IM6N<$f_D1|4*&oF
index 4fe4569107b86bf197287b624a5feb196ee1af9b..259c8a4f01cd6a929a3440a5b579fef5275ce0ae
GIT binary patch
literal 573
zc$@(}0>b@?P)<h;3K|Lk000e1NJLTq000dD000dL1^@s6a_i)L00004b3#c}2nYxW
zd<bNS00009a7bBm000fw000fw0YWI7cmMzZ8FWQhbW?9;ba!ELWdL_~cP?peYja~^
zaAhuUa%Y?FJQ@H10lG;<K~yM_eUi^=6Hyq&e>3-H@^=t15S7+$TnK_9t^}Les1d7q
z3s<gOD9pn3P-tGDh|;ZZPzu64fl3vTLZ=!dwMlBiZ6-6B%v=|mQib%a&*A(&zGJjn
zEqvR33tR@C0dE}TX-<*p+io7HuRK^;Tw1!c0c`uWTR$}fXn>rsxN+@fzH#^7)oS(J
zrf<7jzU^L_7y3uVLYdpQ>V^99@|{wt^xn7KSHA7mPI`>yx|IW>=EFzk=qN;MzyQn2
zA*7(wX{XyCKgDU9t^uo#@<OAzZb=}%-)NY<?jaftTB9`xDX3IR7$yWkFbRUMBjB<8
zdy^4O#vF|lQ8XqThs5!OD2hmugoVWmoWEGJFtioyetRiroKZZYKkO365unM?6w4M1
z)fz$wzI@(^h66P|*+e)|NDD-+fN7ePD@CNpaj@T?9Cn9^)_N6KbCfqe#>0eCr9eJ!
zA*H1EbCB+Lz9%}<ueH`M9Od<ARL6Kiz?riZe)W`Y@3x~X%Qmw#d+I1}@Bg<*M|s+}
zUDP0?y>}2!lk`J6O`kZ*dpB<p@=uGo5$yc9o=&spj`FtVnP>V9B1pwCXWB}@00000
LNkvXXu0mjf?Z5s_
index 2eb45dea23148624db2dabd2cbaa515865427269..01fb204fd6be02c981df6565e5fc0ef91ffe747c
GIT binary patch
literal 840
zc$@)91GoH%P)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00001b5ch_0Itp)
z=>Px#24YJ`L;(K){{a7>y{D4^000SaNLh0L01ejw01ejxLMWSf00007bV*G`2iO4^
z4<{)JUk?@l00PKKL_t(I%av2zOH*MSe%^E5bI#VBb7!W`k7Q~e&_y4tyyydyOsCQ}
zA`wIoT@`dQ7Q65&1QDydA{B}XL@Y>+a_K)%f}w>&D{5}FRx{6LbLZ^ryj_%n;)Ole
zzvqMJ;YS!_SPvbY?QQ^90JtfomAbA60gMB<?eqHIFW-^10v(<00)RGImM=9nG{@|A
zxrFC=2ZQlF{xcpOdj70LQIrk<H+^2eLDw;F+r4Yg$^F#_tzA#v@n2%oHpU3R49C`D
z8|S-lSsV!rUkV1N8Gx=;2|7C4-LhRCI(_Dx_1e8Ryv1rURTk&LVxq7}JVM_UOn-{0
z_q|7!y1VaW7k@7v;MTZbsjv6M?!K5w$@W~6Ws?a2ke@4IM`<pa_LXDr_G0PQz*NTL
zY5D}<;#vWBo-MEBM?$le6<U#N7VuluVG=kvazqr^B<yrK5DYKa3JVH018}eEfKpmX
zIL^fL6mpIPNzjo<WiS_C0wDlLIK-1_fIy&BZ~`E!1aw^wGQ)711WvZ+2!bSV;0Qq?
zmBGiT0g?U<EQ(Z9)pQuZ?AjH^Bav`zu?+?Di8P$D1&je%!@ztp1IiO5lPS2X@)shJ
z$S(lnt2zjU=Eh%*1zatMTqGP*5RNZG5;&Me9%hL{bbb-ptdVRzT*d`PM_d4US7vN!
zJ=;JjeOgiBGH<QghDJ{_249C+Xn|>J79tE|X=kZ*;Y77l7#<!>&4oiZd|rPKVT`Si
zJ&g@!O;s^F^8rOgMXaW#cD8&=xhRT)Q&qL_x9GQDqhkSAI-S1m^ZI)LfVQ-rJ+@5F
zXc`nHfymdd=|nPlRn^og0B!&T!0f+Y==FL1pI4R>1p271?x<N)H7JULiHWyqRaH+t
zeDL@sHULTp7mdY!I4GsuGP%ERU_)d8pqi!~pPZZ;WXveaWc2g>eFFjf2mSzNk}!GD
SI``%P0000<MNUMnLSTX$(`4xY
index 38d9c590b2cc18ae0c5c6af1826eea41fcca4c36..fd006f4cda7a1412c85677e0cc413107c8fd30b3
GIT binary patch
literal 862
zc$@)V1EKthP)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00004b3#c}2nYxW
zd<bNS00009a7bBm000fw000fw0YWI7cmMzZ8FWQhbW?9;ba!ELWdL_~cP?peYja~^
zaAhuUa%Y?FJQ@H10^3PMK~y-6jgw7CRACf`-|xG>&ei#5939P+8n7I(MT$XDxhXWU
z%)~6Hjb*zQ{SZRXriCO1Eo#xCXcJ^21QlxjR7M1ar4m$>{mke%7YFamIHS(oxpQwD
z4V8%A%~_p?_nh+{Vp$ee)X~{q2H+fkN}lJvhGBdMFbd#S+oj8+_=|{TS?K6&rvNT6
z#@Y_m9S*p1T=@hvFP%=$g~M8)xBsbI)3iGPuC`seoLUXwm+N`2x3smU`k>hH;6uT;
znNLm-3PLQl$(?ClY&v0k_x5$e_{10hTv-j^G8C~SQ^~w{?AVE{mg_HMcP_J6cnfHL
zE<?5>iw43;<?)+e=BfIf?AOo9Z9~HYBYSr5oml};04=q(bw6(Od`wl86i9VDHo;qH
zM~+<r04O#Y*-pEByYK5_O-=1AfU~O|Pym&AZg=jN=?E+HxZq|IT$v(dfnp(Pz@8zX
zC@%}4d7U|!V<Ujd^*bo$c_AMJLTEmL2_IluCZ^_=AaE3Rn*c@P5#)H0Q0n4&URe+L
zoJ=MRQREBbiL?|?EI>C*Ea_=D6cG+ZfKB2c3p8b!re+vMaQz6Qfj}T!S)3E`%|xKZ
zbVTAQC=v%|6W~-tX!8jaFz|uE^uls3)&TAf3_bH4uPUPHv>8*iI5H%P43UE*P)yIo
zF+Cea^Ii`b93Jra{ZnfI+~B})WaQNgO;y!hXBu~t_+l#R55>9gg3fEvMcpZ;xRX^y
zq_^)0rl$NP7!2-v*xmL1XjAj#pCkf6M`wGhEX&vS@2mc~A%BBYlEgw?PX&E`pZ@aY
z^DU~Xk}X?{AxaYZdi$3Q!)Wa8>ggxzeql3!)61tS1uzL<)aUb0#$vIX<>lLDhl4>7
z#T7`y8o<BQe7xy^BuS6T%eTvnF>oBk;NVb*{#Q4E?yjExWHNbVY-~IcjYcs$8!`!@
o>VG>}<)m5=`1^!VRoC_U-_24j#;&EI-~a#s07*qoM6N<$g1e)I`Tzg`
index 718b2287e9aba22863fc2205fefdb80b426172bc..2434023cee756ee0c817db38b2e59c3f09b98ca7
GIT binary patch
literal 856
zc$@)P1E>6nP)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00004b3#c}2nYxW
zd<bNS00009a7bBm000fw000fw0YWI7cmMzZ8FWQhbW?9;ba!ELWdL_~cP?peYja~^
zaAhuUa%Y?FJQ@H10@X=GK~y-6g_BEYTxAr;f8TfS%_N<N5}YQnnYO02N!yh>9}qDZ
zGzg+#?XDX|s0$Yr6nsG~-3VRi%0)pDqy!WNk%}oPh$uC>lGvCr(`syIhBh;EAI#%^
zFBdvvw1WTD;c(86^AyfGwrgqm{5?|2Cp^!)&pCI<IVXe=tH#)GowJMca|=Ihj~9Kw
z((-xXdEV=u=bhM7+FQtGb0U)&CQVbKI3!78cXR7TWUW2*@I#ND`7glHTrPk1;Pjzf
zy<Y1!TaBdK>-pe>?*}HA&1QFGvzco3dX%Q=k@>lWF9Bqq<ayr7iSdctdU-9nR{i~h
zIEn99Djicwjdwcj2eukp@6>A5uy9+UAf<e>pXc`t=iIo%5ht-{tvx<Jw_vxmx(2*-
z;o=v^gCGDna0>t&QR@a;wORe@)xwV#U*z99JbT)iv;#Qtj~TpsYTpa{Cu(n>`@BQD
z3qrt=c|mdXPw;!6Lc8k*{(OFz_3OJ{e*TT}Tf#ZV^4W|o%{=Al{F5YY2?8c3B*jsO
zbv>^BmU45;VvJ>M)F6{(Hh=!u4*4qZ0Wv}A-G1jItbBcvrEfY2VL3c4Ir_Lj>lT}<
zAs>APTEX3W0**a%n&6j3`NNe1`N0f~N|+o|7^4xwa^+VAZWx^6u9CtSFb1w}DvSyN
z(8d$OImc@!?$wVyea36GTI`$J&(P2iS}T0tLupO7+o4{s(`YtmHd;*2%y8k8SL}Lq
zSJnq8S4(bVqe7?CW;iqQ7eHf-LK{P`*Ch-i!YCvPLn<2^lxvd?+}~^5xwD8dhN-D3
zGMNloE3{UF3YyI(jb@e|BO}~VEDlyX08}a!eBb}y3gRdtNs__w_yAJMa=YC=I6M0w
zyGy$Xf&gPQ#%Q!Q^wJ)291}$mQ511`?J`oz+PM!Gdp>|M=DC&cSKhz$-KD)k436v;
i^&d}4dCgk;EWjUj^N(T1Yi1z;0000<MNUMnLSTYF<b@mn
index 1b4a9dff5df4cd022c6d5e8cc9c0d7693ed6f1df..5efc13676caa5331993c84b7e757f0e2ea1d7a8c
GIT binary patch
literal 924
zc$@*817rM&P)<h;3K|Lk000e1NJLTq000mG000mO1^@s6AM^iV00004b3#c}2nYxW
zd<bNS00009a7bBm000fw000fw0YWI7cmMzZ8FWQhbW?9;ba!ELWdL_~cP?peYja~^
zaAhuUa%Y?FJQ@H10~tv~K~y-6ZIVrFRAm%~pYOZ3ola*uQ;4Ol%ut**LF$S$iedxU
z*wm&jAStqturS8x#zfso8Urp33rviOx-djS%9bFBjg&M-)7CDewm=K5g$~pIPVd~#
zZRg(m9T!j{;G3My$;p#*-uEaGVM~42uI|%XAF(X!H4$kR5v7zG3q$jVi0N%_>m27P
zDG{OX+Ery)R*z*_pEjg-Ct|U<ibN_Xl}b2;HC(qKOUsLnG3LuR-+1fn{{fE2<5fTG
z-P0VOpP$=U&9Ar{o0~R>vhA`k9*e~)W3fms_rNKYO2^vUI)B*$XaLKyPS@Af$0sIl
zIoaIo`GQ+G;QOUo-}mc0ulV}%%JSE9bGfxdGLg_)pZV_wHh_rK2|~dwSjL!-+S@wK
z*1(8Tb-;e9j3$iI#9wG=8TotsaEr+G#{dwV{33y0WNhG6VzmD=09wDA=qay?f4Ke7
z;mV3s3IR6m-LqF`?q3;E>RgM+=jz)tnU9<5=gwWc;!)fHrQle*qIN;3{H~IQci%%z
zPg8yQG5|{*9Y{J&wzqdZbltbruiuvk=@+}Lpz0`YQG<e1y{2%YheWc0m~9hIOi(@k
zFu{CtGqQ6ht}!h3_Yc^SvXWK(d<Vn7ou==152Xw*?a{RS^$&I3FJneWpN<~Av_wT?
zBfvfl5c)2uTAwfs2*ZHsnRO5l&jVwg0f-2A-ormQ^~wIA>z%V!KA)#C(?ofBIYHp#
zojA#Mt*MGeF}d6m0FzAOcpfV^ZVc$jTw3nlonm%&mTWfrs2;F-yqkrwF*dZuY}-b1
zXo%$CAf;#&PbpT%$BQEJg$=M{M-5>ZlF4L<L?Q%%PtcIYoxDT#!bPfTYACd}BF3<}
zw#M4RJQ(xMD<aozfT^h|Y}=+H5`A<+Kp6T2M~^@{g?s)dBDZgY2<xd7KOcD2%+x&B
za|y7u)|16zaqq!{huD?gMOj(dV>5#wWV5M>LRS}#<KQ?BH*ei!c4Q=X=|b-&fE|Y6
y2g833|2Q}_xLYapjN?x@4`{8k#+diF`u_q48ihof!_dh90000<MNUMnLSTaYp0)e{
index 7a0176fd6752bf9e2587e862a815399f52bb4360..8a10dbe5de957af28003db22d53c2f371b9612fc
GIT binary patch
literal 5754
zc$@)x7KQ1FP)<h;3K|Lk000e1NJLTq002+`001Be1^@s6g){$b00001b5ch_0Itp)
z=>Px#24YJ`L;(K){{a7>y{D4^000SaNLh0L01FcU01FcV0GgZ_00007bV*G`2iO4>
z3JoablIflR000?uMObu0Z*6U5Zgc=ca%Ew3Wn>_CX>@2HM@dakSAh-}000%$Nkl<Z
zXx_z|d2}4boyWh`UER|&J*Q?yw?>B#VT^AO*g$NENrH`I3$L-w5fIq0m}6PvWMSXi
z0B@6ZIE1rHI2;Z`90J5Q5FlWJd|SSaZ~4+;OB#)i(P&0<bye*jBaJ0X2J=_yy?Sr@
ztg2sqtLj^y9`fOumAA-}{FcECAAUfhGOcHvEtog^p0E0zFPgS=s4Pnrnn{_GNEo94
zfKvHTJdv#8T&$@5?CDc|?=PJG+nW?gebr#b2>ifQ``Odv`|e2uem+EEB!>{92_a&#
zOd5%I{h7-xBiT}Zg#=#AIa~lBNuphn$Z6u)a55DKNq%eUO+WKF9j+f#`Cw;<Z{s&#
zyak}JCvcKN<;9Xjp8Lu5Bh+C<Su{5*1Ce+V$Ik{Povihj9XNdEi6Jwde}*ysa_whN
za{!PDeJ>;1Tkzt-Yv6G(P?>_#o-8Ya{8m6^iXk&z03ZlJ#9;Lk{@Gbv7}pEV$3(-2
zW`a<~Y#mX}1nOAx%tNt+_(u1A+;OS)iMCtKJgM9y1iv;KshP!?G+a@n1FE^CmT??s
zEwgq>-r$$iV200bbKvW$zr)|sd|AQE@@C_v$+w_awMEmGN)}DsoS*F+`|P4yEyo*z
z*na37)^9rt0LXURP+Xi(M~*0_pMJUP*-$7vt7zKNAJu;LH0PWb#G~El2z6svVKMAB
z8$bYpKH?(iIU-;j;DQ4HMvi<=IdTMv0gZ2*;W0?^X9Q$wEOKI$>iOMh0Ryr2=L}6B
zVHE^JRSh=LcI#h>`}62vZRAPyW<fAb@Mu1lhK{lots>#tsbvaJHW5h~DZo9v#la~6
zaL%D=W>ooy4;rw?Z!z~f?(FCU=RAF^P<e4)mUHa$PtMd|TeA-yonua!8I(8y00uW<
z<KZ?OtYeru^;-SQuXc{@40bIB@Dc!ctSVmm%RW$g5CRNlO@-BLf@-3WWeKt*fl>*w
zBtxMxObY$Z4(1XmOLU*QpBd32mhAMJ^(h1(h&DeyRIr0qS+V<7bFq<3DE?a(y!8AT
zzcHGz3ql^28^!u<dvX1UM#v-vTkh`ws8AgDOYO}slry0q(3Kw<S*)~C01$$su%H<G
z-`PBPjcys)@37EU4AG;4qG?NqN)mbQR}b7`d1cjJ+%n37A~)dk6~bn70uTs=I^nR?
z<8%wd2iqD@RyIc8xN+NaMbnn92LO9^F1#8+cQ^vZ6KTmw5FmmBkifZsETzhq<^EG&
z<+2xlV;IT*5JFIk$-v%YyD@U)UC^DsNa<E~0}!y6?6U~LOA^6%OIln1;q!Rhhfg&n
zM?dx0Y}j>E`hB_9!x(M-I~*ljAw(2}SOEYg*PZa#XMjj1kYf{dkf9@b6e!@%aAVi<
zJ1=Vp$6`@%p6W4Kk}4*bm8!=Zg2-_J!*fj-QF;{=g#sX0^2^0|;rSQgbYws^9m9zH
z2pS`C6c^{Kr%%^c2reL~iu~ey96xaqet!@Om7!7@!=t}}Vl<)2`&+<LkS<@6r1bA+
zpM91xX8h{$NB^B_ng+odz`JaShPD8%1t78$5D`EmK_ndzaj@7Sgkm{4ZV}HB0<h~Q
z>^{|=e&>Yz78Fn$)Ycbac0ZDOp0@!+fIvpHbs3t1R(QQ2Qm+ELx<Uv9{OMfXum;Vo
z^=Jyzp}Dml)eURX*SfkwX$6{0bV^~qm+n1&9=Bbch5S4pD5W4of+R_3Y-$7{1eD6i
z&B@2C>#`9HhLGWQQH9bem+B;2VlRdim~rQQkHH;T-S3(#^-~}PAZeP0NF;*pNEim!
zAgdmP&W;Co2uPkxWiWJ|nFvMm0K`E!C)!|T697S0hJgPQ7~MMoqaK2{07f$sU4KJI
z`*xfUrbZ>DGOZ7^w)or`o_;Uc+xj6aP7_)aXW&swus84_Mtg2eUk|jlfXcK!kz}JX
zJx*-g*8rzp2;HKm?^(TORi7#W7PAEzHVvV!81nPHV2q8rxbh|JL%79ZAR55!cl;jS
zg4>|~`S;MyKLDZRAe{RYWGR2ppfkn*u0Rqd2$-Sj(*YiUkWy0#Va=e{sgPtRfDQl%
zRon>7nV65Cj&@&|(|HJ#H6b4C1~rd?;9X$x8pvu16zk2fcf5+Co^Vmd*@Egl+Xwi-
zBc4qdoA(p!js6*vl!Z7F*o2RdtsUS40j!C{4G1A%GMNAn2q7Q@PoG=)=Re`L>C>TU
z=AL^7PcrL3M&cV(ESQMGlKC(>#sG-nncw~wI{aJk-h0)Ec2-033~pIDXW-lpA~GNo
zGX!q~OZpLMTm(Qs&v_l--5`<~KnD^Dvd<)Q$g%`Yy)Z2hmJJEnkf;~&;7TOAJ^=^?
zAsQ6(Bv4a6Bq9Jpj?x|@TzGM19<K5X@K^Ky<rf2tYiW7qq0<e4NnWRpm?6P1lAu%u
z=LF@mZpV**{9}Cj=_jaM_A-_%`6VI=0-IGsM|%jeEFWTwPf9CDcA-tZ3G3JI$D&0x
zD5NrFO9b%EH#G=^?Jx>%ym$!rbeI5R44eZHc_5@1LewMLQVD9E0l^u%122I{b`WAg
zdq{^rKsFBQ0p$WPRt!b|Ik-^^MV|rzGXxKVu{M~kHy{>21<u9$1N^|EP2Of9M3zOh
z#W<J-02~Y!)fRiW3W5;ge{FIgJMGky$*QvrfwIEFJo?e*Iy_!(1Lqusq#9|}t(beq
zJj4@maL(}8P4#fP>}Y9hHj;)>1z=L&^3Tfi;0&L|shR*rkI731XwROr2$ie=m2Le3
zsO!4Sk?a}51~}(1L@pR2P!)hGO%NhAi%6yksrS)h962NNhWfCfSq4)whe56akqk((
z4oS46I*C{SVgaEA*mE?D2|s%C<bVJQA+jDC_ZGs!uQkN?0szj%_oMvEr!*_c#Pa<M
zv-%e%RvbT3_r%a4g>>)9Htavuj%!EefEx^i5OB^R1P7%Gb{+{}&&eQs`Ce3?J(mz%
ztN`$z7uP{S7+!Ay_U&yzV^bJYrj)?uaG=ZR0N{b#XBCFbw%9DTlbo|5j2TUwb0N5Z
zA&QWMO;)8^lT6wvAqm2TnI}blLQ!tWkmL{Q%+_SJ=;LS8Z4w-uOEAPJ2%ZD*W)RT<
z##I=?1*_#cbc9|^uV5Fa8<y{1u=SyFZ$gvo00<~C!Ai2QeE$Lf_|ZlC(NiV2J^#$6
zt^1yxc*E6t<?5rj?nn#npLQiOomL141UkZa`||^+KGu%nl3eWAx+fyIc((Slr%x44
zTRNZu2AA>X+k4P0auAmbQN3#ugb*N3+GArbD3BTKXvMt?u1hA3bIf2nIcMpJ7;wR0
zE&!Ym0tg|Alv2gj^XAN_uPuMII?4H!1EvGcAvg!;0tUCkU}hLb!G+BOQTkbce(Cio
zt=k^1@?5`s|H5qx$1aCe_8^m9i8uD$4*)m4KBaZbAd-JM+!dL%W9y!=Wo2XZ6D@H(
zv}`lF!m*Skv1)L-?C|A#v199=NVqF<fOG!xr52N8>eJ9kD-3ff6e=Tx*-)u~WGa9(
z(8g?GMp6WW?YjWM`+CF+DRr)ARzZ7v>rR(5<5~dQ08|VZg}qs%Mi1wyY_Q}&s4`ds
zUZ2vs{oyLlq&E*dwEga@Ug{0r)Yqr9R$YRM@S<r;f7BW5TD)=Nw&#kA^VJNuix%X2
z0RSECA+$6$8$HAJS<WxO1WA$_+Wf5r7?uZ>%Fs0xn#lsQDF>QKfo7sGsZMArg-KDM
zDsozZM~*y`1pa3$W9+=m=J-J{gfUhN;4}ci7$auQeA&-Nqusr6#&_bNhpRl-0@w-Q
zr>{?G{qk~NUNmj#P$H2Eh0-a#K2MhALrKG^68{98^?hmC|5m=5NW>o$LeR^7h7e*X
zit@+BPyF%`^5KUcx@1`{H4MY_gLojNamLt*dGqG=LqaoW&o@hwlx;GZoXKQT?+IWe
zkw^rE5X~Fbe9(`6%qXAhR8@7DVHlPl+V~A?KG^hq_pDj<rkO~xDiKIrfXfnz&n&Nq
zU2Yj`*SupP5E>V$(JB!bgpla0+wYI2{ID#SPMtc{<a9cJ7!M2vO&d3EEbUP!0ATjq
zdkP34MU$>8Bfdf($;$L18jGW@uFhUp*I+w(?0A0poV#k*t$M$qPe)wgcDqdrD(;3=
zw?LNV3k-0OtSAa(S;p;m-2L6bUH6{KnPKOEwds7Fn@F;hm7N!29I<t)-;N|13*IsJ
zLE}3DFG)ml3c%jd((DmJm?@><40mQs2z0Ms`%YIp8SkKmVVLZ8JHGz<Yxw>C%L-m*
zW+raF`DXN0?cBR6#%5)Dtq(1%km}Dh;_#89*tWeI0O0nxQCL(+hL;W}|M*8$;q1Bh
zxYvBN@<7i5WQxUN=<4c1p|1dTyS;aq3^sHign(hB+I{=&capVh|1!YvuUq}LVlcx+
z2ywMEpVz0{{BtYk99y@1A+oabWI>2omSuU(sy73(=PcxdwNWCHOAwM_Boiiw!>!Mr
z^8nso`HG!0BO%FDXIv;MRndnBYH0239yDM#-+0}{>g&e?XV1N-Ak*uy{@Y^@%j-7$
z4Hk=r@uRQAgfS!2*5JtTlc=j}z~sp{%2idHt>ts>D(F?B-Dbr{t2bcHx=&JdF>5eu
zW+-Y(ZIUEGmSxCtiU+Ey`h9(DYisrABolEh8jC80MZ-V{!Qa1FWo|lOCz~{LBEy|2
zgh2AahaW8ow07uy+v9Xt@$Hcsc-=N|ZeZ$9Zig((7&CSvwr=^t14tl}!g6x54BFek
z!oouQ>4UYG6~LmRA_yVUa~>h2=)QaJme#EQ1Xq?0MTW}>pU($}!vP@#LZJ{W77GHc
zZP>Z{0LD)kFK?>aR5Ww;{8j*Pd%dt)EQmxRU`Fx+g(d{(;eoy7U5v8;pt7>E*f5L&
zAq0^m3H9fiF>c%hj2U|^0KjZc0geR^J|zhuv~LgY)M{#un%r)8#NX1U|La2wV6j}7
zf{93==2$g;ao-a#j06-VHPEgabv1^UUIi*sEPvy9nGj-0E70wB<BeBdx=bDzODj;4
zr0lCFj3*7}&ckNak&~T;5hF%GQBr1e$&w{_;e{9AbUIN}Q-hp_^N2*F@D=(<?b+IF
zAp|5zg0IkrnwlB}S_A31?)35Ph;~OXX2OlIJ2NiD0|{fS;PJ;FCz_@q6bj<R@q?&6
zTZ8cvCPC9IFp>!{&Y-F)48uT+zY(%*G6^9}0AR6LaO(7h?@SJx35*Hs*!~r+DVq$#
zNFWwV0TW4*ux;B{h{cTy4zpJ!EiEnSymR+9G&MD$v9S?NO-<Ojdt3TiC=^O7LRD2~
zUS1A4exe4~j30yi{QMpsNK!nov6lx@<mTq$+N;N*GuVlYj0{34z2wRjY;QqUmKXOw
zumBBpC;QJ&{S`<6pqB?mA`wWE1l?-GTg!ikL?VXvj#dOaS|NnMinlAFTW!!x+69L_
zNOERm<J*IKaPC|!LZKickuF3cT{u~D2&YaRhob7eiy(~$0s)iT?e6!2eFt~LYPF)Z
zEdY<(i+u-oW6V|KFYv%X0F=^rGMUufZa4Pr{}#HgL)ZK8z}5XhsKsJ|-EK!D5<zxO
zHW*|2#T9S$*P%Pyf$ne^&ph|v7&UqV-d*t)wr~0rx^BbR2{)t{n!$Krs^ciAOfjr<
z6uP^^&`cVH5Qs#&P+U?9O|t+90f2GMxRJPFVj0Gcy0TB(n&5A$LwjpIva<40ozT_-
zr^|z);w!Lc_g1)^jvgM!*oo@u>H$9R=!ruZH)aC%e!CNsu9=LZCl2A`k3SyZ0|AVT
z$K!o?;03&t=7B3$V*2#yFq^-d2PWb%wE7z`bLMo67%>vX#Y4cEfnPuKYn-e(hEG2E
z9BlzVvU74T!2>xcRiT<R$W%cz8bP=#gwH?w2to)<n?4UlGLfEMn8Cu7Qb>~2Z(*|8
z90+$gV6j+n=wLN!Y7Rq^Bv49G;2Q#m(}nJC0|2^dj}hKE0Bb#2F?j$FoIihnah)^&
z-bll_^LCfZ0mc{%!vLieoO6_ym-q0%PqA#-GAvoL1c^if7K;U)ot=<nIl?(l%Skn9
z@MINW^XBdFcs=Oay(!%xyLRnEBFW*+&Kt0Z^yPs<2w2Qk*c}-Nb+%*2j;}Fv*j3=1
zWBc}v&`cUsMMc8k2uEUreiydeorr`xF}!p%I)iN}EE)z%DH4eUx+7r}`i9`h(PI!o
z_y=rX9(nSCi2_`;n03xMmwJ2FV%GVhCo3isNQqY~-`>%O2L{idKW{52C?K1+?Zm7Z
z)B5v3s}*zS&P6;P2j?7HwpYX9binWT3&Svi0Q!wbPgWt$ojr{Dx^oy_I<zN397m5H
z#pJ2wP*t^G0Cim_y$hOQq<El7(_yo@kegS6STqcg+O{GmC-q^<?#MuQw;@_uf<n`@
zL6z*v$U-uige=R5Mk5ehq|Lm|?m~M<H|~Gn(Wo?#L~!+?ipNksV~%vbDYaoZ*Hnk{
z8FQou?|T#iT)n9Gn@^rREhwcpeWnhl&zuG49En5%$z&4ocpUL~9F$U=I(-JGPS?U>
zv7o-LUI-xu{gTg_fs70%jvYOLty{Ju8jZtlw<8{l4z`Glwb^V@&beTW#TjEU##qc^
zvBxsp*>Q){n>3qkhNf8zi^Xnuy!nZu;wyyNtj8=C%lJ!81pwg6$U<h84<2tm>`o7y
z&P-%x`cQhs7#Ie}rB<N>%U8St-C~8NX{i-dR$$d__~W~O0DuD*?MI_Rh}s=Hs##us
z9@cL746E0DjA$$lP19gDn-P!4v1;uGto!(L6!;3TZ|^=Pgs8oEUwi>*0vk5`4SV)}
z3xA*sD_4GiNF)MTmInloG1gsCQ9+W)WSlY9X&6R`F&5&ShZM!s>2zgwWM=u=vvW$?
zGqZf{R;x3}IgierI~TGnhXw)4X?!Jw0HrE)-2uDZ1KsL^qMG}aKVS&IR=J{c(UTSX
z|M>17#x1<}5$F~xvb;HX<DLHlfP=49uIL=Fbz1d)!|b{DxOY|WvW}lHUT*RS@cUQZ
zKzDa{di8ZU9mvVe!LI6EEF2Dp`|gJ?PQ}B<fEh_RTy9WG;VT*rS(c&qAghZM7&Ht+
zbaZrd2_eMbJg|RiYikR+TrL}cP5{}L{D(tN5Ys%+FfNY=zE-&+wCKr-{cpba>bSe-
zR`dq%+t(^r1TVSy{%GZa@;P@EY^vH+<SX=%jEoGDlbe(JD@bQ2{C>aa8MbwOgC|K+
zysfp(gi?S~3bWY^RaK#B8dOz<NmZb#YC89NOaNHB_AjEWY;=e*mbjF)`3@c!0}$=C
zKYiyyv)TMTJTThdgkCBwda}X}U|dh|IxeSTJzKkMN~yEg=gG1hF%09Mg0sGt2QFJS
sERjg$2q7+;EfPY6q9{#^7cV~f|IlM<R+<Udr2qf`07*qoM6N<$f|RqCdjJ3c
index aabb2b32c110a93ec93c00c2105a1b630c47f262..85910b16ee4ff1c2c0dd8b81b04a45cb1b306ee7
GIT binary patch
literal 8668
zc$@*;AtT<2P)<h;3K|Lk000e1NJLTq004LZ001xu1^@s6+Hbzo00001b5ch_0Itp)
z=>Px#24YJ`L;(K){{a7>y{D4^000SaNLh0L01FcU01FcV0GgZ_00007bV*G`2iO4>
z3JM<*ZrWA=000?uMObu0Z*6U5Zgc=ca%Ew3Wn>_CX>@2HM@dakSAh-}001BWNkl<Z
zc-rlJd2}4bx$m#4d%9=UERsee$(Cfvk~hiN5HJLT*%H76+lfiI4iI9(5}a_k3HQBw
z;UszIWrMIJ4+ruL0kb9!0RzUw;IJ4QY;1#MTV4R$vL%gnX(WwipYE!9f6SthG&2&$
z@0^^R)H!u}(ezhc^{a3HTEM^BKXoGju;Ha=r^~YZFk|d$A%y&e2oj=8lC)XZ^*dKx
z^Br%#-&QTXw;sR}lTo<<z@k`Oo2D2H9YTmbvAFg=fbFeY?mje?aVxI6w_25?2X#%m
zno=%jOb-GgaTLiPr%uub0f3DDoe;FW`BU=G0I&=IvMfJ*)`D|ZR8>?HLcZ9%gb;FT
z`-v5e`}YFCH*x@LHW>}Sl_Yxog4xsQ%*tZZw9-O29agk;4OO*x2dYkb`<9((?d7%0
zA9zmF^t)QO+#Sw45lSC&7TT9pv3<1ICP7tID2f6_Q9vo3Y*Ru}3{VsW{*eIwyu)`|
z7FX;4`drHR3{Hd#0H`2?l;Q+&Z~El4(C=N|Knbb^hYKKtP(H*3S_~zxHID(9F?Myu
zv?}8B^@DT%g$AXRqGDPV+1vQx)j7ajY*Gy`oWHQzv1Zi;<~>Kcanw761G`S3+ZRHK
z%ZwtY6?5iPn=V?s0B>#I|DBVq-OH+$-g|B9mb*X5H7@7kYP*Hg+rM=KN{XDYTCM4B
zFc_x%{y+QWub`XC#24D+gWojsc>H3)*`i3~*b1E+XB%j&SvA+5U_yM#dY12@f%xA^
z?Hk%D(f5AS$`$QW0kJ3?_;fiZ&RG(M4;d}9j#A(R>swYsxqS=qJQtHwT$flRj_o_Q
zAr_0C(!^BNh$ZJ=j7*vnz%?4){Mq-fu#}a!@QbH*;oMpaE~-;tt+#<Q1yoWIh)X!)
z4dR^-yK&~i+2-lfJ?0(n?|ZXq>AhFv1X&2F(CmbFK)_unAjD|@JT2%S1mONco1Dkv
z7Yl-`1do?;l+G)dv4sZPmMs)K+Civswje0tHiZLt<CN$t@rwnpRPdNvNYiKADqg3d
z_LcJmi?l&9RYQ<M9U}t3tMcgjBsez~i(>6&Kl+DrgIw;m;DI#@CfsjnIX;Hgc(H6$
z4KLht>*W@IgyE$ZcjE__7sH|wlzK{GvDnbud;s(3)*~1S!ej5oqFM{q{;d_xLKn_C
z_YBM4-TPmtT6%A7E^$3~P6eKN^9X+R><}OXI0yiq(8WRkf<RCKA`*HQf`HP5{w0Kf
zQi97WbPyuM7ZJ;`;L+<ft}YislT5|`3xEREbsIwcKfRKGYKlQ=G8m@~h`wd}i2Jo3
z0J!+O_dVD<LhlSmSza5cwk(3zcJ9IAc|(vWV0QlmfC7W_`y|l&(`6tMQx(2jRVxO@
z0L*z}PA+F521fdE@mDU*ImpiUwn3IBzK6?MIEGecGpdH)o_j`>qu6D~tD73}A6L0h
zTH?mE@(K__K?tzx!(CW>{spkvY$$P;psS}7|FweSzE^uuQdWkt@)Ac^XWv5rZl7o^
z5(J^*CqG;P%HxQ~V+e;Mh-(@+2N>sIT!4$j`*AM7MdDi18Ttl;*zmW;OxtTryZ`=Q
zFOe0)A9P)>&IiD2?+nq47PczRnIAxiC<wIx01VczQQ3TvLa3sQoc!`R1|#WVKsA6K
z0O%T`KmPHpSCKNeBku-sn+~GZ_y!y^-U9>!s0jd|*e-`+xd5Pw6gYA2Le+?_v<}YX
zI!{R%fKPF>GmyuS0%U0-z=>xka&Xnsd+Q~MUVr1)zifW^g}wOE)ukx+6r#LrItWQ{
zkI&~r|3E(m2Yqn43PCAFnWr2Cz+KA~{QR$8oUvezxu?7ThN`9aK04mIrV>H_NE{y?
z9YVlAj6t6d1HM7%x&}%qWJ!V~QOI)QT&B|KxkSN*NFpnM1doqt2F38~w^!XzQB+i%
zUq8m)Lu}|6!oByv<h}>sK|n;3BxOYVeuH4xM6EV}2uw>o7t<KASS>i(707Sn6c3_=
zdZ6^&36uMmAUu|!4?sXhxa+?lN%5m&jI5;21OSwJN>ON6(SN)t=O9H+6C_!haKG49
zGKN-0TQaY<j5dDOgA3*qz-}?1)H5v!E(IY3?cR0(KwG;Pg@r{BB4OQ@xJwZXg>cy!
z4m9@!;4Uem9p3IG01l0}glW<Nh{kn<V>&`n4NTV{%MuK-fI&z}?j#@}pqzkHfeh~`
zYg@Z^ts0Go%H8e~ghHWw9t0#k23h?QVu7t-;SV6GGeAHfL=<}T1ccUzK&(M75k5*N
zMlzot4#hDLh~))1VAU~fZ2$(}L#b^yWVH$e5`-9m9_>U++g{YqoONshz$xpwxX6tU
zpZ+0q#<RK;LI}vR1c^>u4aRf~4*Dio;zreQL1lTd=|tBszJ7KAii=7>DM{)+i~-o&
z(S|b@o(Vz(gh*KB4!Z+q&eXBHr4NOL4pVPW{{;XZ9q-T+N|4XVv&I`y7WgZMEXxqH
zT{bZyKuFqm&TNB&gT!oAvu<7?1RxTdL<j-G&7eYnYXgu?XG8E2XpsYuP4i(epO2XD
zJ^)n^0)#U@CQcC71!7u$FJ>fS1ml1z`(Q9Fg5Z9{gYUv%y$G_o9CqU{fC}W~;K9M{
zKH$f}Kcm616frFf)nLZK;Vt-*_1igj^0>Ch<91@l{&o~vT`-wUNQW3i0_1nzc^d-*
z1K7HCE0$lqV$8#eqQGre5Dte?<|zb#MLBpV9mL3{N6WNLxa*!j;dj5j23_L-mdWVm
zpvZ4zjaui4O*nckz)%PR52&FGQQxD`LhphQ6Qa;zuv`dPNl0bJ$q}OzJ)WX@$!vlD
z_*yN(k^CME;RTTNDD*%LA_Kny3+)6oxDg-vBP7cOi1U;b#o@$UlF=tk*N`vB(KPr9
z!lWPl{4<0}Kbi(#$r&_A($dpAQ`4sv6j;zZ7=}S6P!%P)NGXsx1_lN&e|`h}em`FS
z+vfBp;hcj~3X^KUNH7kY%>rF#)3QJdaDiONP()!>G!&OFhQsCrWh3MKcQR^i=aB=P
zF>ubnIR|GvdCrpeIpVwony3V|TnWyjFqkicWVr;g@j@^?4ApiaA~6|*LG{nX^Y^qo
zuJZ^GLLf^tXO}1ekxC(?nUJklL6U7y9V=k4TnNR!9E#$A&gTF?zmUjtX%3boX>-eo
zV=JnwW)ew~vQDfk^eLDe#1K6WyX-($=u;StrYvHbq2<IeAxYBaw1HxfJ34xYs|xK#
zfGUV<8jMs<i(w&v+S)oaHy?!AY{q*#-UA^Nmw)wgFs4IeI+&1PvnmJ#LXc&tBfHc{
zh8vS8+qI7|BmPGaW(JAsSbE*v04P?h`VpR4cLzWX(4&5^vekh5TOf2y>@wRH0_Pke
z$*l>|oZP4>zZ(KEF&kU}GPQu9H}N;Bf(R8tszlQ#ao+KE>B-L#9RwFVL7#I7F$aVQ
zNYnx%x<CX6AcIOq^beXbw`%x)x%ic~G{Cy9-+8jV1;<Yw%^iy_0!HFPI6AZ&F1ZE(
zu;s1S^2VYwtnNK+oxUok-GZSILrGkNsu<JY5+d-O>%Rk^&j(%Cq3Ln7wzXl;-aTk&
zs0U*VzJLac*^J?#5dheeZT<N;-YdcZoKatli!YfAljB_2i{?Yb51_Vg2LAhJ_aHR1
z6MH`V1bYvE1f6~hM3AH|&h9xRL@S#JY*IBO4Dp1&9Tl@dPznh?Pz-?!6-?M+HlGE5
z@L>Sq$$>=zP%ctOJ{rKmENCbLB|ZRy0E{qLs<HR*)41r$N885e;AB$Z8~Fyi{k<Z=
z<RCOlADA3O^0_GmuH$j-eQ(#mvf8>TQ{%B=%<x!Y=4JpiX}A$oRaK#~vMR01&O7(Z
zh{dCbM5B-h!N*63V73_HJ=q`8H2wYTi;=;40`N-9vG=nlarF2u{O}GA9@sy+5n~#j
zTE813Y#PGuAHYn>D6k}_q)!--8QeM+*v$KY5LW20K#1w1b_p?jF0SRAr@`fdC*~-U
zpbHa(C<jmmfS^Ds0q105vLRPnv%R=S2vGt67R46jU`7DoV6Z5*=<V+%7J?Ac`-dg{
zo;;+sdpr90Ip@@4%SR{hm9t7=P=YX<%t?P*j4^9;rbE*b!3rTb{2?8$f7F9{vn$cK
zdw>Jjo|S{g1z6&=2#4s8QK7$rx8C{$-}+`l`fq#ov|@nQBU1K1A<GgdP59$U9h?VX
zmH{Lt1^W~eHfeBEU8Jr>>O28-YV2J8gFMMVCATen0zuIW4rc6#?E?UG#P(s?-2Y*u
zkYFWlJhtzal6-Vpx7>Yb=CTK#-?jVD4fE#JnSb`oK|FfLIfz8UkYyQ^(uA)F0nRye
zrbE|sfDp*Cf}cFoh?*JYII#bdFz4dAY$?P{+enO)t11b=<upRqIZm_;prX<RhtmWD
z??)sf5;j2|k8L_2B+i(g32aK@j2euSfhyz#t$gdA;M#N-Y!vJiSEuwc7szc|Cavh4
z197_ev3)ngO5Etzjv*7^zW8Ubk`g?&?-l^$!pU}}uIoSU?C2RD_K!fZSg_{zdoUc*
zA-F(19!De^K_nVRG#&+K464zHP?TfM+TBpiR)m5<banO)>$-kdPJNZ-z9b^BYr8Rf
zb}{bz&3ky}g--nH*YCn!V1ki%f<{jyewXs0$9WR>KXl)#Mzdk3*=%XjH9gEZZ|0n(
zJL9~WbKWcjZx%u{1IXJoO%EB3rhP`UVdwo1-S<{Da1$X^krvB|&?+Cp)hubbGp>WN
zL?55$pOk~wUDCI6&35<skL|l<=dBAL2LZ+L$PQE)7ok?Y1nc&F58$}y|6bDn{$v2R
zZn-;Lwe;R=_wGLM<~iq{VJRvp!R>2zW5t)J;r#j%loi@wF)9d0<LDd+V&_3GHtp^}
z&5Uw{f<f%veITUk?AjcO20GT(9X%6}AfRB~<9pC&{5FD)ufnPy#QLZH4>;2xBx^c~
zm39-!sEFo_b=`T#kLEzYsx!TlbJi?QJr@DSbnEIHZ*oBhzV^|FQ+Zp%guuy|p5)jp
zK&SNcxMl(nNr{WR?GH=(_T03^dBNlRZhilj1&_fd6~ish#k!`O5DW3k*IzZbGr7Qg
z3Lx*Q_{vYO-n)DMpUTQh9A_+;WBRZqfOncdK`0zXAQ*?us=#74!)!5P-t0;o*#AkS
ztFw1F796_4`|iDavy4Rm7(u{wU8mz68%|UlHs1%8h9T5)7yv|#3(!;gFboDGB!eTJ
z$4;_v%E%%~5{Ecrr9NN(2T1_FP{MqmzxNO!ggTvt=Owus0Gxyn7LUgylgWI_wEZK)
zAcU}_)pZg;*3=XMASJn50wAqlI&}COe<--}kGSoP>+2uHx~7{ja7_E=i?{fj0N4Pq
zjIL+VF;a4u%I$CcVxOgS{vxhl^UI#@zH8hiMYOQcX)N~?!e+A|5C~y-XawGqebL6<
z14565H}*9C<!9l(PXYkU8T8{xpeX=5iwB$9TiVa6DR+|;_Yy*2kR>Rp1FBjKqbkE_
zFhEshs0KS!MTTmSVUQ)n;yQ!?4)!^9Jv8*clXMw?!;CXCfCDL-r=d~KIm-Z;`h0_H
z*Z%%@YZ&M1DHA0m*4H<%F8S^xmxxY*JEp(9X5`S7zp#D%dHm-q9gVToo9_yI48WMN
z;ChDa=i|6cWJ=FacXQ-Kck?goHA~(Z_Es)7+KU$$jE)*kWCs<RUkeYmMTUEhM13dr
z2E2P4vqT)&IQsI?CtIE)Tyy@(+c5)#h_rP{GD6K6PA(aBiPE4kos(nzgIhb^|NWmc
zXdmXB_Y~M2r?pm!bKVMIC>8F$|Go$B2k_g|K^j0Xxkfo-a+x4Y8Ql!Pk_0mdKpV%o
zTJo4nNu^epCO3yG5ki4G*&P6)$%*#^7)Tz6GwAXx`nLeU3;<P<(dMGEqI~{!A)HVe
z5|Q9%nif6|z&{nWa~d1X8zcQ3UREYU{Zmv9CO4ub*_BhAmq>2VU^2|4;a}}v?H|1*
z>Y_JnP-R)3$rvjXLVO{vCWHt{l6<<ZA78a<Ro?9N@|CMB0PL!&Isn+>@wloeN=yh5
zh{xl@0Q{RaZU{|f+-2YRH>1H|sL?d7Fg34~ZcVv0x!jv<_g{bYuiO7wL>pvTo_W?;
zXBAadRpB($MU&Rn)}qG7MgWPNWENnls;V<7rS93Y>d5rz<<#Txz+PZOcTcaeqqED{
z;q55&c65rB*WS>p>w3$kjT`dnLrIcq91cg377f5=wVXm-bmF%oBO}<gr|GmT?#mn3
zn~4x6o?K@N=!B5Sij_BoPY3;tFFk3Y1SSC@Cqw8u7l^F9=6j(r05ir4D=I25Ffed>
z>Y^(uuy^m?!W`h*RaKpP#{35P+HZcH9{Kbryd9m`y=O0cz9G0=4mcbR)Xl1+=bg6*
zAMD)i@p`>Q%U7;CvT5T6e;%u}P*n}M@w%H(R8(}zb<scn`OjgtSijI3yte6C$~4W%
zg|PMa_Y@H#nE@UwD)vOV5aCx|dNRNnA6$9uEvFPQdF|C_CC+sx7qIp8bQY<q$rO)A
zL++BY2qhx=%El*0RMj-N^lRVdsk&&A%9QNbu>-MK?35;^swytL@IqwL%mQx1tv7#H
za=YDl=J^e%sh)wEGb%8*t{S?oLzZR4;u<=;d$DJ4Bj(Sqr{(3P%I@8J8<wwJbubUe
z#N~8h*gt~8!opLoiyj#n`NEvVG|edpadBN!%x0_Q-@d&DfBnlko36!UvOzHmz(6G`
zl6k&Uh=yqn0peo1X0X}p=4)5oj+b71!kVOS1RzJE5davNP_h$?#qid<@54WmySlHa
z(1q`P_qqx9TUuIj>a^u6S5ZY#=6-MW4N^D~#fuwX!KF*ihpMXZcs#ILt!Qp;Mtyxf
zg25mh_5#eDQGu=RY=_h7#F=NEDK&oFICuHVReN%Y>)P5HY<+7Rdi(yGeh(o;x|S?;
z%+$}BM@lJ5i|t=nEDsFyx&d0mxlS%zvJ{de;morZ<GpRK7g9>OqA0-vyGwg@<NDx=
zl{du!VD&Ax*93#%@_0O+S4TSRRvb9^8Ol5^5JGUlk}K2nx4pBukWwlniHta1#o8Ev
zQ=-}Ba$zJ8#3h$pl5>z9J9cERi*~uj(8_FzqReclpC`LqF1)sR3%+{kh46Shm_B{9
zbavOSU0A$$aiT7|qy$}EUHIA+mtpf8Z^2VqhSJhfxu>V62EegwdX#a2@85PaIOmAP
zVu(Z{h{xl}IBrH3X53NJ8HR?2@aERHbI$p``|finic+iVx-lOB-Q9j7Q9*9H`A1+(
zgTaspOx4ykpt7o#NRmN%di{eoLP(q^VgYdg2n0gYzI)^Ka2FTlPuge^9B%#qH?IB>
z1ZR*9375a7W)3PVYCt8KJiY!wTZ--k4)%BwY2D7Q?!5WRYyhX89nZnbSFW;1lH^{#
z>?-==##eCVS1yLf<H59P)5g?A4-5>z=kuYkFj*H}mZ-D-+7*}K<=5UseM3F%?d>gD
zzH(L9c<Y)F0{=(=pB-y~-|xrZ;2?ZHA2cml7oAK?N|FRwmLW+JBuRonP8?I4QV4-;
zff_|oW?y&Rb!t&jegM4fE%@l8?b!CtCM>@23TRpknx>`Sao5hbp|e!fTcpF1nx?^G
zv7ocNH@_N`IV4%d);C|o#g|+S##x#^r4-xWeifYa@Puqqx-Po36gHa;Ct8l@5fcT-
zR=ZVPT%1cp+iR+4kk5`D!|b}5uvjc8D=SNbO9(-Gd$MfS>qSvfQCg&WJRXEXA=J;C
zjqcul6c-nhuC6XSfC&Jn#BDqtPjGNF2BvFi08^VX^;=3Q7#GRUS8~Uh*REYlqtU41
zcDpC7i;l%(C@ZVL@nc8eZEu0YS(K12x`x5Q0rd8GQBdGYxp6G>`A{e{sSQwIRbaKb
z(B9sP&W@9CIEz3jMJyV@$jC4bA3liM+S<qjfYWu+#l?8)kB@>emerjQLO_zFtgZ)R
z3_jn)x@bjF9A#x?w5z)ZXDw(zadC0_`P5>2y@?Xx_V#uxT(~ej7NryphXd7B6*zIS
z9fgHX+Sk|T01}^OWCJ)?8y@UKPsedo&X|MZ(&;%}rtxiXa1ds*IqT-l^s$8ykR=&H
z2!z8yl$BQ@7K@;_rxPWfa!jwN!LFTuhso@O5P~p)G1jckICMR4EdU}B4v7e8@fgad
z%|I*~!O4@Kp{lA5R+|GDm+YFr!9HL1y6DCOd(bd<0b;QjR8_^nBl~gI8H=VGIIy|h
zML5uW5H_nNqb?e0PJR3BjJoLM%g1jJIP3)ohr{rA+(>4yCiBN9-0SOZ#c%Ha9scvK
zf1d!bBuNttuY9z}1DiTmR5MIw8*DZ^KH9q-ttXGdU@(9&hRUj1*zHclH9&9?0(hF!
zYGzEwvZY@|BofIxb|@4;cUK!Y3*&<wZ^G+635(T+eN7*tqM{l`Q+gwYQUPudLWHK}
zuZ!N-{4v6j5c+++2uDKL*Zgr#4oK1x8Tv)FTCEry9EK!GP||hLqYIO$i=LmTi+=s}
z33bt`sv;DQz-qOEF{b8P^jvNcV+;maLfx#na5|mP;<2opJDFRRStpg*S+XwLXf(rW
zDL{42T<BUHGpc8yvZ@vpl`|2G#ZXmM2gU^An%;NKw{A_do4Y7s6{l>2Y@JdHtF-_Q
zXAx>^=Rq}^Fni8?R94nt*6aqDEmqj=#Yo1{d(#{&Ns_OnrKPC4x*9p_qI)`^GYvz2
z9|{Tz(ACp1h7&UvvZbX3k|d=?fx%#i_4f4}3knKADTStKX^u&OQdd`p=H_OY&1P)h
zz8!=RTz>iG&~+WUu0sd`i`j%=FbGMKV%Y#5zd`+jz36EB6pEsNbB<eXxgCTMeCNiS
z@Vnps282q8M#5-Va4u%n&6|=$NLk+FH&o`et)LKG0Fq=tG@7VDm8b-h(F9w86T|+f
z7#<#(@<-U2v^nQ+IEug+gCrRc4vnN$nW7jGkL!>K@h)F^Q#1{*uItB7o;-=;$B*ZY
zMTbHm96xasMXtmL(p$D{$s3E#c)>t-cek;?UVu<I0!`DPs_Ga&^@ba67_E!eG_<v~
zVb7jDXlQ5vV+?^{2xhYxe!m|80#gyo;ovZ4)>L89qO(y^QH`qVI`s8*p=M?c{`>BG
z(0cMH_U$`>p6+(k&Z?hMn3ge?S45}I3kqB?8qJ7BBZ$Q!35(sJqGskSyz%C?&yzQv
z;N}S-;BXYdY_=jA2_qT}Ly`?BDJjLf+jisD+x|T|Mh7R80*CVrwC1kWOLV3ou1BG>
zgjv37)v754<TXtj?(Xg_tgfl1EhpRHDRHNbmJ}B!>Y^*t3w7Rk=OGr0AsUT>5Q3Hy
zCt)(1;BEJEUDt>6>BV$FrlbO0-lN#KaTBh&W(E8sqxMBC8pErvz7B(8!o2y5CXH8*
zU+}4bEJ+5K%rcB7Yx>?)$I0Z_Y(9K~Yh{?sHW*D-5JF(J7GzI0<Z3^->wD)3a0LL&
zCJX1B)6^u*CJSG4*Xkt+e~!i<edx&#^N{j)b#;j|&s>1UrUN+hjCzDZA(%|2wCj=y
zPKt|Tu^2e#2#3S?sPO=5>uS-|*d&t4_^gYc*$k=))2ilTsJ{~*ebk6cFS|JXw}S@{
z!)SJ3;n^2JmT1}vPf8S#kAri8n(O)$5;haS%@?SdG@Fz=1J0G(R^NeOC;-km?dVQ?
z5z*1zhUHhSq?A%v%vL=9^dosIC^l`}5L$Wd4SgSf+*C4W&Mf-;UtYqRTW>-n5=jRj
zGC@k|T|x*91_Pek@FFU!DskxGAufdIooWg(HF-^o!De%UF^0~LPIx>X*a~cj$6B+x
zM>!Tv03e)mF&VH^NYPIE^<pk#ZoH_TEIE{4UI?=Pv8R3yi`j~PUoSek62XX$u6Fbd
z^uTJd;qj**0Ri1V*{pP3Ki<{Vr4Rc@U^JQW=wnYJ6bdE2$cx7jjYbiPL=cO`z!-zk
zXhbv`#UtyUfXQq@Fc?I4cek$VddpPZq7=ss`MOb6Re@)p`7^e?_aUBo>N(h~7Q~_<
z1crTS(V5Mce&B%z<{6E~g=VuksOviCoQF8)A;wsUF&0W)bIwCa*CcP(G>sXJ#-Pz?
zT=>8P56qv;pvu=7V_=M>8RByT{D<GJ_fsP6d;IA~P+eJznKNdA5Q3`dHJCYL79M-*
z_YguHc=Vws{gVN_Y2yaY7(3F`*u(&!*j<80)~(039Xm1L8%(+YR!EYBp<zGX-nIje
ztXq$w;)Frh)Y!xrV@D>-3y%jn0h)xDUw#eKDrTd8;bP31cQ!V^z7^4EG#$&$1UD08
z##sE$JMWZkzWHW@uIn+zSdcLm<eUeE5J4eC5Q#FMDRstJeD&(phCA-KgEGcqnS~eQ
z0nXOP8(o<|XTx>Uy68t9d?Il353k?<_|uOpxaGzlz-qCfq_`C8)~`i8rZqqD$n*ZG
z>XuC#H~6o-dgY<Uj~nNdmX^x(4fXW+iB=pu^a;Y@Fhb!7EM^nTW;0A?6Kd;fap>S7
z-re1;hk}7mw{F=ql1~z4+r^Yp)YYF0!5OT!gc0H_EWz35eFci5z+|?JF@CaG(jmr}
zGB7aUpNgM6S?lZT3lTzy%jGJ_2)D|F5D|~ZNjBGWs?G2Br|bt6iQ>hah3_Pz<B3O}
z4}D|RRR{n0%%ct0U%MLX)~`i>ukXl<&%YK#qS{hq=qZs!$E4}Kv3X;#e0pWmnO{10
zMsII#adB}m3Jaao<8i}kwIUb{!teLP+wSE}jZKKfV*MZO+1c9D)xk2x%B-#=0OV*i
z8fb58w@sf`J|-n7%kr4&4pmj57-T4l0)rv(#bf030003iNkl<Z-|b{sPG_Bb!vPTv
z1zR(8WtcH0rNB5%b<yC7FXd7I6Q9r5`S8OJm!%BZQ!JO_{r&yjlNnhgTYq`O-$GX`
zyX5fmFFZBR+uHTn=8aneNzTazs>o)bq%JzWZM@Ul)>b=f&XChpY`5F(R+HIcB8137
z2t5=GME%1<;emm^k=7H(gE<VIG4Fij(EeV*ncUggX-Y7fm=OHP6|YX+<D8TJzM;Ww
zZ@<x($-$iSxZQ5Y>1>?yC`LaJ(C)wgelLKI(?B{^H=eg_b_@q&Y(29yj!3pX6-$yP
zH<$s5QddLrnq#!aI@R?_Xv;|CR*kCBB+If)Phs~9LI~I5v2ZjRjbM^50RKO=(^VIJ
uS_%FmwAAM|bW+b?YP+9JaijjjxBmy}FMOHBs|Sz(0000<MNUMnLSTYeP-L?J
--- a/browser/themes/gnomestripe/browser/browser.css
+++ b/browser/themes/gnomestripe/browser/browser.css
@@ -201,38 +201,17 @@ menuitem.bookmark-item {
.bookmark-item[container] {
list-style-image: url("moz-icon://stock/gtk-directory?size=menu");
}
/* livemarks have the same layout as folder-item, but in the browser-only livemark-item.png */
/* only the folder icon has any effect for now, item icon is unused */
.bookmark-item[container][livemark] {
- list-style-image: url("chrome://browser/skin/places/livemark-folder.png");
- -moz-image-region: rect(0px, 16px, 16px, 0px);
-}
-
-.bookmark-item[container][livemark][chromedir="rtl"] {
- list-style-image: url("chrome://browser/skin/places/livemark-folder-rtl.png");
- -moz-image-region: rect(0px, 16px, 16px, 0px);
-}
-
-.bookmark-item[container][livemark][open],
-.bookmark-item[container][livemark][open][chromedir="rtl"] {
- -moz-image-region: rect(16px, 16px, 32px, 0px);
-}
-
-.bookmark-item[type="menu"][livemark],
-.bookmark-item[type="menu"][livemark][chromedir="rtl"] {
- -moz-image-region: rect(0px, 32px, 16px, 16px) !important;
-}
-
-.bookmark-item[type="menu"][livemark][open],
-.bookmark-item[type="menu"][livemark][open][chromedir="rtl"] {
- -moz-image-region: rect(16px, 32px, 32px, 16px) !important;
+ list-style-image: url("chrome://browser/skin/feeds/feedIcon16.png");
}
.bookmark-item[container][tagContainer] {
list-style-image: url("chrome://mozapps/skin/places/tagContainerIcon.png");
-moz-image-region: auto;
}
.bookmark-item[container][query] {
@@ -796,21 +775,16 @@ toolbar[iconsize="small"] #paste-button[
-moz-user-input: disabled;
cursor: -moz-grab;
}
#wrapper-urlbar-container #urlbar > .autocomplete-history-dropmarker {
display: none;
}
-/* Keep the URL bar LTR */
-#urlbar .autocomplete-textbox-container {
- direction: ltr;
-}
-
#PopupAutoComplete {
direction: ltr !important;
}
#PopupAutoCompleteRichResult {
direction: ltr !important;
}
@@ -846,16 +820,21 @@ toolbar[iconsize="small"] #paste-button[
cursor: default;
-moz-image-region: rect(32px, 16px, 48px, 0px) !important;
}
/* Identity indicator */
#identity-box {
background-color: -moz-dialog;
-moz-border-end: 1px solid ThreeDShadow;
+ -moz-user-focus: normal;
+}
+
+#identity-box:focus {
+ outline: 1px dotted -moz-DialogText;
}
#identity-icon-label {
padding: 0 2px;
margin: 0;
}
#identity-box.verifiedIdentity > hbox {
@@ -937,17 +916,16 @@ toolbar[iconsize="small"] #paste-button[
.verifiedIdentity > #identity-popup-encryption,
.verifiedDomain > #identity-popup-encryption {
margin-left: -18px;
}
.verifiedIdentity > #identity-popup-encryption > * > #identity-popup-encryption-icon,
.verifiedDomain > #identity-popup-encryption > * > #identity-popup-encryption-icon {
list-style-image: url("chrome://browser/skin/Secure.png");
- -moz-image-region: rect(0px, 18px, 18px, 0px);
}
/* Identity popup bounding box */
#identity-popup-container {
background-image: none;
background-color: white;
min-width: 280px;
padding: 10px;
@@ -962,17 +940,19 @@ toolbar[iconsize="small"] #paste-button[
background-color: #F5F6BE; /* #F7F898; */
color: #000000;
}
#urlbar > .autocomplete-textbox-container {
-moz-binding: url(chrome://browser/skin/browser.xml#autocomplete-security-wrapper);
}
+/* keep the URL bar content LTR */
#autocomplete-security-wrapper {
+ direction: ltr; | {
"url": "https://hg.mozilla.org/releases/mozilla-beta/rev/d403bde8a07cdbd9c5dc3c578751bf77a5e796ce",
"source_domain": "hg.mozilla.org",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "1049231",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3C6VWJOMGGMCPAMBDNWKIX5YQSIYKAGC",
"WARC-Concurrent-To": "<urn:uuid:2bd9fddc-f3ec-4f88-889f-261eff92cb27>",
"WARC-Date": "2020-08-06T02:26:58Z",
"WARC-IP-Address": "63.245.208.203",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:XMYE66AXPFB5ZAYILVVOHSDDMBXR7A6Y",
"WARC-Record-ID": "<urn:uuid:58a9ff6f-4a15-4a1c-86cc-2dfe9705bcd8>",
"WARC-Target-URI": "https://hg.mozilla.org/releases/mozilla-beta/rev/d403bde8a07cdbd9c5dc3c578751bf77a5e796ce",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7788cc03-2d9d-4352-8f77-61a1ed2f339e>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-110.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
48,
77,
109,
166,
235,
296,
349,
358,
372,
413,
480,
564,
582,
630,
654,
694,
704,
714,
736,
752,
765,
830,
894,
931,
976,
1011,
1059,
1105,
1147,
1187,
1230,
1271,
1285,
1302,
1321,
1339,
1357,
1377,
1395,
1412,
1428,
1448,
1466,
1484,
1501,
1521,
1540,
1557,
1574,
1623,
1672,
1716,
1786,
1867,
1945,
2015,
2039,
2067,
2105,
2151,
2184,
2225,
2264,
2298,
2330,
2356,
2373,
2390,
2409,
2473,
2475,
2539,
2541,
2605,
2607,
2664,
2692,
2694,
2747,
2808,
2846,
2848,
2911,
2971,
3031,
3094,
3153,
3174,
3176,
3178,
3242,
3244,
3283,
3285,
3349,
3351,
3404,
3429,
3431,
3489,
3491,
3524,
3526,
3596,
3664,
3666,
3719,
3781,
3842,
3902,
3930,
3932,
3967,
3969,
4028,
4085,
4144,
4185,
4187,
4246,
4303,
4362,
4404,
4406,
4408,
4472,
4474,
4515,
4517,
4581,
4583,
4599,
4601,
4655,
4703,
4757,
4809,
4861,
4863,
4917,
4970,
5026,
5047,
5049,
5058,
5120,
5122,
5143,
5196,
5209,
5242,
5244,
5254,
5256,
5295,
5347,
5363,
5376,
5406,
5408,
5416,
5418,
5472,
5527,
5573,
5626,
5642,
5695,
5742,
5756,
5808,
5824,
5836,
5865,
5867,
5869,
5933,
5935,
5979,
5981,
6045,
6125,
6200,
6202,
6265,
6328,
6386,
6388,
6450,
6513,
6527,
6529,
6587,
6646,
6657,
6659,
6723,
6769,
6771,
6809,
6811,
6813,
6848,
6883,
6885,
6947,
7011,
7075,
7107,
7109,
7111,
7173,
7198,
7200,
7255,
7310,
7348,
7350,
7401,
7457,
7487,
7489,
7541,
7595,
7603,
7662,
7735,
7737,
7739,
7796,
7842,
7844,
7898,
7948,
8000,
8016,
8018,
8069,
8105,
8107,
8159,
8215,
8268,
8307,
8309,
8359,
8399,
8401,
8454,
8510,
8518,
8520,
8522,
8558,
8594,
8596,
8659,
8684,
8686,
8743,
8798,
8828,
8830,
8886,
8940,
8997,
9050,
9107,
9158,
9212,
9253,
9255,
9310,
9346,
9348,
9403,
9413,
9415,
9446,
9448,
9503,
9560,
9616,
9672,
9674,
9676,
9709,
9742,
9744,
9801,
9860,
9916,
9974,
10031,
10062,
10064,
10066,
10128,
10153,
10155,
10209,
10254,
10332,
10404,
10484,
10559,
10561,
10612,
10658,
10712,
10731,
10733,
10787,
10840,
10842,
10867,
10869,
10921,
10956,
10958,
11005,
11061,
11092,
11094,
11150,
11172,
11174,
11230,
11283,
11340,
11392,
11394,
11451,
11497,
11499,
11501,
11557,
11559,
11615,
11660,
11662,
11713,
11758,
11811,
11889,
11965,
12038,
12040,
12094,
12144,
12146,
12171,
12173,
12229,
12242,
12244,
12295,
12297,
12345,
12347,
12361,
12363,
12365,
12428,
12453,
12455,
12515,
12577,
12579,
12634,
12665,
12693,
12695,
12747,
12801,
12858,
12860,
12916,
12931,
12933,
12989,
13012,
13014,
13053,
13055,
13105,
13161,
13206,
13267,
13314,
13361,
13423,
13482,
13485,
13492,
13519,
13526,
13566,
13570,
13572,
13630,
13691,
13694,
13701,
13739,
13746,
13788,
13790,
13797,
13837,
13844,
13886,
13890,
13892,
13942,
13992,
14012,
14014,
14072,
14119,
14122,
14129,
14164,
14171,
14173,
14224,
14310,
14372,
14379,
14411,
14413,
14490,
14544,
14581,
14583,
14590,
14635,
14642,
14644,
14705,
14744,
14784,
14824,
14866,
14905,
14945,
14986,
15031,
15076,
15113,
15154,
15197,
15239,
15278,
15323,
15360,
15401,
15444,
15486,
15488,
15556,
15591,
15626,
15628,
15692,
15730,
15768,
15770,
15849,
15864,
15900,
15936,
15938,
15986,
16034,
16082,
16130,
16178,
16226,
16274,
16322,
16370,
16418,
16466,
16514,
16562,
16610,
16658,
16706,
16754,
16802,
16850,
16898,
16900,
16902,
16909,
16957,
16964,
16966,
17043,
17112,
17158,
17204,
17267,
17274,
17346,
17423,
17471,
17478,
17518,
17520,
17527,
17553,
17596,
17603,
17644,
17693,
17695,
17702,
17784,
17857,
17864,
17908,
17910,
17917,
17960,
18003,
18023,
18025,
18051,
18082,
18089,
18116,
18120,
18169,
18171,
18217,
18263,
18303,
18306,
18313,
18342,
18349,
18397,
18399,
18406,
18465,
18472,
18502,
18504,
18511,
18540,
18546,
18578,
18621,
18687,
18693,
18760,
18767,
18843,
18887,
18964,
18966,
18973,
19002,
19009,
19071,
19073,
19080,
19152,
19198,
19244,
19307,
19315,
19394,
19444,
19500,
19503,
19505,
19544,
19547,
19616,
19618,
19638,
19662,
19670,
19749,
19799,
19856,
19859,
19924,
19965,
20021,
20072,
20074,
20098,
20137,
20169,
20171,
20235,
20277,
20279,
20348,
20350,
20423,
20462,
20482,
20553,
20624,
20694,
20759,
20782,
20789,
20791,
20851,
20872,
20916,
20923,
20925,
20973,
20975,
20996,
21046,
21103,
21105,
21155,
21206,
21263,
21265,
21319,
21376,
21378,
21421,
21430,
21487,
21567,
21622,
21669,
21719,
21791,
21856,
21872,
21874,
21931,
22002,
22059,
22075,
22077,
22131,
22140,
22208,
22268,
22293,
22313,
22402,
22457,
22459,
22533,
22569,
22619,
22668,
22670,
22709,
22756,
22824,
22879,
22920,
22981,
23037,
23053,
23094,
23109,
23111,
23164,
23172,
23240,
23300,
23325,
23345,
23434,
23489,
23491,
23565,
23601,
23651,
23700,
23702,
23741,
23787,
23854,
23909,
23950,
24010,
24066,
24082,
24123,
24139,
24141,
24196,
24205,
24274,
24331,
24347,
24356,
24358,
24415,
24424,
24495,
24555,
24580,
24600,
24689,
24744,
24746,
24820,
24856,
24906,
24955,
24957,
24996,
25046,
25117,
25172,
25213,
25274,
25330,
25346,
25387,
25403,
25405,
25462,
25471,
25542,
25602,
25627,
25647,
25736,
25791,
25793,
25867,
25903,
25953,
26002,
26004,
26043,
26092,
26162,
26217,
26258,
26318,
26374,
26390,
26431,
26447,
26449,
26507,
26579,
26639,
26655,
26657,
26710,
26777,
26842,
26929,
26994,
27021,
27023,
27042,
27045,
27047,
27057,
27128,
27191,
27194,
27258,
27260,
27300,
27342,
27408,
27410,
27474,
27476,
27556,
27629,
27631,
27692,
27718,
27741,
27743,
27813,
27857,
27859,
27896,
27926,
27956,
27958,
27997,
28060,
28130,
28132,
28171,
28234,
28304,
28306,
28347,
28409,
28461,
28523,
28585,
28637,
28699,
28710,
28726,
28728,
28769,
28805,
28838,
28876,
28930,
28974,
29025,
29096,
29112,
29114,
29163,
29177,
29236,
29312,
29371,
29447,
29454,
29456,
29514,
29580,
29645,
29672,
29674,
29693,
29696,
29698,
29708,
29776,
29853,
29856,
29875,
29931,
29941,
29997,
29999,
30036,
30073,
30132,
30217,
30302,
30387,
30472,
30557,
30642,
30727,
30812,
30898,
30984,
31070,
31156,
31242,
31328,
31414,
31500,
31586,
31672,
31722,
31772,
31792,
31794,
31814,
31849,
31851,
31932,
31970,
31973,
32005,
32054,
32085,
32088,
32090,
32149,
32152,
32185,
32211,
32214,
32262,
32310,
32371,
32453,
32528,
32581,
32586,
32645,
32648,
32657,
32714,
32750,
32754,
32756,
32802,
32854,
32906,
32967,
33025,
33073,
33121,
33169,
33213,
33273,
33327,
33383,
33445,
33497,
33499,
33536,
33564,
33598,
33638,
33672,
33722,
33768,
33821,
33874,
33939,
33989,
34034,
34090,
34139,
34144,
34158,
34161,
34163,
34218,
34221,
34241,
34313,
34335,
34340,
34342,
34412,
34483,
34547,
34615,
34682,
34789,
34810,
34815,
34817,
34860,
34886,
34958,
35069,
35150,
35173,
35180,
35185,
35187,
35207,
35210,
35212,
35284,
35363,
35446,
35522,
35594,
35676,
35679,
35718,
35783,
35859,
35866,
35912,
35953,
35955,
35991,
36065,
36117,
36155,
36201,
36247,
36293,
36342,
36391,
36440,
36514,
36585,
36660,
36730,
36732,
36777,
36810,
36882,
36951,
37026,
37090,
37157,
37237,
37266,
37347,
37349,
37427,
37457,
37508,
37565,
37605,
37677,
37747,
37794,
37818,
37835,
37850,
37852,
37888,
37949,
37981,
38064,
38109,
38124,
38144,
38157,
38159,
38228,
38271,
38291,
38304,
38315,
38317,
38345,
38386,
38395,
38402,
38404,
38434,
38506,
38565,
38646,
38719,
38784,
38786,
38864,
38922,
38996,
39067,
39158,
39192,
39275,
39349,
39423,
39461,
39557,
39645,
39725,
39744,
39836,
39901,
39908,
39946,
40011,
40069,
40071,
40112,
40167,
40169,
40186,
40191,
40207,
40254,
40275,
40296,
40339,
40405,
40419,
40463,
40530,
40544,
40590,
40655,
40664,
40672,
40742,
40756,
40763,
40814,
40888,
40902,
40944,
41040,
41054,
41105,
41179,
41193,
41240,
41310,
41324,
41367,
41434,
41485,
41536,
41597,
41638,
41682,
41720,
41759,
41799,
41838,
41877,
41917,
41957,
42005,
42048,
42090,
42131,
42176,
42218,
42256,
42295,
42335,
42386,
42437,
42500,
42544,
42547,
42578,
42580,
42653,
42730,
42732,
42772,
42837,
42894,
42944,
42946,
42997,
43000,
43002,
43010,
43071,
43134,
43197,
43200,
43202,
43215,
43279,
43344,
43404,
43479,
43482,
43585,
43588,
43590,
43603,
43667,
43734,
43794,
43854,
43929,
43932,
43965,
43992,
44042,
44087,
44117,
44139,
44141,
44225,
44288,
44314,
44316,
44381,
44404,
44430,
44432,
44472,
44546,
44633,
44712,
44784,
44795,
44804,
44818,
44825,
44827,
44896,
44983,
45056,
45128,
45158,
45163,
45165,
45189,
45192,
45194,
45278,
45291,
45352,
45418,
45482,
45548,
45607,
45676,
45735,
45738,
45779,
45815,
45863,
45887,
45956,
46040,
46107,
46176,
46179,
46181,
46194,
46255,
46321,
46385,
46454,
46513,
46516,
46619,
46622,
46624,
46637,
46707,
46777,
46845,
46915,
46978,
47051,
47114,
47117,
47158,
47200,
47262,
47264,
47319,
47339,
47412,
47438,
47514,
47587,
47614,
47677,
47721,
47783,
47830,
47860,
47935,
47982,
48010,
48092,
48167,
48196,
48261,
48307,
48371,
48420,
48452,
48463,
48472,
48479,
48500,
48578,
48653,
48675,
48682,
48687,
48750,
48797,
48821,
48843,
48881,
48883,
48950,
48987,
49062,
49158,
49237,
49318,
49345,
49375,
49384,
49391,
49396,
49414,
49417,
49419,
49468,
49517,
49547,
49554,
49617,
49619,
49626,
49700,
49772,
49850,
49867,
49917,
49923,
49993,
50093,
50229,
50291,
50401,
50478,
50536,
50543,
50615,
50689,
50766,
50835,
50913,
51002,
51004,
51011,
51086,
51112,
51119,
51191,
51266,
51344,
51433,
51435,
51442,
51523,
51597,
51614,
51664,
51670,
51717,
51785,
51833,
51951,
52013,
52075,
52194,
52259,
52341,
52400,
52407,
52477,
52552,
52627,
52699,
52786,
52885,
52887,
52894,
52968,
52994,
53001,
53071,
53146,
53219,
53306,
53405,
53407,
53464,
53543,
53622,
53700,
53779,
53855,
53946,
54049,
54053,
54055,
54063,
54065,
54108,
54151,
54214,
54217,
54237,
54254,
54261,
54319,
54377,
54432,
54486,
54539,
54569,
54588,
54593,
54643,
54645,
54682,
54781,
54800,
54832,
54897,
54956,
54997,
55035,
55114,
55147,
55150,
55152,
55167,
55240,
55286,
55359,
55362,
55425,
55445,
55475,
55477,
55520,
55565,
55603,
55656,
55658,
55699,
55702,
55704,
55719,
55782,
55785,
55850,
55912,
55979,
56001,
56089,
56151,
56234,
56293,
56304,
56397,
56492,
56577,
56628,
56684,
56695,
56704,
56711,
56770,
56864,
56916,
56968,
56988,
57016,
57018,
57074,
57123,
57125,
57177,
57179,
57252,
57313,
57389,
57432,
57484,
57487,
57525,
57528,
57530,
57597,
57658,
57728,
57771,
57817,
57820,
57858,
57861,
57863,
57923,
58002,
58005,
58043,
58099,
58125,
58190,
58251,
58253,
58278,
58331,
58395,
58440,
58518,
58588,
58660,
58663,
58666,
58668,
58693,
58737,
58801,
58846,
58918,
58982,
59054,
59057,
59060,
59062,
59087,
59131,
59196,
59268,
59332,
59380,
59383,
59461,
59531,
59605,
59667,
59688,
59729,
59792,
59817,
59881,
59941,
59943,
59967,
60019,
60116,
60226,
60273,
60312,
60374,
60377,
60457,
60559,
60584,
60655,
60660,
60663,
60726,
60729,
60731,
60755,
60818,
60877,
60879,
60902,
60977,
61095,
61205,
61235,
61238,
61241,
61243,
61266,
61310,
61422,
61526,
61546,
61549,
61552,
61554,
61569,
61629,
61632,
61672,
61674,
61707,
61724,
61727,
61729,
61756,
61821,
61882,
61884,
61909,
61983,
62075,
62127,
62193,
62196,
62199,
62201,
62216,
62282,
62285,
62327,
62329,
62366,
62383,
62386,
62388,
62403,
62469,
62472,
62514,
62516,
62553,
62570,
62573,
62575,
62625,
62675,
62695,
62718,
62720,
62741,
62743,
62788,
62791,
62800,
62839,
62950,
63043,
63079,
63184,
63271,
63299,
63301,
63322,
63352,
63354,
63411,
63489,
63566,
63568,
63580,
63638,
63640,
63690,
63718,
63720,
63730,
63758,
63831,
63833,
63840,
63913,
63989,
64025,
64032,
64092,
64094,
64115,
64119,
64121,
64170,
64237,
64240,
64249,
64302,
64366,
64396,
64427,
64474,
64513,
64515,
64525,
64550,
64554,
64556,
64626,
64707,
64757,
64827,
64836,
64910,
64983,
65027,
65029,
65054,
65142,
65210,
65231,
65278,
65319,
65321,
65331,
65428,
65505,
65509,
65511,
65519,
65521,
65574,
65627,
65690,
65748,
65757,
65764,
65769,
65771,
65788,
65791,
65793,
65859,
65924,
65927,
65949,
65993,
66019,
66038,
66040,
66058,
66129,
66198,
66230,
66291,
66351,
66356,
66392,
66395,
66397,
66399,
66435,
66508,
66511,
66559,
66607,
66668,
66670,
66708,
66737,
66790,
66793,
66795,
66878,
66881,
66935,
66937,
66973,
66975,
67010,
67043,
67045,
67121,
67212,
67251,
67304,
67323,
67386,
67388,
67432,
67503,
67548,
67552,
67586,
67677,
67679,
67715,
67787,
67836,
67838,
67897,
67947,
67950,
67952,
68027,
68030,
68084,
68086,
68142,
68184,
68272,
68317,
68319,
68353,
68444,
68517,
68580,
68582,
68633,
68635,
68691,
68722,
68775,
68812,
68814,
68916,
69017,
69056,
69131,
69180,
69243,
69278,
69328,
69349,
69384,
69447,
69450,
69452,
69460,
69517,
69520,
69541,
69583,
69608,
69655,
69657,
69688,
69735,
69740,
69742,
69825,
69871,
69873,
69919,
69965,
70028,
70055,
70057,
70088,
70124,
70126,
70154,
70188,
70221,
70267,
70272,
70274,
70341,
70366,
70455,
70483,
70554,
70614,
70677,
70764,
70850,
70930,
70932,
70978,
71016,
71060,
71103,
71160,
71167,
71172,
71175,
71177,
71220,
71223,
71290,
71292,
71355,
71450,
71494,
71522,
71614,
71619,
71629,
71697,
71727,
71774,
71848,
71916,
71996,
72003,
72008,
72044,
72061,
72064,
72129,
72204,
72272,
72327,
72368,
72416,
72494,
72575,
72650,
72723,
72788,
72790,
72844,
72925,
72993,
73061,
73138,
73192,
73238,
73255,
73264,
73266,
73338,
73410,
73474,
73481,
73486,
73488,
73550,
73617,
73662,
73736,
73779,
73844,
73914,
73958,
73998,
74011,
74016,
74018,
74078,
74147,
74197,
74239,
74252,
74257,
74259,
74326,
74401,
74479,
74555,
74627,
74692,
74786,
74810,
74812,
74829,
74832,
74836,
74904,
74977,
75041,
75120,
75189,
75192,
75232,
75287,
75335,
75385,
75387,
75456,
75459,
75461,
75471,
75544,
75617,
75683,
75758,
75799,
75841,
75846,
75849,
75851,
75911,
75914,
75954,
76046,
76051,
76053,
76092,
76156,
76200,
76202,
76270,
76302,
76372,
76393,
76440,
76479,
76533,
76570,
76626,
76700,
76721,
76787,
76841,
76916,
76963,
76972,
76979,
77060,
77137,
77139,
77185,
77271,
77349,
77377,
77413,
77489,
77560,
77601,
77659,
77661,
77689,
77730,
77776,
77839,
77889,
77957,
78025,
78089,
78162,
78234,
78315,
78380,
78445,
78520,
78606,
78655,
78690,
78733,
78744,
78753,
78760,
78765,
78767,
78833,
78900,
78958,
78982,
79014,
79045,
79104,
79111,
79175,
79240,
79284,
79340,
79362,
79392,
79421,
79478,
79483,
79485,
79505,
79518,
79520,
79559,
79633,
79682,
79723,
79779,
79818,
79876,
79952,
79975,
80043,
80099,
80176,
80225,
80236,
80245,
80302,
80325,
80368,
80450,
80488,
80529,
80571,
80578,
80607,
80692,
80768,
80854,
80895,
80922,
80935,
80940,
80942,
80995,
81014,
81053,
81131,
81165,
81167,
81204,
81242,
81245,
81247,
81322,
81404,
81407,
81429,
81495,
81559,
81624,
81675,
81752,
81825,
81909,
81992,
82057,
82093,
82100,
82169,
82254,
82300,
82350,
82424,
82485,
82550,
82604,
82699,
82736,
82775,
82786,
82879,
82935,
82949,
83024,
83105,
83190,
83197,
83280,
83324,
83372,
83437,
83496,
83559,
83611,
83704,
83739,
83776,
83785,
83876,
83930,
83942,
84015,
84094,
84177,
84182,
84184,
84227,
84271,
84339,
84420,
84460,
84543,
84564,
84622,
84703,
84708,
84710,
84729,
84756,
84795,
84859,
84927,
85013,
85018,
85083,
85090,
85164,
85245,
85320,
85393,
85473,
85554,
85633,
85696,
85751,
85817,
85819,
85916,
85992,
86076,
86150,
86224,
86290,
86297,
86299,
86389,
86425,
86448,
86530,
86600,
86685,
86762,
86820,
86836,
86845,
86886,
86958,
86986,
87002,
87011,
87076,
87081,
87083,
87104,
87186,
87265,
87331,
87359,
87410,
87508,
87598,
87659,
87744,
87751,
87756,
87758,
87775,
87778,
87780,
87845,
87847,
87868,
87935,
87974,
88052,
88128,
88130,
88172,
88237,
88294,
88346,
88380,
88449,
88456,
88475,
88560,
88567,
88607,
88651,
88695,
88758,
88760,
88842,
88844,
88853,
88930,
88939,
88998,
89074,
89132,
89225,
89320,
89411,
89503,
89580,
89589,
89668,
89723,
89733,
89810,
89904,
89985,
90053,
90055,
90064,
90106,
90114,
90156,
90235,
90311,
90362,
90413,
90474,
90481,
90486,
90500,
90503,
90505,
90538,
90600,
90603,
90647,
90699,
90716,
90719,
90721,
90736,
90809,
90812,
90860,
90913,
90976,
90998,
91046,
91103,
91108,
91161,
91174,
91179,
91181,
91207,
91232,
91255,
91257,
91332,
91394,
91477,
91560,
91562,
91624,
91671,
91718,
91781,
91833,
91924,
91939,
91946,
91951,
91953,
92030,
92108,
92158,
92200,
92203,
92205,
92284,
92354,
92431,
92502,
92571,
92574,
92637,
92733,
92746,
92757,
92766,
92773,
92778,
92813,
92862,
92960,
93050,
93075,
93147,
93154,
93189,
93194,
93196,
93232,
93270,
93333,
93411,
93451,
93527,
93551,
93558,
93563,
93565,
93625,
93702,
93771,
93773,
93792,
93795,
93797,
93845,
93848,
93905,
93928,
93991,
93993,
94064,
94139,
94142,
94169,
94200,
94227,
94268,
94284,
94336,
94344,
94363,
94420,
94469,
94594,
94599,
94653,
94778,
94783,
94846,
94900,
94980,
95055,
95129,
95170,
95189,
95194,
95196,
95212,
95306,
95349,
95367,
95388,
95390,
95462,
95518,
95588,
95687,
95692,
95700,
95702,
95751,
95815,
95862,
95936,
96015,
96091,
96157,
96187,
96208,
96215,
96259,
96294,
96337,
96408,
96451,
96526,
96535,
96542,
96604,
96634,
96653,
96658,
96660,
96762,
96839,
96915,
96976,
97005,
97073,
97080,
97108,
97178,
97252,
97259,
97278,
97283,
97285,
97324,
97385,
97450,
97518,
97535,
97554,
97556,
97572,
97629,
97672,
97690,
97711,
97713,
97791,
97824,
97826,
97866,
97918,
97973,
98036,
98075,
98114,
98116,
98199,
98235,
98237,
98294,
98299,
98307,
98309,
98363,
98404,
98406,
98461,
98519,
98595,
98665,
98728,
98783,
98785,
98837,
98842,
98844,
98891,
98907,
98970,
99012,
99029,
99093,
99132,
99156,
99187,
99236,
99265,
99349,
99376,
99439,
99441,
99517,
99577,
99584,
99589,
99597,
99605,
99648,
99716,
99795,
99873,
99936,
99967,
100037,
100046,
100076,
100148,
100224,
100233,
100240,
100242,
100311,
100380,
100413,
100465,
100467,
100499,
100562,
100603,
100666,
100727,
100795,
100849,
100856,
100874,
100926,
100933,
100938,
100940,
100994,
101058,
101105,
101179,
101258,
101334,
101400,
101430,
101451,
101458,
101502,
101537,
101580,
101651,
101694,
101769,
101778,
101785,
101847,
101877,
101882,
101940,
102006,
102079,
102124,
102131,
102136,
102196,
102228,
102244,
102265,
102318,
102327,
102335,
102415,
102472,
102529,
102581,
102614,
102665,
102729,
102783,
102835,
102887,
102950,
102979,
102995,
103000,
103002,
103030,
103033,
103035,
103045,
103116,
103186,
103189,
103217,
103219,
103243,
103270,
103272,
103307,
103356,
103386,
103388,
103451,
103497,
103541,
103609,
103633,
103682,
103687,
103689,
103735,
103777,
103779,
103832,
103882,
103926,
103928,
103967,
104045,
104075,
104077,
104136,
104198,
104276,
104279,
104281,
104291,
104351,
104411,
104468,
104471,
104520,
104572,
104624,
104685,
104744,
104810,
104835,
104856,
104863,
104865,
104891,
104959,
105030,
105100,
105167,
105239,
105310,
105377,
105441,
105448,
105450,
105505,
105567,
105592,
105613,
105676,
105762,
105855,
105935,
105938,
106007,
106097,
106141,
106167,
106200,
106202,
106219,
106249,
106254,
106281,
106314,
106319,
106321,
106352,
106386,
106388,
106416,
106479,
106565,
106572,
106577,
106579,
106661,
106752,
106801,
106820,
106889,
106944,
107014,
107068,
107152,
107236,
107301,
107333,
107356,
107365,
107372,
107439,
107444,
107523,
107567,
107601,
107648,
107720,
107757,
107820,
107883,
107971,
108008,
108088,
108161,
108183,
108215,
108222,
108295,
108370,
108460,
108571,
108643,
108708,
108715,
108795,
108866,
108921,
108959,
109015,
109124,
109233,
109276,
109313,
109350,
109408,
109560,
109745,
109807,
109886,
109966,
110045,
110108,
110235,
110299,
110371,
110463,
110530,
110638,
110759,
110825,
110887,
110950,
111041,
111079,
111117,
111178,
111223,
111225,
111261,
111306,
111308,
111345,
111392,
111394,
111431,
111472,
111517,
111565,
111567,
111607,
111660,
111662,
111701,
111752,
111754,
111792,
111855,
111857,
111897,
111946,
111948,
111986,
112037,
112041,
112083,
112126,
112177,
112181,
112219,
112262,
112266,
112307,
112363,
112367,
112369,
112432,
112495,
112541,
112544,
112547,
112549,
112564,
112615,
112618,
112651,
112653,
112701,
112744,
112761,
112764,
112766,
112781,
112833,
112836,
112858,
112943,
112993,
113043,
113103,
113165,
113195,
113214,
113316,
113321,
113338,
113341,
113343,
113358,
113407,
113410,
113488,
113557,
113578,
113595,
113598,
113646,
113694,
113714,
113716,
113770,
113773,
113782,
113852,
113883,
113923,
113988,
114029,
114033,
114035,
114045,
114094,
114143,
114206,
114271,
114274,
114356,
114379,
114434,
114453,
114458,
114460,
114536,
114571,
114609,
114683,
114738,
114757,
114762,
114764,
114810,
114875,
114892,
114922,
114985,
114988,
114990,
115056,
115059,
115121,
115140,
115170,
115175,
115248,
115323,
115403,
115456,
115491,
115529,
115546,
115625,
115660,
115713,
115768,
115823,
115844,
115851,
115856,
115866,
115915,
115920,
115967,
115984,
115987,
115989,
116057,
116059,
116157,
116195,
116199,
116250,
116301,
116321,
116379,
116383,
116420,
116422,
116458,
116495,
116520,
116559,
116595,
116636,
116673,
116711,
116738,
116770,
116800,
116802,
116884,
116947,
117010,
117070,
117093,
117140,
117145,
117173,
117176,
117178,
117244,
117308,
117311,
117355,
117418,
117436,
117501,
117540,
117588,
117636,
117657,
117712,
117733,
117740,
117745,
117787,
117804,
117807,
117809,
117853,
117855,
117875,
117974,
118017,
118080,
118082,
118087,
118092,
118098,
118163,
118166,
118186,
118237,
118316,
118371,
118379,
118430,
118447,
118450,
118452,
118457,
118462,
118468,
118517,
118566,
118627,
118629,
118656,
118718,
118722,
118784,
118803,
118852,
118857,
118930,
118965,
119058,
119116,
119121,
119187,
119204,
119290,
119352,
119435,
119438,
119440,
119455,
119527,
119530,
119605,
119635,
119637,
119700,
119758,
119763,
119829,
119846,
119849,
119851,
119912,
119915,
119933,
119977,
119989,
120057,
120107,
120112,
120175,
120254,
120340,
120382,
120399,
120402,
120404,
120452,
120455,
120486,
120554,
120578,
120627,
120676,
120739,
120797,
120812,
120880,
120883,
120945,
120964,
120983,
120985,
121042,
121044,
121078,
121136,
121166,
121192,
121194,
121224,
121250,
121286,
121316,
121323,
121355,
121404,
121467,
121469,
121512,
121586,
121588,
121613,
121689,
121735,
121800,
121857,
121906,
121943,
121945,
121985,
121994,
122001,
122006,
122008,
122036,
122066,
122096,
122139,
122173,
122175,
122186,
122256,
122263,
122265,
122300,
122308,
122383,
122385,
122396,
122496,
122573,
122580,
122582,
122592,
122623,
122658,
122683,
122741,
122795,
122858,
122865,
122912,
122974,
123034,
123094,
123152,
123159,
123194,
123253,
123315,
123322,
123345,
123407,
123465,
123528,
123535,
123542,
123544,
123592,
123625,
123627,
123645,
123667,
123673,
123691,
123698,
123700,
123735,
123780,
123782,
123827,
123877,
123995,
124061,
124211,
124373,
124622,
124691,
124719,
124721,
124729,
124754,
124835,
124841,
124887,
124894,
124896,
124931,
124976,
124978,
125016,
125086,
125088,
125106,
125134,
125142,
125178,
125282,
125288,
125328,
125426,
125451,
125481,
125495,
125514,
125525,
125560,
125577,
125591,
125608,
125625,
125642,
125659,
125676,
125693,
125710,
125727,
125744,
125761,
125778,
125795,
125812,
125829,
125846,
125863,
125880,
125897,
125914,
125931,
125948,
125965,
125982,
125999,
126016,
126033,
126050,
126067,
126084,
126101,
126118,
126135,
126152,
126169,
126186,
126203,
126220,
126237,
126254,
126271,
126288,
126305,
126322,
126339,
126356,
126373,
126390,
126407,
126424,
126441,
126458,
126475,
126492,
126509,
126526,
126543,
126560,
126577,
126594,
126611,
126628,
126645,
126662,
126679,
126696,
126713,
126730,
126747,
126764,
126781,
126798,
126815,
126832,
126849,
126866,
126883,
126900,
126917,
126934,
126951,
126968,
126985,
127002,
127019,
127036,
127053,
127070,
127087,
127104,
127121,
127138,
127155,
127172,
127189,
127206,
127223,
127240,
127257,
127274,
127291,
127308,
127325,
127342,
127359,
127376,
127393,
127410,
127427,
127444,
127461,
127478,
127495,
127512,
127529,
127546,
127563,
127580,
127597,
127614,
127631,
127648,
127665,
127682,
127699,
127716,
127733,
127750,
127767,
127784,
127801,
127818,
127835,
127852,
127869,
127886,
127903,
127920,
127937,
127954,
127971,
127988,
128005,
128022,
128039,
128056,
128073,
128090,
128107,
128124,
128141,
128158,
128175,
128192,
128209,
128226,
128243,
128260,
128277,
128294,
128311,
128328,
128345,
128362,
128379,
128396,
128413,
128430,
128447,
128464,
128481,
128498,
128515,
128532,
128549,
128566,
128583,
128600,
128617,
128634,
128651,
128668,
128685,
128702,
128719,
128736,
128753,
128770,
128787,
128804,
128821,
128838,
128855,
128872,
128889,
128906,
128923,
128940,
128957,
128974,
128991,
129008,
129025,
129042,
129059,
129076,
129093,
129110,
129127,
129144,
129161,
129178,
129195,
129212,
129229,
129246,
129263,
129280,
129297,
129314,
129331,
129348,
129365,
129382,
129399,
129416,
129433,
129450,
129467,
129484,
129501,
129518,
129535,
129552,
129569,
129586,
129603,
129620,
129637,
129654,
129671,
129688,
129705,
129722,
129739,
129756,
129773,
129790,
129807,
129824,
129841,
129858,
129875,
129892,
129909,
129926,
129943,
129960,
129977,
129994,
130011,
130028,
130045,
130062,
130079,
130096,
130113,
130130,
130147,
130164,
130181,
130198,
130215,
130232,
130249,
130266,
130283,
130300,
130317,
130334,
130351,
130368,
130385,
130402,
130419,
130436,
130453,
130470,
130487,
130504,
130521,
130538,
130555,
130572,
130589,
130606,
130623,
130640,
130657,
130674,
130691,
130708,
130725,
130742,
130759,
130776,
130793,
130810,
130827,
130844,
130861,
130878,
130895,
130912,
130929,
130946,
130963,
130980,
130997,
131014,
131031,
131048,
131065,
131082,
131099,
131116,
131133,
131150,
131167,
131184,
131201,
131218,
131235,
131252,
131269,
131286,
131303,
131320,
131337,
131354,
131371,
131388,
131405,
131422,
131439,
131456,
131473,
131490,
131507,
131524,
131541,
131558,
131575,
131592,
131609,
131626,
131643,
131660,
131677,
131694,
131711,
131728,
131745,
131762,
131779,
131796,
131813,
131830,
131847,
131864,
131881,
131898,
131915,
131932,
131949,
131966,
131983,
132000,
132017,
132034,
132051,
132068,
132085,
132102,
132119,
132136,
132153,
132170,
132187,
132204,
132221,
132238,
132255,
132272,
132289,
132306,
132323,
132340,
132357,
132374,
132391,
132408,
132425,
132442,
132459,
132476,
132493,
132510,
132527,
132544,
132561,
132578,
132595,
132612,
132629,
132646,
132663,
132680,
132697,
132714,
132731,
132748,
132765,
132782,
132799,
132816,
132833,
132850,
132867,
132884,
132901,
132918,
132935,
132952,
132969,
132986,
133003,
133020,
133037,
133054,
133071,
133088,
133105,
133122,
133139,
133156,
133173,
133190,
133207,
133224,
133241,
133258,
133275,
133292,
133309,
133326,
133343,
133360,
133377,
133394,
133411,
133428,
133445,
133462,
133479,
133496,
133513,
133530,
133547,
133564,
133581,
133598,
133615,
133632,
133649,
133666,
133683,
133700,
133717,
133734,
133751,
133768,
133785,
133802,
133819,
133836,
133853,
133870,
133887,
133904,
133921,
133938,
133955,
133972,
133989,
134006,
134023,
134040,
134057,
134074,
134091,
134108,
134125,
134142,
134159,
134176,
134193,
134210,
134227,
134244,
134261,
134278,
134295,
134312,
134329,
134346,
134363,
134380,
134397,
134414,
134431,
134448,
134465,
134482,
134499,
134516,
134533,
134550,
134567,
134584,
134601,
134618,
134635,
134652,
134669,
134686,
134703,
134720,
134737,
134754,
134771,
134788,
134805,
134822,
134839,
134856,
134873,
134890,
134907,
134924,
134941,
134958,
134975,
134992,
135009,
135026,
135043,
135060,
135077,
135094,
135111,
135128,
135145,
135162,
135179,
135196,
135213,
135230,
135247,
135264,
135281,
135298,
135315,
135332,
135349,
135366,
135383,
135400,
135417,
135434,
135451,
135468,
135485,
135502,
135519,
135536,
135553,
135570,
135587,
135604,
135621,
135638,
135655,
135672,
135689,
135706,
135723,
135740,
135757,
135774,
135791,
135808,
135825,
135842,
135859,
135876,
135893,
135910,
135927,
135944,
135961,
135978,
135995,
136012,
136029,
136046,
136063,
136080,
136097,
136114,
136131,
136148,
136165,
136182,
136199,
136216,
136233,
136250,
136267,
136284,
136301,
136318,
136335,
136352,
136369,
136386,
136403,
136420,
136437,
136454,
136471,
136488,
136505,
136522,
136539,
136556,
136573,
136590,
136607,
136624,
136641,
136658,
136675,
136692,
136709,
136726,
136743,
136760,
136777,
136794,
136811,
136828,
136845,
136862,
136879,
136896,
136913,
136930,
136947,
136964,
136981,
136998,
137015,
137032,
137049,
137066,
137083,
137100,
137117,
137134,
137151,
137168,
137185,
137202,
137219,
137236,
137253,
137270,
137287,
137304,
137321,
137338,
137355,
137372,
137389,
137406,
137423,
137440,
137457,
137474,
137491,
137508,
137525,
137542,
137559,
137576,
137593,
137610,
137627,
137644,
137661,
137678,
137695,
137712,
137729,
137746,
137763,
137780,
137797,
137814,
137831,
137848,
137865,
137882,
137899,
137916,
137933,
137950,
137967,
137984,
138001,
138018,
138035,
138052,
138069,
138086,
138103,
138120,
138137,
138154,
138171,
138188,
138205,
138222,
138239,
138256,
138273,
138290,
138307,
138324,
138341,
138358,
138375,
138392,
138409,
138426,
138443,
138460,
138477,
138494,
138511,
138528,
138545,
138562,
138579,
138596,
138613,
138630,
138647,
138664,
138681,
138698,
138715,
138732,
138749,
138766,
138783,
138800,
138817,
138834,
138851,
138868,
138885,
138902,
138919,
138936,
138953,
138970,
138987,
139004,
139021,
139038,
139055,
139072,
139089,
139106,
139123,
139140,
139157,
139174,
139191,
139208,
139225,
139242,
139259,
139276,
139293,
139310,
139327,
139344,
139361,
139378,
139395,
139412,
139429,
139446,
139463,
139480,
139497,
139514,
139531,
139548,
139565,
139582,
139599,
139616,
139633,
139650,
139667,
139684,
139701,
139718,
139735,
139752,
139769,
139786,
139803,
139820,
139837,
139854,
139871,
139888,
139905,
139922,
139939,
139956,
139973,
139990,
140007,
140024,
140041,
140058,
140075,
140092,
140109,
140126,
140143,
140160,
140177,
140194,
140211,
140228,
140245,
140262,
140279,
140296,
140313,
140330,
140347,
140364,
140381,
140398,
140415,
140432,
140449,
140466,
140483,
140500,
140517,
140534,
140551,
140568,
140585,
140602,
140619,
140636,
140653,
140670,
140687,
140704,
140721,
140738,
140755,
140772,
140789,
140806,
140823,
140840,
140857,
140874,
140891,
140908,
140925,
140942,
140959,
140976,
140993,
141010,
141027,
141044,
141061,
141078,
141095,
141112,
141129,
141146,
141163,
141180,
141197,
141214,
141231,
141248,
141265,
141282,
141299,
141316,
141333,
141350,
141367,
141384,
141401,
141418,
141435,
141452,
141469,
141486,
141503,
141520,
141537,
141554,
141571,
141588,
141605,
141622,
141639,
141656,
141673,
141690,
141707,
141724,
141741,
141758,
141775,
141792,
141809,
141826,
141843,
141860,
141877,
141894,
141911,
141928,
141945,
141962,
141979,
141996,
142013,
142030,
142047,
142064,
142081,
142098,
142115,
142132,
142149,
142166,
142183,
142200,
142217,
142234,
142251,
142268,
142285,
142302,
142319,
142336,
142353,
142370,
142387,
142404,
142421,
142438,
142455,
142472,
142489,
142506,
142523,
142540,
142557,
142574,
142591,
142608,
142625,
142642,
142659,
142676,
142693,
142710,
142727,
142744,
142761,
142778,
142795,
142812,
142829,
142846,
142863,
142880,
142897,
142914,
142931,
142948,
142965,
142982,
142999,
143016,
143033,
143050,
143067,
143084,
143101,
143118,
143135,
143152,
143169,
143186,
143203,
143220,
143237,
143254,
143271,
143288,
143305,
143322,
143339,
143356,
143373,
143390,
143407,
143424,
143441,
143458,
143475,
143492,
143509,
143526,
143543,
143560,
143577,
143594,
143611,
143628,
143645,
143662,
143679,
143696,
143713,
143730,
143747,
143764,
143781,
143798,
143815,
143832,
143849,
143866,
143883,
143900,
143917,
143934,
143951,
143968,
143985,
144002,
144019,
144036,
144053,
144070,
144087,
144104,
144121,
144138,
144155,
144256,
144357,
144458,
144559,
144660,
144761,
144862,
144963,
145064,
145165,
145266,
145367,
145468,
145569,
145670,
145771,
145872,
145973,
146074,
146175,
146276,
146377,
146478,
146579,
146680,
146781,
146882,
146983,
147084,
147185,
147286,
147387,
147488,
147589,
147690,
147791,
147892,
147993,
148094,
148195,
148296,
148397,
148498,
148599,
148700,
148801,
148902,
149004,
149025,
149114,
149131,
149143,
149210,
149277,
149344,
149411,
149478,
149545,
149612,
149679,
149746,
149813,
149880,
149947,
150014,
150081,
150093,
150130,
150167,
150228,
150311,
150324,
150371,
150444,
150488,
150536,
150581,
150583,
150624,
150670,
150769,
150814,
150934,
151060,
151180,
151295,
151297,
151323,
151368,
151415,
151516,
151613,
151615,
151650,
151775,
151838,
151886,
151944,
151995,
152051,
152099,
152159,
152208,
152265,
152316,
152318,
152341,
152471,
152473,
152512,
152612,
152614,
152668,
152731,
152789,
152791,
152826,
152875,
152927,
152979,
153031,
153034,
153074,
153114,
153155,
153195,
153236,
153276,
153317,
153357,
153398,
153439,
153481,
153522,
153564,
153605,
153647,
153688,
153730,
153732,
153785,
153835,
153837,
153939,
153941,
154034,
154036,
154099,
154175,
154229,
154231,
154286,
154334,
154382,
154440,
154442,
154498,
154528,
154568,
154570,
154643,
154702,
154737,
154785,
154787,
154834,
154881,
154930,
154978,
155027,
155029,
155079,
155128,
155177,
155225,
155274,
155324,
155326,
155402,
155447,
155493,
155540,
155590,
155638,
155690,
155742,
155789,
155791,
155856,
155910,
155961,
155963,
156045,
156081,
156140,
156196,
156239,
156241,
156319,
156364,
156366,
156425,
156502,
156530,
156558,
156582,
156628,
156674,
156720,
156766,
156812,
156858,
156904,
156950,
156996,
156998,
157085,
157176,
157263,
157350,
157439,
157529,
157620,
157713,
157806,
157902,
157989,
157991,
157999,
158030,
158061,
158122,
158192,
158264,
158337,
158411,
158413,
158489,
158564,
158634,
158704,
158706,
158778,
158851,
158859,
158902,
158945,
158965,
158983,
159006,
159030,
159058,
159061,
159063,
159077,
159095,
159118,
159144,
159167,
159195,
159198,
159200,
159228,
159256,
159259,
159261,
159304,
159347,
159367,
159373,
159464,
159466,
159496,
159532,
159606,
159640,
159676,
159741,
159806,
159872,
159885,
159922,
159967,
159984,
159995,
160038,
160040,
160061,
160075,
160115,
160132,
160155,
160157,
160179,
160214,
160251,
160254,
160333,
160409,
160465,
160496,
160499,
160577,
160653,
160725,
160737,
160740,
160785,
160788,
160837,
160872,
160947,
160994,
160997,
161016,
161019,
161094,
161170,
161246,
161324,
161402,
161479,
161554,
161632,
161710,
161787,
161844,
161847,
161880,
161882,
161946,
161948,
161994,
162071,
162113,
162116,
162188,
162267,
162282,
162362,
162404,
162457,
162491,
162570,
162580,
162596,
162598,
162620,
162650,
162687,
162712,
162714,
162757,
162782,
162876,
162976,
162988,
163030,
163077,
163093,
163145,
163165,
163182,
163205,
163207,
163223,
163284,
163357,
163374,
163388,
163401,
163448,
163495,
163515,
163568,
163624,
163668,
163718,
163776,
163837,
163883,
163926,
163975,
164032,
164085,
164146,
164206,
164245,
164290,
164343,
164399,
164438,
164483,
164536,
164558,
164609,
164653,
164688,
164729,
164778,
164820,
164866,
164909,
164958,
165015,
165065,
165123,
165187,
165226,
165271,
165325,
165383,
165424,
165470,
165524,
165546,
165601,
165664,
165730,
165758,
165810,
165870,
165933,
165961,
166015,
166077,
166135,
166201,
166272,
166322,
166380,
166464,
166492,
166543,
166602,
166664,
166686,
166743,
166799,
166838,
166883,
166936,
166996,
167041,
167083,
167128,
167178,
167211,
167264,
167322,
167391,
167417,
167467,
167521,
167583,
167646,
167654,
167691,
167738,
167785,
167805,
167813,
167821,
167865,
167893,
167914,
167918,
167977,
168030,
168077,
168123,
168191,
168259,
168310,
168352,
168411,
168459,
168510,
168552,
168611,
168659,
168704,
168749,
168795,
168822,
168874,
168921,
168962,
168973,
168989,
169013,
169070,
169127,
169183,
169218,
169253,
169264,
169319,
169372,
169388,
169395,
169401,
169403,
169429,
169456,
169482,
169558,
169606,
169613,
169615,
169639,
169711,
169744,
169799,
169877,
169932,
170004,
170074,
170093,
170104,
170113,
170177,
170184,
170190,
170192,
170199,
170243,
170287,
170309,
170441,
170540,
170611,
170683,
170753,
170823,
170825,
170902,
170988,
171105,
171204,
171275,
171345,
171379,
171468,
171538,
171555,
171557,
171593,
171637,
171676,
171715,
171766,
171788,
171891,
171894,
171896,
171928,
172022,
172025,
172027,
172075,
172107,
172206,
172209,
172270,
172313,
172316,
172340,
172362,
172365,
172367,
172396,
172418,
172421,
172423,
172470,
172498,
172501,
172503,
172541,
172579,
172599,
172674,
172752,
172830,
172907,
172964,
172967,
173000,
173002,
173035,
173063,
173116,
173172,
173225,
173227,
173243,
173313,
173315,
173381,
173383,
173419,
173421,
173450,
173501,
173534,
173570,
173596,
173617,
173639,
173664,
173691,
173725,
173751,
173753,
173812,
173838,
173840,
173916,
173918,
173949,
173951,
173992,
174029,
174031,
174049,
174081,
174089,
174091,
174110,
174138,
174146,
174148,
174153,
174235,
174281,
174285,
174287,
174326,
174329,
174411,
174474,
174531,
174557,
174612,
174622,
174680,
174685,
174688,
174690,
174724,
174747,
174809,
174907,
174966,
174968,
175026,
175075,
175134,
175184,
175190,
175232,
175280,
175286,
175335,
175373,
175414,
175420,
175502,
175535,
175541,
175568,
175574,
175576,
175602,
175627,
175642,
175648,
175723,
175762,
175768,
175839,
175913,
175948,
175954,
175982,
175987,
175991,
175993,
176011,
176016,
176083,
176135,
176140,
176189,
176192,
176216,
176264,
176384,
176468,
176543,
176545,
176567,
176644,
176725,
176751,
176755,
176778,
176780,
176880,
176927,
176980,
176985,
176987,
177097,
177099,
177170,
177218,
177288,
177290,
177317,
177372,
177434,
177500,
177505,
177507,
177544,
177582,
177586,
177595,
177624,
177642,
177669,
177697,
177699,
177749,
177808,
177810,
177887,
177966,
178041,
178059,
178125,
178127,
178187,
178255,
178323,
178389,
178423,
178486,
178488,
178565,
178640,
178721,
178799,
178880,
178944,
179012,
179039,
179098,
179153,
179155,
179211,
179264,
179298,
179312,
179314,
179333,
179362,
179427,
179509,
179590,
179598,
179601,
179603,
179631,
179634,
179643,
179668,
179673,
179688,
179739,
179757,
179796,
179801,
179803,
179829,
179864,
179866,
179894,
179919,
179921,
180020,
180123,
180187,
180212,
180252,
180308,
180355,
180418,
180504,
180576,
180607,
180622,
180629,
180634,
180636,
180654,
180677,
180699,
180773,
180780,
180796,
180869,
180909,
180933,
181007,
181014,
181037,
181064,
181138,
181146,
181154,
181167,
181169,
181247,
181267,
181289,
181347,
181410,
181421,
181461,
181473,
181478,
181481,
181483,
181516,
181519,
181568,
181642,
181693,
181696,
181698,
181734,
181737,
181789,
181866,
181917,
181920,
181922,
181946,
181949,
181958,
182008,
182049,
182054,
182117,
182156,
182165,
182225,
182231,
182246,
182251,
182254,
182256,
182281,
182314,
182317,
182385,
182407,
182430,
182448,
182453,
182470,
182473,
182475,
182500,
182503,
182534,
182547,
182552,
182570,
182620,
182648,
182664,
182739,
182758,
182785,
182792,
182846,
182848,
182872,
182907,
182960,
183010,
183038,
183059,
183073,
183106,
183119,
183175,
183196,
183282,
183350,
183365,
183401,
183481,
183562,
183639,
183720,
183770,
183852,
183913,
183995,
184046,
184070,
184072,
184126,
184180,
184258,
184308,
184310,
184334,
184341,
184346,
184348,
184374,
184403,
184406,
184454,
184456,
184498,
184503,
184537,
184571,
184573,
184611,
184660,
184729,
184731,
184770,
184809,
184823,
184835,
184851,
184853,
184873,
184882,
184904,
184992,
185040,
185086,
185101,
185166,
185192,
185250,
185325,
185405,
185420,
185438,
185463,
185568,
185616,
185662,
185677,
185742,
185768,
185826,
185901,
185984,
185999,
186017,
186042,
186114,
186141,
186153,
186222,
186279,
186376,
186405,
186471,
186483,
186511,
186571,
186632,
186694,
186708,
186804,
186816,
186868,
186931,
187004,
187081,
187184,
187198,
187262,
187313,
187366,
187381,
187394,
187412,
187421,
187423,
187441,
187446,
187448,
187488,
187491,
187510,
187573,
187615,
187663,
187671,
187677,
187693,
187699,
187702,
187704,
187755,
187831,
187836,
187894,
187941,
187988,
188026,
188049,
188108,
188129,
188169,
188212,
188217,
188219,
188257,
188260,
188298,
188348,
188355,
188409,
188470,
188477,
188480,
188482,
188514,
188517,
188597,
188600,
188602,
188633,
188636,
188681,
188728,
188731,
188733,
188785,
188788,
188887,
188990,
189061,
189063,
189081,
189105,
189164,
189209,
189267,
189322,
189381,
189383,
189446,
189487,
189489,
189529,
189531,
189600,
189617,
189665,
189667,
189703,
189779,
189809,
189888,
189953,
189979,
190029,
190095,
190163,
190225,
190259,
190299,
190336,
190338,
190357,
190386,
190394,
190399,
190401,
190438,
190476,
190478,
190502,
190520,
190541,
190580,
190617,
190622,
190687,
190714,
190716,
190753,
190799,
190818,
190826,
190829,
190831,
190836,
190918,
190995,
191077,
191156,
191238,
191289,
191293,
191371,
191430,
191435,
191514,
191592,
191606,
191610,
191685,
191762,
191841,
191857,
191862,
191897,
191900,
191919,
191996,
192084,
192169,
192171,
192252,
192331,
192363,
192418,
192470,
192528,
192583,
192647,
192708,
192769,
192831,
192907,
192909,
192984,
193064,
193087,
193123,
193125,
193202,
193279,
193306,
193316,
193360,
193404,
193447,
193491,
193536,
193585,
193631,
193690,
193695,
193703,
193706,
193708,
193726,
193729,
193751,
193756,
193846,
193901,
193958,
194050,
194109,
194148,
194153,
194187,
194218,
194224,
194226,
194261,
194266,
194293,
194345,
194397,
194480,
194535,
194566,
194572,
194574,
194608,
194613,
194722,
194724,
194796,
194855,
194920,
194988,
195038,
195063,
195117,
195168,
195227,
195287,
195289,
195341,
195417,
195472,
195485,
195496,
195505,
195507,
195575,
195646,
195683,
195706,
195729,
195777,
195847,
195871,
195928,
195930,
195986,
195991,
195995,
195997,
196018,
196099,
196132,
196153,
196158,
196228,
196234,
196236,
196259,
196264,
196336,
196342,
196344,
196425,
196466,
196468,
196545,
196617,
196682,
196750,
196811,
196877,
196917,
196985,
197042,
197086,
197092,
197094,
197169,
197238,
197280,
197338,
197387,
197443,
197472,
197479,
197485,
197487,
197538,
197619,
197686,
197755,
197757,
197813,
197867,
197918,
197920,
197992,
198054,
198103,
198118,
198120,
198131,
198203,
198279,
198296,
198305,
198323,
198381,
198388,
198390,
198455,
198546,
198572,
198643,
198645,
198669,
198732,
198808,
198867,
198878,
198880,
198939,
199019,
199096,
199172,
199248,
199310,
199317,
199323,
199325,
199352,
199425,
199479,
199530,
199608,
199610,
199686,
199763,
199788,
199816,
199822,
199824,
199856,
199935,
199955,
199970,
199972,
200028,
200072,
200074,
200143,
200218,
200265,
200267,
200341,
200411,
200471,
200476,
200480,
200482,
200510,
200513,
200544,
200589,
200617,
200644,
200646,
200700,
200754,
200823,
200830,
200836,
200887,
200939,
201003,
201064,
201070,
201074,
201076,
201112,
201150,
201156,
201158,
201165,
201235,
201242,
201285,
201334,
201338,
201368,
201370,
201398,
201441,
201451,
201454,
201511,
201592,
201644,
201694,
201696,
201776,
201813,
201854,
201860,
201930,
201970,
202040,
202046,
202092,
202176,
202263,
202268,
202301,
202327,
202374,
202406,
202409,
202411,
202441,
202523,
202569,
202571,
202588,
202609,
202630,
202654,
202656,
202738,
202782,
202784,
202791,
202846,
202853,
202884,
202930,
202994,
202996,
203029,
203093,
203155,
203217,
203224,
203226,
203252,
203258,
203260,
203267,
203338,
203345,
203392,
203447,
203449,
203522,
203549,
203583,
203617,
203619,
203634,
203641,
203645,
203703,
203727,
203757,
203802,
203839,
203901,
203961,
204014,
204056,
204141,
204155,
204180,
204189,
204247,
204269,
204276,
204278,
204349,
204368,
204452,
204454,
204518,
204559,
204594,
204596,
204665,
204689,
204716,
204749,
204756,
204758,
204838,
204872,
204918,
204962,
205008,
205010,
205047,
205080,
205113,
205119,
205121,
205203,
205239,
205241,
205248,
205298,
205305,
205339,
205365,
205371,
205373,
205380,
205427,
205434,
205473,
205499,
205505,
205507,
205589,
205609,
205611,
205687,
205691,
205730,
205769,
205791,
205793,
205850,
205965,
205967,
206006,
206143,
206145,
206212,
206284,
206355,
206401,
206455,
206478,
206506,
206558,
206611,
206685,
206735,
206786,
206808,
206882,
206934,
206989,
207047,
207105,
207119,
207121,
207161,
207325,
207405,
207595,
207701,
207731,
207745,
207747,
207780,
207782,
207832,
207921,
208009,
208102,
208177,
208233,
208276,
208324,
208354,
208400,
208471,
208504,
208558,
208625,
208688,
208746,
208766,
208826,
208860,
208881,
208955,
208974,
209004,
209049,
209102,
209144,
209198,
209267,
209346,
209363,
209378,
209392,
209394,
209425,
209464,
209480,
209502,
209533,
209589,
209639,
209708,
209772,
209816,
209892,
209975,
210009,
210085,
210133,
210214,
210299,
210334,
210417,
210464,
210533,
210593,
210658,
210727,
210794,
210816,
210828,
210836,
210838,
210889,
210891,
210948,
211027,
211091,
211169,
211244,
211319,
211419,
211519,
211542,
211619,
211701,
211758,
211814,
211875,
211916,
211957,
211979,
212014,
212049,
212078,
212101,
212145,
212162,
212178,
212180,
212251,
212320,
212322,
212352,
212434,
212528,
212555,
212644,
212675,
212677,
212721,
212765,
212826,
212861,
212896,
212931,
212966,
213001,
213035,
213070,
213109,
213138,
213147,
213214,
213297,
213316,
213318,
213345,
213383,
213386,
213388,
213429,
213458,
213500,
213550,
213577,
213590,
213621,
213645,
213647,
213671,
213736,
213779,
213848,
213925,
214025,
214027,
214063,
214118,
214132,
214182,
214191,
214198,
214248,
214254,
214256,
214299,
214368,
214434,
214436,
214517,
214519,
214560,
214634,
214709,
214726,
214807,
214817,
214869,
214871,
214935,
214991,
215060,
215122,
215193,
215195,
215257,
215309,
215386,
215408,
215457,
215459,
215483,
215504,
215506,
215541,
215598,
215663,
215665,
215738,
215764,
215790,
215849,
215903,
215955,
215998,
216046,
216094,
216142,
216194,
216199,
216202,
216204,
216231,
216234,
216291,
216334,
216383,
216430,
216445,
216499,
216549,
216551,
216589,
216591,
216626,
216675,
216683,
216726,
216728,
216766,
216821,
216829,
216875,
216893,
216909,
216925,
216970,
216978,
217026,
217067,
217069,
217102,
217147,
217201,
217242,
217250,
217305,
217365,
217404,
217409,
217450,
217452,
217468,
217510,
217553,
217599,
217640,
217645,
217653,
217706,
217708,
217729,
217788,
217831,
217840,
217884,
217979,
218010,
218058,
218080,
218143,
218161,
218185,
218250,
218268,
218286,
218341,
218359,
218368,
218373,
218388,
218399,
218445,
218537,
218570,
218620,
218644,
218709,
218729,
218755,
218822,
218842,
218862,
218919,
218939,
218950,
218957,
218977,
218982,
219030,
219032,
219061,
219078,
219109,
219160,
219219,
219271,
219331,
219389,
219481,
219574,
219579,
219587,
219647,
219691,
219693,
219710,
219732,
219776,
219819,
219859,
219886,
219888,
219950,
220031,
220056,
220097,
220136,
220154,
220192,
220199,
220204,
220222,
220276,
220341,
220406,
220408,
220427,
220479,
220535,
220561,
220611,
220637,
220710,
220781,
220793,
220871,
220878,
220883,
220893,
220967,
221021,
221026,
221070,
221072,
221142,
221204,
221206,
221275,
221319,
221375,
221423,
221433,
221511,
221572,
221644,
221712,
221717,
221719,
221742,
221754,
221811,
221877,
221945,
221986,
221988,
222010,
222061,
222117,
222186,
222258,
222297,
222311,
222366,
222437,
222509,
222582,
222650,
222721,
222728,
222740,
222805,
222873,
222944,
222951,
222956,
223006,
223008,
223032,
223034,
223075,
223116,
223119,
223121,
223151,
223216,
223219,
223249,
223267,
223269,
223318,
223398,
223401,
223403,
223448,
223451,
223471,
223473,
223482,
223548,
223634,
223657,
223701,
223706,
223752,
223754,
223777,
223780,
223782,
223811,
223896,
223949,
223978,
223981,
224004,
224006,
224117,
224166,
224215,
224237,
224282,
224370,
224449,
224470,
224504,
224519,
224575,
224636,
224652,
224683,
224704,
224727,
224772,
224817,
224849,
224871,
224889,
224908,
224974,
225045,
225073,
225133,
225153,
225172,
225242,
225270,
225332,
225352,
225371,
225437,
225465,
225525,
225545,
225564,
225640,
225668,
225733,
225753,
225772,
225842,
225870,
225931,
225951,
225970,
226044,
226072,
226135,
226155,
226174,
226244,
226272,
226333,
226353,
226372,
226442,
226520,
226548,
226605,
226671,
226691,
226710,
226783,
226847,
226875,
226931,
226988,
227008,
227027,
227103,
227131,
227196,
227216,
227235,
227252,
227280,
227298,
227378,
227443,
227529,
227568,
227607,
227653,
227663,
227671,
227693,
227702,
227724,
227733,
227741,
227747,
227767,
227793,
227802,
227842,
227885,
227957,
228017,
228032,
228097,
228121,
228123,
228201,
228275,
228326,
228336,
228338,
228360,
228369,
228393,
228402,
228410,
228412,
228428,
228454,
228463,
228552,
228645,
228686,
228696,
228711,
228751,
228791,
228813,
228815,
228859,
228990,
229121,
229252,
229383,
229514,
229645,
229760,
229891,
229911,
229913,
229967,
229969,
230012,
230063,
230112,
230134,
230175,
230224,
230271,
230357,
230400,
230451,
230500,
230586,
230633,
230688,
230741,
230827,
230872,
230925,
230976,
231062,
231106,
231158,
231208,
231294,
231336,
231378,
231398,
231454,
231559,
231650,
231747,
231803,
231908,
232002,
232036,
232094,
232160,
232219,
232286,
232346,
232405,
232472,
232535,
232591,
232655,
232713,
232772,
232796,
232813,
232815,
232868,
232908,
232942,
232978,
233020,
233058,
233097,
233113,
233134,
233231,
233339,
233354,
233371,
233388,
233390,
233420,
233436,
233457,
233508,
233534,
233560,
233591,
233599,
233697,
233802,
233894,
233972,
234053,
234133,
234214,
234292,
234369,
234445,
234522,
234601,
234674,
234750,
234824,
234901,
234947,
234993,
235022,
235034,
235044,
235046,
235100,
235102,
235140,
235142,
235165,
235181,
235199,
235218,
235236,
235254,
235270,
235287,
235297,
235299,
235309,
235334,
235380,
235394,
235413,
235424,
235459,
235476,
235490,
235507,
235524,
235541,
235558,
235575,
235592,
235609,
235626,
235643,
235660,
235677,
235694,
235711,
235728,
235745,
235762,
235779,
235796,
235813,
235830,
235847,
235864,
235881,
235898,
235915,
235932,
235949,
235966,
235983,
236000,
236017,
236034,
236051,
236068,
236085,
236102,
236119,
236136,
236153,
236170,
236187,
236204,
236221,
236238,
236255,
236272,
236289,
236306,
236323,
236340,
236357,
236374,
236391,
236408,
236425,
236442,
236459,
236476,
236493,
236510,
236527,
236544,
236561,
236578,
236595,
236612,
236629,
236646,
236663,
236680,
236697,
236714,
236731,
236748,
236765,
236782,
236799,
236816,
236833,
236850,
236867,
236884,
236901,
236918,
236935,
236952,
236969,
236986,
237003,
237020,
237037,
237054,
237071,
237088,
237105,
237122,
237139,
237156,
237173,
237190,
237207,
237224,
237241,
237258,
237275,
237292,
237309,
237326,
237343,
237360,
237377,
237394,
237411,
237428,
237445,
237462,
237479,
237496,
237513,
237530,
237547,
237564,
237581,
237598,
237615,
237632,
237649,
237666,
237683,
237700,
237717,
237734,
237751,
237768,
237785,
237802,
237819,
237836,
237853,
237870,
237887,
237904,
237921,
237938,
237955,
237972,
237989,
238006,
238023,
238040,
238057,
238074,
238091,
238108,
238125,
238142,
238159,
238176,
238193,
238210,
238227,
238244,
238261,
238278,
238295,
238312,
238329,
238346,
238363,
238380,
238397,
238414,
238431,
238448,
238465,
238482,
238499,
238516,
238533,
238550,
238567,
238584,
238601,
238618,
238635,
238652,
238669,
238686,
238703,
238720,
238737,
238754,
238771,
238788,
238805,
238822,
238839,
238856,
238873,
238890,
238907,
238924,
238941,
238958,
238975,
238992,
239009,
239026,
239043,
239060,
239077,
239094,
239111,
239128,
239145,
239162,
239179,
239196,
239213,
239230,
239247,
239264,
239281,
239298,
239315,
239332,
239349,
239366,
239383,
239400,
239417,
239434,
239451,
239468,
239485,
239502,
239519,
239536,
239553,
239570,
239587,
239604,
239621,
239638,
239655,
239672,
239689,
239706,
239723,
239740,
239757,
239774,
239791,
239808,
239825,
239842,
239859,
239876,
239893,
239910,
239927,
239944,
239961,
239978,
239995,
240012,
240029,
240046,
240063,
240080,
240097,
240114,
240131,
240148,
240165,
240182,
240199,
240216,
240233,
240250,
240267,
240284,
240301,
240318,
240335,
240352,
240369,
240386,
240403,
240420,
240437,
240454,
240471,
240488,
240505,
240522,
240539,
240556,
240573,
240590,
240607,
240624,
240641,
240658,
240675,
240692,
240709,
240726,
240743,
240760,
240777,
240794,
240811,
240828,
240845,
240862,
240879,
240896,
240913,
240930,
240947,
240964,
240981,
240998,
241015,
241032,
241049,
241066,
241083,
241100,
241117,
241134,
241151,
241168,
241185,
241202,
241219,
241236,
241253,
241270,
241287,
241304,
241321,
241338,
241355,
241372,
241389,
241406,
241423,
241440,
241457,
241474,
241491,
241508,
241525,
241542,
241559,
241576,
241593,
241610,
241627,
241644,
241661,
241678,
241695,
241712,
241729,
241746,
241763,
241780,
241797,
241814,
241831,
241848,
241865,
241882,
241899,
241916,
241933,
241950,
241967,
241984,
242001,
242018,
242035,
242052,
242069,
242086,
242103,
242120,
242137,
242154,
242171,
242188,
242205,
242222,
242239,
242256,
242273,
242290,
242307,
242324,
242341,
242358,
242375,
242392,
242409,
242426,
242443,
242460,
242477,
242494,
242511,
242528,
242545,
242562,
242579,
242596,
242613,
242630,
242647,
242664,
242681,
242698,
242715,
242732,
242749,
242766,
242783,
242800,
242817,
242834,
242851,
242868,
242885,
242902,
242919,
242936,
242953,
242970,
242987,
243004,
243021,
243038,
243055,
243072,
243089,
243106,
243123,
243140,
243157,
243174,
243191,
243208,
243225,
243242,
243259,
243276,
243293,
243310,
243327,
243344,
243361,
243378,
243395,
243412,
243429,
243446,
243463,
243480,
243497,
243514,
243531,
243548,
243565,
243582,
243599,
243616,
243633,
243650,
243667,
243684,
243701,
243718,
243735,
243752,
243769,
243786,
243803,
243820,
243837,
243854,
243871,
243888,
243905,
243922,
243939,
243956,
243973,
243990,
244007,
244024,
244041,
244058,
244075,
244092,
244109,
244126,
244143,
244160,
244177,
244194,
244211,
244228,
244245,
244262,
244279,
244296,
244313,
244330,
244347,
244364,
244381,
244398,
244415,
244432,
244449,
244466,
244483,
244500,
244517,
244534,
244551,
244568,
244585,
244602,
244619,
244636,
244653,
244670,
244687,
244704,
244721,
244738,
244755,
244772,
244789,
244806,
244823,
244840,
244857,
244874,
244891,
244908,
244925,
244942,
244959,
244976,
244993,
245010,
245027,
245044,
245061,
245078,
245095,
245112,
245129,
245146,
245163,
245180,
245197,
245214,
245231,
245248,
245265,
245282,
245299,
245316,
245333,
245350,
245367,
245384,
245401,
245418,
245435,
245452,
245469,
245486,
245503,
245520,
245537,
245554,
245571,
245588,
245605,
245622,
245639,
245656,
245673,
245690,
245707,
245724,
245741,
245758,
245775,
245792,
245809,
245826,
245843,
245860,
245877,
245894,
245911,
245928,
245945,
245962,
245979,
245996,
246013,
246030,
246047,
246064,
246081,
246098,
246115,
246132,
246149,
246166,
246183,
246200,
246217,
246234,
246251,
246268,
246285,
246302,
246319,
246336,
246353,
246370,
246387,
246404,
246421,
246438,
246455,
246472,
246489,
246506,
246523,
246540,
246557,
246574,
246591,
246608,
246625,
246642,
246659,
246676,
246693,
246710,
246727,
246744,
246761,
246778,
246795,
246812,
246829,
246846,
246863,
246880,
246897,
246914,
246931,
246948,
246965,
246982,
246999,
247016,
247033,
247050,
247067,
247084,
247101,
247118,
247135,
247152,
247169,
247186,
247203,
247220,
247237,
247254,
247271,
247288,
247305,
247322,
247339,
247356,
247373,
247390,
247407,
247424,
247441,
247458,
247475,
247492,
247509,
247526,
247543,
247560,
247577,
247594,
247611,
247628,
247645,
247662,
247679,
247696,
247713,
247730,
247747,
247764,
247781,
247798,
247815,
247832,
247849,
247866,
247883,
247900,
247917,
247934,
247951,
247968,
247985,
248002,
248019,
248036,
248053,
248070,
248087,
248104,
248121,
248138,
248155,
248172,
248189,
248206,
248223,
248240,
248257,
248274,
248291,
248308,
248325,
248342,
248359,
248376,
248393,
248410,
248427,
248444,
248461,
248478,
248495,
248512,
248529,
248546,
248563,
248580,
248597,
248614,
248631,
248648,
248665,
248682,
248699,
248716,
248733,
248750,
248767,
248784,
248801,
248818,
248835,
248852,
248869,
248886,
248903,
248920,
248937,
248954,
248971,
248988,
249005,
249022,
249039,
249056,
249073,
249090,
249107,
249124,
249141,
249158,
249175,
249192,
249209,
249226,
249243,
249260,
249277,
249294,
249311,
249328,
249345,
249362,
249379,
249396,
249413,
249430,
249447,
249464,
249481,
249498,
249515,
249532,
249549,
249566,
249583,
249600,
249617,
249634,
249651,
249668,
249685,
249702,
249719,
249736,
249753,
249770,
249787,
249804,
249821,
249838,
249855,
249872,
249889,
249906,
249923,
249940,
249957,
249974,
249991,
250008,
250025,
250042,
250059,
250076,
250093,
250110,
250127,
250144,
250161,
250178,
250195,
250212,
250229,
250246,
250263,
250280,
250297,
250314,
250331,
250348,
250365,
250382,
250399,
250416,
250433,
250450,
250467,
250484,
250501,
250518,
250535,
250552,
250569,
250586,
250603,
250620,
250637,
250654,
250671,
250688,
250705,
250722,
250739,
250756,
250773,
250790,
250807,
250824,
250841,
250858,
250875,
250892,
250909,
250926,
250943,
250960,
250977,
250994,
251011,
251028,
251045,
251062,
251079,
251096,
251113,
251130,
251147,
251164,
251181,
251198,
251215,
251232,
251249,
251266,
251283,
251300,
251317,
251334,
251351,
251368,
251385,
251402,
251419,
251436,
251453,
251470,
251487,
251504,
251521,
251538,
251555,
251572,
251589,
251606,
251623,
251640,
251657,
251674,
251691,
251708,
251725,
251742,
251759,
251776,
251793,
251810,
251827,
251844,
251861,
251878,
251895,
251912,
251929,
251946,
251963,
251980,
251997,
252014,
252031,
252048,
252065,
252082,
252099,
252116,
252133,
252150,
252167,
252184,
252201,
252218,
252235,
252252,
252269,
252286,
252303,
252320,
252337,
252354,
252371,
252388,
252405,
252422,
252439,
252456,
252473,
252490,
252507,
252524,
252541,
252558,
252575,
252592,
252609,
252626,
252643,
252660,
252677,
252694,
252711,
252728,
252745,
252762,
252779,
252796,
252813,
252830,
252847,
252864,
252881,
252898,
252915,
252932,
252949,
252966,
252983,
253000,
253017,
253034,
253051,
253068,
253085,
253102,
253119,
253136,
253153,
253170,
253187,
253204,
253221,
253238,
253255,
253272,
253289,
253306,
253323,
253340,
253357,
253374,
253391,
253408,
253425,
253442,
253459,
253476,
253493,
253510,
253527,
253544,
253561,
253578,
253595,
253612,
253629,
253646,
253663,
253680,
253697,
253714,
253731,
253748,
253765,
253782,
253799,
253816,
253833,
253850,
253867,
253884,
253901,
253918,
253935,
253952,
253969,
253986,
254003,
254020,
254037,
254054,
254155,
254256,
254357,
254458,
254559,
254660,
254761,
254862,
254963,
255064,
255165,
255266,
255367,
255468,
255569,
255670,
255771,
255872,
255973,
256074,
256175,
256276,
256377,
256478,
256579,
256680,
256781,
256882,
256983,
257084,
257185,
257286,
257387,
257488,
257589,
257690,
257791,
257892,
257993,
258094,
258195,
258296,
258397,
258498,
258599,
258700,
258801,
258903,
258924,
259013,
259030,
259042,
259109,
259176,
259243,
259310,
259377,
259444,
259511,
259578,
259645,
259712,
259779,
259846,
259913,
259980,
260017,
260059,
260101,
260149,
260178,
260226,
260233,
260250,
260291,
260298,
260313,
260390,
260428,
260500,
260507,
260513,
260515,
260531,
260584,
260662,
260721,
260723,
260777,
260831,
260884,
260910,
260970,
261007,
261025,
261097,
261145,
261163,
261224,
261294,
261332,
261350,
261409,
261445,
261463,
261527,
261568,
261586,
261649,
261712,
261759,
261765,
261767,
261812,
261886,
261936,
261990,
262020,
262047,
262061,
262098,
262134,
262167,
262181,
262231,
262280,
262326,
262335,
262365,
262408,
262438,
262481,
262530,
262566,
262575,
262577,
262610,
262669,
262705,
262769,
262776,
262782,
262829,
262884,
262943,
262995,
263002,
263004,
263041,
263081,
263138,
263200,
263228,
263297,
263349,
263356,
263362,
263364,
263423,
263478,
263502,
263517,
263519,
263560,
263625,
263679,
263694,
263696,
263753,
263806,
263835,
263841,
263843,
263890,
263923,
263938,
263940,
263982,
264039,
264041,
264098,
264146,
264183,
264231,
264260,
264313,
264358,
264397,
264440,
264486,
264488,
264526,
264533,
264582,
264631,
264653,
264680,
264737,
264785,
264787,
264866,
264893,
264922,
264981,
265030,
265103,
265105,
265141,
265205,
265281,
265318,
265370,
265446,
265468,
265549,
265587,
265646,
265729,
265798,
265813,
265826,
265903,
265949,
265971,
265990,
265992,
266044,
266096,
266118,
266148,
266188,
266215,
266272,
266320,
266322,
266402,
266429,
266481,
266557,
266559,
266595,
266659,
266735,
266772,
266824,
266900,
266922,
267003,
267041,
267110,
267180,
267195,
267208,
267288,
267334,
267356,
267375,
267377,
267407,
267429,
267488,
267550,
267616,
267691,
267770,
267854,
267947,
268000,
268079,
268111,
268184,
268221,
268265,
268300,
268317,
268415,
268460,
268540,
268572,
268646,
268683,
268727,
268776,
268811,
268828,
268849,
268930,
269015,
269105,
269160,
269239,
269271,
269344,
269381,
269425,
269460,
269477,
269492,
269505,
269562,
269635,
269661,
269728,
269759,
269798,
269827,
269839,
269849,
269930,
269990,
270052,
270067,
270116,
270165,
270187,
270199,
270280,
270356,
270434,
270498,
270512,
270591,
270638,
270662,
270746,
270825,
270882,
270937,
271010,
271072,
271114,
271116,
271156,
271218,
271264,
271286,
271305,
271313,
271355,
271395,
271420,
271485,
271549,
271609,
271671,
271739,
271800,
271820,
271837,
271839,
271881,
271916,
271957,
271983,
272025,
272047,
272114,
272187,
272202,
272215,
272217,
272268,
272294,
272296,
272372,
272451,
272509,
272529,
272546,
272548,
272578,
272657,
272665,
272695,
272775,
272797,
272879,
272893,
272974,
273004,
273019,
273057,
273092,
273161,
273239,
273264,
273315,
273347,
273433,
273497,
273499,
273531,
273564,
273596,
273633,
273648,
273650,
273724,
273782,
273834,
273886,
273937,
273957,
274008,
274015,
274017,
274051,
274053,
274079,
274126,
274186,
274252,
274304,
274350,
274352,
274420,
274451,
274519,
274565,
274635,
274699,
274768,
274820,
274896,
274947,
274962,
274975,
275010,
275052,
275076,
275147,
275195,
275246,
275283,
275301,
275312,
275321,
275352,
275433,
275514,
275593,
275621,
275696,
275720,
275789,
275847,
275935,
276026,
276076,
276143,
276195,
276222,
276231,
276238,
276240,
276319,
276399,
276476,
276515,
276553,
276604,
276606,
276680,
276697,
276726,
276763,
276806,
276839,
276881,
276916,
276953,
277007,
277035,
277042,
277044,
277119,
277174,
277176,
277250,
277323,
277374,
277376,
277447,
277503,
277558,
277612,
277614,
277640,
277677,
277723,
277779,
277817,
277854,
277907,
277916,
277965,
277972,
277978,
277980,
277987,
278040,
278050,
278086,
278088,
278120,
278135,
278137,
278182,
278184,
278264,
278343,
278420,
278482,
278547,
278549,
278593,
278658,
278731,
278792,
278868,
278934,
279004,
279070,
279143,
279187,
279257,
279288,
279351,
279433,
279514,
279593,
279620,
279687,
279756,
279819,
279896,
279982,
280050,
280122,
280190,
280265,
280309,
280381,
280390,
280397,
280473,
280538,
280544,
280546,
280606,
280608,
280657,
280690,
280715,
280765,
280814,
280863,
280905,
280912,
280986,
281007,
281036,
281106,
281113,
281164,
281200,
281275,
281351,
281435,
281441,
281443,
281450,
281524,
281545,
281574,
281651,
281658,
281700,
281721,
281750,
281811,
281818,
281873,
281909,
281911,
281946,
282008,
282085,
282119,
282166,
282185,
282191,
282193,
282200,
282269,
282290,
282332,
282334,
282341,
282413,
282434,
282463,
282532,
282539,
282606,
282682,
282748,
282813,
282877,
282956,
283013,
283049,
283108,
283114,
283156,
283177,
283210,
283264,
283270,
283309,
283345,
283347,
283387,
283447,
283522,
283528,
283530,
283537,
283613,
283683,
283690,
283751,
283830,
283873,
283899,
283905,
283907,
283914,
283973,
283994,
284029,
284108,
284179,
284223,
284225,
284232,
284311,
284387,
284394,
284426,
284477,
284542,
284577,
284624,
284684,
284711,
284770,
284822,
284842,
284844,
284912,
284959,
285031,
285051,
285095,
285119,
285125,
285127,
285192,
285234,
285242,
285306,
285326,
285369,
285422,
285457,
285485,
285537,
285549,
285590,
285592,
285620,
285627,
285629,
285678,
285727,
285769,
285865,
285901,
285916,
285969,
285975,
286009,
286038,
286067,
286098,
286104,
286106,
286113,
286194,
286265,
286272,
286308,
286313,
286358,
286363,
286446,
286532,
286543,
286624,
286644,
286650,
286652,
286659,
286706,
286713,
286747,
286752,
286821,
286902,
286904,
286964,
286995,
287037,
287044,
287046,
287083,
287127,
287219,
287260,
287351,
287439,
287504,
287526,
287563,
287610,
287612,
287644,
287653,
287660,
287666,
287668,
287702,
287707,
287781,
287841,
287871,
287926,
287940,
287994,
288001,
288007,
288009,
288041,
288046,
288106,
288141,
288185,
288187,
288268,
288350,
288423,
288492,
288494,
288558,
288618,
288697,
288761,
288836,
288895,
288917,
288932,
288934,
288970,
289053,
289129,
289196,
289293,
289350,
289437,
289485,
289526,
289528,
289594,
289648,
289717,
289797,
289858,
289860,
289890,
289959,
290040,
290076,
290149,
290185,
290267,
290269,
290298,
290339,
290345,
290347,
290364,
290366,
290372,
290391,
290397,
290422,
290494,
290526,
290576,
290626,
290646,
290695,
290711,
290779,
290826,
290829,
290848,
290883,
290923,
290968,
290971,
291046,
291122,
291198,
291276,
291354,
291431,
291506,
291528,
291564,
291668,
291766,
291833,
291904,
291926,
291950,
291952,
291979,
292018,
292065,
292105,
292146,
292202,
292204,
292240,
292283,
292376,
292439,
292505,
292591,
292676,
292760,
292841,
292900,
292992,
293058,
293080,
293104,
293118,
293143,
293145,
293214,
293248,
293296,
293311,
293356,
293415,
293430,
293447,
293474,
293513,
293534,
293577,
293629,
293682,
293699,
293714,
293731,
293752,
293754,
293779,
293848,
293918,
293985,
294029,
294084,
294106,
294129,
294150,
294173,
294175,
294208,
294253,
294328,
294330,
294442,
294557,
294559,
294577,
294657,
294738,
294768,
294785,
294868,
294989,
295042,
295095,
295143,
295215,
295217,
295293,
295346,
295348,
295428,
295507,
295568,
295646,
295728,
295795,
295866,
295937,
296007,
296046,
296125,
296132,
296143,
296208,
296293,
296360,
296362,
296416,
296496,
296571,
296645,
296722,
296798,
296873,
296923,
296925,
296963,
297044,
297074,
297119,
297121,
297189,
297266,
297304,
297344,
297416,
297418,
297462,
297513,
297515,
297593,
297653,
297731,
297804,
297885,
297947,
298026,
298082,
298123,
298203,
298246,
298323,
298354,
298432,
298503,
298545,
298564,
298566,
298625,
298685,
298704,
298706,
298754,
298802,
298847,
298856,
298876,
298884,
298886,
298937,
298944,
299004,
299033,
299101,
299172,
299235,
299277,
299338,
299399,
299445,
299489,
299511,
299526,
299539,
299550,
299604,
299621,
299630,
299638,
299686,
299712,
299754,
299781,
299831,
299881,
299901,
299903,
299922,
300037,
300152,
300267,
300382,
300497,
300612,
300727,
300842,
300862,
300864,
300922,
300924,
300967,
301018,
301069,
301089,
301150,
301202,
301243,
301292,
301341,
301384,
301435,
301486,
301533,
301581,
301629,
301674,
301727,
301780,
301824,
301876,
301928,
301930,
301945,
302009,
302073,
302125,
302133,
302135,
302179,
302217,
302260,
302311,
302317,
302319,
302356,
302385,
302425,
302455,
302485,
302487,
302496,
302535,
302566,
302608,
302640,
302672,
302689,
302761,
302799,
302804,
302851,
302854,
302856,
302903,
302905,
302910,
302935,
302940,
302991,
303042,
303062,
303109,
303112,
303131,
303175,
303220,
303255,
303296,
303339,
303384,
303387,
303462,
303538,
303614,
303692,
303770,
303847,
303922,
303942,
304001,
304051,
304102,
304152,
304186,
304241,
304297,
304358,
304417,
304488,
304549,
304577,
304600,
304648,
304695,
304743,
304790,
304850,
304910,
304932,
304955,
304979,
305000,
305002,
305078,
305080,
305119,
305153,
305226,
305244,
305336,
305343,
305435,
305443,
305460,
305474,
305476,
305511,
305592,
305670,
305700,
305780,
305835,
305890,
305946,
306037,
306060,
306127,
306176,
306255,
306261,
306263,
306270,
306342,
306414,
306488,
306495,
306549,
306584,
306586,
306631,
306700,
306737,
306797,
306857,
306913,
306915,
306962,
306969,
306981,
307043,
307069,
307076,
307082,
307141,
307147,
307171,
307222,
307279,
307320,
307350,
307396,
307428,
307460,
307518,
307524,
307553,
307582,
307589,
307617,
307660,
307667,
307673,
307749,
307755,
307811,
307901,
307908,
307914,
308003,
308074,
308124,
308210,
308252,
308294,
308343,
308409,
308462,
308464,
308530,
308588,
308590,
308642,
308704,
308764,
308816,
308866,
308869,
308871,
308924,
308955,
308982,
309018,
309054,
309104,
309134,
309143,
309145,
309177,
309247,
309309,
309311,
309363,
309365,
309427,
309487,
309539,
309541,
309591,
309593,
309619,
309648,
309675,
309704,
309732,
309764,
309805,
309846,
309889,
309913,
309939,
309965,
309990,
310015,
310031,
310057,
310093,
310126,
310168,
310183,
310207,
310232,
310239,
310279,
310325,
310333,
310357,
310364,
310393,
310401,
310409,
310424,
310448,
310492,
310541,
310570,
310615,
310636,
310661,
310702,
310735,
310754,
310783,
310791,
310840,
310873,
310907,
310952,
311001,
311054,
311120,
311179,
311258,
311334,
311366,
311399,
311421,
311446,
311476,
311506,
311530,
311554,
311617,
311724,
311819,
311924,
312030,
312129,
312136,
312198,
312264,
312319,
312375,
312439,
312504,
312512,
312520,
312543,
312579,
312606,
312634,
312660,
312687,
312736,
312773,
312810,
312846,
312882,
312918,
312956,
312990,
313027,
313029,
313064,
313104,
313138,
313176,
313204,
313234,
313270,
313293,
313311,
313320,
313376,
313406,
313436,
313462,
313489,
313514,
313542,
313570,
313593,
313618,
313645,
313669,
313700,
313715,
313735,
313758,
313766,
313782,
313794,
313802,
313823,
313844,
313883,
313922,
313967,
313969,
313983,
314008,
314047,
314073,
314095,
314119,
314121,
314135,
314160,
314200,
314226,
314248,
314272,
314274,
314306,
314344,
314402,
314435,
314457,
314459,
314461,
314494,
314539,
314584,
314624,
314642,
314670,
314690,
314720,
314742,
314775,
314791,
314810,
314826,
314828,
314844,
314871,
314905,
314934,
314965,
314998,
315029,
315075,
315107,
315140,
315174,
315198,
315226,
315256,
315283,
315312,
315345,
315373,
315401,
315436,
315463,
315489,
315515,
315547,
315577,
315622,
315651,
315675,
315704,
315771,
315792,
315818,
315842,
315871,
315909,
315949,
315979,
316004,
316032,
316034,
316049,
316066,
316083,
316085,
316134,
316136,
316167,
316170,
316189,
316217,
316244,
316271,
316287,
316307,
316325,
316346,
316366,
316386,
316405,
316421,
316440,
316463,
316512,
316525,
316528,
316541,
316543,
316563,
316566,
316585,
316608,
316640,
316664,
316666,
316682,
316685,
316718,
316745,
316747,
316779,
316786,
316834,
316882,
316935,
316965,
317001,
317039,
317073,
317100,
317129,
317163,
317196,
317229,
317260,
317293,
317330,
317359,
317388,
317421,
317452,
317482,
317520,
317548,
317550,
317581,
317584,
317601,
317629,
317656,
317683,
317701,
317715,
317731,
317749,
317767,
317784,
317801,
317815,
317832,
317881,
317883,
317896,
317899,
317916,
317918,
317938,
317961,
317984,
318016,
318018,
318050,
318057,
318107,
318177,
318231,
318290,
318362,
318396,
318430,
318475,
318481,
318533,
318606,
318612,
318658,
318665,
318672,
318679,
318681,
318706,
318786,
318832,
318839,
318898,
318957,
318974,
319032,
319076,
319114,
319177,
319215,
319259,
319361,
319463,
319566,
319661,
319715,
319761,
319816,
319871,
319891,
319928,
319966,
320011,
320050,
320052,
320101,
320148,
320191,
320243,
320287,
320343,
320383,
320385,
320429,
320466,
320468,
320511,
320550,
320608,
320654,
320676,
320735,
320779,
320839,
320883,
320940,
320984,
321042,
321086,
321139,
321183,
321236,
321280,
321344,
321388,
321463,
321513,
321575,
321619,
321681,
321725,
321788,
321832,
321893,
321937,
322000,
322046,
322111,
322158,
322211,
322255,
322311,
322355,
322405,
322449,
322493,
322550,
322572,
322626,
322670,
322727,
322771,
322825,
322869,
322930,
322974,
323031,
323075,
323137,
323181,
323234,
323282,
323327,
323380,
323424,
323485,
323507,
323600,
323602,
323655,
323701,
323747,
323793,
323843,
323889,
323948,
323994,
324043,
324089,
324091,
324150,
324212,
324270,
324272,
324320,
324342,
324394,
324429,
324465,
324509,
324547,
324586,
324630,
324632,
324690,
324748,
324794,
324796,
324859,
324924,
324926,
324999,
325001,
325076,
325138,
325200,
325277,
325308,
325344,
325385,
325387,
325403,
325445,
325476,
325478,
325509,
325547,
325587,
325633,
325635,
325656,
325687,
325724,
325806,
325907,
325909,
325924,
325965,
326007,
326009,
326037,
326138,
326163,
326193,
326195,
326219,
326268,
326326,
326444,
326446,
326491,
326544,
326590,
326636,
326684,
326686,
326727,
326802,
326804,
326896,
326969,
326971,
326998,
327081,
327158,
327198,
327274,
327341,
327398,
327453,
327508,
327526,
327573,
327579,
327608,
327662,
327667,
327700,
327702,
327752,
327811,
327871,
327941,
328011,
328070,
328107,
328139,
328202,
328232,
328260,
328307,
328356,
328403,
328427,
328429,
328506,
328547,
328593,
328642,
328671,
328673,
328686,
328699,
328712,
328725,
328727,
328807,
328817,
328905,
328954,
329010,
329072,
329145,
329147,
329197,
329253,
329320,
329322,
329388,
329467,
329561,
329575,
329607,
329633,
329635,
329656,
329730,
329794,
329839,
329919,
330004,
330060,
330116,
330136,
330182,
330223,
330267,
330308,
330354,
330356,
330398,
330436,
330481,
330533,
330579,
330632,
330683,
330727,
330768,
330809,
330851,
330909,
330964,
331007,
331055,
331109,
331151,
331196,
331234,
331273,
331324,
331326,
331368,
331431,
331494,
331536,
331556,
331574,
331590,
331608,
331629,
331657,
331711,
331749,
331793,
331818,
331873,
331907,
331976,
331978,
332009,
332054,
332083,
332112,
332145,
332175,
332204,
332272,
332340,
332401,
332431,
332481,
332517,
332560,
332593,
332644,
332681,
332724,
332759,
332794,
332848,
332886,
332923,
332953,
332955,
332992,
333029,
333057,
333125,
333193,
333213,
333266,
333268,
333324,
333326,
333427,
333482,
333529,
333531,
333562,
333623,
333625,
333650,
333730,
333765,
333767,
333850,
333855,
333910,
333930,
333977,
334068,
334115,
334207,
334254,
334319,
334366,
334368,
334473,
334522,
334575,
334622,
334687,
334689,
334745,
334747,
334802,
334859,
334906,
334963,
335010,
335068,
335153,
335246,
335316,
335363,
335426,
335473,
335536,
335583,
335645,
335692,
335762,
335832,
335850,
335852,
335916,
335965,
336014,
336016,
336101,
336179,
336225,
336295,
336341,
336429,
336475,
336547,
336593,
336672,
336718,
336769,
336815,
336893,
336971,
337032,
337034,
337053,
337055,
337075,
337095,
337126,
337170,
337188,
337220,
337246,
337268,
337270,
337305,
337367,
337440,
337463,
337465,
337542,
337596,
337607,
337637,
337651,
337690,
337753,
337811,
337841,
337869,
337871,
337890,
337941,
338080,
338125,
338181,
338237,
338257,
338329,
338376,
338434,
338478,
338528,
338572,
338620,
338664,
338727,
338771,
338830,
338874,
338939,
338983,
339030,
339087,
339144,
339160,
339227,
339273,
339324,
339382,
339440,
339458,
339512,
339565,
339613,
339661,
339705,
339756,
339817,
339861,
339922,
339966,
340026,
340070,
340127,
340171,
340192,
340206,
340275,
340291,
340329,
340340,
340461,
340676,
340879,
340930,
340981,
340997,
341011,
341020,
341037,
341043,
341051,
341062,
341069,
341090,
341104,
341160,
341177,
341245,
341289,
341350,
341388,
341885,
341988,
342033,
342081,
342089,
342181,
342229,
342280,
342288,
342358,
342375,
342464,
342481,
342493,
342560,
342627,
342694,
342761,
342828,
342895,
342962,
343029,
343096,
343163,
343230,
343247,
343336,
343353,
343365,
343432,
343499,
343566,
343633,
343700,
343767,
343834,
343901,
343968,
344035,
344102,
344119,
344208,
344225,
344237,
344304,
344371,
344438,
344505,
344572,
344639,
344706,
344773,
344840,
344907,
344974,
345041,
345108,
345175,
345242,
345309,
345336,
345425,
345442,
345454,
345521,
345588,
345655,
345722,
345789,
345856,
345923,
345990,
346057,
346124,
346191,
346258,
346325,
346392,
346459,
346526,
346583,
346672,
346689,
346701,
346768,
346835,
346902,
346969,
347036,
347103,
347170,
347237,
347304,
347371,
347438,
347505,
347572,
347639,
347706,
347773,
347820,
347909,
347926,
347938,
348005,
348072,
348139,
348206,
348273,
348340,
348407,
348474,
348541,
348608,
348675,
348742,
348809,
348876,
348943,
349010,
349077,
349144,
349233,
349250,
349263,
349330,
349397,
349464,
349531,
349598,
349665,
349732,
349799,
349866,
349933,
350000,
350067,
350134,
350201,
350268,
350335,
350402,
350469,
350536,
350603,
350670,
350737,
350804,
350871,
350938,
351005,
351072,
351139,
351206,
351273,
351340,
351407,
351474,
351541,
351608,
351675,
351742,
351809,
351876,
351943,
352010,
352077,
352144,
352211,
352278,
352345,
352412,
352479,
352546,
352613,
352680,
352747,
352814,
352881,
352948,
353015,
353082,
353149,
353216,
353283,
353350,
353417,
353484,
353551,
353618,
353685,
353752,
353819,
353886,
353953,
354020,
354087,
354154,
354221,
354288,
354355,
354422,
354489,
354556,
354623,
354690,
354757,
354824,
354891,
354958,
355025,
355092,
355159,
355226,
355293,
355360,
355427,
355494,
355561,
355628,
355695,
355762,
355829,
355896,
355963,
356030,
356097,
356164,
356231,
356298,
356365,
356432,
356499,
356566,
356633,
356695,
356784,
356801,
356814,
356881,
356948,
357015,
357082,
357149,
357216,
357283,
357350,
357417,
357484,
357551,
357618,
357685,
357752,
357819,
357886,
357953,
358020,
358087,
358154,
358221,
358288,
358355,
358422,
358489,
358556,
358623,
358690,
358757,
358824,
358891,
358958,
359025,
359092,
359159,
359226,
359293,
359360,
359427,
359494,
359561,
359628,
359695,
359762,
359829,
359896,
359963,
360030,
360097,
360164,
360231,
360298,
360365,
360432,
360499,
360566,
360633,
360700,
360767,
360834,
360901,
360968,
361035,
361102,
361169,
361236,
361303,
361370,
361437,
361504,
361571,
361638,
361705,
361772,
361839,
361906,
361973,
362040,
362107,
362174,
362241,
362308,
362375,
362442,
362509,
362576,
362643,
362710,
362777,
362844,
362911,
362978,
363045,
363112,
363179,
363246,
363313,
363380,
363447,
363514,
363581,
363648,
363715,
363782,
363849,
363916,
363983,
364050,
364117,
364184,
364251,
364318,
364385,
364452,
364519,
364586,
364653,
364720,
364787,
364854,
364921,
364988,
365055,
365122,
365189,
365256,
365323,
365390,
365457,
365524,
365591,
365658,
365725,
365792,
365859,
365926,
365993,
366060,
366127,
366194,
366261,
366328,
366395,
366462,
366529,
366596,
366663,
366730,
366797,
366864,
366931,
366998,
367065,
367132,
367199,
367266,
367333,
367400,
367467,
367534,
367601,
367668,
367735,
367802,
367869,
367936,
367998,
368051,
368104,
368151,
368153,
368182,
368252,
368255,
368257,
368353,
368425,
368465,
368543,
368593,
368596,
368598,
368655,
368737,
368787,
368790,
368792,
368836,
368899,
368950,
368953,
368955,
368995,
369054,
369116,
369119,
369121,
369167,
369232,
369295,
369367,
369370,
369372,
369415,
369494,
369522,
369525,
369527,
369563,
369626,
369656,
369678,
369681,
369683,
369755,
369773,
369776,
369778,
369806,
369849,
369868,
369871,
369873,
369895,
369925,
369928,
369930,
369962,
369992,
369995,
369997,
370060,
370080,
370142,
370145,
370147,
370173,
370190,
370224,
370268,
370296,
370299,
370301,
370324,
370364,
370367,
370369,
370393,
370412,
370426,
370429,
370431,
370472,
370535,
370584,
370632,
370655,
370658,
370660,
370747,
370833,
370895,
370945,
370948,
370950,
370985,
371014,
371041,
371069,
371090,
371108,
371171,
371216,
371235,
371238,
371240,
371285,
371372,
371375,
371377,
371413,
371447
],
"line_end_idx": [
48,
77,
109,
166,
235,
296,
349,
358,
372,
413,
480,
564,
582,
630,
654,
694,
704,
714,
736,
752,
765,
830,
894,
931,
976,
1011,
1059,
1105,
1147,
1187,
1230,
1271,
1285,
1302,
1321,
1339,
1357,
1377,
1395,
1412,
1428,
1448,
1466,
1484,
1501,
1521,
1540,
1557,
1574,
1623,
1672,
1716,
1786,
1867,
1945,
2015,
2039,
2067,
2105,
2151,
2184,
2225,
2264,
2298,
2330,
2356,
2373,
2390,
2409,
2473,
2475,
2539,
2541,
2605,
2607,
2664,
2692,
2694,
2747,
2808,
2846,
2848,
2911,
2971,
3031,
3094,
3153,
3174,
3176,
3178,
3242,
3244,
3283,
3285,
3349,
3351,
3404,
3429,
3431,
3489,
3491,
3524,
3526,
3596,
3664,
3666,
3719,
3781,
3842,
3902,
3930,
3932,
3967,
3969,
4028,
4085,
4144,
4185,
4187,
4246,
4303,
4362,
4404,
4406,
4408,
4472,
4474,
4515,
4517,
4581,
4583,
4599,
4601,
4655,
4703,
4757,
4809,
4861,
4863,
4917,
4970,
5026,
5047,
5049,
5058,
5120,
5122,
5143,
5196,
5209,
5242,
5244,
5254,
5256,
5295,
5347,
5363,
5376,
5406,
5408,
5416,
5418,
5472,
5527,
5573,
5626,
5642,
5695,
5742,
5756,
5808,
5824,
5836,
5865,
5867,
5869,
5933,
5935,
5979,
5981,
6045,
6125,
6200,
6202,
6265,
6328,
6386,
6388,
6450,
6513,
6527,
6529,
6587,
6646,
6657,
6659,
6723,
6769,
6771,
6809,
6811,
6813,
6848,
6883,
6885,
6947,
7011,
7075,
7107,
7109,
7111,
7173,
7198,
7200,
7255,
7310,
7348,
7350,
7401,
7457,
7487,
7489,
7541,
7595,
7603,
7662,
7735,
7737,
7739,
7796,
7842,
7844,
7898,
7948,
8000,
8016,
8018,
8069,
8105,
8107,
8159,
8215,
8268,
8307,
8309,
8359,
8399,
8401,
8454,
8510,
8518,
8520,
8522,
8558,
8594,
8596,
8659,
8684,
8686,
8743,
8798,
8828,
8830,
8886,
8940,
8997,
9050,
9107,
9158,
9212,
9253,
9255,
9310,
9346,
9348,
9403,
9413,
9415,
9446,
9448,
9503,
9560,
9616,
9672,
9674,
9676,
9709,
9742,
9744,
9801,
9860,
9916,
9974,
10031,
10062,
10064,
10066,
10128,
10153,
10155,
10209,
10254,
10332,
10404,
10484,
10559,
10561,
10612,
10658,
10712,
10731,
10733,
10787,
10840,
10842,
10867,
10869,
10921,
10956,
10958,
11005,
11061,
11092,
11094,
11150,
11172,
11174,
11230,
11283,
11340,
11392,
11394,
11451,
11497,
11499,
11501,
11557,
11559,
11615,
11660,
11662,
11713,
11758,
11811,
11889,
11965,
12038,
12040,
12094,
12144,
12146,
12171,
12173,
12229,
12242,
12244,
12295,
12297,
12345,
12347,
12361,
12363,
12365,
12428,
12453,
12455,
12515,
12577,
12579,
12634,
12665,
12693,
12695,
12747,
12801,
12858,
12860,
12916,
12931,
12933,
12989,
13012,
13014,
13053,
13055,
13105,
13161,
13206,
13267,
13314,
13361,
13423,
13482,
13485,
13492,
13519,
13526,
13566,
13570,
13572,
13630,
13691,
13694,
13701,
13739,
13746,
13788,
13790,
13797,
13837,
13844,
13886,
13890,
13892,
13942,
13992,
14012,
14014,
14072,
14119,
14122,
14129,
14164,
14171,
14173,
14224,
14310,
14372,
14379,
14411,
14413,
14490,
14544,
14581,
14583,
14590,
14635,
14642,
14644,
14705,
14744,
14784,
14824,
14866,
14905,
14945,
14986,
15031,
15076,
15113,
15154,
15197,
15239,
15278,
15323,
15360,
15401,
15444,
15486,
15488,
15556,
15591,
15626,
15628,
15692,
15730,
15768,
15770,
15849,
15864,
15900,
15936,
15938,
15986,
16034,
16082,
16130,
16178,
16226,
16274,
16322,
16370,
16418,
16466,
16514,
16562,
16610,
16658,
16706,
16754,
16802,
16850,
16898,
16900,
16902,
16909,
16957,
16964,
16966,
17043,
17112,
17158,
17204,
17267,
17274,
17346,
17423,
17471,
17478,
17518,
17520,
17527,
17553,
17596,
17603,
17644,
17693,
17695,
17702,
17784,
17857,
17864,
17908,
17910,
17917,
17960,
18003,
18023,
18025,
18051,
18082,
18089,
18116,
18120,
18169,
18171,
18217,
18263,
18303,
18306,
18313,
18342,
18349,
18397,
18399,
18406,
18465,
18472,
18502,
18504,
18511,
18540,
18546,
18578,
18621,
18687,
18693,
18760,
18767,
18843,
18887,
18964,
18966,
18973,
19002,
19009,
19071,
19073,
19080,
19152,
19198,
19244,
19307,
19315,
19394,
19444,
19500,
19503,
19505,
19544,
19547,
19616,
19618,
19638,
19662,
19670,
19749,
19799,
19856,
19859,
19924,
19965,
20021,
20072,
20074,
20098,
20137,
20169,
20171,
20235,
20277,
20279,
20348,
20350,
20423,
20462,
20482,
20553,
20624,
20694,
20759,
20782,
20789,
20791,
20851,
20872,
20916,
20923,
20925,
20973,
20975,
20996,
21046,
21103,
21105,
21155,
21206,
21263,
21265,
21319,
21376,
21378,
21421,
21430,
21487,
21567,
21622,
21669,
21719,
21791,
21856,
21872,
21874,
21931,
22002,
22059,
22075,
22077,
22131,
22140,
22208,
22268,
22293,
22313,
22402,
22457,
22459,
22533,
22569,
22619,
22668,
22670,
22709,
22756,
22824,
22879,
22920,
22981,
23037,
23053,
23094,
23109,
23111,
23164,
23172,
23240,
23300,
23325,
23345,
23434,
23489,
23491,
23565,
23601,
23651,
23700,
23702,
23741,
23787,
23854,
23909,
23950,
24010,
24066,
24082,
24123,
24139,
24141,
24196,
24205,
24274,
24331,
24347,
24356,
24358,
24415,
24424,
24495,
24555,
24580,
24600,
24689,
24744,
24746,
24820,
24856,
24906,
24955,
24957,
24996,
25046,
25117,
25172,
25213,
25274,
25330,
25346,
25387,
25403,
25405,
25462,
25471,
25542,
25602,
25627,
25647,
25736,
25791,
25793,
25867,
25903,
25953,
26002,
26004,
26043,
26092,
26162,
26217,
26258,
26318,
26374,
26390,
26431,
26447,
26449,
26507,
26579,
26639,
26655,
26657,
26710,
26777,
26842,
26929,
26994,
27021,
27023,
27042,
27045,
27047,
27057,
27128,
27191,
27194,
27258,
27260,
27300,
27342,
27408,
27410,
27474,
27476,
27556,
27629,
27631,
27692,
27718,
27741,
27743,
27813,
27857,
27859,
27896,
27926,
27956,
27958,
27997,
28060,
28130,
28132,
28171,
28234,
28304,
28306,
28347,
28409,
28461,
28523,
28585,
28637,
28699,
28710,
28726,
28728,
28769,
28805,
28838,
28876,
28930,
28974,
29025,
29096,
29112,
29114,
29163,
29177,
29236,
29312,
29371,
29447,
29454,
29456,
29514,
29580,
29645,
29672,
29674,
29693,
29696,
29698,
29708,
29776,
29853,
29856,
29875,
29931,
29941,
29997,
29999,
30036,
30073,
30132,
30217,
30302,
30387,
30472,
30557,
30642,
30727,
30812,
30898,
30984,
31070,
31156,
31242,
31328,
31414,
31500,
31586,
31672,
31722,
31772,
31792,
31794,
31814,
31849,
31851,
31932,
31970,
31973,
32005,
32054,
32085,
32088,
32090,
32149,
32152,
32185,
32211,
32214,
32262,
32310,
32371,
32453,
32528,
32581,
32586,
32645,
32648,
32657,
32714,
32750,
32754,
32756,
32802,
32854,
32906,
32967,
33025,
33073,
33121,
33169,
33213,
33273,
33327,
33383,
33445,
33497,
33499,
33536,
33564,
33598,
33638,
33672,
33722,
33768,
33821,
33874,
33939,
33989,
34034,
34090,
34139,
34144,
34158,
34161,
34163,
34218,
34221,
34241,
34313,
34335,
34340,
34342,
34412,
34483,
34547,
34615,
34682,
34789,
34810,
34815,
34817,
34860,
34886,
34958,
35069,
35150,
35173,
35180,
35185,
35187,
35207,
35210,
35212,
35284,
35363,
35446,
35522,
35594,
35676,
35679,
35718,
35783,
35859,
35866,
35912,
35953,
35955,
35991,
36065,
36117,
36155,
36201,
36247,
36293,
36342,
36391,
36440,
36514,
36585,
36660,
36730,
36732,
36777,
36810,
36882,
36951,
37026,
37090,
37157,
37237,
37266,
37347,
37349,
37427,
37457,
37508,
37565,
37605,
37677,
37747,
37794,
37818,
37835,
37850,
37852,
37888,
37949,
37981,
38064,
38109,
38124,
38144,
38157,
38159,
38228,
38271,
38291,
38304,
38315,
38317,
38345,
38386,
38395,
38402,
38404,
38434,
38506,
38565,
38646,
38719,
38784,
38786,
38864,
38922,
38996,
39067,
39158,
39192,
39275,
39349,
39423,
39461,
39557,
39645,
39725,
39744,
39836,
39901,
39908,
39946,
40011,
40069,
40071,
40112,
40167,
40169,
40186,
40191,
40207,
40254,
40275,
40296,
40339,
40405,
40419,
40463,
40530,
40544,
40590,
40655,
40664,
40672,
40742,
40756,
40763,
40814,
40888,
40902,
40944,
41040,
41054,
41105,
41179,
41193,
41240,
41310,
41324,
41367,
41434,
41485,
41536,
41597,
41638,
41682,
41720,
41759,
41799,
41838,
41877,
41917,
41957,
42005,
42048,
42090,
42131,
42176,
42218,
42256,
42295,
42335,
42386,
42437,
42500,
42544,
42547,
42578,
42580,
42653,
42730,
42732,
42772,
42837,
42894,
42944,
42946,
42997,
43000,
43002,
43010,
43071,
43134,
43197,
43200,
43202,
43215,
43279,
43344,
43404,
43479,
43482,
43585,
43588,
43590,
43603,
43667,
43734,
43794,
43854,
43929,
43932,
43965,
43992,
44042,
44087,
44117,
44139,
44141,
44225,
44288,
44314,
44316,
44381,
44404,
44430,
44432,
44472,
44546,
44633,
44712,
44784,
44795,
44804,
44818,
44825,
44827,
44896,
44983,
45056,
45128,
45158,
45163,
45165,
45189,
45192,
45194,
45278,
45291,
45352,
45418,
45482,
45548,
45607,
45676,
45735,
45738,
45779,
45815,
45863,
45887,
45956,
46040,
46107,
46176,
46179,
46181,
46194,
46255,
46321,
46385,
46454,
46513,
46516,
46619,
46622,
46624,
46637,
46707,
46777,
46845,
46915,
46978,
47051,
47114,
47117,
47158,
47200,
47262,
47264,
47319,
47339,
47412,
47438,
47514,
47587,
47614,
47677,
47721,
47783,
47830,
47860,
47935,
47982,
48010,
48092,
48167,
48196,
48261,
48307,
48371,
48420,
48452,
48463,
48472,
48479,
48500,
48578,
48653,
48675,
48682,
48687,
48750,
48797,
48821,
48843,
48881,
48883,
48950,
48987,
49062,
49158,
49237,
49318,
49345,
49375,
49384,
49391,
49396,
49414,
49417,
49419,
49468,
49517,
49547,
49554,
49617,
49619,
49626,
49700,
49772,
49850,
49867,
49917,
49923,
49993,
50093,
50229,
50291,
50401,
50478,
50536,
50543,
50615,
50689,
50766,
50835,
50913,
51002,
51004,
51011,
51086,
51112,
51119,
51191,
51266,
51344,
51433,
51435,
51442,
51523,
51597,
51614,
51664,
51670,
51717,
51785,
51833,
51951,
52013,
52075,
52194,
52259,
52341,
52400,
52407,
52477,
52552,
52627,
52699,
52786,
52885,
52887,
52894,
52968,
52994,
53001,
53071,
53146,
53219,
53306,
53405,
53407,
53464,
53543,
53622,
53700,
53779,
53855,
53946,
54049,
54053,
54055,
54063,
54065,
54108,
54151,
54214,
54217,
54237,
54254,
54261,
54319,
54377,
54432,
54486,
54539,
54569,
54588,
54593,
54643,
54645,
54682,
54781,
54800,
54832,
54897,
54956,
54997,
55035,
55114,
55147,
55150,
55152,
55167,
55240,
55286,
55359,
55362,
55425,
55445,
55475,
55477,
55520,
55565,
55603,
55656,
55658,
55699,
55702,
55704,
55719,
55782,
55785,
55850,
55912,
55979,
56001,
56089,
56151,
56234,
56293,
56304,
56397,
56492,
56577,
56628,
56684,
56695,
56704,
56711,
56770,
56864,
56916,
56968,
56988,
57016,
57018,
57074,
57123,
57125,
57177,
57179,
57252,
57313,
57389,
57432,
57484,
57487,
57525,
57528,
57530,
57597,
57658,
57728,
57771,
57817,
57820,
57858,
57861,
57863,
57923,
58002,
58005,
58043,
58099,
58125,
58190,
58251,
58253,
58278,
58331,
58395,
58440,
58518,
58588,
58660,
58663,
58666,
58668,
58693,
58737,
58801,
58846,
58918,
58982,
59054,
59057,
59060,
59062,
59087,
59131,
59196,
59268,
59332,
59380,
59383,
59461,
59531,
59605,
59667,
59688,
59729,
59792,
59817,
59881,
59941,
59943,
59967,
60019,
60116,
60226,
60273,
60312,
60374,
60377,
60457,
60559,
60584,
60655,
60660,
60663,
60726,
60729,
60731,
60755,
60818,
60877,
60879,
60902,
60977,
61095,
61205,
61235,
61238,
61241,
61243,
61266,
61310,
61422,
61526,
61546,
61549,
61552,
61554,
61569,
61629,
61632,
61672,
61674,
61707,
61724,
61727,
61729,
61756,
61821,
61882,
61884,
61909,
61983,
62075,
62127,
62193,
62196,
62199,
62201,
62216,
62282,
62285,
62327,
62329,
62366,
62383,
62386,
62388,
62403,
62469,
62472,
62514,
62516,
62553,
62570,
62573,
62575,
62625,
62675,
62695,
62718,
62720,
62741,
62743,
62788,
62791,
62800,
62839,
62950,
63043,
63079,
63184,
63271,
63299,
63301,
63322,
63352,
63354,
63411,
63489,
63566,
63568,
63580,
63638,
63640,
63690,
63718,
63720,
63730,
63758,
63831,
63833,
63840,
63913,
63989,
64025,
64032,
64092,
64094,
64115,
64119,
64121,
64170,
64237,
64240,
64249,
64302,
64366,
64396,
64427,
64474,
64513,
64515,
64525,
64550,
64554,
64556,
64626,
64707,
64757,
64827,
64836,
64910,
64983,
65027,
65029,
65054,
65142,
65210,
65231,
65278,
65319,
65321,
65331,
65428,
65505,
65509,
65511,
65519,
65521,
65574,
65627,
65690,
65748,
65757,
65764,
65769,
65771,
65788,
65791,
65793,
65859,
65924,
65927,
65949,
65993,
66019,
66038,
66040,
66058,
66129,
66198,
66230,
66291,
66351,
66356,
66392,
66395,
66397,
66399,
66435,
66508,
66511,
66559,
66607,
66668,
66670,
66708,
66737,
66790,
66793,
66795,
66878,
66881,
66935,
66937,
66973,
66975,
67010,
67043,
67045,
67121,
67212,
67251,
67304,
67323,
67386,
67388,
67432,
67503,
67548,
67552,
67586,
67677,
67679,
67715,
67787,
67836,
67838,
67897,
67947,
67950,
67952,
68027,
68030,
68084,
68086,
68142,
68184,
68272,
68317,
68319,
68353,
68444,
68517,
68580,
68582,
68633,
68635,
68691,
68722,
68775,
68812,
68814,
68916,
69017,
69056,
69131,
69180,
69243,
69278,
69328,
69349,
69384,
69447,
69450,
69452,
69460,
69517,
69520,
69541,
69583,
69608,
69655,
69657,
69688,
69735,
69740,
69742,
69825,
69871,
69873,
69919,
69965,
70028,
70055,
70057,
70088,
70124,
70126,
70154,
70188,
70221,
70267,
70272,
70274,
70341,
70366,
70455,
70483,
70554,
70614,
70677,
70764,
70850,
70930,
70932,
70978,
71016,
71060,
71103,
71160,
71167,
71172,
71175,
71177,
71220,
71223,
71290,
71292,
71355,
71450,
71494,
71522,
71614,
71619,
71629,
71697,
71727,
71774,
71848,
71916,
71996,
72003,
72008,
72044,
72061,
72064,
72129,
72204,
72272,
72327,
72368,
72416,
72494,
72575,
72650,
72723,
72788,
72790,
72844,
72925,
72993,
73061,
73138,
73192,
73238,
73255,
73264,
73266,
73338,
73410,
73474,
73481,
73486,
73488,
73550,
73617,
73662,
73736,
73779,
73844,
73914,
73958,
73998,
74011,
74016,
74018,
74078,
74147,
74197,
74239,
74252,
74257,
74259,
74326,
74401,
74479,
74555,
74627,
74692,
74786,
74810,
74812,
74829,
74832,
74836,
74904,
74977,
75041,
75120,
75189,
75192,
75232,
75287,
75335,
75385,
75387,
75456,
75459,
75461,
75471,
75544,
75617,
75683,
75758,
75799,
75841,
75846,
75849,
75851,
75911,
75914,
75954,
76046,
76051,
76053,
76092,
76156,
76200,
76202,
76270,
76302,
76372,
76393,
76440,
76479,
76533,
76570,
76626,
76700,
76721,
76787,
76841,
76916,
76963,
76972,
76979,
77060,
77137,
77139,
77185,
77271,
77349,
77377,
77413,
77489,
77560,
77601,
77659,
77661,
77689,
77730,
77776,
77839,
77889,
77957,
78025,
78089,
78162,
78234,
78315,
78380,
78445,
78520,
78606,
78655,
78690,
78733,
78744,
78753,
78760,
78765,
78767,
78833,
78900,
78958,
78982,
79014,
79045,
79104,
79111,
79175,
79240,
79284,
79340,
79362,
79392,
79421,
79478,
79483,
79485,
79505,
79518,
79520,
79559,
79633,
79682,
79723,
79779,
79818,
79876,
79952,
79975,
80043,
80099,
80176,
80225,
80236,
80245,
80302,
80325,
80368,
80450,
80488,
80529,
80571,
80578,
80607,
80692,
80768,
80854,
80895,
80922,
80935,
80940,
80942,
80995,
81014,
81053,
81131,
81165,
81167,
81204,
81242,
81245,
81247,
81322,
81404,
81407,
81429,
81495,
81559,
81624,
81675,
81752,
81825,
81909,
81992,
82057,
82093,
82100,
82169,
82254,
82300,
82350,
82424,
82485,
82550,
82604,
82699,
82736,
82775,
82786,
82879,
82935,
82949,
83024,
83105,
83190,
83197,
83280,
83324,
83372,
83437,
83496,
83559,
83611,
83704,
83739,
83776,
83785,
83876,
83930,
83942,
84015,
84094,
84177,
84182,
84184,
84227,
84271,
84339,
84420,
84460,
84543,
84564,
84622,
84703,
84708,
84710,
84729,
84756,
84795,
84859,
84927,
85013,
85018,
85083,
85090,
85164,
85245,
85320,
85393,
85473,
85554,
85633,
85696,
85751,
85817,
85819,
85916,
85992,
86076,
86150,
86224,
86290,
86297,
86299,
86389,
86425,
86448,
86530,
86600,
86685,
86762,
86820,
86836,
86845,
86886,
86958,
86986,
87002,
87011,
87076,
87081,
87083,
87104,
87186,
87265,
87331,
87359,
87410,
87508,
87598,
87659,
87744,
87751,
87756,
87758,
87775,
87778,
87780,
87845,
87847,
87868,
87935,
87974,
88052,
88128,
88130,
88172,
88237,
88294,
88346,
88380,
88449,
88456,
88475,
88560,
88567,
88607,
88651,
88695,
88758,
88760,
88842,
88844,
88853,
88930,
88939,
88998,
89074,
89132,
89225,
89320,
89411,
89503,
89580,
89589,
89668,
89723,
89733,
89810,
89904,
89985,
90053,
90055,
90064,
90106,
90114,
90156,
90235,
90311,
90362,
90413,
90474,
90481,
90486,
90500,
90503,
90505,
90538,
90600,
90603,
90647,
90699,
90716,
90719,
90721,
90736,
90809,
90812,
90860,
90913,
90976,
90998,
91046,
91103,
91108,
91161,
91174,
91179,
91181,
91207,
91232,
91255,
91257,
91332,
91394,
91477,
91560,
91562,
91624,
91671,
91718,
91781,
91833,
91924,
91939,
91946,
91951,
91953,
92030,
92108,
92158,
92200,
92203,
92205,
92284,
92354,
92431,
92502,
92571,
92574,
92637,
92733,
92746,
92757,
92766,
92773,
92778,
92813,
92862,
92960,
93050,
93075,
93147,
93154,
93189,
93194,
93196,
93232,
93270,
93333,
93411,
93451,
93527,
93551,
93558,
93563,
93565,
93625,
93702,
93771,
93773,
93792,
93795,
93797,
93845,
93848,
93905,
93928,
93991,
93993,
94064,
94139,
94142,
94169,
94200,
94227,
94268,
94284,
94336,
94344,
94363,
94420,
94469,
94594,
94599,
94653,
94778,
94783,
94846,
94900,
94980,
95055,
95129,
95170,
95189,
95194,
95196,
95212,
95306,
95349,
95367,
95388,
95390,
95462,
95518,
95588,
95687,
95692,
95700,
95702,
95751,
95815,
95862,
95936,
96015,
96091,
96157,
96187,
96208,
96215,
96259,
96294,
96337,
96408,
96451,
96526,
96535,
96542,
96604,
96634,
96653,
96658,
96660,
96762,
96839,
96915,
96976,
97005,
97073,
97080,
97108,
97178,
97252,
97259,
97278,
97283,
97285,
97324,
97385,
97450,
97518,
97535,
97554,
97556,
97572,
97629,
97672,
97690,
97711,
97713,
97791,
97824,
97826,
97866,
97918,
97973,
98036,
98075,
98114,
98116,
98199,
98235,
98237,
98294,
98299,
98307,
98309,
98363,
98404,
98406,
98461,
98519,
98595,
98665,
98728,
98783,
98785,
98837,
98842,
98844,
98891,
98907,
98970,
99012,
99029,
99093,
99132,
99156,
99187,
99236,
99265,
99349,
99376,
99439,
99441,
99517,
99577,
99584,
99589,
99597,
99605,
99648,
99716,
99795,
99873,
99936,
99967,
100037,
100046,
100076,
100148,
100224,
100233,
100240,
100242,
100311,
100380,
100413,
100465,
100467,
100499,
100562,
100603,
100666,
100727,
100795,
100849,
100856,
100874,
100926,
100933,
100938,
100940,
100994,
101058,
101105,
101179,
101258,
101334,
101400,
101430,
101451,
101458,
101502,
101537,
101580,
101651,
101694,
101769,
101778,
101785,
101847,
101877,
101882,
101940,
102006,
102079,
102124,
102131,
102136,
102196,
102228,
102244,
102265,
102318,
102327,
102335,
102415,
102472,
102529,
102581,
102614,
102665,
102729,
102783,
102835,
102887,
102950,
102979,
102995,
103000,
103002,
103030,
103033,
103035,
103045,
103116,
103186,
103189,
103217,
103219,
103243,
103270,
103272,
103307,
103356,
103386,
103388,
103451,
103497,
103541,
103609,
103633,
103682,
103687,
103689,
103735,
103777,
103779,
103832,
103882,
103926,
103928,
103967,
104045,
104075,
104077,
104136,
104198,
104276,
104279,
104281,
104291,
104351,
104411,
104468,
104471,
104520,
104572,
104624,
104685,
104744,
104810,
104835,
104856,
104863,
104865,
104891,
104959,
105030,
105100,
105167,
105239,
105310,
105377,
105441,
105448,
105450,
105505,
105567,
105592,
105613,
105676,
105762,
105855,
105935,
105938,
106007,
106097,
106141,
106167,
106200,
106202,
106219,
106249,
106254,
106281,
106314,
106319,
106321,
106352,
106386,
106388,
106416,
106479,
106565,
106572,
106577,
106579,
106661,
106752,
106801,
106820,
106889,
106944,
107014,
107068,
107152,
107236,
107301,
107333,
107356,
107365,
107372,
107439,
107444,
107523,
107567,
107601,
107648,
107720,
107757,
107820,
107883,
107971,
108008,
108088,
108161,
108183,
108215,
108222,
108295,
108370,
108460,
108571,
108643,
108708,
108715,
108795,
108866,
108921,
108959,
109015,
109124,
109233,
109276,
109313,
109350,
109408,
109560,
109745,
109807,
109886,
109966,
110045,
110108,
110235,
110299,
110371,
110463,
110530,
110638,
110759,
110825,
110887,
110950,
111041,
111079,
111117,
111178,
111223,
111225,
111261,
111306,
111308,
111345,
111392,
111394,
111431,
111472,
111517,
111565,
111567,
111607,
111660,
111662,
111701,
111752,
111754,
111792,
111855,
111857,
111897,
111946,
111948,
111986,
112037,
112041,
112083,
112126,
112177,
112181,
112219,
112262,
112266,
112307,
112363,
112367,
112369,
112432,
112495,
112541,
112544,
112547,
112549,
112564,
112615,
112618,
112651,
112653,
112701,
112744,
112761,
112764,
112766,
112781,
112833,
112836,
112858,
112943,
112993,
113043,
113103,
113165,
113195,
113214,
113316,
113321,
113338,
113341,
113343,
113358,
113407,
113410,
113488,
113557,
113578,
113595,
113598,
113646,
113694,
113714,
113716,
113770,
113773,
113782,
113852,
113883,
113923,
113988,
114029,
114033,
114035,
114045,
114094,
114143,
114206,
114271,
114274,
114356,
114379,
114434,
114453,
114458,
114460,
114536,
114571,
114609,
114683,
114738,
114757,
114762,
114764,
114810,
114875,
114892,
114922,
114985,
114988,
114990,
115056,
115059,
115121,
115140,
115170,
115175,
115248,
115323,
115403,
115456,
115491,
115529,
115546,
115625,
115660,
115713,
115768,
115823,
115844,
115851,
115856,
115866,
115915,
115920,
115967,
115984,
115987,
115989,
116057,
116059,
116157,
116195,
116199,
116250,
116301,
116321,
116379,
116383,
116420,
116422,
116458,
116495,
116520,
116559,
116595,
116636,
116673,
116711,
116738,
116770,
116800,
116802,
116884,
116947,
117010,
117070,
117093,
117140,
117145,
117173,
117176,
117178,
117244,
117308,
117311,
117355,
117418,
117436,
117501,
117540,
117588,
117636,
117657,
117712,
117733,
117740,
117745,
117787,
117804,
117807,
117809,
117853,
117855,
117875,
117974,
118017,
118080,
118082,
118087,
118092,
118098,
118163,
118166,
118186,
118237,
118316,
118371,
118379,
118430,
118447,
118450,
118452,
118457,
118462,
118468,
118517,
118566,
118627,
118629,
118656,
118718,
118722,
118784,
118803,
118852,
118857,
118930,
118965,
119058,
119116,
119121,
119187,
119204,
119290,
119352,
119435,
119438,
119440,
119455,
119527,
119530,
119605,
119635,
119637,
119700,
119758,
119763,
119829,
119846,
119849,
119851,
119912,
119915,
119933,
119977,
119989,
120057,
120107,
120112,
120175,
120254,
120340,
120382,
120399,
120402,
120404,
120452,
120455,
120486,
120554,
120578,
120627,
120676,
120739,
120797,
120812,
120880,
120883,
120945,
120964,
120983,
120985,
121042,
121044,
121078,
121136,
121166,
121192,
121194,
121224,
121250,
121286,
121316,
121323,
121355,
121404,
121467,
121469,
121512,
121586,
121588,
121613,
121689,
121735,
121800,
121857,
121906,
121943,
121945,
121985,
121994,
122001,
122006,
122008,
122036,
122066,
122096,
122139,
122173,
122175,
122186,
122256,
122263,
122265,
122300,
122308,
122383,
122385,
122396,
122496,
122573,
122580,
122582,
122592,
122623,
122658,
122683,
122741,
122795,
122858,
122865,
122912,
122974,
123034,
123094,
123152,
123159,
123194,
123253,
123315,
123322,
123345,
123407,
123465,
123528,
123535,
123542,
123544,
123592,
123625,
123627,
123645,
123667,
123673,
123691,
123698,
123700,
123735,
123780,
123782,
123827,
123877,
123995,
124061,
124211,
124373,
124622,
124691,
124719,
124721,
124729,
124754,
124835,
124841,
124887,
124894,
124896,
124931,
124976,
124978,
125016,
125086,
125088,
125106,
125134,
125142,
125178,
125282,
125288,
125328,
125426,
125451,
125481,
125495,
125514,
125525,
125560,
125577,
125591,
125608,
125625,
125642,
125659,
125676,
125693,
125710,
125727,
125744,
125761,
125778,
125795,
125812,
125829,
125846,
125863,
125880,
125897,
125914,
125931,
125948,
125965,
125982,
125999,
126016,
126033,
126050,
126067,
126084,
126101,
126118,
126135,
126152,
126169,
126186,
126203,
126220,
126237,
126254,
126271,
126288,
126305,
126322,
126339,
126356,
126373,
126390,
126407,
126424,
126441,
126458,
126475,
126492,
126509,
126526,
126543,
126560,
126577,
126594,
126611,
126628,
126645,
126662,
126679,
126696,
126713,
126730,
126747,
126764,
126781,
126798,
126815,
126832,
126849,
126866,
126883,
126900,
126917,
126934,
126951,
126968,
126985,
127002,
127019,
127036,
127053,
127070,
127087,
127104,
127121,
127138,
127155,
127172,
127189,
127206,
127223,
127240,
127257,
127274,
127291,
127308,
127325,
127342,
127359,
127376,
127393,
127410,
127427,
127444,
127461,
127478,
127495,
127512,
127529,
127546,
127563,
127580,
127597,
127614,
127631,
127648,
127665,
127682,
127699,
127716,
127733,
127750,
127767,
127784,
127801,
127818,
127835,
127852,
127869,
127886,
127903,
127920,
127937,
127954,
127971,
127988,
128005,
128022,
128039,
128056,
128073,
128090,
128107,
128124,
128141,
128158,
128175,
128192,
128209,
128226,
128243,
128260,
128277,
128294,
128311,
128328,
128345,
128362,
128379,
128396,
128413,
128430,
128447,
128464,
128481,
128498,
128515,
128532,
128549,
128566,
128583,
128600,
128617,
128634,
128651,
128668,
128685,
128702,
128719,
128736,
128753,
128770,
128787,
128804,
128821,
128838,
128855,
128872,
128889,
128906,
128923,
128940,
128957,
128974,
128991,
129008,
129025,
129042,
129059,
129076,
129093,
129110,
129127,
129144,
129161,
129178,
129195,
129212,
129229,
129246,
129263,
129280,
129297,
129314,
129331,
129348,
129365,
129382,
129399,
129416,
129433,
129450,
129467,
129484,
129501,
129518,
129535,
129552,
129569,
129586,
129603,
129620,
129637,
129654,
129671,
129688,
129705,
129722,
129739,
129756,
129773,
129790,
129807,
129824,
129841,
129858,
129875,
129892,
129909,
129926,
129943,
129960,
129977,
129994,
130011,
130028,
130045,
130062,
130079,
130096,
130113,
130130,
130147,
130164,
130181,
130198,
130215,
130232,
130249,
130266,
130283,
130300,
130317,
130334,
130351,
130368,
130385,
130402,
130419,
130436,
130453,
130470,
130487,
130504,
130521,
130538,
130555,
130572,
130589,
130606,
130623,
130640,
130657,
130674,
130691,
130708,
130725,
130742,
130759,
130776,
130793,
130810,
130827,
130844,
130861,
130878,
130895,
130912,
130929,
130946,
130963,
130980,
130997,
131014,
131031,
131048,
131065,
131082,
131099,
131116,
131133,
131150,
131167,
131184,
131201,
131218,
131235,
131252,
131269,
131286,
131303,
131320,
131337,
131354,
131371,
131388,
131405,
131422,
131439,
131456,
131473,
131490,
131507,
131524,
131541,
131558,
131575,
131592,
131609,
131626,
131643,
131660,
131677,
131694,
131711,
131728,
131745,
131762,
131779,
131796,
131813,
131830,
131847,
131864,
131881,
131898,
131915,
131932,
131949,
131966,
131983,
132000,
132017,
132034,
132051,
132068,
132085,
132102,
132119,
132136,
132153,
132170,
132187,
132204,
132221,
132238,
132255,
132272,
132289,
132306,
132323,
132340,
132357,
132374,
132391,
132408,
132425,
132442,
132459,
132476,
132493,
132510,
132527,
132544,
132561,
132578,
132595,
132612,
132629,
132646,
132663,
132680,
132697,
132714,
132731,
132748,
132765,
132782,
132799,
132816,
132833,
132850,
132867,
132884,
132901,
132918,
132935,
132952,
132969,
132986,
133003,
133020,
133037,
133054,
133071,
133088,
133105,
133122,
133139,
133156,
133173,
133190,
133207,
133224,
133241,
133258,
133275,
133292,
133309,
133326,
133343,
133360,
133377,
133394,
133411,
133428,
133445,
133462,
133479,
133496,
133513,
133530,
133547,
133564,
133581,
133598,
133615,
133632,
133649,
133666,
133683,
133700,
133717,
133734,
133751,
133768,
133785,
133802,
133819,
133836,
133853,
133870,
133887,
133904,
133921,
133938,
133955,
133972,
133989,
134006,
134023,
134040,
134057,
134074,
134091,
134108,
134125,
134142,
134159,
134176,
134193,
134210,
134227,
134244,
134261,
134278,
134295,
134312,
134329,
134346,
134363,
134380,
134397,
134414,
134431,
134448,
134465,
134482,
134499,
134516,
134533,
134550,
134567,
134584,
134601,
134618,
134635,
134652,
134669,
134686,
134703,
134720,
134737,
134754,
134771,
134788,
134805,
134822,
134839,
134856,
134873,
134890,
134907,
134924,
134941,
134958,
134975,
134992,
135009,
135026,
135043,
135060,
135077,
135094,
135111,
135128,
135145,
135162,
135179,
135196,
135213,
135230,
135247,
135264,
135281,
135298,
135315,
135332,
135349,
135366,
135383,
135400,
135417,
135434,
135451,
135468,
135485,
135502,
135519,
135536,
135553,
135570,
135587,
135604,
135621,
135638,
135655,
135672,
135689,
135706,
135723,
135740,
135757,
135774,
135791,
135808,
135825,
135842,
135859,
135876,
135893,
135910,
135927,
135944,
135961,
135978,
135995,
136012,
136029,
136046,
136063,
136080,
136097,
136114,
136131,
136148,
136165,
136182,
136199,
136216,
136233,
136250,
136267,
136284,
136301,
136318,
136335,
136352,
136369,
136386,
136403,
136420,
136437,
136454,
136471,
136488,
136505,
136522,
136539,
136556,
136573,
136590,
136607,
136624,
136641,
136658,
136675,
136692,
136709,
136726,
136743,
136760,
136777,
136794,
136811,
136828,
136845,
136862,
136879,
136896,
136913,
136930,
136947,
136964,
136981,
136998,
137015,
137032,
137049,
137066,
137083,
137100,
137117,
137134,
137151,
137168,
137185,
137202,
137219,
137236,
137253,
137270,
137287,
137304,
137321,
137338,
137355,
137372,
137389,
137406,
137423,
137440,
137457,
137474,
137491,
137508,
137525,
137542,
137559,
137576,
137593,
137610,
137627,
137644,
137661,
137678,
137695,
137712,
137729,
137746,
137763,
137780,
137797,
137814,
137831,
137848,
137865,
137882,
137899,
137916,
137933,
137950,
137967,
137984,
138001,
138018,
138035,
138052,
138069,
138086,
138103,
138120,
138137,
138154,
138171,
138188,
138205,
138222,
138239,
138256,
138273,
138290,
138307,
138324,
138341,
138358,
138375,
138392,
138409,
138426,
138443,
138460,
138477,
138494,
138511,
138528,
138545,
138562,
138579,
138596,
138613,
138630,
138647,
138664,
138681,
138698,
138715,
138732,
138749,
138766,
138783,
138800,
138817,
138834,
138851,
138868,
138885,
138902,
138919,
138936,
138953,
138970,
138987,
139004,
139021,
139038,
139055,
139072,
139089,
139106,
139123,
139140,
139157,
139174,
139191,
139208,
139225,
139242,
139259,
139276,
139293,
139310,
139327,
139344,
139361,
139378,
139395,
139412,
139429,
139446,
139463,
139480,
139497,
139514,
139531,
139548,
139565,
139582,
139599,
139616,
139633,
139650,
139667,
139684,
139701,
139718,
139735,
139752,
139769,
139786,
139803,
139820,
139837,
139854,
139871,
139888,
139905,
139922,
139939,
139956,
139973,
139990,
140007,
140024,
140041,
140058,
140075,
140092,
140109,
140126,
140143,
140160,
140177,
140194,
140211,
140228,
140245,
140262,
140279,
140296,
140313,
140330,
140347,
140364,
140381,
140398,
140415,
140432,
140449,
140466,
140483,
140500,
140517,
140534,
140551,
140568,
140585,
140602,
140619,
140636,
140653,
140670,
140687,
140704,
140721,
140738,
140755,
140772,
140789,
140806,
140823,
140840,
140857,
140874,
140891,
140908,
140925,
140942,
140959,
140976,
140993,
141010,
141027,
141044,
141061,
141078,
141095,
141112,
141129,
141146,
141163,
141180,
141197,
141214,
141231,
141248,
141265,
141282,
141299,
141316,
141333,
141350,
141367,
141384,
141401,
141418,
141435,
141452,
141469,
141486,
141503,
141520,
141537,
141554,
141571,
141588,
141605,
141622,
141639,
141656,
141673,
141690,
141707,
141724,
141741,
141758,
141775,
141792,
141809,
141826,
141843,
141860,
141877,
141894,
141911,
141928,
141945,
141962,
141979,
141996,
142013,
142030,
142047,
142064,
142081,
142098,
142115,
142132,
142149,
142166,
142183,
142200,
142217,
142234,
142251,
142268,
142285,
142302,
142319,
142336,
142353,
142370,
142387,
142404,
142421,
142438,
142455,
142472,
142489,
142506,
142523,
142540,
142557,
142574,
142591,
142608,
142625,
142642,
142659,
142676,
142693,
142710,
142727,
142744,
142761,
142778,
142795,
142812,
142829,
142846,
142863,
142880,
142897,
142914,
142931,
142948,
142965,
142982,
142999,
143016,
143033,
143050,
143067,
143084,
143101,
143118,
143135,
143152,
143169,
143186,
143203,
143220,
143237,
143254,
143271,
143288,
143305,
143322,
143339,
143356,
143373,
143390,
143407,
143424,
143441,
143458,
143475,
143492,
143509,
143526,
143543,
143560,
143577,
143594,
143611,
143628,
143645,
143662,
143679,
143696,
143713,
143730,
143747,
143764,
143781,
143798,
143815,
143832,
143849,
143866,
143883,
143900,
143917,
143934,
143951,
143968,
143985,
144002,
144019,
144036,
144053,
144070,
144087,
144104,
144121,
144138,
144155,
144256,
144357,
144458,
144559,
144660,
144761,
144862,
144963,
145064,
145165,
145266,
145367,
145468,
145569,
145670,
145771,
145872,
145973,
146074,
146175,
146276,
146377,
146478,
146579,
146680,
146781,
146882,
146983,
147084,
147185,
147286,
147387,
147488,
147589,
147690,
147791,
147892,
147993,
148094,
148195,
148296,
148397,
148498,
148599,
148700,
148801,
148902,
149004,
149025,
149114,
149131,
149143,
149210,
149277,
149344,
149411,
149478,
149545,
149612,
149679,
149746,
149813,
149880,
149947,
150014,
150081,
150093,
150130,
150167,
150228,
150311,
150324,
150371,
150444,
150488,
150536,
150581,
150583,
150624,
150670,
150769,
150814,
150934,
151060,
151180,
151295,
151297,
151323,
151368,
151415,
151516,
151613,
151615,
151650,
151775,
151838,
151886,
151944,
151995,
152051,
152099,
152159,
152208,
152265,
152316,
152318,
152341,
152471,
152473,
152512,
152612,
152614,
152668,
152731,
152789,
152791,
152826,
152875,
152927,
152979,
153031,
153034,
153074,
153114,
153155,
153195,
153236,
153276,
153317,
153357,
153398,
153439,
153481,
153522,
153564,
153605,
153647,
153688,
153730,
153732,
153785,
153835,
153837,
153939,
153941,
154034,
154036,
154099,
154175,
154229,
154231,
154286,
154334,
154382,
154440,
154442,
154498,
154528,
154568,
154570,
154643,
154702,
154737,
154785,
154787,
154834,
154881,
154930,
154978,
155027,
155029,
155079,
155128,
155177,
155225,
155274,
155324,
155326,
155402,
155447,
155493,
155540,
155590,
155638,
155690,
155742,
155789,
155791,
155856,
155910,
155961,
155963,
156045,
156081,
156140,
156196,
156239,
156241,
156319,
156364,
156366,
156425,
156502,
156530,
156558,
156582,
156628,
156674,
156720,
156766,
156812,
156858,
156904,
156950,
156996,
156998,
157085,
157176,
157263,
157350,
157439,
157529,
157620,
157713,
157806,
157902,
157989,
157991,
157999,
158030,
158061,
158122,
158192,
158264,
158337,
158411,
158413,
158489,
158564,
158634,
158704,
158706,
158778,
158851,
158859,
158902,
158945,
158965,
158983,
159006,
159030,
159058,
159061,
159063,
159077,
159095,
159118,
159144,
159167,
159195,
159198,
159200,
159228,
159256,
159259,
159261,
159304,
159347,
159367,
159373,
159464,
159466,
159496,
159532,
159606,
159640,
159676,
159741,
159806,
159872,
159885,
159922,
159967,
159984,
159995,
160038,
160040,
160061,
160075,
160115,
160132,
160155,
160157,
160179,
160214,
160251,
160254,
160333,
160409,
160465,
160496,
160499,
160577,
160653,
160725,
160737,
160740,
160785,
160788,
160837,
160872,
160947,
160994,
160997,
161016,
161019,
161094,
161170,
161246,
161324,
161402,
161479,
161554,
161632,
161710,
161787,
161844,
161847,
161880,
161882,
161946,
161948,
161994,
162071,
162113,
162116,
162188,
162267,
162282,
162362,
162404,
162457,
162491,
162570,
162580,
162596,
162598,
162620,
162650,
162687,
162712,
162714,
162757,
162782,
162876,
162976,
162988,
163030,
163077,
163093,
163145,
163165,
163182,
163205,
163207,
163223,
163284,
163357,
163374,
163388,
163401,
163448,
163495,
163515,
163568,
163624,
163668,
163718,
163776,
163837,
163883,
163926,
163975,
164032,
164085,
164146,
164206,
164245,
164290,
164343,
164399,
164438,
164483,
164536,
164558,
164609,
164653,
164688,
164729,
164778,
164820,
164866,
164909,
164958,
165015,
165065,
165123,
165187,
165226,
165271,
165325,
165383,
165424,
165470,
165524,
165546,
165601,
165664,
165730,
165758,
165810,
165870,
165933,
165961,
166015,
166077,
166135,
166201,
166272,
166322,
166380,
166464,
166492,
166543,
166602,
166664,
166686,
166743,
166799,
166838,
166883,
166936,
166996,
167041,
167083,
167128,
167178,
167211,
167264,
167322,
167391,
167417,
167467,
167521,
167583,
167646,
167654,
167691,
167738,
167785,
167805,
167813,
167821,
167865,
167893,
167914,
167918,
167977,
168030,
168077,
168123,
168191,
168259,
168310,
168352,
168411,
168459,
168510,
168552,
168611,
168659,
168704,
168749,
168795,
168822,
168874,
168921,
168962,
168973,
168989,
169013,
169070,
169127,
169183,
169218,
169253,
169264,
169319,
169372,
169388,
169395,
169401,
169403,
169429,
169456,
169482,
169558,
169606,
169613,
169615,
169639,
169711,
169744,
169799,
169877,
169932,
170004,
170074,
170093,
170104,
170113,
170177,
170184,
170190,
170192,
170199,
170243,
170287,
170309,
170441,
170540,
170611,
170683,
170753,
170823,
170825,
170902,
170988,
171105,
171204,
171275,
171345,
171379,
171468,
171538,
171555,
171557,
171593,
171637,
171676,
171715,
171766,
171788,
171891,
171894,
171896,
171928,
172022,
172025,
172027,
172075,
172107,
172206,
172209,
172270,
172313,
172316,
172340,
172362,
172365,
172367,
172396,
172418,
172421,
172423,
172470,
172498,
172501,
172503,
172541,
172579,
172599,
172674,
172752,
172830,
172907,
172964,
172967,
173000,
173002,
173035,
173063,
173116,
173172,
173225,
173227,
173243,
173313,
173315,
173381,
173383,
173419,
173421,
173450,
173501,
173534,
173570,
173596,
173617,
173639,
173664,
173691,
173725,
173751,
173753,
173812,
173838,
173840,
173916,
173918,
173949,
173951,
173992,
174029,
174031,
174049,
174081,
174089,
174091,
174110,
174138,
174146,
174148,
174153,
174235,
174281,
174285,
174287,
174326,
174329,
174411,
174474,
174531,
174557,
174612,
174622,
174680,
174685,
174688,
174690,
174724,
174747,
174809,
174907,
174966,
174968,
175026,
175075,
175134,
175184,
175190,
175232,
175280,
175286,
175335,
175373,
175414,
175420,
175502,
175535,
175541,
175568,
175574,
175576,
175602,
175627,
175642,
175648,
175723,
175762,
175768,
175839,
175913,
175948,
175954,
175982,
175987,
175991,
175993,
176011,
176016,
176083,
176135,
176140,
176189,
176192,
176216,
176264,
176384,
176468,
176543,
176545,
176567,
176644,
176725,
176751,
176755,
176778,
176780,
176880,
176927,
176980,
176985,
176987,
177097,
177099,
177170,
177218,
177288,
177290,
177317,
177372,
177434,
177500,
177505,
177507,
177544,
177582,
177586,
177595,
177624,
177642,
177669,
177697,
177699,
177749,
177808,
177810,
177887,
177966,
178041,
178059,
178125,
178127,
178187,
178255,
178323,
178389,
178423,
178486,
178488,
178565,
178640,
178721,
178799,
178880,
178944,
179012,
179039,
179098,
179153,
179155,
179211,
179264,
179298,
179312,
179314,
179333,
179362,
179427,
179509,
179590,
179598,
179601,
179603,
179631,
179634,
179643,
179668,
179673,
179688,
179739,
179757,
179796,
179801,
179803,
179829,
179864,
179866,
179894,
179919,
179921,
180020,
180123,
180187,
180212,
180252,
180308,
180355,
180418,
180504,
180576,
180607,
180622,
180629,
180634,
180636,
180654,
180677,
180699,
180773,
180780,
180796,
180869,
180909,
180933,
181007,
181014,
181037,
181064,
181138,
181146,
181154,
181167,
181169,
181247,
181267,
181289,
181347,
181410,
181421,
181461,
181473,
181478,
181481,
181483,
181516,
181519,
181568,
181642,
181693,
181696,
181698,
181734,
181737,
181789,
181866,
181917,
181920,
181922,
181946,
181949,
181958,
182008,
182049,
182054,
182117,
182156,
182165,
182225,
182231,
182246,
182251,
182254,
182256,
182281,
182314,
182317,
182385,
182407,
182430,
182448,
182453,
182470,
182473,
182475,
182500,
182503,
182534,
182547,
182552,
182570,
182620,
182648,
182664,
182739,
182758,
182785,
182792,
182846,
182848,
182872,
182907,
182960,
183010,
183038,
183059,
183073,
183106,
183119,
183175,
183196,
183282,
183350,
183365,
183401,
183481,
183562,
183639,
183720,
183770,
183852,
183913,
183995,
184046,
184070,
184072,
184126,
184180,
184258,
184308,
184310,
184334,
184341,
184346,
184348,
184374,
184403,
184406,
184454,
184456,
184498,
184503,
184537,
184571,
184573,
184611,
184660,
184729,
184731,
184770,
184809,
184823,
184835,
184851,
184853,
184873,
184882,
184904,
184992,
185040,
185086,
185101,
185166,
185192,
185250,
185325,
185405,
185420,
185438,
185463,
185568,
185616,
185662,
185677,
185742,
185768,
185826,
185901,
185984,
185999,
186017,
186042,
186114,
186141,
186153,
186222,
186279,
186376,
186405,
186471,
186483,
186511,
186571,
186632,
186694,
186708,
186804,
186816,
186868,
186931,
187004,
187081,
187184,
187198,
187262,
187313,
187366,
187381,
187394,
187412,
187421,
187423,
187441,
187446,
187448,
187488,
187491,
187510,
187573,
187615,
187663,
187671,
187677,
187693,
187699,
187702,
187704,
187755,
187831,
187836,
187894,
187941,
187988,
188026,
188049,
188108,
188129,
188169,
188212,
188217,
188219,
188257,
188260,
188298,
188348,
188355,
188409,
188470,
188477,
188480,
188482,
188514,
188517,
188597,
188600,
188602,
188633,
188636,
188681,
188728,
188731,
188733,
188785,
188788,
188887,
188990,
189061,
189063,
189081,
189105,
189164,
189209,
189267,
189322,
189381,
189383,
189446,
189487,
189489,
189529,
189531,
189600,
189617,
189665,
189667,
189703,
189779,
189809,
189888,
189953,
189979,
190029,
190095,
190163,
190225,
190259,
190299,
190336,
190338,
190357,
190386,
190394,
190399,
190401,
190438,
190476,
190478,
190502,
190520,
190541,
190580,
190617,
190622,
190687,
190714,
190716,
190753,
190799,
190818,
190826,
190829,
190831,
190836,
190918,
190995,
191077,
191156,
191238,
191289,
191293,
191371,
191430,
191435,
191514,
191592,
191606,
191610,
191685,
191762,
191841,
191857,
191862,
191897,
191900,
191919,
191996,
192084,
192169,
192171,
192252,
192331,
192363,
192418,
192470,
192528,
192583,
192647,
192708,
192769,
192831,
192907,
192909,
192984,
193064,
193087,
193123,
193125,
193202,
193279,
193306,
193316,
193360,
193404,
193447,
193491,
193536,
193585,
193631,
193690,
193695,
193703,
193706,
193708,
193726,
193729,
193751,
193756,
193846,
193901,
193958,
194050,
194109,
194148,
194153,
194187,
194218,
194224,
194226,
194261,
194266,
194293,
194345,
194397,
194480,
194535,
194566,
194572,
194574,
194608,
194613,
194722,
194724,
194796,
194855,
194920,
194988,
195038,
195063,
195117,
195168,
195227,
195287,
195289,
195341,
195417,
195472,
195485,
195496,
195505,
195507,
195575,
195646,
195683,
195706,
195729,
195777,
195847,
195871,
195928,
195930,
195986,
195991,
195995,
195997,
196018,
196099,
196132,
196153,
196158,
196228,
196234,
196236,
196259,
196264,
196336,
196342,
196344,
196425,
196466,
196468,
196545,
196617,
196682,
196750,
196811,
196877,
196917,
196985,
197042,
197086,
197092,
197094,
197169,
197238,
197280,
197338,
197387,
197443,
197472,
197479,
197485,
197487,
197538,
197619,
197686,
197755,
197757,
197813,
197867,
197918,
197920,
197992,
198054,
198103,
198118,
198120,
198131,
198203,
198279,
198296,
198305,
198323,
198381,
198388,
198390,
198455,
198546,
198572,
198643,
198645,
198669,
198732,
198808,
198867,
198878,
198880,
198939,
199019,
199096,
199172,
199248,
199310,
199317,
199323,
199325,
199352,
199425,
199479,
199530,
199608,
199610,
199686,
199763,
199788,
199816,
199822,
199824,
199856,
199935,
199955,
199970,
199972,
200028,
200072,
200074,
200143,
200218,
200265,
200267,
200341,
200411,
200471,
200476,
200480,
200482,
200510,
200513,
200544,
200589,
200617,
200644,
200646,
200700,
200754,
200823,
200830,
200836,
200887,
200939,
201003,
201064,
201070,
201074,
201076,
201112,
201150,
201156,
201158,
201165,
201235,
201242,
201285,
201334,
201338,
201368,
201370,
201398,
201441,
201451,
201454,
201511,
201592,
201644,
201694,
201696,
201776,
201813,
201854,
201860,
201930,
201970,
202040,
202046,
202092,
202176,
202263,
202268,
202301,
202327,
202374,
202406,
202409,
202411,
202441,
202523,
202569,
202571,
202588,
202609,
202630,
202654,
202656,
202738,
202782,
202784,
202791,
202846,
202853,
202884,
202930,
202994,
202996,
203029,
203093,
203155,
203217,
203224,
203226,
203252,
203258,
203260,
203267,
203338,
203345,
203392,
203447,
203449,
203522,
203549,
203583,
203617,
203619,
203634,
203641,
203645,
203703,
203727,
203757,
203802,
203839,
203901,
203961,
204014,
204056,
204141,
204155,
204180,
204189,
204247,
204269,
204276,
204278,
204349,
204368,
204452,
204454,
204518,
204559,
204594,
204596,
204665,
204689,
204716,
204749,
204756,
204758,
204838,
204872,
204918,
204962,
205008,
205010,
205047,
205080,
205113,
205119,
205121,
205203,
205239,
205241,
205248,
205298,
205305,
205339,
205365,
205371,
205373,
205380,
205427,
205434,
205473,
205499,
205505,
205507,
205589,
205609,
205611,
205687,
205691,
205730,
205769,
205791,
205793,
205850,
205965,
205967,
206006,
206143,
206145,
206212,
206284,
206355,
206401,
206455,
206478,
206506,
206558,
206611,
206685,
206735,
206786,
206808,
206882,
206934,
206989,
207047,
207105,
207119,
207121,
207161,
207325,
207405,
207595,
207701,
207731,
207745,
207747,
207780,
207782,
207832,
207921,
208009,
208102,
208177,
208233,
208276,
208324,
208354,
208400,
208471,
208504,
208558,
208625,
208688,
208746,
208766,
208826,
208860,
208881,
208955,
208974,
209004,
209049,
209102,
209144,
209198,
209267,
209346,
209363,
209378,
209392,
209394,
209425,
209464,
209480,
209502,
209533,
209589,
209639,
209708,
209772,
209816,
209892,
209975,
210009,
210085,
210133,
210214,
210299,
210334,
210417,
210464,
210533,
210593,
210658,
210727,
210794,
210816,
210828,
210836,
210838,
210889,
210891,
210948,
211027,
211091,
211169,
211244,
211319,
211419,
211519,
211542,
211619,
211701,
211758,
211814,
211875,
211916,
211957,
211979,
212014,
212049,
212078,
212101,
212145,
212162,
212178,
212180,
212251,
212320,
212322,
212352,
212434,
212528,
212555,
212644,
212675,
212677,
212721,
212765,
212826,
212861,
212896,
212931,
212966,
213001,
213035,
213070,
213109,
213138,
213147,
213214,
213297,
213316,
213318,
213345,
213383,
213386,
213388,
213429,
213458,
213500,
213550,
213577,
213590,
213621,
213645,
213647,
213671,
213736,
213779,
213848,
213925,
214025,
214027,
214063,
214118,
214132,
214182,
214191,
214198,
214248,
214254,
214256,
214299,
214368,
214434,
214436,
214517,
214519,
214560,
214634,
214709,
214726,
214807,
214817,
214869,
214871,
214935,
214991,
215060,
215122,
215193,
215195,
215257,
215309,
215386,
215408,
215457,
215459,
215483,
215504,
215506,
215541,
215598,
215663,
215665,
215738,
215764,
215790,
215849,
215903,
215955,
215998,
216046,
216094,
216142,
216194,
216199,
216202,
216204,
216231,
216234,
216291,
216334,
216383,
216430,
216445,
216499,
216549,
216551,
216589,
216591,
216626,
216675,
216683,
216726,
216728,
216766,
216821,
216829,
216875,
216893,
216909,
216925,
216970,
216978,
217026,
217067,
217069,
217102,
217147,
217201,
217242,
217250,
217305,
217365,
217404,
217409,
217450,
217452,
217468,
217510,
217553,
217599,
217640,
217645,
217653,
217706,
217708,
217729,
217788,
217831,
217840,
217884,
217979,
218010,
218058,
218080,
218143,
218161,
218185,
218250,
218268,
218286,
218341,
218359,
218368,
218373,
218388,
218399,
218445,
218537,
218570,
218620,
218644,
218709,
218729,
218755,
218822,
218842,
218862,
218919,
218939,
218950,
218957,
218977,
218982,
219030,
219032,
219061,
219078,
219109,
219160,
219219,
219271,
219331,
219389,
219481,
219574,
219579,
219587,
219647,
219691,
219693,
219710,
219732,
219776,
219819,
219859,
219886,
219888,
219950,
220031,
220056,
220097,
220136,
220154,
220192,
220199,
220204,
220222,
220276,
220341,
220406,
220408,
220427,
220479,
220535,
220561,
220611,
220637,
220710,
220781,
220793,
220871,
220878,
220883,
220893,
220967,
221021,
221026,
221070,
221072,
221142,
221204,
221206,
221275,
221319,
221375,
221423,
221433,
221511,
221572,
221644,
221712,
221717,
221719,
221742,
221754,
221811,
221877,
221945,
221986,
221988,
222010,
222061,
222117,
222186,
222258,
222297,
222311,
222366,
222437,
222509,
222582,
222650,
222721,
222728,
222740,
222805,
222873,
222944,
222951,
222956,
223006,
223008,
223032,
223034,
223075,
223116,
223119,
223121,
223151,
223216,
223219,
223249,
223267,
223269,
223318,
223398,
223401,
223403,
223448,
223451,
223471,
223473,
223482,
223548,
223634,
223657,
223701,
223706,
223752,
223754,
223777,
223780,
223782,
223811,
223896,
223949,
223978,
223981,
224004,
224006,
224117,
224166,
224215,
224237,
224282,
224370,
224449,
224470,
224504,
224519,
224575,
224636,
224652,
224683,
224704,
224727,
224772,
224817,
224849,
224871,
224889,
224908,
224974,
225045,
225073,
225133,
225153,
225172,
225242,
225270,
225332,
225352,
225371,
225437,
225465,
225525,
225545,
225564,
225640,
225668,
225733,
225753,
225772,
225842,
225870,
225931,
225951,
225970,
226044,
226072,
226135,
226155,
226174,
226244,
226272,
226333,
226353,
226372,
226442,
226520,
226548,
226605,
226671,
226691,
226710,
226783,
226847,
226875,
226931,
226988,
227008,
227027,
227103,
227131,
227196,
227216,
227235,
227252,
227280,
227298,
227378,
227443,
227529,
227568,
227607,
227653,
227663,
227671,
227693,
227702,
227724,
227733,
227741,
227747,
227767,
227793,
227802,
227842,
227885,
227957,
228017,
228032,
228097,
228121,
228123,
228201,
228275,
228326,
228336,
228338,
228360,
228369,
228393,
228402,
228410,
228412,
228428,
228454,
228463,
228552,
228645,
228686,
228696,
228711,
228751,
228791,
228813,
228815,
228859,
228990,
229121,
229252,
229383,
229514,
229645,
229760,
229891,
229911,
229913,
229967,
229969,
230012,
230063,
230112,
230134,
230175,
230224,
230271,
230357,
230400,
230451,
230500,
230586,
230633,
230688,
230741,
230827,
230872,
230925,
230976,
231062,
231106,
231158,
231208,
231294,
231336,
231378,
231398,
231454,
231559,
231650,
231747,
231803,
231908,
232002,
232036,
232094,
232160,
232219,
232286,
232346,
232405,
232472,
232535,
232591,
232655,
232713,
232772,
232796,
232813,
232815,
232868,
232908,
232942,
232978,
233020,
233058,
233097,
233113,
233134,
233231,
233339,
233354,
233371,
233388,
233390,
233420,
233436,
233457,
233508,
233534,
233560,
233591,
233599,
233697,
233802,
233894,
233972,
234053,
234133,
234214,
234292,
234369,
234445,
234522,
234601,
234674,
234750,
234824,
234901,
234947,
234993,
235022,
235034,
235044,
235046,
235100,
235102,
235140,
235142,
235165,
235181,
235199,
235218,
235236,
235254,
235270,
235287,
235297,
235299,
235309,
235334,
235380,
235394,
235413,
235424,
235459,
235476,
235490,
235507,
235524,
235541,
235558,
235575,
235592,
235609,
235626,
235643,
235660,
235677,
235694,
235711,
235728,
235745,
235762,
235779,
235796,
235813,
235830,
235847,
235864,
235881,
235898,
235915,
235932,
235949,
235966,
235983,
236000,
236017,
236034,
236051,
236068,
236085,
236102,
236119,
236136,
236153,
236170,
236187,
236204,
236221,
236238,
236255,
236272,
236289,
236306,
236323,
236340,
236357,
236374,
236391,
236408,
236425,
236442,
236459,
236476,
236493,
236510,
236527,
236544,
236561,
236578,
236595,
236612,
236629,
236646,
236663,
236680,
236697,
236714,
236731,
236748,
236765,
236782,
236799,
236816,
236833,
236850,
236867,
236884,
236901,
236918,
236935,
236952,
236969,
236986,
237003,
237020,
237037,
237054,
237071,
237088,
237105,
237122,
237139,
237156,
237173,
237190,
237207,
237224,
237241,
237258,
237275,
237292,
237309,
237326,
237343,
237360,
237377,
237394,
237411,
237428,
237445,
237462,
237479,
237496,
237513,
237530,
237547,
237564,
237581,
237598,
237615,
237632,
237649,
237666,
237683,
237700,
237717,
237734,
237751,
237768,
237785,
237802,
237819,
237836,
237853,
237870,
237887,
237904,
237921,
237938,
237955,
237972,
237989,
238006,
238023,
238040,
238057,
238074,
238091,
238108,
238125,
238142,
238159,
238176,
238193,
238210,
238227,
238244,
238261,
238278,
238295,
238312,
238329,
238346,
238363,
238380,
238397,
238414,
238431,
238448,
238465,
238482,
238499,
238516,
238533,
238550,
238567,
238584,
238601,
238618,
238635,
238652,
238669,
238686,
238703,
238720,
238737,
238754,
238771,
238788,
238805,
238822,
238839,
238856,
238873,
238890,
238907,
238924,
238941,
238958,
238975,
238992,
239009,
239026,
239043,
239060,
239077,
239094,
239111,
239128,
239145,
239162,
239179,
239196,
239213,
239230,
239247,
239264,
239281,
239298,
239315,
239332,
239349,
239366,
239383,
239400,
239417,
239434,
239451,
239468,
239485,
239502,
239519,
239536,
239553,
239570,
239587,
239604,
239621,
239638,
239655,
239672,
239689,
239706,
239723,
239740,
239757,
239774,
239791,
239808,
239825,
239842,
239859,
239876,
239893,
239910,
239927,
239944,
239961,
239978,
239995,
240012,
240029,
240046,
240063,
240080,
240097,
240114,
240131,
240148,
240165,
240182,
240199,
240216,
240233,
240250,
240267,
240284,
240301,
240318,
240335,
240352,
240369,
240386,
240403,
240420,
240437,
240454,
240471,
240488,
240505,
240522,
240539,
240556,
240573,
240590,
240607,
240624,
240641,
240658,
240675,
240692,
240709,
240726,
240743,
240760,
240777,
240794,
240811,
240828,
240845,
240862,
240879,
240896,
240913,
240930,
240947,
240964,
240981,
240998,
241015,
241032,
241049,
241066,
241083,
241100,
241117,
241134,
241151,
241168,
241185,
241202,
241219,
241236,
241253,
241270,
241287,
241304,
241321,
241338,
241355,
241372,
241389,
241406,
241423,
241440,
241457,
241474,
241491,
241508,
241525,
241542,
241559,
241576,
241593,
241610,
241627,
241644,
241661,
241678,
241695,
241712,
241729,
241746,
241763,
241780,
241797,
241814,
241831,
241848,
241865,
241882,
241899,
241916,
241933,
241950,
241967,
241984,
242001,
242018,
242035,
242052,
242069,
242086,
242103,
242120,
242137,
242154,
242171,
242188,
242205,
242222,
242239,
242256,
242273,
242290,
242307,
242324,
242341,
242358,
242375,
242392,
242409,
242426,
242443,
242460,
242477,
242494,
242511,
242528,
242545,
242562,
242579,
242596,
242613,
242630,
242647,
242664,
242681,
242698,
242715,
242732,
242749,
242766,
242783,
242800,
242817,
242834,
242851,
242868,
242885,
242902,
242919,
242936,
242953,
242970,
242987,
243004,
243021,
243038,
243055,
243072,
243089,
243106,
243123,
243140,
243157,
243174,
243191,
243208,
243225,
243242,
243259,
243276,
243293,
243310,
243327,
243344,
243361,
243378,
243395,
243412,
243429,
243446,
243463,
243480,
243497,
243514,
243531,
243548,
243565,
243582,
243599,
243616,
243633,
243650,
243667,
243684,
243701,
243718,
243735,
243752,
243769,
243786,
243803,
243820,
243837,
243854,
243871,
243888,
243905,
243922,
243939,
243956,
243973,
243990,
244007,
244024,
244041,
244058,
244075,
244092,
244109,
244126,
244143,
244160,
244177,
244194,
244211,
244228,
244245,
244262,
244279,
244296,
244313,
244330,
244347,
244364,
244381,
244398,
244415,
244432,
244449,
244466,
244483,
244500,
244517,
244534,
244551,
244568,
244585,
244602,
244619,
244636,
244653,
244670,
244687,
244704,
244721,
244738,
244755,
244772,
244789,
244806,
244823,
244840,
244857,
244874,
244891,
244908,
244925,
244942,
244959,
244976,
244993,
245010,
245027,
245044,
245061,
245078,
245095,
245112,
245129,
245146,
245163,
245180,
245197,
245214,
245231,
245248,
245265,
245282,
245299,
245316,
245333,
245350,
245367,
245384,
245401,
245418,
245435,
245452,
245469,
245486,
245503,
245520,
245537,
245554,
245571,
245588,
245605,
245622,
245639,
245656,
245673,
245690,
245707,
245724,
245741,
245758,
245775,
245792,
245809,
245826,
245843,
245860,
245877,
245894,
245911,
245928,
245945,
245962,
245979,
245996,
246013,
246030,
246047,
246064,
246081,
246098,
246115,
246132,
246149,
246166,
246183,
246200,
246217,
246234,
246251,
246268,
246285,
246302,
246319,
246336,
246353,
246370,
246387,
246404,
246421,
246438,
246455,
246472,
246489,
246506,
246523,
246540,
246557,
246574,
246591,
246608,
246625,
246642,
246659,
246676,
246693,
246710,
246727,
246744,
246761,
246778,
246795,
246812,
246829,
246846,
246863,
246880,
246897,
246914,
246931,
246948,
246965,
246982,
246999,
247016,
247033,
247050,
247067,
247084,
247101,
247118,
247135,
247152,
247169,
247186,
247203,
247220,
247237,
247254,
247271,
247288,
247305,
247322,
247339,
247356,
247373,
247390,
247407,
247424,
247441,
247458,
247475,
247492,
247509,
247526,
247543,
247560,
247577,
247594,
247611,
247628,
247645,
247662,
247679,
247696,
247713,
247730,
247747,
247764,
247781,
247798,
247815,
247832,
247849,
247866,
247883,
247900,
247917,
247934,
247951,
247968,
247985,
248002,
248019,
248036,
248053,
248070,
248087,
248104,
248121,
248138,
248155,
248172,
248189,
248206,
248223,
248240,
248257,
248274,
248291,
248308,
248325,
248342,
248359,
248376,
248393,
248410,
248427,
248444,
248461,
248478,
248495,
248512,
248529,
248546,
248563,
248580,
248597,
248614,
248631,
248648,
248665,
248682,
248699,
248716,
248733,
248750,
248767,
248784,
248801,
248818,
248835,
248852,
248869,
248886,
248903,
248920,
248937,
248954,
248971,
248988,
249005,
249022,
249039,
249056,
249073,
249090,
249107,
249124,
249141,
249158,
249175,
249192,
249209,
249226,
249243,
249260,
249277,
249294,
249311,
249328,
249345,
249362,
249379,
249396,
249413,
249430,
249447,
249464,
249481,
249498,
249515,
249532,
249549,
249566,
249583,
249600,
249617,
249634,
249651,
249668,
249685,
249702,
249719,
249736,
249753,
249770,
249787,
249804,
249821,
249838,
249855,
249872,
249889,
249906,
249923,
249940,
249957,
249974,
249991,
250008,
250025,
250042,
250059,
250076,
250093,
250110,
250127,
250144,
250161,
250178,
250195,
250212,
250229,
250246,
250263,
250280,
250297,
250314,
250331,
250348,
250365,
250382,
250399,
250416,
250433,
250450,
250467,
250484,
250501,
250518,
250535,
250552,
250569,
250586,
250603,
250620,
250637,
250654,
250671,
250688,
250705,
250722,
250739,
250756,
250773,
250790,
250807,
250824,
250841,
250858,
250875,
250892,
250909,
250926,
250943,
250960,
250977,
250994,
251011,
251028,
251045,
251062,
251079,
251096,
251113,
251130,
251147,
251164,
251181,
251198,
251215,
251232,
251249,
251266,
251283,
251300,
251317,
251334,
251351,
251368,
251385,
251402,
251419,
251436,
251453,
251470,
251487,
251504,
251521,
251538,
251555,
251572,
251589,
251606,
251623,
251640,
251657,
251674,
251691,
251708,
251725,
251742,
251759,
251776,
251793,
251810,
251827,
251844,
251861,
251878,
251895,
251912,
251929,
251946,
251963,
251980,
251997,
252014,
252031,
252048,
252065,
252082,
252099,
252116,
252133,
252150,
252167,
252184,
252201,
252218,
252235,
252252,
252269,
252286,
252303,
252320,
252337,
252354,
252371,
252388,
252405,
252422,
252439,
252456,
252473,
252490,
252507,
252524,
252541,
252558,
252575,
252592,
252609,
252626,
252643,
252660,
252677,
252694,
252711,
252728,
252745,
252762,
252779,
252796,
252813,
252830,
252847,
252864,
252881,
252898,
252915,
252932,
252949,
252966,
252983,
253000,
253017,
253034,
253051,
253068,
253085,
253102,
253119,
253136,
253153,
253170,
253187,
253204,
253221,
253238,
253255,
253272,
253289,
253306,
253323,
253340,
253357,
253374,
253391,
253408,
253425,
253442,
253459,
253476,
253493,
253510,
253527,
253544,
253561,
253578,
253595,
253612,
253629,
253646,
253663,
253680,
253697,
253714,
253731,
253748,
253765,
253782,
253799,
253816,
253833,
253850,
253867,
253884,
253901,
253918,
253935,
253952,
253969,
253986,
254003,
254020,
254037,
254054,
254155,
254256,
254357,
254458,
254559,
254660,
254761,
254862,
254963,
255064,
255165,
255266,
255367,
255468,
255569,
255670,
255771,
255872,
255973,
256074,
256175,
256276,
256377,
256478,
256579,
256680,
256781,
256882,
256983,
257084,
257185,
257286,
257387,
257488,
257589,
257690,
257791,
257892,
257993,
258094,
258195,
258296,
258397,
258498,
258599,
258700,
258801,
258903,
258924,
259013,
259030,
259042,
259109,
259176,
259243,
259310,
259377,
259444,
259511,
259578,
259645,
259712,
259779,
259846,
259913,
259980,
260017,
260059,
260101,
260149,
260178,
260226,
260233,
260250,
260291,
260298,
260313,
260390,
260428,
260500,
260507,
260513,
260515,
260531,
260584,
260662,
260721,
260723,
260777,
260831,
260884,
260910,
260970,
261007,
261025,
261097,
261145,
261163,
261224,
261294,
261332,
261350,
261409,
261445,
261463,
261527,
261568,
261586,
261649,
261712,
261759,
261765,
261767,
261812,
261886,
261936,
261990,
262020,
262047,
262061,
262098,
262134,
262167,
262181,
262231,
262280,
262326,
262335,
262365,
262408,
262438,
262481,
262530,
262566,
262575,
262577,
262610,
262669,
262705,
262769,
262776,
262782,
262829,
262884,
262943,
262995,
263002,
263004,
263041,
263081,
263138,
263200,
263228,
263297,
263349,
263356,
263362,
263364,
263423,
263478,
263502,
263517,
263519,
263560,
263625,
263679,
263694,
263696,
263753,
263806,
263835,
263841,
263843,
263890,
263923,
263938,
263940,
263982,
264039,
264041,
264098,
264146,
264183,
264231,
264260,
264313,
264358,
264397,
264440,
264486,
264488,
264526,
264533,
264582,
264631,
264653,
264680,
264737,
264785,
264787,
264866,
264893,
264922,
264981,
265030,
265103,
265105,
265141,
265205,
265281,
265318,
265370,
265446,
265468,
265549,
265587,
265646,
265729,
265798,
265813,
265826,
265903,
265949,
265971,
265990,
265992,
266044,
266096,
266118,
266148,
266188,
266215,
266272,
266320,
266322,
266402,
266429,
266481,
266557,
266559,
266595,
266659,
266735,
266772,
266824,
266900,
266922,
267003,
267041,
267110,
267180,
267195,
267208,
267288,
267334,
267356,
267375,
267377,
267407,
267429,
267488,
267550,
267616,
267691,
267770,
267854,
267947,
268000,
268079,
268111,
268184,
268221,
268265,
268300,
268317,
268415,
268460,
268540,
268572,
268646,
268683,
268727,
268776,
268811,
268828,
268849,
268930,
269015,
269105,
269160,
269239,
269271,
269344,
269381,
269425,
269460,
269477,
269492,
269505,
269562,
269635,
269661,
269728,
269759,
269798,
269827,
269839,
269849,
269930,
269990,
270052,
270067,
270116,
270165,
270187,
270199,
270280,
270356,
270434,
270498,
270512,
270591,
270638,
270662,
270746,
270825,
270882,
270937,
271010,
271072,
271114,
271116,
271156,
271218,
271264,
271286,
271305,
271313,
271355,
271395,
271420,
271485,
271549,
271609,
271671,
271739,
271800,
271820,
271837,
271839,
271881,
271916,
271957,
271983,
272025,
272047,
272114,
272187,
272202,
272215,
272217,
272268,
272294,
272296,
272372,
272451,
272509,
272529,
272546,
272548,
272578,
272657,
272665,
272695,
272775,
272797,
272879,
272893,
272974,
273004,
273019,
273057,
273092,
273161,
273239,
273264,
273315,
273347,
273433,
273497,
273499,
273531,
273564,
273596,
273633,
273648,
273650,
273724,
273782,
273834,
273886,
273937,
273957,
274008,
274015,
274017,
274051,
274053,
274079,
274126,
274186,
274252,
274304,
274350,
274352,
274420,
274451,
274519,
274565,
274635,
274699,
274768,
274820,
274896,
274947,
274962,
274975,
275010,
275052,
275076,
275147,
275195,
275246,
275283,
275301,
275312,
275321,
275352,
275433,
275514,
275593,
275621,
275696,
275720,
275789,
275847,
275935,
276026,
276076,
276143,
276195,
276222,
276231,
276238,
276240,
276319,
276399,
276476,
276515,
276553,
276604,
276606,
276680,
276697,
276726,
276763,
276806,
276839,
276881,
276916,
276953,
277007,
277035,
277042,
277044,
277119,
277174,
277176,
277250,
277323,
277374,
277376,
277447,
277503,
277558,
277612,
277614,
277640,
277677,
277723,
277779,
277817,
277854,
277907,
277916,
277965,
277972,
277978,
277980,
277987,
278040,
278050,
278086,
278088,
278120,
278135,
278137,
278182,
278184,
278264,
278343,
278420,
278482,
278547,
278549,
278593,
278658,
278731,
278792,
278868,
278934,
279004,
279070,
279143,
279187,
279257,
279288,
279351,
279433,
279514,
279593,
279620,
279687,
279756,
279819,
279896,
279982,
280050,
280122,
280190,
280265,
280309,
280381,
280390,
280397,
280473,
280538,
280544,
280546,
280606,
280608,
280657,
280690,
280715,
280765,
280814,
280863,
280905,
280912,
280986,
281007,
281036,
281106,
281113,
281164,
281200,
281275,
281351,
281435,
281441,
281443,
281450,
281524,
281545,
281574,
281651,
281658,
281700,
281721,
281750,
281811,
281818,
281873,
281909,
281911,
281946,
282008,
282085,
282119,
282166,
282185,
282191,
282193,
282200,
282269,
282290,
282332,
282334,
282341,
282413,
282434,
282463,
282532,
282539,
282606,
282682,
282748,
282813,
282877,
282956,
283013,
283049,
283108,
283114,
283156,
283177,
283210,
283264,
283270,
283309,
283345,
283347,
283387,
283447,
283522,
283528,
283530,
283537,
283613,
283683,
283690,
283751,
283830,
283873,
283899,
283905,
283907,
283914,
283973,
283994,
284029,
284108,
284179,
284223,
284225,
284232,
284311,
284387,
284394,
284426,
284477,
284542,
284577,
284624,
284684,
284711,
284770,
284822,
284842,
284844,
284912,
284959,
285031,
285051,
285095,
285119,
285125,
285127,
285192,
285234,
285242,
285306,
285326,
285369,
285422,
285457,
285485,
285537,
285549,
285590,
285592,
285620,
285627,
285629,
285678,
285727,
285769,
285865,
285901,
285916,
285969,
285975,
286009,
286038,
286067,
286098,
286104,
286106,
286113,
286194,
286265,
286272,
286308,
286313,
286358,
286363,
286446,
286532,
286543,
286624,
286644,
286650,
286652,
286659,
286706,
286713,
286747,
286752,
286821,
286902,
286904,
286964,
286995,
287037,
287044,
287046,
287083,
287127,
287219,
287260,
287351,
287439,
287504,
287526,
287563,
287610,
287612,
287644,
287653,
287660,
287666,
287668,
287702,
287707,
287781,
287841,
287871,
287926,
287940,
287994,
288001,
288007,
288009,
288041,
288046,
288106,
288141,
288185,
288187,
288268,
288350,
288423,
288492,
288494,
288558,
288618,
288697,
288761,
288836,
288895,
288917,
288932,
288934,
288970,
289053,
289129,
289196,
289293,
289350,
289437,
289485,
289526,
289528,
289594,
289648,
289717,
289797,
289858,
289860,
289890,
289959,
290040,
290076,
290149,
290185,
290267,
290269,
290298,
290339,
290345,
290347,
290364,
290366,
290372,
290391,
290397,
290422,
290494,
290526,
290576,
290626,
290646,
290695,
290711,
290779,
290826,
290829,
290848,
290883,
290923,
290968,
290971,
291046,
291122,
291198,
291276,
291354,
291431,
291506,
291528,
291564,
291668,
291766,
291833,
291904,
291926,
291950,
291952,
291979,
292018,
292065,
292105,
292146,
292202,
292204,
292240,
292283,
292376,
292439,
292505,
292591,
292676,
292760,
292841,
292900,
292992,
293058,
293080,
293104,
293118,
293143,
293145,
293214,
293248,
293296,
293311,
293356,
293415,
293430,
293447,
293474,
293513,
293534,
293577,
293629,
293682,
293699,
293714,
293731,
293752,
293754,
293779,
293848,
293918,
293985,
294029,
294084,
294106,
294129,
294150,
294173,
294175,
294208,
294253,
294328,
294330,
294442,
294557,
294559,
294577,
294657,
294738,
294768,
294785,
294868,
294989,
295042,
295095,
295143,
295215,
295217,
295293,
295346,
295348,
295428,
295507,
295568,
295646,
295728,
295795,
295866,
295937,
296007,
296046,
296125,
296132,
296143,
296208,
296293,
296360,
296362,
296416,
296496,
296571,
296645,
296722,
296798,
296873,
296923,
296925,
296963,
297044,
297074,
297119,
297121,
297189,
297266,
297304,
297344,
297416,
297418,
297462,
297513,
297515,
297593,
297653,
297731,
297804,
297885,
297947,
298026,
298082,
298123,
298203,
298246,
298323,
298354,
298432,
298503,
298545,
298564,
298566,
298625,
298685,
298704,
298706,
298754,
298802,
298847,
298856,
298876,
298884,
298886,
298937,
298944,
299004,
299033,
299101,
299172,
299235,
299277,
299338,
299399,
299445,
299489,
299511,
299526,
299539,
299550,
299604,
299621,
299630,
299638,
299686,
299712,
299754,
299781,
299831,
299881,
299901,
299903,
299922,
300037,
300152,
300267,
300382,
300497,
300612,
300727,
300842,
300862,
300864,
300922,
300924,
300967,
301018,
301069,
301089,
301150,
301202,
301243,
301292,
301341,
301384,
301435,
301486,
301533,
301581,
301629,
301674,
301727,
301780,
301824,
301876,
301928,
301930,
301945,
302009,
302073,
302125,
302133,
302135,
302179,
302217,
302260,
302311,
302317,
302319,
302356,
302385,
302425,
302455,
302485,
302487,
302496,
302535,
302566,
302608,
302640,
302672,
302689,
302761,
302799,
302804,
302851,
302854,
302856,
302903,
302905,
302910,
302935,
302940,
302991,
303042,
303062,
303109,
303112,
303131,
303175,
303220,
303255,
303296,
303339,
303384,
303387,
303462,
303538,
303614,
303692,
303770,
303847,
303922,
303942,
304001,
304051,
304102,
304152,
304186,
304241,
304297,
304358,
304417,
304488,
304549,
304577,
304600,
304648,
304695,
304743,
304790,
304850,
304910,
304932,
304955,
304979,
305000,
305002,
305078,
305080,
305119,
305153,
305226,
305244,
305336,
305343,
305435,
305443,
305460,
305474,
305476,
305511,
305592,
305670,
305700,
305780,
305835,
305890,
305946,
306037,
306060,
306127,
306176,
306255,
306261,
306263,
306270,
306342,
306414,
306488,
306495,
306549,
306584,
306586,
306631,
306700,
306737,
306797,
306857,
306913,
306915,
306962,
306969,
306981,
307043,
307069,
307076,
307082,
307141,
307147,
307171,
307222,
307279,
307320,
307350,
307396,
307428,
307460,
307518,
307524,
307553,
307582,
307589,
307617,
307660,
307667,
307673,
307749,
307755,
307811,
307901,
307908,
307914,
308003,
308074,
308124,
308210,
308252,
308294,
308343,
308409,
308462,
308464,
308530,
308588,
308590,
308642,
308704,
308764,
308816,
308866,
308869,
308871,
308924,
308955,
308982,
309018,
309054,
309104,
309134,
309143,
309145,
309177,
309247,
309309,
309311,
309363,
309365,
309427,
309487,
309539,
309541,
309591,
309593,
309619,
309648,
309675,
309704,
309732,
309764,
309805,
309846,
309889,
309913,
309939,
309965,
309990,
310015,
310031,
310057,
310093,
310126,
310168,
310183,
310207,
310232,
310239,
310279,
310325,
310333,
310357,
310364,
310393,
310401,
310409,
310424,
310448,
310492,
310541,
310570,
310615,
310636,
310661,
310702,
310735,
310754,
310783,
310791,
310840,
310873,
310907,
310952,
311001,
311054,
311120,
311179,
311258,
311334,
311366,
311399,
311421,
311446,
311476,
311506,
311530,
311554,
311617,
311724,
311819,
311924,
312030,
312129,
312136,
312198,
312264,
312319,
312375,
312439,
312504,
312512,
312520,
312543,
312579,
312606,
312634,
312660,
312687,
312736,
312773,
312810,
312846,
312882,
312918,
312956,
312990,
313027,
313029,
313064,
313104,
313138,
313176,
313204,
313234,
313270,
313293,
313311,
313320,
313376,
313406,
313436,
313462,
313489,
313514,
313542,
313570,
313593,
313618,
313645,
313669,
313700,
313715,
313735,
313758,
313766,
313782,
313794,
313802,
313823,
313844,
313883,
313922,
313967,
313969,
313983,
314008,
314047,
314073,
314095,
314119,
314121,
314135,
314160,
314200,
314226,
314248,
314272,
314274,
314306,
314344,
314402,
314435,
314457,
314459,
314461,
314494,
314539,
314584,
314624,
314642,
314670,
314690,
314720,
314742,
314775,
314791,
314810,
314826,
314828,
314844,
314871,
314905,
314934,
314965,
314998,
315029,
315075,
315107,
315140,
315174,
315198,
315226,
315256,
315283,
315312,
315345,
315373,
315401,
315436,
315463,
315489,
315515,
315547,
315577,
315622,
315651,
315675,
315704,
315771,
315792,
315818,
315842,
315871,
315909,
315949,
315979,
316004,
316032,
316034,
316049,
316066,
316083,
316085,
316134,
316136,
316167,
316170,
316189,
316217,
316244,
316271,
316287,
316307,
316325,
316346,
316366,
316386,
316405,
316421,
316440,
316463,
316512,
316525,
316528,
316541,
316543,
316563,
316566,
316585,
316608,
316640,
316664,
316666,
316682,
316685,
316718,
316745,
316747,
316779,
316786,
316834,
316882,
316935,
316965,
317001,
317039,
317073,
317100,
317129,
317163,
317196,
317229,
317260,
317293,
317330,
317359,
317388,
317421,
317452,
317482,
317520,
317548,
317550,
317581,
317584,
317601,
317629,
317656,
317683,
317701,
317715,
317731,
317749,
317767,
317784,
317801,
317815,
317832,
317881,
317883,
317896,
317899,
317916,
317918,
317938,
317961,
317984,
318016,
318018,
318050,
318057,
318107,
318177,
318231,
318290,
318362,
318396,
318430,
318475,
318481,
318533,
318606,
318612,
318658,
318665,
318672,
318679,
318681,
318706,
318786,
318832,
318839,
318898,
318957,
318974,
319032,
319076,
319114,
319177,
319215,
319259,
319361,
319463,
319566,
319661,
319715,
319761,
319816,
319871,
319891,
319928,
319966,
320011,
320050,
320052,
320101,
320148,
320191,
320243,
320287,
320343,
320383,
320385,
320429,
320466,
320468,
320511,
320550,
320608,
320654,
320676,
320735,
320779,
320839,
320883,
320940,
320984,
321042,
321086,
321139,
321183,
321236,
321280,
321344,
321388,
321463,
321513,
321575,
321619,
321681,
321725,
321788,
321832,
321893,
321937,
322000,
322046,
322111,
322158,
322211,
322255,
322311,
322355,
322405,
322449,
322493,
322550,
322572,
322626,
322670,
322727,
322771,
322825,
322869,
322930,
322974,
323031,
323075,
323137,
323181,
323234,
323282,
323327,
323380,
323424,
323485,
323507,
323600,
323602,
323655,
323701,
323747,
323793,
323843,
323889,
323948,
323994,
324043,
324089,
324091,
324150,
324212,
324270,
324272,
324320,
324342,
324394,
324429,
324465,
324509,
324547,
324586,
324630,
324632,
324690,
324748,
324794,
324796,
324859,
324924,
324926,
324999,
325001,
325076,
325138,
325200,
325277,
325308,
325344,
325385,
325387,
325403,
325445,
325476,
325478,
325509,
325547,
325587,
325633,
325635,
325656,
325687,
325724,
325806,
325907,
325909,
325924,
325965,
326007,
326009,
326037,
326138,
326163,
326193,
326195,
326219,
326268,
326326,
326444,
326446,
326491,
326544,
326590,
326636,
326684,
326686,
326727,
326802,
326804,
326896,
326969,
326971,
326998,
327081,
327158,
327198,
327274,
327341,
327398,
327453,
327508,
327526,
327573,
327579,
327608,
327662,
327667,
327700,
327702,
327752,
327811,
327871,
327941,
328011,
328070,
328107,
328139,
328202,
328232,
328260,
328307,
328356,
328403,
328427,
328429,
328506,
328547,
328593,
328642,
328671,
328673,
328686,
328699,
328712,
328725,
328727,
328807,
328817,
328905,
328954,
329010,
329072,
329145,
329147,
329197,
329253,
329320,
329322,
329388,
329467,
329561,
329575,
329607,
329633,
329635,
329656,
329730,
329794,
329839,
329919,
330004,
330060,
330116,
330136,
330182,
330223,
330267,
330308,
330354,
330356,
330398,
330436,
330481,
330533,
330579,
330632,
330683,
330727,
330768,
330809,
330851,
330909,
330964,
331007,
331055,
331109,
331151,
331196,
331234,
331273,
331324,
331326,
331368,
331431,
331494,
331536,
331556,
331574,
331590,
331608,
331629,
331657,
331711,
331749,
331793,
331818,
331873,
331907,
331976,
331978,
332009,
332054,
332083,
332112,
332145,
332175,
332204,
332272,
332340,
332401,
332431,
332481,
332517,
332560,
332593,
332644,
332681,
332724,
332759,
332794,
332848,
332886,
332923,
332953,
332955,
332992,
333029,
333057,
333125,
333193,
333213,
333266,
333268,
333324,
333326,
333427,
333482,
333529,
333531,
333562,
333623,
333625,
333650,
333730,
333765,
333767,
333850,
333855,
333910,
333930,
333977,
334068,
334115,
334207,
334254,
334319,
334366,
334368,
334473,
334522,
334575,
334622,
334687,
334689,
334745,
334747,
334802,
334859,
334906,
334963,
335010,
335068,
335153,
335246,
335316,
335363,
335426,
335473,
335536,
335583,
335645,
335692,
335762,
335832,
335850,
335852,
335916,
335965,
336014,
336016,
336101,
336179,
336225,
336295,
336341,
336429,
336475,
336547,
336593,
336672,
336718,
336769,
336815,
336893,
336971,
337032,
337034,
337053,
337055,
337075,
337095,
337126,
337170,
337188,
337220,
337246,
337268,
337270,
337305,
337367,
337440,
337463,
337465,
337542,
337596,
337607,
337637,
337651,
337690,
337753,
337811,
337841,
337869,
337871,
337890,
337941,
338080,
338125,
338181,
338237,
338257,
338329,
338376,
338434,
338478,
338528,
338572,
338620,
338664,
338727,
338771,
338830,
338874,
338939,
338983,
339030,
339087,
339144,
339160,
339227,
339273,
339324,
339382,
339440,
339458,
339512,
339565,
339613,
339661,
339705,
339756,
339817,
339861,
339922,
339966,
340026,
340070,
340127,
340171,
340192,
340206,
340275,
340291,
340329,
340340,
340461,
340676,
340879,
340930,
340981,
340997,
341011,
341020,
341037,
341043,
341051,
341062,
341069,
341090,
341104,
341160,
341177,
341245,
341289,
341350,
341388,
341885,
341988,
342033,
342081,
342089,
342181,
342229,
342280,
342288,
342358,
342375,
342464,
342481,
342493,
342560,
342627,
342694,
342761,
342828,
342895,
342962,
343029,
343096,
343163,
343230,
343247,
343336,
343353,
343365,
343432,
343499,
343566,
343633,
343700,
343767,
343834,
343901,
343968,
344035,
344102,
344119,
344208,
344225,
344237,
344304,
344371,
344438,
344505,
344572,
344639,
344706,
344773,
344840,
344907,
344974,
345041,
345108,
345175,
345242,
345309,
345336,
345425,
345442,
345454,
345521,
345588,
345655,
345722,
345789,
345856,
345923,
345990,
346057,
346124,
346191,
346258,
346325,
346392,
346459,
346526,
346583,
346672,
346689,
346701,
346768,
346835,
346902,
346969,
347036,
347103,
347170,
347237,
347304,
347371,
347438,
347505,
347572,
347639,
347706,
347773,
347820,
347909,
347926,
347938,
348005,
348072,
348139,
348206,
348273,
348340,
348407,
348474,
348541,
348608,
348675,
348742,
348809,
348876,
348943,
349010,
349077,
349144,
349233,
349250,
349263,
349330,
349397,
349464,
349531,
349598,
349665,
349732,
349799,
349866,
349933,
350000,
350067,
350134,
350201,
350268,
350335,
350402,
350469,
350536,
350603,
350670,
350737,
350804,
350871,
350938,
351005,
351072,
351139,
351206,
351273,
351340,
351407,
351474,
351541,
351608,
351675,
351742,
351809,
351876,
351943,
352010,
352077,
352144,
352211,
352278,
352345,
352412,
352479,
352546,
352613,
352680,
352747,
352814,
352881,
352948,
353015,
353082,
353149,
353216,
353283,
353350,
353417,
353484,
353551,
353618,
353685,
353752,
353819,
353886,
353953,
354020,
354087,
354154,
354221,
354288,
354355,
354422,
354489,
354556,
354623,
354690,
354757,
354824,
354891,
354958,
355025,
355092,
355159,
355226,
355293,
355360,
355427,
355494,
355561,
355628,
355695,
355762,
355829,
355896,
355963,
356030,
356097,
356164,
356231,
356298,
356365,
356432,
356499,
356566,
356633,
356695,
356784,
356801,
356814,
356881,
356948,
357015,
357082,
357149,
357216,
357283,
357350,
357417,
357484,
357551,
357618,
357685,
357752,
357819,
357886,
357953,
358020,
358087,
358154,
358221,
358288,
358355,
358422,
358489,
358556,
358623,
358690,
358757,
358824,
358891,
358958,
359025,
359092,
359159,
359226,
359293,
359360,
359427,
359494,
359561,
359628,
359695,
359762,
359829,
359896,
359963,
360030,
360097,
360164,
360231,
360298,
360365,
360432,
360499,
360566,
360633,
360700,
360767,
360834,
360901,
360968,
361035,
361102,
361169,
361236,
361303,
361370,
361437,
361504,
361571,
361638,
361705,
361772,
361839,
361906,
361973,
362040,
362107,
362174,
362241,
362308,
362375,
362442,
362509,
362576,
362643,
362710,
362777,
362844,
362911,
362978,
363045,
363112,
363179,
363246,
363313,
363380,
363447,
363514,
363581,
363648,
363715,
363782,
363849,
363916,
363983,
364050,
364117,
364184,
364251,
364318,
364385,
364452,
364519,
364586,
364653,
364720,
364787,
364854,
364921,
364988,
365055,
365122,
365189,
365256,
365323,
365390,
365457,
365524,
365591,
365658,
365725,
365792,
365859,
365926,
365993,
366060,
366127,
366194,
366261,
366328,
366395,
366462,
366529,
366596,
366663,
366730,
366797,
366864,
366931,
366998,
367065,
367132,
367199,
367266,
367333,
367400,
367467,
367534,
367601,
367668,
367735,
367802,
367869,
367936,
367998,
368051,
368104,
368151,
368153,
368182,
368252,
368255,
368257,
368353,
368425,
368465,
368543,
368593,
368596,
368598,
368655,
368737,
368787,
368790,
368792,
368836,
368899,
368950,
368953,
368955,
368995,
369054,
369116,
369119,
369121,
369167,
369232,
369295,
369367,
369370,
369372,
369415,
369494,
369522,
369525,
369527,
369563,
369626,
369656,
369678,
369681,
369683,
369755,
369773,
369776,
369778,
369806,
369849,
369868,
369871,
369873,
369895,
369925,
369928,
369930,
369962,
369992,
369995,
369997,
370060,
370080,
370142,
370145,
370147,
370173,
370190,
370224,
370268,
370296,
370299,
370301,
370324,
370364,
370367,
370369,
370393,
370412,
370426,
370429,
370431,
370472,
370535,
370584,
370632,
370655,
370658,
370660,
370747,
370833,
370895,
370945,
370948,
370950,
370985,
371014,
371041,
371069,
371090,
371108,
371171,
371216,
371235,
371238,
371240,
371285,
371372,
371375,
371377,
371413,
371447,
371465
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 371465,
"ccnet_original_nlines": 10145,
"rps_doc_curly_bracket": 0.004821449983865023,
"rps_doc_ldnoobw_words": 11,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12180052697658539,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07174903899431229,
"rps_doc_frac_lines_end_with_ellipsis": 0.0005913699860684574,
"rps_doc_frac_no_alph_words": 0.5235363245010376,
"rps_doc_frac_unique_words": 0.3043763339519501,
"rps_doc_mean_word_length": 8.939425468444824,
"rps_doc_num_sentences": 4796,
"rps_doc_symbol_to_word_ratio": 0.03925174102187157,
"rps_doc_unigram_entropy": 7.397534370422363,
"rps_doc_word_count": 25935,
"rps_doc_frac_chars_dupe_10grams": 0.14351892471313477,
"rps_doc_frac_chars_dupe_5grams": 0.19402270019054413,
"rps_doc_frac_chars_dupe_6grams": 0.1792972832918167,
"rps_doc_frac_chars_dupe_7grams": 0.16866514086723328,
"rps_doc_frac_chars_dupe_8grams": 0.15557444095611572,
"rps_doc_frac_chars_dupe_9grams": 0.1469953954219818,
"rps_doc_frac_chars_top_2gram": 0.0011214399710297585,
"rps_doc_frac_chars_top_3gram": 0.0004830799880437553,
"rps_doc_frac_chars_top_4gram": 0.0006642399821430445,
"rps_doc_books_importance": -40803.6875,
"rps_doc_books_importance_length_correction": -40803.6875,
"rps_doc_openwebtext_importance": -23186.380859375,
"rps_doc_openwebtext_importance_length_correction": -23186.380859375,
"rps_doc_wikipedia_importance": -17028.76953125,
"rps_doc_wikipedia_importance_length_correction": -17028.76953125
},
"fasttext": {
"dclm": 0.8610892295837402,
"english": 0.31090807914733887,
"fineweb_edu_approx": 1.8614333868026733,
"eai_general_math": 0.3426586985588074,
"eai_open_web_math": 0.4448138475418091,
"eai_web_code": 0.06665974855422974
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,844,966,839,868,790,300 | Concepts and Terminology
This document provides an overview of the source tree layout and the terminology used in Bazel.
Table of Contents
Introduction
Bazel builds software from source code organized in a directory called a workspace. Source files in the workspace are organized in a nested hierarchy of packages, where each package is a directory that contains a set of related source files and one BUILD file. The BUILD file specifies what software outputs can be built from the source.
Workspace, Packages and Targets
Workspace
A workspace is a directory on your filesystem that contains the source files for the software you want to build, as well as symbolic links to directories that contain the build outputs. Each workspace directory has a text file named WORKSPACE which may be empty, or may contain references to external dependencies required to build the outputs.
Directories containing a file called WORKSPACE are considered the root of a workspace. Therefore, Bazel ignores any directory trees in a workspace rooted at a subdirectory containing a WORKSPACE file (as they form another workspace).
Repositories
Code is organized in repositories. The directory containing the WORKSPACE file is the root of the main repository, also called @. Other, (external) repositories are defined in the WORKSPACE file using workspace rules.
The workspace rules bundled with Bazel are documented in the Workspace Rules section in the Build Encyclopedia and the documentation on embeded Starlark repository rules.
As external repositories are repositories themselves, they often contain a WORKSPACE file as well. However, these additional WORKSPACE files are ignored by Bazel. In particular, repositories depended upon transitively are not added automatically.
Packages
The primary unit of code organization in a repository is the package. A package is a collection of related files and a specification of the dependencies among them.
A package is defined as a directory containing a file named BUILD or BUILD.bazel, residing beneath the top-level directory in the workspace. A package includes all files in its directory, plus all subdirectories beneath it, except those which themselves contain a BUILD file.
For example, in the following directory tree there are two packages, my/app, and the subpackage my/app/tests. Note that my/app/data is not a package, but a directory belonging to package my/app.
src/my/app/BUILD
src/my/app/app.cc
src/my/app/data/input.txt
src/my/app/tests/BUILD
src/my/app/tests/test.cc
Targets
A package is a container. The elements of a package are called targets. Most targets are one of two principal kinds, files and rules. Additionally, there is another kind of target, package groups, but they are far less numerous.
Files are further divided into two kinds. Source files are usually written by the efforts of people, and checked in to the repository. Generated files, sometimes called derived files, are not checked in, but are generated by the build tool from source files according to specific rules.
The second kind of target is the rule. A rule specifies the relationship between a set of input and a set of output files, including the necessary steps to derive the outputs from the inputs. The outputs of a rule are always generated files. The inputs to a rule may be source files, but they may be generated files also; consequently, outputs of one rule may be the inputs to another, allowing long chains of rules to be constructed.
Whether the input to a rule is a source file or a generated file is in most cases immaterial; what matters is only the contents of that file. This fact makes it easy to replace a complex source file with a generated file produced by a rule, such as happens when the burden of manually maintaining a highly structured file becomes too tiresome, and someone writes a program to derive it. No change is required to the consumers of that file. Conversely, a generated file may easily be replaced by a source file with only local changes.
The inputs to a rule may also include other rules. The precise meaning of such relationships is often quite complex and language- or rule-dependent, but intuitively it is simple: a C++ library rule A might have another C++ library rule B for an input. The effect of this dependency is that B's header files are available to A during compilation, B's symbols are available to A during linking, and B's runtime data is available to A during execution.
An invariant of all rules is that the files generated by a rule always belong to the same package as the rule itself; it is not possible to generate files into another package. It is not uncommon for a rule's inputs to come from another package, though.
Package groups are sets of packages whose purpose is to limit accessibility of certain rules. Package groups are defined by the package_group function. They have two properties: the list of packages they contain and their name. The only allowed ways to refer to them are from the visibility attribute of rules or from the default_visibility attribute of the package function; they do not generate or consume files. For more information, refer to the appropriate section of the Build Encyclopedia.
Labels
All targets belong to exactly one package. The name of a target is called its label, and a typical label in canonical form looks like this:
@myrepo//my/app/main:app_binary
In the typical case that a label refers to the same repository it occurs in, the repository name may be left out. So, inside @myrepo this label is usually written as
//my/app/main:app_binary
Each label has two parts, a package name (my/app/main) and a target name (app_binary). Every label uniquely identifies a target. Labels sometimes appear in other forms; when the colon is omitted, the target name is assumed to be the same as the last component of the package name, so these two labels are equivalent:
//my/app
//my/app:app
Short-form labels such as //my/app are not to be confused with package names. Labels start with //, but package names never do, thus my/app is the package containing //my/app. (A common misconception is that //my/app refers to a package, or to all the targets in a package; neither is true.)
Within a BUILD file, the package-name part of label may be omitted, and optionally the colon too. So within the BUILD file for package my/app (i.e. //my/app:BUILD), the following "relative" labels are all equivalent:
//my/app:app
//my/app
:app
app
(It is a matter of convention that the colon is omitted for files, but retained for rules, but it is not otherwise significant.)
Similarly, within a BUILD file, files belonging to the package may be referenced by their unadorned name relative to the package directory:
generate.cc
testdata/input.txt
But from other packages, or from the command-line, these file targets must always be referred to by their complete label, e.g. //my/app:generate.cc.
Relative labels cannot be used to refer to targets in other packages; the complete package name must always be specified in this case. For example, if the source tree contains both the package my/app and the package my/app/testdata (i.e., each of these two packages has its own BUILD file). The latter package contains a file named testdepot.zip. Here are two ways (one wrong, one correct) to refer to this file within //my/app:BUILD:
testdata/testdepot.zip # Wrong: testdata is a different package.
//my/app/testdata:testdepot.zip # Right.
If, by mistake, you refer to testdepot.zip by the wrong label, such as //my/app:testdata/testdepot.zip or //my:app/testdata/testdepot.zip, you will get an error from the build tool saying that the label "crosses a package boundary". You should correct the label by putting the colon after the directory containing the innermost enclosing BUILD file, i.e., //my/app/testdata:testdepot.zip.
Lexical specification of a label
The syntax of labels is intentionally strict, so as to forbid metacharacters that have special meaning to the shell. This helps to avoid inadvertent quoting problems, and makes it easier to construct tools and scripts that manipulate labels, such as the Bazel Query Language. All of the following are forbidden in labels: any sort of white space, braces, brackets, or parentheses; wildcards such as *; shell metacharacters such as >, & and |; etc. This list is not comprehensive; the precise details are below.
Target names, //...:target-name
target-name is the name of the target within the package. The name of a rule is the value of the name attribute in the rule's declaration in a BUILD file; the name of a file is its pathname relative to the directory containing the BUILD file. Target names must be composed entirely of characters drawn from the set az, AZ, 09, and the punctuation symbols _/.+-=,@~. Do not use .. to refer to files in other packages; use //packagename:filename instead. Filenames must be relative pathnames in normal form, which means they must neither start nor end with a slash (e.g. /foo and foo/ are forbidden) nor contain multiple consecutive slashes as path separators (e.g. foo//bar). Similarly, up-level references (..) and current-directory references (./) are forbidden. The sole exception to this rule is that a target name may consist of exactly '.'.
While it is common to use / in the name of a file target, we recommend that you avoid the use of / in the names of rules. Especially when the shorthand form of a label is used, it may confuse the reader. The label //foo/bar/wiz is always a shorthand for //foo/bar/wiz:wiz, even if there is no such package foo/bar/wiz; it never refers to //foo:bar/wiz, even if that target exists.
However, there are some situations where use of a slash is convenient, or sometimes even necessary. For example, the name of certain rules must match their principal source file, which may reside in a subdirectory of the package.
Package names, //package-name:...
The name of a package is the name of the directory containing its BUILD file, relative to the top-level directory of the source tree. For example: my/app. Package names must be composed entirely of characters drawn from the set A-Z, az, 09, '/', '-', '.', and '_', and cannot start with a slash.
For a language with a directory structure that is significant to its module system (e.g. Java), it is important to choose directory names that are valid identifiers in the language.
Although Bazel allows a package at the build root (e.g. //:foo), this is not advised and projects should attempt to use more descriptively named packages.
Package names may not contain the substring //, nor end with a slash.
Rules
A rule specifies the relationship between inputs and outputs, and the steps to build the outputs. Rules can be of one of many different kinds or classes, which produce compiled executables and libraries, test executables and other supported outputs as described in the Build Encyclopedia.
Every rule has a name, specified by the name attribute, of type string. The name must be a syntactically valid target name, as specified above. In some cases, the name is somewhat arbitrary, and more interesting are the names of the files generated by the rule; this is true of genrules. In other cases, the name is significant: for *_binary and *_test rules, for example, the rule name determines the name of the executable produced by the build.
cc_binary(
name = "my_app",
srcs = ["my_app.cc"],
deps = [
"//absl/base",
"//absl/strings",
],
)
Every rule has a set of attributes; the applicable attributes for a given rule, and the significance and semantics of each attribute are a function of the rule's class; see the Build Encyclopedia for a list of rules and their corresponding attributes. Each attribute has a name and a type. Some of the common types an attribute can have are integer, label, list of labels, string, list of strings, output label, list of output labels. Not all attributes need to be specified in every rule. Attributes thus form a dictionary from keys (names) to optional, typed values.
The srcs attribute present in many rules has type "list of labels"; its value, if present, is a list of labels, each being the name of a target that is an input to this rule.
The outs attribute present in many rules has type "list of output labels"; this is similar to the type of the srcs attribute, but differs in two significant ways. Firstly, due to the invariant that the outputs of a rule belong to the same package as the rule itself, output labels cannot include a package component; they must be in one of the "relative" forms shown above. Secondly, the relationship implied by an (ordinary) label attribute is inverse to that implied by an output label: a rule depends on its srcs, whereas a rule is depended on by its outs. The two types of label attributes thus assign direction to the edges between targets, giving rise to a dependency graph.
This directed acyclic graph over targets is called the "target graph" or "build dependency graph", and is the domain over which the Bazel Query tool operates.
BUILD Files
The previous section described packages, targets and labels, and the build dependency graph abstractly. In this section, we'll look at the concrete syntax used to define a package.
By definition, every package contains a BUILD file, which is a short program. BUILD files are evaluated using an imperative language, Starlark. They are interpreted as a sequential list of statements.
In general, order does matter: variables must be defined before they are used, for example. However, most BUILD files consist only of declarations of build rules, and the relative order of these statements is immaterial; all that matters is which rules were declared, and with what values, by the time package evaluation completes. When a build rule function, such as cc_library, is executed, it creates a new target in the graph. This target can later be referred using a label. So, in simple BUILD files, rule declarations can be re-ordered freely without changing the behavior.
To encourage a clean separation between code and data, BUILD files cannot contain function definitions, for statements or if statements (but list comprehensions and if expressions are allowed). Functions should be declared in .bzl files instead. Additionally, *args and **kwargs arguments are not allowed in BUILD files; instead list all the arguments explicitly.
Crucially, programs in Starlark are unable to perform arbitrary I/O. This invariant makes the interpretation of BUILD files hermetic, i.e. dependent only on a known set of inputs, which is essential for ensuring that builds are reproducible.
BUILD files should be written using only ASCII characters, although technically they are interpreted using the Latin-1 character set.
Since BUILD files need to be updated whenever the dependencies of the underlying code change, they are typically maintained by multiple people on a team. BUILD file authors are encouraged to use comments liberally to document the role of each build target, whether or not it is intended for public use, and to document the role of the package itself.
Loading an extension
Bazel extensions are files ending in .bzl. Use the load statement to import a symbol from an extension.
load("//foo/bar:file.bzl", "some_library")
This code will load the file foo/bar/file.bzl and add the some_library symbol to the environment. This can be used to load new rules, functions or constants (e.g. a string, a list, etc.). Multiple symbols can be imported by using additional arguments to the call to load. Arguments must be string literals (no variable) and load statements must appear at top-level, i.e. they cannot be in a function body. The first argument of load is a label identifying a .bzl file. If it is a relative label, it is resolved with respect to the package (not directory) containing the current bzl file. Relative labels in load statements should use a leading :. load also supports aliases, i.e. you can assign different names to the imported symbols.
load("//foo/bar:file.bzl", library_alias = "some_library")
You can define multiple aliases within one load statement. Moreover, the argument list can contain both aliases and regular symbol names. The following example is perfectly legal (please note when to use quotation marks).
load(":my_rules.bzl", "some_rule", nice_alias = "some_other_rule")
In a .bzl file, symbols starting with _ are not exported and cannot be loaded from another file. Visibility doesn't affect loading (yet): you don't need to use exports_files to make a .bzl file visible.
Types of build rule
The majority of build rules come in families, grouped together by language. For example, cc_binary, cc_library and cc_test are the build rules for C++ binaries, libraries, and tests, respectively. Other languages use the same naming scheme, with a different prefix, e.g. java_* for Java. Some of these functions are documented in the Build Encyclopedia, but it is possible for anyone to create new rules.
• *_binary rules build executable programs in a given language. After a build, the executable will reside in the build tool's binary output tree at the corresponding name for the rule's label, so //my:program would appear at (e.g.) $(BINDIR)/my/program.
Such rules also create a runfiles directory containing all the files mentioned in a data attribute belonging to the rule, or any rule in its transitive closure of dependencies; this set of files is gathered together in one place for ease of deployment to production.
• *_test rules are a specialization of a *_binary rule, used for automated testing. Tests are simply programs that return zero on success.
Like binaries, tests also have runfiles trees, and the files beneath it are the only files that a test may legitimately open at runtime. For example, a program cc_test(name='x', data=['//foo:bar']) may open and read $TEST_SRCDIR/workspace/foo/bar during execution. (Each programming language has its own utility function for accessing the value of $TEST_SRCDIR, but they are all equivalent to using the environment variable directly.) Failure to observe the rule will cause the test to fail when it is executed on a remote testing host.
• *_library rules specify separately-compiled modules in the given programming language. Libraries can depend on other libraries, and binaries and tests can depend on libraries, with the expected separate-compilation behavior.
Dependencies
A target A depends upon a target B if B is needed by A at build or execution time. The depends upon relation induces a Directed Acyclic Graph (DAG) over targets, and we call this a dependency graph. A target's direct dependencies are those other targets reachable by a path of length 1 in the dependency graph. A target's transitive dependencies are those targets upon which it depends via a path of any length through the graph.
In fact, in the context of builds, there are two dependency graphs, the graph of actual dependencies and the graph of declared dependencies. Most of the time, the two graphs are so similar that this distinction need not be made, but it is useful for the discussion below.
Actual and declared dependencies
A target X is actually dependent on target Y iff Y must be present, built and up-to-date in order for X to be built correctly. "Built" could mean generated, processed, compiled, linked, archived, compressed, executed, or any of the other kinds of tasks that routinely occur during a build.
A target X has a declared dependency on target Y iff there is a dependency edge from X to Y in the package of X.
For correct builds, the graph of actual dependencies A must be a subgraph of the graph of declared dependencies D. That is, every pair of directly-connected nodes x --> y in A must also be directly connected in D. We say D is an overapproximation of A.
It is important that it not be too much of an overapproximation, though, since redundant declared dependencies can make builds slower and binaries larger.
What this means for BUILD file writers is that every rule must explicitly declare all of its actual direct dependencies to the build system, and no more. Failure to observe this principle causes undefined behavior: the build may fail, but worse, the build may depend on some prior operations, or upon which transitive declared dependencies the target happens to have. The build tool attempts aggressively to check for missing dependencies and report errors, but it is not possible for this checking to be complete in all cases.
You need not (and should not) attempt to list everything indirectly imported, even if it is "needed" by A at execution time.
During a build of target X, the build tool inspects the entire transitive closure of dependencies of X to ensure that any changes in those targets are reflected in the final result, rebuilding intermediates as needed.
The transitive nature of dependencies leads to a common mistake. Through careless programming, code in one file may use code provided by an indirect dependency, i.e. a transitive but not direct edge in the declared dependency graph. Indirect dependencies do not appear in the BUILD file. Since the rule doesn't directly depend on the provider, there is no way to track changes, as shown in the following example timeline:
1. At first, everything works
The code in package a uses code in package b. The code in package b uses code in package c, and thus a transitively depends on c.
a/BUILD
rule(
name = "a",
srcs = "a.in",
deps = "//b:b",
)
a/a.in
import b;
b.foo();
b/BUILD
rule(
name = "b",
srcs = "b.in",
deps = "//c:c",
)
b/b.in
import c;
function foo() {
c.bar();
}
Declared dependency graph: a --> b --> c
Actual dependency graph: a --> b --> c
The declared dependencies overapproximate the actual dependencies. All is well.
2. A latent hazard is introduced.
Someone carelessly adds code to a that creates a direct actual dependency on c, but forgets to declare it.
a/a.in
import b;
import c;
b.foo();
c.garply();
Declared dependency graph: a --> b --> c
Actual dependency graph: a --> b -->_c
\_________/|
The declared dependencies no longer overapproximate the actual dependencies. This may build ok, because the transitive closures of the two graphs are equal, but masks a problem: a has an actual but undeclared dependency on c.
3. The hazard is revealed
Someone refactors b so that it no longer depends on c, inadvertently breaking a through no fault of their own.
b/BUILD
rule(
name = "b",
srcs = "b.in",
deps = "//d:d",
)
b/b.in
import d;
function foo() {
d.baz();
}
Declared dependency graph: a --> b c
Actual dependency graph: a --> b _c
\_________/|
The declared dependency graph is now an underapproximation of the actual dependencies, even when transitively closed; the build is likely to fail. The problem could have been averted by ensuring that the actual dependency from a to c introduced in Step 2 was properly declared in the BUILD file.
Types of dependencies
Most build rules have three attributes for specifying different kinds of generic dependencies: srcs, deps and data. These are explained below. See also Attributes common to all rules in the Build Encyclopedia.
Many rules also have additional attributes for rule-specific kinds of dependency, e.g. compiler, resources, etc. These are detailed in the Build Encyclopedia.
srcs dependencies
Files consumed directly by the rule or rules that output source files.
deps dependencies
Rule pointing to separately-compiled modules providing header files, symbols, libraries, data, etc.
data dependencies
A build target might need some data files to run correctly. These data files aren't source code: they don't affect how the target is built. For example, a unit test might compare a function's output to the contents of a file. When we build the unit test, we don't need the file; but we do need it when we run the test. The same applies to tools that are launched during execution.
The build system runs tests in an isolated directory where only files listed as "data" are available. Thus, if a binary/library/test needs some files to run, specify them (or a build rule containing them) in data. For example:
# I need a config file from a directory named env:
java_binary(
name = "setenv",
...
data = [":env/default_env.txt"],
)
# I need test data from another directory
sh_test(
name = "regtest",
srcs = ["regtest.sh"],
data = [
"//data:file1.txt",
"//data:file2.txt",
...
],
)
These files are available using the relative path path/to/data/file. In tests, it is also possible to refer to them by joining the paths of the test's source directory and the workspace-relative path, e.g. ${TEST_SRCDIR}/workspace/path/to/data/file.
Using Labels to Reference Directories
As you look over our BUILD files, you might notice that some data labels refer to directories. These labels end with /. or / like so:
data = ["//data/regression:unittest/."] # don't use this
or like so:
data = ["testdata/."] # don't use this
or like so:
data = ["testdata/"] # don't use this
This seems convenient, particularly for tests (since it allows a test to use all the data files in the directory).
But try not to do this. In order to ensure correct incremental rebuilds (and re-execution of tests) after a change, the build system must be aware of the complete set of files that are inputs to the build (or test). When you specify a directory, the build system will perform a rebuild only when the directory itself changes (due to addition or deletion of files), but won't be able to detect edits to individual files as those changes do not affect the enclosing directory. Rather than specifying directories as inputs to the build system, you should enumerate the set of files contained within them, either explicitly or using the glob() function. (Use ** to force the glob() to be recursive.)
data = glob(["testdata/**"]) # use this instead
Unfortunately, there are some scenarios where directory labels must be used. For example, if the testdata directory contains files whose names do not conform to the strict label syntax (e.g. they contain certain punctuation symbols), then explicit enumeration of files, or use of the glob() function will produce an invalid labels error. You must use directory labels in this case, but beware of the concomitant risk of incorrect rebuilds described above.
If you must use directory labels, keep in mind that you can't refer to the parent package with a relative "../" path; instead, use an absolute path like "//data/regression:unittest/.".
Note that directory labels are only valid for data dependencies. If you try to use a directory as a label in an argument other than data, it will fail and you will get a (probably cryptic) error message. | {
"url": "https://docs.bazel.build/versions/1.0.0/build-ref.html",
"source_domain": "docs.bazel.build",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "68486",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HLDRM6VCV664U677GJHERYNBEKV6A4CX",
"WARC-Concurrent-To": "<urn:uuid:9b5a072f-38cf-4e12-af89-0b238ed95269>",
"WARC-Date": "2020-10-28T11:48:13Z",
"WARC-IP-Address": "130.211.22.235",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CQENPB52Q3HOREJI4L7C5DI7UK7ELDIH",
"WARC-Record-ID": "<urn:uuid:7d18cff4-0e87-4f15-b4d0-cc32db107a01>",
"WARC-Target-URI": "https://docs.bazel.build/versions/1.0.0/build-ref.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:406ce3a0-1e90-4a30-b78c-c8dcc204660e>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-124.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,
25,
26,
122,
123,
141,
142,
155,
156,
494,
495,
527,
528,
538,
539,
884,
885,
1119,
1120,
1133,
1134,
1352,
1353,
1524,
1525,
1772,
1773,
1782,
1783,
1948,
1949,
2225,
2226,
2421,
2422,
2439,
2457,
2483,
2506,
2531,
2532,
2540,
2541,
2770,
2771,
3058,
3059,
3494,
3495,
4029,
4030,
4480,
4481,
4735,
4736,
5233,
5234,
5241,
5242,
5382,
5383,
5415,
5416,
5582,
5583,
5608,
5609,
5926,
5927,
5936,
5949,
5950,
6242,
6243,
6460,
6461,
6474,
6483,
6488,
6492,
6493,
6622,
6623,
6763,
6764,
6776,
6795,
6796,
6945,
6946,
7381,
7382,
7448,
7491,
7492,
7881,
7882,
7915,
7916,
8427,
8428,
8460,
8461,
9307,
9308,
9689,
9690,
9920,
9921,
9955,
9956,
10252,
10253,
10435,
10436,
10591,
10592,
10662,
10663,
10669,
10670,
10959,
10960,
11408,
11409,
11420,
11441,
11467,
11480,
11503,
11529,
11536,
11538,
11539,
12108,
12109,
12284,
12285,
12966,
12967,
13126,
13127,
13139,
13140,
13321,
13322,
13523,
13524,
14105,
14106,
14470,
14471,
14713,
14714,
14848,
14849,
15200,
15201,
15222,
15223,
15327,
15370,
16106,
16165,
16387,
16454,
16657,
16658,
16678,
16679,
17084,
17085,
17341,
17342,
17613,
17614,
17755,
17756,
18297,
18298,
18527,
18528,
18541,
18542,
18972,
18973,
19245,
19246,
19279,
19280,
19570,
19571,
19684,
19685,
19938,
19939,
20094,
20095,
20623,
20624,
20749,
20750,
20968,
20969,
21391,
21392,
21422,
21423,
21553,
21554,
21562,
21563,
21569,
21585,
21604,
21624,
21626,
21627,
21634,
21635,
21645,
21654,
21655,
21663,
21664,
21670,
21686,
21705,
21725,
21727,
21728,
21735,
21736,
21746,
21763,
21774,
21776,
21818,
21819,
21861,
21941,
21942,
21976,
21977,
22084,
22085,
22092,
22093,
22103,
22113,
22122,
22134,
22176,
22177,
22219,
22261,
22487,
22488,
22514,
22515,
22626,
22627,
22635,
22636,
22642,
22658,
22677,
22697,
22699,
22700,
22707,
22708,
22718,
22735,
22746,
22748,
22790,
22791,
22833,
22875,
22876,
23172,
23173,
23195,
23196,
23406,
23407,
23566,
23567,
23585,
23586,
23657,
23658,
23676,
23677,
23777,
23778,
23796,
23797,
24178,
24179,
24406,
24407,
24458,
24471,
24492,
24500,
24537,
24539,
24540,
24582,
24591,
24613,
24640,
24653,
24681,
24709,
24721,
24728,
24730,
24731,
24981,
24982,
25020,
25021,
25155,
25156,
25214,
25215,
25227,
25228,
25268,
25269,
25281,
25282,
25321,
25322,
25437,
25438,
26134,
26135,
26184,
26185,
26641,
26642,
26827,
26828
],
"line_end_idx": [
25,
26,
122,
123,
141,
142,
155,
156,
494,
495,
527,
528,
538,
539,
884,
885,
1119,
1120,
1133,
1134,
1352,
1353,
1524,
1525,
1772,
1773,
1782,
1783,
1948,
1949,
2225,
2226,
2421,
2422,
2439,
2457,
2483,
2506,
2531,
2532,
2540,
2541,
2770,
2771,
3058,
3059,
3494,
3495,
4029,
4030,
4480,
4481,
4735,
4736,
5233,
5234,
5241,
5242,
5382,
5383,
5415,
5416,
5582,
5583,
5608,
5609,
5926,
5927,
5936,
5949,
5950,
6242,
6243,
6460,
6461,
6474,
6483,
6488,
6492,
6493,
6622,
6623,
6763,
6764,
6776,
6795,
6796,
6945,
6946,
7381,
7382,
7448,
7491,
7492,
7881,
7882,
7915,
7916,
8427,
8428,
8460,
8461,
9307,
9308,
9689,
9690,
9920,
9921,
9955,
9956,
10252,
10253,
10435,
10436,
10591,
10592,
10662,
10663,
10669,
10670,
10959,
10960,
11408,
11409,
11420,
11441,
11467,
11480,
11503,
11529,
11536,
11538,
11539,
12108,
12109,
12284,
12285,
12966,
12967,
13126,
13127,
13139,
13140,
13321,
13322,
13523,
13524,
14105,
14106,
14470,
14471,
14713,
14714,
14848,
14849,
15200,
15201,
15222,
15223,
15327,
15370,
16106,
16165,
16387,
16454,
16657,
16658,
16678,
16679,
17084,
17085,
17341,
17342,
17613,
17614,
17755,
17756,
18297,
18298,
18527,
18528,
18541,
18542,
18972,
18973,
19245,
19246,
19279,
19280,
19570,
19571,
19684,
19685,
19938,
19939,
20094,
20095,
20623,
20624,
20749,
20750,
20968,
20969,
21391,
21392,
21422,
21423,
21553,
21554,
21562,
21563,
21569,
21585,
21604,
21624,
21626,
21627,
21634,
21635,
21645,
21654,
21655,
21663,
21664,
21670,
21686,
21705,
21725,
21727,
21728,
21735,
21736,
21746,
21763,
21774,
21776,
21818,
21819,
21861,
21941,
21942,
21976,
21977,
22084,
22085,
22092,
22093,
22103,
22113,
22122,
22134,
22176,
22177,
22219,
22261,
22487,
22488,
22514,
22515,
22626,
22627,
22635,
22636,
22642,
22658,
22677,
22697,
22699,
22700,
22707,
22708,
22718,
22735,
22746,
22748,
22790,
22791,
22833,
22875,
22876,
23172,
23173,
23195,
23196,
23406,
23407,
23566,
23567,
23585,
23586,
23657,
23658,
23676,
23677,
23777,
23778,
23796,
23797,
24178,
24179,
24406,
24407,
24458,
24471,
24492,
24500,
24537,
24539,
24540,
24582,
24591,
24613,
24640,
24653,
24681,
24709,
24721,
24728,
24730,
24731,
24981,
24982,
25020,
25021,
25155,
25156,
25214,
25215,
25227,
25228,
25268,
25269,
25281,
25282,
25321,
25322,
25437,
25438,
26134,
26135,
26184,
26185,
26641,
26642,
26827,
26828,
27031
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 27031,
"ccnet_original_nlines": 346,
"rps_doc_curly_bracket": 0.00022196999634616077,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.405049592256546,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018575290217995644,
"rps_doc_frac_lines_end_with_ellipsis": 0.008645529858767986,
"rps_doc_frac_no_alph_words": 0.18845807015895844,
"rps_doc_frac_unique_words": 0.2186405062675476,
"rps_doc_mean_word_length": 4.899322509765625,
"rps_doc_num_sentences": 302,
"rps_doc_symbol_to_word_ratio": 0.0021641100756824017,
"rps_doc_unigram_entropy": 5.616037368774414,
"rps_doc_word_count": 4281,
"rps_doc_frac_chars_dupe_10grams": 0.01935729943215847,
"rps_doc_frac_chars_dupe_5grams": 0.05587871000170708,
"rps_doc_frac_chars_dupe_6grams": 0.034423571079969406,
"rps_doc_frac_chars_dupe_7grams": 0.029178980737924576,
"rps_doc_frac_chars_dupe_8grams": 0.026699719950556755,
"rps_doc_frac_chars_dupe_9grams": 0.026699719950556755,
"rps_doc_frac_chars_top_2gram": 0.011824159882962704,
"rps_doc_frac_chars_top_3gram": 0.004291030112653971,
"rps_doc_frac_chars_top_4gram": 0.002860679989680648,
"rps_doc_books_importance": -2375.2763671875,
"rps_doc_books_importance_length_correction": -2375.2763671875,
"rps_doc_openwebtext_importance": -1393.4403076171875,
"rps_doc_openwebtext_importance_length_correction": -1393.4403076171875,
"rps_doc_wikipedia_importance": -1025.225341796875,
"rps_doc_wikipedia_importance_length_correction": -1025.225341796875
},
"fasttext": {
"dclm": 0.5436878800392151,
"english": 0.9032743573188782,
"fineweb_edu_approx": 3.044903039932251,
"eai_general_math": 0.9933804273605347,
"eai_open_web_math": 0.5038798451423645,
"eai_web_code": 0.9893478155136108
}
} | {
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,710,184,570,961,196,000 | Introduction
Are you looking for a comprehensive guide to help you prepare for the Microsoft PL-300 exam? This guide provides an in-depth overview of the exam topics, exam structure, and strategies to help you pass the exam with flying colors. It covers all the topics in the exam syllabus, from Azure fundamentals to Azure solutions and services, and provides a comprehensive set of practice questions to help you hone your skills. With this guide, you will be able to confidently tackle the PL-300 exam and achieve the certification you desire.
Overview of the PL-300 Exam
The PL-300 exam is a Microsoft certification exam designed to test an individual’s knowledge and skills in developing Microsoft Power Platform solutions. It is intended for individuals who have a basic understanding of the Power Platform and are looking to expand their skillset.
The exam consists of a total of 40-60 questions, which are divided into three main categories: Core Solutions, Advanced Solutions, and Professional Solutions. The Core Solutions section covers the fundamentals of the Power Platform, such as understanding the components of the platform, configuring the environment, and developing basic solutions. The Advanced Solutions section focuses on more complex topics, such as developing custom connectors, creating custom visuals, and leveraging the AI Builder. The Professional Solutions section covers topics such as managing and deploying solutions, monitoring and troubleshooting, and optimizing performance.
The exam is designed to assess an individual’s ability to design, develop, and implement solutions that leverage the Power Platform. It is also intended to measure an individual’s understanding of the platform’s features and capabilities. The exam is offered in both English and Japanese, and is available in both online and in-person formats.
In order to pass the exam, individuals must demonstrate a comprehensive understanding of the Power Platform and its features. This includes knowledge of the platform’s components, its development environment, and its various solutions. Individuals must also demonstrate an understanding of the platform’s capabilities and be able to create and deploy solutions that leverage the platform’s features.
The PL-300 exam is an important step for individuals looking to expand their knowledge and skills in developing Microsoft Power Platform solutions. By passing the exam, individuals can demonstrate their expertise in the platform and prove their ability to create and deploy solutions that leverage the platform’s features.
Strategies for Preparing for the PL-300 Exam
Preparing for the PL-300 exam can be a daunting task, but with the right strategies, you can be confident that you’ll be ready to take the exam. The PL-300 exam is a Microsoft certification exam that tests your knowledge of the Azure platform. It is a challenging exam that requires you to have a thorough understanding of the Azure platform and its components.
The first step in preparing for the PL-300 exam is to become familiar with the exam objectives. Microsoft provides a list of exam objectives on their website that you should review. This will give you an idea of the topics that will be covered on the exam. Once you have a good understanding of the exam objectives, you can begin to focus your studies on the topics that are most relevant to the exam.
The next step is to create a study plan. You should set aside a specific amount of time each day to study for the exam. Make sure to break down your study plan into manageable chunks so that you don’t become overwhelmed. You should also consider using study aids such as practice tests and flashcards to help you retain the information you’re learning.
Another important step in preparing for the PL-300 exam is to gain hands-on experience with the Azure platform. You can do this by signing up for a free Azure trial or by using the Azure sandbox. This will allow you to get familiar with the Azure platform and its components. You can also use online tutorials and documentation to learn more about the Azure platform.
Finally, you should consider taking a practice exam. Taking a practice exam will help you get an idea of the types of questions that will be on the exam. It will also help you identify any areas where you need to focus your studies.
By following these strategies, you can be confident that you’ll be well-prepared for the PL-300 exam. With the right preparation, you can be sure that you’ll be ready to take the exam and earn your Microsoft certification.
Exam Content and Format
Exam Content and Format are two of the most important aspects of any exam. Exam Content refers to the material that is covered on the exam, while Exam Format refers to the way in which the exam is administered.
Exam Content is typically determined by the instructor or professor. It should include topics that are relevant to the course material and should be appropriate for the level of the course. For example, a basic introductory course may cover topics such as basic math, English, and history, while an advanced course may cover more complex topics such as calculus, chemistry, and economics. The instructor should provide a syllabus that outlines the topics that will be covered on the exam.
Exam Format is also determined by the instructor or professor. It should be designed to assess the student’s knowledge and understanding of the course material. The format of the exam can vary depending on the type of course. For example, a multiple-choice exam may be used for a basic course, while an essay exam may be used for an advanced course.
In addition to the content and format of the exam, the instructor should also provide instructions for taking the exam. This should include information about the time limit, the number of questions, and any other rules or guidelines that should be followed. It is important for students to read and understand the instructions before taking the exam.
Finally, the instructor should provide a grading system for the exam. This should include the criteria for grading the exam, as well as the criteria for passing the exam. It is important for students to understand the grading system before taking the exam, so that they can properly prepare for it.
Exam Content and Format are essential components of any exam. It is important for instructors to provide clear and concise instructions for taking the exam, as well as a grading system that is fair and consistent. By following these guidelines, students can ensure that they are adequately prepared for the exam and can maximize their chances of success.
PL-300
Tips for Maximizing Your PL-300 Exam Score
Maximizing your score on the PL-300 exam can be a daunting task, but with the right tips and strategies, you can ensure that you are well-prepared and ready to ace the exam. Here are some tips for maximizing your PL-300 exam score:
1. Understand the Exam Structure: Before taking the exam, make sure you understand the structure of the exam. Familiarize yourself with the types of questions, the time limits, and the overall format of the exam. This will help you better plan your approach to the exam and make sure you are well-prepared.
2. Study the Exam Content: The PL-300 exam covers a wide range of topics, so it is important to study the content thoroughly. Make sure you understand the key concepts and the different technologies covered in the exam.
3. Practice with Sample Questions: Practice makes perfect! Make sure you are familiar with the types of questions that will be asked on the exam by practicing with sample questions. This will help you become more comfortable with the exam format and the types of questions you will be asked.
4. Utilize Study Resources: Take advantage of the various study resources available for the PL-300 exam. These include practice tests, study guides, and online courses. These resources can help you better understand the material and prepare for the exam.
5. Manage Your Time: Time management is key when taking the PL-300 exam. Make sure you are aware of the time limits for each section and plan your approach accordingly. This will help you make sure you are able to answer all the questions within the allotted time.
By following these tips, you can ensure that you are well-prepared for the PL-300 exam and maximize your score. Good luck!
Preparing for the Microsoft PL-300 exam can be a daunting task. The exam is designed to test your knowledge and understanding of the Microsoft Power Platform, and it requires a comprehensive understanding of the platform and its components. Fortunately, there are a variety of resources available to help you prepare for the exam.
The Microsoft Learning website is a great place to start. It offers a variety of courses and materials to help you prepare for the exam. The Microsoft Power Platform Fundamentals course is a great place to start. It provides an overview of the Power Platform and its components, as well as an introduction to the concepts and terminology used in the exam. Additionally, the Microsoft Power Platform App Maker course provides an in-depth look at the App Maker feature of the Power Platform.
Another great resource is the Microsoft Power Platform Learning Path. This is a comprehensive guide to the Power Platform and its components. It includes detailed information on the different components of the platform, as well as step-by-step instructions for creating and managing Power Platform applications. Additionally, the Learning Path includes practice tests and sample questions to help you prepare for the exam.
The Microsoft Power Platform Community is also a great resource for exam preparation. The community is a great place to ask questions and get advice from experienced Power Platform users. Additionally, the community offers a variety of resources, such as tutorials, sample code, and best practices.
Finally, there are a variety of third-party resources available to help you prepare for the exam. Exam-Labs is a great resource for practice tests and sample questions. Additionally, Udemy offers a variety of courses and materials to help you prepare for the exam.
Overall, there are a variety of resources available to help you prepare for the Microsoft PL-300 exam. From the Microsoft Learning website to the Microsoft Power Platform Community, there are a variety of resources to help you gain a comprehensive understanding of the Power Platform and its components. Additionally, there are a variety of third-party resources available to help you prepare for the exam.
Conclusion
In conclusion, the PL-300 Exam is a challenging yet rewarding certification that requires comprehensive preparation. By following the tips and strategies outlined in this guide, you can be confident that you are well-prepared for the exam. With a thorough understanding of the exam objectives, a comprehensive study plan, and plenty of practice, you can increase your chances of success and achieve the certification you desire. | {
"url": "https://pass2dumps.com/pl-300-power-bi-data-analyst/",
"source_domain": "pass2dumps.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "123050",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JZ35ZB35GHEYALK4QS7VMY6XWYB4YG2U",
"WARC-Concurrent-To": "<urn:uuid:4a6b6195-69b8-4cbd-8cb7-59c7ab6f28c8>",
"WARC-Date": "2023-09-22T21:22:37Z",
"WARC-IP-Address": "172.67.210.149",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EEQXOH6USFLMDT4E6X4BOPYJTFHOERB2",
"WARC-Record-ID": "<urn:uuid:af556aaf-7551-443d-87f1-1f3201d39a5a>",
"WARC-Target-URI": "https://pass2dumps.com/pl-300-power-bi-data-analyst/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2c556cf0-f08a-40d0-b72c-b9d131563f8c>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-129\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,
13,
14,
548,
549,
578,
579,
859,
860,
1516,
1517,
1861,
1862,
2262,
2263,
2586,
2587,
2633,
2634,
2996,
2997,
3399,
3400,
3753,
3754,
4122,
4123,
4356,
4357,
4580,
4581,
4606,
4607,
4818,
4819,
5308,
5309,
5659,
5660,
6011,
6012,
6311,
6312,
6667,
6668,
6675,
6676,
6720,
6721,
6953,
6954,
7261,
7262,
7482,
7483,
7775,
7776,
8031,
8032,
8297,
8298,
8421,
8422,
8753,
8754,
9244,
9245,
9668,
9669,
9968,
9969,
10234,
10235,
10642,
10643,
10654,
10655
],
"line_end_idx": [
13,
14,
548,
549,
578,
579,
859,
860,
1516,
1517,
1861,
1862,
2262,
2263,
2586,
2587,
2633,
2634,
2996,
2997,
3399,
3400,
3753,
3754,
4122,
4123,
4356,
4357,
4580,
4581,
4606,
4607,
4818,
4819,
5308,
5309,
5659,
5660,
6011,
6012,
6311,
6312,
6667,
6668,
6675,
6676,
6720,
6721,
6953,
6954,
7261,
7262,
7482,
7483,
7775,
7776,
8031,
8032,
8297,
8298,
8421,
8422,
8753,
8754,
9244,
9245,
9668,
9669,
9968,
9969,
10234,
10235,
10642,
10643,
10654,
10655,
11083
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 11083,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4411483407020569,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011004780419170856,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12727272510528564,
"rps_doc_frac_unique_words": 0.20821766555309296,
"rps_doc_mean_word_length": 5.007218360900879,
"rps_doc_num_sentences": 103,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.920922756195068,
"rps_doc_word_count": 1801,
"rps_doc_frac_chars_dupe_10grams": 0.0738523006439209,
"rps_doc_frac_chars_dupe_5grams": 0.3203592896461487,
"rps_doc_frac_chars_dupe_6grams": 0.22466179728507996,
"rps_doc_frac_chars_dupe_7grams": 0.18995343148708344,
"rps_doc_frac_chars_dupe_8grams": 0.15546683967113495,
"rps_doc_frac_chars_dupe_9grams": 0.1321800798177719,
"rps_doc_frac_chars_top_2gram": 0.03881127014756203,
"rps_doc_frac_chars_top_3gram": 0.021290749311447144,
"rps_doc_frac_chars_top_4gram": 0.014193830080330372,
"rps_doc_books_importance": -920.39013671875,
"rps_doc_books_importance_length_correction": -920.39013671875,
"rps_doc_openwebtext_importance": -458.1763916015625,
"rps_doc_openwebtext_importance_length_correction": -458.1763916015625,
"rps_doc_wikipedia_importance": -384.9781799316406,
"rps_doc_wikipedia_importance_length_correction": -384.9781799316406
},
"fasttext": {
"dclm": 0.15225130319595337,
"english": 0.9353392124176025,
"fineweb_edu_approx": 2.51257061958313,
"eai_general_math": 0.307822585105896,
"eai_open_web_math": 0.18164986371994019,
"eai_web_code": 0.06858652830123901
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-3,488,448,694,219,705,000 | Deploying Django: How do you do it?
I have tried following guides like this one but it just didnt work for me.
So my question is this: What is a good guide for deploying Django, and how do you deploy your Django.
I keep hearing that capastrano is pretty nifty to use, but i have no idea as to how to work it or what it does (apart from automation of deploying code), or even if i want/need to use it or not.
Asked by: Tess655 | Posted: 28-01-2022
Answer 1
mod_wsgi in combination with a virtualenv for all the dependencies, a mercurial checkout into the virtualenv and a fabric recipe to check out the changes on the server.
I wrote an article about my usual workflow: Deploying Python Web Applications. Hope that helps.
Answered by: Kellan363 | Posted: 01-03-2022
Answer 2
I have had success with mod_wsgi
Answered by: Emily774 | Posted: 01-03-2022
Answer 3
In my previous work we had real genius guy on deployment duties, he deployed application (Python, SQL, Perl and Java code) as set of deb files built for Ubuntu. Unfortunately now, I have no such support. We are deploying apps manually to virtualenv-ed environments with separate nginx configs for FastCGI. We use paver to deploy to remote servers. It's painful, but it works.
Answered by: Ada516 | Posted: 01-03-2022
Answer 4
This looks like a good place to start: http://www.unessa.net/en/hoyci/2007/06/using-capistrano-deploy-django-apps/
Answered by: Thomas717 | Posted: 01-03-2022
Answer 5
I use mod_python, and have every site in a git repository with the following subdirs:
• mysite
• template
• media
I have mysite/settings.py in .gitignore, and work like this:
1. do development on my local machine
2. create remote repository on webserver
3. push my changes to webserver repo
4. set up apache vhost config file, tweak live server settings.py
5. run git checkout && git reset --hard && sudo /etc/init.d/apache2 restart on webserver repo to get up-to-date version to its working copy and restart apache
6. repeat steps 1, 3 and 5 whenever change request comes
Answered by: Alissa422 | Posted: 01-03-2022
Answer 6
The easiest way would be to use one of the sites on http://djangofriendly.com/hosts/ that will provide the hosting and set up for you, but even if you're wanting to roll your own it will allow you to see what set up other sites are using.
Answered by: Marcus497 | Posted: 01-03-2022
Similar questions
python - Django: do I need to restart Apache when deploying?
I just noted an annoying factor: Django requires either a restart of the server or CGI access to work. The first option is not feasible if you don't have access to the Apache server process. The second, as far as I know, is detrimental to performance, and in general the idea of running a CGI makes me uncomfortable. I also ...
python - Deploying Google Analytics With Django
We're about to deploy a new Django website, and we want to use Google Analytics to keep track of traffic on the site. However, we don't want all of the hits on development instances to contribute to the Google Analytics statistics. There are a few ways we could deal with this: have a configuration option in settings.py which the base template uses to decide whether or not to include the appropriate
python - Error while deploying Django on Apache
I have a small Django website which I am trying to run on an Apache 2.2 HTTP-Server. The application is running fine using "python manage.py runserver". Django Version: 1.0.2 final Python: 2.5 OS: Windows 2000 I wen't through the steps described in the documentation and after some fiddling...
python - Deploying Pylons with Nginx reverse proxy?
Is there a tutorial on how to deploy Pylons with Nginx? I've been able to start nginx and then serve pylons to :8080 with paster serve development.ini However, I can't seem to do other stuff as pylons locks me into that serve mode. If I try to CTRL+Z out of pylons serving to do other stuff on my server, pylons goes down. There must be a different method of deployment. PS - I've done all thi...
python - Deploying Django
When finding web hosting for Rails apps, the hoster must have support for ruby on rails -- that is evident. What about hosting for Django? What support does the hoster need to provide? Python, or more than just Python? This might seem like an obvious question, but I'm new to web development frameworks so I must ask :)
python - Django: do I need to restart Apache when deploying?
I just noted an annoying factor: Django requires either a restart of the server or CGI access to work. The first option is not feasible if you don't have access to the Apache server process. The second, as far as I know, is detrimental to performance, and in general the idea of running a CGI makes me uncomfortable. I also ...
python - Deploying CherryPy (daemon)
I've followed the basic CherryPy tutorial (http://www.cherrypy.org/wiki/CherryPyTutorial). One thing not discussed is deployment. How can I launch a CherryPy app as a daemon and "forget about it"? What happens if the server reboots? Is there a standard recipe? Maybe something that will create a service script (/etc/init.d/cherry...
python - Auto kill fastcgi process when deploying django
Everything goes well days ago. But since today, when I run fastcgi, the process will be killed by system automatically. The worst thing is I don't know why and which process kill the fastcgi process. Let me give some detail. we use nginx to serve static files for another django app which listen to 80 port.(this is for production use) And we use lighttpd/fastcgi for another two django apps, which li...
python - Deploying Pylons with uWSGI
We're trying to move our intranet to Pylons. My boss is trying to set up Pylons to use uWSGI behind Apache so he can set up multiple, independent applications. However, he's having a difficult time getting it set up, with some apparent code problems in the C source code for uWSGI. Does anyone have any suggestions for how to deploy Pylons applications that might help us out? Thanks, Doug
python - Settings module not found deploying django on a shared server
I'm trying to deploy my django project on a shared hosting as describe here I have my project on /home/user/www/testa I'm using this script #!/usr/bin/python import sys, os sys.path.append("/home/user/bin/python") sys.path.append('/...
python - Deploying Django (fastcgi, apache mod_wsgi, uwsgi, gunicorn)
Can someone explain the difference between apache mod_wsgi in daemon mode and django fastcgi in threaded mode. They both use threads for concurrency I think. Supposing that I'm using nginx as front end to apache mod_wsgi. UPDATE: I'm comparing django built in fastcgi(./manage.py method=threaded maxchildren=15) and mod_wsgi in 'daemon' mode(WSGIDaemonProcess example threads=...
Still can't find your answer? Check out these communities...
PySlackers | Full Stack Python | NHS Python | Pythonist Cafe | Hacker Earth | Discord Python
top | {
"url": "https://www.pnpsummit.com/show-question/769/python-deploying-django-how-do-you-do-it",
"source_domain": "www.pnpsummit.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "20667",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OOLKPFMMHVU2H2QGUGOSQXQDOMZ5FF7J",
"WARC-Concurrent-To": "<urn:uuid:57e5f1e4-d35f-4fdb-b43a-72f9f23d4135>",
"WARC-Date": "2023-03-30T15:22:07Z",
"WARC-IP-Address": "142.251.163.121",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4VRVZE4N7QLZRBMBDNYDURKSB6NOCLJV",
"WARC-Record-ID": "<urn:uuid:37cd587f-bc09-4ccb-8afe-e200a857af57>",
"WARC-Target-URI": "https://www.pnpsummit.com/show-question/769/python-deploying-django-how-do-you-do-it",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f92b7cc0-9747-4f77-9fb8-6810a07f9600>"
},
"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-195\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,
36,
37,
112,
113,
215,
216,
411,
412,
413,
452,
453,
454,
455,
456,
457,
458,
467,
468,
637,
638,
734,
735,
779,
780,
781,
782,
791,
792,
825,
826,
869,
870,
871,
872,
881,
882,
1258,
1259,
1300,
1301,
1302,
1303,
1312,
1313,
1428,
1429,
1473,
1474,
1475,
1476,
1485,
1486,
1572,
1573,
1584,
1597,
1607,
1608,
1669,
1670,
1710,
1753,
1792,
1860,
2021,
2080,
2081,
2125,
2126,
2127,
2128,
2137,
2138,
2377,
2378,
2422,
2423,
2424,
2425,
2443,
2444,
2505,
2506,
2834,
2835,
2836,
2884,
2885,
3287,
3288,
3289,
3337,
3338,
3632,
3633,
3634,
3686,
3687,
4084,
4085,
4086,
4112,
4113,
4433,
4434,
4435,
4496,
4497,
4825,
4826,
4827,
4864,
4865,
5199,
5200,
5201,
5258,
5259,
5664,
5665,
5666,
5703,
5704,
6094,
6095,
6096,
6167,
6168,
6404,
6405,
6406,
6476,
6477,
6857,
6858,
6859,
6860,
6861,
6862,
6863,
6924,
6925,
6926,
6927,
7020,
7021,
7022,
7023
],
"line_end_idx": [
36,
37,
112,
113,
215,
216,
411,
412,
413,
452,
453,
454,
455,
456,
457,
458,
467,
468,
637,
638,
734,
735,
779,
780,
781,
782,
791,
792,
825,
826,
869,
870,
871,
872,
881,
882,
1258,
1259,
1300,
1301,
1302,
1303,
1312,
1313,
1428,
1429,
1473,
1474,
1475,
1476,
1485,
1486,
1572,
1573,
1584,
1597,
1607,
1608,
1669,
1670,
1710,
1753,
1792,
1860,
2021,
2080,
2081,
2125,
2126,
2127,
2128,
2137,
2138,
2377,
2378,
2422,
2423,
2424,
2425,
2443,
2444,
2505,
2506,
2834,
2835,
2836,
2884,
2885,
3287,
3288,
3289,
3337,
3338,
3632,
3633,
3634,
3686,
3687,
4084,
4085,
4086,
4112,
4113,
4433,
4434,
4435,
4496,
4497,
4825,
4826,
4827,
4864,
4865,
5199,
5200,
5201,
5258,
5259,
5664,
5665,
5666,
5703,
5704,
6094,
6095,
6096,
6167,
6168,
6404,
6405,
6406,
6476,
6477,
6857,
6858,
6859,
6860,
6861,
6862,
6863,
6924,
6925,
6926,
6927,
7020,
7021,
7022,
7023,
7026
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7026,
"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.3534083366394043,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031105229631066322,
"rps_doc_frac_lines_end_with_ellipsis": 0.060402680188417435,
"rps_doc_frac_no_alph_words": 0.22038385272026062,
"rps_doc_frac_unique_words": 0.38536155223846436,
"rps_doc_mean_word_length": 4.781305313110352,
"rps_doc_num_sentences": 92,
"rps_doc_symbol_to_word_ratio": 0.006618130020797253,
"rps_doc_unigram_entropy": 5.48745584487915,
"rps_doc_word_count": 1134,
"rps_doc_frac_chars_dupe_10grams": 0.1172998920083046,
"rps_doc_frac_chars_dupe_5grams": 0.1172998920083046,
"rps_doc_frac_chars_dupe_6grams": 0.1172998920083046,
"rps_doc_frac_chars_dupe_7grams": 0.1172998920083046,
"rps_doc_frac_chars_dupe_8grams": 0.1172998920083046,
"rps_doc_frac_chars_dupe_9grams": 0.1172998920083046,
"rps_doc_frac_chars_top_2gram": 0.019365549087524414,
"rps_doc_frac_chars_top_3gram": 0.018443379551172256,
"rps_doc_frac_chars_top_4gram": 0.005533009767532349,
"rps_doc_books_importance": -659.1991577148438,
"rps_doc_books_importance_length_correction": -659.1991577148438,
"rps_doc_openwebtext_importance": -439.97637939453125,
"rps_doc_openwebtext_importance_length_correction": -439.97637939453125,
"rps_doc_wikipedia_importance": -313.51507568359375,
"rps_doc_wikipedia_importance_length_correction": -313.51507568359375
},
"fasttext": {
"dclm": 0.25471049547195435,
"english": 0.9094770550727844,
"fineweb_edu_approx": 1.663139820098877,
"eai_general_math": 0.46112585067749023,
"eai_open_web_math": 0.08794230222702026,
"eai_web_code": 0.9133438467979431
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,244,070,460,471,916,000 | Warning
This wiki is very out of date, and only exists for historical reasons. For more modern information, see the new documentation and cookbook forum.
renpy/releases/6.7.0
From Ren'Py Visual Novel Engine
Jump to: navigation, search
Rather than linking to this page, please consider linking to the Download Ren'Py page, which will be updated when a new version of Ren'Py is released.
Ren'Py 6.7.0 "Splines or Skins"
Ren'Py 6.7.0 "Splines or Skins" was released on September 10, 2008. The main distributions are:
(The current release is internally known as 6.7.0c.)
Each of these files contains the full Ren'Py development environment, which is enough to allow you to develop Ren'Py games on Windows 98 and up, Mac OS X 10.4 and up, and Linux x86. The development environment contains the files needed to produce games for all three platforms. It also includes a text editor and sample game.
Ren'Py is licensed under a very liberal license, that allows for free commercial and non-commercial use. Read the full license for details, but a short summary is that you can distribute Ren'Py games however you want, as long as you include LICENSE.txt.
For your convenience, we've posted the Release Announcement and Changelog.
Known Issues
2008-08-12:
Bugs with the presplash and transition code forced a re-release. If you have 6.7.0b, please upgrade to 6.7.0c.
Release Announcement
I'm pleased to announce the release of Ren'Py 6.7.0 "Splines or Skins". This release is named after the two biggest new features: Bézier spline-based motions and the ability to use imagemaps to skin the game menu. This release also introduces saving to the user's home directory, allowing a game to be installed for all users of the system. This release also include a host of new features, simplifications, and bug fixes.
I'd like to thank Aenakume for contributing the new spline motion code. I'd also like to thank everyone who contributed to Ren'Py by editing the wiki, answering users' questions, reporting bugs, or requesting new features.
Downloads of 6.7.0 and a full release announcement can be found at:
http://www.renpy.org/wiki/renpy/releases/6.7.0
To migrate your game from Ren'Py 6.6.0 or later, copy the directory containing your game into the directory containing the new Ren'Py. To support home directory saving, you'll want to add the following code to the start options.rpy.
python early:
config.save_directory = "gamename-12345"
Replace gamename with the name of your game, and 12345 with a large random number, to ensure that the name is unique.
Please see the 6.6.0 release notes for information about migrating from older releases.
Changelog for Ren'Py 6.7.0
The new layout.imagemap_navigation, layout.imagemap_preferences, layout.imagemap_load_save, and layout.imagemap_yesno_prompt layouts allow one to use imagemaps to define the game menu. Together with the existing layout.imagemap_main_menu, the entire interface can now be themed with imagemaps. (except for the rarely-used joystick preferences)
The new SplineMotion motion function, contributed by Aenakume, allows motions to be specified using linear, quadratic, or cubic splines. This allows complex non-linear motions to be specified. A spline editor can be downloaded from: http://www.renpy.org/wiki/renpy/Spline_Editor
The new SizeZoom motion function allows displayables to be scaled to a specific size. Along with SizeZoom, the Zoom and FactorZoom functions get a new repeat argument that makes the zooms repeat.
If the new config.save_directory variable is set, Ren'Py will now try to save games and persistent data underneath the user's home directory. The precise directory saved to varies by platform:
• Windows: %APPDATA%/RenPy/<save_directory>
• Mac OS X: ~/Library/RenPy/<save_directory>
• Linux/Other: ~/.renpy/<save_directory>
Newly-created projects will have config.save_directory set to a value based on the project name.
Since finding the save directory is now more difficult, the launcher has gained an option that allows the user to easily delete a game's persistent data.
A new variable, nvl_variant, allows one to change the styles used by nvl-mode. For example, if nvl_variant is set to "foo", then style.nvl_window["foo"] will be used instead of style.nvl_window.
The renpy.full_restart function now takes an argument that lets one specify the label that will be restarted to. By calling renpy.full_restart(label="start"), one can start a new game.
Software-drawn mouse cursors are now hidden when the mouse leaves the window. Previously, the mouse cursor would be kept around in the same place until the mouse re-entered the window.
The \ character is now the universal quote character. One can use \% to prevent % from performing interpolation, and \{ to prevent { from starting a text tag.
Using stdin for the remote control didn't work on Windows, and could lead to errors in some cases. Instead, the remote control mode now uses a file, which gets deleted after processing the command.
Improved the numerical stability of interpolation. This fixes a problem where moves could wiggle from side to side for no good reason.
The archiver will now cowardly refuse to archive .ttf files. This is because reading those files out of an archive will crash on windows.
The new config.clear_layers variable allows layers to be cleared out when entering the game and main menus.
Fixed style inheritance, which in some cases wouldn't pick up the style inherited from.
Fixed a bug that made image prediction fail when a hide statement was encountered.
Fixed a bug that prevented im.AlphaMask and ImageDissolve from working with some images. Also improved the quality of im.AlphaMask, which was incorrectly blending fractional alphas with black.
Fixed a bug where style inheritance did not work properly.
Fixed a bug where the launcher could choke when launching non-English gamedirs.
Fixed a bug that prevented the style inspector from working on animated screens.
Other Downloads
The following downloads may be useful if you want to run a windows-only Ren'Py program on other platforms, or if you plan to port Ren'Py to a new platform. Recent versions of Ren'Py default to producing distributions for all three supported platforms, making these programs rarely necessary.
Personal tools | {
"url": "https://www.renpy.org/wiki/renpy/releases/6.7.0",
"source_domain": "www.renpy.org",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "22769",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WT75IDSUKPPVTLX6NXHENMRP3F2BKTZJ",
"WARC-Concurrent-To": "<urn:uuid:44a3b7bb-db7c-45bf-9686-f4e8218f7e92>",
"WARC-Date": "2017-08-19T03:25:28Z",
"WARC-IP-Address": "204.27.56.35",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FLTV7F63N6ZDRBOAT26LVEWONGSTPGPF",
"WARC-Record-ID": "<urn:uuid:68fa93ec-6992-4529-bb68-bc7c3cb1b00b>",
"WARC-Target-URI": "https://www.renpy.org/wiki/renpy/releases/6.7.0",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:77afd39f-d826-43b0-b0b1-912cd5a59214>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-220-33.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,
8,
9,
155,
156,
177,
178,
210,
211,
239,
240,
391,
392,
424,
425,
521,
522,
575,
576,
902,
903,
1157,
1158,
1233,
1234,
1247,
1248,
1260,
1261,
1372,
1373,
1374,
1395,
1396,
1819,
1820,
2043,
2044,
2112,
2113,
2160,
2161,
2394,
2395,
2409,
2454,
2455,
2573,
2574,
2662,
2663,
2690,
2691,
3035,
3036,
3037,
3316,
3317,
3318,
3514,
3515,
3516,
3709,
3710,
3756,
3803,
3846,
3847,
3944,
3945,
4099,
4100,
4101,
4296,
4297,
4298,
4483,
4484,
4485,
4670,
4671,
4672,
4831,
4832,
4833,
5031,
5032,
5033,
5168,
5169,
5170,
5308,
5309,
5310,
5418,
5419,
5420,
5508,
5509,
5592,
5593,
5786,
5787,
5846,
5847,
5927,
5928,
6009,
6010,
6011,
6027,
6028,
6320,
6321,
6322
],
"line_end_idx": [
8,
9,
155,
156,
177,
178,
210,
211,
239,
240,
391,
392,
424,
425,
521,
522,
575,
576,
902,
903,
1157,
1158,
1233,
1234,
1247,
1248,
1260,
1261,
1372,
1373,
1374,
1395,
1396,
1819,
1820,
2043,
2044,
2112,
2113,
2160,
2161,
2394,
2395,
2409,
2454,
2455,
2573,
2574,
2662,
2663,
2690,
2691,
3035,
3036,
3037,
3316,
3317,
3318,
3514,
3515,
3516,
3709,
3710,
3756,
3803,
3846,
3847,
3944,
3945,
4099,
4100,
4101,
4296,
4297,
4298,
4483,
4484,
4485,
4670,
4671,
4672,
4831,
4832,
4833,
5031,
5032,
5033,
5168,
5169,
5170,
5308,
5309,
5310,
5418,
5419,
5420,
5508,
5509,
5592,
5593,
5786,
5787,
5846,
5847,
5927,
5928,
6009,
6010,
6011,
6027,
6028,
6320,
6321,
6322,
6336
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6336,
"ccnet_original_nlines": 114,
"rps_doc_curly_bracket": 0.00031565999961458147,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33815687894821167,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008377759717404842,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2254379242658615,
"rps_doc_frac_unique_words": 0.45026177167892456,
"rps_doc_mean_word_length": 5.247120380401611,
"rps_doc_num_sentences": 105,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.424401760101318,
"rps_doc_word_count": 955,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.021951710805296898,
"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.009578930214047432,
"rps_doc_frac_chars_top_3gram": 0.008980239741504192,
"rps_doc_frac_chars_top_4gram": 0.01017761044204235,
"rps_doc_books_importance": -475.8271179199219,
"rps_doc_books_importance_length_correction": -475.8271179199219,
"rps_doc_openwebtext_importance": -334.3594055175781,
"rps_doc_openwebtext_importance_length_correction": -334.3594055175781,
"rps_doc_wikipedia_importance": -173.76736450195312,
"rps_doc_wikipedia_importance_length_correction": -173.76736450195312
},
"fasttext": {
"dclm": 0.04744178056716919,
"english": 0.8860989212989807,
"fineweb_edu_approx": 1.4860581159591675,
"eai_general_math": 0.6043386459350586,
"eai_open_web_math": 0.2426530122756958,
"eai_web_code": 0.49552035331726074
}
} | {
"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": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-4,926,920,022,367,586,000 | a
d
WE ARE BRUNN
Let’s Work Together
n
A Comprehensive Guide to Build Innovative Grocery App
Build Innovative Grocery App
A Comprehensive Guide to Build Innovative Grocery App
We are living in an era where things are done in fractions of seconds with the help of apps. Today, people are so much entangled with the day-to-day activities that they are in sheer need of “me time”. The good news is that now we have apps for almost everything from food items to avail home and business loans. The grocery app is a very popular app field because many people are interested in developing one. There are several android app development companies which are helping the business owner in making innovative and quality app. Even some of the existing businessmen are moving forward towards making a successful eCommerce business. Whether you are planning to make this grocery app or you are already in the grocery business, we have every detailed information for the grocery app domain. Do not waste any more time, as already someone might be scrolling on this page to find answers to their app-related queries.
Steps included to Start Grocery Business App
If you are keen to know how to develop a grocery app, you would just need to understand the entire process. In the below segment, we have explained the process from the customer’s point of view. Have a look!
• The Order is Placed by the Customer
From the mobile app, the user will choose their preferable items from the list which is given in the app. The customer also has the facility to choose payment mode of their choices such as apple pay and Google pay.
• Partnered with Various Stores
Anyone who is planning to make a grocery app, this would be their first step. Even the Instacart has all the tie-ups with major companies like American grocery stores, many local stores, and supermarkets. That is why grocery shoppers are allowed to buy items from more than one retailer. If the product is not available in one store, it will be available in a different store. It has solved most of the problems of the consumers who have to run from one store to another and avoid the limitations of physical shopping.
• Personal Shoppers
Each one of us, faces a situation where the shops are closed in the early morning. In our busy schedule, it becomes difficult to make time to visit a store to buy household items. If you are also irritated with your hectic schedule, take relief and just order the things from the grocery store. The modern apps have also the facility of a chat system where the customer can talk to their assigned shopper. There are also part-time workers other than shoppers to whom the work is assigned if they are in the near-by area. The same pattern is also followed by the Uber company.
• The Last Step
In the final step, the order is given to the customer by delivering it to their doorstep. There is an Inbuilt GPS tracking system that helps customers to track their product to receive in the estimated time. Customers are allowed to give tips to their personal shoppers during the delivery time when the payment has to be made. It can be said that on-demand apps are a great way to earn handsome money but it also creates outstanding opportunities for employment.
Grocery app involves several features that give various facilities to the users as per their individual needs. If you are also thinking about how to develop a grocery app, you are on the right page. Let’s begin with the process! Many people are interested in building the app but do not know the practical part, so let’s get started!
• The Login part
As it is important to keep every detail in one database, so each customer has to register themselves before placing the order. One has to combine it with a social media account to make the login step more easy for first-time users. People do not have time to create a new idea by mentioning each and every information.
There is no rule for the login page. It can be anywhere right or left side. The users can also save the password before logging off. You can also add some easy features to login with the assistance of the IOS app development company.
• Every Store Must be Listed
Every store which is displayed in the app must be planned beforehand. They must be in a proper order. It is up to you whether you wish to use the logo of the retailer or their name on the list. When things are well-presented in the app, more and more people are likely to visit the app for buying the products. After the first order, the store will showcase the same products to display in the app. Users have advanced options for customization where they will be able to see their favorite store.
• The Grocery Category is the Next Coming Step
People have thousands of options to buy the groceries from so they will delete the app if they don’t find the required items. It is important to develop the UI/UX in such a way that the customer immediately gets what they are in search of. Once the store has been selected by the customer, they might also need items from the subcategories like vegetables, fruits, dairy, and beverages. When the UI/UX is created in a better way, it enhances the shopping experience, enabling more profits for the business owner.
When the app is bug-free and easy to use, people will not go to their competitors. At times, the pictures of the items are not displayed initially because of a slow app, which is again a drawback of the app. The slow applications have a higher chance to get uninstalled by the user. It is always a good choice to select the grocery app development company that has years of expertise in creating a smooth interface. The user also has the option of the search bar where they can search the item of their choice as the app also provides a considerable suggestion.
• Detailing of the Item
The product page will show various information such as weight, nutritional value, and products which are liked by other customers. Most of the packaged food would contain shelf life. Here, the customers also have the option to rate the product or give it a thumbs up. Some apps provide tasty recipes to the consumer so they get tempted to buy a particular food item.
• Choice of Delivery
Choice of Delivery
(Source: https://mygas.airliquide.no/)
Even if you do not have an idea to build the app, this one feature would be the same for all the delivery services. A list is given where there is detailed information on all the deliveries. So the customers can keep a track of items that are previously delivered. The people also have the facility to reschedule the delivery as per their preferable time.
• Customer Care is the Top-priority
The startup cannot survive without the loyal customer. No one wants the customer to stop using their service because of any reason. Even if all the care is given to build a quality app, you will fail to impress the customer if their needs are not fulfilled in the given time. Generally, the main menu will have the option at the end of customer care. The app will have details like the phone number, live chat option, and email address.
• Tracking is Important
Tracking is Important
(Source: https://www.ft.com/)
If the shoppers have finished picking all the products, they can go directly to the delivery button. This way the customer can have a track where the shopper is and can be ready to receive the order. GPS integration simplifies the whole process.
• Chat Really Helps
When the order is placed, you might want some product that is not added to the list, so you can simply send the message to the shopper so he/she could do it for you. You can solve any of the queries with the help of the message option.
Now let us understand the same process as per the admin’s point of view.
We have arrived at the final stage of building a grocery app. The access to the app is only given to the authentic people of that grocery company.
• Login
Here, there is no such thing as the registration process and very few people have login rights. Moreover, the security factor is really strong because of the confidential data present in the app.
• Shopper Panel
All the activities of the shoppers such as city, location, date of registration, and contact details are present in the panel given here. Also, the admin can add the panel of the highest performing and lowest performing agents.
• Customer Panel
There are thousands of customers present in the market so it is not possible to see data of each and every one. Therefore, the admin can have a panel as per the location of the customers. The admin can also keep the auto-generating data which shows the complete revenue. This way, the admin can understand the customer shopping pattern, which helps in evaluating the demand.
• Notification
The notification could be from various issues. It will include the complaints regarding the technical faults, negative review or can be a suggestion to improve the service or updating the app. The admin can only see those notifications which he/she wants.
• Income Analysis
You can also include the auto-generated system to evaluate the income every day, weekly and monthly basis. This is one of the crucial features for the admin for evaluating the income of the business.
Create a Lucrative Grocery App Today!
Researching the industry, knowing loopholes, and analyzing the current demand of the business is very important. However, you would need to put all research into practice as even now while you are researching there are at least thousands of businessmen who have already started working for their app development. If you have now begun preparing for it, congrats! You have taken the first step towards the success of your business. We hope the above-given information helps you in building a quality grocery app. | {
"url": "https://myappgurus.com/how-to-build-a-grocery-app/",
"source_domain": "myappgurus.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "101924",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FF6QKFZC5GOIT3C7UD73KUEE6ONTEA5K",
"WARC-Concurrent-To": "<urn:uuid:e79e9c40-0540-4b90-8c2b-9b93a6e5bc42>",
"WARC-Date": "2020-01-27T02:10:25Z",
"WARC-IP-Address": "155.254.21.128",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KJQYDKMPXQPSIVAX553S66VYF7C7SLQY",
"WARC-Record-ID": "<urn:uuid:995a5169-2ee1-4323-9890-d0c3fb50cc46>",
"WARC-Target-URI": "https://myappgurus.com/how-to-build-a-grocery-app/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:811f249b-3a77-46f7-8cc1-7f1d775c9425>"
},
"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,
2,
4,
5,
18,
19,
39,
40,
42,
43,
97,
98,
127,
128,
182,
183,
1108,
1109,
1154,
1155,
1363,
1364,
1404,
1405,
1620,
1621,
1655,
1656,
2175,
2176,
2198,
2199,
2775,
2776,
2794,
2795,
3259,
3260,
3594,
3595,
3614,
3615,
3934,
3935,
4169,
4170,
4201,
4202,
4700,
4701,
4750,
4751,
5264,
5265,
5827,
5828,
5854,
5855,
6222,
6223,
6246,
6247,
6266,
6267,
6306,
6307,
6663,
6664,
6702,
6703,
7140,
7141,
7167,
7168,
7190,
7191,
7221,
7222,
7468,
7469,
7491,
7492,
7728,
7729,
7802,
7803,
7950,
7951,
7961,
7962,
8158,
8159,
8177,
8178,
8406,
8407,
8426,
8427,
8802,
8803,
8820,
8821,
9077,
9078,
9098,
9099,
9299,
9300,
9338,
9339
],
"line_end_idx": [
2,
4,
5,
18,
19,
39,
40,
42,
43,
97,
98,
127,
128,
182,
183,
1108,
1109,
1154,
1155,
1363,
1364,
1404,
1405,
1620,
1621,
1655,
1656,
2175,
2176,
2198,
2199,
2775,
2776,
2794,
2795,
3259,
3260,
3594,
3595,
3614,
3615,
3934,
3935,
4169,
4170,
4201,
4202,
4700,
4701,
4750,
4751,
5264,
5265,
5827,
5828,
5854,
5855,
6222,
6223,
6246,
6247,
6266,
6267,
6306,
6307,
6663,
6664,
6702,
6703,
7140,
7141,
7167,
7168,
7190,
7191,
7221,
7222,
7468,
7469,
7491,
7492,
7728,
7729,
7802,
7803,
7950,
7951,
7961,
7962,
8158,
8159,
8177,
8178,
8406,
8407,
8426,
8427,
8802,
8803,
8820,
8821,
9077,
9078,
9098,
9099,
9299,
9300,
9338,
9339,
9850
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9850,
"ccnet_original_nlines": 109,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.47886598110198975,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0067010298371315,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10412371158599854,
"rps_doc_frac_unique_words": 0.31246376037597656,
"rps_doc_mean_word_length": 4.553043365478516,
"rps_doc_num_sentences": 98,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.316139221191406,
"rps_doc_word_count": 1725,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.024700790643692017,
"rps_doc_frac_chars_dupe_6grams": 0.018334610387682915,
"rps_doc_frac_chars_dupe_7grams": 0.018334610387682915,
"rps_doc_frac_chars_dupe_8grams": 0.011713780462741852,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01209575030952692,
"rps_doc_frac_chars_top_3gram": 0.005092950072139502,
"rps_doc_frac_chars_top_4gram": 0.009549270384013653,
"rps_doc_books_importance": -767.7259521484375,
"rps_doc_books_importance_length_correction": -767.7259521484375,
"rps_doc_openwebtext_importance": -494.6489562988281,
"rps_doc_openwebtext_importance_length_correction": -494.6489562988281,
"rps_doc_wikipedia_importance": -347.7572937011719,
"rps_doc_wikipedia_importance_length_correction": -347.7572937011719
},
"fasttext": {
"dclm": 0.04821347817778587,
"english": 0.9641469120979309,
"fineweb_edu_approx": 1.669050693511963,
"eai_general_math": 0.06517553329467773,
"eai_open_web_math": 0.10456740856170654,
"eai_web_code": 0.11067026853561401
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
7,153,874,458,921,464,000 | This is documentation for Mathematica 5, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)
Documentation / Mathematica / Built-in Functions / Graphics and Sound / Graphics Primitives /
SurfaceGraphics
FilledSmallSquare SurfaceGraphics[array] is a representation of a three-dimensional plot of a surface, with heights of each point on a grid specified by values in array.
FilledSmallSquare SurfaceGraphics[array, shades] represents a surface, whose parts are shaded according to the array shades.
FilledSmallSquare SurfaceGraphics can be displayed using Show.
FilledSmallSquare SurfaceGraphics has the same options as Graphics3D, with the following additions:
FilledSmallSquare SurfaceGraphics does not support the options PolygonIntersections and RenderAll available for Graphics3D.
FilledSmallSquare For SurfaceGraphics, the default setting for BoxRatios is BoxRatios -> {1, 1, 0.4}.
FilledSmallSquare array should be a rectangular array of real numbers, representing values. There will be holes in the surface corresponding to any array elements that are not real numbers.
FilledSmallSquare If array has dimensions , then shades must have dimensions .
FilledSmallSquare The elements of shades must be GrayLevel, Hue or RGBColor directives, or SurfaceColor objects.
FilledSmallSquare Graphics3D[SurfaceGraphics[ ... ]] can be used to convert a SurfaceGraphics object into the more general Graphics3D representation.
FilledSmallSquare SurfaceGraphics is generated by Plot3D and ListPlot3D.
FilledSmallSquare See Section 1.9.6, Section 2.10.1 and Section 2.10.11.
FilledSmallSquare See also: ListPlot3D, Plot3D, ContourGraphics, DensityGraphics.
FilledSmallSquare New in Version 1.
Further Examples | {
"url": "http://reference.wolfram.com/legacy/v5/Built-inFunctions/GraphicsAndSound/GraphicsPrimitives/SurfaceGraphics.html",
"source_domain": "reference.wolfram.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "47100",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GDNLBN6JG44YBZY33OQ6ER77BV7J6M7R",
"WARC-Concurrent-To": "<urn:uuid:672814d3-c657-4d0e-b9bf-4b09a693db18>",
"WARC-Date": "2017-09-22T10:09:36Z",
"WARC-IP-Address": "140.177.205.163",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6OEJQP2CABNZWJHVXI4KTHZI2C7ENX4E",
"WARC-Record-ID": "<urn:uuid:a2b9becd-0dc2-4144-b4e0-f3603c523c8f>",
"WARC-Target-URI": "http://reference.wolfram.com/legacy/v5/Built-inFunctions/GraphicsAndSound/GraphicsPrimitives/SurfaceGraphics.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5707e3bd-7a27-407e-aed7-2c3301ff2633>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-159-187-32.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,
51,
104,
146,
147,
241,
242,
258,
259,
429,
430,
555,
556,
619,
620,
720,
721,
845,
846,
948,
949,
1139,
1140,
1219,
1220,
1333,
1334,
1484,
1485,
1558,
1559,
1632,
1633,
1715,
1716,
1752,
1753
],
"line_end_idx": [
51,
104,
146,
147,
241,
242,
258,
259,
429,
430,
555,
556,
619,
620,
720,
721,
845,
846,
948,
949,
1139,
1140,
1219,
1220,
1333,
1334,
1484,
1485,
1558,
1559,
1632,
1633,
1715,
1716,
1752,
1753,
1769
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1769,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0.0011305799707770348,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2989690601825714,
"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.2646048069000244,
"rps_doc_frac_unique_words": 0.5504587292671204,
"rps_doc_mean_word_length": 6.697247505187988,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.0034364298917353153,
"rps_doc_unigram_entropy": 4.494838714599609,
"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.08767122775316238,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -107.9957275390625,
"rps_doc_books_importance_length_correction": -100.46774291992188,
"rps_doc_openwebtext_importance": -63.683101654052734,
"rps_doc_openwebtext_importance_length_correction": -63.683101654052734,
"rps_doc_wikipedia_importance": -57.50309371948242,
"rps_doc_wikipedia_importance_length_correction": -54.73882293701172
},
"fasttext": {
"dclm": 0.038904909044504166,
"english": 0.7802877426147461,
"fineweb_edu_approx": 1.7856351137161255,
"eai_general_math": 0.7378352284431458,
"eai_open_web_math": 0.19958198070526123,
"eai_web_code": 0.8761141896247864
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "516.3",
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-9,103,363,107,122,792,000 | Despite the various free VPNs available on the internet, they are simply not as protect as the paid alternatives. You can knowledge slowdowns and service distractions https://bestfreevpns.com/data-room-for-more-aware-usage/ whenever using a free VPN, and some solutions may even accumulate information about you. Here are some things keep in mind ahead of you join for that free VPN. You should also pay attention to the country of origin of your VPN professional. Some VPNs will not enable you to use their service in some countries.
During your stay on island are some free VPN providers, only a few of them supply the same amount of security. Should you be concerned about privacy and basic safety, then a paid out VPN has become the way to go. In most cases, free VPNs will be enough to guard your personal data. However , a lot of free VPNs may skimp your security. As a result, it is recommended to use a paid out VPN in case you are serious about your internet privacy.
Windscribe is another cost-free VPN that offers a strong privacy policy. This service isn’t going to keep any kind of logs on your own activity, and you could sign up which has a username and email address which you have chosen. It doesn’t currently have ads upon its client or internet site, which make it a good choice totally free VPNs. In the end, the best VPNs are the ones that offer the best combination of secureness and level of privacy. If you want harmless and protected online, a free VPN is the right choice.
HÙNG QUYÊN NƠI HỘI TỤ CÁC THƯƠNG HIỆU ĐẲNG CẤP
SHOWROOM 1
Địa chỉ: 156 Sài Thị, Thị Trấn Khoái Châu, Tỉnh Hưng Yên
SHOWROOM 2
Địa chỉ: Lô số 230, Khu đô thị mới Thị Trấn Văn Giang, huyện Văn Giang, tỉnh Hưng Yên (CÁCH VÒNG XUYẾN VĂN GIANG 100M ĐỐI DIỆN NGÂN HÀNG BIDV)
SHOWROOM 3
Địa chỉ: HA02-58 - KĐT Vinhomes Ocean Park - Kiêu Kỵ - Gia Lâm - Hà Nội
CÔNG TY TNHH THƯƠNG MẠI DỊCH VỤ VÀ SẢN XUẤT HÙNG QUYÊN
Trụ sở: Thôn Thông Quan Hạ , Thị Trấn Khoái Châu , Huyện Khoái Châu , Tỉnh Hưng Yên
0983.084.351 - 0912.819.886
[email protected]
Chính sách
• Chính sách bảo mật
• Hình thức thanh toán
• Chính sách vận chuyển
• Chính sách bảo hành
• Chính sách đổi trả hàng
Liên kết với chúng tôi
GPKD số 0900560195 cấp ngày 04/05/2010 Bởi sở kế hoạch và đầu tư Tỉnh Hưng Yên | {
"url": "https://hungquyenceramics.com/no-cost-vpns/",
"source_domain": "hungquyenceramics.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "235549",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IM57LWT227ZEVLJJ2KI5I644O2ZPHW5S",
"WARC-Concurrent-To": "<urn:uuid:bae9ec92-fc3a-4cf3-a49e-4f1f330fc487>",
"WARC-Date": "2022-05-29T08:38:41Z",
"WARC-IP-Address": "103.3.246.38",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5JLZRENQGYZFQXAOX2AL6USJT44H2WJE",
"WARC-Record-ID": "<urn:uuid:7c058ef5-6412-4553-a842-3efa296a7cf3>",
"WARC-Target-URI": "https://hungquyenceramics.com/no-cost-vpns/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:23a884f8-b363-4342-80e9-d92e90b47f11>"
},
"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-116\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
535,
536,
978,
979,
1501,
1502,
1549,
1550,
1561,
1562,
1625,
1626,
1637,
1638,
1781,
1782,
1793,
1794,
1866,
1867,
1922,
1923,
2007,
2008,
2036,
2037,
2059,
2060,
2071,
2072,
2095,
2120,
2146,
2170,
2198,
2199,
2222,
2223
],
"line_end_idx": [
535,
536,
978,
979,
1501,
1502,
1549,
1550,
1561,
1562,
1625,
1626,
1637,
1638,
1781,
1782,
1793,
1794,
1866,
1867,
1922,
1923,
2007,
2008,
2036,
2037,
2059,
2060,
2071,
2072,
2095,
2120,
2146,
2170,
2198,
2199,
2222,
2223,
2301
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2301,
"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.29862475395202637,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09233792126178741,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18271119892597198,
"rps_doc_frac_unique_words": 0.5893719792366028,
"rps_doc_mean_word_length": 4.6570048332214355,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.202028751373291,
"rps_doc_word_count": 414,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.025933610275387764,
"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.028526969254016876,
"rps_doc_frac_chars_top_3gram": 0.02904563955962658,
"rps_doc_frac_chars_top_4gram": 0.0114107895642519,
"rps_doc_books_importance": -252.2131805419922,
"rps_doc_books_importance_length_correction": -252.2131805419922,
"rps_doc_openwebtext_importance": -166.61151123046875,
"rps_doc_openwebtext_importance_length_correction": -166.61151123046875,
"rps_doc_wikipedia_importance": -126.96003723144531,
"rps_doc_wikipedia_importance_length_correction": -126.96003723144531
},
"fasttext": {
"dclm": 0.03216642141342163,
"english": 0.6844245195388794,
"fineweb_edu_approx": 1.1864490509033203,
"eai_general_math": 0.0012537799775600433,
"eai_open_web_math": 0.037409599870443344,
"eai_web_code": 0.004122139886021614
}
} | {
"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": "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": "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": "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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,940,484,794,797,269,000 | Want to protect your cyber security and still get fast solutions? Ask a secure question today.Go Premium
x
• Status: Solved
• Priority: Medium
• Security: Public
• Views: 357
• Last Modified:
Access Form: Error when user enters an apostrophe
I have a piece of code that adds what a user enters into an access text box into a table. This works great until an apostrophe is used.
I have run into this problem before and can't remember the way to fix it. I believe it is just some simple code placed around the item. I tried finding this online, but am not having much luck.
The piece of code that I believe is giving me trouble is the line:
rst!ActDesc.Value = vardesc
Open in new window
The larger piece of code it is located in is this:
Private Sub btnAddNew_Click()
Dim db As DAO.Database
Dim rst As DAO.Recordset
Dim strsql As String
Dim vardesc As Variant
Dim lngID As Long
vardesc = Me.txtactDesc.Value
strsql = "Select * From Activities Where ActDesc = '" & vardesc & "'"
Set db = CurrentDb
Set rst = db.OpenRecordset(strsql)
If rst.RecordCount = 0 Then
rst.AddNew
rst!TypeId.Value = Me!lstType
rst!ActDesc.Value = vardesc
rst!STOid.Value = Me!CmbSTO.Value
rst.Update
rst.Bookmark = rst.LastModified
End If
lngID = rst!Actid.Value
strsql = "Select Top 1 * from Act_SubTo_Date"
Set rst = db.OpenRecordset(strsql)
rst.AddNew
rst!Actid.Value = lngID
rst!ActDate.Value = Nz(Me!ActDate.Value, Date)
rst.Update
txtactDesc = ""
Refresh
rst.Close
Set rst = Nothing
Set db = Nothing
End Sub
Open in new window
0
Megin
Asked:
Megin
• 2
• 2
1 Solution
Russell FoxDatabase DeveloperCommented:
Try replacing single apostrophes with doubles:
vardesc = Replace(Me.txtactDesc.Value, "'", "''")
0
MeginAuthor Commented:
Do you mean where I have
txtactDesc = ""
Open in new window
?
I am not sure where that should go in the code.
0
Russell FoxDatabase DeveloperCommented:
I was assuming the problem was in your SQL query because apostrophes can cause havoc in SQL. In the image below, you can see how the user's apostrophe causes the string to end as far as SQL is concerned. The 2nd query uses two to "escape" the first apostrophe, basically telling the query analyzer "this is just a text apostrophe, not an end of the string":
Escaping an apostrophe in SQLIf that is the problem, you should sanitize the string as soon as you get it from the users, so I showed how to do that right when you pull the value from for vardesc from the txtactDesc textbox. You can do the same in all places where you get that data, or you can create a function that does other string cleaning and just call that whenever you get string values from the user. This is useful for eliminating SQL injection attacks, though your system may not need that much security. Imagine someone put this string into the txtactDesc box: '; DROP TABLE Activities;--
The sql getting executed now looks like this:
SQL InjectionNo bueno. This code just replaces ' with '' wherever you're pulling data from the user form which should fix your immediate problem:
Private Sub btnAddNew_Click()
Dim db As DAO.Database
Dim rst As DAO.Recordset
Dim strsql As String
Dim vardesc As Variant
Dim lngID As Long
vardesc = Replace(Me.txtactDesc.VALUE, "'", "''")
strsql = "Select * From Activities Where ActDesc = '" & vardesc & "'"
Set db = CurrentDb
Set rst = db.OpenRecordset(strsql)
If rst.RecordCount = 0 Then
rst.AddNew
rst!TypeId.Value = Replace(Me!lstType, "'", "''")
rst!ActDesc.Value = vardesc
rst!STOid.Value = Replace(Me!CmbSTO.Value, "'", "''")
rst.Update
rst.Bookmark = rst.LastModified
End If
lngID = rst!Actid.Value
strsql = "Select Top 1 * from Act_SubTo_Date"
Set rst = db.OpenRecordset(strsql)
rst.AddNew
rst!Actid.Value = lngID
rst!ActDate.Value = Nz(Me!ActDate.Value, Date)
rst.Update
txtactDesc = ""
Refresh
rst.Close
Set rst = Nothing
Set db = Nothing
End Sub
Open in new window
0
aikimarkCommented:
Ah, the curse of the Irish (names).
Change your line 10 to be
vardesc = Replace(vbNullString & Me.txtactDesc.Value, Chr(34), vbNullString)
Open in new window
Change your line 12 to be either
strsql = "Select * From Activities Where ActDesc = """ & vardesc & """"
Open in new window
or
strsql = "Select * From Activities Where ActDesc = " & chr(34) & vardesc & chr(34)
Open in new window
0
MeginAuthor Commented:
Thank you! The chr(34) thing was what I was trying to remember. The code works great now!
0
Featured Post
Concerto Cloud for Software Providers & ISVs
Can Concerto Cloud Services help you focus on evolving your application offerings, while delivering the best cloud experience to your customers? From DevOps to revenue models and customer support, the answer is yes!
Learn how Concerto can help you.
• 2
• 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now | {
"url": "https://www.experts-exchange.com/questions/28487101/Access-Form-Error-when-user-enters-an-apostrophe.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "122920",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7PGITDI7FO5WJQF4OCEBVDPZVVLWDAIW",
"WARC-Concurrent-To": "<urn:uuid:8a04dd6c-3b55-4e77-b363-986091a17f55>",
"WARC-Date": "2018-01-18T04:11:54Z",
"WARC-IP-Address": "104.20.168.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EBKCSOXY4WNAEFGQJPFKU663C53CR7CH",
"WARC-Record-ID": "<urn:uuid:68e0403b-d2c9-403f-91ef-bb9c0bae4083>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/28487101/Access-Form-Error-when-user-enters-an-apostrophe.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:707ebd28-c038-4016-b737-f43330a1fea3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-5-153-88.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-05\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for January 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
105,
106,
108,
127,
148,
169,
184,
203,
204,
254,
255,
391,
392,
586,
587,
654,
683,
684,
703,
704,
705,
756,
757,
787,
788,
811,
836,
857,
880,
898,
899,
900,
930,
931,
1001,
1002,
1003,
1022,
1057,
1058,
1086,
1101,
1102,
1140,
1176,
1218,
1233,
1269,
1274,
1281,
1282,
1306,
1307,
1353,
1354,
1389,
1390,
1401,
1429,
1480,
1481,
1492,
1493,
1509,
1510,
1518,
1519,
1529,
1530,
1548,
1565,
1566,
1574,
1575,
1594,
1595,
1597,
1603,
1610,
1616,
1622,
1628,
1639,
1641,
1681,
1728,
1778,
1780,
1782,
1805,
1832,
1848,
1849,
1868,
1869,
1871,
1872,
1920,
1922,
1924,
1964,
2322,
2923,
2969,
3115,
3145,
3146,
3169,
3194,
3215,
3238,
3256,
3257,
3258,
3308,
3309,
3379,
3380,
3381,
3400,
3435,
3436,
3464,
3479,
3480,
3538,
3574,
3636,
3651,
3687,
3692,
3699,
3700,
3724,
3725,
3771,
3772,
3807,
3808,
3819,
3847,
3898,
3899,
3910,
3911,
3927,
3928,
3936,
3937,
3947,
3948,
3966,
3983,
3984,
3992,
3993,
4012,
4013,
4015,
4017,
4036,
4072,
4098,
4175,
4176,
4195,
4196,
4229,
4301,
4302,
4321,
4322,
4325,
4408,
4409,
4428,
4429,
4431,
4433,
4456,
4547,
4549,
4550,
4564,
4565,
4610,
4611,
4827,
4828,
4861,
4862,
4868,
4874,
4946
],
"line_end_idx": [
105,
106,
108,
127,
148,
169,
184,
203,
204,
254,
255,
391,
392,
586,
587,
654,
683,
684,
703,
704,
705,
756,
757,
787,
788,
811,
836,
857,
880,
898,
899,
900,
930,
931,
1001,
1002,
1003,
1022,
1057,
1058,
1086,
1101,
1102,
1140,
1176,
1218,
1233,
1269,
1274,
1281,
1282,
1306,
1307,
1353,
1354,
1389,
1390,
1401,
1429,
1480,
1481,
1492,
1493,
1509,
1510,
1518,
1519,
1529,
1530,
1548,
1565,
1566,
1574,
1575,
1594,
1595,
1597,
1603,
1610,
1616,
1622,
1628,
1639,
1641,
1681,
1728,
1778,
1780,
1782,
1805,
1832,
1848,
1849,
1868,
1869,
1871,
1872,
1920,
1922,
1924,
1964,
2322,
2923,
2969,
3115,
3145,
3146,
3169,
3194,
3215,
3238,
3256,
3257,
3258,
3308,
3309,
3379,
3380,
3381,
3400,
3435,
3436,
3464,
3479,
3480,
3538,
3574,
3636,
3651,
3687,
3692,
3699,
3700,
3724,
3725,
3771,
3772,
3807,
3808,
3819,
3847,
3898,
3899,
3910,
3911,
3927,
3928,
3936,
3937,
3947,
3948,
3966,
3983,
3984,
3992,
3993,
4012,
4013,
4015,
4017,
4036,
4072,
4098,
4175,
4176,
4195,
4196,
4229,
4301,
4302,
4321,
4322,
4325,
4408,
4409,
4428,
4429,
4431,
4433,
4456,
4547,
4549,
4550,
4564,
4565,
4610,
4611,
4827,
4828,
4861,
4862,
4868,
4874,
4946,
4954
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4954,
"ccnet_original_nlines": 194,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24618321657180786,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020992370322346687,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2719465494155884,
"rps_doc_frac_unique_words": 0.40594059228897095,
"rps_doc_mean_word_length": 5.178217887878418,
"rps_doc_num_sentences": 92,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.217504501342773,
"rps_doc_word_count": 707,
"rps_doc_frac_chars_dupe_10grams": 0.27806609869003296,
"rps_doc_frac_chars_dupe_5grams": 0.3152144253253937,
"rps_doc_frac_chars_dupe_6grams": 0.30073750019073486,
"rps_doc_frac_chars_dupe_7grams": 0.2903578281402588,
"rps_doc_frac_chars_dupe_8grams": 0.27806609869003296,
"rps_doc_frac_chars_dupe_9grams": 0.27806609869003296,
"rps_doc_frac_chars_top_2gram": 0.011472280137240887,
"rps_doc_frac_chars_top_3gram": 0.017208410426974297,
"rps_doc_frac_chars_top_4gram": 0.02868068963289261,
"rps_doc_books_importance": -489.5572204589844,
"rps_doc_books_importance_length_correction": -489.5572204589844,
"rps_doc_openwebtext_importance": -266.43157958984375,
"rps_doc_openwebtext_importance_length_correction": -266.43157958984375,
"rps_doc_wikipedia_importance": -158.16001892089844,
"rps_doc_wikipedia_importance_length_correction": -158.16001892089844
},
"fasttext": {
"dclm": 0.14084166288375854,
"english": 0.8088212609291077,
"fineweb_edu_approx": 2.3228061199188232,
"eai_general_math": 0.23133397102355957,
"eai_open_web_math": 0.23623013496398926,
"eai_web_code": 0.11613678932189941
}
} | {
"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.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
8,152,743,937,084,728,000 | Search
Loading...
Thursday, July 21, 2016
The CCIE Written Exam Expose and One Year's Worth of CCIE's Re-Certification - +/- 10,000 or so...
Ok,
So here's the problem - CCIE's have to re-certify using a given CCIE Written Exam every couple of years or else become de-certified.
There's a process but the end result is that the CCIE who cannot pass a CCIE Written or CCDE Written Exam - any of them... well they lose the certification. Period.
The problem is that the latest exam has no such study guide apparently at least since around January of 2016 which really means there was no testing aids - FROM ANYWHERE - available to our erstwhile CCIE's who needed to re-certify using... the CCIE RS Written...
And probably others or soon to be others...
So what!!!
These are CCIE's and they beat the lab... They are the most resourceful and talented engineers on the planet and they are elite.
Um...
Unless they can't pass that CCIE Written Exam in time... Those who procrastinated may have lost the certification or may currently be at risk...
If the so-called brain dumps are no longer in operation and of no further use for the current CCIE Written Exams then the current CCIE's who used such resources as a "SOLE SOURCE" are very much dis-enfranchised.
So... what?
Well... That means that Cisco Partners who require CCIE's are going to be needing new CCIE's and there will be a shortage.
It means CCIE Salaries for those who made the cut are know able to name that price in salary negotiations...
It means that no matter what - the CCIE Program has some issues...
1. Is is possible that such a large number of CCIE's simply cannot pass the exams any longer... I mean they were CCIE's yesterday before their CCIE expired...
2. Is is possible that the CCIE Pundits and Tweeters have made a colossal difference at Cisco Live and are going to get an immediate overhaul before they are deer in the headlights and de-certified?
3. Is it possible that even if a new exam is written - the question bank will be changed often enough to make the CCIE's shape up or ship out... of the program...?
4. Some CCIE's let their CCNA or CCNP go at some point and may have been dependent upon that one shot one kill re-certification exam to re-certify a host of certifications... per policy.
5. What's the CCIE Program going to do now?
- Is it going to fold to massive PEER PRESSURE from people who beat the CCIE Labs and may have used materials that gave them an undue advantage over others... can't call it cheating per VUE's guidelines - had this discussion in 2009 so the term does not apply to the test taker.
- However, now Cisco is back in the INTEGRITY CROSS-HAIRS and the CCIE Program has a MORAL DILEMMA....
- Will it stick to its guns,., and retain the current CCIE Written Exams and use its normal process of Exam Development that has been tried and true for over 20+ years...
- Will it fold to PEER PRESSURE because an ENTIRE GENERATION of CCIE's - We are possibly taking over 10,000+ Current CCIE's simply cannot pass the CCIE Written Exams - particularly the CCIE RS Written which apparently may only cover a small percentage of possible questions versus previous years which covered several hundred questions... if we look at the numbers - a little Google and those who don't know any better can check the exact statistics...
I, myself, I looked and found the root cause of the problem...
The CCIE RS Written Question Bank is not in the open...
Recall... Someone cleaned up Sadikhov about 7 years ago or so and now there is no place to dump exams so easy and so... there is a clear and inalienable void...
IPExpert is also no longer around and that left a void...
The bottom line is there is a problem...
CCIE's Numbers are falling and while the numbers say 50,000+ Certified CCIE's, some died and some dropped out of the program when the mythical job opportunities never materialized... or did not pay as well - take a look at the Chinese numbers of CCIE's - the supply/demand and economy may not support the $100k mark for that country and few Visa's so... the investment may not have panned out...
Now with no testing aids to help and no real CCIE Written Training Books by Cisco Press that are a one shot and one kill solution... (Narbik posted on CLN and agreed that even his latest 2 volume offering was not quite a silver bullet for the CCIE RS Written) and no other track has had a Cisco Press Book to really cover the various CCIE Written Exams...
The bottom line is Cisco and Cisco Press have to step up to the plate for CCIE Written Exams...
Right now - The Problem is lack of support.
The Cisco Expert Level Program - 8 years later only supports CCIE Routing and Switching and CCIE Collaboration to any degree...
That's it.
No other CCIE's are supported by the Cisco Expert Level Certification Program...
Why not?
Why not?
Why not?
It's been 8 years and Cisco has certified some 25-30,000 CCIE's or more in that time... more or less...
Yet no major releases to support these CCIE Programs...
My question to Cisco is this: Are you going to shape up or ship out of the CCIE Program?
Someone has to support the CCIE Program... Vendors like Juniper or Arista or even Huawei are not going to do it for Cisco...
I love the CCIE Program and have used it to leverage my own skills for nearly 20 years now... and it has paid off in spades...
However, as a person who continually and consistently helps CCIE's mostly every day - I have to say our CCIE's are needing some more support in the terms of affordable training, more access to labs, and more books and training programs for each CCIE Track...
Do I need to start and fund a CCIE Training Company to prove my point?
I've done well at the CCNP level and well enough to make such a statement. I can leverage a small business loan easy enough. I have the contacts who are talented and I've been engaged with so many talented CCIE's for almost 20+ years and have resources such as few others have...
And I am a highly motivated professional who actually knows the ins and outs of this certification industry to a certain extent who has never been committed to any other organization who trains for the CCIE, even though I've been entertained a time or two by some of the major training partners to Cisco.
Thoughts... We need help...
Now is the Time...
Darby Weaver
The Inquisitor... | {
"url": "http://darbyslogs.blogspot.com/",
"source_domain": "darbyslogs.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "78312",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LHBLYNMYG6GSYSYUJDUKREL44BGODNTF",
"WARC-Concurrent-To": "<urn:uuid:bde22c70-f3cd-4512-b6a6-e84dad8b9016>",
"WARC-Date": "2016-07-27T01:46:09Z",
"WARC-IP-Address": "209.85.144.132",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:N63OQJIYX5YIUBXCVDHA7E3TURDNV4VY",
"WARC-Record-ID": "<urn:uuid:bc4f5fa6-7d11-4f78-9584-4d7cb4c83edc>",
"WARC-Target-URI": "http://darbyslogs.blogspot.com/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:53230ed1-80d8-4819-9ad1-2e1a3d407402>"
},
"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,
7,
8,
19,
20,
44,
45,
144,
145,
149,
150,
283,
284,
450,
451,
714,
715,
759,
760,
771,
772,
902,
903,
909,
910,
1055,
1056,
1268,
1269,
1281,
1282,
1406,
1407,
1516,
1517,
1584,
1585,
1744,
1745,
1944,
1945,
2109,
2110,
2298,
2299,
2343,
2344,
2624,
2625,
2729,
2730,
2902,
2903,
3359,
3360,
3423,
3424,
3480,
3481,
3642,
3643,
3701,
3702,
3743,
3744,
4141,
4142,
4498,
4499,
4595,
4596,
4640,
4641,
4769,
4770,
4781,
4782,
4863,
4864,
4873,
4874,
4883,
4884,
4893,
4894,
4998,
4999,
5055,
5056,
5057,
5147,
5148,
5274,
5275,
5402,
5403,
5662,
5663,
5664,
5735,
5736,
6018,
6019,
6324,
6325,
6326,
6354,
6355,
6374,
6375,
6376,
6389,
6390
],
"line_end_idx": [
7,
8,
19,
20,
44,
45,
144,
145,
149,
150,
283,
284,
450,
451,
714,
715,
759,
760,
771,
772,
902,
903,
909,
910,
1055,
1056,
1268,
1269,
1281,
1282,
1406,
1407,
1516,
1517,
1584,
1585,
1744,
1745,
1944,
1945,
2109,
2110,
2298,
2299,
2343,
2344,
2624,
2625,
2729,
2730,
2902,
2903,
3359,
3360,
3423,
3424,
3480,
3481,
3642,
3643,
3701,
3702,
3743,
3744,
4141,
4142,
4498,
4499,
4595,
4596,
4640,
4641,
4769,
4770,
4781,
4782,
4863,
4864,
4873,
4874,
4883,
4884,
4893,
4894,
4998,
4999,
5055,
5056,
5057,
5147,
5148,
5274,
5275,
5402,
5403,
5662,
5663,
5664,
5735,
5736,
6018,
6019,
6324,
6325,
6326,
6354,
6355,
6374,
6375,
6376,
6389,
6390,
6407
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6407,
"ccnet_original_nlines": 112,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4670126140117645,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06597480177879333,
"rps_doc_frac_lines_end_with_ellipsis": 0.2743362784385681,
"rps_doc_frac_no_alph_words": 0.14677539467811584,
"rps_doc_frac_unique_words": 0.3786666691303253,
"rps_doc_mean_word_length": 4.359111309051514,
"rps_doc_num_sentences": 80,
"rps_doc_symbol_to_word_ratio": 0.03854706883430481,
"rps_doc_unigram_entropy": 5.3262152671813965,
"rps_doc_word_count": 1125,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03670473024249077,
"rps_doc_frac_chars_dupe_6grams": 0.008564439602196217,
"rps_doc_frac_chars_dupe_7grams": 0.008564439602196217,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.022838499397039413,
"rps_doc_frac_chars_top_3gram": 0.017128869891166687,
"rps_doc_frac_chars_top_4gram": 0.013050570152699947,
"rps_doc_books_importance": -538.2487182617188,
"rps_doc_books_importance_length_correction": -538.2487182617188,
"rps_doc_openwebtext_importance": -375.7595520019531,
"rps_doc_openwebtext_importance_length_correction": -375.7595520019531,
"rps_doc_wikipedia_importance": -311.69134521484375,
"rps_doc_wikipedia_importance_length_correction": -311.69134521484375
},
"fasttext": {
"dclm": 0.04179412126541138,
"english": 0.9559273719787598,
"fineweb_edu_approx": 1.6618620157241821,
"eai_general_math": 0.21254956722259521,
"eai_open_web_math": 0.2848661541938782,
"eai_web_code": 0.01771586947143078
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.072",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "378.12",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-701,657,985,460,959,100 | Pete On Software
RSS Feed
C# 6 Features – Nameof Expressions
Name BadgeIn the latest post on my series about C# 6’s features, I want to look at nameof expressions. There are times when you need the string value of variables or methods or classes in your code. That could be to return an argument exception, it could be to have some sort of property changed notification, or it could even be to get the string value of an enumeration value.
Previously, you had to either have “magic strings” in your application or any number of tricks to abstract away what are basically the magic strings. If you changed the name of a variable, parameter, method, class, or enum, nothing would ensure that you went back and updated your “magic strings”. Perhaps if you had written very finely-grained unit tests (and you remembered to update those when you changed a variable name), you might get a warning, but that is a tremendous amount of discipline. That’s where C# 6 is here to save our bacon.
As an example, here is something we might have done previously
You can see how I could change the parameter name from foo to something else and the compiler won’t care if I fix the call to ArgumentNullException() or not. However, nameof fixes and prevents that.
The benefit here is that if I change the parameter and forget to change nameof(foo) like this:
You actually will get a compile time error that says “The name ‘foo’ does not exist in the current context”. Some people hate using the compiler as a unit test, but I don’t. It is basically “round one” of testing. I think the issue arises when it is the the only means of testing used, but it is just another tool in the toolbox that we should use.
As I mentioned earlier, you can use it to get the names of classes, methods, and it lets you stop the SomeEnum.SomeValue.ToString() madness. It is the same syntax and would look like this
As I said at the beginning of this series, much of C# 6’s features aren’t mind-blowing, but instead are small improvements to help smooth out some edges. Are you using nameof? Are you going to when you get the chance?
Leave a Comment | {
"url": "https://www.peteonsoftware.com/index.php/2016/06/17/c-6-features-nameof-expressions/",
"source_domain": "www.peteonsoftware.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "59546",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RWPX7JPSWHCZ6HACDXP6PQED45BS2F5B",
"WARC-Concurrent-To": "<urn:uuid:e85f868e-5d93-4b7e-b342-6088fb27a007>",
"WARC-Date": "2021-02-25T07:25:18Z",
"WARC-IP-Address": "198.46.81.218",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WHXCUYRDDIBCIQ6O2MAHWKBEJMHCZW4Y",
"WARC-Record-ID": "<urn:uuid:cf6e31df-9b94-4823-8995-b40ef58b1294>",
"WARC-Target-URI": "https://www.peteonsoftware.com/index.php/2016/06/17/c-6-features-nameof-expressions/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e5c6d3ad-bc2a-44b1-a400-dd98dbbe3aec>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-131.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
17,
18,
27,
28,
63,
64,
443,
444,
988,
989,
1052,
1053,
1252,
1253,
1348,
1349,
1698,
1699,
1887,
1888,
2106,
2107
],
"line_end_idx": [
17,
18,
27,
28,
63,
64,
443,
444,
988,
989,
1052,
1053,
1252,
1253,
1348,
1349,
1698,
1699,
1887,
1888,
2106,
2107,
2122
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2122,
"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.48689955472946167,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02838427945971489,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15283842384815216,
"rps_doc_frac_unique_words": 0.5052356123924255,
"rps_doc_mean_word_length": 4.387434482574463,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0.008733619935810566,
"rps_doc_unigram_entropy": 4.855708599090576,
"rps_doc_word_count": 382,
"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.00954653974622488,
"rps_doc_frac_chars_top_3gram": 0.014319810084998608,
"rps_doc_frac_chars_top_4gram": 0.01909307949244976,
"rps_doc_books_importance": -205.04656982421875,
"rps_doc_books_importance_length_correction": -205.04656982421875,
"rps_doc_openwebtext_importance": -127.0894546508789,
"rps_doc_openwebtext_importance_length_correction": -127.0894546508789,
"rps_doc_wikipedia_importance": -83.23319244384766,
"rps_doc_wikipedia_importance_length_correction": -83.23319244384766
},
"fasttext": {
"dclm": 0.09943156689405441,
"english": 0.9218370318412781,
"fineweb_edu_approx": 1.8847477436065674,
"eai_general_math": 0.880358099937439,
"eai_open_web_math": 0.43070292472839355,
"eai_web_code": 0.40589338541030884
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,084,903,612,890,996,700 | NOIA NETWORK AMA Recap
NOIA NETWORK AMA Recap
CryptoDiffer team
Can you introduce yourself to the community? What is your background and how did you come to the idea to create your project?
Domas
CEO
My name is Domas and I’m the CEO and co-founder of NOIA Network. I have a financial background as well as experience in founding and building other startups as an entrepreneur. Together with me is Jonas – who’s the CTO of NOIA. Jonas spent several years at Royal Bank of Scotland and JP Morgan as a trading applications developer before co-founding NOIA.
Having built other startups, we often encountered a lot of problems with the Internet and particularly content delivery so at first NOIA was born to solve these issues. However, later we discovered that there are other major core issues that are not being addressed, and Content Delivery was just one part out of many. We dug deep into the core layers of Internet infrastructure and that’s how the Programmable Internet was born.
CryptoDiffer team
Can you briefly describe what is NOIA Network in 3-5 sentences?
Domas
CEO
NOIA is enabling transition from the current Internet architecture to the next generation of Internet powered by Blockchain. We call it the Programmable Internet.
We’re combining the latest Internet protocol innovations and Blockchain technology to resolve core Internet design limitations and security problems. It is done by providing a platform to open up the infrastructure by sharing, selling, buying, trading internet bandwidth on the Decentralized Internet Transit Exchange (or DITEX).
Essentially, we’re connecting different networks on the Internet into one unified and programmable network.
CryptoDiffer team
What technology stands behind NOIA Network and why it’s better than the existing one?
Jonas
CTO
We use the most recent version of the Internet Protocol (IPv6) and Segment Routing to standardize the infrastructure (making routers understand the same language) and to combine different networks into one programmable network governed by blockchain.
IPv6 expands the data packet design to carry more information in the packet header.
Segment Routing is a protocol which makes routers understand routing information in packet headers and act upon it.
It changes the way Internet can be routed by putting the information in the data packets themselves, which in turn makes the data itself smart which allows for Smart Routing on the public internet.
CryptoDiffer team
And what about the the token utility in the ecosystem? Where it will be used and why the demand for the token should increase?
Domas
CEO
We heavily focused on creating an effective token value economy where network usage and adoption is heavily incentivised (please go read the Tokenomics paper we just released).
At the centre of this is NOIA token, which is a native Digital currency in the Programmable Internet. It powers the ledger and is used as a transaction fee or medium of internet traffic exchange.
Token holders receive rewards for participating in the new internet network as well as use the tokens to improve their internet connection.
Enterprises use the token to set up and sell internet infrastructure using DITEX.
All transactions are settled on the ledger which is powered by our token and has transaction fees.
Usage of the token will increase as more people join the network therefore improving it and invites even more people creating a network effect.
CryptoDiffer team
Could you tell us about NOIA Cache? You have 5129 NOIA nodes, who host them and what are the benefits?
Domas
CEO
We have an active community that we’ve been growing for the past 1.5 years. It is mainly our community members that run NOIA nodes on their personal computers, virtual machines, raspberries, etc.
At this moment it’s being incentivized by 200 NOIA tokens per week for everyone that runs the node.
We use your node to distribute the content, and also analyze the network itself – we test the connections, ping, latency, throughput, etc.
CryptoDiffer team
Let the community ask questions now!🔥
Cryptodiffer Community
NOIA has planned to go to binance, okex, huobi ..?
Domas
CEO
We have an exchange listing strategy in place. I can’t disclose any details at the moment though. The only thing that is public and confirmed is KuCoin on the 22nd July. This will be the initial listing of NOIA
Cryptodiffer Community
Internet is a huge field, it has many chances but its also full of challenges. Which dificulities and chance did your team experience when started this project?
Domas
CEO
The main challenge is the complexity of it all. Navigating through it definitely is challenging. We’re lucky to have a strong tech team in place and people like Bill Norton and others joining our team to tackle these obstacles.
Cryptodiffer Community
When I use your product, how safe is my hardware? and what measures are in place to avoid the NOIA Network being used to host/spread malware?
Domantas
COO
Hi, it’s Jonas here. Your hardware runs open source application so everyone can find issues faster and run trusted software. For NOIA Cache all traffic is encrypted and distributed in pieces so malware content is ineffective on your machine, in sharing bandwidth data will be shared by packet, making your pc a router so there is no direct way of spreading malware using NOIA Network
Cryptodiffer Community
What problem are Noia solving and why is blockchain the right way to do that?
What is going to be the strategy for mass adoption and getting people to start sharing their bandwidth with the NOIA network?
Domantas
COO
NOIA is solving core internet fragmentation problems and its protocol design limitations. In effect, internet is very distributed and there is no way to put any smart logic on top if there is no central place for the state of the internet, like a database. Distributed Ledger allows ot have a decentralised database and exchange so public internet can be connected in smart way and ledger can be used to store and ant on participating router topology. for mass adoption we will release an application which makes your internet faster and peopel can earn tokens participating in the network, and then entering enterprise market when there are enough internet route segments on DITEX available
Cryptodiffer Community
Your initial circulation supply is extremely low (1.41%), why would you decide to go with that?
Domas
CEO
We took a different approach compared to most other crypto projects. We’re very cautious and calculated when it comes to token allocation and the launch strategy itself. All our investors’ tokens are locked as well as the advisors and the team. We didn’t have a big public sale, therefore you have the 1.4% – we’re trying to do it our own way 😉
Cryptodiffer Community
When you look back to the day you guys started developing Noia Network are you satisfied with the progress you guys have made?
Who are Noia biggest competition in crypto and what makes Noia Network unique?
Domas
CEO
Yes, we’re satisfied. It’s been a long way already, it will be even longer going forward, but we’re happy where we are.
We attracted multiple industry experts to either join the team full time or advise us on a strategic level, so we have quite some proof already that we’re doing something right 🙂
Cryptodiffer Community
Do you get a support of any kind by non-blockchain tech companies?
Domas
CEO
We mostly cooperate with non blockchain companies, and they are usually Internet Service Providers, Data centers, Internet transit exchanges, etc. Since we are creating a very innovative solution, lots of these companies are interested in helping us, offering various support, etc. We are talking to Cisco (company that is basically the main preacher and developer of Segment Routing)
Cryptodiffer Community
How does NOIA resolve daily BGP attacks on the Internet and fix security holes?
Domantas
COO
BGP hijacks happen on weakest parts of public internet, by building networks via DITEX you lower the field of attack to the first and last mile of the user, and controlling the route to the destination lowers the field of a BGP attack significantly
Cryptodiffer Community
As i know that NOIA continues to have cooperative relationship with many blockchain projects, especially NOIA is also included in the start-up list which is supported by Microsoft Corporation. What benefit does this bring to NOIA?
Domas
CEO
We were accepted to Microsoft Startup program. Microsoft’s innitiative here is to provide startups they deem as valuable (such as NOIA) connections, advise, and free services in order to help them move forward quicker – they accelerate them in a way.
Cryptodiffer Community
DITEX Platform that you are developing will be a place to sell Internet access points as per your whitepaper. Will the exchange use NOIA tokens for this? Also can you explain how segment routing will be used on DITEX? Also what benefit do a service provider get when he buys access points through DITEX?
Domantas
COO
Correct, NOIA tokens will be used for facilitating the transactions in the DITEX, and stable coin payments will be available for the transfer of value of the contract. DITEX will store all available segments in the network which are available for public to be used through the app or anyone on DITEX. service provider gets access to a marketplace where infrastructure can be bought from many vendors on many different backbones of the internet and construct their own network and paths via a smart way
Cryptodiffer Community
What should we expect from your marketing team after the listing on KuCoin?
Domas
CEO
We have many things planned for the near future. KuCoin listing is just the start. We’ve been focusing on the technologhy for the past year and a half and now we’re coming out to the public 🙂 We’ll do some live events in different countries, appear on stage in crypto conferences, etc.
We’re hoping to make NOIA well known to all the crypto community out there.
Cryptodiffer Community
How can I participate in Noia Foundational Members Program?
Domas
CEO
You can do that by getting enough NOIA tokens to your wallet or on KuCoin. Since we dont have a public sale, not many people were able to buy in, so we wanted to provide a chance for them to acquire more tokens than they would usually, therefore we introduced this program. You can read more about it on NOIA Medium or ask our Community managers on our chat room
Cryptodiffer Community
How are you going to capitalize Noia’s Technology, and how do you implement it?
Can you explain how value of the token is tied to the value of the Noia Network. Basically what is the incentive for a tokenholder to hold the tokens?
Domantas
COO
NOIA is working with partners like Microsoft and Cisco on the segment routing technology side. our software is already capable of building a backbone from different vendors and use smart routing to send traffic using segment routing. once DITEX and our ledger is launched token holders will be eligible to be a masternode or earn tokenholder staking rewards, as well as use the tokens to participate in better internet network. Details are explained in our latest tokenomics paper!
Cryptodiffer Community
NOIA acts like a bridge between a website and it’s users making the Website easily accessible. So NOIA needs permission from that particular Website creator initially to cache their content. How do you plan to partner up with these websites? Especially as there are billions of Website presently and even if you are aiming for 1% of it, that’s still a lot.
Domantas
COO
This applies for NOIA Cache only, and website owners need to install our SDK. then content which is accessed will automatically be cached using our smart caching algorithms. Programmable Internet will work by changing how internet is being routed for network participants and will work for all internet content independently.
Cryptodiffer TEAM
It was a pleasure to conduct an AMA with such a cool project like NOIA. Thank you for your time!
@jaskunas, @dominicm2, @sijonas , thanks a lot!
Spread the love
•
•
•
•
•
•
•
•
•
•
CryptoDiffer Admin
[email protected]
Leave a Reply
Your email address will not be published. | {
"url": "https://cryptodiffer.com/news/noia-network-ama-recap/",
"source_domain": "cryptodiffer.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "222488",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JZDT6PZAEOH67UDTPEY42LB6E27UMFLW",
"WARC-Concurrent-To": "<urn:uuid:d9ad1939-88d7-4e53-ba2f-95071836326e>",
"WARC-Date": "2020-09-19T17:59:43Z",
"WARC-IP-Address": "148.251.8.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DZRBA6NQJYUG75OSPDWKUBUURH7USKQJ",
"WARC-Record-ID": "<urn:uuid:7762c840-acf7-4d58-becb-af998540da35>",
"WARC-Target-URI": "https://cryptodiffer.com/news/noia-network-ama-recap/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:71da7f7f-f736-4584-b494-92249ec66f27>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-206.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
23,
24,
47,
48,
66,
67,
193,
194,
200,
204,
205,
560,
561,
991,
992,
994,
995,
1013,
1014,
1078,
1079,
1081,
1082,
1088,
1092,
1093,
1257,
1258,
1588,
1589,
1697,
1698,
1716,
1717,
1803,
1804,
1810,
1814,
1815,
2066,
2067,
2151,
2152,
2268,
2269,
2467,
2468,
2470,
2471,
2489,
2490,
2617,
2618,
2620,
2621,
2627,
2631,
2632,
2809,
2810,
3007,
3008,
3148,
3149,
3231,
3232,
3331,
3332,
3476,
3477,
3479,
3480,
3498,
3499,
3602,
3603,
3609,
3613,
3614,
3810,
3811,
3911,
3912,
4051,
4052,
4070,
4071,
4109,
4110,
4133,
4134,
4185,
4186,
4188,
4189,
4195,
4199,
4200,
4411,
4412,
4435,
4436,
4597,
4598,
4604,
4608,
4609,
4837,
4838,
4861,
4862,
5004,
5005,
5014,
5018,
5019,
5404,
5405,
5428,
5429,
5507,
5508,
5634,
5635,
5644,
5648,
5649,
6341,
6342,
6365,
6366,
6462,
6463,
6469,
6473,
6474,
6819,
6820,
6843,
6844,
6971,
6972,
7051,
7052,
7058,
7062,
7063,
7184,
7185,
7364,
7365,
7388,
7389,
7456,
7457,
7463,
7467,
7468,
7853,
7854,
7877,
7878,
7958,
7959,
7968,
7972,
7973,
8222,
8223,
8246,
8247,
8478,
8479,
8485,
8489,
8490,
8741,
8742,
8765,
8766,
9070,
9071,
9080,
9084,
9085,
9587,
9588,
9611,
9612,
9688,
9689,
9695,
9699,
9700,
9987,
9988,
10065,
10066,
10089,
10090,
10150,
10151,
10157,
10161,
10162,
10525,
10526,
10549,
10550,
10630,
10631,
10782,
10783,
10792,
10796,
10797,
11279,
11280,
11303,
11304,
11662,
11663,
11672,
11676,
11677,
12003,
12004,
12022,
12023,
12120,
12121,
12169,
12170,
12186,
12192,
12198,
12204,
12210,
12216,
12222,
12228,
12234,
12240,
12246,
12265,
12285,
12286,
12300,
12301
],
"line_end_idx": [
23,
24,
47,
48,
66,
67,
193,
194,
200,
204,
205,
560,
561,
991,
992,
994,
995,
1013,
1014,
1078,
1079,
1081,
1082,
1088,
1092,
1093,
1257,
1258,
1588,
1589,
1697,
1698,
1716,
1717,
1803,
1804,
1810,
1814,
1815,
2066,
2067,
2151,
2152,
2268,
2269,
2467,
2468,
2470,
2471,
2489,
2490,
2617,
2618,
2620,
2621,
2627,
2631,
2632,
2809,
2810,
3007,
3008,
3148,
3149,
3231,
3232,
3331,
3332,
3476,
3477,
3479,
3480,
3498,
3499,
3602,
3603,
3609,
3613,
3614,
3810,
3811,
3911,
3912,
4051,
4052,
4070,
4071,
4109,
4110,
4133,
4134,
4185,
4186,
4188,
4189,
4195,
4199,
4200,
4411,
4412,
4435,
4436,
4597,
4598,
4604,
4608,
4609,
4837,
4838,
4861,
4862,
5004,
5005,
5014,
5018,
5019,
5404,
5405,
5428,
5429,
5507,
5508,
5634,
5635,
5644,
5648,
5649,
6341,
6342,
6365,
6366,
6462,
6463,
6469,
6473,
6474,
6819,
6820,
6843,
6844,
6971,
6972,
7051,
7052,
7058,
7062,
7063,
7184,
7185,
7364,
7365,
7388,
7389,
7456,
7457,
7463,
7467,
7468,
7853,
7854,
7877,
7878,
7958,
7959,
7968,
7972,
7973,
8222,
8223,
8246,
8247,
8478,
8479,
8485,
8489,
8490,
8741,
8742,
8765,
8766,
9070,
9071,
9080,
9084,
9085,
9587,
9588,
9611,
9612,
9688,
9689,
9695,
9699,
9700,
9987,
9988,
10065,
10066,
10089,
10090,
10150,
10151,
10157,
10161,
10162,
10525,
10526,
10549,
10550,
10630,
10631,
10782,
10783,
10792,
10796,
10797,
11279,
11280,
11303,
11304,
11662,
11663,
11672,
11676,
11677,
12003,
12004,
12022,
12023,
12120,
12121,
12169,
12170,
12186,
12192,
12198,
12204,
12210,
12216,
12222,
12228,
12234,
12240,
12246,
12265,
12285,
12286,
12300,
12301,
12342
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 12342,
"ccnet_original_nlines": 249,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44215598702430725,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03680982068181038,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10692375153303146,
"rps_doc_frac_unique_words": 0.33464759588241577,
"rps_doc_mean_word_length": 4.903400897979736,
"rps_doc_num_sentences": 106,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.675477027893066,
"rps_doc_word_count": 2029,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.00864407978951931,
"rps_doc_frac_chars_dupe_6grams": 0.005427679978311062,
"rps_doc_frac_chars_dupe_7grams": 0.005427679978311062,
"rps_doc_frac_chars_dupe_8grams": 0.001005130005069077,
"rps_doc_frac_chars_dupe_9grams": 0.001005130005069077,
"rps_doc_frac_chars_top_2gram": 0.029550710693001747,
"rps_doc_frac_chars_top_3gram": 0.0024123000912368298,
"rps_doc_frac_chars_top_4gram": 0.002814349951222539,
"rps_doc_books_importance": -964.539306640625,
"rps_doc_books_importance_length_correction": -964.539306640625,
"rps_doc_openwebtext_importance": -663.35888671875,
"rps_doc_openwebtext_importance_length_correction": -663.35888671875,
"rps_doc_wikipedia_importance": -526.1401977539062,
"rps_doc_wikipedia_importance_length_correction": -526.1401977539062
},
"fasttext": {
"dclm": 0.03199059143662453,
"english": 0.9377484917640686,
"fineweb_edu_approx": 1.3203295469284058,
"eai_general_math": 0.01559538021683693,
"eai_open_web_math": 0.11800503730773926,
"eai_web_code": 0.006477059796452522
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "332.874",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "1",
"label": "About (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-896,098,370,890,570,800 | Shave off seconds - save hours
It might seem like nothing—reaching for the mouse or trackpad to close a window or move the cursor takes only a fraction of a second—but it breaks your flow and accumulates to great swaths of time you can use to get the work done instead. Learning some general hotkeys (keyboard shortcuts) and adding some custom ones to your workflow will increase your productivity in an instant. I’m on Windows, but will include the Mac equivalents where it is available.
General Hotkeys
Cursor control
This will speed up your navigation in text and code editors by a lot. Every time you find yourself reaching for the mouse to place your cursor, it would probably be faster to navigate using keys.
Jump word-by-word
I sometimes see people hold the right or left key down to get the cursor to the desired place on the line. With Ctrl+left/right you will jump on word at a time instead which will be much faster. Combine this with Shift, Ctrl+Shift+left/right to mark the words at the same time (for deletion, move or copy/paste).
Jump to beginning/end of line
Self-explanatory but often overlooked. Home and End buttons on the keyboard will do this.
Jump up/down in the document
This is faster than reaching for the mouse and dragging your way down or using the trackpad. PgUp/PgDown
This is especially useful in browsers such as Chrome or Firefox. It works in most applications that utilize tabs though (VS Code, for example). Jumping back and forward, closing tabs, open the one you just closed
Close tab
Windows: Ctrl+w
Mac: Cmd+w
Open most recently closed tab
This is useful when you use the above hotkey (close tab) too fast.
Windows: Ctrl+Shift+t
Mac: Cmd+Shift+t
Next/previous tab
Windows/Mac: Ctrl+Tab (next)
Ctrl+Shift+Tab (previous)
You can also jump straight to specific tabs with: Ctrl+[number]
For example, tab number 5 is at: Ctrl+5
The last tab is always (even if you have 9+ tabs open) at: Ctrl+9
Search in open tabs
This one is great for those of you (like me) that somehow always ends up with 30+ tabs during research sessions or regular browsing.
Windows: Ctrl+Shift+A Mac: Cmd+Shift+A
Organize open windows
This will make you faster in setting up and organizing your desktop environment.
Close current application/window
Windows: Alt+F4
Mac: Cmd+q
Move your windows around
This is useful for splitting your working space to work concurrently in many applications at the same time. You might want Excel on one half on the screen and your text editor on the other, for example.
Windows: Windows button+direction key
For example, the Windows button and right will put the window on the right half of your screen and let you choose what to display on the other half: split screen
Open Explorer/Finder
Windows: Windows button+e
Mac: Option+Command+Space
Shift between open windows
Essential for jumping between open applications and windows.
Windows: Alt+Tab. Use Alt+Ctrl+Shift to get an overview of all open windows.
Mac: Cmd+Tab (switch between applications) Cmd+Shift+Tab (shift between open windows)
Functionality
Paste unformatted
I don’t think we need to go through copy/paste, but copy unformatted is often overlooked. Sometimes when you paste the text might bring the formatting from wherever it was copied from.
Windows: Ctrl+Shift+V
Mac: Command+Shift+Option+V
Settings
Change language/keyboard layout
This one is great if you write in different languages. It saves me a lot of time going between Swedish and English keyboard as the layout is different.
Windows: Alt+Shift
Mac: Ctrl+Space
Dev specific
Dock/undock Google DevTools
It’s convenient to quickly switch back and forward between docked mode (see DevTools in the same window as your web page) and undocked.
Windows: Ctrl+Shift+D.
Quick Access in DevTools
This opens up a search for you, similar to what the same shortcut in VSCode does.
Windows: Ctrl+Shift+P.
Clipboard (copy/paste)
Text
Windows has a built-in clipboard history manager. With Mac, I recommend using Maccy{target=”/_blank”}
Windows:
Mac (with Maccy):
Image
Quickly being able to capture and share a screenshot of part of or the whole screen is a must.
Part of the screen
Windows: Shift+Windows button+S
Mac: Shift+Command+4
Custom hotkeys
It starts getting really powerful when you customize the hotkeys to your specific use cases. Most applications will let you map keyboard combinations as you wish.
Start applications
I have Chrome at Ctrl+Alt+c, VS Code at Ctrl+Alt+v and so on. You set these hotkeys (in Windows) by right-clicking the shortcut to the application and select properties:
This lets me keep my desktop clean, as I don’t need to have shortcuts on the desktop, as described here:
empty desktop
Custom Search Engines
In Chrome, you can save time by mapping hotkeys to search functionality on your favorite sites. Right-click the address field and choose “Edit search engines…”:
search engines
For example, I have:
search engines
And by just typing “gr” and space I can instantly search Goodreads:
search engines
Those are a few of the hotkeys I use to save time. There are lots more. Make a habit of stopping for a second if you notice you reach for the mouse. There is probably a better way to do that! | {
"url": "https://www.viktorlovgren.com/blog/hotkeys/",
"source_domain": "www.viktorlovgren.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "15219",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6FK6QNP6ZJH3PGL7ZNQPWFY6B362UZ44",
"WARC-Concurrent-To": "<urn:uuid:6e84b2e8-2096-4e3e-b11e-e18ae7c8a764>",
"WARC-Date": "2024-04-23T16:24:43Z",
"WARC-IP-Address": "75.2.60.5",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D5U2VALLIOIQFHB7ZBXEAZSPQ3OHGSLL",
"WARC-Record-ID": "<urn:uuid:1e4b55e8-2e60-4511-ac60-c427ea215d11>",
"WARC-Target-URI": "https://www.viktorlovgren.com/blog/hotkeys/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:86494306-c6fc-4b07-938c-3f0147d1f3ca>"
},
"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-234\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,
31,
32,
490,
491,
507,
508,
523,
524,
720,
721,
722,
740,
741,
1054,
1055,
1056,
1086,
1087,
1177,
1178,
1179,
1208,
1209,
1314,
1315,
1528,
1529,
1539,
1540,
1556,
1557,
1568,
1569,
1570,
1600,
1601,
1668,
1669,
1691,
1692,
1709,
1710,
1711,
1729,
1730,
1759,
1760,
1786,
1787,
1851,
1852,
1892,
1893,
1959,
1960,
1961,
1981,
1982,
2115,
2116,
2155,
2156,
2178,
2179,
2260,
2261,
2294,
2295,
2311,
2312,
2323,
2324,
2325,
2350,
2351,
2554,
2555,
2593,
2594,
2756,
2757,
2758,
2779,
2780,
2806,
2807,
2833,
2834,
2835,
2862,
2863,
2924,
2925,
3002,
3003,
3089,
3090,
3104,
3105,
3123,
3124,
3309,
3310,
3332,
3333,
3361,
3362,
3371,
3372,
3404,
3405,
3557,
3558,
3577,
3578,
3594,
3595,
3608,
3609,
3637,
3638,
3774,
3775,
3798,
3799,
3824,
3825,
3907,
3908,
3931,
3932,
3955,
3956,
3961,
3962,
4064,
4065,
4074,
4075,
4093,
4094,
4100,
4101,
4196,
4197,
4216,
4217,
4249,
4250,
4271,
4272,
4287,
4288,
4451,
4452,
4471,
4472,
4642,
4643,
4748,
4749,
4763,
4764,
4765,
4787,
4788,
4949,
4950,
4965,
4966,
4987,
4988,
5003,
5004,
5072,
5073,
5088,
5089
],
"line_end_idx": [
31,
32,
490,
491,
507,
508,
523,
524,
720,
721,
722,
740,
741,
1054,
1055,
1056,
1086,
1087,
1177,
1178,
1179,
1208,
1209,
1314,
1315,
1528,
1529,
1539,
1540,
1556,
1557,
1568,
1569,
1570,
1600,
1601,
1668,
1669,
1691,
1692,
1709,
1710,
1711,
1729,
1730,
1759,
1760,
1786,
1787,
1851,
1852,
1892,
1893,
1959,
1960,
1961,
1981,
1982,
2115,
2116,
2155,
2156,
2178,
2179,
2260,
2261,
2294,
2295,
2311,
2312,
2323,
2324,
2325,
2350,
2351,
2554,
2555,
2593,
2594,
2756,
2757,
2758,
2779,
2780,
2806,
2807,
2833,
2834,
2835,
2862,
2863,
2924,
2925,
3002,
3003,
3089,
3090,
3104,
3105,
3123,
3124,
3309,
3310,
3332,
3333,
3361,
3362,
3371,
3372,
3404,
3405,
3557,
3558,
3577,
3578,
3594,
3595,
3608,
3609,
3637,
3638,
3774,
3775,
3798,
3799,
3824,
3825,
3907,
3908,
3931,
3932,
3955,
3956,
3961,
3962,
4064,
4065,
4074,
4075,
4093,
4094,
4100,
4101,
4196,
4197,
4216,
4217,
4249,
4250,
4271,
4272,
4287,
4288,
4451,
4452,
4471,
4472,
4642,
4643,
4748,
4749,
4763,
4764,
4765,
4787,
4788,
4949,
4950,
4965,
4966,
4987,
4988,
5003,
5004,
5072,
5073,
5088,
5089,
5280
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5280,
"ccnet_original_nlines": 178,
"rps_doc_curly_bracket": 0.00037878999137319624,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3709964454174042,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016903910785913467,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18416370451450348,
"rps_doc_frac_unique_words": 0.4272189438343048,
"rps_doc_mean_word_length": 4.902958393096924,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.0008896799990907311,
"rps_doc_unigram_entropy": 5.311962127685547,
"rps_doc_word_count": 845,
"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.0084479795768857,
"rps_doc_frac_chars_top_3gram": 0.010620320215821266,
"rps_doc_frac_chars_top_4gram": 0.009172099642455578,
"rps_doc_books_importance": -468.1270446777344,
"rps_doc_books_importance_length_correction": -468.1270446777344,
"rps_doc_openwebtext_importance": -306.7025451660156,
"rps_doc_openwebtext_importance_length_correction": -306.7025451660156,
"rps_doc_wikipedia_importance": -213.0119171142578,
"rps_doc_wikipedia_importance_length_correction": -213.0119171142578
},
"fasttext": {
"dclm": 0.0651525929570198,
"english": 0.8857924938201904,
"fineweb_edu_approx": 2.265620708465576,
"eai_general_math": 0.5517036318778992,
"eai_open_web_math": 0.22744733095169067,
"eai_web_code": 0.1823468804359436
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-3,676,935,002,233,218,600 | Building dynamic tools
Hello Kal_Lam,
Thank you for being very helpful to us starting to use Kobo collect.
is it possible to build tools like the attached images below. Kindly help.
Hello kal_Lam,
Am trying to input the grid theme format in kobo collect shown below and using the excel form. kindly help.
@KNIE, you could do it as outlined in this enketo blog.
Thank you for the recommendation. However it isn’t helpful I had looked at it before i sent the question but it doesn’t provide assistance i requested
@KNIE, could you also let the community know what is not working? Maybe that would help the community to assist you with the issue.
More than one question can appear in the 1 row without allocating each question a column.
@KNIE, where will you have the response if you try to put all the questions in one row? Wouldn’t it be difficult to capture the response for all of them?
I was having this idea of text questions which would be in the same cell separated by the line. some thing like I shared.
@KNIE, much clear now. Well, this format is not supported yet. Maybe you will need to compromise here.
I see okay. Thank you so much for your time. Also is it possible to make the checkbox where respondents put right numbers in a checkbox instead of ticks?
@KNIE, sorry! This too is not possible.
Alright, thank you
1 Like | {
"url": "https://community.kobotoolbox.org/t/building-dynamic-tools/39476",
"source_domain": "community.kobotoolbox.org",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "44855",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KNF5GMRMV6NPAKLNIG3QT4IRWPVJIHJO",
"WARC-Concurrent-To": "<urn:uuid:6ce36402-2d87-470d-806c-8fc43252667d>",
"WARC-Date": "2023-10-01T06:13:53Z",
"WARC-IP-Address": "18.208.100.104",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YBUKTHUIKE3N6JSF27SFAZSJTYJJB4GV",
"WARC-Record-ID": "<urn:uuid:e131524e-0ba2-48d5-8bac-b144e2e290a3>",
"WARC-Target-URI": "https://community.kobotoolbox.org/t/building-dynamic-tools/39476",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7443249c-0f10-4df0-aca7-76be09b1554d>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-97\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,
23,
24,
39,
40,
109,
110,
185,
186,
187,
202,
203,
311,
312,
313,
369,
370,
521,
522,
654,
655,
745,
746,
900,
901,
1023,
1024,
1127,
1128,
1282,
1283,
1323,
1324,
1343,
1344
],
"line_end_idx": [
23,
24,
39,
40,
109,
110,
185,
186,
187,
202,
203,
311,
312,
313,
369,
370,
521,
522,
654,
655,
745,
746,
900,
901,
1023,
1024,
1127,
1128,
1282,
1283,
1323,
1324,
1343,
1344,
1350
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1350,
"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.5122807025909424,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031578950583934784,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1438596546649933,
"rps_doc_frac_unique_words": 0.5761317014694214,
"rps_doc_mean_word_length": 4.329217910766602,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.635123252868652,
"rps_doc_word_count": 243,
"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.03041825070977211,
"rps_doc_frac_chars_top_3gram": 0.020912550389766693,
"rps_doc_frac_chars_top_4gram": 0.026615969836711884,
"rps_doc_books_importance": -129.79171752929688,
"rps_doc_books_importance_length_correction": -129.79168701171875,
"rps_doc_openwebtext_importance": -69.69576263427734,
"rps_doc_openwebtext_importance_length_correction": -69.69576263427734,
"rps_doc_wikipedia_importance": -53.48275375366211,
"rps_doc_wikipedia_importance_length_correction": -53.452903747558594
},
"fasttext": {
"dclm": 0.20023572444915771,
"english": 0.9606737494468689,
"fineweb_edu_approx": 1.5099831819534302,
"eai_general_math": 0.8735800981521606,
"eai_open_web_math": 0.2287808656692505,
"eai_web_code": 0.16186344623565674
}
} | {
"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.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-3,333,005,995,793,456,600 | How to install Searchanise on Magento 2
There are two ways to install the Searchanise extension in your Magento 2 store: using CLI or via Composer.
Before the installation, you may want to:
1. Back up your database.
2. Enable maintenance mode:
bin/magento maintenance:enable
Install the extension using CLI
Steps:
1. Download the Searchanise Smart Search Autocomplete extension’s archive from the Commerce Marketplace.
2. Extract the archive to the following folder: <magento2-dir>/app/code/Searchanise/SearchAutocomplete. By default, this folder is absent, so you need to create it first.
3. Execute the following command in the root Magento’s directory to register the extension:
1. For a default or development Magento mode:
php bin/magento setup:upgrade
2. For a production Magento mode::
php bin/magento setup:upgrade
php bin/magento setup:di:compile
php bin/magento setup:static-content:deploy
4. Verify that the extension is installed correctly.
That’s it. The extension is installed.
Install the extension using Composer
Steps:
1. Get the Searchanise Smart Search Autocomplete extension from the Commerce Marketplace.
2. Create the auth.json file in your Magento project using the following command if it hasn’t been created yet:
cp auth.json.sample auth.json
3. Enter your authentication keys – replace <public-key> and <private-key> in the auth.json file.
4. Install the extension executing the following command:
composer require searchanise/search-autocomplete
5. Register the extension executing the following command:
1. For a default or development Magento mode:
php bin/magento setup:upgrade
2. For a production Magento mode:
php bin/magento setup:upgrade
php bin/magento setup:di:compile
php bin/magento setup:static-content:deploy
6. Verify that the extension is installed correctly.
That’s it. The extension is installed.
You can also follow the guidelines of Magento documentation, to install the extension this way.
Verify the extension
Steps:
1. To verify that the extension is installed correctly, run the following command:
bin/magento module:status
2. Look for the extension under “List of disabled modules”. If you’ve found it there, it is disabled. Enable it and clear static view files executing the following command:
bin/magento module:enable Searchanise_SearchAutocomplete --clear-static-content
That’s it. You can now configure and use the extension.
Enjoying your experience with Searchanise?
We’d appreciate it if you could take some time to leave a review.
Updated on March 10, 2022
Was this article helpful?
Related Articles
Need Support?
Can't find the answer you're looking for?
Contact Support
Back to top | {
"url": "https://docs.searchanise.io/install-extension-magento-2/",
"source_domain": "docs.searchanise.io",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "67008",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MJHI7Q3W36FTOTEXKID767BFC7U6MFCY",
"WARC-Concurrent-To": "<urn:uuid:35496c0a-9fdc-401f-b264-ecd8df88888e>",
"WARC-Date": "2022-06-25T11:45:03Z",
"WARC-IP-Address": "108.170.45.163",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X3QEPJZMACWJKYH2CS5P6BLMI6MJOMQL",
"WARC-Record-ID": "<urn:uuid:00f18914-97a8-4da1-917d-f018bb7d2ce3>",
"WARC-Target-URI": "https://docs.searchanise.io/install-extension-magento-2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e982aa59-b886-4b5e-9b34-5aec03fcd980>"
},
"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-185\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,
40,
41,
149,
150,
192,
193,
221,
251,
286,
287,
319,
320,
327,
328,
437,
612,
708,
760,
798,
839,
878,
887,
929,
981,
1038,
1039,
1078,
1079,
1116,
1117,
1124,
1125,
1217,
1331,
1365,
1465,
1525,
1578,
1639,
1689,
1725,
1763,
1800,
1840,
1890,
1945,
1946,
1985,
1986,
2082,
2083,
2104,
2105,
2112,
2113,
2198,
2228,
2403,
2487,
2488,
2544,
2545,
2588,
2589,
2655,
2656,
2682,
2683,
2709,
2710,
2727,
2728,
2742,
2784,
2800
],
"line_end_idx": [
40,
41,
149,
150,
192,
193,
221,
251,
286,
287,
319,
320,
327,
328,
437,
612,
708,
760,
798,
839,
878,
887,
929,
981,
1038,
1039,
1078,
1079,
1116,
1117,
1124,
1125,
1217,
1331,
1365,
1465,
1525,
1578,
1639,
1689,
1725,
1763,
1800,
1840,
1890,
1945,
1946,
1985,
1986,
2082,
2083,
2104,
2105,
2112,
2113,
2198,
2228,
2403,
2487,
2488,
2544,
2545,
2588,
2589,
2655,
2656,
2682,
2683,
2709,
2710,
2727,
2728,
2742,
2784,
2800,
2811
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2811,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25724637508392334,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00362319010309875,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2699275314807892,
"rps_doc_frac_unique_words": 0.42204299569129944,
"rps_doc_mean_word_length": 5.784946441650391,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.580438137054443,
"rps_doc_word_count": 372,
"rps_doc_frac_chars_dupe_10grams": 0.2314126342535019,
"rps_doc_frac_chars_dupe_5grams": 0.3475836515426636,
"rps_doc_frac_chars_dupe_6grams": 0.2881040871143341,
"rps_doc_frac_chars_dupe_7grams": 0.2509293556213379,
"rps_doc_frac_chars_dupe_8grams": 0.2314126342535019,
"rps_doc_frac_chars_dupe_9grams": 0.2314126342535019,
"rps_doc_frac_chars_top_2gram": 0.07806690782308578,
"rps_doc_frac_chars_top_3gram": 0.05297397822141647,
"rps_doc_frac_chars_top_4gram": 0.05343865975737572,
"rps_doc_books_importance": -272.9302062988281,
"rps_doc_books_importance_length_correction": -272.9302062988281,
"rps_doc_openwebtext_importance": -126.31539916992188,
"rps_doc_openwebtext_importance_length_correction": -126.31539916992188,
"rps_doc_wikipedia_importance": -114.10118865966797,
"rps_doc_wikipedia_importance_length_correction": -114.10118865966797
},
"fasttext": {
"dclm": 0.2992587685585022,
"english": 0.772929310798645,
"fineweb_edu_approx": 1.3461472988128662,
"eai_general_math": 0.11207163333892822,
"eai_open_web_math": 0.4013015627861023,
"eai_web_code": 0.0019330399809405208
}
} | {
"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": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-6,564,644,145,116,390,000 | Skip to Content
Event Information
SAP Inside Track Berlin 2019
On the 31/08/2019 was SAP Inside Track in Berlin. As I write this I am on the train going back from Berlin to Heidelberg. A trip of six hours which I do not mind at all as I am sitting in the bar.
Berlin is a wonderful city. Last time I was there it was snowing, this time it was over 35 degrees centigrade but that doesn’t really matter. It is just a pleasure to walk around popping into various cafes and bars.
I had asked the organisers what hotel to stay in and they gave me a short list of three hotels. I choose the “weinmaster” because I liked the name. It turned out to e a very “arty” place which is no bad thing and also it had an adult’s only policy which I found interesting when I read about it, but sadly there was nothing rude/naughty about the place.
Berlin Hotel Wall
I travel on business a lot and one thing I notice is that the rule for hotels is that no two hotels can have shower controls that work in even a vaguely similar way. There seems to be a worldwide contest as to who can produce controls which are the most difficult to work out how to use them. This is a very competitive field but the Weinmaster wins hands down. It is even worse for me as I am pretty much blind without my glasses, I asked the receptionist about his and he said pretty much every single guest had brought the subject up. His quote was “someone put a huge amount of effort into designing this system … which doesn’t mean it is good”. Later you will see how this ties in with a talk given at SIT Berlin.
Maybe now is the time to actually start talking about the even itself. First up was the pre-event beers on the Friday night at a beer hall near to the event venue. That venue was the “SAP Data Space” which is sort of like a mini conference centre. It is co-located with the “SAP Data Kitchen” which sells food to nearby non-SAP companies. You do not generally think of SAP as being in the food provider business, though they do have coffee shops as I understand it e.g. one in Paolo Alto in California.
There were eight sessions, so here we go:-
HANDCUFFED & BLINDFOLDED – Soumalya Nash & Bart Van De Kamp (Accenture)
This being Berlin when you see the stage full of handcuffs and blindfolds it is all too easy to make certain assumptions like I did about my “adults only” hotel Once again there was nothing rude/naughty going on, the only reason the presenters wanted to blindfold and handcuff volunteers from the audience was – I hope – to stop them interacting with a computer system using a keyboard and instead use the “conversational AI” product from SAP and just tell the system what they wanted it to do using their voices.
In this case one person had to tell the system – via Alexa – to create a purchase order and someone else had to approve it. It was probably a bad example to pick as in my experience people how have to do manual repetitive tasks like creating purchase orders tend to master the process after a few weeks no matter how complex the SAP screens are. In this case the process took far, far longer than manual input would have done mainly because the “chatbot” kept talking and talking and refused to be interrupted until the volunteer screamed at it “SHUT UP!” to which it replied “we all have our limits” which I thought was quite a witty response from a machine.
Maybe there is something wrong with me but I don’t like talking to robots, which I have to do more and more as the years go by. The more realistic they are the less I like it. When I set up my trial HANA account on the CAL I had to set up an AWS account. The SAP side was all manual and involved about fifty thousand steps and took forever. The AWS side involved talking to a machine that sounded and responded almost exactly like a human and that process only took a few minutes but is disturbed me greatly. I knew I was not talking to a human no matter how much it sounded like one.
I don’t much like animals acting like humans either. With monkeys and aps it is just about OK, but I saw a certain type of dog in Ukraine which would walk around on its hind legs every so often and that gave me the creeps. It’s the same when a Parrot or similar bird says “Hello!” or sometimes even a full sentence. Just like a machine it has no idea of the meaning of what it is saying but in both cases it sounds like it does.
However, just in case you do not have some sort of horrible phobia about talking to robots like I obviously do, SAP are making great strides in this area.
There is a website with the URL cai.tools.sap where you can build a prototype of this sort of technology for free. The whole process did not seem complicated at all. You have to define some “triggers” – what is the intent of the user e.g. do they want to create a purchase order (or a monster) and once the robot has worked out what the human wants you need to define a corresponding “action” which could be a URL to an OData service in SAP to create a purchase order (or monster).
One thing I did find funny was on the website was an apology about the name of the product changing. SAP renaming products? Surely Not! I could be totally wrong about this but I seemed to get the message from this presentation that SAP no longer calls their virtual assistant “co-pilot”. I am happy to be corrected on this.
DATABASES GO MULTIMODAL – Vitaly Rudnytskiy (SAP)
The first thing the presenter did was to give out of a pair of “developer socks” to an audience member as a prize. This sort of thing is very important.
Another fascinating fact is that the font in Fiori 2.0 is called “Font 72” on the grounds that SAP was formed in 1972.
Moving onto the main thrust of the talk people like me are used to Oracle databases which store data in a certain way (RDMS) with tables with foreign key relationships are so on and so forth. As it transpires other types of databases store data in a very different way and “multi-modal” databases can store the same data in lots of different ways all at once. I could be talking nonsense here but that is the impression I got.
As you no doubt know SAP has been buying a large number of various companies in the last few years, all cloud type organisations. When you buy a company you also get any technology they have developed and patented, whether you want it or not. As an example SAP got the JAM collaboration platform when they bought SuccessFactors which was of course not the reason they bought the company it was a sort of added bonus (or added liability depending on what you think of JAM).
In the same way when SAP bought “Callidus Cloud” as a side effect they got the rights to a database called “Orient DB” which is a multi-modal type of affair. This was demonstrated using the ever popular “Open Beer Model” (which keeps cropping up at SIT events) where you can see the same data in either a tabular form or a graphical form. What do I mean by a graphical form? That is where something like a beer or a brewery is represented by a ball with arrows linking it to associated data e.g. beer X is brewed by brewery Y in the city of Z.
In the same way the HANA database has multi-modal features. In this example a data set of Marvel superheroes was used. There are about six and a half thousand of them as it turns out.
To end off with Vitally gave out another present –this time a fluff (Teddy Bear) to one of the SIT Berlin organisers Oliver as he has a new son. The gentlemen in question actually turned up at the after event beers but he could not drink too many beers as he was only a few weeks old.
BLOCKCHAIN FOR FRAUD PREVENTION – Karina Krupina & Nena Becker (SAP)
This was the first of two sessions all about blockchain. In this one the story was all about a fictional person called Peter Purchaser who every time he has to buy something pretends he is putting the deal out to tender but in actual fact always arranges things so his mate Stefan Supplier gets the job. This is, of course, fraud.
The idea from SAP – and this is just a proof of concept, not an actual product as yet – is that the various suppliers contacted submit their bids and the details al get stored in a “blockchain”. Peter purchase cannot see the actual values until the deadline passes so he cannot tell Stefan what the other bids are, and after the deadline since the blockchain is immutable Stefan cannot sneakily lower his bid after the event.
Now it could be argued there are about ten billion zillion other ways to achieve the same goal, but I don’t suppose that is the point. This is just a possible use case for blockchain, which is often viewed as a solution looking for a problem.
WHAT IS BLOCKCHAIN AND WHAT IS A CONSENSUS MECHANISM? – Andrea Pham (SAP)
This maybe should have gone first as one person in the audience said he only understood the first blockchain presentation after listening to the second.
If someone thinks they have a use case for blockchain the first problem they have is that there are a very large number pf blockchain suppliers so it is very difficult to work out which one to pick. The analogy made was that of email providers – in the past there were a very large number of them as well and now this has dwindled down to just a few e.g. Google and Yahoo. So presumably the same thing will happen with the blockchain providers.
The definition of blockchain is “mathematical proof that something happened” as opposed to a person or organisation claiming that event happened.
One thing that is very clear, and was the main focus of the presentation is that blockchain does not seem to be all that secure, there are dozens of possible attack methods. My favourite one is the “Sybil Attack” because that reminds me of “Fawlty Towers”. In any event a large number of people have had a very large amount of money stolen from them via such attacks.
A “consensus mechanism” is a defence against these sort of attacks, and it seems that most of them do not work very well.
Now I could have got totally the wrong end of the stick here, but it seems to me that maybe blockchain.is possibly not the silver bullet which will solve all the worlds’ problems.
Typical Berlin Street
DESIGN THINKING IN “ACTIVATE” METHODOLOGY – ANNE JOHNSON & JULIANA HENDEL
No doubt you have heard about “design thinking” a million times before and know that “activate” is the successor to the ASAP methodology when it comes to implementing SAP projects – for example there are some radical new concepts like using “sprints” to delivery missing functions in short bursts as as opposed to loads of functions at once in a “waterfall” phase.
This was an interactive presentation where the audience had to split into teams of three and come up with crazy ideas to improve a beer themed web site which had most of its functionality filled by SAP standard but still had some gaps which needed to be addressed.
The presentation ended with some psychology of why this sort of design thinking worked e.g. when someone “owns” an idea they are more attached to it then if it is assigned to them. In my experience when someone gets the idea they “own” something e.g. a certain program then they guard it to the death and will not let anyone else come near it.
Neither presenter works for SAP, and the next observation is mine alone – if there is some sort of methodology to address gaps in the SAP standard then the positive thing is that hopefully some people at SAP understand there are gaps rather than the “everything vanilla / if you have a special requirement it is bound to be covered by standard SAP functionality either now or one day far off in the future” message I hear at major SAP events.
BUILDING THE RIGHT IT BEFORE YOU BUILD IT RIGHT – TUDOR RISUTIA
As you may possibly know not every IT type project goes successfully and when the audinec was asked for a show of hands as to who had been on a disastrous project many hands went up, including mine.
This is not just related to SAP – though they have come up with some products in their time which were pretty much dead on arrival e.g. SEM, Web Dynpro Java, XApps, ESOA and so on – for example 80% of mobile apps do not make money but that does not stop ten billion people creating new ones every day.
This ties back to the shower system at my hotel. Someone spent ages building the system and it cost the hotel a fortune and it is unusable by a human.
Tudor explained the concept of PRETOTYPING as opposed to PROTOTYPING. This is the concept of seeming to build a prototype without actually building one – the rhyme is “faking it before making it”.
He gave some famous examples. The most pertinent is that of IBM who were considering building a speech to text machine many years ago when most people hated typing. Instead of a real machine they had someone behind the wall listening to what the testers said and typing it in so it appeared on the screen as they said it.
That was a lot easier to build than any sort of speech to text software. Ironically as it turned out the focus group initially liked the idea but then decided it was a load of old rubbish as it would make the office really noisy, give you a sore throat etc..
The reason I think this is pertinent is that IBM abandoned that speech to text thing as a bad idea 20 years ago, and yet today the very first presentation was all about conversational AI which was a real prototype speech to text thing (albeit with added AI) which the volunteers from the audience also quickly learned to hate. So in some ways there really is nothing new under the sun.
The “Mechanical Turk” was another example from the 19th century. Its inventor claimed it was a machine that could play chess but in real life there was a chess expert dwarf inside with big feet hiding inside the machine moving around the chess pieces. Nonetheless it fooled everyone at the time.
Fast forward to the present day and Amazon offer a service called “The Mechanical Turk” which they describe as “artificial artificial intelligence”. Here the fake prototype involves calling an AI/ML service which is actually one or more people pretending to be computers that can do AI/ML.I love the idea, and what a wonderful thing to be able to say when someone asks you at a party what you do for a living i.e. impersonate a computer.
There were a whole bunch of other methods to fake up prototypes and I cannot recall them all but two I noted won were BUILD from SAP which I have written about where you can create a UI quickly with clickable fields where you can navigate between screens and so on, and then at the end generate some JavaScript code as a starting point. It just occurred to me as I wrote that that the SAP guideline is to have the controller in JavaScript and the view in XML. I wonder what BUILD generates the view as? I just went to my ABAP to the Future book to check and luckily the view is in XML. I knew that book would be useful for something one day.
A non-SAP thing that was shown was “teleport” where instead of drawing the screens on a computer screen like you do in BUILD you draw them on an actual physical whiteboard with a marker pen just like you do in meetings currently. Then the application scans the whiteboard and generates code from what you have drawn.
Berlin Beer
NOTHING ABOUT DEVILS – SOREN SCHLEGEL
As it said in the title this session was not about devils – it was about ABAP daemons instead and how they relate to the internet of things. I was happy to hear this as I have often struggled to find a real life use case for the things.
In case you do not know yet a Daemon is a background process, and an ABAP Daemon is no different – it is like a batch job that runs forever until programmatically stopped, one that comes back to life it it “dies” via a short dump or an application server shutdown or some such. If one application server goes down they can jump out and into another one and keep going.
The presentation started by noting there were ten billion zillion different IOT providers, all claiming they are better than all the others. As with the blockchain companies presumably eventually this this will get whittled won over time by business failures and mergers and acquisitions.
MQTT is a communication protocol designed for remote locations, and it has a very small code footprint which sits inside your “thing” – which in the demonstration was a chip about half an inch long.
MQTT requires a broker and that is where the ABAP daemon comes in. You create a Z class based on CL_ABAP_DAMEON_EXT_BASE and use that to set the Daemon going programmatically (or indeed switch it off) and to publish and subscribe to events.
You can monitor which ones are active with TCODE STMDAEMON.
So far so good. I never got around to asking him (though I had plenty of time to do just that, I was too busy drinking) how that compares with the ABAP Channels concept which also uses a publish and subscribe mechanism. The ABAP channels are bit more form based and the Daemons seem to be all code but they seem to do the same sort of thing i.e. react to events (messages) and forward them on to subscribed applications.
APACK – Sebastian Wolf (SAP)
I wrote about this in my blog about SIT Oslo so there is no need to repeat myself – just follow the link below
https://blogs.sap.com/2019/08/20/sap-inside-track-oslo-2019/
I will say this is an open source project and I subscribe to updates which happen almost every day, so this is a fast evolving product.
TWO BEER SESSIONS
The first one was a BBQ right in the garden of the venue, with great food, loads of beer and wine, and an ice cream to finish off – and all for free! Just to be clear there was no charge for the event, food and coke and water all day, breakfast and lunch and a BBQ at the end, and there was also some SAP stuff to listen to during the day, so what is not to like about this?
Eventually though the SAP Data Kitchen staff wanted to go home for some reason as opposed to just keep giving us more bottles of wine until the wine cellar was emptied which was, admittedly, our plan. They eventually managed to get rid of us and we migrated down the road to the “Lemke” beer hall where we had the pre-event drinks the night before.
Berlin Lemke Beers
Then I had a beer at the hotel bar when I got back, however that is probably not vitally important information for you to have.
SUMMARY
It was a wonderful event. Sadly I have to return to Australia in a few weeks, so will not be here (Germany) for the next one but if I was I would be there like a shot. If you get the chance I would encourage you to attend the next one.
Cheersy Cheers
Paul
6 Comments
You must be Logged on to comment or reply to a post.
• Thanks for the in depth summary of our little event, Paul. You covered the gist of it pretty well with beer, handcuffs, food, and more beer, and some technical sessions on top. One think that wasn’t for adults that comes to mind was the SAP teddy bear from Vitalij. Glad you liked it, and thanks for the recommendation. Hope to have you back sometime soon.
Cheers!
• Hi Paul,
Thanks a lot for the feedback.
Though I’m a bit sorry to hear that you didn’t like talking to robots. 🙁 But our main idea was to highlight this new technology offering from SAP in the domain of the modern user interface. I hope we could share some information about it.😊
Just one more thing, SAP is not actually renaming their old product CoPilot to Conversational AI, they recently acquired the platform Recast.AI and then renamed it to SAP Conversational AI, and then they are now migrating the CoPliot into Conversational AI. Thus Merging two products into one.
We hope to meet you again in another SAP event. We liked the SIT Berlin a lot, and would surely recommend all SAP developers to try to attend it if feasible next year. 😊
• Hello
Just one further question – SAP’s Firori strategy was to have a “co-pilot” section in the standard layout of all future applications. After the merging of the two products is complete I presume the name “Co-Pilot” will be no more and instead there will be a “conversational AI” section in the standard Fiori layout?
Cheersy Cheers
Paul
• Hi Paul,
The digital assistant that will available as per the standard Fiori 3.0 layout, will still be called CoPilot digital assistant, but this component will run on the SAP Conversational AI platform, in the back.
The following high level diagram represents the basic working principal.
Best Regards,
Soumalya
• Hi Paul,
Thanks for joining and your very valuable feedback.
In addition to Soumalya’s input also to highlight that in future the SAP Co-Pilot will be named as Co-Pilot. The reason behind this is that’s not a separate product anymore, which also means no separate license. SAP will provide standard Co-Pilot skills, in case of extension then the SAP CAI Platform is required (thus also the license).
Initially the focus will be on the digital assistant functionalities, but soon also the person-to-person functionalities.
Kind Regards,
Bart | {
"url": "https://blogs.sap.com/2019/09/05/sap-inside-track-berlin-2019/",
"source_domain": "blogs.sap.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "73468",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QTFRJC3ZA5XMNQM2EA4YUL65EXX3PTTC",
"WARC-Concurrent-To": "<urn:uuid:14c4b171-d503-4c13-ac01-342f417e0ad6>",
"WARC-Date": "2019-10-22T04:25:34Z",
"WARC-IP-Address": "23.50.137.47",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OTNFGP6OSMQUSLKDU7DDW3LIZLNSZSLD",
"WARC-Record-ID": "<urn:uuid:cda65ce8-22f7-424f-bf45-7250c0eae996>",
"WARC-Target-URI": "https://blogs.sap.com/2019/09/05/sap-inside-track-berlin-2019/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db274cc3-9573-42bb-8a2b-c74f91c07ea4>"
},
"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-129.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
16,
34,
35,
64,
65,
262,
263,
479,
480,
834,
835,
853,
854,
1573,
1574,
2077,
2078,
2121,
2122,
2194,
2195,
2709,
2710,
3370,
3371,
3956,
3957,
4386,
4387,
4542,
4543,
5025,
5026,
5350,
5351,
5401,
5402,
5555,
5556,
5675,
5676,
6103,
6104,
6577,
6578,
7122,
7123,
7307,
7308,
7593,
7594,
7663,
7664,
7995,
7996,
8422,
8423,
8666,
8667,
8741,
8742,
8895,
8896,
9342,
9343,
9489,
9490,
9858,
9859,
9981,
9982,
10162,
10163,
10185,
10186,
10260,
10261,
10626,
10627,
10892,
10893,
11237,
11238,
11681,
11682,
11746,
11747,
11946,
11947,
12249,
12250,
12401,
12402,
12599,
12600,
12922,
12923,
13182,
13183,
13569,
13570,
13866,
13867,
14306,
14307,
14949,
14950,
15267,
15268,
15280,
15281,
15319,
15320,
15557,
15558,
15927,
15928,
16217,
16218,
16417,
16418,
16659,
16660,
16720,
16721,
17142,
17143,
17172,
17173,
17284,
17285,
17346,
17347,
17483,
17484,
17502,
17503,
17878,
17879,
18228,
18229,
18248,
18249,
18377,
18378,
18386,
18387,
18623,
18624,
18639,
18640,
18645,
18646,
18657,
18710,
19071,
19072,
19084,
19085,
19098,
19099,
19134,
19135,
19379,
19380,
19678,
19679,
19854,
19855,
19867,
19868,
20190,
20191,
20212,
20213,
20224,
20225,
20242,
20243,
20459,
20460,
20541,
20542,
20552,
20553,
20563,
20564,
20586,
20587,
20604,
20605,
20622,
20623,
20683,
20684,
21031,
21032,
21162,
21163,
21185
],
"line_end_idx": [
16,
34,
35,
64,
65,
262,
263,
479,
480,
834,
835,
853,
854,
1573,
1574,
2077,
2078,
2121,
2122,
2194,
2195,
2709,
2710,
3370,
3371,
3956,
3957,
4386,
4387,
4542,
4543,
5025,
5026,
5350,
5351,
5401,
5402,
5555,
5556,
5675,
5676,
6103,
6104,
6577,
6578,
7122,
7123,
7307,
7308,
7593,
7594,
7663,
7664,
7995,
7996,
8422,
8423,
8666,
8667,
8741,
8742,
8895,
8896,
9342,
9343,
9489,
9490,
9858,
9859,
9981,
9982,
10162,
10163,
10185,
10186,
10260,
10261,
10626,
10627,
10892,
10893,
11237,
11238,
11681,
11682,
11746,
11747,
11946,
11947,
12249,
12250,
12401,
12402,
12599,
12600,
12922,
12923,
13182,
13183,
13569,
13570,
13866,
13867,
14306,
14307,
14949,
14950,
15267,
15268,
15280,
15281,
15319,
15320,
15557,
15558,
15927,
15928,
16217,
16218,
16417,
16418,
16659,
16660,
16720,
16721,
17142,
17143,
17172,
17173,
17284,
17285,
17346,
17347,
17483,
17484,
17502,
17503,
17878,
17879,
18228,
18229,
18248,
18249,
18377,
18378,
18386,
18387,
18623,
18624,
18639,
18640,
18645,
18646,
18657,
18710,
19071,
19072,
19084,
19085,
19098,
19099,
19134,
19135,
19379,
19380,
19678,
19679,
19854,
19855,
19867,
19868,
20190,
20191,
20212,
20213,
20224,
20225,
20242,
20243,
20459,
20460,
20541,
20542,
20552,
20553,
20563,
20564,
20586,
20587,
20604,
20605,
20622,
20623,
20683,
20684,
21031,
21032,
21162,
21163,
21185,
21197
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 21197,
"ccnet_original_nlines": 200,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.49827703833580017,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05191821977496147,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10843096673488617,
"rps_doc_frac_unique_words": 0.2951962947845459,
"rps_doc_mean_word_length": 4.322055816650391,
"rps_doc_num_sentences": 185,
"rps_doc_symbol_to_word_ratio": 0.00022972999431658536,
"rps_doc_unigram_entropy": 5.936460018157959,
"rps_doc_word_count": 3872,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.00585599010810256,
"rps_doc_frac_chars_dupe_6grams": 0.002868240000680089,
"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.005079180002212524,
"rps_doc_frac_chars_top_3gram": 0.0026292200200259686,
"rps_doc_frac_chars_top_4gram": 0.003047510050237179,
"rps_doc_books_importance": -2068.8017578125,
"rps_doc_books_importance_length_correction": -2068.8017578125,
"rps_doc_openwebtext_importance": -1256.5146484375,
"rps_doc_openwebtext_importance_length_correction": -1256.5146484375,
"rps_doc_wikipedia_importance": -910.3176879882812,
"rps_doc_wikipedia_importance_length_correction": -910.3176879882812
},
"fasttext": {
"dclm": 0.11043577641248703,
"english": 0.9776089787483215,
"fineweb_edu_approx": 1.6339998245239258,
"eai_general_math": 0.45851725339889526,
"eai_open_web_math": 0.26784706115722656,
"eai_web_code": 0.08704637736082077
}
} | {
"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": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
7,571,795,367,065,884,000 | Statalist
[Date Prev][Date Next][Thread Prev][Thread Next][Date index][Thread index]
st: RE: Help with loops
From "[email protected]" <[email protected]>
To "[email protected]" <[email protected]>
Subject st: RE: Help with loops
Date Fri, 16 May 2008 07:40:02 -0700
Dots are not allowed in variable names. Period.
So your code could read something like this:
local varlist1 "var1 var2 var3 var4"
forval i = 1/3 {
foreach X of local varlist1 {
gen `X'_y`i' = `X'_y
replace `X'_y`i' = `X'_y + (`X'_y * `i'/100)
}
}
It's not a good idea to loop over lists like 0.01 0.02 0.03, as sooner
or later precision problems will bite. I always loop over integers, and
do any arithmetic yielding fractions _inside_ the loop.
Notice that I changed your outer loop to -forval-. That's a matter of
style, not syntax.
Nick
[email protected]
Rijo John
I have the following that gives results the way I wanted.
local varlist1 "var1 var2 var3 var4 "
foreach i in 1 2 3{
foreach X of local varlist1{
gen `X'_y`i'=`X'_y
replace `X'_y`i' = `X'_y+(`X'_y*`i')
}
}
However, if I change values 1, 2, 3 to 0.01, 0.02 and 0.03 it gives me
the error saying "var1_y0.01 invalid name". As I understand variables
can not be named with dots in it? if so how do I get around? how can I
modify it to generate variabes such as var1_y1=var1-(var1_y*0.01) and
so on.
*
* For searches and help try:
* http://www.stata.com/support/faqs/res/findit.html
* http://www.stata.com/support/statalist/faq
* http://www.ats.ucla.edu/stat/stata/
_____________________________________________________________________
Mensaje analizado y protegido por Telefonica Empresas
*
* For searches and help try:
* http://www.stata.com/support/faqs/res/findit.html
* http://www.stata.com/support/statalist/faq
* http://www.ats.ucla.edu/stat/stata/
Privileged, confidential or patient identifiable information may be contained in this message. This information is meant only for the use of the intended recipients. If you are not the intended recipient, or if the message has been addressed to you in error, do not read, disclose, reproduce, distribute, disseminate or otherwise use this transmission. Instead, please notify the sender by reply e-mail, and then destroy all copies of the message and any attachments.
*
* For searches and help try:
* http://www.stata.com/support/faqs/res/findit.html
* http://www.stata.com/support/statalist/faq
* http://www.ats.ucla.edu/stat/stata/
© Copyright 1996–2015 StataCorp LP | Terms of use | Privacy | Contact us | What's new | Site index | {
"url": "http://www.stata.com/statalist/archive/2008-05/msg00664.html",
"source_domain": "www.stata.com",
"snapshot_id": "crawl=CC-MAIN-2015-27",
"warc_metadata": {
"Content-Length": "7956",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P3PAAM22TN3F44DNTXGCH6EE5XRBOOXW",
"WARC-Concurrent-To": "<urn:uuid:85c41db7-117a-4574-be62-6203d5ca62e3>",
"WARC-Date": "2015-07-05T09:35:28Z",
"WARC-IP-Address": "66.76.6.5",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:GXO43EOOM2JO7O53WTINRA7R2O4SSKMU",
"WARC-Record-ID": "<urn:uuid:d5833526-8dc4-4744-8808-4161d8ce66f8>",
"WARC-Target-URI": "http://www.stata.com/statalist/archive/2008-05/msg00664.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f25d1c58-0ddb-4965-b121-3b9d4f3ffeed>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-179-60-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-27\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
10,
11,
12,
87,
88,
112,
113,
114,
167,
238,
272,
311,
312,
360,
361,
406,
407,
444,
461,
499,
528,
589,
599,
601,
602,
673,
745,
801,
802,
872,
891,
892,
897,
918,
919,
929,
930,
988,
989,
1027,
1048,
1085,
1116,
1165,
1175,
1177,
1178,
1249,
1319,
1390,
1460,
1467,
1468,
1470,
1501,
1555,
1602,
1642,
1643,
1713,
1767,
1769,
1800,
1854,
1901,
1941,
1942,
2410,
2411,
2413,
2444,
2498,
2545,
2585,
2586,
2587,
2588
],
"line_end_idx": [
10,
11,
12,
87,
88,
112,
113,
114,
167,
238,
272,
311,
312,
360,
361,
406,
407,
444,
461,
499,
528,
589,
599,
601,
602,
673,
745,
801,
802,
872,
891,
892,
897,
918,
919,
929,
930,
988,
989,
1027,
1048,
1085,
1116,
1165,
1175,
1177,
1178,
1249,
1319,
1390,
1460,
1467,
1468,
1470,
1501,
1555,
1602,
1642,
1643,
1713,
1767,
1769,
1800,
1854,
1901,
1941,
1942,
2410,
2411,
2413,
2444,
2498,
2545,
2585,
2586,
2587,
2588,
2706
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2706,
"ccnet_original_nlines": 77,
"rps_doc_curly_bracket": 0.0029563899151980877,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.223837211728096,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.033430229872465134,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3866279125213623,
"rps_doc_frac_unique_words": 0.5813252925872803,
"rps_doc_mean_word_length": 5.533132553100586,
"rps_doc_num_sentences": 64,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.036273002624512,
"rps_doc_word_count": 332,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.2743603587150574,
"rps_doc_frac_chars_dupe_6grams": 0.2558519244194031,
"rps_doc_frac_chars_dupe_7grams": 0.19597168266773224,
"rps_doc_frac_chars_dupe_8grams": 0.19597168266773224,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.028307020664215088,
"rps_doc_frac_chars_top_3gram": 0.0228633601218462,
"rps_doc_frac_chars_top_4gram": 0.029395749792456627,
"rps_doc_books_importance": -252.22869873046875,
"rps_doc_books_importance_length_correction": -252.22869873046875,
"rps_doc_openwebtext_importance": -134.61949157714844,
"rps_doc_openwebtext_importance_length_correction": -134.61949157714844,
"rps_doc_wikipedia_importance": -102.2977523803711,
"rps_doc_wikipedia_importance_length_correction": -102.2977523803711
},
"fasttext": {
"dclm": 0.5827590823173523,
"english": 0.6729860305786133,
"fineweb_edu_approx": 1.5172237157821655,
"eai_general_math": 0.18500441312789917,
"eai_open_web_math": 0.3532711863517761,
"eai_web_code": 0.06162494048476219
}
} | {
"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": "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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,498,156,927,133,189,000 | Hive学习笔记（五）—— DML 数据操作
5.1 数据导入
5.1.1 向表中装载数据（Load）
1．语法
hive> load data [local] inpath ‘/opt/module/datas/student.txt’ [overwrite] | into table student
[partition (partcol1=val1,…)];
（1）load data:表示加载数据
（2）local:表示从本地加载数据到 hive 表；否则从 HDFS 加载数据到 hive 表 （3）inpath:表示加载数据的路径
（4）overwrite:表示覆盖表中已有数据，否则表示追加
（5）into table:表示加载到哪张表
（6）student:表示具体的表
（7）partition:表示上传到指定分区
2．实操案例
（0）创建一张表
hive (default)> create table student(id string, name string) row
format delimited fields terminated by '\t';
（1）加载本地文件到 hive
hive (default)> load data local inpath
'/opt/module/datas/student.txt' into table default.student;
（2）加载 HDFS 文件到 hive 中
上传文件到 HDFS
hive (default)> dfs -put /opt/module/datas/student.txt /user/atguigu/hive;
加载 HDFS 上数据
hive (default)> load data inpath '/user/atguigu/hive/student.txt' into table default.student;
（3）加载数据覆盖表中已有的数据
上传文件到 HDFS
hive (default)> dfs -put /opt/module/datas/student.txt /user/atguigu/hive;
加载数据覆盖表中已有的数据
hive (default)> load data inpath '/user/atguigu/hive/student.txt' overwrite into table default.student;
5.1.2 通过查询语句向表中插入数据（Insert）
1．创建一张分区表
hive (default)> create table student(id int, name string) partitioned by (month string) row format delimited fields terminated by '\t';
2．基本插入数据
hive (default)> insert into table student partition(month='201709') values(1,'wangwu');
3．基本模式插入（根据单张表查询结果）
hive (default)> insert overwrite table student partition(month='201708') select id, name from student where month='201709';
4．多插入模式（根据多张表查询结果）
hive (default)> from student insert overwrite table student partition(month='201707') select id, name where month='201709' insert overwrite table student partition(month='201706') select id, name where month='201709';
5.1.3 查询语句中创建表并加载数据（As Select）
详见 4.5.1 章创建表
根据查询结果创建表（查询的结果会添加到新创建的表中）
create table if not exists student3 as select id, name from student;
5.1.4 创建表时通过 Location 指定加载数据路径
1．创建表，并指定在 hdfs 上的位置
hive (default)> create table if not exists student5(
id int, name string
)
row format delimited fields terminated by '\t'
location '/user/hive/warehouse/student5';
2．上传数据到 hdfs 上
hive (default)> dfs -put /opt/module/datas/student.txt
/user/hive/warehouse/student5;
3．查询数据
hive (default)> select * from student5;
5.1.5 Import 数据到指定 Hive 表中
注意：先用 export 导出后，再将数据导入。
hive (default)> import table student2 partition(month='201709')
from '/user/hive/warehouse/export/student';
5.2 数据导出
5.2.1 Insert 导出
1．将查询的结果导出到本地
hive (default)> insert overwrite local directory
'/opt/module/datas/export/student'
select * from student;
2．将查询的结果格式化导出到本地
hive(default)>insert overwrite local directory
'/opt/module/datas/export/student1'
ROW FORMAT DELIMITED FIELDS TERMINATED BY '\t'
select * from student;
3．将查询的结果导出到 HDFS 上(没有 local)
hive (default)> insert overwrite directory
'/user/atguigu/student2'
ROW FORMAT DELIMITED FIELDS TERMINATED BY '\t'
select * from student;
5.2.2 Hadoop 命令导出到本地
hive (default)> dfs -get
/user/hive/warehouse/student/month=201709/000000_0
/opt/module/datas/export/student3.txt;
5.2.3 Hive Shell 命令导出
基本语法：（hive -f/-e 执行语句或者脚本 > file）
[atguigu@hadoop102 hive]$ bin/hive -e 'select * from
default.student;' > /opt/module/datas/export/student4.txt;
5.2.4 Export 导出到 HDFS 上
(defahiveult)> export table default.student to '/user/hive/warehouse/export/student';
5.2.5 Sqoop 导出
后续课程专门讲。
5.3 清除表中数据（Truncate）
注意
Truncate 只能删除管理表，不能删除外部表中数据
hive (default)> truncate table student;
©️2020 CSDN 皮肤主题: 黑客帝国 设计师:上身试试 返回首页 | {
"url": "https://blog.csdn.net/weixin_45417821/article/details/109219349",
"source_domain": "blog.csdn.net",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "150937",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QCQZVFACOUQCL4WYFYLVL4ZGDEN23EUY",
"WARC-Concurrent-To": "<urn:uuid:bbc02bca-46d0-4d96-bd7c-8bec104ac4e4>",
"WARC-Date": "2020-11-24T11:30:54Z",
"WARC-IP-Address": "101.200.35.175",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7QIKFNVATDL6TMZIPQKW7QPVFZMTWHYR",
"WARC-Record-ID": "<urn:uuid:adced2f5-87a6-4b86-920c-1b39d268a931>",
"WARC-Target-URI": "https://blog.csdn.net/weixin_45417821/article/details/109219349",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f1d3c721-81c3-41b5-bb4e-60fdf35a272b>"
},
"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-240.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
23,
24,
33,
34,
54,
55,
60,
156,
187,
207,
276,
307,
330,
348,
371,
372,
379,
388,
389,
455,
499,
500,
516,
517,
557,
617,
618,
640,
651,
652,
727,
728,
740,
741,
835,
836,
853,
864,
865,
940,
941,
955,
956,
1060,
1061,
1089,
1090,
1100,
1101,
1237,
1238,
1247,
1248,
1336,
1337,
1357,
1358,
1482,
1483,
1502,
1503,
1721,
1722,
1753,
1754,
1768,
1769,
1796,
1797,
1866,
1867,
1898,
1899,
1920,
1921,
1974,
1995,
1998,
2046,
2089,
2090,
2105,
2106,
2162,
2193,
2194,
2201,
2202,
2242,
2243,
2270,
2271,
2296,
2297,
2362,
2406,
2407,
2416,
2417,
2433,
2434,
2448,
2449,
2499,
2534,
2558,
2559,
2576,
2577,
2625,
2661,
2710,
2733,
2734,
2763,
2764,
2808,
2833,
2882,
2906,
2907,
2928,
2929,
2955,
3006,
3045,
3046,
3068,
3102,
3103,
3157,
3216,
3217,
3241,
3242,
3328,
3329,
3344,
3345,
3354,
3355,
3376,
3377,
3380,
3408,
3409,
3449
],
"line_end_idx": [
23,
24,
33,
34,
54,
55,
60,
156,
187,
207,
276,
307,
330,
348,
371,
372,
379,
388,
389,
455,
499,
500,
516,
517,
557,
617,
618,
640,
651,
652,
727,
728,
740,
741,
835,
836,
853,
864,
865,
940,
941,
955,
956,
1060,
1061,
1089,
1090,
1100,
1101,
1237,
1238,
1247,
1248,
1336,
1337,
1357,
1358,
1482,
1483,
1502,
1503,
1721,
1722,
1753,
1754,
1768,
1769,
1796,
1797,
1866,
1867,
1898,
1899,
1920,
1921,
1974,
1995,
1998,
2046,
2089,
2090,
2105,
2106,
2162,
2193,
2194,
2201,
2202,
2242,
2243,
2270,
2271,
2296,
2297,
2362,
2406,
2407,
2416,
2417,
2433,
2434,
2448,
2449,
2499,
2534,
2558,
2559,
2576,
2577,
2625,
2661,
2710,
2733,
2734,
2763,
2764,
2808,
2833,
2882,
2906,
2907,
2928,
2929,
2955,
3006,
3045,
3046,
3068,
3102,
3103,
3157,
3216,
3217,
3241,
3242,
3328,
3329,
3344,
3345,
3354,
3355,
3376,
3377,
3380,
3408,
3409,
3449,
3485
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3485,
"ccnet_original_nlines": 147,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05034324899315834,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02402745932340622,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5594965815544128,
"rps_doc_frac_unique_words": 0.44262295961380005,
"rps_doc_mean_word_length": 7.368852615356445,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.0011441600508987904,
"rps_doc_unigram_entropy": 4.5830512046813965,
"rps_doc_word_count": 366,
"rps_doc_frac_chars_dupe_10grams": 0.04004449024796486,
"rps_doc_frac_chars_dupe_5grams": 0.2684464156627655,
"rps_doc_frac_chars_dupe_6grams": 0.17612162232398987,
"rps_doc_frac_chars_dupe_7grams": 0.13904337584972382,
"rps_doc_frac_chars_dupe_8grams": 0.13904337584972382,
"rps_doc_frac_chars_dupe_9grams": 0.07489802688360214,
"rps_doc_frac_chars_top_2gram": 0.07341490685939789,
"rps_doc_frac_chars_top_3gram": 0.03337040916085243,
"rps_doc_frac_chars_top_4gram": 0.04449388012290001,
"rps_doc_books_importance": -312.72265625,
"rps_doc_books_importance_length_correction": -312.72265625,
"rps_doc_openwebtext_importance": -223.86904907226562,
"rps_doc_openwebtext_importance_length_correction": -223.86904907226562,
"rps_doc_wikipedia_importance": -145.6402587890625,
"rps_doc_wikipedia_importance_length_correction": -145.6402587890625
},
"fasttext": {
"dclm": 0.25149214267730713,
"english": 0.10029000043869019,
"fineweb_edu_approx": 3.039846420288086,
"eai_general_math": 0.04110473021864891,
"eai_open_web_math": 0.007266220171004534,
"eai_web_code": 0.3275306224822998
}
} | {
"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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
8,917,447,445,604,926,000 |
PDA
View Full Version : Using a button on a joystick to track?
DemonYawgmoth
02-11-2006, 11:45 AM
We dont want to always have the camera tracking and such, is it possible to start tracking only when a button is pressed, and then stopping when the button is pressed again? What functions would we need to call to use that, and how would we get it to use a different purpose once the button is pressed a second time? I tried doing this before for another purpose but it didnt work, so if someone could help that would be pretty super. Thanks all.
Jared341
02-11-2006, 02:58 PM
try this:
// at beginning of Default_Routine)
static unsigned char p1_sw_trig_old = 0;
...
// later in your Default_Routine)
if( p1_sw_trig && !p1_sw_trig_old )
{
// Call function(s) to start tracking
}
else if( !p1_sw_trig && p1_sw_trig_old )
{
// Call function(s) to stop tracking
}
p1_sw_trig_old = p1_sw_trig;
DemonYawgmoth
02-11-2006, 10:26 PM
ok, but what are the functions that i should be using for getting the camera to start and stop tracking. (thanks for that code, ill try that out on monday)
seg9585
02-12-2006, 12:16 AM
ok, but what are the functions that i should be using for getting the camera to start and stop tracking.
Servo_Track() is the function which performs camera track and search
DemonYawgmoth
02-12-2006, 12:58 AM
So we would be calling that to start tracking, I'm assuming, from your post? And also, how would we make it stop tracking?
Alan Anderson
02-12-2006, 10:17 AM
To have the camera servos track the target, call the Servo_Track() function. To not have the camera servos track the target, don't call the function | {
"url": "http://www.chiefdelphi.com/forums/archive/index.php/t-43765.html",
"source_domain": "www.chiefdelphi.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "4995",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3XSXC7VC65RUJW5SPG57Z5UNMFAQ5MLT",
"WARC-Concurrent-To": "<urn:uuid:938e6552-130c-42ad-8599-15a3b8b4c19d>",
"WARC-Date": "2013-05-19T16:26:45Z",
"WARC-IP-Address": "173.193.53.218",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:NYQGI3ZMP6D4PWX5USE7ATKDNB4KVEKB",
"WARC-Record-ID": "<urn:uuid:12b6e738-1b03-4ce4-aefb-d8c92b50c2bf>",
"WARC-Target-URI": "http://www.chiefdelphi.com/forums/archive/index.php/t-43765.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:77e1d4be-d248-41da-a9fe-bf27432fa887>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
1,
5,
6,
65,
66,
67,
81,
102,
549,
550,
559,
580,
590,
591,
592,
628,
669,
673,
707,
743,
745,
783,
785,
826,
828,
865,
867,
896,
897,
911,
932,
1088,
1089,
1097,
1118,
1223,
1224,
1293,
1294,
1308,
1329,
1452,
1453,
1467,
1488
],
"line_end_idx": [
1,
5,
6,
65,
66,
67,
81,
102,
549,
550,
559,
580,
590,
591,
592,
628,
669,
673,
707,
743,
745,
783,
785,
826,
828,
865,
867,
896,
897,
911,
932,
1088,
1089,
1097,
1118,
1223,
1224,
1293,
1294,
1308,
1329,
1452,
1453,
1467,
1488,
1636
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1636,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0.0024449899792671204,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3869209885597229,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024523159489035606,
"rps_doc_frac_lines_end_with_ellipsis": 0.021739130839705467,
"rps_doc_frac_no_alph_words": 0.30517712235450745,
"rps_doc_frac_unique_words": 0.45075759291648865,
"rps_doc_mean_word_length": 4.666666507720947,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.0027248000260442495,
"rps_doc_unigram_entropy": 4.466526031494141,
"rps_doc_word_count": 264,
"rps_doc_frac_chars_dupe_10grams": 0.13474026322364807,
"rps_doc_frac_chars_dupe_5grams": 0.2467532455921173,
"rps_doc_frac_chars_dupe_6grams": 0.2467532455921173,
"rps_doc_frac_chars_dupe_7grams": 0.18831169605255127,
"rps_doc_frac_chars_dupe_8grams": 0.13474026322364807,
"rps_doc_frac_chars_dupe_9grams": 0.13474026322364807,
"rps_doc_frac_chars_top_2gram": 0.036525968462228775,
"rps_doc_frac_chars_top_3gram": 0.03165584057569504,
"rps_doc_frac_chars_top_4gram": 0.029220780357718468,
"rps_doc_books_importance": -132.86886596679688,
"rps_doc_books_importance_length_correction": -119.1070785522461,
"rps_doc_openwebtext_importance": -89.48963928222656,
"rps_doc_openwebtext_importance_length_correction": -89.48963928222656,
"rps_doc_wikipedia_importance": -38.05790328979492,
"rps_doc_wikipedia_importance_length_correction": -25.292404174804688
},
"fasttext": {
"dclm": 0.21188849210739136,
"english": 0.880184531211853,
"fineweb_edu_approx": 1.3003466129302979,
"eai_general_math": 0.6811755299568176,
"eai_open_web_math": 0.08949804306030273,
"eai_web_code": 0.7293650507926941
}
} | {
"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": "629.892",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
2,917,340,202,025,404,000 | Why R?
Open-source
R is open-source software, which means using it is completely free. Second, open-source software is developed collaboratively, meaning the source code is open to public inspection, modification, and improvement.
Popular
R is widely used in the physical and social sciences, as well as in government, non-profits, and the private sector.
Many developers and social scientists write programs in R. As a result, there is also a large support community available to help troubleshoot problematic code. As seen in the Redmonk programming language rankings (which compare languages’ appearances on Github [usage] and StackOverflow [support]), R appears near the top of both rankings.
Lack of point-and-click interface
R, like any computing language, relies on programmatic execution of functions. That is, to do anything you must write code. This differs from popular statistical software such as Stata or SPSS which at their core utilize a command language but overlay them with drop-down menus that enable a point-and-click interface. While much easier to operate, there are several downsides to this approach - mainly that it makes it impossible to reproduce one’s analysis.
Things R does well
• Data analysis - R was written by statisticians for statisticians, so it is designed first and foremost as a language for statistical and data analysis. Much of the cutting-edge research in machine learning occurs in R, and every week there are packages added to CRAN implementing these new methods. Furthermore, many models in R can be exported to other programming languages such as C, C++, Python, tensorflow, stan, etc.
• Data visualization - while the base R graphics package is comprehensive and powerful, additional libraries such as ggplot2 and lattice make R the go-to language for power data visualization approaches.
Things R does not do as well
• Speed - while by no means a slug, R is not written to be a fast, speedy language. Depending on the complexity of the task and the size of your data, you may find R taking a long time to execute your program.
Why are we not using Python?
Python was developed in the 1990s as a general-purpose programming language. It emphasizes simplicity over complexity in both its syntax and core functions. As a result, code written in Python is (relatively) easy to read and follow as compared to more complex languages like Perl or Java. As you can see in the above references, Python is just as, if not more, popular than R. It does many things well, like R, but is perhaps better in some aspects:
• General computation - since Python is a general computational language, it is more versatile at non-statistical tasks and is a bit more popular outside the statistics community.
• Speed - because it is a general computing language, Python is optimized to be fast (assuming you write your code optimally). As your data becomes larger or more complex, you might find Python to be faster than R for your analytical needs.
• Workflow - since Python is a general-purpose language, you can build entire applications using it. R, not so much.
That said, there are also things it does not do as well as R:
• Visualizations - visual graphics libraries in Python are increasing in number and quality (see matplotlib, pygal, and seaborn), but are still behind R in terms of comprehensiveness and ease of use. Of course, once you wish to create interactive and advanced information visualizations, you can also used more specialized software such as Tableau or D3.
• Add-on libraries - previously Python was criticized for its lack of libraries to perform statistical analysis and data manipulation, especially relative to the plethora of libraries for R. In recent years Python has begun to catch up with libraries for scientific computing (numpy), data analysis (pandas), and machine learning (scikit-learn). However I personally have found immense difficulty installing and managing packages in Python, even with the use of a package manager such as conda.
At the end of the day, I don’t think it is a debate between learning R vs. Python. Frankly to be a desirable (and therefore highly-compensated) data scientist you should learn both languages. R and Python complement each other, and even R/Python luminaries such as Hadley Wickham and Wes McKinney promote the benefits of both languages:
This course could be taught exclusively in Python (as it was in previous incarnations) or a combination of R and Python (as it was in fall 2016). From my past experience, I think the best introduction to computer programming focuses on a single language. Learning two languages simultaneously is extremely difficult. It is better to stick with a single language and syntax. My language of preference is R, so that is what I teach here. Once you complete this course, you will have the basic skills necessary to learn Python on your own.
Acknowledgements | {
"url": "https://cfss.uchicago.edu/setup/what-is-r/",
"source_domain": "cfss.uchicago.edu",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "24484",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NL4GGUYL4USFJ7NUT2QWATN7OCAKLL5J",
"WARC-Concurrent-To": "<urn:uuid:78ebf176-d01d-4b44-abe4-fbb82691d749>",
"WARC-Date": "2021-09-22T01:51:41Z",
"WARC-IP-Address": "68.183.27.198",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JMBKI6OG2FM6FF3AJHQAAWUTSWUQFTGG",
"WARC-Record-ID": "<urn:uuid:dc7e7253-3a0d-4e04-b174-5ce97e746500>",
"WARC-Target-URI": "https://cfss.uchicago.edu/setup/what-is-r/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e081f189-d0ef-41b1-ae0b-a11808246ae5>"
},
"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-93\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,
7,
8,
20,
21,
233,
234,
242,
243,
360,
361,
702,
703,
737,
738,
1198,
1199,
1218,
1219,
1646,
1852,
1853,
1882,
1883,
2095,
2096,
2125,
2126,
2577,
2578,
2760,
3003,
3122,
3123,
3185,
3186,
3543,
4040,
4041,
4378,
4379,
4916,
4917
],
"line_end_idx": [
7,
8,
20,
21,
233,
234,
242,
243,
360,
361,
702,
703,
737,
738,
1198,
1199,
1218,
1219,
1646,
1852,
1853,
1882,
1883,
2095,
2096,
2125,
2126,
2577,
2578,
2760,
3003,
3122,
3123,
3185,
3186,
3543,
4040,
4041,
4378,
4379,
4916,
4917,
4933
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4933,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41207075119018555,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03746097907423973,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1571279913187027,
"rps_doc_frac_unique_words": 0.4418022632598877,
"rps_doc_mean_word_length": 4.933667182922363,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.255687236785889,
"rps_doc_word_count": 799,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.015220699831843376,
"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.006088280119001865,
"rps_doc_frac_chars_top_3gram": 0.00405884999781847,
"rps_doc_frac_chars_top_4gram": 0.005580919794738293,
"rps_doc_books_importance": -324.41790771484375,
"rps_doc_books_importance_length_correction": -324.41790771484375,
"rps_doc_openwebtext_importance": -192.02532958984375,
"rps_doc_openwebtext_importance_length_correction": -192.02532958984375,
"rps_doc_wikipedia_importance": -173.1133575439453,
"rps_doc_wikipedia_importance_length_correction": -173.1133575439453
},
"fasttext": {
"dclm": 0.71201491355896,
"english": 0.9577147960662842,
"fineweb_edu_approx": 2.915696382522583,
"eai_general_math": 0.971215546131134,
"eai_open_web_math": 0.3454310894012451,
"eai_web_code": 0.910700798034668
}
} | {
"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": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"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": "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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
2,451,942,319,574,614,500 | Science Quiz / Make a Fraction from a Rational Decimal
Random Science or Math Quiz
QUIZ: Can you name the answers to these math questions and learn how to make a fraction from any rational decimal?
Quiz not verified by Sporcle
How to PlayForced Order No Skip
Challenge
Share
Tweet
Embed
Score 0/39 Timer 10:00
Super Easy?
[You have 0.7]
Which place is the 7 in?
So write seven of those as a fraction.
You did it!
Now type 'next.'
[You have 0.72]
Which place is the 2 in?
So write seventy two of those as a fraction.
Now reduce.
You did it!
Now type 'next.'
Easy?
[You have 0.444...]
Which place is the first 4 in?
Subtract a oneths from that place. What do you get?
So write four of those as a fraction.
You did it!
Now type 'next.'
[You have 0.666...]
Which place is the first 6 in?
Subtract a oneths from that place. What do you get?
So write six of those as a fraction.
Now reduce.
You did it!
Now type 'next.'
Medium?
[You have 0.171717...]
Which place is the first 7 in?
Subtract a oneths from that place. What do you get?
So write seventeen of those as a fraction.
You did it!
Now type 'next.'
[You have 0.603603...]
Which place is the first 3 in?
Subtract a oneths from that place. What do you get?
So write six hundred three of those as a fraction.
Now reduce.
You did it!
Now type 'next.'
Hard?
[You have 0.3414141...]
Which place is the first 1 in?
What place is the non-repeating digit in?
What is your first answer minus your second answer?
So write forty-one of those as a fraction.
(...but wait, what place was the non-repeating digit in again?)
So write three of those as a fraction.
(...and now we have to add those two fractions together, so what is their lowest common mulitple?)
By how many times do you have to mulitply 10 to get that?
So what is three times that number?
So what is that number plus forty-one?
So put that number over the answer to the 3rd question.
Now reduce.
You did it!
Now type
'challenge me, already!'
Super Hard!?
[You have 5.73249249249...]
Write this as a fraction.
You're not logged in!
Compare scores with friends on all Sporcle quizzes.
Sign Up with Email
OR
Log In
You Might Also Like...
Show Comments
Extras
Top Quizzes Today
Score Distribution
Your Account Isn't Verified!
In order to create a playlist on Sporcle, you need to verify the email address you used during registration. Go to your Sporcle Settings to finish the process. | {
"url": "https://www.sporcle.com/games/mrhubbell/Fraction2RationalDecimal",
"source_domain": "www.sporcle.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "108441",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZKEP6VYIZPMIH2ZJXFVC644XBWUENES3",
"WARC-Concurrent-To": "<urn:uuid:9f4a1106-a6b0-4f0e-bd58-f04fa3b7fee5>",
"WARC-Date": "2018-02-21T18:13:15Z",
"WARC-IP-Address": "192.33.31.88",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:E3LUBUWOW7P5NM7DWIG5EUKZEE4F4WHM",
"WARC-Record-ID": "<urn:uuid:aad3e66e-c0d8-46b0-814c-7e495bda569d>",
"WARC-Target-URI": "https://www.sporcle.com/games/mrhubbell/Fraction2RationalDecimal",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:add4af55-87f9-43d3-b245-8bb8a93c24e4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-7-146.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,
55,
56,
84,
85,
200,
201,
230,
231,
263,
273,
279,
285,
291,
314,
326,
341,
366,
368,
408,
420,
437,
439,
455,
480,
482,
528,
541,
553,
570,
572,
578,
598,
629,
631,
684,
723,
735,
752,
754,
774,
805,
807,
860,
898,
911,
923,
940,
942,
950,
973,
1004,
1006,
1059,
1103,
1115,
1132,
1134,
1157,
1188,
1190,
1243,
1295,
1308,
1320,
1337,
1339,
1345,
1369,
1400,
1402,
1445,
1498,
1542,
1607,
1647,
1747,
1806,
1843,
1883,
1940,
1953,
1965,
1974,
1999,
2001,
2014,
2042,
2068,
2070,
2071,
2093,
2094,
2146,
2165,
2168,
2175,
2176,
2199,
2200,
2214,
2215,
2222,
2223,
2241,
2242,
2243,
2262,
2263,
2292,
2293
],
"line_end_idx": [
55,
56,
84,
85,
200,
201,
230,
231,
263,
273,
279,
285,
291,
314,
326,
341,
366,
368,
408,
420,
437,
439,
455,
480,
482,
528,
541,
553,
570,
572,
578,
598,
629,
631,
684,
723,
735,
752,
754,
774,
805,
807,
860,
898,
911,
923,
940,
942,
950,
973,
1004,
1006,
1059,
1103,
1115,
1132,
1134,
1157,
1188,
1190,
1243,
1295,
1308,
1320,
1337,
1339,
1345,
1369,
1400,
1402,
1445,
1498,
1542,
1607,
1647,
1747,
1806,
1843,
1883,
1940,
1953,
1965,
1974,
1999,
2001,
2014,
2042,
2068,
2070,
2071,
2093,
2094,
2146,
2165,
2168,
2175,
2176,
2199,
2200,
2214,
2215,
2222,
2223,
2241,
2242,
2243,
2262,
2263,
2292,
2293,
2452
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2452,
"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.37876105308532715,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0035398199688643217,
"rps_doc_frac_lines_end_with_ellipsis": 0.009009010158479214,
"rps_doc_frac_no_alph_words": 0.2424778789281845,
"rps_doc_frac_unique_words": 0.3545454442501068,
"rps_doc_mean_word_length": 4.08863639831543,
"rps_doc_num_sentences": 76,
"rps_doc_symbol_to_word_ratio": 0.015929199755191803,
"rps_doc_unigram_entropy": 4.51377010345459,
"rps_doc_word_count": 440,
"rps_doc_frac_chars_dupe_10grams": 0.26236799359321594,
"rps_doc_frac_chars_dupe_5grams": 0.35686492919921875,
"rps_doc_frac_chars_dupe_6grams": 0.29127293825149536,
"rps_doc_frac_chars_dupe_7grams": 0.27570873498916626,
"rps_doc_frac_chars_dupe_8grams": 0.26236799359321594,
"rps_doc_frac_chars_dupe_9grams": 0.26236799359321594,
"rps_doc_frac_chars_top_2gram": 0.055030569434165955,
"rps_doc_frac_chars_top_3gram": 0.055030569434165955,
"rps_doc_frac_chars_top_4gram": 0.04446915164589882,
"rps_doc_books_importance": -245.7924346923828,
"rps_doc_books_importance_length_correction": -245.7924346923828,
"rps_doc_openwebtext_importance": -148.09945678710938,
"rps_doc_openwebtext_importance_length_correction": -148.09945678710938,
"rps_doc_wikipedia_importance": -132.78298950195312,
"rps_doc_wikipedia_importance_length_correction": -132.78298950195312
},
"fasttext": {
"dclm": 0.7379962205886841,
"english": 0.9161462187767029,
"fineweb_edu_approx": 2.835251569747925,
"eai_general_math": 0.05289798974990845,
"eai_open_web_math": 0.3103615641593933,
"eai_web_code": 0.000004890000127488747
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "513.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
7,115,152,495,704,513,000 | Sort: Rank
Defining Functions in Python
Where to find tutorials in Defining Functions in Python? Here is a list of tutorials to answer many frequently asked questions compiled by FYIcenter.com team on Defining Functions in Python: What Is Function 'def' - Function Definition Statements 'return' Statement in Function Statement Block Functi...
2017-09-12, 141👍, 0💬
'pass' - Do Nothing Statements
How to use the "pass" statement in Python code? The "pass" statement can be used as a place holder statement any where in Python code. When a "pass" statement is interpreted, Python will do nothing and continue with next statement. For example, the following Python code shows an empty function with ...
2017-09-12, 138👍, 0💬
What Is Function
What Is Function in Python? A function, also called a method, in Python is a statement block waiting to be executed later with a function call expression. A function can have the following elements: Function name - A symbolic name that uniquely identifies this function within the context. Parameter ...
2017-09-12, 133👍, 0💬
'continue' Statement in Repeating Statement Blocks
How to use the "continue" statement in a repeating statement block in Python code? The "continue" statement can be used in a repeating statement block like "for" and "while" loops to continue with the next looping item immediately. When a "continue" statement is interpreted, Python will skip the res...
2017-09-12, 132👍, 0💬
Python Tutorials
Where to find tutorials on Python programming language? I want to learn Python. Here is a large collection of tutorials to answer many frequently asked questions compiled by FYIcenter.com team about Python programming language: Introduction of Python What Is Python Download Latest Version of Python ...
2017-09-08, 159👍, 0💬
Sort: Rank | {
"url": "http://dev.fyicenter.com/index.php?K=4",
"source_domain": "dev.fyicenter.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "12492",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:E7OYD7QEQNG6SURQIVYJKAZYD42R5MWM",
"WARC-Concurrent-To": "<urn:uuid:31012e60-0ff0-4509-b60b-1a49b1632a8f>",
"WARC-Date": "2017-09-21T03:04:00Z",
"WARC-IP-Address": "216.250.120.52",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IHBWCKKCC5S2BF4MAURBBYEOI4HZIQ2V",
"WARC-Record-ID": "<urn:uuid:930b6617-3d59-4424-b84f-6867a54797c5>",
"WARC-Target-URI": "http://dev.fyicenter.com/index.php?K=4",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d6dc4c2-abe7-4ced-9b5e-2bf08671f3ab>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-237-176-178.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,
13,
14,
43,
347,
368,
369,
400,
704,
725,
726,
743,
1047,
1068,
1069,
1120,
1424,
1445,
1446,
1463,
1767,
1788,
1789
],
"line_end_idx": [
13,
14,
43,
347,
368,
369,
400,
704,
725,
726,
743,
1047,
1068,
1069,
1120,
1424,
1445,
1446,
1463,
1767,
1788,
1789,
1801
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1801,
"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.2670299708843231,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010899179615080357,
"rps_doc_frac_lines_end_with_ellipsis": 0.21739129722118378,
"rps_doc_frac_no_alph_words": 0.2861035466194153,
"rps_doc_frac_unique_words": 0.4000000059604645,
"rps_doc_mean_word_length": 5.185454368591309,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.01362397987395525,
"rps_doc_unigram_entropy": 4.263814449310303,
"rps_doc_word_count": 275,
"rps_doc_frac_chars_dupe_10grams": 0.1023842915892601,
"rps_doc_frac_chars_dupe_5grams": 0.18373072147369385,
"rps_doc_frac_chars_dupe_6grams": 0.1023842915892601,
"rps_doc_frac_chars_dupe_7grams": 0.1023842915892601,
"rps_doc_frac_chars_dupe_8grams": 0.1023842915892601,
"rps_doc_frac_chars_dupe_9grams": 0.1023842915892601,
"rps_doc_frac_chars_top_2gram": 0.044880788773298264,
"rps_doc_frac_chars_top_3gram": 0.03997195139527321,
"rps_doc_frac_chars_top_4gram": 0.05259466916322708,
"rps_doc_books_importance": -177.89535522460938,
"rps_doc_books_importance_length_correction": -173.37844848632812,
"rps_doc_openwebtext_importance": -95.71845245361328,
"rps_doc_openwebtext_importance_length_correction": -95.71845245361328,
"rps_doc_wikipedia_importance": -136.09803771972656,
"rps_doc_wikipedia_importance_length_correction": -135.84483337402344
},
"fasttext": {
"dclm": 0.9840564131736755,
"english": 0.8206067085266113,
"fineweb_edu_approx": 3.1034626960754395,
"eai_general_math": 0.8993210792541504,
"eai_open_web_math": 0.05007123947143555,
"eai_web_code": 0.9688290953636169
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "1",
"label": "Truncated Snippets"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
5,370,103,057,558,138,000 | dcsimg
www.webdeveloper.com
Search:
Type: Posts; User: Nerdygeek
Page 1 of 4 1 2 3 4
Search: Search took 0.01 seconds.
1. Replies
7
Views
10,241
Best easy website design software?
Hey guys. So if you were to start again, or you were to advise a friend on the easiest website builders what would you advise? Personally I think that Wordpress could be a good option yet it isn't...
2. Outgoing link script with iframe not working?
I made an outgoing link script that will open the link in an iframe but unfortunately it doesn't work. I know it will work but obviosuly something is wrong.
It works by prepending LinkToSite.com...
3. Problem Select wordpress posts with given text string and add a custom field to them?
Hey guys.. I made this SQL query which selects post Ids by all posts containing a keyword then attempts to add a custom field but I get a syntax error.
Bit lost so all help appreciated thanks.
...
4. That's just credits for scraping their content,...
That's just credits for scraping their content, it's the site I want to replicate, a site that scrapes RSS feeds and reposts them.
5. Anyone?
Anyone?
6. What type of script do i need to build a site like this?
AnswerDigger.com has caught my eye as a great aggregator script.
What I wonder is what kind of scripts are readily available to create a site like answerdigger.com
It seems to be republishing...
7. jQuery Load an aff url in the background to set the cookie it sets?
Hey I have the following line of code, which I want it to load a url in the background based on any link with a particular CSS class.
I have tested it so far and it doesn't load the url in the...
8. Replies
3
Views
1,189
Oh thanks, but it seems that all the text has to...
Oh thanks, but it seems that all the text has to be inline if I want to use a lightbox, is there an alternative method where all the content (text,subscription forms etc) are loaded from an external...
9. Replies
3
Views
1,189
How is this done?
I'm wondering how this is done:
http://www.pcmech.com/
Where it says "Join 28000 subscribers" on top right in black text with yeelo background.
When you click it you get a nice popout, that...
10. Replies
5
Views
2,618
Any more ideas guys and gals?
Any more ideas guys and gals?
11. But the HTML will still have to load? I don't...
But the HTML will still have to load?
I don't want the html to load if the screen size is less.
12. Replies
5
Views
2,618
I tried without the hard return and it still...
I tried without the hard return and it still doesn't work..
There will be more of the data changing than just the horizontal part. Most of the code will change.
Any other ideas guys and thanks...
13. Replies
5
Views
2,618
I tried your suggestion but it still doesn't...
I tried your suggestion but it still doesn't work.
Yes I'm calling the function.
Thanks.
It seems to break after this line according to the syntax highlighting in notepad++ even with...
14. This code is good. var topImages = new...
This code is good.
var topImages = new Array()
//Random-loading images
topImages[0] = 'http://www.domain.com/img1.png' // replace with names of images
topImages[1] =...
15. Replies
5
Views
2,618
What's wrong with this Javascript?
I made this but it doesn't work properly. I'm a noob too so have next to no idea what is keeping it from working...
Thanks in advance
function shareStuff() {
if ($(window).width() < 1024)...
16. Oh.. Yours seems very difficult and has too...
Oh..
Yours seems very difficult and has too much exta stuff for it to be of use to me as I don't want to use the display block etc. I was given this piece of code that almost works but for some...
17. That's not what I wish to do. I wish to...
That's not what I wish to do.
I wish to display completely different content if it is a different window width...
Thanks though.
18. Change this html content if screen res/window size less than 1280?
I have this code that displays all vertical buttons for sharing my content however I want to display horizontal buttons if the user is using a smaller window size. It will have a different div and...
19. Replies
3
Views
4,906
Make Child Div 100% Height of Parent Div?
I have two divs
<div id="article">
<div style="float:right;width:90px;">
Some share buttons
</div>
Article content
</div>
I want the div that has the share buttons to always stretch the...
20. Looks better now with the quote text removed. ...
Looks better now with the quote text removed.
I like your contact form too. What jquery plugin or ajax script is that made with?
Thanks
21. Replies
4
Views
2,533
I wasn't even talking about the site being broken...
I wasn't even talking about the site being broken in my browser. I was talking about how the person has no idea what a salesletter should really look like. It's also not even a salesletter just a...
22. Replies
4
Views
2,533
This salesletter is way off and it's only a...
This salesletter is way off and it's only a squeeze page too.
http://10kvisitors.com/free/ << that's what a squeeze page should look like.
23. Personally i refrain from the Get a Quote...
Personally i refrain from the Get a Quote buttons.
I would more so aim to presell.
So change the button to..
See how we can help you. Then presell to a contact form.
24. My Second Ever Design in PS, Please Comment on It.
This is my second ever design in Photoshop which is some of the way there.
The basics concept can be seen really. I'm turning it into a WP theme too and it will be for my web design company...
25. Replies
4
Views
2,623
How much is this website worth?
I've been looking at buying this website as I found it listed for sale on a bidding site.
http://isayyoulike.com
I'm wondering how much it's worth.
I don't want to be ripped off is why I...
Results 1 to 25 of 100
Page 1 of 4 1 2 3 4
HTML5 Development Center
Recent Articles | {
"url": "http://www.webdeveloper.com/forum/search.php?s=baca5ae0b40af1f6be04c5ec6bff346b&searchid=11055369",
"source_domain": "www.webdeveloper.com",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "73044",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BYFKBI53EOJLWF7XUSRKMJRACVE24GUG",
"WARC-Concurrent-To": "<urn:uuid:26e10575-d6aa-4f3a-895a-615636eaff26>",
"WARC-Date": "2015-10-13T14:06:50Z",
"WARC-IP-Address": "70.42.23.121",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:A6BXA26YQ3VBON2MYMA45RQ6PN437YKG",
"WARC-Record-ID": "<urn:uuid:3e6f013a-2ca0-4074-abcd-47752bac5692>",
"WARC-Target-URI": "http://www.webdeveloper.com/forum/search.php?s=baca5ae0b40af1f6be04c5ec6bff346b&searchid=11055369",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3543451c-feae-4aae-b0ed-6c12522df568>"
},
"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,
7,
28,
29,
37,
38,
67,
68,
88,
89,
123,
124,
137,
143,
153,
164,
165,
204,
205,
409,
460,
461,
622,
623,
668,
759,
760,
916,
917,
962,
970,
1026,
1027,
1162,
1175,
1176,
1188,
1250,
1251,
1320,
1321,
1424,
1425,
1460,
1533,
1534,
1672,
1673,
1739,
1752,
1758,
1768,
1778,
1779,
1835,
1836,
2042,
2055,
2061,
2071,
2081,
2082,
2104,
2105,
2141,
2142,
2169,
2170,
2263,
2264,
2317,
2331,
2337,
2347,
2357,
2358,
2392,
2393,
2427,
2482,
2483,
2525,
2526,
2588,
2602,
2608,
2618,
2628,
2629,
2681,
2682,
2746,
2747,
2852,
2853,
2892,
2906,
2912,
2922,
2932,
2933,
2985,
2986,
3041,
3042,
3076,
3077,
3089,
3090,
3191,
3239,
3240,
3263,
3264,
3265,
3297,
3298,
3326,
3410,
3432,
3446,
3452,
3462,
3472,
3473,
3512,
3513,
3633,
3634,
3656,
3657,
3658,
3686,
3687,
3724,
3777,
3778,
3787,
3788,
3984,
4033,
4034,
4068,
4069,
4157,
4158,
4177,
4250,
4251,
4455,
4469,
4475,
4485,
4495,
4496,
4542,
4543,
4563,
4564,
4587,
4629,
4652,
4663,
4683,
4694,
4695,
4766,
4822,
4823,
4873,
4874,
4961,
4962,
4973,
4987,
4993,
5003,
5013,
5014,
5071,
5072,
5275,
5289,
5295,
5305,
5315,
5316,
5367,
5368,
5434,
5435,
5516,
5567,
5568,
5623,
5624,
5660,
5661,
5691,
5692,
5753,
5810,
5811,
5890,
5891,
6013,
6027,
6033,
6043,
6053,
6054,
6090,
6091,
6185,
6186,
6213,
6214,
6253,
6254,
6300,
6323,
6343,
6368,
6369,
6370,
6371
],
"line_end_idx": [
7,
28,
29,
37,
38,
67,
68,
88,
89,
123,
124,
137,
143,
153,
164,
165,
204,
205,
409,
460,
461,
622,
623,
668,
759,
760,
916,
917,
962,
970,
1026,
1027,
1162,
1175,
1176,
1188,
1250,
1251,
1320,
1321,
1424,
1425,
1460,
1533,
1534,
1672,
1673,
1739,
1752,
1758,
1768,
1778,
1779,
1835,
1836,
2042,
2055,
2061,
2071,
2081,
2082,
2104,
2105,
2141,
2142,
2169,
2170,
2263,
2264,
2317,
2331,
2337,
2347,
2357,
2358,
2392,
2393,
2427,
2482,
2483,
2525,
2526,
2588,
2602,
2608,
2618,
2628,
2629,
2681,
2682,
2746,
2747,
2852,
2853,
2892,
2906,
2912,
2922,
2932,
2933,
2985,
2986,
3041,
3042,
3076,
3077,
3089,
3090,
3191,
3239,
3240,
3263,
3264,
3265,
3297,
3298,
3326,
3410,
3432,
3446,
3452,
3462,
3472,
3473,
3512,
3513,
3633,
3634,
3656,
3657,
3658,
3686,
3687,
3724,
3777,
3778,
3787,
3788,
3984,
4033,
4034,
4068,
4069,
4157,
4158,
4177,
4250,
4251,
4455,
4469,
4475,
4485,
4495,
4496,
4542,
4543,
4563,
4564,
4587,
4629,
4652,
4663,
4683,
4694,
4695,
4766,
4822,
4823,
4873,
4874,
4961,
4962,
4973,
4987,
4993,
5003,
5013,
5014,
5071,
5072,
5275,
5289,
5295,
5305,
5315,
5316,
5367,
5368,
5434,
5435,
5516,
5567,
5568,
5623,
5624,
5660,
5661,
5691,
5692,
5753,
5810,
5811,
5890,
5891,
6013,
6027,
6033,
6043,
6053,
6054,
6090,
6091,
6185,
6186,
6213,
6214,
6253,
6254,
6300,
6323,
6343,
6368,
6369,
6370,
6371,
6386
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6386,
"ccnet_original_nlines": 225,
"rps_doc_curly_bracket": 0.00015659000200685114,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3973607122898102,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03665689006447792,
"rps_doc_frac_lines_end_with_ellipsis": 0.13716813921928406,
"rps_doc_frac_no_alph_words": 0.2331378310918808,
"rps_doc_frac_unique_words": 0.36742424964904785,
"rps_doc_mean_word_length": 4.18087100982666,
"rps_doc_num_sentences": 132,
"rps_doc_symbol_to_word_ratio": 0.022727269679307938,
"rps_doc_unigram_entropy": 5.397250175476074,
"rps_doc_word_count": 1056,
"rps_doc_frac_chars_dupe_10grams": 0.04484710842370987,
"rps_doc_frac_chars_dupe_5grams": 0.2219705432653427,
"rps_doc_frac_chars_dupe_6grams": 0.21291053295135498,
"rps_doc_frac_chars_dupe_7grams": 0.19479049742221832,
"rps_doc_frac_chars_dupe_8grams": 0.1639864146709442,
"rps_doc_frac_chars_dupe_9grams": 0.09467723965644836,
"rps_doc_frac_chars_top_2gram": 0.005662510171532631,
"rps_doc_frac_chars_top_3gram": 0.01177802961319685,
"rps_doc_frac_chars_top_4gram": 0.01540204044431448,
"rps_doc_books_importance": -540.8157348632812,
"rps_doc_books_importance_length_correction": -540.8157348632812,
"rps_doc_openwebtext_importance": -354.30804443359375,
"rps_doc_openwebtext_importance_length_correction": -354.30804443359375,
"rps_doc_wikipedia_importance": -246.72479248046875,
"rps_doc_wikipedia_importance_length_correction": -246.72479248046875
},
"fasttext": {
"dclm": 0.10790306329727173,
"english": 0.9440275430679321,
"fineweb_edu_approx": 0.9444974660873413,
"eai_general_math": 0.1247517466545105,
"eai_open_web_math": 0.10789912939071655,
"eai_web_code": 0.03168309107422829
}
} | {
"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": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
776,387,541,831,164,000 | Installlion's Logo
Installlion.com
How To Uninstall mate-desktop-dbg On Linux Mint 17.3
To uninstall mate-desktop-dbg just follow these instructions.
Uninstall just mate-desktop-dbg
Library with common API for various MATE modules (debugging symbols) mate-about program, as well as some desktop-wide documents.Linux Mint 17.3debug1.12.0.1-1+rosa
sudo apt-get remove mate-desktop-dbg
This will remove just the mate-desktop-dbg package itself.
Uninstall mate-desktop-dbg and its dependencies
sudo apt-get remove --auto-remove mate-desktop-dbg
This will remove the mate-desktop-dbg package and any other dependant packages which are no longer needed.
Purging your config/data too
If you also want to delete your local/config files for mate-desktop-dbg then this will work.
Caution! Purged config/data can not be restored by reinstalling the package.
sudo apt-get purge mate-desktop-dbg
Or similarly, like this mate-desktop-dbg
sudo apt-get purge --auto-remove mate-desktop-dbg
Package Data
Packagemate-desktop-dbg
Version1.12.0.1-1+rosa
MaintainerMATE Packaging Team <[email protected]>
Home pagehttp://www.mate-desktop.org/
DescriptionLibrary with common API for various MATE modules (debugging symbols) mate-about program, as well as some desktop-wide documents.
Distrolinuxmint
Releaserosa
Repoimport
Sectiondebug
Dependencies | {
"url": "https://installlion.com/linuxmint/rosa/import/m/mate-desktop-dbg/uninstall/index.html",
"source_domain": "installlion.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "23596",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UKZDDQQCM2NYLF2JITOMNZGROJZ5E6QH",
"WARC-Concurrent-To": "<urn:uuid:445663e3-cf05-48f3-84a4-3381baa5a87c>",
"WARC-Date": "2020-04-02T21:26:19Z",
"WARC-IP-Address": "104.18.47.147",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AYSCYOMAQS3GLIXUQ3JIXP56F5UYKZQD",
"WARC-Record-ID": "<urn:uuid:7610817e-4719-4709-8c9a-7f6ae8fe13a1>",
"WARC-Target-URI": "https://installlion.com/linuxmint/rosa/import/m/mate-desktop-dbg/uninstall/index.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:36fe4662-ecf3-46c4-9770-20ccf70a1c60>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-236.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
25,
26,
42,
43,
96,
97,
159,
160,
192,
193,
357,
394,
395,
454,
455,
503,
504,
555,
556,
663,
664,
693,
694,
787,
788,
866,
902,
903,
944,
945,
995,
996,
1009,
1010,
1034,
1057,
1107,
1145,
1285,
1301,
1313,
1324,
1337,
1338
],
"line_end_idx": [
25,
26,
42,
43,
96,
97,
159,
160,
192,
193,
357,
394,
395,
454,
455,
503,
504,
555,
556,
663,
664,
693,
694,
787,
788,
866,
902,
903,
944,
945,
995,
996,
1009,
1010,
1034,
1057,
1107,
1145,
1285,
1301,
1313,
1324,
1337,
1338,
1350
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1350,
"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.1952054798603058,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013698630034923553,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.301369845867157,
"rps_doc_frac_unique_words": 0.6050955653190613,
"rps_doc_mean_word_length": 6.923566818237305,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.337518692016602,
"rps_doc_word_count": 157,
"rps_doc_frac_chars_dupe_10grams": 0.1637534499168396,
"rps_doc_frac_chars_dupe_5grams": 0.1637534499168396,
"rps_doc_frac_chars_dupe_6grams": 0.1637534499168396,
"rps_doc_frac_chars_dupe_7grams": 0.1637534499168396,
"rps_doc_frac_chars_dupe_8grams": 0.1637534499168396,
"rps_doc_frac_chars_dupe_9grams": 0.1637534499168396,
"rps_doc_frac_chars_top_2gram": 0.03679852932691574,
"rps_doc_frac_chars_top_3gram": 0.04599815979599953,
"rps_doc_frac_chars_top_4gram": 0.029438819736242294,
"rps_doc_books_importance": -134.13214111328125,
"rps_doc_books_importance_length_correction": -134.1321258544922,
"rps_doc_openwebtext_importance": -90.43885803222656,
"rps_doc_openwebtext_importance_length_correction": -90.43885803222656,
"rps_doc_wikipedia_importance": -55.852821350097656,
"rps_doc_wikipedia_importance_length_correction": -55.82297134399414
},
"fasttext": {
"dclm": 0.022208329290151596,
"english": 0.6186974048614502,
"fineweb_edu_approx": 1.6560052633285522,
"eai_general_math": 0.004191940184682608,
"eai_open_web_math": 0.012763559818267822,
"eai_web_code": 0.06441401690244675
}
} | {
"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.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,146,885,661,800,198,000 | 23.9 C
New York
Wednesday, June 12, 2024
The Modern Web Applications
Web application improvement is an interaction that includes the making of an application for the web by a designer. With these devices, individuals can make sites that proposition traffic and clients assisting their organization with developing dramatically without putting resources into either difficult work or exorbitant programming.
What is a Web App?
Web applications are site pages that spat a program. They let you access information and administrations from any place, on any gadget. That is the reason they’re so well known: They make it simple to finish work from any place.
Web applications improvement administrations are an incredible method for getting everything rolling to get created. You don’t have to get familiar with an entirely different language or system. You can utilize similar instruments you use for your site, similar to HTML, CSS, and JavaScript. What’s more, since they run in a program, you can test them right on your PC.
Regardless of whether you need to assemble your own web application, you can utilize one that another person has constructed. There are loads of free and paid choices out there. Furthermore, since they run in a program, you could utilize them on your telephone or tablet!
What makes a decent web application?
With regards to web applications, there are a couple of key factors that make them effective. These incorporate simple access from any gadget, quick stacking times, and a natural UI. Likewise, these applications ought to be adaptable and ready to deal with high traffic volumes. At last, they ought to be reasonable and simple to keep up with.
How would you track down an engineer?
Finding an engineer can be an overwhelming undertaking. With so many choices accessible, how might you know who to trust? Here are a few ways to track down the right engineer for your undertaking:
1. Do all necessary investigation. While doing improvement, do your exploration first. Look online for surveys or appraisals of engineers in unambiguous subject matters. Look at indexes and sites that rundown designers by city or country. You can likewise ask companions or partners for suggestions.
2. Make a few inquiries. One more method for finding a decent engineer is to make an inquiry or two. Converse with other entrepreneurs or experts in your industry who might have involved a particular engineer before and made progress with them. Or on the other hand, connect with engineers affiliations or career expos to check whether they have any suggestions.
3. Enlist through references. At long last, in the event that you feel awkward alluding somebody straightforwardly, enlist them through a reference administration like Upwork or Freelancer. These stages permit you to post a proposition and get offers from qualified designers. Whenever you’ve picked a competitor, it’s not difficult to reach them and set up a gathering to examine your undertaking subtleties!
The advancement of the Web App Developers after some time
Web applications have progressed significantly since they were first presented during the 1990s. In this article, we will investigate the historical backdrop of web applications and how they have advanced over the long run.
The main web applications were straightforward independent sites that could be gotten to and created through a program. These sites were controlled by hypertext markup language (HTML) and utilized straightforward client-side prearranging to cooperate with the client.
In the mid 2000s, web designers started to foster more modern web applications that pre-owned AJAX advancements to carry intuitiveness and liveliness to their pages. These early web applications depended on server-side prearranging to perform undertakings like sending solicitations to a data set or recovering information from an outer source.
As AJAX innovations turned out to be more famous, designers started to construct half breed web applications that utilized both server-side and client-side contents. This permitted them to make rich and intuitive sites without depending on a committed server.
Today, web applications are considerably more modern and created than they were a long time back. Because of advances in JavaScript and HTML5, current web applications are fit for showing enlivened illustrations, answering client input progressively, and collaborating with outer information sources.
Greatest web applications on the planet
The ascent of present day web applications has made it feasible for organizations and people to make complex internet based instruments and administrations that permit them to effortlessly go about their responsibilities more. Here are the five greatest present day web applications on the planet.
Author Bio:
This is Aryan, I am a professional SEO Expert & Write for us technology blog and submit a guest post on different platforms- Technoohub provides a good opportunity for content writers to submit guest posts on our website. We frequently highlight and tend to showcase guests.
Ahsan
Ahsanhttps://spiderofficials.com/
Elevate your online presence with Sp5der Officials Explore our curated selection and weave your unique web of style today! Buy Now In US
Related Articles
Stay Connected
0FansLike
3,912FollowersFollow
0SubscribersSubscribe
Latest Articles | {
"url": "https://techfily.com/the-modern-web-applications/",
"source_domain": "techfily.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "350153",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MGTISDPRJ6FH3VUP3TOBGUMPXKZ2RR43",
"WARC-Concurrent-To": "<urn:uuid:f671de95-97b7-4c13-ab28-216f8480816d>",
"WARC-Date": "2024-06-12T22:45:08Z",
"WARC-IP-Address": "69.162.109.146",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KIVXJXODMJTIH5XNQIKPIGUXNYBTA53D",
"WARC-Record-ID": "<urn:uuid:b020d0ad-b0a7-42d1-b1c0-000ae56e58a0>",
"WARC-Target-URI": "https://techfily.com/the-modern-web-applications/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4f30444f-dfeb-474d-a15b-7fc851c5a828>"
},
"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-246\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
16,
41,
42,
70,
71,
409,
410,
429,
430,
659,
660,
1030,
1031,
1303,
1304,
1341,
1342,
1686,
1687,
1725,
1726,
1923,
1924,
2226,
2591,
3003,
3004,
3062,
3063,
3287,
3288,
3556,
3557,
3902,
3903,
4163,
4164,
4465,
4466,
4506,
4507,
4805,
4806,
4818,
4819,
5094,
5095,
5101,
5135,
5272,
5273,
5290,
5291,
5306,
5307,
5317,
5338,
5360,
5361
],
"line_end_idx": [
7,
16,
41,
42,
70,
71,
409,
410,
429,
430,
659,
660,
1030,
1031,
1303,
1304,
1341,
1342,
1686,
1687,
1725,
1726,
1923,
1924,
2226,
2591,
3003,
3004,
3062,
3063,
3287,
3288,
3556,
3557,
3902,
3903,
4163,
4164,
4465,
4466,
4506,
4507,
4805,
4806,
4818,
4819,
5094,
5095,
5101,
5135,
5272,
5273,
5290,
5291,
5306,
5307,
5317,
5338,
5360,
5361,
5376
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5376,
"ccnet_original_nlines": 60,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3911205232143402,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012684989720582962,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11945032328367233,
"rps_doc_frac_unique_words": 0.48609432578086853,
"rps_doc_mean_word_length": 5.338572978973389,
"rps_doc_num_sentences": 55,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.465771198272705,
"rps_doc_word_count": 827,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.023103060200810432,
"rps_doc_frac_chars_dupe_6grams": 0.011325029656291008,
"rps_doc_frac_chars_dupe_7grams": 0.011325029656291008,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05096263065934181,
"rps_doc_frac_chars_top_3gram": 0.012231029570102692,
"rps_doc_frac_chars_top_4gram": 0.006342019885778427,
"rps_doc_books_importance": -401.99786376953125,
"rps_doc_books_importance_length_correction": -401.99786376953125,
"rps_doc_openwebtext_importance": -233.78927612304688,
"rps_doc_openwebtext_importance_length_correction": -233.78927612304688,
"rps_doc_wikipedia_importance": -169.35122680664062,
"rps_doc_wikipedia_importance_length_correction": -169.35122680664062
},
"fasttext": {
"dclm": 0.03649502992630005,
"english": 0.937650203704834,
"fineweb_edu_approx": 1.8893013000488281,
"eai_general_math": 0.0855455994606018,
"eai_open_web_math": 0.15463995933532715,
"eai_web_code": 0.04272627830505371
}
} | {
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "12",
"label": "Listicle"
}
},
"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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,558,210,570,421,299,000 |
Cloud customer?
Upgrade in MyJFrog >
Search
Overview
This page describes the methods and procedures for triggering an automatic or manual run of a pipeline.
When creating an automated pipeline, you should define your steps so they will execute in an interdependent sequence. This means that each step is configured so that its execution will be triggered by the successful completion of a prior, prerequisite step (or steps). In this way, step 1's completion will trigger the execution of step 2, completion of step 2 triggers execution of step 3, and so on until all steps in the pipeline are executed.
Trigger a Run Automatically
In most cases, you will want your pipeline to initiate execution automatically as the result of some external event that causes a resource to change. This is configured by defining a step's inputResources.
For example, you are likely to want to trigger a run whenever there is a new commit into a source code repository.
To set your source code repo as the pipeline trigger:
1. If you haven't already, add a GitHub integration (or other source control system type) to JFrog Pipelines.
2. In your resources definitions of your pipeline config, define a gitrepo resource type for the project repository, with a descriptive name (for example, "myprojectrepo").
3. In the definition of the first step of your pipeline, specify the gitrepo resource in inputResources. For extra clarity, you can also specify trigger as true (even though that is the default). For example:
inputResources:
- name:
myprojectrepo
trigger: true
When triggering runs through a GitRepo resource, adding [skipRun] to a commit message won't trigger anything when that commit is pushed to the source provider.
Page Contents
When the completed pipeline is viewed, the gitrepo resource is shown as a triggering input into the step.
Other example events might be a change to an Image resource, or receipt through a Webhook.
Triggering a Run Manually
You can trigger a run of any step through the pipeline visualization. To manually run the entire pipeline, trigger the first step in the workflow.
With default configuration
To manually trigger a step:
1. Click on the step. This will display the information box for that step.
2. In the step's information box, click the "Trigger this step" button.
The step will execute, and its successful completion will trigger the subsequent steps of the pipeline. The record of the run is logged in the pipeline history.
With custom configuration
You can trigger a run of any step and provide a set of custom settings to test a specific set of conditions.
To manually trigger a step with custom settings:
1. Click on the step. This will display the information box for that step.
2. In the step's information box, click the "Trigger this step with custom configuration" button.
3. In the resulting Run with custom configuration dialog, you can override the configuration settings, then click Confirm.
The step will execute with the custom settings, and its successful completion will trigger the subsequent steps of the pipeline. The record of the run is logged in the pipeline history.
Viewing Step Execution
You can view the shell commands issued as the step is executing.
To view real-time execution of a step:
1. Trigger the step to execute.
2. While the step executes, click on the step. This will display the information box for that step.
3. In the information box, click "View Logs".
4. This will call up the step log view, where you can see the shell commands issued by the step as they are executed.
Cancelling a Run
You can cancel execution of a run in progress by cancelling execution of a step.
To cancel a step:
1. While the step executes, click on the step. This will display the information box for that step.
2. In the information box, click the "Cancel This Step" button.
The step will cancel execution, and subsequent dependent steps of the pipeline will be skipped. The record of the run is logged in the pipeline history.
Copyright © 2021 JFrog Ltd. | {
"url": "https://www.jfrog.com/confluence/display/JFROG/Running+a+Pipeline",
"source_domain": "www.jfrog.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "81002",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5VI4OIQMCQWOVWYC4SISIBGSMOENYSRI",
"WARC-Concurrent-To": "<urn:uuid:c8c055fc-4f7d-42b0-b46a-ce11678349b6>",
"WARC-Date": "2021-03-07T02:51:12Z",
"WARC-IP-Address": "13.32.181.90",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SREGAJOCXVOJ5DHKD4W2WOS4ZORDAXKN",
"WARC-Record-ID": "<urn:uuid:85d52f02-7c33-418f-a88e-c793c83edb5b>",
"WARC-Target-URI": "https://www.jfrog.com/confluence/display/JFROG/Running+a+Pipeline",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7364f050-f752-4d7e-9e18-5f6c6821d9ff>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-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: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
1,
2,
3,
20,
42,
43,
50,
51,
52,
53,
54,
55,
64,
65,
169,
170,
171,
618,
619,
647,
648,
854,
855,
970,
971,
1025,
1026,
1138,
1313,
1524,
1544,
1556,
1574,
1594,
1595,
1755,
1756,
1770,
1771,
1877,
1878,
1969,
1970,
1971,
1997,
1998,
2145,
2146,
2173,
2174,
2202,
2203,
2280,
2354,
2355,
2516,
2517,
2518,
2544,
2545,
2654,
2655,
2704,
2705,
2782,
2882,
2883,
2884,
3009,
3010,
3196,
3197,
3198,
3199,
3222,
3223,
3288,
3289,
3328,
3329,
3363,
3465,
3513,
3514,
3515,
3635,
3636,
3637,
3638,
3655,
3656,
3737,
3738,
3756,
3757,
3859,
3925,
3926,
4079,
4080,
4081
],
"line_end_idx": [
1,
2,
3,
20,
42,
43,
50,
51,
52,
53,
54,
55,
64,
65,
169,
170,
171,
618,
619,
647,
648,
854,
855,
970,
971,
1025,
1026,
1138,
1313,
1524,
1544,
1556,
1574,
1594,
1595,
1755,
1756,
1770,
1771,
1877,
1878,
1969,
1970,
1971,
1997,
1998,
2145,
2146,
2173,
2174,
2202,
2203,
2280,
2354,
2355,
2516,
2517,
2518,
2544,
2545,
2654,
2655,
2704,
2705,
2782,
2882,
2883,
2884,
3009,
3010,
3196,
3197,
3198,
3199,
3222,
3223,
3288,
3289,
3328,
3329,
3363,
3465,
3513,
3514,
3515,
3635,
3636,
3637,
3638,
3655,
3656,
3737,
3738,
3756,
3757,
3859,
3925,
3926,
4079,
4080,
4081,
4108
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4108,
"ccnet_original_nlines": 101,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35919898748397827,
"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.17271588742733002,
"rps_doc_frac_unique_words": 0.2893175184726715,
"rps_doc_mean_word_length": 4.761127471923828,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.547065734863281,
"rps_doc_word_count": 674,
"rps_doc_frac_chars_dupe_10grams": 0.20037394762039185,
"rps_doc_frac_chars_dupe_5grams": 0.256777822971344,
"rps_doc_frac_chars_dupe_6grams": 0.2296665608882904,
"rps_doc_frac_chars_dupe_7grams": 0.21657836437225342,
"rps_doc_frac_chars_dupe_8grams": 0.21657836437225342,
"rps_doc_frac_chars_dupe_9grams": 0.20037394762039185,
"rps_doc_frac_chars_top_2gram": 0.03053911030292511,
"rps_doc_frac_chars_top_3gram": 0.03178559988737106,
"rps_doc_frac_chars_top_4gram": 0.01745091937482357,
"rps_doc_books_importance": -287.61016845703125,
"rps_doc_books_importance_length_correction": -287.61016845703125,
"rps_doc_openwebtext_importance": -161.3751983642578,
"rps_doc_openwebtext_importance_length_correction": -161.3751983642578,
"rps_doc_wikipedia_importance": -135.18760681152344,
"rps_doc_wikipedia_importance_length_correction": -135.18760681152344
},
"fasttext": {
"dclm": 0.2775060534477234,
"english": 0.8642369508743286,
"fineweb_edu_approx": 2.4771225452423096,
"eai_general_math": 0.7144791483879089,
"eai_open_web_math": 0.17113542556762695,
"eai_web_code": 0.4373408555984497
}
} | {
"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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
5,828,959,037,968,431,000 | Uploaded image for project: 'JDK'
1. JDK
2. JDK-8201652
[TEST] rewrite com/sun/jdi serviceability shell tests to java version
XMLWordPrintable
Details
• svc
Description
Shell tests are known to be error-prone and hard to debug, furthermore in most cases a shell script part does not do much, therefore they should be rewritten to java version.
Attachments
Issue Links
Activity
People
amenkov Alex Menkov
psomashe Parvathi Somashekar (Inactive)
Votes:
0 Vote for this issue
Watchers:
2 Start watching this issue
Dates
Created:
Updated:
Resolved: | {
"url": "https://bugs.openjdk.org/browse/JDK-8201652",
"source_domain": "bugs.openjdk.org",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "96480",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6ZBSLZVN7I23XXW4DMTNLT3EJBG22N7Y",
"WARC-Concurrent-To": "<urn:uuid:3326eeaa-72e0-40bd-b515-f0b689bf3117>",
"WARC-Date": "2024-07-22T16:17:20Z",
"WARC-IP-Address": "23.207.136.149",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BDQ6ZWX7FGB5GWZPFBA3F5ACUDHW5544",
"WARC-Record-ID": "<urn:uuid:cdaa8ace-4f82-4def-98a3-50ba7551c839>",
"WARC-Target-URI": "https://bugs.openjdk.org/browse/JDK-8201652",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0fd2faaf-5fe5-4c7b-847c-a9fd500c5f55>"
},
"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-148\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,
34,
43,
60,
61,
131,
132,
153,
154,
162,
163,
173,
174,
190,
191,
372,
373,
391,
392,
412,
413,
432,
433,
452,
453,
487,
541,
562,
598,
622,
664,
665,
685,
686,
711,
736
],
"line_end_idx": [
34,
43,
60,
61,
131,
132,
153,
154,
162,
163,
173,
174,
190,
191,
372,
373,
391,
392,
412,
413,
432,
433,
452,
453,
487,
541,
562,
598,
622,
664,
665,
685,
686,
711,
736,
761
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 761,
"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.23364485800266266,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03738318011164665,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25233644247055054,
"rps_doc_frac_unique_words": 0.8170731663703918,
"rps_doc_mean_word_length": 5.390244007110596,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.12346076965332,
"rps_doc_word_count": 82,
"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.04524886980652809,
"rps_doc_frac_chars_top_3gram": 0.05882352963089943,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -41.61015701293945,
"rps_doc_books_importance_length_correction": -41.61016082763672,
"rps_doc_openwebtext_importance": -33.95060348510742,
"rps_doc_openwebtext_importance_length_correction": -33.95060348510742,
"rps_doc_wikipedia_importance": -25.714006423950195,
"rps_doc_wikipedia_importance_length_correction": -25.714008331298828
},
"fasttext": {
"dclm": 0.05173927918076515,
"english": 0.8669921159744263,
"fineweb_edu_approx": 1.814393401145935,
"eai_general_math": 0.0007739100256003439,
"eai_open_web_math": 0.13090729713439941,
"eai_web_code": -0.0000022599999738304177
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
908,219,662,224,226,200 | Linux Shell逻辑运算符和表达式详解
技术 7484 次围观 3 次吐槽
Linux
Shell 基本上是一个命令解释器，类似于 DOS 下的 command。它接收用户命令（如 ls 等），然后调用相应的应用程序。较为通用的 Shell 有标准的Bourne shell (sh）和C shell (csh）。
很多时候在写 Shell 脚本的时候都容易遗忘部分逻辑运算符和表达式的写法，因此摘录如下，留待不时之需查询使用。
Shell 逻辑运算符涉及以下几种类型，只要适当选择，可以解决我们很多复杂的判断，达到事半功倍效果。
一、逻辑判断
1、关于文件与目录的逻辑判断
-f 常用。判断『文件』是否为普通文件，比如: if [ -f filename ]
-d 常用。判断『目录』是否存在
-b 判断是否为一个『 block 文件』
-c 判断是否为一个『 character 文件』
-S 判断是否为一个『 socket 标签文件』
-L 判断是否为一个『 symbolic link 的文件』
-e 判断『文件』是否存在
2、关于程序的逻辑判断
-G 判断是否由 GID 所执行的程序所拥有
-O 判断是否由 UID 所执行的程序所拥有
-p 判断是否为程序间传送信息的 name pipe 或是 FIFO
3、关于文件的属性判断
-r 判断是否为可读的属性
-w 判断是否为可以写入的属性
-x 判断是否为可执行的属性
-s 判断是否为『非空白文件』
-u 判断是否具有『 SUID 』的属性
-g 判断是否具有『 SGID 』的属性
-k 判断是否具有『 sticky bit 』的属性
4、两个文件之间的判断与比较
-nt 第一个文件比第二个文件新
-ot 第一个文件比第二个文件旧
-ef 第一个文件与第二个文件为同一个文件（ link 之类的文件）
5. 布尔运算符
&& 逻辑与
|| 逻辑或
! 逻辑非
二、运算符号
= 等于 应用于：整型或字符串比较 如果在[] 中，只能是字符串
!= 不等于 应用于：整型或字符串比较 如果在[] 中，只能是字符串
< 小于 应用于：整型比较 在[] 中，不能使用表示字符串
> 大于 应用于：整型比较 在[] 中，不能使用表示字符串
-eq 等于 应用于：整型比较
-ne 不等于 应用于：整型比较
-lt 小于 应用于：整型比较
-gt 大于 应用于：整型比较
-le 小于或等于 应用于：整型比较
-ge 大于或等于 应用于：整型比较
-a 双方都成立（and） 相当于 &&
-o 单方成立（or） 相当于 ||
-z 空字符串
-n 非空字符串
三、逻辑表达式
注意：所有字符与逻辑运算符直接用“空格”分开，不能连到一起。
1、test 命令
使用方法：test EXPRESSION
如：
[[email protected] ~]# test 1 = 1 && echo 'ok'
ok
[[email protected] ~]# test -d /etc/ && echo 'ok'
ok
[[email protected] ~]# test 1 -eq 1 && echo 'ok'
ok
[[email protected] ~]# if test 1 = 1 ; then echo 'ok'; fi
ok
2、精简表达式
[] 表达式
[[email protected] ~]# [ 1 -eq 1 ] && echo 'ok'
ok
[[email protected] ~]# [ 2 < 1 ] && echo 'ok'
-bash: 1: No such file or directory
[[email protected] ~]# [ 2 \< 1 ] && echo 'ok'
[[email protected] ~]# [ 2 -gt 1 -a 3 -lt 4 ] && echo 'ok'
ok
[[email protected] ~]# [ 2 -gt 1 && 3 -lt 4 ] && echo 'ok'
-bash: [: missing `]'
注意：在[] 表达式中，常见的>,<需要加转义字符，表示字符串大小比较，以acill码位置作为比较。不直接支持<>运算符，还有逻辑运算符 || 和 && 它需要用-a[and] –o[or]表示。
[[]] 表达式
[[email protected] ~]# [ 1 -eq 1 ] && echo 'ok'
ok
[[email protected] ~]# [[ 2 < 3 ]] && echo 'ok'
ok
[[email protected] ~]# [[ 2 < 3 && 4 < 5 ]] && echo 'ok'
ok
注意：[[]] 运算符只是[]运算符的扩充。能够支持<,>符号运算不需要转义符，它还是以字符串比较大小。里面支持逻辑运算符 || 和 &&
bash 的条件表达式中有三个几乎等效的符号和命令：test，[]和[[]]。通常，大家习惯用if [];then这样的形式。而[[]]的出现，根据ABS所说，是为了兼容><之类的运算符。
不考虑对低版本bash和对sh的兼容的情况下，用[[]]是兼容性强，而且性能比较快，在做条件运算时候，可以使用该运算符。
参考链接：
http://www.cnblogs.com/chengmo/archive/2010/10/01/1839942.html
转载请注明：秋水逸冰 » Linux Shell逻辑运算符和表达式详解
发表评论
取消评论
• 昵称 (必填)
• 邮箱 (必填)
• 网址
表情
已有评论 (3)
1. 做的很不错哦~
馒头饭MADfan5年前 (2013-12-18)回复
2. 我严重怀疑楼上的哥们是做博客互访的，表现基本上夸一句，其实啥也没看，只是为了单纯的留个链接。
smartsun5年前 (2013-12-18)回复
3. 真棒~
无纯洁5年前 (2013-12-17)回复 | {
"url": "https://teddysun.com/325.html",
"source_domain": "teddysun.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "36044",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GQWOYQYA3NS6ZFKNWKDPIWXIFJTNHW2R",
"WARC-Concurrent-To": "<urn:uuid:6711f387-8f80-4796-bb08-c5ed0870ee4d>",
"WARC-Date": "2018-06-18T00:12:22Z",
"WARC-IP-Address": "104.31.85.249",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TDQ2RONXGCGK3CEOFCF2DEVF5CUAIPLL",
"WARC-Record-ID": "<urn:uuid:36c7c8e3-9827-4ad8-bc1e-b935d81f24d5>",
"WARC-Target-URI": "https://teddysun.com/325.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ba5db119-7152-49f5-9f0c-78c09321af52>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-204-2.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,
23,
24,
42,
43,
49,
50,
164,
221,
272,
273,
280,
295,
338,
355,
377,
403,
428,
459,
473,
474,
486,
509,
532,
567,
568,
580,
594,
610,
625,
641,
662,
683,
710,
711,
726,
743,
760,
795,
796,
805,
812,
819,
825,
826,
833,
868,
903,
935,
967,
985,
1002,
1020,
1038,
1057,
1076,
1098,
1118,
1126,
1135,
1136,
1144,
1175,
1185,
1206,
1207,
1210,
1211,
1258,
1261,
1312,
1315,
1364,
1367,
1425,
1428,
1429,
1437,
1444,
1445,
1493,
1496,
1542,
1578,
1625,
1626,
1685,
1688,
1747,
1769,
1770,
1869,
1870,
1879,
1880,
1928,
1931,
1979,
1982,
2039,
2042,
2043,
2114,
2115,
2210,
2271,
2272,
2278,
2341,
2342,
2378,
2379,
2384,
2389,
2401,
2413,
2420,
2423,
2424,
2433,
2434,
2447,
2479,
2531,
2562,
2571
],
"line_end_idx": [
23,
24,
42,
43,
49,
50,
164,
221,
272,
273,
280,
295,
338,
355,
377,
403,
428,
459,
473,
474,
486,
509,
532,
567,
568,
580,
594,
610,
625,
641,
662,
683,
710,
711,
726,
743,
760,
795,
796,
805,
812,
819,
825,
826,
833,
868,
903,
935,
967,
985,
1002,
1020,
1038,
1057,
1076,
1098,
1118,
1126,
1135,
1136,
1144,
1175,
1185,
1206,
1207,
1210,
1211,
1258,
1261,
1312,
1315,
1364,
1367,
1425,
1428,
1429,
1437,
1444,
1445,
1493,
1496,
1542,
1578,
1625,
1626,
1685,
1688,
1747,
1769,
1770,
1869,
1870,
1879,
1880,
1928,
1931,
1979,
1982,
2039,
2042,
2043,
2114,
2115,
2210,
2271,
2272,
2278,
2341,
2342,
2378,
2379,
2384,
2389,
2401,
2413,
2420,
2423,
2424,
2433,
2434,
2447,
2479,
2531,
2562,
2571,
2596
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2596,
"ccnet_original_nlines": 125,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07402423024177551,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017496639862656593,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.767160177230835,
"rps_doc_frac_unique_words": 0.5414012670516968,
"rps_doc_mean_word_length": 5.824840545654297,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.016150740906596184,
"rps_doc_unigram_entropy": 4.6894755363464355,
"rps_doc_word_count": 314,
"rps_doc_frac_chars_dupe_10grams": 0.04811371862888336,
"rps_doc_frac_chars_dupe_5grams": 0.1525423675775528,
"rps_doc_frac_chars_dupe_6grams": 0.14488792419433594,
"rps_doc_frac_chars_dupe_7grams": 0.07599780708551407,
"rps_doc_frac_chars_dupe_8grams": 0.062329139560461044,
"rps_doc_frac_chars_dupe_9grams": 0.04811371862888336,
"rps_doc_frac_chars_top_2gram": 0.09185346961021423,
"rps_doc_frac_chars_top_3gram": 0.0349918007850647,
"rps_doc_frac_chars_top_4gram": 0.049753960222005844,
"rps_doc_books_importance": -361.1701965332031,
"rps_doc_books_importance_length_correction": -361.1701965332031,
"rps_doc_openwebtext_importance": -200.3733673095703,
"rps_doc_openwebtext_importance_length_correction": -200.3733673095703,
"rps_doc_wikipedia_importance": -178.0509490966797,
"rps_doc_wikipedia_importance_length_correction": -178.0509490966797
},
"fasttext": {
"dclm": 0.11894649267196655,
"english": 0.007917679846286774,
"fineweb_edu_approx": 2.107985258102417,
"eai_general_math": 0.00032531999750062823,
"eai_open_web_math": 0.011148099787533283,
"eai_web_code": 0.9830037355422974
}
} | {
"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.442",
"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": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,071,160,523,886,607,400 |
Articles: CPU
Bookmark and Share
(8)
Pages: [ 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 ]
Power Consumption
AMD’s E series and Intel’s Atom processors were originally developed for economical computers, so low power consumption is one of their key features. A Celeron, especially based on a 32nm Sandy Bridge core, doesn’t seem fit for energy-efficient computing, but the Celeron 847 has a specified TDP of 17 watts, which is comparable to AMD’s processors with Bobcat architecture. Is it really so? Can a slowed-down Sandy Bridge really ensure high performance while being comparable to specialized products optimized for low power consumption?
In order to answer all these questions we performed some power consumption tests. We used a new digital Corsair AX760i PSU that allows measuring the full consumption of each system (without the monitor) as measured at the PSU’s output. It is the sum total of the power draw of each system component. The PSU’s efficiency is not counted in. The CPU was running a 32-bit version of the LinX 0.6.4 utility. We used FurMark 1.10.4 utility to load the graphics cores.
Without any work to do, every modern CPU switches to a special power-saving state in which it consumes just a few watts. In this case, the other system components and the efficiency of the mainboard’s voltage regulator mask the CPU’s consumption, which must be why the Celeron 847 based platform turns out to be the most economical when idle. It doesn’t differ much from the systems with Atom D2700 and E-350, though. The LGA1155 mainboard with Celeron G1610 needs much more power because mini-ITX LGA1155 products feature a versatile voltage regulator which supports different CPUs and even allows to overclock them. Its efficiency is low at low loads, so the Celeron G1610 based configuration is inferior to the mainboards with simpler and more economical voltage regulators in this test.
At full computing load the Celeron 847 based platform needs as much power as the AMD E-350 based one. The Atom platform is expectedly more economical because the Atom D2700 has a specified TDP of only 10 watts. The Celeron G1610 platform, which is not energy efficient at all, needs one third more power.
The Atom D2700 is the most economical again when it comes to gaming but its 3D speed is far from brilliant. The Celeron 847 is ahead among the CPUs with more or less acceptable 3D performance. It is almost as economical as the Atom D2700, unlike the AMD E-350.
At high mixed load the Brazos and the Celeron 847 based platforms are again comparable in terms of power draw. So we can see that the Core microarchitecture really becomes economical if its voltage is reduced. Although it can’t match the Atom, it equals AMD’s Brazos-based solutions in this respect.
Pages: [ 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 ]
Discussion
Comments currently: 8
Discussion started: 04/28/13 06:27:20 PM
Latest comment: 05/23/13 09:58:24 PM
View comments
Add your Comment | {
"url": "http://www.xbitlabs.com/articles/cpu/display/celeron-847_7.html",
"source_domain": "www.xbitlabs.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "33470",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TSQR4QKTX3PVLKE37SY5MYT3QZRXZXUJ",
"WARC-Concurrent-To": "<urn:uuid:f9b159bf-5bbb-436e-9544-b9fe5b445dc3>",
"WARC-Date": "2013-12-06T10:40:43Z",
"WARC-IP-Address": "144.76.95.40",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:A4MLH276ZZKK6IMSXYICDJEX6UOY6U4T",
"WARC-Record-ID": "<urn:uuid:f060296c-d861-4d6d-aa54-a226f2ffd383>",
"WARC-Target-URI": "http://www.xbitlabs.com/articles/cpu/display/celeron-847_7.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1eca5167-0dc2-48d9-a14a-e5798ba9725f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
1,
2,
16,
18,
19,
38,
39,
44,
85,
86,
104,
105,
643,
644,
1107,
1108,
1899,
1900,
2205,
2206,
2467,
2468,
2768,
2769,
2771,
2812,
2813,
2824,
2825,
2847,
2888,
2925,
2926,
2940,
2941
],
"line_end_idx": [
1,
2,
16,
18,
19,
38,
39,
44,
85,
86,
104,
105,
643,
644,
1107,
1108,
1899,
1900,
2205,
2206,
2467,
2468,
2768,
2769,
2771,
2812,
2813,
2824,
2825,
2847,
2888,
2925,
2926,
2940,
2941,
2957
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2957,
"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.3494364023208618,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.053140100091695786,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2334943562746048,
"rps_doc_frac_unique_words": 0.48065173625946045,
"rps_doc_mean_word_length": 4.767820835113525,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.044188022613525,
"rps_doc_word_count": 491,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04869714006781578,
"rps_doc_frac_chars_dupe_6grams": 0.011106359772384167,
"rps_doc_frac_chars_dupe_7grams": 0.011106359772384167,
"rps_doc_frac_chars_dupe_8grams": 0.011106359772384167,
"rps_doc_frac_chars_dupe_9grams": 0.011106359772384167,
"rps_doc_frac_chars_top_2gram": 0.02990175038576126,
"rps_doc_frac_chars_top_3gram": 0.02776590920984745,
"rps_doc_frac_chars_top_4gram": 0.023067070171236992,
"rps_doc_books_importance": -279.9733581542969,
"rps_doc_books_importance_length_correction": -279.9733581542969,
"rps_doc_openwebtext_importance": -132.90682983398438,
"rps_doc_openwebtext_importance_length_correction": -132.90682983398438,
"rps_doc_wikipedia_importance": -98.02916717529297,
"rps_doc_wikipedia_importance_length_correction": -98.02916717529297
},
"fasttext": {
"dclm": 0.01954830065369606,
"english": 0.9346994757652283,
"fineweb_edu_approx": 1.7798460721969604,
"eai_general_math": 0.5167535543441772,
"eai_open_web_math": 0.5704604387283325,
"eai_web_code": 0.023173270747065544
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.3922",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "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": "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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,588,323,905,339,376,000 | in Combinatory retagged by
4,639 views
32 votes
32 votes
In a tournament with $7$ teams, each team plays one match with every other team. For each match, the team earns two points if it wins, one point if it ties, and no points if it loses. At the end of all matches, the teams are ordered in the descending order of their total points (the order among the teams with the same total are determined by a whimsical tournament referee). The first three teams in this ordering are then chosen to play in the next round. What is the minimum total number of points a team must earn in order to be guaranteed a place in the next round?
1. $13$
2. $12$
3. $11$
4. $10$
5. $9$
in Combinatory retagged by
4.6k views
2 Comments
I think possible with 9 only.
0
0
no 9 will not guarantee!!!
1
1
5 Answers
1 vote
1 vote
lets first try with n=9 ( our tarhet is to get only top three teams get 9 points . If more than three teams will get 9 points then choosing top three will also depend upon referee )
A wins over D,E,F,G and ties with B so total 9 points
B wins over D,E,F,G and ties with A so total 9 points ( if A ties with B then B also ties with A)
now try for C to getting 9 points so first three(A,B,C) will qualify for next round
C ties with D (1 point) , wins over E,F,G( 6 points ) , no other possibilities for C
hence with 9 points we cant choose top three teams guarantely.
Now n=10
A wins over D,E,F,G and ties with B,C so total 10 points
B wins over D,E,F,G and ties with A,C so total 10 points
C wins over D,E,F,G and ties with B,A so total 10 points
for others ( D,E,F,G) we cant get 10 points
Hence 10 is the minimum total number of points a team must earn in order to be guaranteed a place in the next round.
ANS is D
Answer:
Related questions | {
"url": "https://gateoverflow.in/97624/tifr-cse-2016-part-a-question-15?start=4",
"source_domain": "gateoverflow.in",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "101705",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:37VFGQKRK3EY4TLXR65VZJHZI7KLSG5V",
"WARC-Concurrent-To": "<urn:uuid:a8459d92-8f3e-405f-925c-270adb297284>",
"WARC-Date": "2022-12-07T13:28:20Z",
"WARC-IP-Address": "172.67.186.41",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UK5BJQFWSTSSMJDK65DZSZC7GHGNFCEN",
"WARC-Record-ID": "<urn:uuid:cdd52e43-5a23-4700-81b7-0a70bb0f9e70>",
"WARC-Target-URI": "https://gateoverflow.in/97624/tifr-cse-2016-part-a-question-15?start=4",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c29d338c-6fe2-4f77-8c58-da5905cf8514>"
},
"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-177\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
27,
39,
48,
57,
58,
630,
631,
641,
651,
661,
671,
680,
707,
718,
719,
730,
731,
761,
763,
765,
792,
794,
796,
797,
807,
808,
815,
822,
1004,
1058,
1156,
1240,
1325,
1388,
1389,
1398,
1455,
1512,
1569,
1613,
1730,
1731,
1740,
1748,
1749
],
"line_end_idx": [
27,
39,
48,
57,
58,
630,
631,
641,
651,
661,
671,
680,
707,
718,
719,
730,
731,
761,
763,
765,
792,
794,
796,
797,
807,
808,
815,
822,
1004,
1058,
1156,
1240,
1325,
1388,
1389,
1398,
1455,
1512,
1569,
1613,
1730,
1731,
1740,
1748,
1749,
1766
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1766,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34285715222358704,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.11868131905794144,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25934067368507385,
"rps_doc_frac_unique_words": 0.3735632300376892,
"rps_doc_mean_word_length": 3.7701148986816406,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.490659713745117,
"rps_doc_word_count": 348,
"rps_doc_frac_chars_dupe_10grams": 0.12957316637039185,
"rps_doc_frac_chars_dupe_5grams": 0.2294207364320755,
"rps_doc_frac_chars_dupe_6grams": 0.2294207364320755,
"rps_doc_frac_chars_dupe_7grams": 0.21189023554325104,
"rps_doc_frac_chars_dupe_8grams": 0.17530487477779388,
"rps_doc_frac_chars_dupe_9grams": 0.12957316637039185,
"rps_doc_frac_chars_top_2gram": 0.04878048971295357,
"rps_doc_frac_chars_top_3gram": 0.04573170840740204,
"rps_doc_frac_chars_top_4gram": 0.05716463178396225,
"rps_doc_books_importance": -181.5153350830078,
"rps_doc_books_importance_length_correction": -173.73370361328125,
"rps_doc_openwebtext_importance": -135.02330017089844,
"rps_doc_openwebtext_importance_length_correction": -135.02330017089844,
"rps_doc_wikipedia_importance": -122.82623291015625,
"rps_doc_wikipedia_importance_length_correction": -119.74010467529297
},
"fasttext": {
"dclm": 0.03952014073729515,
"english": 0.9291544556617737,
"fineweb_edu_approx": 0.9385460615158081,
"eai_general_math": 0.8500655293464661,
"eai_open_web_math": 0.4162375330924988,
"eai_web_code": 0.02062237076461315
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "511.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
},
"secondary": {
"code": "796.01",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": "Sports and Athletics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
8,636,265,831,781,760,000 | Fandom
Fading Suns
The Supreme Order of Engineers
497pages on
this wiki
Add New Page
Talk0 Share
Originally the Engineers Guild was a holy order or part of the church 1000 years ago. Now however they are the zenith of technology. In a post-fall society high tech is a premium luxury and the Engineers Guild ensures they control it all. Their patents include starships, terraforming engines, computers, robotics, cybernetics, gerontology, genetic engineering, nanotechnology and xenotechnological analysis. The Engineers research and develop what little there is of high technology, keeping what little of it is left maintained and trying to relearn the secrets of the Second Republic.
The Engineers Guild are the most elusive and unnerving of all the guilds. Often living examples of their own skills at cybernetics most of the peasantry view them with superstitious fear. Yet none will deny the necessity of this guild. Without them starships would not fly, worlds would die as terraforming machines collapse and neither church nor noble factions would endure such diminished capacity for long.
Their secrecy and preference for the forbidden secrets of technology has catagorised the Engineers as Mad Scientists, Rogue inventors and Cyberfetishists of the most bizarre kind. All Engineers are subject to regular mandatory confessions with appointed priests.
Some members (Engineer rank and above) of the Supreme Order of Engineers have ties to a religious sect called SoulCraft, which mixes science and religion. SoulCraft was originally the Pneumatic Order of Engineers, formed in 3958 as an official order of the Universal Church, but dissolved a few decades later (when an A.I. computer requested Church ordination) by Patriarch Adrian II.
Ad blocker interference detected!
Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers
Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected. | {
"url": "http://fadingsuns.wikia.com/wiki/The_Supreme_Order_of_Engineers",
"source_domain": "fadingsuns.wikia.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "158902",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4XMVFZTWM2XEY45JU7JWT7UT33QMXJWB",
"WARC-Concurrent-To": "<urn:uuid:25feb746-67c9-46d4-bbb9-02a0a69e77bd>",
"WARC-Date": "2017-05-24T04:05:56Z",
"WARC-IP-Address": "151.101.192.194",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:E5T6XY6NF4ZCZ66GRGNTBDYX7SVBIPY2",
"WARC-Record-ID": "<urn:uuid:9dd6600e-6ca5-40df-9213-eb2cf66cdbba>",
"WARC-Target-URI": "http://fadingsuns.wikia.com/wiki/The_Supreme_Order_of_Engineers",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b8ea8674-a33b-498e-8c45-7b4012498461>"
},
"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,
7,
8,
20,
21,
52,
53,
65,
75,
88,
100,
101,
689,
690,
1101,
1102,
1365,
1366,
1751,
1752,
1786,
1787,
1788,
1911,
1912
],
"line_end_idx": [
7,
8,
20,
21,
52,
53,
65,
75,
88,
100,
101,
689,
690,
1101,
1102,
1365,
1366,
1751,
1752,
1786,
1787,
1788,
1911,
1912,
2046
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2046,
"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.36263737082481384,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008241759613156319,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12087912112474442,
"rps_doc_frac_unique_words": 0.6265822649002075,
"rps_doc_mean_word_length": 5.313291072845459,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.921143531799316,
"rps_doc_word_count": 316,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.030970819294452667,
"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.01786777935922146,
"rps_doc_frac_chars_top_3gram": 0.028588449582457542,
"rps_doc_frac_chars_top_4gram": 0.020250149071216583,
"rps_doc_books_importance": -195.07730102539062,
"rps_doc_books_importance_length_correction": -195.07730102539062,
"rps_doc_openwebtext_importance": -93.99871826171875,
"rps_doc_openwebtext_importance_length_correction": -93.99871826171875,
"rps_doc_wikipedia_importance": -72.24684143066406,
"rps_doc_wikipedia_importance_length_correction": -72.24684143066406
},
"fasttext": {
"dclm": 0.13197708129882812,
"english": 0.9428884387016296,
"fineweb_edu_approx": 2.2315449714660645,
"eai_general_math": 0.0029590099584311247,
"eai_open_web_math": 0.1636108160018921,
"eai_web_code": 0.0003966699878219515
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "200",
"labels": {
"level_1": "Religion",
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "1",
"label": "About (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
2,871,599,358,062,467,600 | X
3 Levels of Network Penetration Testing: Which Scope is Right for Your Business?
Categories: Penetration Testing
There are basically three levels of network penetration testing:
1) Security Assessment (Validation)
This level of testing is vulnerability-centric. Heavily utilizing automated toolsets, the test starts with a vulnerability assessment and is followed by a manual review of any findings to eliminate “false positives.” These automated scans take up to several hours, and can search for tens of thousands of known vulnerabilities. This introductory level of penetration test offers a report focused on vulnerabilities in your network security posture.
2) CREST-Aligned Penetration Test
This level of test assesses the security of your network infrastructure by simulating an attack from malicious outsiders and/or insiders to identify attack vectors, vulnerabilities and control weaknesses. Penetration testing involves primarily manual testing techniques that are supported by automation and attempts to exploit discovered vulnerabilities. This often includes open source intelligence gathering (OSINT) by passive, semi-passive and/or active means, exposed applications (unauthenticated), and potentially social engineering (people) attack vectors as well.
Overall, the scope of a penetration test engagement is significantly larger than automated scanning alone. Its goal is to evaluate your network security posture and risk profile as seen by an intentioned attacker during the time available (typically a week or more). This level of penetration test meets or exceeds the minimum requirements for PCI-DSS, FedRAMP, CREST, and other regulations. Reporting follows a narrative style to allow you to “see” how the attacker thinks.
3) Red Team Engagement
Organizations with mature security programs with professional staff dedicated to defending against cyberattacks can take part in “red team” engagements, where the penetration testers (ethical hackers) play offense and the security staff play defense. This dynamic, highly targeted form of penetration testing leverages “real-world” attack scenarios designed to test your detection and response capabilities. A red team engagement isn’t about pinpointing your vulnerabilities—it’s about gaining access by any means available to the sensitive data you’re trying to protect and your ability to detect and defend the attack.
How to Determine Your Penetration Testing Scope
Each of these three levels of penetration tests has its strengths and weaknesses. Which level is right for you? That depends on your goals.
At Pivot Point Security, we fine-tune each pen test engagement to maximize its business value for your specific needs. If you’re unsure which level of pen test is right for you, or if you’re concerned about attestation requirements, we’ll work with you to determine the best choice.
Our “level 2” penetration testing process is CREST-aligned, and follows a blend of the Penetration Test Execution Standard (PTES) and the Open Source Security Testing Methodology Manual (OSSTMM).
To talk more about penetration testing and how it can help your company achieve its security and compliance goals, contact Pivot Point Security.
Michael Gargiullo : | {
"url": "https://www.pivotpointsecurity.com/blog/network-penetration-testing-levels/amp/",
"source_domain": "www.pivotpointsecurity.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "53093",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HSSTGZDVJFGEHKLUJHGUXV42UNJFF6VA",
"WARC-Concurrent-To": "<urn:uuid:908b92f7-f9b8-4e89-810c-3e3bc39e68a1>",
"WARC-Date": "2018-06-18T23:14:28Z",
"WARC-IP-Address": "209.59.172.248",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:67NRIS2I6DHRALTXEKX56AECLIGJ6TCM",
"WARC-Record-ID": "<urn:uuid:71f9b42d-e441-4e5c-80f6-e757c785aec9>",
"WARC-Target-URI": "https://www.pivotpointsecurity.com/blog/network-penetration-testing-levels/amp/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dcac84d1-6fc5-4202-9c65-858b77149f42>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-167-231-208.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
2,
3,
85,
86,
122,
123,
188,
189,
225,
226,
675,
677,
678,
712,
713,
1287,
1288,
1763,
1765,
1766,
1789,
1790,
2413,
2414,
2462,
2463,
2604,
2605,
2889,
2890,
3086,
3087,
3233,
3234
],
"line_end_idx": [
2,
3,
85,
86,
122,
123,
188,
189,
225,
226,
675,
677,
678,
712,
713,
1287,
1288,
1763,
1765,
1766,
1789,
1790,
2413,
2414,
2462,
2463,
2604,
2605,
2889,
2890,
3086,
3087,
3233,
3234,
3253
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3253,
"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.3274647891521454,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017605630680918694,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15669013559818268,
"rps_doc_frac_unique_words": 0.5170940160751343,
"rps_doc_mean_word_length": 5.730769157409668,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.046449661254883,
"rps_doc_word_count": 468,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02460850030183792,
"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.053691279143095016,
"rps_doc_frac_chars_top_3gram": 0.011185679584741592,
"rps_doc_frac_chars_top_4gram": 0.01938851922750473,
"rps_doc_books_importance": -198.78953552246094,
"rps_doc_books_importance_length_correction": -198.78953552246094,
"rps_doc_openwebtext_importance": -135.6425018310547,
"rps_doc_openwebtext_importance_length_correction": -135.6425018310547,
"rps_doc_wikipedia_importance": -94.95630645751953,
"rps_doc_wikipedia_importance_length_correction": -94.95630645751953
},
"fasttext": {
"dclm": 0.039228860288858414,
"english": 0.7896807789802551,
"fineweb_edu_approx": 1.6858545541763306,
"eai_general_math": 0.03633159026503563,
"eai_open_web_math": 0.25424790382385254,
"eai_web_code": 0.027635399252176285
}
} | {
"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": "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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,322,425,741,317,091,300 | BluRay player - frameskipping? Datarate too high?
prizm4
Auditioning
Joined
Dec 28, 2006
Messages
4
Real Name
David
Hi Guys,
I was at a department store recently here in Australia, where they had BlueRay on display. They had an "Onkyo" BlueRay player and playing a demo disc on a large plasma.
One thing I noticed was the framerate seemed to drop a bit with fast movement/panning - it was like the datarate was too high for the player to keep up (kinda like playing a DVD on an old Pentium II). Has anyone else experienced this jerkiness with fast motion? Maybe it was because it's a cheap no-name BlueRay player?
Prizm
Chris S
Senior HTF Member
Joined
Apr 9, 2000
Messages
2,542
Real Name
Chris S
Onkyo makes a blu-ray player..? I thought they were an HD-DVD supporter.
Dave Moritz
Premium
Joined
Jul 7, 2001
Messages
8,034
Location
California
Real Name
Dave Moritz
I was under the same impresion as well that if it was an Onkyo player it was HD-DVD. At least thats was the news from CES that Onkyo was making a HD-DVD player. I am suprised that it would be out allready though.
Adam Barratt
Senior HTF Member
Joined
Oct 16, 1998
Messages
2,344
Real Name
Adam
Heh. That's the first time I've heard Onkyo called a "cheap no-name".
Onkyo is a member of the Blu-ray Disc Association, but doesn't have a player out yet, and has only officially announced production of an HD DVD player at this point (as far as I know).
Adam
ChristopherDAC
Senior HTF Member
Joined
Feb 18, 2004
Messages
3,729
Real Name
AE5VI
You may be noticing 3-2 judder, if the 24 fps film is being output at 60 Hz. Film doesn't really have a high enough framerate for smooth pans and fast motion, and the 3-2 thing just accentuates that. I still prefer it to 4% speedup.
ChristopherDAC
Senior HTF Member
Joined
Feb 18, 2004
Messages
3,729
Real Name
AE5VI
What do you mean? The two methods of mastering 24 fps material for TV that I am aware of are, one : for 60 Hz television systems, assign 3 and 2 fields (1 and 1.5 frame) alternatively per film frame, keeping the average framerate but introducing a cyclic tempo error, or two : for 50 Hz television systems, transfer at 25 fps, two fields per frame, keeping the relative timing constant but introducing a gross speed error.
I'm aware that there are motion-compensating transfer methods, similar to those used for standards-converting television, but my understanding is that they yield unsatisfactory results (because of the low framerate of the source material). In this case, the conversion from 24 to 60 is being done in the player, so the only way to avoid it would be if the display accepted 24 Hz. If it did, the effect wouldn't appear. To output at 50 Hz, it would either have to speed up 4%, or insert a jump field twice a second, which would be rather noticable.
EDIT : In case the above wasn't clear, what I mean is that the video display apparently will only accept 50 Hz or 60 Hz input. Since the conversion from 24 fps is being done in the player, it can either output at 60 Hz with 3-2 judder, or it can speed playback up by 4% and output at 50 Hz. I'm not perfectly sure that the second option would work, but it's conceivable. Of the two, my preference would be for the 3-2 effect, as I said above.
Cees Alons
Moderator
Senior HTF Member
Joined
Jul 31, 1997
Messages
19,712
Real Name
Cees Alons
Yes, so given your video display system (60 fps or 50fps), one is not an alternative for the other.
I'm even under the impression that most US consumers cannot buy a 50 fps TV set at all.
Cees
Don May Jr
Stunt Coordinator
Joined
Dec 29, 2003
Messages
84
I have seen the "frame skipping" issue you mention and I, too, wonder if it is a data rate/buffer issue with higher bit rate encoding. I have a PS3 connected to my display via HDMI. The very first BLU-RAY disc I watched on my PS3 was KINGDOM OF HEAVEN (encoded in high bit rate MPEG2) and the frame skipping was so prevalent, that I turned it off after about 30 minutes. It is VERY slight, but it's there and it was pretty nasty during camera pans. For the record, I'm watching everything on an NTSC PS3 with an NTSC Sony LCD rear-projection.
It's not a PS3 issue, either, because I noticed it on the first BLU-RAY demo disc playing in my local Best Buy when the Samsung player first came out.
I did watch CRANK the other day and did not notice the problem, though. Maybe it's only on some of the earlier discs, or discs with high average MPEG2 rates?
It's definitely there on some discs and definitely annoying. I have seen it on both the Samsung and the PS3. Even my bud over at DVDMANIACS.NET noticed it and called me immediately after he started watching a BLU-RAY movie (he wanted to see if I had the same problem).
I'd just like to add, for the conversation about display methods above, etc... Why is it that I do not see these same issues on HD DVD discs and only BLU-RAY? I honestly believe that it has nothing to do with the way NTSC/PAL televisions display the pulldown, etc. If it did, wouldn't it be that way on HD DVD discs, too?
ChristopherDAC
Senior HTF Member
Joined
Feb 18, 2004
Messages
3,729
Real Name
AE5VI
Quite so. The original poster is, however, in Australia, and my impression is that HDTVs sold there, as in Europe, will accept both rates. Under such conditions a choice is possible, at least in principle.
Chris S
Senior HTF Member
Joined
Apr 9, 2000
Messages
2,542
Real Name
Chris S
Is it possible it could it be an issue with the MPEG-2 codec? Do you see similar issues on titles that are using AVC? That might explain why you aren't seeing similar problems with HD-DVDs.
Karim Nogas
Stunt Coordinator
Joined
Jun 30, 1997
Messages
132
I've noticed this issue with both xXx and The Guardian, the only two discs I've watched so far (with Sony's player). Mildly distracting but thankfully it only happend a few times during the movie.
Karim Nogas
Stunt Coordinator
Joined
Jun 30, 1997
Messages
132
Well, it's been 3/3, with the latest problem stemming from The Manchurian Candidate. Any quick cut scenes or panning results in the frame seemingly skip a bit and then my display informing me '1080i'. It is quite noticeable and the more action, the more likely it occurs. I'm connecting via component and have Sony's BD player with the latest firmware. There is no problem with SD-DVDs.
Does anyone have a clue as to a workaround?
Karim Nogas
Stunt Coordinator
Joined
Jun 30, 1997
Messages
132
I almost went through an entire viewing of Black Hawk Down last night without any frameskipping until near the end. The frame skips a bit and my TV then displays 'DTV - 1080i' almost as if the BR player is negotiating/handshaking with the component inputs of the TV.
Could this be a problem with the display and NOT the player?
Thanks.
Forum Sponsors
Forum statistics
Threads
345,219
Messages
4,734,751
Members
141,414
Latest member
attlasrex | {
"url": "https://www.hometheaterforum.com/community/threads/bluray-player-frameskipping-datarate-too-high.247838/",
"source_domain": "www.hometheaterforum.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "209702",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ASW2CJS4P4YZO7DSFIQFCP6JP6GUCRYL",
"WARC-Concurrent-To": "<urn:uuid:e4c37814-c1d5-45b1-b81e-02f42b96155f>",
"WARC-Date": "2020-10-30T14:57:57Z",
"WARC-IP-Address": "104.26.11.39",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NS6CLEG3NTKPBIMAKDK4YBWPDIQUHI74",
"WARC-Record-ID": "<urn:uuid:dd5e235a-ab8b-40bb-a3a4-7bc7ec03e30c>",
"WARC-Target-URI": "https://www.hometheaterforum.com/community/threads/bluray-player-frameskipping-datarate-too-high.247838/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9b230b20-7be3-46f4-8264-fd9a4561b4ee>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-49.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
50,
51,
58,
59,
71,
78,
91,
100,
102,
112,
118,
127,
128,
297,
298,
618,
619,
625,
627,
628,
636,
637,
655,
662,
674,
683,
689,
699,
707,
780,
782,
783,
795,
796,
804,
811,
823,
832,
838,
847,
858,
868,
880,
1093,
1095,
1096,
1109,
1110,
1128,
1135,
1148,
1157,
1163,
1173,
1178,
1248,
1249,
1250,
1435,
1436,
1441,
1443,
1444,
1459,
1460,
1478,
1485,
1498,
1507,
1513,
1523,
1529,
1762,
1764,
1765,
1780,
1781,
1799,
1806,
1819,
1828,
1834,
1844,
1850,
2273,
2274,
2822,
2823,
2824,
3267,
3269,
3270,
3281,
3282,
3292,
3310,
3317,
3330,
3339,
3346,
3356,
3367,
3467,
3555,
3556,
3557,
3562,
3564,
3565,
3576,
3577,
3595,
3602,
3615,
3624,
3627,
4170,
4171,
4322,
4323,
4481,
4482,
4751,
4752,
5074,
5076,
5077,
5092,
5093,
5111,
5118,
5131,
5140,
5146,
5156,
5162,
5368,
5370,
5371,
5379,
5380,
5398,
5405,
5417,
5426,
5432,
5442,
5450,
5640,
5642,
5643,
5655,
5656,
5674,
5681,
5694,
5703,
5707,
5904,
5906,
5907,
5919,
5920,
5938,
5945,
5958,
5967,
5971,
6358,
6359,
6403,
6405,
6406,
6418,
6419,
6437,
6444,
6457,
6466,
6470,
6737,
6738,
6799,
6800,
6808,
6810,
6811,
6826,
6827,
6844,
6845,
6853,
6861,
6870,
6880,
6888,
6896,
6910
],
"line_end_idx": [
50,
51,
58,
59,
71,
78,
91,
100,
102,
112,
118,
127,
128,
297,
298,
618,
619,
625,
627,
628,
636,
637,
655,
662,
674,
683,
689,
699,
707,
780,
782,
783,
795,
796,
804,
811,
823,
832,
838,
847,
858,
868,
880,
1093,
1095,
1096,
1109,
1110,
1128,
1135,
1148,
1157,
1163,
1173,
1178,
1248,
1249,
1250,
1435,
1436,
1441,
1443,
1444,
1459,
1460,
1478,
1485,
1498,
1507,
1513,
1523,
1529,
1762,
1764,
1765,
1780,
1781,
1799,
1806,
1819,
1828,
1834,
1844,
1850,
2273,
2274,
2822,
2823,
2824,
3267,
3269,
3270,
3281,
3282,
3292,
3310,
3317,
3330,
3339,
3346,
3356,
3367,
3467,
3555,
3556,
3557,
3562,
3564,
3565,
3576,
3577,
3595,
3602,
3615,
3624,
3627,
4170,
4171,
4322,
4323,
4481,
4482,
4751,
4752,
5074,
5076,
5077,
5092,
5093,
5111,
5118,
5131,
5140,
5146,
5156,
5162,
5368,
5370,
5371,
5379,
5380,
5398,
5405,
5417,
5426,
5432,
5442,
5450,
5640,
5642,
5643,
5655,
5656,
5674,
5681,
5694,
5703,
5707,
5904,
5906,
5907,
5919,
5920,
5938,
5945,
5958,
5967,
5971,
6358,
6359,
6403,
6405,
6406,
6418,
6419,
6437,
6444,
6457,
6466,
6470,
6737,
6738,
6799,
6800,
6808,
6810,
6811,
6826,
6827,
6844,
6845,
6853,
6861,
6870,
6880,
6888,
6896,
6910,
6919
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6919,
"ccnet_original_nlines": 198,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.374176561832428,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06719367951154709,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20487484335899353,
"rps_doc_frac_unique_words": 0.38118410110473633,
"rps_doc_mean_word_length": 4.359286308288574,
"rps_doc_num_sentences": 66,
"rps_doc_symbol_to_word_ratio": 0.0006587600219063461,
"rps_doc_unigram_entropy": 5.591276168823242,
"rps_doc_word_count": 1233,
"rps_doc_frac_chars_dupe_10grams": 0.09023255854845047,
"rps_doc_frac_chars_dupe_5grams": 0.09841860085725784,
"rps_doc_frac_chars_dupe_6grams": 0.09841860085725784,
"rps_doc_frac_chars_dupe_7grams": 0.09023255854845047,
"rps_doc_frac_chars_dupe_8grams": 0.09023255854845047,
"rps_doc_frac_chars_dupe_9grams": 0.09023255854845047,
"rps_doc_frac_chars_top_2gram": 0.01339535042643547,
"rps_doc_frac_chars_top_3gram": 0.01953488029539585,
"rps_doc_frac_chars_top_4gram": 0.027348840609192848,
"rps_doc_books_importance": -599.2937622070312,
"rps_doc_books_importance_length_correction": -599.2937622070312,
"rps_doc_openwebtext_importance": -422.59930419921875,
"rps_doc_openwebtext_importance_length_correction": -422.59930419921875,
"rps_doc_wikipedia_importance": -335.8265075683594,
"rps_doc_wikipedia_importance_length_correction": -335.8265075683594
},
"fasttext": {
"dclm": 0.03903210163116455,
"english": 0.9562942385673523,
"fineweb_edu_approx": 0.9514946937561035,
"eai_general_math": 0.13786524534225464,
"eai_open_web_math": 0.2990230917930603,
"eai_web_code": 0.006049990188330412
}
} | {
"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": "791.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,698,762,417,577,924,000 | Traceroute From Internet Modem
I am using a Nanostation loco M900 for my Internet access and my speeds at some times are worse than dialup. Trying to debug to see exactly where the problem lies I log into the M900 through my browser and run a traceroute on 8.8.8.8. The times are truly horrible with most pings taking seconds if they don't time out.
What is not clear to me is if the traceroute is being done from the M900 or if it is just being done from my PC. I'm trying to show the problem is on one side of the modem or the other... my internal problem or the ISP's problem.
Any idea how I can tell for sure?
The 900 also has a speed test and clocks some 3 to 5 Mbps depending. But I think that is just testing the air link and not the full connection to the Internet.
--
Rick
Reply to
rickman
Loading thread data ...
If you are looking at the Ubiquiti diagnostics pages in the M900, then traceroute is being run from the Ubiquiti bridge radio. If you run it from your computah's command prompt, it's being run on the PC.
The first step to solving a problem is to blame someone, or something.
Send me some traceroute results and I'll look at them. Basically, the hop with the biggest increase in latency, is the culprit. With WISP providers, it's sometime their backhaul to their ISP, which is expensive and often overloaded.
Another common culprit is interference, in this case on 900 MHz. Look at the SNR numbers in the M900. If they're low, you MIGHT have an interference problem. An easy way to test for interference is to look for variations in latency when you ping the ISP's end of the wireless link. For example, if your ping results look like this: C:\>ping 192.168.111.1 -t Pinging 192.168.111.1 with 32 bytes of data: Reply from 192.168.111.1: bytes=32 time=5ms TTL=64 Reply from 192.168.111.1: bytes=32 time=2ms TTL=64 Reply from 192.168.111.1: bytes=32 time=100ms TTL=64 Reply from 192.168.111.1: bytes=32 time=80ms TTL=64 Reply from 192.168.111.1: bytes=32 time=4ms TTL=64 Reply from 192.168.111.1: bytes=32 time=2ms TTL=64 Reply from 192.168.111.1: bytes=32 time=2ms TTL=64 Reply from 192.168.111.1: bytes=32 time=40ms TTL=64 Reply from 192.168.111.1: bytes=32 time=5ms TTL=64 the bridge radios are catching errors, and sending retries, which is what extends the delay. In extreme cases, you'll see timeouts.
Describing how to use traceroute might be a bit much. This looks like a fairly minimal description: You can find MTR ported to Windoze at:
You might also try running traceroute from an internet server to your IP address. Start here:
The speed test is testing the speed between your M900 and whatever the WISP is using for an access point. In the Ubiquiti diagnostics, it's strictly radio to radio.
Good luck.
--
Jeff Liebermann [email protected]
150 Felker St #D http://www.LearnByDestroying.com
Click to see the full signature
Reply to
Jeff Liebermann
FWIW, I ran the same traceroute on my all-wired connection and everything looks reasonable, so 8.8.8.8 is a good test. The times for each hop vary from about 10 to 31 milliseconds. (Some networks don't return the ICMP packets that make traceroute work, so it can be hard to tell whether the problem is close to you or not, but 8.8.8.8 doesn't seem to have this problem.)
I can also ping 8.8.8.8 and the ten-packet average is about 20 milliseconds. My own ISP's DNS server averages 21 milliseconds.
If the traceroute results are showing up in the browser window, it's probably being done from the M900. You should be able to tell by looking at the IP address of the very first line in the traceroute output. When I do a traceroute from my (wired Ethernet) PC, the first IP is the LAN-side address of my router. If I could do one from the router, the first IP would be an address at my ISP.
If you can get a command prompt / shell on your PC, both Linux and legacy systems should have traceroute available. Linux and Mac call it traceroute and Windows calls it tracert . That way you can be sure it's running from your PC.
Is your ISP wireless? Apparently the Nanostation gets used both ways... as the first device at the customer end for wireless ISPs, or as a base station at the customer end with a wired ISP.
If you have a wired ISP, the usual method is to plug an Ethernet cable directly into the modem and your PC, and try speed tests, traceroutes, pings, etc. (If you have Windows, make sure you are up to date on updates from Microsoft before you do this.) If you have a wireless ISP, I don't know of a good way to test, other than by substituting a different radio on your end.
Matt Roberds
Reply to
mroberds
Whatever is upstream from you (first hop) can play a big role. E.g., if your connection is NAT'ed then there's a piece of *code* you are moving through. Ditto with any firewalls or filters.
ping mypc ping M900
traceroute mypc traceroute M900
Hint: first hop tells you the first thing *past* the point from which the trace was initiated.
"traceroute " may fail if any of the nodes along the path refuse to support the operation.
Run each of the above from a DOS/CLI prompt *and* your web interface and you'll see the difference.
Reply to
Don Y
If it's being done from your PC via a web interface you've got a big security problem.
--
umop apisdn
Reply to
Jasen Betts
ElectronDepot website is not affiliated with any of the manufacturers or service providers discussed here. All logos and trade names are the property of their respective owners. | {
"url": "https://www.electrondepot.com/electrodesign/traceroute-from-internet-modem-751918-.htm",
"source_domain": "www.electrondepot.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "58012",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:22YQTEAFJHWD43ZUJY4QVMSEXQQJ3MGS",
"WARC-Concurrent-To": "<urn:uuid:b705e245-53e8-46d6-9357-ffbb40f08259>",
"WARC-Date": "2023-06-07T16:44:40Z",
"WARC-IP-Address": "104.131.180.133",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7VLPWVEX563YDYICRAFDMDOBY46M6EQK",
"WARC-Record-ID": "<urn:uuid:3db84282-1e97-4b65-bdde-30af273a0c02>",
"WARC-Target-URI": "https://www.electrondepot.com/electrodesign/traceroute-from-internet-modem-751918-.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:16af90db-757d-4156-9d0e-04b6a4ea133b>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-188\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
31,
32,
351,
352,
582,
583,
617,
618,
778,
779,
782,
783,
788,
797,
805,
829,
830,
1034,
1035,
1106,
1107,
1340,
1341,
2339,
2340,
2479,
2480,
2574,
2575,
2740,
2741,
2752,
2753,
2756,
2794,
2848,
2881,
2890,
2906,
2907,
3278,
3279,
3406,
3407,
3798,
3799,
4031,
4032,
4222,
4223,
4597,
4598,
4611,
4612,
4621,
4630,
4631,
4821,
4822,
4842,
4843,
4875,
4876,
4971,
4972,
5063,
5064,
5164,
5165,
5174,
5180,
5181,
5268,
5269,
5272,
5284,
5293,
5305,
5306
],
"line_end_idx": [
31,
32,
351,
352,
582,
583,
617,
618,
778,
779,
782,
783,
788,
797,
805,
829,
830,
1034,
1035,
1106,
1107,
1340,
1341,
2339,
2340,
2479,
2480,
2574,
2575,
2740,
2741,
2752,
2753,
2756,
2794,
2848,
2881,
2890,
2906,
2907,
3278,
3279,
3406,
3407,
3798,
3799,
4031,
4032,
4222,
4223,
4597,
4598,
4611,
4612,
4621,
4630,
4631,
4821,
4822,
4842,
4843,
4875,
4876,
4971,
4972,
5063,
5064,
5164,
5165,
5174,
5180,
5181,
5268,
5269,
5272,
5284,
5293,
5305,
5306,
5483
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5483,
"ccnet_original_nlines": 79,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38737332820892334,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.050662510097026825,
"rps_doc_frac_lines_end_with_ellipsis": 0.012500000186264515,
"rps_doc_frac_no_alph_words": 0.2447388917207718,
"rps_doc_frac_unique_words": 0.38655462861061096,
"rps_doc_mean_word_length": 4.453781604766846,
"rps_doc_num_sentences": 104,
"rps_doc_symbol_to_word_ratio": 0.003117690095677972,
"rps_doc_unigram_entropy": 5.255791664123535,
"rps_doc_word_count": 952,
"rps_doc_frac_chars_dupe_10grams": 0.04150943085551262,
"rps_doc_frac_chars_dupe_5grams": 0.08349057286977768,
"rps_doc_frac_chars_dupe_6grams": 0.05825471878051758,
"rps_doc_frac_chars_dupe_7grams": 0.04150943085551262,
"rps_doc_frac_chars_dupe_8grams": 0.04150943085551262,
"rps_doc_frac_chars_dupe_9grams": 0.04150943085551262,
"rps_doc_frac_chars_top_2gram": 0.019103769212961197,
"rps_doc_frac_chars_top_3gram": 0.0403301902115345,
"rps_doc_frac_chars_top_4gram": 0.055188678205013275,
"rps_doc_books_importance": -603.990234375,
"rps_doc_books_importance_length_correction": -603.990234375,
"rps_doc_openwebtext_importance": -337.0142517089844,
"rps_doc_openwebtext_importance_length_correction": -337.0142517089844,
"rps_doc_wikipedia_importance": -197.8845672607422,
"rps_doc_wikipedia_importance_length_correction": -197.8845672607422
},
"fasttext": {
"dclm": 0.021111249923706055,
"english": 0.9255090951919556,
"fineweb_edu_approx": 2.006901264190674,
"eai_general_math": 0.2816045880317688,
"eai_open_web_math": 0.21489214897155762,
"eai_web_code": 0.1353585124015808
}
} | {
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
3,827,843,040,569,265,000 | Create Contacts in Active Directory
Contact creation is essential when there are people (who are not part of your organization) to whom you would like to send only mails and have their contact information stored in your database. With ADManager Plus, you can create bulk contact objects in a flash.
Procedure:
Contact creation is a simple process where you have to import the CSV file which contains the list of contacts that need to be created along with the relevant attributes. Then select the OU in which the contacts have to be created .
You can create contacts for external users. To perform this operation follow the steps below:
1. Select the AD Mgmt tab.
2. Click the Create contacts link under CSV import.
3. Import the CSV file and click OK.
4. Once you see the list imported click Next.
5. Select the container from the list provided.
6. Click on 'Create contacts'
7. The list of contacts that have been created will be displayed.
NOTE:
1. To create mail enabled contacts use "targetAddress"(External Email Address) and "mailNickname"(Mail Alias Name) as headers in CSV file.
2. To create Mail Enabled Contacts in Exchange 2007/2010, you must have ADManager Plus installed on the same machine where Exchange Management Console is also installed.
An example entry to create contacts is below.
name,givenName,displayName,description,mail,co,department,telephoneNumber
J Smith,james,James Smith,Contract Person,[email protected],ABC and Co,Pantry,345-987-1256
William,james,James William,Contract Person,[email protected],ABC and Co,Pantry,345-997-1256
To create a mail-enabled contact, use the below sample:
name,description,telephoneNumber,targetAddress,msExchAdminGroup,mailNickname
James Smith,Contract Person,987-765-5467,"smtp:[email protected]","/o=First Organization/ou=Exchange Administrative Group (FYDIBOHF23SPDLT)",jamessmith
James William,Contract Person,987-765-5467,"smtp:[email protected]","/o=First Organization/ou=Exchange Administrative Group (FYDIBOHF23SPDLT)",jameswilliam
Sample CSV File
Copyright © 2014, ZOHO Corp.All Rights Reserved. | {
"url": "https://www.manageengine.com/products/ad-manager/help/csv-import-management/active-directory-create-contacts-csv.html",
"source_domain": "www.manageengine.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "8020",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3NFJ6OHVKCXMWWMNCOHYH7AJRQUBBB36",
"WARC-Concurrent-To": "<urn:uuid:dcecf7b1-a5a1-4bd7-b239-eacdb3fd593f>",
"WARC-Date": "2015-04-18T08:51:53Z",
"WARC-IP-Address": "74.201.113.131",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JYRYUUBVPCMQAHR5OPNV55AGGCWSAGMT",
"WARC-Record-ID": "<urn:uuid:da764cbe-3522-4637-8009-e485bcd4caef>",
"WARC-Target-URI": "https://www.manageengine.com/products/ad-manager/help/csv-import-management/active-directory-create-contacts-csv.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b7649d36-93fc-48c9-90dc-6b1f78eb28f9>"
},
"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,
36,
37,
38,
301,
302,
304,
305,
316,
317,
550,
551,
553,
554,
648,
649,
678,
679,
733,
734,
773,
774,
822,
823,
873,
874,
906,
907,
975,
976,
978,
979,
985,
986,
1127,
1128,
1300,
1301,
1347,
1348,
1350,
1351,
1425,
1426,
1520,
1521,
1619,
1620,
1621,
1677,
1678,
1755,
1756,
1911,
1912,
2073,
2074,
2076,
2077,
2093,
2094,
2095,
2096
],
"line_end_idx": [
36,
37,
38,
301,
302,
304,
305,
316,
317,
550,
551,
553,
554,
648,
649,
678,
679,
733,
734,
773,
774,
822,
823,
873,
874,
906,
907,
975,
976,
978,
979,
985,
986,
1127,
1128,
1300,
1301,
1347,
1348,
1350,
1351,
1425,
1426,
1520,
1521,
1619,
1620,
1621,
1677,
1678,
1755,
1756,
1911,
1912,
2073,
2074,
2076,
2077,
2093,
2094,
2095,
2096,
2144
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2144,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2448512613773346,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03432494029402733,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.30205950140953064,
"rps_doc_frac_unique_words": 0.5584905743598938,
"rps_doc_mean_word_length": 6.403773784637451,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.673894882202148,
"rps_doc_word_count": 265,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05657041817903519,
"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.04124926030635834,
"rps_doc_frac_chars_top_3gram": 0.020035360008478165,
"rps_doc_frac_chars_top_4gram": 0.01885681040585041,
"rps_doc_books_importance": -165.0154571533203,
"rps_doc_books_importance_length_correction": -165.0154571533203,
"rps_doc_openwebtext_importance": -102.58869934082031,
"rps_doc_openwebtext_importance_length_correction": -102.58869934082031,
"rps_doc_wikipedia_importance": -46.94218444824219,
"rps_doc_wikipedia_importance_length_correction": -46.94218444824219
},
"fasttext": {
"dclm": 0.03933655843138695,
"english": 0.834159791469574,
"fineweb_edu_approx": 1.6929800510406494,
"eai_general_math": 0.012842769734561443,
"eai_open_web_math": 0.0679888129234314,
"eai_web_code": 0.00015545000496786088
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.446",
"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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
631,852,140,487,823,500 | Config
Log for #openttd on 1st June 2008:
Times are UTC Toggle Colours
00:08:26 *** sunkan [[email protected]] has quit [Quit: - nbs-irc 2.36 - www.nbs-irc.net -]
00:09:58 *** sunkan [[email protected]] has joined #openttd
00:17:27 *** Pikka [[email protected]] has quit []
00:28:32 *** XeryusTC is now known as Xeryus|bnc
00:32:30 *** Pikka [[email protected]] has joined #openttd
00:33:23 *** Progman [[email protected]] has quit [Remote host closed the connection]
00:34:22 *** Eddi|zuHause2 [[email protected]] has joined #openttd
00:40:46 *** Eddi|zuHause [[email protected]] has quit [Ping timeout: 480 seconds]
00:50:38 *** NukeBuster [[email protected]] has quit [Quit: http://www.interplay.com/]
01:14:48 *** KritiK [[email protected]] has quit [Quit: Leaving]
01:19:27 *** DaleStan [[email protected]] has quit [Quit: Leaving]
01:22:06 *** DaleStan [[email protected]] has joined #openttd
01:27:30 *** Osai is now known as Osai`off
01:32:33 *** Brianetta [[email protected]] has quit [Quit: TschÃŒÃ]
01:55:30 *** Frostregen [[email protected]] has quit [Read error: Connection reset by peer]
02:08:00 *** divo [[email protected]] has quit [Quit: ( www.nnscript.com :: NoNameScript 4.21 :: www.esnation.com )]
02:50:51 *** Netsplit resistance.oftc.net <-> charm.oftc.net quits: Born_Acorn, lagann, @orudge, k-man, lobster, wgrant
02:53:45 *** Netsplit over, joins: @orudge, Born_Acorn, lobster, lagann, k-man, wgrant
02:54:03 *** mode/#openttd [+v orudge] by ChanServ
03:00:49 *** TinoM| [[email protected]] has joined #openttd
03:02:45 *** Lakie [[email protected]] has quit [Quit: Night All.]
03:07:56 *** TinoM [[email protected]] has quit [Ping timeout: 480 seconds]
03:40:42 *** glx [[email protected]] has quit [Quit: bye]
04:09:11 *** dR3x4cK [[email protected]] has joined #openttd
04:12:06 *** Pikka [[email protected]] has quit []
04:15:35 *** Osai`off is now known as Osai
04:26:26 *** dR3x4cK [[email protected]] has quit [Quit: dR3x4cK]
04:43:57 *** Osai is now known as Osai`off
04:46:45 *** Neo_ [[email protected]] has joined #openttd
04:47:15 <Neo_> hi every body
04:48:32 <Neo_> Is somebody here that has open TTD on an iPhone ?
05:14:36 *** Neo_ [[email protected]] has quit [Ping timeout: 480 seconds]
05:16:47 *** DaleStan [[email protected]] has quit [Ping timeout: 480 seconds]
05:18:10 *** DaleStan [[email protected]] has joined #openttd
05:27:21 *** ben_goodger_ [[email protected]] has quit [Ping timeout: 480 seconds]
05:27:45 *** ben_goodger_ [[email protected]] has joined #openttd
05:40:47 *** jni [[email protected]] has quit [Ping timeout: 480 seconds]
06:51:09 *** Osai`off is now known as Osai
06:55:01 *** Singaporekid [[email protected]] has joined #openttd
07:16:30 *** Lex [[email protected]] has joined #openttd
07:20:17 <Eddi|zuHause2> certainly nobody is here before 7AM
07:20:48 <Eddi|zuHause2> on a sunday...
07:22:08 <Lex> It's 8:20
07:22:24 <Eddi|zuHause2> no, it's 9:20
07:22:43 <SpComb> Logs: http://zapotek.paivola.fi/~terom/logs/openttd
07:22:43 <Eddi|zuHause2> !logs
07:22:52 <Eddi|zuHause2> see for yourself what i was replying to
07:25:12 <Rubidium> Eddi|zuHause2, let's rephrase it for Lex: certainly nobody is here before 6AM on a sunday...
07:25:35 *** LA [[email protected]] has joined #openttd
07:27:27 <Lex> k.
07:28:34 *** planetmaker|away is now known as planetmaker
07:29:37 <hylje> Rubidium: lies
07:39:22 *** ben_goodger_ [[email protected]] has quit [Ping timeout: 480 seconds]
07:43:14 *** ben_goodger_ [[email protected]] has joined #openttd
08:01:08 *** Singaporekid [[email protected]] has quit [Read error: Connection reset by peer]
08:05:27 *** ben_goodger_ [[email protected]] has quit [Ping timeout: 480 seconds]
08:05:56 *** ben_goodger_ [[email protected]] has joined #openttd
08:08:47 *** Eddi|zuHause2 [[email protected]] has quit [Ping timeout: 480 seconds]
08:10:42 *** Lex [[email protected]] has quit [Quit: Leaving]
08:13:24 *** LA is now known as epic_fail
08:13:43 *** epic_fail is now known as LA
08:16:01 *** planetmaker is now known as planetmaker|away
08:17:49 *** Vikthor [[email protected]] has joined #openttd
08:21:20 *** Purno [[email protected]] has joined #openttd
08:22:06 *** Purno [[email protected]] has quit []
08:36:05 *** planetmaker|away is now known as planetmaker
08:47:52 *** Eddi|zuHause [[email protected]] has joined #openttd
08:49:40 <LA> hello
08:50:15 <LA> is there a patch option somewhere which makes oil wells act the same in temperate as in arctic
08:50:31 <LA> so they wont start losing production and eventually close down
08:54:46 *** Zuu [[email protected]] has joined #openttd
08:55:09 <Eddi|zuHause> write a newindustries grf
08:55:21 <LA> ...
08:55:46 <Eddi|zuHause> no, really, that is exactly the option you want
08:55:48 <LA> you know I cant do something so tricky
08:56:00 <LA> I can code only some easy things
08:56:13 <LA> a few var2 s too.. but no industrues
08:56:49 <LA> I would need a hell lot of help from DaleStan and maybe Pikka :P.. He has helped me so far with the wwottdgd grf :D
08:59:08 <Eddi|zuHause> http://wiki.ttdpatch.net/tiki-index.php?page=Action0Industries#Special_industry_flags_to_define_special_behavior_1A_ <- maybe this helps you
09:02:34 *** Xeryus|bnc is now known as XeryusTC
09:18:21 *** stillunknown [[email protected]] has joined #openttd
09:19:52 *** Aerandir [[email protected]] has quit [Quit: - nbs-irc 2.39 - www.nbs-irc.net -]
09:23:53 *** Aerandir [[email protected]] has joined #openttd
09:31:54 *** Slowpoke [[email protected]] has joined #openttd
09:34:46 *** markmc^ [[email protected]] has quit [Ping timeout: 480 seconds]
09:35:34 *** markmc [[email protected]] has joined #openttd
09:39:18 *** Progman [[email protected]] has joined #openttd
10:02:52 *** Zahl [[email protected]] has joined #openttd
10:11:54 <CIA-3> OpenTTD: rubidium * r13349 /trunk/src/ (news_gui.cpp news_type.h): -Codechange: remove a pointless flag; the flag is set before calling a function and is then reset in the function without ever reading it. Patch by Cirdan.
10:12:27 *** stillunknown [[email protected]] has quit [Ping timeout: 480 seconds]
10:14:57 *** HerzogDeXtEr1 [[email protected]] has joined #openttd
10:20:50 *** HerzogDeXtEr1 [[email protected]] has quit [Quit: Leaving.]
10:21:14 *** HerzogDeXtEr1 [[email protected]] has joined #openttd
10:21:27 *** HerzogDeXtEr1 [[email protected]] has quit [Read error: Connection reset by peer]
10:21:36 *** HerzogDeXtEr [[email protected]] has quit [Ping timeout: 480 seconds]
10:22:11 *** Nijn [[email protected]] has joined #openttd
10:22:15 <Nijn> morning all!
10:30:12 *** Mchl [[email protected]] has joined #openttd
10:30:19 <Mchl> hello
10:30:48 *** Hendikins is now known as Hendikins|SRA412
10:38:54 *** divo [[email protected]] has joined #openttd
10:50:35 *** Gekz [[email protected]] has joined #openttd
11:01:44 *** jni [[email protected]] has joined #openttd
11:11:10 *** Vikthor [[email protected]] has quit [Quit: Leaving.]
11:21:32 *** ben_goodger_ [[email protected]] has quit [Ping timeout: 480 seconds]
11:22:35 *** ben_goodger_ [[email protected]] has joined #openttd
11:25:19 *** ecke [[email protected]] has quit [Quit: ecke]
11:25:40 *** ecke [[email protected]] has joined #openttd
11:26:41 *** dR3x4cK [[email protected]] has joined #openttd
11:26:49 *** NukeBuster [[email protected]] has joined #openttd
11:26:54 *** NukeBuster [[email protected]] has quit []
11:36:52 *** Brianetta [[email protected]] has joined #openttd
11:38:34 *** ecke [[email protected]] has quit [Quit: ecke]
11:52:40 *** MFH [[email protected]] has joined #openttd
11:53:40 *** ecke [[email protected]] has joined #openttd
11:58:38 *** Pikka [[email protected]] has joined #openttd
12:15:24 *** shodan [[email protected]] has quit [Ping timeout: 480 seconds]
12:15:57 *** frosch123 [[email protected]] has joined #openttd
12:16:14 *** DaleStan_ [[email protected]] has joined #openttd
12:16:15 *** DaleStan is now known as Guest805
12:16:15 *** DaleStan_ is now known as DaleStan
12:20:35 *** Slowpoke_ [[email protected]] has joined #openttd
12:22:37 *** Guest805 [[email protected]] has quit [Ping timeout: 480 seconds]
12:23:27 *** DaleStan_ [[email protected]] has joined #openttd
12:23:27 *** DaleStan is now known as Guest807
12:23:27 *** DaleStan_ is now known as DaleStan
12:27:54 *** Slowpoke [[email protected]] has quit [Ping timeout: 480 seconds]
12:28:07 *** Wolf01 [[email protected]] has joined #openttd
12:28:15 <Wolf01> hello
12:28:16 *** Frostregen [[email protected]] has joined #openttd
12:28:21 *** glx [[email protected]] has joined #openttd
12:28:22 *** mode/#openttd [+v glx] by ChanServ
12:28:58 *** Guest807 [[email protected]] has quit [Ping timeout: 480 seconds]
12:29:04 *** LA is now known as LA[afk]
12:29:19 <Wolf01> Q: timetables and load orders: what is wrong?
12:29:35 <Rubidium> load orders override timetables
12:29:54 <Rubidium> full load orders that is
12:30:14 <Wolf01> why not the opposite?
12:30:43 <Rubidium> because then: "load if available", "full load" and "full load any" are equivalent
12:30:51 <Rubidium> in the context of time tables
12:30:53 *** dragonhorseboy [[email protected]] has joined #openttd
12:30:54 <dragonhorseboy> hey
12:31:04 <Rubidium> because it'll always be at the station for X days/ticks
12:31:26 <Rubidium> with timetables it won't leave early
12:31:31 <LA[afk]> how many ticks in one day?
12:32:12 <Rubidium> LA[afk]: in what context? vanilla OpenTTD?
12:32:23 <Rubidium> or random patchpack?
12:32:44 <LA[afk]> vanilla
12:32:47 <LA[afk]> :P
12:32:47 <Rubidium> 74
12:33:00 <LA[afk]> k
12:33:27 <Wolf01> I need to start a train if full loaded before the timetable time, but if not full loaded it should stay at station until timetable time expired
12:33:29 <LA[afk]> I woudln't ask a question about a random patchpack here
12:33:59 <Rubidium> Wolf01: doesn't work that way
12:34:13 <Wolf01> eh, I noticed
12:34:30 <Rubidium> ever noticed trains leaving too early?
12:34:47 <Rubidium> that'd be really ground breaking
12:35:02 *** shodan [[email protected]] has joined #openttd
12:35:02 *** Pinchiukas [[email protected]] has joined #openttd
12:35:06 <dragonhorseboy> I agree rubidium
12:35:15 <Pinchiukas> is there a better manual on signals than in the wiki?
12:35:30 <Progman> what agains the manual on the wiki?
12:35:55 <LA[afk]> http://www.openttdcoop.org/wiki/Guides:Presignals
12:36:06 <LA[afk]> dunno if it's better though
12:36:28 <LA[afk]> and they cover pre-signals, not usual
12:38:39 <dragonhorseboy> LA...there's one particular signalling that I never could quite figure out before...hmm let me see if I can try explain it...
12:39:29 <dragonhorseboy> 2 platforms at both ends (3 trains)... and one single in middle of the single line .. never could quite figure if it was possible to signal the middle properly or not :/
12:39:54 <dragonhorseboy> eg train 1 at north and train 2+3 at south .. train 3 often follow train 2 but problem is making train 1 wait till the middle signal isn't red
12:40:27 <dragonhorseboy> otherwise getting 'cornfield meets' in the middle :p
12:42:29 <Pinchiukas> ok what the FUCK do I have to do to make the trains use one track to go one way and the other one to return
12:42:32 <Wolf01> so Rubidium, how can I set the orders to avoid:
12:42:32 <Wolf01> 1) trains loading more than 30 days when they are already full loaded
12:42:32 <Wolf01> or
12:42:32 <Wolf01> 2) trains waiting 30 days and then start empty, because 2 trains arrived at the same time but there is no cargo for both
12:43:13 *** Wezz6400 [[email protected]] has joined #openttd
12:44:56 <Rubidium> use full load and don't use time tables
12:45:13 <dragonhorseboy> good question: whatever happened to partial load? ;)
12:45:14 <Wolf01> but then they'll wait 150 days
12:45:27 <Rubidium> dragonhorseboy: there never has been partial load
12:45:36 <shodan> oooh - presignals guide
12:45:51 <dragonhorseboy> rubidium...there was
12:45:59 <Rubidium> dragonhorseboy: really? which revision?
12:46:11 <Rubidium> maybe in some <Crappy>IN
12:46:12 <dragonhorseboy> they just seem to not be able to bother rolling it into any RC builds for some reason tho
12:46:34 <dragonhorseboy> I often had many 60-70% loaded freights (still do at times)
12:47:35 <Rubidium> Wolf01: if they wait 150 days you've got too many trains on the route
12:47:54 <Wolf01> no, only periods of very low production
12:47:58 <dragonhorseboy> (kinda a bit like in RT2 where I had 3 grain cars to one farm and at random it may be all cars loaded or sometimes only two cars alone .. but at least never ever empty thanks to the cargo flag option)
12:48:52 <Rubidium> Wolf01: time tables are not a tool to handle production changes automatically
12:50:28 <Progman> Pinchiukas: using one-way signals
12:50:54 <Wolf01> So what is timetable useful for?
12:51:03 <Pinchiukas> Progman: how do I put a one way signal?
12:51:16 <dragonhorseboy> pinchiukas..umm..click again?
12:51:20 <Progman> place a signal and ctrl-click on ot
12:51:23 <dragonhorseboy> even ttdx was like that
12:51:27 <Progman> it
12:51:33 <Rubidium> Pinchiukas: as described in the wiki: Click on an existing two-way signal to toggle it to a one-way signal. Click on it again to change its direction (leaving it one-way); the third time will revert it back to a two-way signal.
12:51:42 <Progman> eeeuh, without CTRL
12:51:42 <Wolf01> My buses, timetabled with autofill are all stuck together, trains wait at stations too much or start too early
12:52:04 <Pinchiukas> oh, ok thanks
12:52:11 *** ben_goodger_ [[email protected]] has quit [Ping timeout: 480 seconds]
12:52:34 <Rubidium> timetables are useful when you want trains to take the same amount of time for each trip
12:52:36 *** ben_goodger_ [[email protected]] has joined #openttd
12:53:07 <Rubidium> you need to reset the lateness timer manually to get them initially separated
12:53:17 <Rubidium> after that they'll automatically keep separated
12:56:03 <Wolf01> I think timetable is another feature based on the game of some players, which doesn't fit other players game, like the transfer order which imho doesn't work at all but if you make the route in the only way it can work
12:57:27 <Rubidium> true
12:57:35 <Rubidium> but why do we have 11 bridges then?
12:57:43 <Rubidium> 1 type would be enough
12:57:55 <Rubidium> why do we have 4 rail types? 1 would also be enough
12:58:16 <dragonhorseboy> umm rubidium..how do you make electric engines not suddenly decide to run with no overhead wires? :p
12:58:21 <dragonhorseboy> and what about the few of us that likes to use NG?
12:59:06 <Rubidium> dragonhorseboy: by making sure that the train can actually take a path to it's destination that does have electrification all the way
12:59:37 <SmatZ> problematic can be two-way red signal if you use firstred_twoway_eol
12:59:46 <LA[afk]> hehe.. the trains could go by inertia :D
12:59:57 <Rubidium> if there isn't such a path it'll get into the 'take random junction until you find the destination.
13:00:07 <Pinchiukas> ok so if I have two tracks that could be used to leave a station, but if I only want to use one, I put a one-way signal on it (facing the station) and the trains will prefer it to the track with no signal?
13:00:58 <dragonhorseboy> rubidium...I'll rather prefer to be able to build one line with a mix of wire and no wire and just let the trains only have to know which station to stop at and not route-figuring-out
13:01:13 <dragonhorseboy> strangely enough I often do kinda the same thing with RT2 (and nope no waypoints used at all)
13:01:34 *** Hendikins [[email protected]] has joined #openttd
13:01:38 <dragonhorseboy> my way of letting fast freight and express share one mainline but head to seperate end stations
13:02:35 *** TinoM [[email protected]] has joined #openttd
13:02:44 <dragonhorseboy> to our own of course :p
13:03:18 <Hendikins> Hrm, boring night at work tonight.
13:03:29 <Hendikins> I've only sold one ticket, but at least it is an expensive one
13:03:39 <LA[afk]> dragonhorseboy: Then electrifythe whole track.. Diesel and steam are able to run at it.. and just give out the proper orders
13:03:40 <Rubidium> there must be something fishy with either the signalling or the electrification if it does such a thing. Trains will not willfully take tracks where they don't have power on.
13:05:02 <dragonhorseboy> LA...nah when thats done the trains often take wrong legs at times
13:05:17 <dragonhorseboy> so there...the line's only partial wired and partial not wired for a reason
13:06:12 <dragonhorseboy> funny enough RT2 is a bit smarter tho...if it determines that the next station is not electrified the train refuses to leave the station its already sitting transparent at
13:06:56 <Rubidium> OTTD just gives you a news message that it can't reach the next ordered station and start driving randomly trying not to clog up the station
13:07:43 *** Lakie [[email protected]] has joined #openttd
13:08:24 *** Zuu [[email protected]] has quit [Quit: Leaving]
13:09:06 *** TinoM| [[email protected]] has quit [Ping timeout: 480 seconds]
13:09:07 <dragonhorseboy> well it does clog up the line if its only a small network tho?
13:09:15 <dragonhorseboy> hence why I kinda like RT2's behaviour a bit better in this case
13:11:37 *** ben_goodger_ [[email protected]] has quit [Ping timeout: 480 seconds]
13:14:17 *** ben_goodger_ [[email protected]] has joined #openttd
13:20:04 *** DaleStan_ [[email protected]] has joined #openttd
13:20:04 *** DaleStan is now known as Guest813
13:20:05 *** DaleStan_ is now known as DaleStan
13:22:21 *** ben_goodger_ [[email protected]] has quit [Ping timeout: 480 seconds]
13:24:02 <CIA-3> OpenTTD: glx * r13350 /trunk/src/rail_gui.cpp: -Fix: wrong tooltip for waypoint picker scrollbar
13:24:16 *** dragonhorseboy [[email protected]] has left #openttd []
13:24:55 <Pinchiukas> so if a train has a choice of a red signal and no signal at all, it chooses the path to the red signal?
13:25:47 <Rubidium> does "no signal" means absolutely no signal or signal in the opposite way?
13:25:52 *** ben_goodger_ [[email protected]] has joined #openttd
13:26:11 <Rubidium> in the former it'll take the path without signal, in the latter it'll way at the red signal
13:26:43 *** Guest813 [[email protected]] has quit [Ping timeout: 480 seconds]
13:28:13 *** k-man [[email protected]] has quit [Ping timeout: 480 seconds]
13:28:23 *** McHawk [[email protected]] has quit [Remote host closed the connection]
13:28:25 <Pinchiukas> Rubidium: oh, ok thanks :)
13:30:14 *** Osai is now known as Osai`off
13:31:21 *** lagann [[email protected]] has quit [Quit: Leaving]
13:31:42 *** lagann [[email protected]] has joined #openttd
13:36:26 <Sacro> Hereâs the first problem. The new KDE launcher is a gynecologist interface: There you are, sitting in front of a 20â³ screen, but the programmer has dictated that you have to do everything by poking around in a small box.
13:36:55 <Pinchiukas> but if I want say three trains leaving the station on one track, I still need to put a buttload of signals on the track?
13:37:55 <Progman> yes
13:38:04 <Rubidium> yes and no; the track needs quite a few signals, but you can place most of them automagically
13:38:16 *** TinoM| [[email protected]] has joined #openttd
13:38:23 <Rubidium> just build the first one way signal pointing to the right direction
13:39:16 <Rubidium> then 'drag' that signal towards the direction you want the signals to be placed, press the CTRL key on your keyboard then 'end' the dragging by releasing the mouse button
13:39:25 <Rubidium> voila... signals build till the next junction
13:40:44 <Rubidium> this is *also* described in the same signal wiki page as the rest of the signalling stuff is described on
13:43:47 *** Osai`off is now known as Osai
13:45:02 *** LA[afk] is now known as LA
13:45:07 *** TinoM [[email protected]] has quit [Ping timeout: 480 seconds]
13:45:29 *** Pinchiukas_ [[email protected]] has joined #openttd
13:45:54 *** Pinchiukas [[email protected]] has quit [Read error: Connection reset by peer]
13:50:08 *** TinoM| [[email protected]] has quit [Quit: Verlassend]
13:53:39 *** DaleStan_ [[email protected]] has joined #openttd
13:53:40 *** DaleStan is now known as Guest819
13:53:40 *** DaleStan_ is now known as DaleStan
13:55:14 *** TinoM [[email protected]] has joined #openttd
13:55:47 *** Pinchiukas__ [[email protected]] has joined #openttd
13:56:56 *** Pinchiukas_ [[email protected]] has quit [Read error: Connection reset by peer]
13:58:13 *** Guest819 [[email protected]] has quit [Ping timeout: 480 seconds]
14:03:34 *** Mucht [[email protected]] has quit [Remote host closed the connection]
14:04:19 *** Mucht [[email protected]] has joined #openttd
14:21:50 *** lobster_MB [[email protected]] has joined #openttd
14:21:55 *** stillunknown [[email protected]] has joined #openttd
14:24:58 *** Pinchiukas_ [[email protected]] has joined #openttd
14:25:49 *** Pinchiukas__ [[email protected]] has quit [Read error: Connection reset by peer]
14:29:48 *** Pinchiukas__ [[email protected]] has joined #openttd
14:29:48 *** Pinchiukas_ [[email protected]] has quit [Read error: Connection reset by peer]
14:33:21 *** LA_ [[email protected]] has joined #openttd
14:34:47 *** LA_ [[email protected]] has quit []
14:34:55 *** Alberth [[email protected]] has joined #openttd
14:40:13 *** Pinchiukas_ [[email protected]] has joined #openttd
14:40:27 *** LA [[email protected]] has quit [Ping timeout: 480 seconds]
14:40:44 *** shodan [[email protected]] has quit [Quit: Client Exiting]
14:41:14 *** LA [[email protected]] has joined #openttd
14:41:43 *** LA_ [[email protected]] has joined #openttd
14:41:54 *** Pinchiukas__ [[email protected]] has quit [Read error: Connection reset by peer]
14:42:43 *** LA is now known as Guest825
14:42:43 *** LA_ is now known as LA
14:46:06 *** KritiK [[email protected]] has joined #openttd
14:49:21 *** Guest825 [[email protected]] has quit [Ping timeout: 480 seconds]
14:51:22 *** Vikthor [[email protected]] has joined #openttd
14:58:05 *** Pinchiukas__ [[email protected]] has joined #openttd
14:59:50 *** Pinchiukas_ [[email protected]] has quit [Read error: Connection reset by peer]
15:08:36 <CIA-3> OpenTTD: smatz * r13351 /trunk/ (6 files in 3 dirs): -Codechange: disable warnings about unused variable for builds without asserts
15:10:13 <LA> SmatZ: Can you give me the url to your fixed patvch for wwottdgd?
15:11:07 *** ben_goodger_ [[email protected]] has quit [Ping timeout: 480 seconds]
15:11:29 *** ben_goodger_ [[email protected]] has joined #openttd
15:27:40 *** Progman [[email protected]] has quit [Remote host closed the connection]
15:34:41 <LA> How can I specify the revision text with bottd?
15:34:57 <LA> when I patch something, it still shows the trunk revision
15:34:58 <glx> modify rev.cpp.in in the patch
15:35:26 <glx> but bottd should at least show rXXXXM
15:35:49 <LA> hmm.. maybe it didn't get the patch then :D
15:35:59 <LA> coz it showed r13305 just
15:36:15 <LA> atm compiling again
15:36:26 <glx> means unpatched source or changes outside src
15:36:46 <LA> ye, I get that :)
15:37:01 <LA> It's a hell trouble compiling on windows actually :P
15:37:18 <LA> If I had interent connection in Linux, Id be ready ages ago
15:38:37 <LA> ok.. all good now :)
15:50:58 *** Pinchiukas_ [[email protected]] has joined #openttd
15:51:51 *** Pinchiukas__ [[email protected]] has quit [Read error: Connection reset by peer]
15:55:28 *** Pinchiukas__ [[email protected]] has joined #openttd
15:55:28 *** Pinchiukas_ [[email protected]] has quit [Read error: Connection reset by peer]
15:55:30 *** mikl [[email protected]] has joined #openttd
15:55:40 <planetmaker> ok, doesn't work :(
15:55:42 *** mikl [[email protected]] has quit []
15:55:50 <planetmaker> wrong channel :(
15:59:24 <Nijn> ):
15:59:51 <Nijn> i felt like symphatizing with your pain.
16:00:03 <Touqen> :D
16:00:11 <Touqen> Laughing at your expense;
16:00:33 <Nijn> :o
16:07:01 *** Pinchiukas_ [[email protected]] has joined #openttd
16:07:02 *** Pinchiukas__ [[email protected]] has quit [Read error: Connection reset by peer]
16:11:44 *** Alberth [[email protected]] has left #openttd []
16:14:24 *** Dred_furst [[email protected]] has joined #openttd
16:17:36 *** Pinchiukas__ [[email protected]] has joined #openttd
16:19:21 *** Pinchiukas_ [[email protected]] has quit [Read error: Connection reset by peer]
16:27:32 *** thgergo [[email protected]] has joined #openttd
16:28:51 *** markmc^ [[email protected]] has joined #openttd
16:28:52 *** HerzogDeXtEr [[email protected]] has joined #openttd
16:29:59 *** blathijs [[email protected]] has quit [Ping timeout: 480 seconds]
16:31:35 *** Pinchiukas_ [[email protected]] has joined #openttd
16:31:35 *** Pinchiukas__ [[email protected]] has quit [Read error: Connection reset by peer]
16:32:01 *** markmc [[email protected]] has quit [Ping timeout: 480 seconds]
16:32:01 *** markmc^ is now known as markmc
16:34:59 *** markmc^ [[email protected]] has joined #openttd
16:38:10 *** Zorni [[email protected]] has joined #openttd
16:39:31 *** lobstar [[email protected]] has joined #openttd
16:40:06 *** markmc [[email protected]] has quit [Ping timeout: 480 seconds]
16:41:48 *** MFH [[email protected]] has quit []
16:42:11 *** lobster_MB [[email protected]] has quit [Ping timeout: 480 seconds]
16:44:33 *** lobster [[email protected]] has quit [Ping timeout: 480 seconds]
16:45:32 *** Zorn [[email protected]] has quit [Ping timeout: 480 seconds]
16:45:46 <CIA-3> OpenTTD: rubidium * r13352 /branches/0.6/ (7 files in 6 dirs):
16:45:46 <CIA-3> OpenTTD: [0.6] -Backport from trunk (r13348, r13222, r13221, r13217):
16:45:46 <CIA-3> OpenTTD: - Fix: Industry tiles would sometimes tell they need a 'level' slope when they do not want the slope (r13348)
16:45:46 <CIA-3> OpenTTD: - Fix: Attempts to make the old AI perform better (r13217, r13221, r13222)
16:56:13 <CIA-3> OpenTTD: rubidium * r13353 /tags/0.6.1/ (12 files in 4 dirs): -Release 0.6.1.
16:57:20 *** Bjarni [[email protected]] has joined #openttd
16:57:23 *** mode/#openttd [+o Bjarni] by ChanServ
16:57:30 <dih> !B
16:57:44 <Eddi|zuHause> is this a late april's fools joke?
16:57:58 *** ProfFrink [[email protected]] has joined #openttd
16:58:17 <Eddi|zuHause> like, a june's fool?
16:58:39 <SpComb> Logs: http://zapotek.paivola.fi/~terom/logs/openttd
16:58:39 <Bjarni> !logs
16:59:05 <Bjarni> Eddi|zuHause: you mean you can get the AI to perform worse?
16:59:35 <Eddi|zuHause> who talked about AI?
17:00:04 <Eddi|zuHause> no, i mean the line after that
17:00:46 <Bjarni> oh
17:00:58 <Bjarni> wait and see :P
17:01:00 <Eddi|zuHause> (and the previous line with a similar content, which was exactly 2 months ago)
17:01:06 * Bjarni imagines that Eddi|zuHause might wait for a while
17:01:18 <Eddi|zuHause> i'm on strike, you know
17:01:22 *** Prof_Frink [[email protected]] has quit [Ping timeout: 480 seconds]
17:01:22 *** ProfFrink is now known as Prof_Frink
17:01:27 <Bjarni> you are?
17:01:32 <Bjarni> I call it fired
17:01:40 <dih> whats wrong with 0.6.1 release?
17:03:23 <Eddi|zuHause> Bjarni: yes, i will not play openttd until PBS is in ;)
17:03:49 <Bjarni> you will wait THAT many years???
17:04:05 <dih> :-P
17:04:06 <Rubidium> YARTNAY
17:04:26 <dih> Bjarni: i made a bug report for you :-P
17:04:38 <Eddi|zuHause> that almost was a palindrome :p
17:06:00 *** Pinchiukas__ [[email protected]] has joined #openttd
17:06:14 <Rubidium> YARTRAY has a similar meaning as YARTNAY
17:06:52 *** Pinchiukas_ [[email protected]] has quit [Read error: Connection reset by peer]
17:07:23 <Eddi|zuHause> i still have no idea what it should mean
17:08:05 <Rubidium> yet another reason to (not add|rejection adding) yapp
17:09:46 <Rubidium> YAЯTRAY looks even better :)
17:10:01 <Eddi|zuHause> yeah ;)
17:10:27 <Eddi|zuHause> yay for the cyrillic messengers dropping the alphabet table :p
17:10:28 <dih> out of curiosity, what is the reason?
17:10:43 *** Boyinblue0 [[email protected]] has joined #openttd
17:11:46 <peter1138> YARTNAY?
17:12:15 <peter1138> the reason is we need 0.6.1 to get used ;)
17:12:51 <dih> seriously, is it not coded by the guideline, or what is the hinderance?
17:13:20 <dih> i am not arguing, just wanting to understand :-)
17:15:38 <peter1138> basically at the moment we're all busy do other stuff
17:15:51 <peter1138> be that other changes or real-life, etc
17:16:16 <dih> hehe ;-)
17:16:23 <Rubidium> big, *ultra* complex, did not like it when I tried it
17:16:27 <Dred_furst> Pikka just did an awesome job of making the original TTD trains be able to be refitted to newindustries
17:17:08 <dih> Rubidium: code or gaming wise?
17:17:14 <hylje> YRETERY
17:17:20 <dih> peter1138: is that not a constant situation :-P
17:17:23 <Rubidium> dih: game wise
17:17:26 <dih> k
17:18:21 <Eddi|zuHause> Rubidium: why? it reduces the amount of (useful) signal types from 4 to 2
17:19:01 <dih> i am guessing it's to complex to setup a pbs area ;-)
17:19:04 <Rubidium> Eddi|zuHause: because my big station's throughput became LOWER with YAPP signals
17:19:24 <Eddi|zuHause> Rubidium: i have never actually seen your station
17:19:32 <Rubidium> it'd have gotten faster with simple TTDP-a-like PBS signals
17:20:26 <dih> where is the difference in the 2 Rubidium?
17:20:54 <peter1138> big differences, but for the better in most people's opinions
17:21:05 <Eddi|zuHause> my guess is if you get lower output, you probably have put a signal where you shouldn't have
17:21:25 <dih> i mean
17:21:42 <dih> where exactly is the difference in their approach?
17:21:55 <Eddi|zuHause> they don't allow trains going backwards
17:22:06 <dih> ttdp does not?
17:22:23 <Eddi|zuHause> only with doublesided signals
17:22:32 *** LiOn [[email protected]] has joined #openttd
17:22:36 <Eddi|zuHause> which imho causes more troubles than it solves
17:23:21 <peter1138> ttdp's pbs (and ottd's) and pre-signalling always had problems with two-way stations
17:23:36 <Eddi|zuHause> exactly
17:23:48 <peter1138> but i think ttdp got a new feaure to fix that
17:23:54 <Rubidium> dih: TTDP-PBS is more like: "don't care which exit it takes" and YAPP is more like "oh, that exit means that the route to the station is longer, so I'd better not use that exit AT ALL"
17:24:12 <dih> ah
17:24:16 <Rubidium> and then later... hmm, it's the only free exit, lets get a train to there
17:24:20 <dih> so a yapf inside the yapp
17:24:29 <Rubidium> it should've done it EARLIER
17:24:30 <Eddi|zuHause> Rubidium: that is the point... there is no such thing as an "exit signal", totally remove those
17:25:05 <Rubidium> Eddi|zuHause: then I get a 20-ish tile signal block leading to two platforms
17:25:25 <Rubidium> so the two platforms are only used like 25% of the time instead of 60-ish
17:25:25 <Eddi|zuHause> do you have a screenshot?
17:27:43 <Eddi|zuHause> but imho... ONE (rare special case) layout performing worse should not be a reason to not include yapp (because you can still do that one segment with traditional signals)
17:28:00 *** Pinchiukas_ [[email protected]] has joined #openttd
17:28:50 <Rubidium> it's kinda how I build all high capacity, litte space stations
17:29:05 <Eddi|zuHause> i still have never seen it!
17:29:29 *** Pinchiukas__ [[email protected]] has quit [Read error: Connection reset by peer]
17:29:41 <Pinchiukas_> ok now why do my trains go to the wrong service depot?
17:29:45 *** LiOn is now known as LiNo
17:30:02 <Pinchiukas_> I specify that they go to one in their schedule, and they go to another
17:30:30 <Rubidium> Eddi|zuHause: can't find the pre-YAPP savegame, there's a YAPP savegame in the YAPP thread with the problem
17:30:36 <Rubidium> but no screenshot
17:31:36 <Eddi|zuHause> "Better handling of spread out stations like the example from Rubidium." <- whatt is this about then?
17:31:59 <Rubidium> that improved it, but AFAIK did not completely solve the issue
17:35:16 <Eddi|zuHause> of course i have no version 5 YAPP...
17:39:33 <Ammler> dear devs, it seems current nightly doesn't use server pw anymore
17:39:58 <Ammler> it is set with server_pw
17:40:04 <Ammler> but you can still login without
17:40:05 <dih> r13346
17:42:13 <SmatZ> hehe
17:42:47 *** thgergo [[email protected]] has quit [Ping timeout: 480 seconds]
17:46:38 <SpComb> Logs: http://zapotek.paivola.fi/~terom/logs/openttd
17:46:38 <LiNo> !logs
17:49:08 *** Progman [[email protected]] has joined #openttd
17:49:36 <Eddi|zuHause> i have no idea why, but svn access totally chokes every few kb i get... it's like this for several months now
17:50:29 <Eddi|zuHause> if i do "svn up" i get a random amount of 2 to 10 files, and then nothing for 5 minutes
17:50:37 <Eddi|zuHause> then it suddenly decides to continue
17:50:49 *** Boyinblue0 [[email protected]] has quit []
17:50:51 <Eddi|zuHause> and this is the only svn server that shows this behaviour
17:51:15 <peter1138> works fine for me
17:51:15 <Rubidium> odd
17:51:36 <Rubidium> though svn really fails in magic ways when the internet connection isn't 100% fine
17:51:47 <Rubidium> i.e. it goes haywire when packets get lost any such
17:52:03 <peter1138> personally i set up svn over http
17:52:52 <peter1138> 'zero ballistics' really is wank
17:53:01 <Eddi|zuHause> well, this only shows with the openttd svn, and my internet connection is nowhere near full
17:55:57 <glx> @op
17:56:00 *** mode/#openttd [+o glx] by DorpsGek
17:56:10 *** glx changed the topic of #openttd to: 0.6.1 | Website: *.openttd.org (DevBlog: blog, Translator: translator2, Gameservers: servers, Nightly-builds: nightly, NightlyArchive: archive, WIKI: wiki, SVN mailinglist: maillist, Dev-docs: docs, Patches & Bug-reports: bugs) | #openttd.notice for FS + SVN notices | UTF-8 please | No Unauthorised Bots | English Only | http://bugs.openttd.org/ for all related bugs/patches
17:56:19 <glx> @deop
17:56:22 *** mode/#openttd [-o glx] by DorpsGek
17:59:09 <orudge> how exciting.
17:59:13 <orudge> hmm
17:59:23 * orudge shall probably have to install Virtual PC on XP on his Mac now to compile OS/2
17:59:31 <orudge> as OS/2 doesn't seem to want to boot in VPC2007 or VMWare on my main PC
18:00:28 *** LiNo [[email protected]] has quit [Quit: oO]
18:00:53 *** thgergo [[email protected]] has joined #openttd
18:01:18 <Bjarni> heh
18:02:19 <Bjarni> but I guess that problem is nothing against what problems VPC could produce when emulating an x86 on PPC hardware
18:02:41 <Pinchiukas_> can somebody look at my saved game and tell me why do my trains get lost all the time?
18:02:50 *** Bjarni [[email protected]] has quit [Quit: Leaving]
18:05:03 <Mchl> Rubidium: there's typo in 0.6.1 announcment. last line
18:05:17 *** Pinchiukas__ [[email protected]] has joined #openttd
18:06:43 <Mchl> hmmm... or maybe that's just alternative spelling
18:06:47 *** Pinchiukas_ [[email protected]] has quit [Read error: Connection reset by peer]
18:06:59 <Mchl> I'm used to 'therefore'
18:07:39 <ben_goodger_> no, it's incorrect
18:09:08 *** Pinchiukas_ [[email protected]] has joined #openttd
18:10:59 *** Pinchiukas__ [[email protected]] has quit [Read error: Connection reset by peer]
18:13:32 *** mikl [[email protected]] has joined #openttd
18:18:01 *** Pinchiukas__ [[email protected]] has joined #openttd
18:19:50 *** Pinchiukas_ [[email protected]] has quit [Read error: Connection reset by peer]
18:20:56 *** LA is now known as LordAzamath
18:26:10 *** dR3x4cK [[email protected]] has quit [Quit: dR3x4cK]
18:27:23 *** LordAzamath is now known as LA
18:31:06 *** Roujin [[email protected]] has joined #openttd
18:31:06 *** frosch123 [[email protected]] has quit [Read error: Connection reset by peer]
18:31:34 <Roujin> cheers
18:31:39 <Wolf01> hi
18:31:49 <Roujin> yay, 0.6.1 time :)
18:32:15 *** mikl [[email protected]] has quit [Quit: Linkinus is updating...]
18:32:18 <Wolf01> I'm waiting for the topic on the forum to post the news on my site :P
18:32:33 <Pinchiukas__> can somebody look at my saved game and tell me why do my trains get lost all the time?
18:32:37 *** mikl [[email protected]] has joined #openttd
18:32:41 <Roujin> oh btw: wiki article 0.6.1 says: "This version was released on a time in the future."
18:32:51 <Pinchiukas__> :)
18:34:43 *** LA [[email protected]] has quit [Quit: ReconnectingâŠ]
18:34:49 *** LA [[email protected]] has joined #openttd
18:35:39 * Prof_Frink gets in his TARDIS
18:35:59 * Prof_Frink goes to The Library
18:36:43 <Eddi|zuHause> *Prof_Frink has been saved*
18:37:00 <Prof_Frink> Nah, i'm cunning
18:37:07 *** LA [[email protected]] has quit []
18:37:25 <Prof_Frink> I've gone one of those 1M candle power torches
18:37:35 *** LA [[email protected]] has joined #openttd
18:37:36 *** mikl [[email protected]] has quit []
18:37:58 *** mikl [[email protected]] has joined #openttd
18:39:32 *** LA_ [[email protected]] has joined #openttd
18:40:52 *** LA is now known as Guest852
18:40:52 *** LA_ is now known as LA
18:44:12 *** [com]buster [[email protected]] has joined #openttd
18:47:06 *** Guest852 [[email protected]] has quit [Ping timeout: 480 seconds]
18:47:23 *** ben_goodger_ [[email protected]] has quit [Read error: Connection reset by peer]
18:48:11 *** Roujin [[email protected]] has quit [Ping timeout: 480 seconds]
18:50:47 *** Osai is now known as Osai`off
18:51:37 *** Osai`off is now known as Osai
18:52:52 *** DaleStan_ [[email protected]] has joined #openttd
18:52:52 *** DaleStan is now known as Guest855
18:52:53 *** DaleStan_ is now known as DaleStan
18:55:33 *** LA is now known as LordAzamath
18:58:03 *** Guest855 [[email protected]] has quit [Ping timeout: 480 seconds]
19:01:03 *** Lex [[email protected]] has joined #openttd
19:01:56 *** Lex [[email protected]] has left #openttd []
19:07:51 *** Frostregen [[email protected]] has quit [Quit: und weg]
19:09:49 <Pinchiukas__> can somebody look at my saved game and tell me why do my trains get lost all the time?
19:11:53 <Eddi|zuHause> have you ever actually provided a savegame?
19:12:20 *** LordAzamath [[email protected]] has quit [Quit: ChatZilla 0.9.82.1 [Firefox 2.0.0.14/2008040413]]
19:20:00 *** [com]buster [[email protected]] has quit [Quit: train to catch]
19:20:26 *** Backeman [[email protected]] has joined #openttd
19:20:57 <Backeman> Hi! Are you allowed to discuss gamplay-tips in here?
19:21:19 <Progman> sure
19:21:49 <Backeman> Are there any good tips on how to make a smooth crossing where you from two tracks to one with trains?
19:23:19 <Eddi|zuHause> try the openttdcoop wiki
19:23:42 <Eddi|zuHause> they have some very extensive explanations on track layout
19:24:45 <Backeman> Ã checked the wiki and it has very nice drawings of ordinary crossings. What I want is if there is any smart way to go from two tracks inot one (which render a taffic-queues).
19:25:01 <Backeman> btw, openttdcoop-wiki?
19:27:25 *** Pinchiukas_ [[email protected]] has joined #openttd
19:28:06 <Progman> http://openttdcoop.ppcis.org/wiki/index.php/Main_Page
19:29:15 *** Pinchiukas__ [[email protected]] has quit [Read error: Connection reset by peer]
19:33:54 *** Osai is now known as Osai`off
19:35:17 *** Osai`off is now known as Osai
19:36:20 <Backeman> thanks, I'll bookmark that one for sure! ;)
19:37:08 <CIA-3> OpenTTD: smatz * r13354 /trunk/src/blitter/8bpp_optimized.cpp: -Codechange: make 8bpp_optimized blitter ~25% faster in encoding and ~15% faster in drawing (depends on architecture)
19:41:00 *** krix [[email protected]] has joined #openttd
19:41:04 <krix> hey
19:41:24 *** Pikka [[email protected]] has quit []
19:41:48 <krix> just a dumb question, maybe i did not read every docs :) If i build openttd with --enable-dedicated then i got _only_ server binary ? Or i got client binary which can serve as a dedicated server ?
19:42:04 <krix> (i'm trying to package ottd thats why i'm asking)
19:43:04 <SmatZ> you will be able to run only dedicated server
19:43:11 <krix> hmm
19:43:16 <SmatZ> normal client can run dedicated server, too
19:43:21 <krix> ah
19:43:30 <krix> thx thats what i wanted to figure out :)
19:43:35 <SmatZ> openttd -D
19:44:07 <krix> and if i'm not thinking wrong, --enable-dedicated need less library depends than 'normal' compile ? (i mean less lib deps for binary?)
19:44:19 <krix> well i can figure it out with ldd tho
19:44:20 <krix> :D
19:44:51 <SmatZ> yes
19:44:59 <SmatZ> you don't need for example SDL
19:45:16 <krix> okay. ty
19:45:22 <SmatZ> you are welcome
19:46:45 <krix> maybe its a good idea to integrate some '--build-server-tooo' option for configure things ? Because if i want to package for a distro then i need to do it 'twice' :) or well not just me.
19:46:57 <krix> and maybe if its a dedicated only server then other binary name should be great
19:47:31 <krix> (or maybe not a good idea :p )
19:48:14 <SmatZ> I think it is fine that a normal build can run a server - the added code for that is minimal
19:48:27 <SmatZ> two binary names could be confusing...
19:48:39 <SmatZ> I would sat
19:48:41 <SmatZ> y+
19:49:08 *** Pinchiukas_ [[email protected]] has quit [Read error: Connection reset by peer]
19:49:24 *** Pinchiukas_ [[email protected]] has joined #openttd
19:49:33 <krix> yes maybe, but the default build gives client/server type binary so it can be openttd. But when you select --enable-dedicated you can only run dedicated server and that binary could not act like a client.
19:49:38 <krix> thats confusing i think :)
19:49:49 <Prof_Frink> It's not that hard to do make dedicated && mv openttd openttd_dedicated
19:50:00 <krix> i know its not hard
19:50:13 <krix> this is about 'just make a little more packager-friendly-thingy :)
19:52:47 *** markmc^ [[email protected]] has quit [Ping timeout: 480 seconds]
19:53:53 *** planetmaker is now known as planetmaker|away
19:55:25 <Eddi|zuHause> i'm pretty sure i asked that before, but what is the sense of town_cmd.cpp:1012?
19:55:45 <Eddi|zuHause> when a town tries to build a road, it unconditionally flattens the land
19:56:05 <Eddi|zuHause> while a town would look much more organic when it would try to build on the slope instead
19:57:08 <Eddi|zuHause> it could be made like in town_cmd.cpp:1133, where it is guarded by a "if (Chance16(1, 6))"
19:58:42 *** tokai|ni [[email protected]] has quit [Ping timeout: 480 seconds]
20:00:31 *** tokai|ni [[email protected]] has joined #openttd
20:01:56 *** Hendikins [[email protected]] has quit [Quit: Any quit message, not matter how short, is a smart arse comment to those left behind]
20:02:25 <Eddi|zuHause> even worse, it does this before even deciding if it can possibly build a road on this tile
20:03:28 *** Roujin [[email protected]] has joined #openttd
20:04:06 *** Hendikins|SRA412 is now known as Hendikins
20:06:59 *** glx [[email protected]] has quit [Quit: bye]
20:07:16 <Mchl> yeah... it looks somewhat strange, that towns grow 'tentacles' instead of adapting to whatever terrain they're on
20:08:29 *** glx [[email protected]] has joined #openttd
20:08:32 *** mode/#openttd [+v glx] by ChanServ
20:09:04 *** Roujin [[email protected]] has quit [Quit: HydraIRC -> http://www.hydrairc.com <- *I* use it, so it must be good!]
20:24:49 *** McHawk [[email protected]] has joined #openttd
20:28:00 *** DaleStan_ [[email protected]] has joined #openttd
20:28:00 *** DaleStan is now known as Guest869
20:28:00 *** DaleStan_ is now known as DaleStan
20:32:11 *** Micke- [[email protected]] has joined #openttd
20:33:30 *** Pinchiukas_ [[email protected]] has quit [Quit: pwnt]
20:35:12 *** Guest869 [[email protected]] has quit [Ping timeout: 480 seconds]
20:37:37 *** Aerandir [[email protected]] has quit [Ping timeout: 480 seconds]
20:37:37 *** Micke- is now known as Aerandir
20:38:38 *** mikl [[email protected]] has quit [Quit: mikl]
20:43:44 *** thgergo [[email protected]] has quit [Quit: Leaving.]
20:45:46 <Eddi|zuHause> # All I ever wanted
20:45:46 <Eddi|zuHause> # All I ever needed
20:45:46 <Eddi|zuHause> # Is here in my arms
20:45:46 <Eddi|zuHause> # Words are very unnecessary
20:45:46 <Eddi|zuHause> # They can only do harm
20:46:26 *** blathijs [[email protected]] has joined #openttd
20:57:39 *** markmc [[email protected]] has joined #openttd
20:57:44 *** krix [[email protected]] has left #openttd [Leaving]
21:02:45 *** Nijn [[email protected]] has quit [Quit: In the beginning, the universe was created. This made a lot of people very angry and has been widely regarded as a bad move.]
21:06:49 *** DaleStan_ [[email protected]] has joined #openttd
21:06:49 *** DaleStan is now known as Guest872
21:06:50 *** DaleStan_ is now known as DaleStan
21:13:59 *** Guest872 [[email protected]] has quit [Ping timeout: 480 seconds]
21:16:52 *** Dark_Link^ [[email protected]] has quit [Read error: Connection reset by peer]
21:17:03 *** Dark_Link^ [[email protected]] has joined #openttd
21:21:16 *** Boyinblue0 [[email protected]] has joined #openttd
21:29:54 <Wolf01> 'night
21:29:58 *** Wolf01 [[email protected]] has quit [Quit: Once again the world is quick to bury me.]
21:36:44 *** Boyinblue0 [[email protected]] has quit []
21:43:35 *** mikl [[email protected]] has joined #openttd
21:47:15 *** Dark_Link^ [[email protected]] has quit [Ping timeout: 480 seconds]
21:55:09 *** lobster_MB [[email protected]] has joined #openttd
21:55:36 *** TinoM [[email protected]] has quit [Quit: Verlassend]
21:59:51 *** mikl [[email protected]] has quit [Ping timeout: 480 seconds]
22:13:12 *** Pikka [[email protected]] has joined #openttd
22:13:24 *** Progman [[email protected]] has quit [Remote host closed the connection]
22:16:00 *** Brianetta [[email protected]] has quit [Quit: TschÃŒÃ]
22:17:16 *** Slowpoke_ [[email protected]] has quit [Remote host closed the connection]
22:19:52 *** Zealotus [[email protected]] has quit [Ping timeout: 480 seconds]
22:33:58 *** Pikka [[email protected]] has quit []
22:44:25 *** stillunknown [[email protected]] has quit [Ping timeout: 480 seconds]
22:59:38 *** Zealotus [[email protected]] has joined #openttd
23:05:51 *** DaleStan_ [[email protected]] has joined #openttd
23:05:51 *** DaleStan is now known as Guest888
23:05:51 *** DaleStan_ is now known as DaleStan
23:10:58 <Belugas> whooohou,.... depeche mode Eddi|zuHause :D
23:11:25 *** Zealotus [[email protected]] has quit [Ping timeout: 480 seconds]
23:12:48 *** Guest888 [[email protected]] has quit [Ping timeout: 480 seconds]
23:13:25 *** Osai is now known as Osai^zZz
23:23:27 *** Vikthor [[email protected]] has quit [Quit: Leaving.]
23:24:15 *** lobstar is now known as lobster
23:33:18 *** KritiK [[email protected]] has quit [Quit: Leaving]
23:37:10 *** Mchl [[email protected]] has quit [Quit: Bye]
23:39:35 *** Zahl [[email protected]] has quit [Quit: (~_~]"]
23:54:43 <Dred_furst> Where can I get hold of GRFwizard or whatever the new one is called?
23:55:24 *** Osai^zZz is now known as Osai^zZz`off
23:55:31 *** Wezz6400 [[email protected]] has quit [Quit: Caught sigterm, terminating...]
Powered by YARRSTE version: svn-trunk | {
"url": "https://webster.openttdcoop.org/?channel=openttd&date=1212278400",
"source_domain": "webster.openttdcoop.org",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "130550",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2OXI6VYF5B7U7IWTJQXM477F4G6EVGXQ",
"WARC-Concurrent-To": "<urn:uuid:4c1aa889-c6ec-4705-a64f-fcb84b3dabbe>",
"WARC-Date": "2022-05-25T04:05:14Z",
"WARC-IP-Address": "176.9.125.26",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:NFWLBKLNF7GTMYZDJIB27XT6KH5OE5K4",
"WARC-Record-ID": "<urn:uuid:362a3f99-d019-47a2-bfc9-68a64eb36115>",
"WARC-Target-URI": "https://webster.openttdcoop.org/?channel=openttd&date=1212278400",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:19bdc377-816f-44a6-a206-78c624bae86a>"
},
"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-22\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,
7,
42,
71,
169,
235,
316,
366,
455,
560,
645,
746,
841,
930,
1021,
1107,
1151,
1259,
1381,
1526,
1647,
1735,
1787,
1858,
1929,
2016,
2099,
2179,
2260,
2304,
2389,
2433,
2497,
2528,
2595,
2676,
2779,
2873,
2992,
3094,
3181,
3225,
3315,
3395,
3457,
3498,
3524,
3564,
3635,
3667,
3733,
3847,
3925,
3944,
4003,
4036,
4155,
4257,
4375,
4494,
4596,
4698,
4783,
4826,
4869,
4928,
4997,
5071,
5137,
5196,
5280,
5301,
5411,
5489,
5548,
5599,
5618,
5691,
5745,
5793,
5845,
5976,
6142,
6192,
6280,
6403,
6494,
6589,
6682,
6757,
6837,
6914,
7155,
7260,
7331,
7408,
7479,
7578,
7664,
7742,
7772,
7849,
7872,
7929,
8015,
8100,
8170,
8245,
8364,
8466,
8529,
8591,
8671,
8743,
8807,
8909,
8973,
9031,
9093,
9182,
9283,
9370,
9457,
9505,
9554,
9649,
9760,
9847,
9895,
9944,
10056,
10158,
10183,
10277,
10359,
10408,
10511,
10552,
10617,
10670,
10716,
10757,
10860,
10911,
11012,
11043,
11120,
11178,
11225,
11289,
11331,
11359,
11382,
11406,
11428,
11591,
11667,
11718,
11751,
11811,
11865,
11949,
12016,
12060,
12137,
12193,
12263,
12311,
12369,
12522,
12719,
12889,
12969,
13100,
13167,
13256,
13278,
13418,
13503,
13564,
13644,
13694,
13765,
13808,
13856,
13917,
13963,
14080,
14167,
14258,
14317,
14545,
14644,
14698,
14750,
14813,
14870,
14926,
14977,
15000,
15249,
15289,
15419,
15456,
15575,
15685,
15787,
15886,
15955,
16193,
16219,
16276,
16320,
16393,
16521,
16599,
16754,
16841,
16902,
17023,
17252,
17463,
17584,
17663,
17786,
17856,
17907,
17964,
18049,
18194,
18390,
18484,
18587,
18786,
18948,
19011,
19075,
19163,
19253,
19345,
19464,
19566,
19653,
19701,
19750,
19869,
19984,
20086,
20213,
20309,
20411,
20524,
20627,
20737,
20838,
20888,
20932,
21025,
21113,
21356,
21500,
21524,
21639,
21710,
21799,
21991,
22058,
22185,
22229,
22270,
22357,
22425,
22520,
22599,
22694,
22742,
22791,
22861,
22930,
23026,
23129,
23243,
23332,
23419,
23507,
23575,
23672,
23741,
23837,
23911,
23977,
24056,
24124,
24219,
24315,
24388,
24467,
24564,
24606,
24643,
24728,
24824,
24893,
24962,
25058,
25208,
25289,
25408,
25510,
25615,
25678,
25751,
25798,
25852,
25911,
25952,
25987,
26049,
26082,
26150,
26225,
26261,
26329,
26426,
26495,
26591,
26663,
26707,
26771,
26812,
26832,
26890,
26912,
26957,
26977,
27045,
27142,
27222,
27308,
27377,
27473,
27557,
27633,
27703,
27809,
27877,
27974,
28066,
28111,
28187,
28262,
28331,
28423,
28473,
28577,
28663,
28754,
28835,
28923,
29060,
29162,
29258,
29324,
29376,
29395,
29455,
29532,
29578,
29649,
29674,
29753,
29799,
29855,
29877,
29912,
30016,
30085,
30134,
30229,
30280,
30308,
30343,
30391,
30472,
30524,
30544,
30573,
30629,
30686,
30755,
30817,
30913,
30979,
31054,
31105,
31138,
31226,
31280,
31354,
31385,
31450,
31538,
31603,
31679,
31741,
31766,
31841,
31968,
32015,
32041,
32105,
32141,
32159,
32258,
32328,
32430,
32505,
32586,
32645,
32729,
32847,
32870,
32937,
33002,
33033,
33088,
33165,
33237,
33344,
33377,
33445,
33651,
33670,
33765,
33807,
33857,
33978,
34076,
34171,
34222,
34419,
34487,
34571,
34624,
34721,
34800,
34840,
34936,
35065,
35104,
35231,
35315,
35378,
35463,
35507,
35558,
35581,
35604,
35705,
35776,
35799,
35879,
36014,
36127,
36189,
36255,
36338,
36378,
36403,
36507,
36580,
36636,
36691,
36808,
36828,
36877,
37305,
37327,
37376,
37409,
37432,
37530,
37621,
37698,
37782,
37805,
37938,
38049,
38120,
38192,
38261,
38328,
38424,
38465,
38509,
38577,
38674,
38746,
38815,
38911,
38956,
39041,
39086,
39167,
39282,
39308,
39330,
39368,
39461,
39550,
39662,
39734,
39839,
39867,
39958,
40036,
40078,
40121,
40174,
40214,
40284,
40354,
40427,
40491,
40563,
40637,
40679,
40716,
40806,
40902,
41032,
41130,
41174,
41218,
41305,
41353,
41402,
41447,
41558,
41638,
41719,
41818,
41930,
41999,
42127,
42229,
42306,
42380,
42405,
42529,
42579,
42663,
42861,
42905,
42973,
43047,
43144,
43188,
43232,
43297,
43496,
43579,
43600,
43681,
43895,
43962,
44026,
44047,
44109,
44129,
44187,
44216,
44368,
44423,
44443,
44465,
44514,
44540,
44574,
44778,
44875,
44923,
45034,
45091,
45121,
45142,
45238,
45306,
45528,
45572,
45667,
45704,
45788,
45881,
45940,
46046,
46143,
46258,
46374,
46473,
46555,
46716,
46832,
46913,
46970,
47053,
47184,
47266,
47315,
47465,
47541,
47628,
47676,
47725,
47814,
47884,
47987,
48095,
48141,
48215,
48305,
48350,
48395,
48441,
48495,
48544,
48633,
48708,
48799,
48999,
49086,
49134,
49183,
49286,
49390,
49466,
49540,
49566,
49707,
49773,
49845,
49938,
50010,
50088,
50177,
50266,
50371,
50479,
50599,
50703,
50784,
50889,
50976,
51071,
51119,
51168,
51231,
51335,
51438,
51482,
51557,
51603,
51693,
51771,
51852,
51944,
51996,
52109,
52110
],
"line_end_idx": [
7,
42,
71,
169,
235,
316,
366,
455,
560,
645,
746,
841,
930,
1021,
1107,
1151,
1259,
1381,
1526,
1647,
1735,
1787,
1858,
1929,
2016,
2099,
2179,
2260,
2304,
2389,
2433,
2497,
2528,
2595,
2676,
2779,
2873,
2992,
3094,
3181,
3225,
3315,
3395,
3457,
3498,
3524,
3564,
3635,
3667,
3733,
3847,
3925,
3944,
4003,
4036,
4155,
4257,
4375,
4494,
4596,
4698,
4783,
4826,
4869,
4928,
4997,
5071,
5137,
5196,
5280,
5301,
5411,
5489,
5548,
5599,
5618,
5691,
5745,
5793,
5845,
5976,
6142,
6192,
6280,
6403,
6494,
6589,
6682,
6757,
6837,
6914,
7155,
7260,
7331,
7408,
7479,
7578,
7664,
7742,
7772,
7849,
7872,
7929,
8015,
8100,
8170,
8245,
8364,
8466,
8529,
8591,
8671,
8743,
8807,
8909,
8973,
9031,
9093,
9182,
9283,
9370,
9457,
9505,
9554,
9649,
9760,
9847,
9895,
9944,
10056,
10158,
10183,
10277,
10359,
10408,
10511,
10552,
10617,
10670,
10716,
10757,
10860,
10911,
11012,
11043,
11120,
11178,
11225,
11289,
11331,
11359,
11382,
11406,
11428,
11591,
11667,
11718,
11751,
11811,
11865,
11949,
12016,
12060,
12137,
12193,
12263,
12311,
12369,
12522,
12719,
12889,
12969,
13100,
13167,
13256,
13278,
13418,
13503,
13564,
13644,
13694,
13765,
13808,
13856,
13917,
13963,
14080,
14167,
14258,
14317,
14545,
14644,
14698,
14750,
14813,
14870,
14926,
14977,
15000,
15249,
15289,
15419,
15456,
15575,
15685,
15787,
15886,
15955,
16193,
16219,
16276,
16320,
16393,
16521,
16599,
16754,
16841,
16902,
17023,
17252,
17463,
17584,
17663,
17786,
17856,
17907,
17964,
18049,
18194,
18390,
18484,
18587,
18786,
18948,
19011,
19075,
19163,
19253,
19345,
19464,
19566,
19653,
19701,
19750,
19869,
19984,
20086,
20213,
20309,
20411,
20524,
20627,
20737,
20838,
20888,
20932,
21025,
21113,
21356,
21500,
21524,
21639,
21710,
21799,
21991,
22058,
22185,
22229,
22270,
22357,
22425,
22520,
22599,
22694,
22742,
22791,
22861,
22930,
23026,
23129,
23243,
23332,
23419,
23507,
23575,
23672,
23741,
23837,
23911,
23977,
24056,
24124,
24219,
24315,
24388,
24467,
24564,
24606,
24643,
24728,
24824,
24893,
24962,
25058,
25208,
25289,
25408,
25510,
25615,
25678,
25751,
25798,
25852,
25911,
25952,
25987,
26049,
26082,
26150,
26225,
26261,
26329,
26426,
26495,
26591,
26663,
26707,
26771,
26812,
26832,
26890,
26912,
26957,
26977,
27045,
27142,
27222,
27308,
27377,
27473,
27557,
27633,
27703,
27809,
27877,
27974,
28066,
28111,
28187,
28262,
28331,
28423,
28473,
28577,
28663,
28754,
28835,
28923,
29060,
29162,
29258,
29324,
29376,
29395,
29455,
29532,
29578,
29649,
29674,
29753,
29799,
29855,
29877,
29912,
30016,
30085,
30134,
30229,
30280,
30308,
30343,
30391,
30472,
30524,
30544,
30573,
30629,
30686,
30755,
30817,
30913,
30979,
31054,
31105,
31138,
31226,
31280,
31354,
31385,
31450,
31538,
31603,
31679,
31741,
31766,
31841,
31968,
32015,
32041,
32105,
32141,
32159,
32258,
32328,
32430,
32505,
32586,
32645,
32729,
32847,
32870,
32937,
33002,
33033,
33088,
33165,
33237,
33344,
33377,
33445,
33651,
33670,
33765,
33807,
33857,
33978,
34076,
34171,
34222,
34419,
34487,
34571,
34624,
34721,
34800,
34840,
34936,
35065,
35104,
35231,
35315,
35378,
35463,
35507,
35558,
35581,
35604,
35705,
35776,
35799,
35879,
36014,
36127,
36189,
36255,
36338,
36378,
36403,
36507,
36580,
36636,
36691,
36808,
36828,
36877,
37305,
37327,
37376,
37409,
37432,
37530,
37621,
37698,
37782,
37805,
37938,
38049,
38120,
38192,
38261,
38328,
38424,
38465,
38509,
38577,
38674,
38746,
38815,
38911,
38956,
39041,
39086,
39167,
39282,
39308,
39330,
39368,
39461,
39550,
39662,
39734,
39839,
39867,
39958,
40036,
40078,
40121,
40174,
40214,
40284,
40354,
40427,
40491,
40563,
40637,
40679,
40716,
40806,
40902,
41032,
41130,
41174,
41218,
41305,
41353,
41402,
41447,
41558,
41638,
41719,
41818,
41930,
41999,
42127,
42229,
42306,
42380,
42405,
42529,
42579,
42663,
42861,
42905,
42973,
43047,
43144,
43188,
43232,
43297,
43496,
43579,
43600,
43681,
43895,
43962,
44026,
44047,
44109,
44129,
44187,
44216,
44368,
44423,
44443,
44465,
44514,
44540,
44574,
44778,
44875,
44923,
45034,
45091,
45121,
45142,
45238,
45306,
45528,
45572,
45667,
45704,
45788,
45881,
45940,
46046,
46143,
46258,
46374,
46473,
46555,
46716,
46832,
46913,
46970,
47053,
47184,
47266,
47315,
47465,
47541,
47628,
47676,
47725,
47814,
47884,
47987,
48095,
48141,
48215,
48305,
48350,
48395,
48441,
48495,
48544,
48633,
48708,
48799,
48999,
49086,
49134,
49183,
49286,
49390,
49466,
49540,
49566,
49707,
49773,
49845,
49938,
50010,
50088,
50177,
50266,
50371,
50479,
50599,
50703,
50784,
50889,
50976,
51071,
51119,
51168,
51231,
51335,
51438,
51482,
51557,
51603,
51693,
51771,
51852,
51944,
51996,
52109,
52110,
52147
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 52147,
"ccnet_original_nlines": 668,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16696785390377045,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013360010460019112,
"rps_doc_frac_lines_end_with_ellipsis": 0.008968610316514969,
"rps_doc_frac_no_alph_words": 0.5612494945526123,
"rps_doc_frac_unique_words": 0.3010718822479248,
"rps_doc_mean_word_length": 5.919924259185791,
"rps_doc_num_sentences": 1082,
"rps_doc_symbol_to_word_ratio": 0.011230150237679482,
"rps_doc_unigram_entropy": 6.3177361488342285,
"rps_doc_word_count": 6344,
"rps_doc_frac_chars_dupe_10grams": 0.03538715839385986,
"rps_doc_frac_chars_dupe_5grams": 0.25852060317993164,
"rps_doc_frac_chars_dupe_6grams": 0.1471668928861618,
"rps_doc_frac_chars_dupe_7grams": 0.09785386919975281,
"rps_doc_frac_chars_dupe_8grams": 0.07868249714374542,
"rps_doc_frac_chars_dupe_9grams": 0.03922142833471298,
"rps_doc_frac_chars_top_2gram": 0.02516241930425167,
"rps_doc_frac_chars_top_3gram": 0.05580998957157135,
"rps_doc_frac_chars_top_4gram": 0.016615189611911774,
"rps_doc_books_importance": -4868.7890625,
"rps_doc_books_importance_length_correction": -4868.7890625,
"rps_doc_openwebtext_importance": -3802.0615234375,
"rps_doc_openwebtext_importance_length_correction": -3802.0615234375,
"rps_doc_wikipedia_importance": -3387.656494140625,
"rps_doc_wikipedia_importance_length_correction": -3387.656494140625
},
"fasttext": {
"dclm": 0.054119229316711426,
"english": 0.8137443661689758,
"fineweb_edu_approx": 1.230553388595581,
"eai_general_math": 0.10646426677703857,
"eai_open_web_math": 0.15559256076812744,
"eai_web_code": 0.03374249115586281
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "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": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-4,721,895,293,563,134,000 | Jump to content
yojoedude
$25 Donor
• Content count
426
• Joined
• Last visited
• Days Won
1
• Feedback
100%
Everything posted by yojoedude
1. whats best bot to run 10x bots
Botting is a very competitive field, people who are successful tend to stay that was by keeping their methods private. The best thing you can do is read through forums and come up with your own methods. Best of luck.
2. [Beta] Mute's Slayer
It's free, quit whining. If it was fully operational with all the masters and options and running perfect it would be premium. Enjoy it while you can!
3. 2/3 tick scripts
It wouldnt be something you could run extensively even if it was made. Very few players can do it consistently for long periods.
4. Simulating off-screen activity with mouse
I think this would be a much more believable mouse movement pattern. You mouse would never return straight from where it left.
5. Anybody else not get banned after weekend botting?
Yup, you also get human like mouse movements and proxy abilities.
6. Anybody else not get banned after weekend botting?
Might as well wait until you can afford VIP-E, makes a big difference
7. DIfferent devices, same network
Socks5proxies.net has been excellent for me. Great customer service. Buy with btc for a better deal!
8. Problem with purchasing credits
You can still try buying directly from tribot with btc, whether you get it from selling rsgp or buy from coinbase.
9. Problem with purchasing credits
Unfortunately, at the moment, there is no way to get unflagged once you're marked as fraudulent. For now, you can try purchasing credits via Bitcoin (Coinbase is highly recommended if you're in Canada or the US), trying an alternative payment processor (such as PayPal or Stripe) or purchasing from someone in the third party market. Users in the market sell credits for PayPal, Runescape Gold, etc. Some resellers include: @erickho123 (a TRiBot Moderator who has an automated system for transferring credits); @Flax (a TRiBot Moderator); @Arctic (an extremely trusted market guru, hundreds of feedback on PowerBot and here) or @YoHoJo (a TRiBot super moderator who transfers credits on his site). Some common reasons for getting marked as fraud are: * Your IP address location changing dramatically * Your IP location differing from your registered credit card address * Attempting to pay using a proxy/VPS/VPN Users in the market sell credits for PayPal, Runescape Gold, etc
10. cant open tribot look
Use the link I provided and download the jdk-8u111 that is appropriate for your computer. Once done be sure you select it when starting tribot (java options on the initial startup screen)
11. Is your CPU ever reaching 100%? I thought it was determined that the "login bug" is simply a side effect of an overloaded CPU. Iv never once encountered it, and I only run lg.
12. cant open tribot look
That looks like the error I get if I don't have the proper java installed. Maybe try selecting the new java you have just installed in the java selector? That and be sure you have the latest jdk java. http://www.oracle.com/technetwork/java/javase/downloads/jdk8-downloads-2133151.html
13. POSSIBLE REFUND?
Did you contact the scripter? Being prompt is essential as they have no responsibility to refund you.
14. Connection Timed Out
The bot doesnt need to be loaded with the proxies you have gotten. Load tribot normally, then input your proxy information in proxy editor (Be very careful everything is typed out just right and hit save. Then open your client, and right click on the tab and select proxy. This method works for all normal clients and LG, and its very easy to tell if the proxy is working, because if something is typed wrong or the proxy is down you cant use the world selector (bottom left of login screen) or login at all. Be sure you create your accounts with the proxy before using them though or they wont have any effect (Created on your home IP is just as bad as botting them on your home IP)
15. Human Mouse Movements?
VIP-e offers proxy usage, mouse movement and looking glass. Well worth the 2 extra credits a month in my opinion!
16. POSSIBLE REFUND?
You can contact the scripter directly - they sometimes offer refund as long as it's been less then 24h and not used extensively
17. trying to payfor vip
Unfortunately, at the moment, there is no way to get unflagged once you're marked as fraudulent. For now, you can try purchasing credits via Bitcoin (Coinbase is highly recommended if you're in Canada or the US), trying an alternative payment processor (such as PayPal or Stripe) or purchasing from someone in the third party market. Users in the market sell credits for PayPal, Runescape Gold, etc. Some resellers include: @erickho123 (a TRiBot Moderator who has an automated system for transferring credits); @Flax (a TRiBot Moderator); @Arctic (an extremely trusted market guru, hundreds of feedback on PowerBot and here) or @YoHoJo (a TRiBot super moderator who transfers credits on his site). Some common reasons for getting marked as fraud are: * Your IP address location changing dramatically * Your IP location differing from your registered credit card address * Attempting to pay using a proxy/VPS/VPN Users in the market sell credits for PayPal, Runescape Gold, etc
18. You can use tribot client with looking glass to play the accounts on different proxies. With the tribot client you can run a different proxy on every lg client. You can test if it's working by creating a fake Proxy on tribot (random numbers) and enable it on your lg- try to use the change world option or login and it won't work. Enable your real proxy and it will proving its active. You need to create the accounts on the proxy and you can use either maxthon or WideCap!
19. You always want to use your proxy when on the account. You don't want it linked with your home IP as it can risk your main account. You should be able to use both laptops like you say, but you can also use the tribot client to play the bots with different proxies and just not run a script on it.
20. What's The Point Of Paying For Proxies
If you only bot one account and have never used your Home IP to bot before, a proxy will do absolutely nothing to help. However, if you have more then that spreading them over proxies will reduce chain bans. So instead of let's say 6 bots being banned Because they share a proxy 1 is banned and the others live on. Also if you run a bot farm from your home IP, before long it will be flagged. You can change your home IP but it doesn't help with the chain ban. You run 30 bots on 30 different proxies, or 30 on your home IP and see which has a higher overall ban rate.
21. What's The Point Of Paying For Proxies
Proxies do reduce ban rates. They keep your IP from being flagged, and reduce chain bans. Also VIP-e gives you access to LG which you should look into if your having more bans then you would like.
22. What you can do is use the program WideCap to proxy your osbuddy/Firefox to do your hand training before sending them onto tribot. However you can only have 1 proxy per program this way. You could have a proxy on Firefox and a different one on osbuddy. private proxies are usually rent for 30 days and they are priced differently for every seller. I k ow socks5proxies.net offers cheaper rates if paying with btc!
23. Account locking w/ proxy use
Use WideCap and proxy your normal browser
24. BUYING RS07 GP
Yeah no worries if you buy before I'm home, but il shoot you a message when I'm home!
25. BUYING RS07 GP
PayPal is a highly risky thing if your not a trusted an established member of the forums. Coinbase is very very easy to setup and makes the transactions much safer. On a side note I would be able to sell you the gold later today if your interested. The Id is helpful but I can't see many people selling for PayPal.
× | {
"url": "https://tribot.org/forums/profile/353043-yojoedude/?do=content&page=5",
"source_domain": "tribot.org",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "120291",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XB4GYXT4V7LS7C5ACNKJH72QWC3W7JFY",
"WARC-Concurrent-To": "<urn:uuid:b0d9e864-8d1f-45ef-8768-3ec03bfff41f>",
"WARC-Date": "2018-03-24T08:03:45Z",
"WARC-IP-Address": "104.20.64.240",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RDJE3F7XY7MTPVWYPOTVAQHL4OJFPCWT",
"WARC-Record-ID": "<urn:uuid:b5d5db81-109f-4796-8dd0-8ddeaef4a239>",
"WARC-Target-URI": "https://tribot.org/forums/profile/353043-yojoedude/?do=content&page=5",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fb7827b7-b7f8-40ee-a835-b152360412b8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-229-203-126.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,
16,
17,
27,
28,
38,
56,
57,
65,
76,
77,
94,
95,
108,
109,
115,
128,
129,
138,
139,
170,
171,
207,
208,
429,
455,
456,
611,
633,
634,
767,
814,
815,
946,
1002,
1003,
1073,
1129,
1130,
1204,
1241,
1242,
1347,
1384,
1385,
1504,
1541,
1542,
2523,
2551,
2552,
2744,
2926,
2954,
2955,
3244,
3267,
3268,
3374,
3401,
3402,
4090,
4119,
4120,
4238,
4261,
4262,
4394,
4421,
4422,
5403,
5883,
6186,
6231,
6232,
6805,
6850,
6851,
7052,
7472,
7507,
7508,
7554,
7575,
7576,
7666,
7687,
7688,
8007
],
"line_end_idx": [
16,
17,
27,
28,
38,
56,
57,
65,
76,
77,
94,
95,
108,
109,
115,
128,
129,
138,
139,
170,
171,
207,
208,
429,
455,
456,
611,
633,
634,
767,
814,
815,
946,
1002,
1003,
1073,
1129,
1130,
1204,
1241,
1242,
1347,
1384,
1385,
1504,
1541,
1542,
2523,
2551,
2552,
2744,
2926,
2954,
2955,
3244,
3267,
3268,
3374,
3401,
3402,
4090,
4119,
4120,
4238,
4261,
4262,
4394,
4421,
4422,
5403,
5883,
6186,
6231,
6232,
6805,
6850,
6851,
7052,
7472,
7507,
7508,
7554,
7575,
7576,
7666,
7687,
7688,
8007,
8008
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8008,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41343826055526733,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028450360521674156,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16767553985118866,
"rps_doc_frac_unique_words": 0.354347825050354,
"rps_doc_mean_word_length": 4.48913049697876,
"rps_doc_num_sentences": 100,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.594159126281738,
"rps_doc_word_count": 1380,
"rps_doc_frac_chars_dupe_10grams": 0.25246167182922363,
"rps_doc_frac_chars_dupe_5grams": 0.2760290503501892,
"rps_doc_frac_chars_dupe_6grams": 0.2760290503501892,
"rps_doc_frac_chars_dupe_7grams": 0.2760290503501892,
"rps_doc_frac_chars_dupe_8grams": 0.2660209834575653,
"rps_doc_frac_chars_dupe_9grams": 0.25246167182922363,
"rps_doc_frac_chars_top_2gram": 0.014527849853038788,
"rps_doc_frac_chars_top_3gram": 0.011299439705908298,
"rps_doc_frac_chars_top_4gram": 0.010330909863114357,
"rps_doc_books_importance": -612.0211181640625,
"rps_doc_books_importance_length_correction": -612.0211181640625,
"rps_doc_openwebtext_importance": -426.68292236328125,
"rps_doc_openwebtext_importance_length_correction": -426.68292236328125,
"rps_doc_wikipedia_importance": -292.22216796875,
"rps_doc_wikipedia_importance_length_correction": -292.22216796875
},
"fasttext": {
"dclm": 0.2537860870361328,
"english": 0.943045437335968,
"fineweb_edu_approx": 1.2198032140731812,
"eai_general_math": 0.017889080569148064,
"eai_open_web_math": 0.07332885265350342,
"eai_web_code": 0.024536190554499626
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,920,023,115,040,714,000 | HomeGuidesReferenceLearn
Errors and warnings
Learn about Redbox errors and stack traces in your Expo project.
When developing an application using Expo, you'll encounter a Redbox error or Yellowbox warning. These logging experiences are provided by LogBox in React Native.
Redbox error and Yellowbox warning
A Redbox error is displayed when a fatal error prevents your app from running. A Yellowbox warning is displayed to inform you that there is a possible issue and you should probably resolve it before shipping your app.
You can also create warnings and errors on your own with console.warn("Warning message") and console.error("Error message"). Another way to trigger the redbox is to throw an error and not catch it: throw Error("Error message").
This is a brief introduction to debugging a React Native app with Expo CLI. For in-depth information, see Debugging.
Stack traces
When you encounter an error during development, you'll see the error message and a stack trace, which is a report of the recent calls your application made when it crashed. This stack trace is shown both in your terminal and the Expo Go app or if you have created a development build.
This stack trace is extremely valuable since it gives you the location of the error's occurrence. For example, in the following image, the error comes from the file HomeScreen.js and is caused on line 7 in that file.
An example of a stack trace in a React Native app.
When you look at that file, on line 7, you will see that a variable called renderDescription is referenced. The error message describes that the variable is not found because the variable is not declared in HomeScreen.js. This is a typical example of how helpful error messages and stack traces can be if you take the time to decipher them.
Debugging errors is one of the most frustrating but satisfying parts of development. Remember that you're never alone. The Expo community and the React and React Native communities are great resources for help when you get stuck. There's a good chance someone else has run into your exact error. Make sure to read the documentation, search the forums, GitHub issues, and Stack Overflow. | {
"url": "https://docs.expo.dev/debugging/errors-and-warnings/",
"source_domain": "docs.expo.dev",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "84024",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K6E7QOBBVGI4RDLYUZM6NFQ4X3J7VVUC",
"WARC-Concurrent-To": "<urn:uuid:a436c29b-9084-482b-a51a-775c00db594a>",
"WARC-Date": "2023-12-08T05:17:28Z",
"WARC-IP-Address": "18.160.41.129",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SCYSTLVWTBMZRZC5TWDZOZFVVLTL3WYN",
"WARC-Record-ID": "<urn:uuid:0744ea14-fa66-4c2d-90cf-73391062cb3a>",
"WARC-Target-URI": "https://docs.expo.dev/debugging/errors-and-warnings/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:71809135-1dd5-489c-8cb4-10d4191cfb8b>"
},
"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-11\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
25,
26,
46,
47,
112,
113,
114,
277,
278,
313,
314,
532,
533,
761,
762,
879,
880,
893,
894,
1179,
1180,
1397,
1398,
1449,
1450,
1791,
1792
],
"line_end_idx": [
25,
26,
46,
47,
112,
113,
114,
277,
278,
313,
314,
532,
533,
761,
762,
879,
880,
893,
894,
1179,
1180,
1397,
1398,
1449,
1450,
1791,
1792,
2178
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2178,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4265402853488922,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007108999881893396,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11848340928554535,
"rps_doc_frac_unique_words": 0.4653739631175995,
"rps_doc_mean_word_length": 4.842105388641357,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.672318935394287,
"rps_doc_word_count": 361,
"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.025171620771288872,
"rps_doc_frac_chars_top_3gram": 0.01601831056177616,
"rps_doc_frac_chars_top_4gram": 0.017162470147013664,
"rps_doc_books_importance": -123.93590545654297,
"rps_doc_books_importance_length_correction": -123.93590545654297,
"rps_doc_openwebtext_importance": -73.4908447265625,
"rps_doc_openwebtext_importance_length_correction": -73.4908447265625,
"rps_doc_wikipedia_importance": -37.87152099609375,
"rps_doc_wikipedia_importance_length_correction": -37.87152099609375
},
"fasttext": {
"dclm": 0.470792293548584,
"english": 0.9125674366950989,
"fineweb_edu_approx": 2.727433204650879,
"eai_general_math": 0.8574859499931335,
"eai_open_web_math": 0.12968987226486206,
"eai_web_code": 0.9837737083435059
}
} | {
"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": "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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,231,745,861,027,756,500 | Kiddle - Search Engine For Children Kids Google Online Academy
Kiddle - Search Engine For Children Kids Google Online Academy...
Kiddle , A Safer Search Engine for Children
If you are going to permit your young child to search online, then the Kiddle search engine is the one to use. It is very child friendly and blocks inappropriate content allowing for a safer Online experience for your child....
Kiddle - visual search engine for kids, powered by Google
Recorded with ScreenCastify (https://www.screencastify.com), the screen video recorder for Chrome...
What is Google PageRank? (Google search engine)
http://www.morefreevideos.org - What is Google PageRank? How does Google calculate this core link algorithm that began the Google empire back in 1998?...
What Is The Algorithm For Google Search Engine?
Pagerank (pr) is an algorithm used by google search to rank websites in their engine results. They take these ideas and run 22 feb 2010 but over the past five years, a slew of companies have challenged google's central premise that single search engi......
What Is The Algorithm For Google Search Engine?
Pagerank (pr) is an algorithm used by google search to rank websites in their engine results. They take these ideas and run 22 feb 2010 but over the past five years, a slew of companies have challenged google's central premise that single search engi......
What Is A Search Engine And What Does It Do?
How do web search engines work? Webopedia. How does google search work? Youtube. 17 apr 2013 and while search engines have changed a lot since, the underlying principles that's pretty much a small scale version of what google does here is a basic bre......
What is a Search Engine and What does it do?
Everyone who looks up marketing online will inevitably come accross SEO or Search Engine Optimisation. But what is a search engine and why does it need to be optimised? Check out the video. Don't forget to subscrie so you can keep up with more inf......
kiddle - Safe Search Engine For Kids
Google Safe Search Engine For Kids.Follow Our Blog From Here - http://bit.ly/2h7sKZfRead Full Content On Blog Here - http://bit.ly/2iaPdRgGoogle is introducing for kids names as Kiddle Search Engine for Kids . It uses the safe search sites and family......
What is SEARCH ENGINE SCRAPING? What does SEARCH ENGINE SCRAPING mean?
What is SEARCH ENGINE SCRAPING? What does SEARCH ENGINE SCRAPING mean? SEARCH ENGINE SCRAPING meaning - SEARCH ENGINE SCRAPING definition - SEARCH ENGINE SCRAPING explanation.Source: Wikipedia.org article, adapted under https://creativecommons.org/li......
What is NETWORK SEARCH ENGINE? What does NETWORK SEARCH ENGINE mean?
What is NETWORK SEARCH ENGINE? What does NETWORK SEARCH ENGINE mean? NETWORK SEARCH ENGINE meaning - NETWORK SEARCH ENGINE definition - NETWORK SEARCH ENGINE explanation.Source: Wikipedia.org article, adapted under https://creativecommons.org/license......
What is ARCHIE SEARCH ENGINE? What does ARCHIE SEARCH ENGINE mean? ARCHIE SEARCH ENGINE meaning
What is ARCHIE SEARCH ENGINE? What does ARCHIE SEARCH ENGINE mean? ARCHIE SEARCH ENGINE meaning - ARCHIE SEARCH ENGINE definition - ARCHIE SEARCH ENGINE explanation.Source: Wikipedia.org article, adapted under https://creativecommons.org/licenses/.........
Google Search Engine Algorithms | How does Google search Works | Search Engine Algorithms
http://wscubetech.com/Search Engine Algorithm is the Ranking Algorithm that analyzes a website and assigns a page rank in the search engine result page. The Google Algorithm changes its ranking algorithm frequently. In this video tutorial, we have di......
What is a Search Engine and How does it work?
Everyone who looks up marketing online will inevitably come accross SEO or Search Engine Optimisation. But what is a search engine and why does it need to be optimised? Check out the video. Don't forget to subscrie so you can keep up with more inf......
What Is A Search Engine And How Does It Work?
https://goo.gl/6U6t22 - Subscribe For more Videos !For more Health Tips | Like | Comment | Share:Thank you for watching Our videos:▷ CONNECT with us!! #HealthDiaries► YOUTUBE - https://goo.gl/6U6t22► Facebook - https://goo.gl/uTP7zG► Twitter - https:......
Kiddle | Safe visual search engine for kids
1) Safe search: sites appearing in Kiddle search results satisfy family friendly requirements, as we filter sites with explicit or deceptive content.2) Kids-oriented results: the boxes below illustrate how Kiddle returns results for each query (in th......
What is a Google Search Algorithm? How Does it Work?
Google 101 Basics: Learn and Understand the Internal Process of How Google "FIND" Your Search Results Within 2 minutes and find out the connection between Google Search and Cup-Cakes.http://thevisualcube.com/...
New Paradigm For Google Search Engine
Pillai Center http://www.pillaicenter.comFREE download: Audio of This Video: http://www.pillaicenter.com/UserFiles...Join Dr. Pillai's MidBrain Assisted Search Group online here:https://www.facebook.com/groups/DrPil...Google Search Paradigm ChangeIn......
What is SEO and How does it Work, What is Search Engine Optimization
SEO, search engine optimization, seo tutorial for beginners, what is seo, what is seo and how does it work, what is search engine optimization, seo tutorial in English, search engine optimization in English, search engine optimization tutorial for be...... | {
"url": "https://savetubevideo.com/new-search-engine-kiddle-is-like-google-for-children-heres-what-it-does.html",
"source_domain": "savetubevideo.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "948627",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GPGDHTLMVHNCO47WKFGNQBXMGOQDFIXN",
"WARC-Concurrent-To": "<urn:uuid:59f20fbe-2a20-4692-be89-b7e8f0fff747>",
"WARC-Date": "2020-01-23T16:35:16Z",
"WARC-IP-Address": "62.112.8.62",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DCZWTGVR3VC2XYRDNI65QT6NP2T7HUKE",
"WARC-Record-ID": "<urn:uuid:2781a733-e9d3-4d5d-8786-3aa66f691665>",
"WARC-Target-URI": "https://savetubevideo.com/new-search-engine-kiddle-is-like-google-for-children-heres-what-it-does.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:88de5bbf-8eb8-497d-9b85-b8be966166ca>"
},
"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-196.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,
129,
173,
401,
459,
560,
608,
762,
810,
1067,
1115,
1372,
1417,
1674,
1719,
1973,
2010,
2267,
2338,
2595,
2664,
2921,
3017,
3274,
3364,
3621,
3667,
3921,
3967,
4224,
4268,
4525,
4578,
4790,
4828,
5084,
5153
],
"line_end_idx": [
63,
129,
173,
401,
459,
560,
608,
762,
810,
1067,
1115,
1372,
1417,
1674,
1719,
1973,
2010,
2267,
2338,
2595,
2664,
2921,
3017,
3274,
3364,
3621,
3667,
3921,
3967,
4224,
4268,
4525,
4578,
4790,
4828,
5084,
5153,
5409
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5409,
"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.2407582849264145,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07203791290521622,
"rps_doc_frac_lines_end_with_ellipsis": 0.5,
"rps_doc_frac_no_alph_words": 0.1971563994884491,
"rps_doc_frac_unique_words": 0.3164556920528412,
"rps_doc_mean_word_length": 5.413924217224121,
"rps_doc_num_sentences": 91,
"rps_doc_symbol_to_word_ratio": 0.03507108986377716,
"rps_doc_unigram_entropy": 4.721369743347168,
"rps_doc_word_count": 790,
"rps_doc_frac_chars_dupe_10grams": 0.38110825419425964,
"rps_doc_frac_chars_dupe_5grams": 0.45756369829177856,
"rps_doc_frac_chars_dupe_6grams": 0.40916529297828674,
"rps_doc_frac_chars_dupe_7grams": 0.40916529297828674,
"rps_doc_frac_chars_dupe_8grams": 0.38110825419425964,
"rps_doc_frac_chars_dupe_9grams": 0.38110825419425964,
"rps_doc_frac_chars_top_2gram": 0.14309094846248627,
"rps_doc_frac_chars_top_3gram": 0.028057049959897995,
"rps_doc_frac_chars_top_4gram": 0.018237080425024033,
"rps_doc_books_importance": -425.3599853515625,
"rps_doc_books_importance_length_correction": -425.3599853515625,
"rps_doc_openwebtext_importance": -249.0242462158203,
"rps_doc_openwebtext_importance_length_correction": -249.0242462158203,
"rps_doc_wikipedia_importance": -166.51158142089844,
"rps_doc_wikipedia_importance_length_correction": -166.51158142089844
},
"fasttext": {
"dclm": 0.7928367853164673,
"english": 0.8342961072921753,
"fineweb_edu_approx": 2.7425591945648193,
"eai_general_math": 0.00009786999726202339,
"eai_open_web_math": 0.038755711168050766,
"eai_web_code": -6.000000212225132e-7
}
} | {
"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.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
635,597,491,014,132,000 | LinuxQuestions.org
LinuxQuestions.org (/questions/)
- Linux - Networking (http://www.linuxquestions.org/questions/linux-networking-3/)
- - network card speed (http://www.linuxquestions.org/questions/linux-networking-3/network-card-speed-732359/)
sp149 06-11-2009 10:06 PM
network card speed
how to do a speed test on my Redhat Enterprise 4 update 4 server.
I've been told that the server is slow and data is being backed up very slowly to the backup server.
the server seems fine and nothing much running on it.
Can someone guide, how do i cross check.
Thanks
FragInHell 06-11-2009 10:21 PM
ethtool will help you here. It can tell what speed the interface is set to or you can use it to force a speed etc.
sp149 06-11-2009 10:53 PM
Thankyou ..
I need something for speed testing for the network interface.
grepmasterd 06-11-2009 11:37 PM
some tools to try
• netperf
• iperf
• netpipe
• ttcp
they should all give you roughly the same results, so pick your poison.
FragInHell 06-12-2009 12:17 AM
You can also create a file say 100mb in size (use dd to create a file) and the FTP it from place to place, that will give you an idea of speed as well. Don't use SCP as SSH can use compression.
grepmasterd 06-12-2009 12:26 AM
scp only uses compression if you tell it to ('-C' flag). and both ftp and scp involve disk access as part of the test.
If you just want to test your nics, use one of the tools above, like netperf (very simple). It only uses memory (fast), system buses (also fast) and and network hardware. If you get good results, it might be a good next step to try ftp or some file-based test to see if file i/o is the point of slowness.
sp149 06-12-2009 10:33 AM
Thank you ..i will try it and get back..
Appreciate all the help
All times are GMT -5. The time now is 10:19 PM. | {
"url": "http://www.linuxquestions.org/questions/linux-networking-3/network-card-speed-732359-print/",
"source_domain": "www.linuxquestions.org",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "7566",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:REKQEDY6DCQPN53GRCQDLGDKSTYVNUX4",
"WARC-Concurrent-To": "<urn:uuid:ee44198a-af97-4987-a23e-ff0785a2a8c5>",
"WARC-Date": "2014-03-15T03:19:07Z",
"WARC-IP-Address": "75.126.162.205",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LL3FMDUWKBAYP6HE64T34LLXPRBRMJKG",
"WARC-Record-ID": "<urn:uuid:39f8773a-ae37-4299-b40c-a270f1a014f0>",
"WARC-Target-URI": "http://www.linuxquestions.org/questions/linux-networking-3/network-card-speed-732359-print/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8adf3c44-771e-4d3c-b262-bd8004fe20e0>"
},
"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,
19,
20,
53,
138,
253,
254,
280,
281,
300,
302,
368,
369,
470,
471,
525,
526,
567,
568,
569,
576,
577,
608,
609,
724,
725,
751,
752,
764,
765,
827,
828,
860,
861,
879,
891,
901,
913,
922,
923,
995,
996,
1027,
1028,
1222,
1223,
1255,
1256,
1375,
1376,
1681,
1682,
1708,
1709,
1750,
1751,
1775,
1776,
1777
],
"line_end_idx": [
19,
20,
53,
138,
253,
254,
280,
281,
300,
302,
368,
369,
470,
471,
525,
526,
567,
568,
569,
576,
577,
608,
609,
724,
725,
751,
752,
764,
765,
827,
828,
860,
861,
879,
891,
901,
913,
922,
923,
995,
996,
1027,
1028,
1222,
1223,
1255,
1256,
1375,
1376,
1681,
1682,
1708,
1709,
1750,
1751,
1775,
1776,
1777,
1824
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1824,
"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.33634310960769653,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03386005014181137,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31376975774765015,
"rps_doc_frac_unique_words": 0.534426212310791,
"rps_doc_mean_word_length": 4.475409984588623,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.803071022033691,
"rps_doc_word_count": 305,
"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.010989010334014893,
"rps_doc_frac_chars_top_3gram": 0.02344322018325329,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -181.9895782470703,
"rps_doc_books_importance_length_correction": -179.87803649902344,
"rps_doc_openwebtext_importance": -132.86444091796875,
"rps_doc_openwebtext_importance_length_correction": -132.86444091796875,
"rps_doc_wikipedia_importance": -80.01174926757812,
"rps_doc_wikipedia_importance_length_correction": -79.99990844726562
},
"fasttext": {
"dclm": 0.1212165430188179,
"english": 0.84989994764328,
"fineweb_edu_approx": 2.198875904083252,
"eai_general_math": 0.45799684524536133,
"eai_open_web_math": 0.49500006437301636,
"eai_web_code": 0.012181820347905159
}
} | {
"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.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,035,987,058,263,021,000 | Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I have a horizontal collectionview with code to highlight/color the cell selected. It highlights the cell that was selected, but then every 5 cells after also get highlighted. Any idea what is going on?
- (void)collectionView:(UICollectionView *)collectionView didSelectItemAtIndexPath:(NSIndexPath *)indexPath
{
for(int x = 0; x < [cellArray count]; x++){
UICollectionViewCell *UnSelectedCell = [cellArray objectAtIndex:x];
UnSelectedCell.backgroundColor = [UIColor colorWithRed:0.2 green:0.5 blue:0.8 alpha:0.0];
}
UICollectionViewCell *SelectedCell = [cellArray objectAtIndex:indexPath.row];
SelectedCell.backgroundColor = [UIColor colorWithRed:0.2 green:0.5 blue:0.8 alpha:1.0];
cellSelected = indexPath.row;
NSLog(@"%i", cellSelected);
}
share|improve this question
2 Answers 2
up vote 5 down vote accepted
That happens because cells are reused when you scroll. You have to store the "highlighted" status for all rows in your model (for example in an array or NSMutableIndexSet), and in collectionView:cellForItemAtIndexPath: set the background color of the cell according to the status for that row.
In didSelectItemAtIndexPath it should be sufficient to set the color of the newly selected and the previously selected cell.
Update: If only one cell can be selected at a time, you just have to remember the index path of the selected cell.
Declare a property selectedIndexPath for the currently highlighted row:
@property (strong, nonatomic) NSIndexPath *selectedIndexPath;
In didSelectItemAtIndexPath, unhighlight the previous cell, and highlight the new cell:
- (void)collectionView:(UICollectionView *)collectionView didSelectItemAtIndexPath:(NSIndexPath *)indexPath
{
if (self.selectedIndexPath != nil) {
// deselect previously selected cell
UICollectionViewCell *cell = [collectionView cellForItemAtIndexPath:self.selectedIndexPath];
if (cell != nil) {
// set default color for cell
}
}
// Select newly selected cell:
UICollectionViewCell *cell = [collectionView cellForItemAtIndexPath:indexPath];
if (cell != nil) {
// set highlight color for cell
}
// Remember selection:
self.selectedIndexPath = indexPath;
}
In cellForItemAtIndexPath, use the correct background color:
- (UICollectionViewCell *)collectionView:(UICollectionView *)collectionView cellForItemAtIndexPath:(NSIndexPath *)indexPath
{
UICollectionViewCell *cell = [collectionView dequeueReusableCellWithReuseIdentifier:@"Identifier" forIndexPath:indexPath];
if ([self.selectedIndexPath isEqual:indexPath) {
// set highlight color
} else {
// set default color
}
}
share|improve this answer
I get that it happens because of reusable cells, but I kind of lost you after. How should I store the highlighted status? In didSelectItemAtIndexPath? Also, what do you mean in your last sentence? – Spenciefy Nov 9 '13 at 18:25
@Spenciefy: Each time collectionView:cellForItemAtIndexPath: is called, you have to set the correct background color for the cell. Therefore you have to "remember" the status for all rows. That's what I meant with storing the status in an array or index set. – Martin R Nov 9 '13 at 18:26
I see. So how do I assign selected or unselected in a indexset? – Spenciefy Nov 9 '13 at 18:28
@Spenciefy: It seems that in didSelectItemAtIndexPath you set the color for all cells (visible or invisible). That looks superfluous to me, because only two cells change their state. – Martin R Nov 9 '13 at 18:28
Sorry, I'm confused on how to use nsmutableindexset. Can you give a quick example? – Spenciefy Nov 9 '13 at 18:32
I think you use reusable cell for collection - there is the point. You shell to set default background color before reuse cell.
share|improve this answer
How would I set the default before the reuse cell; I highlight the cell when it is selected. – Spenciefy Nov 9 '13 at 18:33
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/19880267/uicollectionviewcell-selection-selects-highlights-every-5-cells",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-42",
"warc_metadata": {
"Content-Length": "78070",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KXQMP7VCIFYTRG2UO3CIBAR6O3M5K4MM",
"WARC-Concurrent-To": "<urn:uuid:2c8b88be-3035-4881-80e5-2f290bdf5b78>",
"WARC-Date": "2014-10-30T17:53:52Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4MATK6LHCWTKEN5PB3E24OMOLKKC4FXO",
"WARC-Record-ID": "<urn:uuid:5daef303-e9de-4af6-8f3b-65bc859c2201>",
"WARC-Target-URI": "http://stackoverflow.com/questions/19880267/uicollectionviewcell-selection-selects-highlights-every-5-cells",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:62bf7ac7-7909-45d7-ae2a-22ccd29ea1b5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-133-185.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-42\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for October 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
157,
158,
361,
362,
470,
472,
520,
596,
694,
700,
782,
874,
908,
940,
941,
943,
971,
972,
984,
985,
1014,
1015,
1309,
1310,
1435,
1436,
1551,
1552,
1624,
1625,
1687,
1688,
1776,
1777,
1885,
1887,
1928,
1973,
2074,
2101,
2143,
2153,
2159,
2194,
2278,
2301,
2341,
2347,
2374,
2414,
2416,
2417,
2478,
2479,
2603,
2605,
2732,
2785,
2816,
2829,
2858,
2864,
2866,
2892,
2897,
3126,
3131,
3421,
3426,
3522,
3527,
3741,
3746,
3861,
3862,
3990,
3991,
4017,
4022,
4147,
4148,
4160,
4161,
4163,
4171,
4172,
4250,
4251
],
"line_end_idx": [
25,
157,
158,
361,
362,
470,
472,
520,
596,
694,
700,
782,
874,
908,
940,
941,
943,
971,
972,
984,
985,
1014,
1015,
1309,
1310,
1435,
1436,
1551,
1552,
1624,
1625,
1687,
1688,
1776,
1777,
1885,
1887,
1928,
1973,
2074,
2101,
2143,
2153,
2159,
2194,
2278,
2301,
2341,
2347,
2374,
2414,
2416,
2417,
2478,
2479,
2603,
2605,
2732,
2785,
2816,
2829,
2858,
2864,
2866,
2892,
2897,
3126,
3131,
3421,
3426,
3522,
3527,
3741,
3746,
3861,
3862,
3990,
3991,
4017,
4022,
4147,
4148,
4160,
4161,
4163,
4171,
4172,
4250,
4251,
4341
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4341,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0.004146509803831577,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2619338929653168,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015911869704723358,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3341493308544159,
"rps_doc_frac_unique_words": 0.4166666567325592,
"rps_doc_mean_word_length": 6.079629421234131,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.961216926574707,
"rps_doc_word_count": 540,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06457508355379105,
"rps_doc_frac_chars_dupe_6grams": 0.03167834132909775,
"rps_doc_frac_chars_dupe_7grams": 0.00974718015640974,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.007310390006750822,
"rps_doc_frac_chars_top_3gram": 0.010965580120682716,
"rps_doc_frac_chars_top_4gram": 0.014620769768953323,
"rps_doc_books_importance": -411.71087646484375,
"rps_doc_books_importance_length_correction": -411.71087646484375,
"rps_doc_openwebtext_importance": -242.76577758789062,
"rps_doc_openwebtext_importance_length_correction": -242.76577758789062,
"rps_doc_wikipedia_importance": -168.1833038330078,
"rps_doc_wikipedia_importance_length_correction": -168.1833038330078
},
"fasttext": {
"dclm": 0.8221492171287537,
"english": 0.6984918713569641,
"fineweb_edu_approx": 1.7498774528503418,
"eai_general_math": 0.018677230924367905,
"eai_open_web_math": 0.13204145431518555,
"eai_web_code": 0.0001303000026382506
}
} | {
"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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-981,281,460,590,414,000 | Should BiblePay Proof of Distributed Computing (PoDC) 2.0 whitelist teams (GRC, OByte)?
Thor Challenge
More than one year ago (Oct 2018), I participated in team BiblePay in the Thor Challenge. The team captain, Rob, joined the challenge and everyone “crunched” for team BiblePay. Only the top teams are invited back to the next challenge. Every week, BiblePay ranked in the top 1 or 2 of each weekly challenge. Unfortunately, at the finals OByte was the final winner with BiblePay being a distant second. OByte won with almost double the “crunching” time.
THOR Challenge 2018 Y3-W2 (BiblePay, Rank 1, Crunched 170 years)
THOR Challenge 2018 Y3-W3 (BiblePay, Rank 2, Crunched 158 years)
THOR Challenge 2018 Y3-W4 (BiblePay, Rank 2, Crunched 152 years)1
The 2019 THOR Challenge ended with the following ranking:
1st place: OByte (306 years)
2nd place: Gridcoin (121 years)
3rd place: SETI.USA (15 years)
There is now a BiblePay proposal to reinstate Proof of Distributed Computing (PoDC 2.0). You can earn BiblePay (BBP) with RAC (recent average credit) which you earn by crunching World Community Grid (WCG) tasks using your CPU only. When BiblePay was involved with BOINC, 616westwarmoth valiantly crunched for BiblePay. These ranking give teams bragging rights and visibility to the BOINC community and Internet at large.
shorty34 said:
I agree it is good marketing, at least in the scientific community, when your team is among top 3.
I am not sure that would happen to BiblePay, if team Gridcoin is whitelisted under PoDC 2.0. Gridcoiners will simply stake to get BBP, and WCG points will go to team GRC.
Whitelist other teams?
With PoDC 2.0, what is the benefit of whitelisting GridCoin (GRC)? Last time BiblePay paid for BOINC RAC, grcpool miners opted to automate selling of BBP for GRC. So, other than bgb (grcpool pool owner) staking the required BBP to get 100% payment on grcpool, what is the the long-term benefit? If you add grcpool, grcpool-2, and grcpool-3 to the list that gets paid BBP, it would be like inviting a RAC whale in. With their current RAC numbers for WCG, they would need to stake 33.7M BBP assuming the stake requirement per RAC is ^1.3.
grcpool-1 240,013 RAC for WCG ^1.3 = 9,869,728 BBP
grcpool-2 243,870 RAC for WCG ^1.3 = 10,076,411 BBP
grcpool-3 310,788 RAC for WCG ^1.3 = 13,810,312 BBPTotal BBP stake required: 33,756,452 (33.7M BBP)BBPTotal RAC: 794,671
grcpool-1 240,013 RAC for WCG ^1.6 = 405,859,414 BBP
grcpool-2 243,870 RAC for WCG ^1.6 = 416,345,049 BBP
grcpool-3 310,788 RAC for WCG ^1.6 = 613,681,154 BBPTotal BBP stake required: 1,435,885,617 BBP (1.4B BBP)Total RAC: 794,671
Vote for staking requirements on different BOINC teams
There’s currently a poll to see what the staking requirements for GridCoin should be for BiblePay’s for BiblePay Proof of Distributed Computing (PoDC 2.0):
Vote Here: PoDC Team Requirements
Current suggestion for GRC team is ^1.6 BBP per RAC.
For team BiblePay, stake requirement is currently voting in at ^1.3 per RAC.
For example:
Team BiblePay: 10k RAC (^1.3) = 158 489 BBP stake required
Team GridCoin: 10k RAC (^1.6) = 2 511 886 BBP stake required
Anyone is welcome to voice their opinion, but registration on the forum is required.
DM for the link if you’re interested.
Also consider other teams that could potentially interact with PoDC 2.0 such as CharityEngine, boid.com, resistance, etc.
GridCoin plans to whitelist all teams
GridCoin plans to whitelist all teams based on future version (Fern update):
Implement local dynamic team requirement removal and whitelist #1502
Refactor hash Boinc for binary claim contexts #1558
When GridCoin releases an updated version, there is even less incentive for BiblePay to whitelist teams of any sort. GridCoin is well known in the BOINC community, so it seems like a good move for them to further invite other BOINC projects and teams to GridCoin.
The counter argument for BiblePay to whitelist all teams is the ^1.6 stake requirement. If you require BBP to be staked to earn rewards, does a team requirement really make sense? The incentive to join team BiblePay means you stake less. There are many BOINC participants that are loyal to their team as long-time members, captains, etc. Why exclude these individuals when they can participate in BiblePay’s growth and membership?
BiblePay’s mission in crypto or BOINC?
BiblePay is less known and has a specific mission to forward Christian values and not necessarily science specific tasks. BiblePay has found synergy with World Community Grid (WCG) on some projects dealing with children and cancer research (healing).2
If your interests are aligned with BiblePay (or just want to earn BiblePay crypto), feel free to join team BiblePay and participate in BOINC projects:
Africa Rainfall Project
Smash Childhood Cancer
Mapping Cancer Markers
1. OByte (ByteBall) Rank 1, Crunched 295 years[]
2. GridCoin is more inclusive of the entire BOINC community and has a great group of devs and community backing it. Many are generous in their time and money. It seems BiblePay has not found its value and purpose fully in the crypto nor BOINC community.[]
0 0 votes
Article Rating
0 Comments
Inline Feedbacks
View all comments | {
"url": "https://whitewalr.us/2019/biblepay-whitelist-grc-podc.html",
"source_domain": "whitewalr.us",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "61936",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XKWK4SABR4H745MRIC6TJ23YMRH3ZHUU",
"WARC-Concurrent-To": "<urn:uuid:85a72ab5-1df7-4bb4-a3e5-aae2738b1a04>",
"WARC-Date": "2021-12-06T05:23:46Z",
"WARC-IP-Address": "104.194.8.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D6THZF5DVYJRD4GUNZZSHUNGIUOPNY4L",
"WARC-Record-ID": "<urn:uuid:a62d727b-c455-4061-8fd9-71e9d3448687>",
"WARC-Target-URI": "https://whitewalr.us/2019/biblepay-whitelist-grc-podc.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9d7e8b8a-bd43-452b-8903-621ca9faa894>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-12\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,
88,
89,
104,
105,
558,
559,
624,
625,
690,
691,
757,
758,
816,
817,
846,
878,
909,
910,
1331,
1332,
1347,
1348,
1447,
1448,
1619,
1620,
1643,
1644,
2181,
2182,
2234,
2286,
2407,
2460,
2513,
2638,
2639,
2695,
2696,
2852,
2853,
2887,
2888,
2941,
3018,
3019,
3032,
3033,
3094,
3155,
3156,
3241,
3279,
3280,
3402,
3403,
3441,
3442,
3519,
3520,
3589,
3590,
3642,
3643,
3907,
3908,
4339,
4340,
4379,
4380,
4632,
4633,
4784,
4785,
4809,
4810,
4833,
4834,
4857,
4858,
4860,
4861,
4912,
5170,
5180,
5195,
5206,
5223
],
"line_end_idx": [
88,
89,
104,
105,
558,
559,
624,
625,
690,
691,
757,
758,
816,
817,
846,
878,
909,
910,
1331,
1332,
1347,
1348,
1447,
1448,
1619,
1620,
1643,
1644,
2181,
2182,
2234,
2286,
2407,
2460,
2513,
2638,
2639,
2695,
2696,
2852,
2853,
2887,
2888,
2941,
3018,
3019,
3032,
3033,
3094,
3155,
3156,
3241,
3279,
3280,
3402,
3403,
3441,
3442,
3519,
3520,
3589,
3590,
3642,
3643,
3907,
3908,
4339,
4340,
4379,
4380,
4632,
4633,
4784,
4785,
4809,
4810,
4833,
4834,
4857,
4858,
4860,
4861,
4912,
5170,
5180,
5195,
5206,
5223,
5240
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5240,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25526314973831177,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07192981988191605,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.30614036321640015,
"rps_doc_frac_unique_words": 0.41992881894111633,
"rps_doc_mean_word_length": 4.879003524780273,
"rps_doc_num_sentences": 64,
"rps_doc_symbol_to_word_ratio": 0.0017543899593874812,
"rps_doc_unigram_entropy": 5.309797286987305,
"rps_doc_word_count": 843,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07999026775360107,
"rps_doc_frac_chars_dupe_6grams": 0.0688062235713005,
"rps_doc_frac_chars_dupe_7grams": 0.01993679068982601,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0116703100502491,
"rps_doc_frac_chars_top_3gram": 0.013129100203514099,
"rps_doc_frac_chars_top_4gram": 0.01969365030527115,
"rps_doc_books_importance": -457.936767578125,
"rps_doc_books_importance_length_correction": -457.936767578125,
"rps_doc_openwebtext_importance": -217.4609832763672,
"rps_doc_openwebtext_importance_length_correction": -217.4609832763672,
"rps_doc_wikipedia_importance": -132.6345977783203,
"rps_doc_wikipedia_importance_length_correction": -132.6345977783203
},
"fasttext": {
"dclm": 0.16144639253616333,
"english": 0.9128181338310242,
"fineweb_edu_approx": 1.028620958328247,
"eai_general_math": 0.019805369898676872,
"eai_open_web_math": 0.051176369190216064,
"eai_web_code": 0.02426910027861595
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "332.874",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
464,496,261,607,139,400 | UPGRADE YOUR BROWSER
We have detected your current browser version is not the latest one. Xilinx.com uses the latest web technologies to bring you the best online experience possible. Please upgrade to a Xilinx.com supported browser:Chrome, Firefox, Internet Explorer 11, Safari. Thank you!
cancel
Showing results for
Search instead for
Did you mean:
Highlighted
Visitor phani.kara
Visitor
1,319 Views
Registered: 11-10-2016
Zynq Ultrascale+ MPSoC Interrupt Priorities
Hi,
I am rather confused with interrupt priority assignments in ZynqMP. I am following these 2 documents -
From page 271 of the Doc2 (TRM), All of the SGI and SPI interrupt requests are assigned a unique ID number. The controller
uses the ID number to arbitrate. The interrupt distributor holds the list of pending
interrupts for each CPU and then selects the highest priority interrupt before issuing it to
the CPU interface. Interrupts of equal priority are resolved by selecting the lowest ID.
Query 1 : In Doc 1, the interrupt ID numbers are mostly 1 and in the Doc2 (TRM), there is no mention of ID numbers but only the IRQ Numbers. So which ID is being referred to here?
Query 2 : From the table System interrupts from Doc2(TRM) and assuming the ID numbers are actually the IRQ numbers, does it make a lot of sense for UART, SPI etc to have a higher priority by default than, for example, TTC timer?
Query 3 : How to explicitly assign the FPGA interrupts the highest priority in, for example, Linux?
Thanks in advance,
Phani Kiran Kara
0 Kudos
2 Replies
Visitor phani.kara
Visitor
1,299 Views
Registered: 11-10-2016
Re: Zynq Ultrascale+ MPSoC Interrupt Priorities
If anyone could point out a hint, I can write the Linux driver/device tree myself. Thanks in advance.
0 Kudos
Moderator
Moderator
1,259 Views
Registered: 10-06-2016
Re: Zynq Ultrascale+ MPSoC Interrupt Priorities
Hi @phani.kara
Query 1:
The Interrupt ID and the IRQ number refers to the same, take a look to the IRQ-F2P (PL to PS interrupts) numbers (121-128 & 136-143). I think that your confusion comes with the PS to PL interrupts, referred to the common peripherals but driven to the PL rather than to the processor by itself.
Query 2:
I think that you miss the point of "Interrupts of equal priority are resolved by selecting the lowest ID".
Query 3:
I'm not sure how to configure the priority in Linux as I cannot find a way to set it in the DTS. For standalone mode the SCUGIC driver does provide a function to configure XScuGic_SetPriorityTriggerType so you can take a look to it :)
Regards,
Ibai
Ibai
Don’t forget to reply, kudo, and accept as solution.
0 Kudos | {
"url": "https://forums.xilinx.com/t5/Embedded-Linux/Zynq-Ultrascale-MPSoC-Interrupt-Priorities/m-p/801103",
"source_domain": "forums.xilinx.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "129637",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CEN32EWWBACFNRVVZPLVIRSA4JHMLFRE",
"WARC-Concurrent-To": "<urn:uuid:d6e55e70-a4e7-4b31-bc6a-034d0622fd02>",
"WARC-Date": "2019-02-17T11:59:10Z",
"WARC-IP-Address": "208.74.204.60",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZO67E7RNX6QHUZOCC5LBGJEPTSVR6JQY",
"WARC-Record-ID": "<urn:uuid:ec73ff15-de85-4246-8335-53ae3dbe3ae2>",
"WARC-Target-URI": "https://forums.xilinx.com/t5/Embedded-Linux/Zynq-Ultrascale-MPSoC-Interrupt-Priorities/m-p/801103",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6543203b-7faa-4c11-b4a6-4a7ece09b7fd>"
},
"warc_info": "isPartOf: CC-MAIN-2019-09\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-29-101-93.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,
21,
22,
292,
293,
300,
321,
341,
356,
368,
387,
395,
407,
431,
432,
476,
477,
481,
482,
484,
485,
588,
589,
591,
592,
715,
800,
893,
982,
983,
985,
986,
1167,
1168,
1170,
1171,
1400,
1401,
1403,
1404,
1504,
1505,
1507,
1508,
1527,
1528,
1545,
1546,
1554,
1564,
1583,
1591,
1603,
1627,
1628,
1676,
1677,
1779,
1780,
1788,
1798,
1808,
1820,
1844,
1845,
1893,
1894,
1909,
1910,
1912,
1913,
1922,
1923,
2217,
2218,
2220,
2221,
2230,
2231,
2338,
2339,
2341,
2342,
2351,
2352,
2587,
2588,
2590,
2591,
2600,
2605,
2606,
2607,
2612,
2665
],
"line_end_idx": [
21,
22,
292,
293,
300,
321,
341,
356,
368,
387,
395,
407,
431,
432,
476,
477,
481,
482,
484,
485,
588,
589,
591,
592,
715,
800,
893,
982,
983,
985,
986,
1167,
1168,
1170,
1171,
1400,
1401,
1403,
1404,
1504,
1505,
1507,
1508,
1527,
1528,
1545,
1546,
1554,
1564,
1583,
1591,
1603,
1627,
1628,
1676,
1677,
1779,
1780,
1788,
1798,
1808,
1820,
1844,
1845,
1893,
1894,
1909,
1910,
1912,
1913,
1922,
1923,
2217,
2218,
2220,
2221,
2230,
2231,
2338,
2339,
2341,
2342,
2351,
2352,
2587,
2588,
2590,
2591,
2600,
2605,
2606,
2607,
2612,
2665,
2672
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2672,
"ccnet_original_nlines": 94,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3224043846130371,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0765027329325676,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22768670320510864,
"rps_doc_frac_unique_words": 0.48394495248794556,
"rps_doc_mean_word_length": 4.766055107116699,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.91143274307251,
"rps_doc_word_count": 436,
"rps_doc_frac_chars_dupe_10grams": 0.06063523143529892,
"rps_doc_frac_chars_dupe_5grams": 0.119345523416996,
"rps_doc_frac_chars_dupe_6grams": 0.119345523416996,
"rps_doc_frac_chars_dupe_7grams": 0.06063523143529892,
"rps_doc_frac_chars_dupe_8grams": 0.06063523143529892,
"rps_doc_frac_chars_dupe_9grams": 0.06063523143529892,
"rps_doc_frac_chars_top_2gram": 0.014436960220336914,
"rps_doc_frac_chars_top_3gram": 0.02743021957576275,
"rps_doc_frac_chars_top_4gram": 0.04042347893118858,
"rps_doc_books_importance": -241.89703369140625,
"rps_doc_books_importance_length_correction": -241.89703369140625,
"rps_doc_openwebtext_importance": -131.17262268066406,
"rps_doc_openwebtext_importance_length_correction": -131.17262268066406,
"rps_doc_wikipedia_importance": -125.09698486328125,
"rps_doc_wikipedia_importance_length_correction": -125.09698486328125
},
"fasttext": {
"dclm": 0.07719718664884567,
"english": 0.8340861797332764,
"fineweb_edu_approx": 1.6615649461746216,
"eai_general_math": 0.04247378930449486,
"eai_open_web_math": 0.3828660845756531,
"eai_web_code": 0.0029098400846123695
}
} | {
"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.27",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
8,889,684,443,833,711,000 | 14 Replies Latest reply on Jul 15, 2016 2:31 PM by jimthen
Unexplained failure
jimthen
Operating system version ( 32 bit or 64 bit version )
Windows 10, 64 bit
Web browser and version
Firefix 42.0
Flash Player version
22.0.0.192
Explain your problem in step-by-step detail if possible
Installation fails at around 60-70% progress, and directs me to the webpage linked here:
https://get3.adobe.com/flashplayer/completion/adm/?exitcode=-1073740777&type=update&re=0&a ppId=200
I followed every suggestion on your help pages, even installing with another browser, problem persists.
• 1. Re: Unexplained failure
ridhijain Adobe Employee
Hi,
Please try with the latest version of Flash Player(22.0.0.209).
Additionally, please provide us the logs to help us debug the issue. To do the same follow the below mentioned steps:
1. Launch Windows Explorer and navigate C:\Users\<YourUserID>\AppData\Local\Temp\
2. Right-click in an empty area and select New > Text Document
3. Rename the new file to ADM.trace
4. Run the online installer again until it stops
5. When the installation stops, the Adobe_ADM.log and Adobe_GDE.log files will contain additional debugging information.
6. Upload the 2 log files to cloud.acrobat.com/send and post the link to the uploaded files in your reply.
Thanks!
• 3. Re: Unexplained failure
Carm01 Level 4
Give the manual process a try as outlined here; its only 2 steps
Guide to Manually updating Flash Player for Windows
Hopefully that will assist you
Best Regards
Please mark my post here helpful or answered if I have assisted you
Thanks
• 4. Re: Unexplained failure
jimthen Level 1
It might be prudent to wait for official staff reply, when an apparently direct link redirects via two other sites who insist on setting cookies.
• 5. Re: Unexplained failure
maria__ Adobe Employee
@jimthen
Are you using a proxy server? If so, how is it configured?
• 6. Re: Unexplained failure
jimthen Level 1
No, I do not use proxy.
• 7. Re: Unexplained failure
maria__ Adobe Employee
I'd like to review the FlashInstall.log file. Please upload the FlashInstall.log files saved at C:\Windows\System32\Macromed\Flash and C:\Windows\SysWOW64\Macromed\Flash to cloud.acrobat.com/send and post the link in your reply.
Thank you.
• 9. Re: Unexplained failure
maria__ Adobe Employee
Thank you.
From the online installer log files I couldn't quite determine if the installation process had gotten as far as attempting to install Flash Player itself (online installer downloads and installs Flash Player silently in the background), but the failure is prior to this point as the FlashInstall.log file doesn't have anything recent in it. I do see an error in the online installer log file referring to a proxy server, which you indicate you don't use. It could be a false error or something in how your system is configured to access the internet is causing it to thing it's using a proxy.
To see how how Firefox is accessing the internet launch Firefox and navigate to about:preferences#advanced and then click on the Settings button in the Connection section. A new window will pop-up. This will display if it's configured to use a proxy or not.
Windows 10 has a Proxy config listed in both Settings and in the Control Panel:
• Settings > Netowrk & Internet > Proxy and see if it's configured there
• Control Panel > Internet Options > Connections > LAN Settings
Ensure all of these are not configured to use a proxy
I'm going to forward the installer log files to the online installer team to troubleshoot further. They may have more questions for you after they review it. In the mean time, you can try using the offline installer posted at the bottom of the Installation problems | Flash Player | Windows 7 and earlier in the 'Still having problems' section. This is the full installer and doesn't download anything silently in the background.
1 person found this helpful
• 10. Re: Unexplained failure
jimthen Level 1
Proxy was turned off in Win 10's settings, but Firefox had some sort of proxy set:
data:text/javascript,function FindProxyForURL(url, host) {if ((url.indexOf("proxmate=us") != -1)) { return 'PROXY us08.sq.proxmate.me:8000; PROXY us05.sq.proxmate.me:8000; PROXY us07.sq.proxmate.me:8000; PROXY us02.sq.proxmate.me:8000; PROXY us01.sq.proxmate.me:8000; PROXY us09.sq.proxmate.me:8000; PROXY us06.sq.proxmate.me:8000; PROXY us11.sq.proxmate.me:8000; PROXY us13.sq.proxmate.me:8000; PROXY us03.sq.proxmate.me:8000; PROXY us12.sq.proxmate.me:8000; PROXY us14.sq.proxmate.me:8000; PROXY us10.sq.proxmate.me:8000' } else { return 'DIRECT'; }}
I switched to no proxy, and tried running the installer again. This time it got as far as to ask me to close Firefox, and I thought now it's working - not. Foiled again. In the end I downloaded the offline installer, and it installed without any problems whatsoever. Maybe you should make it easier to choose the offline installer, like offer a link on the page I linked in my first message. I hope you manage to find the bug, so that others don't get the same problem in the future.
• 11. Re: Unexplained failure
maria__ Adobe Employee
The proxy setting is most likely what was causing the error.
"This time it got as far as to ask me to close Firefox,"
The installer (online or offline) will only prompt to close the browser if you're installing a version that's already installed. If Flash isn't installed, or you're upgrading from a previous version to a newer version, Flash won't prompt to close the browser. Can you upload a new set of FlashInstall.log files? I'd like to see what it has now. Thank you.
• 12. Re: Unexplained failure
Carm01 Level 4
"In the end I downloaded the offline installer, and it installed without any problems whatsoever."
Ironically I suggested that way up in the post!
Not everyone on the internet is up to no good!
Regards!
• 14. Re: Unexplained failure
jimthen Level 1
"Ironically I suggested that way up in the post!"
That might be so, but unrelated sites trying to put cookies on my computer when following a link in your guide makes me reluctant.
"Not everyone on the internet is up to no good!"
Again that might be so, I call the 80/20 rule, 80% of everyone on the internet is up to no good, 20% are serious, decent people. I'm sure you're among the latter, Carm01. | {
"url": "https://forums.adobe.com/thread/2181898",
"source_domain": "forums.adobe.com",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "167120",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4GABXBVFG3EWWDM7346JOWHGA4FZ7RAC",
"WARC-Concurrent-To": "<urn:uuid:8992cd21-bbb6-4a15-9929-b26c94bc6775>",
"WARC-Date": "2018-01-20T23:30:55Z",
"WARC-IP-Address": "204.93.89.33",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M4CZ45NU5TH5KJU3GMH5VIO6PLALFQNX",
"WARC-Record-ID": "<urn:uuid:1d1d06ab-b52b-4f5e-935e-05fa38a955da>",
"WARC-Target-URI": "https://forums.adobe.com/thread/2181898",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2473300a-01f6-4ed2-9776-339edcc0c650>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-181-213-23.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-05\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for January 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
63,
64,
88,
89,
101,
102,
162,
163,
188,
189,
219,
220,
239,
240,
267,
268,
285,
286,
348,
349,
444,
445,
551,
552,
662,
663,
700,
735,
736,
750,
751,
763,
764,
838,
839,
967,
968,
980,
981,
1073,
1146,
1192,
1251,
1382,
1499,
1500,
1512,
1513,
1531,
1532,
1571,
1598,
1599,
1676,
1677,
1741,
1742,
1756,
1757,
1800,
1801,
1826,
1827,
1907,
1908,
1927,
1928,
1969,
1999,
2000,
2160,
2161,
2204,
2243,
2244,
2269,
2270,
2288,
2289,
2365,
2366,
2411,
2445,
2446,
2488,
2489,
2536,
2579,
2580,
2830,
2831,
2853,
2854,
2885,
2886,
2935,
2980,
2981,
3014,
3015,
3039,
3040,
3657,
3658,
3939,
3940,
4042,
4043,
4138,
4224,
4225,
4301,
4302,
4326,
4327,
4782,
4783,
4833,
4885,
4925,
4926,
5033,
5034,
5060,
5061,
5638,
5639,
5665,
5666,
6174,
6175,
6229,
6278,
6279,
6366,
6367,
6395,
6396,
6479,
6480,
6508,
6509,
6895,
6896,
6952,
6995,
6996,
7123,
7124,
7154,
7155,
7231,
7232,
7262,
7263,
7338,
7339,
7369,
7370,
7407,
7408,
7466,
7512,
7513,
7593,
7594,
7626,
7627,
7788,
7789,
7821,
7822,
7901,
7902,
7934,
7935
],
"line_end_idx": [
63,
64,
88,
89,
101,
102,
162,
163,
188,
189,
219,
220,
239,
240,
267,
268,
285,
286,
348,
349,
444,
445,
551,
552,
662,
663,
700,
735,
736,
750,
751,
763,
764,
838,
839,
967,
968,
980,
981,
1073,
1146,
1192,
1251,
1382,
1499,
1500,
1512,
1513,
1531,
1532,
1571,
1598,
1599,
1676,
1677,
1741,
1742,
1756,
1757,
1800,
1801,
1826,
1827,
1907,
1908,
1927,
1928,
1969,
1999,
2000,
2160,
2161,
2204,
2243,
2244,
2269,
2270,
2288,
2289,
2365,
2366,
2411,
2445,
2446,
2488,
2489,
2536,
2579,
2580,
2830,
2831,
2853,
2854,
2885,
2886,
2935,
2980,
2981,
3014,
3015,
3039,
3040,
3657,
3658,
3939,
3940,
4042,
4043,
4138,
4224,
4225,
4301,
4302,
4326,
4327,
4782,
4783,
4833,
4885,
4925,
4926,
5033,
5034,
5060,
5061,
5638,
5639,
5665,
5666,
6174,
6175,
6229,
6278,
6279,
6366,
6367,
6395,
6396,
6479,
6480,
6508,
6509,
6895,
6896,
6952,
6995,
6996,
7123,
7124,
7154,
7155,
7231,
7232,
7262,
7263,
7338,
7339,
7369,
7370,
7407,
7408,
7466,
7512,
7513,
7593,
7594,
7626,
7627,
7788,
7789,
7821,
7822,
7901,
7902,
7934,
7935,
8135
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8135,
"ccnet_original_nlines": 176,
"rps_doc_curly_bracket": 0.0007375500281341374,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3223082423210144,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027445459738373756,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2688247561454773,
"rps_doc_frac_unique_words": 0.3829787075519562,
"rps_doc_mean_word_length": 4.997973442077637,
"rps_doc_num_sentences": 124,
"rps_doc_symbol_to_word_ratio": 0.0007037299801595509,
"rps_doc_unigram_entropy": 5.3394951820373535,
"rps_doc_word_count": 987,
"rps_doc_frac_chars_dupe_10grams": 0.06365294754505157,
"rps_doc_frac_chars_dupe_5grams": 0.18832354247570038,
"rps_doc_frac_chars_dupe_6grams": 0.1704844832420349,
"rps_doc_frac_chars_dupe_7grams": 0.08574903756380081,
"rps_doc_frac_chars_dupe_8grams": 0.08574903756380081,
"rps_doc_frac_chars_dupe_9grams": 0.08574903756380081,
"rps_doc_frac_chars_top_2gram": 0.04378674179315567,
"rps_doc_frac_chars_top_3gram": 0.04459761083126068,
"rps_doc_frac_chars_top_4gram": 0.021893370896577835,
"rps_doc_books_importance": -458.36199951171875,
"rps_doc_books_importance_length_correction": -458.36199951171875,
"rps_doc_openwebtext_importance": -342.2218322753906,
"rps_doc_openwebtext_importance_length_correction": -342.2218322753906,
"rps_doc_wikipedia_importance": -226.37948608398438,
"rps_doc_wikipedia_importance_length_correction": -226.37948608398438
},
"fasttext": {
"dclm": 0.01950645074248314,
"english": 0.8698878884315491,
"fineweb_edu_approx": 1.0905511379241943,
"eai_general_math": 0.035963889211416245,
"eai_open_web_math": 0.22566229104995728,
"eai_web_code": 0.0016815699636936188
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,200,023,434,727,046,400 | Opera Mobile 10.1 Beta on the persistent Nokia n810 tablet
I know it is strange to be reviewing software put out for a tablet computer made in 2007, but the Nokia n810 is an amazing bit of kit that has an incredible degree of stickiness. I had no trouble getting rid of previous gadgets on eBay including my precious Psion series 5mx and netbook (the original), when obsolescence greeted them. The n810 is clad in brush aluminum and has the build qualities one associates with Apple. It runs a tiny variant of Linux, and if you don’t mind taxing your eyes, there are ways of running full blown X11 applications on it just like you can on your Mac.
As I was toying with the idea of parting with this, I did two things. I plugged it into a speakers to play the BBC World service, and got a wonderful earful of the Queen’s English. A moment later, Radio Free Asia Korea is streaming in clear 96kb. The other thing was I discovered Opera Mobile 10.1 in the free app store where open source applications seem to pop up despite the apparent obsolescence of the platform. It is a wonder -it’s touch optimized and allows browsing the full web, but the mobile web is where it sings. The mobile sites of Gizmodo, NYTimes, and others just pop on this browser. The icons are all fat, allowing for finger navigation despite the resistive screen. Scrolling has an iOS Safari like inertia and in full screen, the browser turns the 4 year old tablet into a modern window on the web.
It speaks to this one thing in our disposable lifestyles -with appropriate care and the right software, there is no reason why technology has to be abandoned every two years. If done right, even the 4 year old technology can sing. Apple understands this ultimately adds value to your line when people can count on being able to use their device beyond its shelf life -that is why my iPod Touch 2nd generation can still run most of the games and apps that show up on the App store. Before you toss that plastic Dell laptop in the dustbin of history, try loading Ubuntu Linux on it or Chrome OS when it’s available again (and it will be).
The tech companies that survive and thrive offer a perfect alignment of form, function, hardware, and software, but also have the market awareness to adapt their offerings to what people can actually use in a meaningful way in their lives, and in this aspect, the n810 is a failure because it’s really a geek hobbyists niche toy. It never played nice with Microsoft Exchange Server, and its screen is too small to comfortably read a full web page. Pinch to zoom is not possible with a resistive screen. It offers a front facing camera, but the video calling feature was never allowed to bear fruit. The Skype client is voice only, and the Gizmo app no longer allows new accounts since their acquisition by Google. Even so, the n810 is keeping its value because of the perfection of form and function. The n810 has taken on the status of a beloved shortwave radio and bespoke web reader. I even bought a new battery for it. Do you feel the same about that plastic Dell box from 2006?
2 thoughts on “Opera Mobile 10.1 Beta on the persistent Nokia n810 tablet
1. I’ve been eyeing an n810 for some time. It’s finally (due to age, obsolescence, whatever) come down enough in price that I can seriously think about buying one. Now that Opera is available I’m even more excited! How do you like Opera so far? Any updates planned? Thanks.
• I have a great love of shopping for out of date gadgets that were unpopular in their time but quietly excellent in their own way. The Sony UX380 and others in the series, Psion netbook and Series 5mx, the Apple Newton, and many others, look terribly fun and are a bargain if you can find them. Usually, new batteries for them will cost as much as the device. The n810 is slow and gets overwhelmed when you throw stuff at it intended for full sized laptops, but is zippy with software that was designed for it. Add a bluetooth keyboard and you have a mobile wordprocessing station with its own kickstand built in. The Rhapsody app, a bit outdated now, still works very well, and Skype via the included headphone/microphone or bluetooth is perfect.
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Connecting to %s | {
"url": "https://golfism.org/2010/12/21/opera-mobile-10-1-beta-on-the-persistent-nokia-n810-tablet/",
"source_domain": "golfism.org",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "77742",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YQW5Z3GE22WR2JZ7AECHF5EJVXUAD4EY",
"WARC-Concurrent-To": "<urn:uuid:4904d2cb-2a07-4ec8-81f9-3eebde8d870f>",
"WARC-Date": "2018-11-12T21:46:40Z",
"WARC-IP-Address": "192.0.78.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FPT62QDSLFPHNB46FNYLUZSV26MWZH6Z",
"WARC-Record-ID": "<urn:uuid:60f97734-8ddd-4c90-b19b-06d8b85d6c2b>",
"WARC-Target-URI": "https://golfism.org/2010/12/21/opera-mobile-10-1-beta-on-the-persistent-nokia-n810-tablet/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7176f4e6-bd5f-4436-8544-4bc6e4d9a08f>"
},
"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-13-225-53.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,
59,
60,
649,
650,
1469,
1470,
2107,
2108,
3091,
3092,
3166,
3167,
3443,
3444,
4197,
4198,
4212,
4213,
4268,
4269,
4288,
4289,
4362,
4363,
4377,
4378,
4445,
4446,
4462,
4463,
4530,
4531,
4546,
4547,
4615,
4616
],
"line_end_idx": [
59,
60,
649,
650,
1469,
1470,
2107,
2108,
3091,
3092,
3166,
3167,
3443,
3444,
4197,
4198,
4212,
4213,
4268,
4269,
4288,
4289,
4362,
4363,
4377,
4378,
4445,
4446,
4462,
4463,
4530,
4531,
4546,
4547,
4615,
4616,
4632
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4632,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4354669451713562,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016789089888334274,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13116474449634552,
"rps_doc_frac_unique_words": 0.49093109369277954,
"rps_doc_mean_word_length": 4.431680679321289,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.461524963378906,
"rps_doc_word_count": 827,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.053478848189115524,
"rps_doc_frac_chars_dupe_6grams": 0.03983629122376442,
"rps_doc_frac_chars_dupe_7grams": 0.02346521057188511,
"rps_doc_frac_chars_dupe_8grams": 0.02346521057188511,
"rps_doc_frac_chars_dupe_9grams": 0.02346521057188511,
"rps_doc_frac_chars_top_2gram": 0.006821279879659414,
"rps_doc_frac_chars_top_3gram": 0.009822649881243706,
"rps_doc_frac_chars_top_4gram": 0.022919509559869766,
"rps_doc_books_importance": -482.1478271484375,
"rps_doc_books_importance_length_correction": -482.1478271484375,
"rps_doc_openwebtext_importance": -212.48162841796875,
"rps_doc_openwebtext_importance_length_correction": -212.48162841796875,
"rps_doc_wikipedia_importance": -130.7979278564453,
"rps_doc_wikipedia_importance_length_correction": -130.7979278564453
},
"fasttext": {
"dclm": 0.022578900679945946,
"english": 0.9451857805252075,
"fineweb_edu_approx": 1.3537315130233765,
"eai_general_math": 0.0002141599979950115,
"eai_open_web_math": 0.06102025881409645,
"eai_web_code": 0.00003885999831254594
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "14",
"label": "Reviews/Critiques"
},
"secondary": {
"code": "9",
"label": "Personal/Misc"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
3,628,235,274,755,738,600 | Best forum to share something for B4A & B4J
joseluis
Active Member
Licensed User
Longtime User
I'm currently working in an installation script of both B4A and B4J (and possibly B4I when it comes out) to use them in Ubuntu linux. It is based on the previous discontinued work by Zolive33 (& here).
I have already a working first version, but I don't know where should I open the thread for it. Which subforum do you think is the most appropriate? Because I don't think duplicating the thread is a good idea.
Thank you!
joseluis
Active Member
Licensed User
Longtime User
Thank you Erel, that is the best solution.
Yes I know, don't worry, it only has the free version link. And the instructions to change it for the full version link that one receives by email after buying it.
One more thing. Do you mind if I use the name B4LinuxInstall for it? I already include a note clarifying that this is not an official tool by Anywhere, but since it begins by B4, I wanted to check. If it's a problem I could change it.
Last edited:
Beja
Expert
Licensed User
Longtime User
Hi Jose,
will the installation script automate the whole work, including installing Android and Java SDK and configuration?
Thanks
joseluis
Active Member
Licensed User
Longtime User
Yes. I still need to explain it in detail in the thread. But the script already downloads and installs java, android sdk, wine, java SDK for windows, B4A and B4J. Leaves everything working. It puts android sdk and wine directories inside ~/workspace_b4 by default. It needs at least 2,1 GB, but it can be much more if you install unneeded componentes like java sources or several android apis and examples...
Beja
Expert
Licensed User
Longtime User
Great Jose..
I don't want to disturb your work, and would suggest to you to port it to Windows.. I had this wish long time ago.. the automated installation of both (now the three) products.
joseluis
Active Member
Licensed User
Longtime User
@Beja Sorry wont do. I don't use windows and I don't even have enough time keep working on the Linux version...
Top | {
"url": "https://www.b4x.com/android/forum/threads/best-forum-to-share-something-for-b4a-b4j.45071/",
"source_domain": "www.b4x.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "61546",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CLUIND3KPCD3WCRY5WVYWXR7IAS5FBJA",
"WARC-Concurrent-To": "<urn:uuid:eca35bec-a530-4d96-bfd7-837c43472c8c>",
"WARC-Date": "2024-02-29T11:07:05Z",
"WARC-IP-Address": "172.67.68.117",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2MWWZSKN5KNQ4V3WAMOIXVQZR7SP2WDN",
"WARC-Record-ID": "<urn:uuid:da352d29-97eb-4f39-b364-d02e2c533a58>",
"WARC-Target-URI": "https://www.b4x.com/android/forum/threads/best-forum-to-share-something-for-b4a-b4j.45071/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c1c8b5c6-8369-4d73-8d26-5d02d8b99370>"
},
"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-154\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
44,
45,
54,
55,
69,
83,
97,
299,
300,
510,
511,
522,
524,
525,
534,
535,
549,
563,
577,
620,
621,
785,
786,
1021,
1023,
1036,
1037,
1042,
1043,
1050,
1064,
1078,
1087,
1202,
1209,
1211,
1212,
1221,
1222,
1236,
1250,
1264,
1673,
1675,
1676,
1681,
1682,
1689,
1703,
1717,
1730,
1907,
1909,
1910,
1919,
1920,
1934,
1948,
1962,
2074,
2076
],
"line_end_idx": [
44,
45,
54,
55,
69,
83,
97,
299,
300,
510,
511,
522,
524,
525,
534,
535,
549,
563,
577,
620,
621,
785,
786,
1021,
1023,
1036,
1037,
1042,
1043,
1050,
1064,
1078,
1087,
1202,
1209,
1211,
1212,
1221,
1222,
1236,
1250,
1264,
1673,
1675,
1676,
1681,
1682,
1689,
1703,
1717,
1730,
1907,
1909,
1910,
1919,
1920,
1934,
1948,
1962,
2074,
2076,
2079
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2079,
"ccnet_original_nlines": 61,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3826290965080261,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06103286147117615,
"rps_doc_frac_lines_end_with_ellipsis": 0.032258059829473495,
"rps_doc_frac_no_alph_words": 0.14084507524967194,
"rps_doc_frac_unique_words": 0.4958217442035675,
"rps_doc_mean_word_length": 4.518105983734131,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.0046948399394750595,
"rps_doc_unigram_entropy": 4.788786888122559,
"rps_doc_word_count": 359,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1504315733909607,
"rps_doc_frac_chars_dupe_6grams": 0.1504315733909607,
"rps_doc_frac_chars_dupe_7grams": 0.10850801318883896,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04438963904976845,
"rps_doc_frac_chars_top_3gram": 0.07398273795843124,
"rps_doc_frac_chars_top_4gram": 0.0887792780995369,
"rps_doc_books_importance": -208.7455291748047,
"rps_doc_books_importance_length_correction": -208.7455291748047,
"rps_doc_openwebtext_importance": -164.70147705078125,
"rps_doc_openwebtext_importance_length_correction": -164.70147705078125,
"rps_doc_wikipedia_importance": -106.23346710205078,
"rps_doc_wikipedia_importance_length_correction": -106.23346710205078
},
"fasttext": {
"dclm": 0.04190969094634056,
"english": 0.9549065828323364,
"fineweb_edu_approx": 1.0362225770950317,
"eai_general_math": 0.01768207922577858,
"eai_open_web_math": 0.34605419635772705,
"eai_web_code": 0.006227910052984953
}
} | {
"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.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,290,932,492,586,354,400 | Monday, April 13, 2015
Sirius-ly?
I'm over it.
I've been a subscriber of Sirius Radio for about 10 years (well, now it's SiriusXM after the merger just doubled everyone's frustration). I keep thinking it's going to get better.
It's actually getting worse.
Advertised as commercial free radio with a clear signal, Sirius is anything BUT Serious.
Let's start with the signal.
Every time that I pass under a bridge, enter a parking garage, drive down a street with trees ... or see a building over two stories, the signal fails.
It's always at a time when there's a news story that goes something like this : "What a game! What a game! The final score of this nail biter was _____________." ... or ... "This just in. Early this morning terrorists invaded ___________ many shots were fired at ______________ killed at least 130 people including _______________."
Arrrgggghhhh!
The only things that are clear as bells and NEVER interrupted are the commercials. COMMERCIALS? Yes commercials on commercial free radio.
You can sing along with such favorites as "1 877 cars for kids" or "MAMMA MANZONI THE MEATBALL LOVERS MEATBALLS"
Alan Thicke tells you how to get out of debt with Optima Tax Relief.
While John Commuda turns debt into wealth,
Flipping Houses still works (according to another advertiser.)
Bottom line ... you can apparently get very rich if you follow any of the hundreds of ads on Sirius, But you may never hear them because the signal is blocked.
Why ... you might ask ... am I still a subscriber?
I tried to unsubscribe 14 times ... but they disconnected me every time I drove next to a tall tree.
No comments:
I'm POSITIVE You Will Love This Show
I try not to watch the news any more. Oh... I'll listen to a podcast now and then. Certainly, Debbie will keep me informed about all t... | {
"url": "http://www.iwasbornveryyoung.com/2015/04/sirius-ly.html",
"source_domain": "www.iwasbornveryyoung.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "105807",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JHO6OJH7TESZ5E2YESEORLHCLD2F3EFC",
"WARC-Concurrent-To": "<urn:uuid:bac99c51-20bf-4c71-8c7b-e9d0192ac21d>",
"WARC-Date": "2021-10-16T00:30:11Z",
"WARC-IP-Address": "142.250.73.211",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RZEO4VRQSBYW563V7KPEYPWJMJ5KAIJP",
"WARC-Record-ID": "<urn:uuid:b5106660-d0a9-4719-93ea-34f1a748b768>",
"WARC-Target-URI": "http://www.iwasbornveryyoung.com/2015/04/sirius-ly.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1e23292e-c67f-4ced-b76f-e3c27f5a44e3>"
},
"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-190\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,
23,
24,
35,
36,
49,
50,
230,
231,
260,
261,
350,
351,
380,
381,
533,
534,
870,
871,
885,
886,
1024,
1025,
1138,
1139,
1208,
1209,
1252,
1253,
1316,
1317,
1318,
1479,
1480,
1531,
1532,
1633,
1634,
1635,
1648,
1649,
1686,
1687
],
"line_end_idx": [
23,
24,
35,
36,
49,
50,
230,
231,
260,
261,
350,
351,
380,
381,
533,
534,
870,
871,
885,
886,
1024,
1025,
1138,
1139,
1208,
1209,
1252,
1253,
1316,
1317,
1318,
1479,
1480,
1531,
1532,
1633,
1634,
1635,
1648,
1649,
1686,
1687,
1826
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1826,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3984375,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0520833283662796,
"rps_doc_frac_lines_end_with_ellipsis": 0.023255810141563416,
"rps_doc_frac_no_alph_words": 0.1979166716337204,
"rps_doc_frac_unique_words": 0.6633663177490234,
"rps_doc_mean_word_length": 4.435643672943115,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.0234375,
"rps_doc_unigram_entropy": 5.058295726776123,
"rps_doc_word_count": 303,
"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.02008928917348385,
"rps_doc_frac_chars_top_3gram": 0.0282738097012043,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -166.3643035888672,
"rps_doc_books_importance_length_correction": -164.45465087890625,
"rps_doc_openwebtext_importance": -94.58883666992188,
"rps_doc_openwebtext_importance_length_correction": -94.58883666992188,
"rps_doc_wikipedia_importance": -70.36544799804688,
"rps_doc_wikipedia_importance_length_correction": -70.35658264160156
},
"fasttext": {
"dclm": 0.019748449325561523,
"english": 0.950002908706665,
"fineweb_edu_approx": 1.0624970197677612,
"eai_general_math": 0.012225690297782421,
"eai_open_web_math": 0.15347892045974731,
"eai_web_code": 0.0046811699867248535
}
} | {
"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": "384.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Telecommunication"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "24",
"label": "User Review"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-3,436,037,824,545,585,000 | How to Hide All Other Apps on the Current Display?
I'm aware of the built in Option-Command-H to hide all other windows, however when using two displays I'd like to have this only affect the display containing the active front window - or mouse pointer if that's more feasible.
Before I dive in, has anyone else tried something like this?
That's the easy bit, either SCREEN(Front, Index) or SCREEN(Mouse, Index) will do.
Trickier is finding the not-frontmost apps that have windows on that screen and so need to be hidden. The only way I can think to do that KM-natively would be to
1. Get the "active" screen
2. Get a list of all foreground apps
3. For each app apart from the first (which is your starting frontmost app)
a. Activate the app
b. Get all the windows
c. Loop through the windows checking if any of the left, right, top, or bottom coordinates are in the "active" screen's bounds
d. If so, hide the app and exit the loop
4. Activate original frontmost app
All that app activation and window checking could mean a lot of screen flicker, CPU action, and time -- especially if, like me, you run a boatload of apps each with a boatload of windows! And it might result in extra windows if you've apps that create a new window if brought to the front with no window open.
I'm sure you could do similar with AppleScript, although with quite a bit more work to set up! I really, really, hope someone else will chip in with an "I've already done this -- here you are"...
Hey Guys,
This task is not too awful using AppleScript – with the caveat that I only have one screen and can't test properly.
It should be possible to do the same thing with native KM actions as @Nige_S describes, but I didn't want to fiddle around with that.
-Chris
Hide Non-Frontmost Application on the Main Screen v1.00.kmmacros (7.2 KB)
Keyboard Maestro Export
Interesting. Testing it on my dual monitor setup, the AppleScript has the effect of hiding all windows other than the front window, regardless of their display (so the same as the built-in cmd+opt-H behaviour).
First thoughts are that there are two things going on:
windowX1Pos is being set to a negative value for windows on my left screen, and positive for windows on the right (main) screen. That's easy enough to adjust for in the innermost if statement.
But the other problem is that I'm seeing many more window position being checked than I'd expect. So I think somewhere there's a mismatch between the window which is checked and the app that becomes hidden.
Just for clarity -- you don't hide windows, you hide applications. So if eg TextEdit is frontmost and Safari has windows open on both your main and secondary display, all your Safari windows will be closed. If that isn't the behaviour you want you'll have to do something else, like minimise windows individually.
I'm even worse with ASObjC than I am with AS, so I'm not entirely sure what @ccstone's script is doing at the beginning, but I'm surprised only two integers are involved. We need the rectangle of the primary screen so I'd expect four -- eg top-left X, top-left Y, bottom-right X, bottom-left Y; or in KM terms top-left X, top-left-Y, width, and height.
That's correct -- display coordinates have the zero point at the top-left of the main display, so anything to the left of that (as you look at the display arrangement in Display Prefs/Settings) has a -X coord, anything above has a -Y.
Okay, that makes sense. I'm going to put this aside for now and might revisit after I've had a chance to try Ventura (I didn't upgrade yet because of a potential driver issue).
Depending on how Stage Manager behaves across multiple displays, it might solve my overall need of having less stuff open when I need to focus.
All that's necessary is to have the X1 and X2 coordinates of the {X1, Y1, X2, Y2} bounds of the frame – i.e. the leftmost and rightmost x-coordinates.
Unless you have screens stacked vertically.
Then you acquire the leftmost x-coordinate of the front window, and you have everything needed to discover what screen the window is on.
That is – if I've got my logics correct...
Gotcha. I've got too many vertical stackers, eg laptop below raised second display, to make a left/right assumption which is why I was looking for the full rectangle.
1 Like | {
"url": "https://forum.keyboardmaestro.com/t/how-to-hide-all-other-apps-on-the-current-display/29688",
"source_domain": "forum.keyboardmaestro.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "34712",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O4NFU6F6QDTB4YIDI65ZVVFQVFR7FYA2",
"WARC-Concurrent-To": "<urn:uuid:7689ca5c-a806-4279-a654-e123c66bddfd>",
"WARC-Date": "2024-02-24T22:15:34Z",
"WARC-IP-Address": "192.241.223.247",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CSQBX63RVJCM7HVAWWMLMRWW46BW4JM3",
"WARC-Record-ID": "<urn:uuid:f4376855-9e6c-4450-86d9-340c7dfe32ee>",
"WARC-Target-URI": "https://forum.keyboardmaestro.com/t/how-to-hide-all-other-apps-on-the-current-display/29688",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f20cd21e-112e-4773-b812-8b3d3063ab55>"
},
"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,
51,
52,
279,
280,
341,
342,
424,
425,
587,
588,
617,
656,
734,
758,
785,
916,
961,
998,
999,
1309,
1310,
1506,
1507,
1517,
1518,
1634,
1635,
1769,
1770,
1777,
1778,
1779,
1853,
1877,
1878,
2089,
2090,
2145,
2146,
2339,
2340,
2547,
2548,
2862,
2863,
3216,
3217,
3452,
3453,
3630,
3631,
3775,
3776,
3927,
3928,
3972,
3973,
4110,
4111,
4154,
4155,
4322,
4323
],
"line_end_idx": [
51,
52,
279,
280,
341,
342,
424,
425,
587,
588,
617,
656,
734,
758,
785,
916,
961,
998,
999,
1309,
1310,
1506,
1507,
1517,
1518,
1634,
1635,
1769,
1770,
1777,
1778,
1779,
1853,
1877,
1878,
2089,
2090,
2145,
2146,
2339,
2340,
2547,
2548,
2862,
2863,
3216,
3217,
3452,
3453,
3630,
3631,
3775,
3776,
3927,
3928,
3972,
3973,
4110,
4111,
4154,
4155,
4322,
4323,
4329
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4329,
"ccnet_original_nlines": 63,
"rps_doc_curly_bracket": 0.0004619999963324517,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44387754797935486,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04897959157824516,
"rps_doc_frac_lines_end_with_ellipsis": 0.03125,
"rps_doc_frac_no_alph_words": 0.18469387292861938,
"rps_doc_frac_unique_words": 0.44768211245536804,
"rps_doc_mean_word_length": 4.415894031524658,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.002040819963440299,
"rps_doc_unigram_entropy": 5.281638145446777,
"rps_doc_word_count": 755,
"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.01049789972603321,
"rps_doc_frac_chars_top_3gram": 0.005398919805884361,
"rps_doc_frac_chars_top_4gram": 0.008398319594562054,
"rps_doc_books_importance": -449.26092529296875,
"rps_doc_books_importance_length_correction": -449.26092529296875,
"rps_doc_openwebtext_importance": -257.23358154296875,
"rps_doc_openwebtext_importance_length_correction": -257.23358154296875,
"rps_doc_wikipedia_importance": -196.15635681152344,
"rps_doc_wikipedia_importance_length_correction": -196.15635681152344
},
"fasttext": {
"dclm": 0.09178274869918823,
"english": 0.9452241063117981,
"fineweb_edu_approx": 1.2219725847244263,
"eai_general_math": 0.8195664882659912,
"eai_open_web_math": 0.27998167276382446,
"eai_web_code": 0.9033603668212891
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
8,620,140,631,122,654,000 | What Are the Functions of a Microprocessor?
Techwalla may earn compensation through affiliate links in this story.
Microprocessor on a circuit board.
Image Credit: Viper161288/iStock/Getty Images
A microprocessor controls all functions of the CPU, or central processing unit, of a computer or other digital device. The microprocessor functions as an artificial brain. The entire function of the CPU is controlled by a single integrated circuit. The microprocessor is programmed to give and receive instructions from other components of the device. The system can control everything from small devices such as calculators and mobile phones, to large automobiles.
Advertisement
History
Three companies--Intel, Texas Instruments and Garrett Air Research--developed microprocessors around the same period. Intel's 4004 microprocessor is generally accepted to be the first microprocessor. The product was unveiled by the company in 1971. The microprocessor came about in 1969 when a Japanese calculator company called Busicom required the development of a small circuit to control the calculators made by them.
Video of the Day
Features
Microprocessors work based on digital logic. The three components that form the main features of the microprocessor are a set of digital instructions, a certain bandwidth and clock speed that measures the number of instructions that a microprocessor can execute. A series of digital machine instructions are received by the microprocessor. The ALU, or arithmetic logic unit, of the processor does a series of calculations based on the instructions received. Additionally, the unit moves data from one memory to another and has the capacity to jump from one set of instructions to another.
Advertisement
Function
The microprocessor functions through two memories. The read only memory, or ROM, is a program with a fixed set of instructions and is programmed with a fixed set of bytes. The other memory is the RAM, or random access, memory. The number of bytes in this memory is variable and lasts for a short term. If power is switched off the RAM is wiped out. The ROM has a small program within it called the BIOS, or the basic input output system. The BIOS tests the hardware on the machine when it starts up. It then fetches another program in the ROM called the boot sector. This boot sector program executes a series of instructions that helps to utilize the computer effectively.
Advertisement
Considerations
Computers are not merely data processors. Microprocessors should be able to execute instructions in data, audio and video formats. They should support a range of multimedia effects. A 32-bit microprocessor is essential to support multimedia software. With the advent of the internet, microprocessors should have the capacity to support virtual memory and physical memory. They should be able to work with DSP or digital signal processors to handle audio video and playback formats. Fast microprocessors do not require a DSP.
Advertisement
Potential
In this the digital age, there are very few gadgets that do not contain a microprocessor. Advancements in medicine, weather forecasting, automobiles, communications, design and scientific experiments were the results of the development of digital gadgets with microprocessors. Automation for difficult manual jobs is possible because of the microprocessor. The digital logic of microprocessors has led to greater efficiency and speed in all aspects of life. The potential of microprocessor use is therefore immense. Microprocessors ensure lighter, hand-held machinery, imaging and communication systems that have and will improve lifestyles on a global scale.
Advertisement
references | {
"url": "https://www.techwalla.com/articles/what-are-the-functions-of-a-microprocessor",
"source_domain": "www.techwalla.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "499529",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JRWS4SY5HRDDAPZDCCSCOV6WGOVCUJML",
"WARC-Concurrent-To": "<urn:uuid:f22ee92c-b3fc-47c7-9c56-46e4b94375db>",
"WARC-Date": "2021-10-25T20:14:59Z",
"WARC-IP-Address": "104.83.225.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZJ7F6OORQ3F5G6Z5Y2PADS6FRSF5WWNT",
"WARC-Record-ID": "<urn:uuid:5c977d7e-57e8-4ce4-8728-f1cc55819b05>",
"WARC-Target-URI": "https://www.techwalla.com/articles/what-are-the-functions-of-a-microprocessor",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3b754860-b26f-48d9-a78b-9cd925b6ef57>"
},
"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-231\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,
44,
45,
116,
151,
197,
198,
664,
665,
679,
680,
688,
689,
1111,
1112,
1129,
1130,
1139,
1140,
1729,
1730,
1744,
1745,
1754,
1755,
2429,
2430,
2444,
2445,
2460,
2461,
2986,
2987,
3001,
3002,
3012,
3013,
3673,
3674,
3688,
3689
],
"line_end_idx": [
44,
45,
116,
151,
197,
198,
664,
665,
679,
680,
688,
689,
1111,
1112,
1129,
1130,
1139,
1140,
1729,
1730,
1744,
1745,
1754,
1755,
2429,
2430,
2444,
2445,
2460,
2461,
2986,
2987,
3001,
3002,
3012,
3013,
3673,
3674,
3688,
3689,
3699
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3699,
"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.375786155462265,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023584909737110138,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11477986723184586,
"rps_doc_frac_unique_words": 0.4464285671710968,
"rps_doc_mean_word_length": 5.4464287757873535,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.901464939117432,
"rps_doc_word_count": 560,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.009836070239543915,
"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.014754099771380424,
"rps_doc_frac_chars_top_3gram": 0.0088524604216218,
"rps_doc_frac_chars_top_4gram": 0.00852459017187357,
"rps_doc_books_importance": -233.7266082763672,
"rps_doc_books_importance_length_correction": -233.7266082763672,
"rps_doc_openwebtext_importance": -155.3832244873047,
"rps_doc_openwebtext_importance_length_correction": -155.3832244873047,
"rps_doc_wikipedia_importance": -137.83969116210938,
"rps_doc_wikipedia_importance_length_correction": -137.83969116210938
},
"fasttext": {
"dclm": 0.6881420612335205,
"english": 0.9281467199325562,
"fineweb_edu_approx": 3.0876688957214355,
"eai_general_math": 0.6861382722854614,
"eai_open_web_math": 0.12317997217178345,
"eai_web_code": 0.5851624011993408
}
} | {
"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.2",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,182,062,605,911,292,200 | TechSpot
Dual Channel vs More RAM
By fulchat
Jun 11, 2007
1. Maybe a simple answer but the fact that I dont know what the answer is means I have to ask. I have 2x512 running a 939 socket single core AMD 3800+ @ 2.7GHz. Installed RAM is DDR400/2x512 running in dual channel. Ive come across a stick of DDR333/512 and I would like to use it but I need to know if Im going backwards in terms of performance. As you can see my overclock is not great at all so I dont consider it a concern to revert back to stock frequency (2.4GHz) as long as Im gaining performance with more RAM. Theres no need to get specific if you dont have the time but a general rule of thumb would suffice.
Thanx
2. k.jacko
k.jacko TS Rookie Posts: 493
Unless i'm mistaken ,if the stick of ram is the same spec, then on certain boards it will still use your existing ram in dual channel mode, but with the extra stick added as well in probably single channel.
This will need clarification, but i'm sure i've read or heard it somewhere.
3. fulchat
fulchat TS Rookie Topic Starter
Please somebody say its so.................................
Thanx for your reply.
4. KingCody
KingCody TS Evangelist Posts: 992 +7
1. memory can only run in one mode at a time; single channel or dual channel. it cannot operate in both modes similtaneously.
2. on certain intel and pre-AMD64 motherboards, it could run in dual channel mode with an odd number if sticks (one stick would have to equal the total amount of the other two sticks).
3. on AMD64 systems (including socket-939) the memory controller is on the CPU, so the motherboard model doesn't matter (when refering to memory/channel configurations).
4. socket 939 systems can run an odd number od memory sticks, but it will revert to single channel mode, regardless of what memory sticks are installed.
5. as for what is better [performance--wise] is different for each person. use a memory usage monitoring program to see how much physical memory you're currently using. if it's less than 1024MB then it's fine the way it is and you'll benefit more from the dual channel. if you're using more than 1024MB then you will probably benefit more from the extra 512MB of physical memory.
cheers :wave:
5. fulchat
fulchat TS Rookie Topic Starter
Thankyou much.
Topic Status:
Not open for further replies.
Similar Topics
Create an account or login to comment
You need to be a member in order to leave a comment
TechSpot Members
Login or sign up for free,
it takes about 30 seconds.
You may also...
Get complete access to the TechSpot community. Join thousands of technology enthusiasts that contribute and share knowledge in our forum. Get a private inbox, upload your own photo gallery and more. | {
"url": "http://www.techspot.com/community/topics/dual-channel-vs-more-ram.79337/",
"source_domain": "www.techspot.com",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "43582",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MVP6L6NBD7FBRP6RGK6YAYIAKU3U6MN2",
"WARC-Concurrent-To": "<urn:uuid:e9fe20f0-92c5-4431-9415-60462bc226e3>",
"WARC-Date": "2016-05-26T22:49:53Z",
"WARC-IP-Address": "184.173.241.66",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HMPWKPZ5PKRJLWCM5HVFXBFNRRPGF4QS",
"WARC-Record-ID": "<urn:uuid:948a3eba-9fb3-4236-a9b9-657ef61e8330>",
"WARC-Target-URI": "http://www.techspot.com/community/topics/dual-channel-vs-more-ram.79337/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d2006693-3bb0-4ba7-94ac-8c36758478d3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
9,
10,
35,
36,
47,
60,
681,
682,
692,
698,
711,
712,
745,
746,
957,
958,
1038,
1044,
1057,
1058,
1094,
1095,
1159,
1160,
1186,
1192,
1206,
1207,
1250,
1251,
1381,
1382,
1571,
1572,
1746,
1747,
1904,
1905,
2289,
2290,
2308,
2314,
2327,
2328,
2364,
2365,
2384,
2390,
2404,
2434,
2435,
2450,
2451,
2489,
2490,
2542,
2559,
2586,
2613,
2629,
2630,
2631
],
"line_end_idx": [
9,
10,
35,
36,
47,
60,
681,
682,
692,
698,
711,
712,
745,
746,
957,
958,
1038,
1044,
1057,
1058,
1094,
1095,
1159,
1160,
1186,
1192,
1206,
1207,
1250,
1251,
1381,
1382,
1571,
1572,
1746,
1747,
1904,
1905,
2289,
2290,
2308,
2314,
2327,
2328,
2364,
2365,
2384,
2390,
2404,
2434,
2435,
2450,
2451,
2489,
2490,
2542,
2559,
2586,
2613,
2629,
2630,
2631,
2829
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2829,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.409326434135437,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037996549159288406,
"rps_doc_frac_lines_end_with_ellipsis": 0.0317460298538208,
"rps_doc_frac_no_alph_words": 0.18307426571846008,
"rps_doc_frac_unique_words": 0.5073375105857849,
"rps_doc_mean_word_length": 4.408804893493652,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.020725389942526817,
"rps_doc_unigram_entropy": 5.1624531745910645,
"rps_doc_word_count": 477,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03233475983142853,
"rps_doc_frac_chars_dupe_6grams": 0.03233475983142853,
"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.03138374164700508,
"rps_doc_frac_chars_top_3gram": 0.018544940277934074,
"rps_doc_frac_chars_top_4gram": 0.016167379915714264,
"rps_doc_books_importance": -262.03936767578125,
"rps_doc_books_importance_length_correction": -262.03936767578125,
"rps_doc_openwebtext_importance": -158.95040893554688,
"rps_doc_openwebtext_importance_length_correction": -158.95040893554688,
"rps_doc_wikipedia_importance": -81.87498474121094,
"rps_doc_wikipedia_importance_length_correction": -81.87498474121094
},
"fasttext": {
"dclm": 0.35208022594451904,
"english": 0.9255242347717285,
"fineweb_edu_approx": 1.3728281259536743,
"eai_general_math": 0.11687731742858887,
"eai_open_web_math": 0.1564146876335144,
"eai_web_code": 0.010826470330357552
}
} | {
"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.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,423,598,242,264,403,000 | Tortoise Shell
Webサービスの会社で働くデザイナーが、デザインやライフハックについてゆるく書き連ねるブログです。
Unity製のVRゲームで、初めてOculus Storeに申請して引っかかったポイント
こちらは「Unity #3 Advent Calendar 2018」の、21日目の記事です。
こんにちは、tamuと申します。
先月ぐらいに、初めてUnityでVR向けのゲームを作成しまして、Oculus Storeに申請チャレンジしました。
しかし、何度もリジェクトを食らってしまい、かなりの時間をロスしてしまいました。
Oculus Storeへの申請に関しては、ノウハウも以前と比べてシェアされるようになってきましたが、それでもまだ情報は少ないと思います。
そこで今回は、わたしがUnity製のVRゲームで、初めてOculus Storeに申請して引っかかったポイントについてご紹介します。
なお、先に結論を言ってしまうと、わたしの場合は結局「キー承認のみ」で、ストアに並ぶまで至りせんでした。
作ったゲーム
今回申請したのは、以下のような、ハロウィン風のシューティングゲームでした。
魔法の杖から炎を出して、制限時間内に、何体のカボチャのお化けを退治できるか挑戦します。
1回目のレビュー
最初に申請した際には、次の3点について指摘を受けました。
VRC.Mobile.Input.3
Pressing the Back button doesn't go back one level in the menu UI hierarchy, nor does it display a menu with an option to quit the app.
Backボタンを押しても、メニューの1つ前に戻ったり、アプリケーションを終了するオプションが何も表示されないよ。と怒られました。
Oculus Storeのアプリでは、Backボタンに対して、システムダイアログかメニューの1つ上の階層へ戻れるようにしなければなりません。
対応するのは簡単で、以下のスクリプトを足すだけでOKでした。
if (OVRInput.GetDown(OVRInput.Button.Back)) {
OVRManager.PlatformUIConfirmQuit();
}
今回の場合は、トリガーを引くと炎が飛ぶよう実装していたので、そこに足す形で対応しました。
void Update() {
if (OVRInput.GetDown(OVRInput.Button.PrimaryIndexTrigger))
{
// トリガーが引かれたら魔法を生成
Instantiate(magicPrefab, staffEnd.position, staffEnd.rotation);
// 発射時の音を再生
magicAudioSource.Play();
}
if (OVRInput.GetDown(OVRInput.Button.Back))
{
// Backボタンが押されたら、システムダイアログを開く
OVRManager.PlatformUIConfirmQuit();
}
}
参考: Common Oculus Store Review Submission Issues | Oculus
VRC.Mobile.Input.6
When the device handedness is set to left-handed, the user's pointer line originates from the center of the user's Point-Of-View and becomes unresponsive.
デバイスの利き手が左に設定されている場合、ポインターはユーザーの視点の中心から発生し、応答しなくなります。と怒られました。
こちらもよくある指摘なようで、Oculus Goの場合、ユーザーはあらかじめ利き手の設定をしています。
わたしの場合、右利きということで、その前提で作り進めてしまいましたが、両手に対応させるのを忘れていました。
もともと、コントローラーをインスペクター上でアタッチしていたのですが、これだと常に決まった利き手にしか対応できません。
f:id:tamusan100:20181215235129p:plain
そこで、インスペクター上から設定するのをやめて、スクリプトで最初に利き手を判定させる仕様に切り替えました。
using System.Collections;
using System.Collections.Generic;
using UnityEngine;
public class Shooter : MonoBehaviour {
[SerializeField] Transform _RightHandAnchor; // 右手
[SerializeField] Transform _LeftHandAnchor; // 左手
[SerializeField] Transform _CenterEyeAnchor; // 両目
[SerializeField] GameObject magicPrefab; // 魔法のプレハブ
[SerializeField] AudioSource magicSource; // 魔法の音源
[SerializeField] Transform staff; // 魔法の発射位置
// コントローラーを取得
public Transform hand {
get {
var controller = OVRInput.GetActiveController();
if (controller == OVRInput.Controller.RTrackedRemote)
{
return _RightHandAnchor;
}
else if (controller == OVRInput.Controller.LTrackedRemote)
{
return _LeftHandAnchor;
}
return _CenterEyeAnchor;
}
}
void Update() {
if (OVRInput.GetDown(OVRInput.Button.PrimaryIndexTrigger))
{
// トリガーが引かれたら魔法を生成
Instantiate(magicPrefab, staffEnd.position, staffEnd.rotation);
// 発射時の音を再生
magicAudioSource.Play();
}
if (OVRInput.GetDown(OVRInput.Button.Back))
{
// Backボタンが押されたら、システムダイアログを開く
OVRManager.PlatformUIConfirmQuit();
}
}
void Start(){
// 杖を手の位置に合わせる
staff = hand;
}
}
これによって、右利きにも左利きにも、対応できるようになりました。
VRC.Mobile.Security.2
Your app is asking for the following excessive or inappropriate user permissions: Record Audio / Access the microphone. Please remove all unnecessary permissions. If your app requires any of the permissions listed above please explain in detail why your app needs the permission in order to function.
あなたのアプリは、過度にユーザー権限（オーディオ・マイク）を要求しています。
不要な権限をすべて削除してください。もし必要なのであれば、その理由を説明してください。と怒られました。
え？オーディオとかマイクの権限を要求した記憶なんてないんだけど？
と思っていたのですが、「Oculus Integration」の以下のファイルが影響しているようです。
f:id:tamusan100:20181215234243p:plain
Assets/Oculus/Platform/Scripts/IMicrophone.cs
Assets/Oculus/Platform/Scripts/LivestreamingMicrophoneStatus.cs
Assets/Oculus/Platform/Scripts/MicrophoneInput.cs
Assets/Oculus/Platform/Scripts/MicrophoneInputNative.cs
Assets/Oculus/LipSync/Scripts/OVRLipSyncMicInput.cs
Assets/Oculus/VoiceMod/Scripts/Helpers/OVRMicInput.cs
これらをいったん削除することで、クリアすることができました。
参考: Oculus GO アプリで、マイクのパーミッションが出ないようにする - littlewing
2回目のレビュー
よっしゃ、今度こそ申請に通るぞ！と思ったのですが、もう1つ指摘を受けました。
VRC.Mobile.Input.6
When the device handedness is set to left-handed, the user's in-app controller asset disappears. The user can continue to fire projectiles in gameplay, but cannot make menu selections on the main menu.
左利きに設定されている場合、コントローラーのアセットが消えてしまいます。
ユーザーは、プレイ中に発射物（魔法）を射出することはできますが、メニュー上で選択することができません。と怒られてしまいました。
あれ〜おかしいな。両手対応はさっきやったはずなのに。
と思っていたら、基本的なことを忘れていました。
f:id:tamusan100:20181215234120p:plain
OVRCameraRigの中で、TrackRemoteのLeftHandAnchorの設定が、右手のままになっていたのです。
LeftHandAnchorと書いてあっても、デフォルトでは右手になっているので、変更しておきましょう。
この対応で、クリアすることができました。（これもよくある話らしいです。）
参考: OculusGoで左利き設定時、アプリ内でコントローラが表示されなかったときの確認箇所 - Qiita
3回目のレビュー
よし、3度目の正直だ！と言いたいところでしたが。
The following feedback
The following feedback is for your app during content review: -Your app currently contains limited content for a wide audience store launch.
テクニカルレビューは通過していたので、よっしゃ！と思っていたのですが、別のフィードバックが届いていました。
あなたのアプリは、幅広いオーディエンスに届けるのに、限られたコンテンツです。という意味でしょうか。
出たよ…ふわっとしたフィードバック＼(^o^)／
ググってみても事例が見つからず、しばらく途方に暮れていたのですが、次の2つの仮説を思いつきました。
1. ハロウィンでホラー風なので、幅広いユーザーに届けるには不適切
2. コンテンツのボリュームが限られていて、ストアに並べられるレベルではない
真っ先に思いついたのは前者で、申請の際に、対象年齢を全年齢に設定していました。ホラーやバイオレンス等の指定もしていませんでした。
ひょっとしてこれか？と思い、対象年齢を引き上げて申請したところ…。
f:id:tamusan100:20181215225742p:plain
数日後に確認したら、「キーの承認のみ」の状態になっていました。
でも、ストアには並べてもらえないんですね...orz
ひょっとすると、コンテンツのボリュームが少ないというのも、同時に影響しているのかもしれません。
一応アプリとして配布できる状態になったので、いったんここまでで諦めることにしました。
おわりに
Unityについて、まだまだ理解が浅いこともあり、基本的なところで何度もつまづいてしまいました。
載せているコードなど、「こう書いた方がいいのでは？」という箇所があれば、ぜひご指摘いただけますと幸いです。（まだ体で覚えて、無理やり書いている自覚があるので）
それでは、来年も楽しいUnityライフをお過ごしください。メリークリスマス！ | {
"url": "https://www.tortoise-shell.net/entry/unity-game-for-oculus-store",
"source_domain": "www.tortoise-shell.net",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "56669",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z34SIO34MK6QSPKSR5GW7QJ3M2JKMX6W",
"WARC-Concurrent-To": "<urn:uuid:b27454b3-9b47-4acf-a813-05065d908bbb>",
"WARC-Date": "2019-01-16T04:25:39Z",
"WARC-IP-Address": "13.230.115.161",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QLCE7QGVTCJHJ47O4WAQ2T4A6GCVJNFZ",
"WARC-Record-ID": "<urn:uuid:05a433dc-8a91-4d8d-8ca8-456370d82f6b>",
"WARC-Target-URI": "https://www.tortoise-shell.net/entry/unity-game-for-oculus-store",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:39901a59-176c-4cfd-b251-2f2be305963a>"
},
"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-101-220-24.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
15,
16,
66,
67,
112,
113,
161,
162,
179,
180,
238,
239,
279,
280,
350,
351,
418,
419,
471,
472,
479,
480,
518,
519,
563,
564,
573,
574,
603,
604,
623,
624,
760,
761,
826,
827,
898,
899,
930,
931,
977,
1017,
1019,
1020,
1065,
1066,
1082,
1149,
1159,
1190,
1266,
1267,
1291,
1328,
1338,
1339,
1391,
1401,
1443,
1491,
1501,
1503,
1504,
1562,
1563,
1582,
1583,
1738,
1739,
1801,
1802,
1854,
1855,
1909,
1910,
1970,
1971,
2009,
2063,
2064,
2090,
2124,
2143,
2144,
2183,
2184,
2239,
2294,
2349,
2350,
2406,
2461,
2510,
2511,
2529,
2557,
2571,
2632,
2698,
2712,
2753,
2767,
2838,
2852,
2892,
2906,
2943,
2953,
2959,
2960,
2980,
3047,
3057,
3088,
3164,
3165,
3189,
3226,
3236,
3237,
3289,
3299,
3341,
3389,
3399,
3405,
3406,
3424,
3447,
3469,
3475,
3477,
3478,
3511,
3512,
3534,
3535,
3836,
3837,
3876,
3877,
3929,
3930,
3963,
3964,
4016,
4017,
4055,
4056,
4102,
4166,
4216,
4272,
4324,
4378,
4379,
4410,
4411,
4464,
4465,
4474,
4475,
4514,
4515,
4534,
4535,
4737,
4738,
4775,
4776,
4840,
4841,
4868,
4869,
4893,
4894,
4932,
4933,
4996,
4997,
5050,
5051,
5088,
5089,
5145,
5146,
5155,
5156,
5181,
5182,
5205,
5206,
5347,
5348,
5402,
5403,
5453,
5454,
5479,
5480,
5530,
5531,
5567,
5608,
5609,
5674,
5675,
5709,
5710,
5748,
5749,
5781,
5782,
5809,
5810,
5858,
5859,
5902,
5903,
5908,
5909,
5958,
5959,
6039,
6040
],
"line_end_idx": [
15,
16,
66,
67,
112,
113,
161,
162,
179,
180,
238,
239,
279,
280,
350,
351,
418,
419,
471,
472,
479,
480,
518,
519,
563,
564,
573,
574,
603,
604,
623,
624,
760,
761,
826,
827,
898,
899,
930,
931,
977,
1017,
1019,
1020,
1065,
1066,
1082,
1149,
1159,
1190,
1266,
1267,
1291,
1328,
1338,
1339,
1391,
1401,
1443,
1491,
1501,
1503,
1504,
1562,
1563,
1582,
1583,
1738,
1739,
1801,
1802,
1854,
1855,
1909,
1910,
1970,
1971,
2009,
2063,
2064,
2090,
2124,
2143,
2144,
2183,
2184,
2239,
2294,
2349,
2350,
2406,
2461,
2510,
2511,
2529,
2557,
2571,
2632,
2698,
2712,
2753,
2767,
2838,
2852,
2892,
2906,
2943,
2953,
2959,
2960,
2980,
3047,
3057,
3088,
3164,
3165,
3189,
3226,
3236,
3237,
3289,
3299,
3341,
3389,
3399,
3405,
3406,
3424,
3447,
3469,
3475,
3477,
3478,
3511,
3512,
3534,
3535,
3836,
3837,
3876,
3877,
3929,
3930,
3963,
3964,
4016,
4017,
4055,
4056,
4102,
4166,
4216,
4272,
4324,
4378,
4379,
4410,
4411,
4464,
4465,
4474,
4475,
4514,
4515,
4534,
4535,
4737,
4738,
4775,
4776,
4840,
4841,
4868,
4869,
4893,
4894,
4932,
4933,
4996,
4997,
5050,
5051,
5088,
5089,
5145,
5146,
5155,
5156,
5181,
5182,
5205,
5206,
5347,
5348,
5402,
5403,
5453,
5454,
5479,
5480,
5530,
5531,
5567,
5608,
5609,
5674,
5675,
5709,
5710,
5748,
5749,
5781,
5782,
5809,
5810,
5858,
5859,
5902,
5903,
5908,
5909,
5958,
5959,
6039,
6040,
6078
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6078,
"ccnet_original_nlines": 225,
"rps_doc_curly_bracket": 0.004277720116078854,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09090909361839294,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007314519956707954,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5872518420219421,
"rps_doc_frac_unique_words": 0.6753623485565186,
"rps_doc_mean_word_length": 14.698551177978516,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0.004179730080068111,
"rps_doc_unigram_entropy": 5.215705871582031,
"rps_doc_word_count": 345,
"rps_doc_frac_chars_dupe_10grams": 0.12541905045509338,
"rps_doc_frac_chars_dupe_5grams": 0.12541905045509338,
"rps_doc_frac_chars_dupe_6grams": 0.12541905045509338,
"rps_doc_frac_chars_dupe_7grams": 0.12541905045509338,
"rps_doc_frac_chars_dupe_8grams": 0.12541905045509338,
"rps_doc_frac_chars_dupe_9grams": 0.12541905045509338,
"rps_doc_frac_chars_top_2gram": 0.006901990156620741,
"rps_doc_frac_chars_top_3gram": 0.004732789937406778,
"rps_doc_frac_chars_top_4gram": 0.023663969710469246,
"rps_doc_books_importance": -417.3119812011719,
"rps_doc_books_importance_length_correction": -417.3119812011719,
"rps_doc_openwebtext_importance": -319.1914367675781,
"rps_doc_openwebtext_importance_length_correction": -319.1914367675781,
"rps_doc_wikipedia_importance": -209.6017608642578,
"rps_doc_wikipedia_importance_length_correction": -209.6017608642578
},
"fasttext": {
"dclm": 0.9077714681625366,
"english": 0.001940540038049221,
"fineweb_edu_approx": 1.205877423286438,
"eai_general_math": 0.07590979337692261,
"eai_open_web_math": 0.01620382070541382,
"eai_web_code": 0.30069130659103394
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285636",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.815",
"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": "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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,766,291,035,958,981,000 | Search
Announcing poshrunner.exe so MyScript.ps1 can use MyScript.ps1.config instead of powershell.exe.config
I have a tendency to do odd things with technology so that things don’t just work. When I point out the obscure edge cases I find, most people tell me, “well don’t do that.” I usually ignore them and dream of tilting windmills. Well today a windmill has been tilted, and this is the epic tale.
I’m a developer that fell in love with PowerShell. As such I often call .NET API functions from powershell scripts. This usually just works. However, it kind of falls apart when you have to use settings in the app.config file. This means its basically impossible call functions from a DLL that use NHibernate, Entity Framework or WCF Service references. (However, WCF Services can be called direcctly from PowerShell quite easily)
The solution is to run the PowerShell script in a new PowerShell Runspace in a second AppDomain that uses its own app.config. However, things quickly fall apart because you need to write three classes that inherit from PSHostRawUserInterface, PSHostUserInterface and PSHost respectively or else Write-Host will throw an exception.
Now all this is a lot scarier than it sounds. However, it stops two important groups of people from ever using PowerShell to call DLLs that absolutely require you to manipulate your app.config:
• People scared off by the word AppDomain
• People that realize they have better things to do than everything I described above
Lucky for these two groups of people, I wasted my time so they didn’t have to! The project is currently called AppDomainPoshRunner, and I ILMerge it (via IL-Repack) into poshrunner.exe. Right now poshrunner takes one command line argument, the path to a script. If the script exists it will run it in an AppDomain whose config file is scriptname.config. Log4net configuration is read from a file called ADPR.log4net.config in the same directory as poshrunner.config.
The full background is to long and convoluted for this post. This was all born out of a problem with calling New-WebServiceProxy twice in the same PowerShell console. I use log4net to write the console messages so this has the potential to be quite extendable. Then Stan needed to run PowerShell scripts from msbuild and was complaining to me about it over twitter. He didn’t like the hacky solution I had then. Eventually I realized this was the way to simplify my previous solution.
So download the zip file. Try it out. Complain to me when you find bugs!
TLDR; Unlike powershell.exe -file foo.ps1, which uses the shared powershell.exe.config, poshrunner.exe foo.ps1 uses foo.ps1.config, for great justice. Download it now!
Visual Studio 2010 and VisualStudio.com TFS Hosting
Yesterday, Stan, the founder of this blog, gave me a link to a project host on the Team Foundation Service (visual studio.com). I tried to connect to it with Visual Studio 2010. it simply refused to work.
Visual Studio Add TFS Server Error
After much annoyance, he asked me to try adding the TFS server to Visual Studio 2012 and it worked (Why didn’t I think of that?). Eventually I figured out that I needed to install the Visual Studio 2010 SP1 Team Foundation Server 2012 Compatibility GDR (KB2662296). Then I was able to add the solution to Visual Studio 2010. It seems there are several updates for Visual Studio 2010 SP1, some specifically dealing with Windows 8 compatibility. Unfortunately Windows update does not prompt me to install them. I will search for and install these tonight to prevent future issues.
Windows Internals Study Group – First meeting
Last night myself and two others had out first planning meeting via google huddle for our Windows Internals Study group. We will be meeting next Wednesday 2012-11-17 at 20:30 EST to discuss the first two chapters of Windows Internals 6th edition. If you still want to participate its not too late, just let me know.
One thing we decided was to make all our notes public. Right now they are being stored in a google drive shared folder that is publicly accessible. The information there will grow with time.
My ConEmu Tasks
Update: Thanks to the author of ConEmu for some constructive feedback in the comments!
I’ve fallen in love with ConEmu, after being introduced to it by a Scott Hanselman blog post. While my initial attraction to it was its integration with farmanager, that was only its initial selling point. The ability to have one resizable tabbed window to hold all my cmd.exe, powershell.exe and bash.exe consoles is what makes it a killer app.
While 90% of my command line needs are met by a vanilla powershell.exe or far.exe command line, sometimes I need my environment set up in another way. For example, sometimes I need the vcvarsall.bat run that sets the environment up for a particular version of Visual Studio or the Windows SDK. Also, on occasion I will need to fire up the mingw bash instance that comes with git. (Generally, this is only to run sshkeygen.exe). Finally, while a 64 bit instance of PowerShell 3.0 captures 99% of my PowerShell needs, I want easy access to both 32 and 64 bit versions of the PowerShell 1.0, 2.0 and 3.0 environments.
So I set all these up in ConEmu, and exported the registry keys into a gist repository, and now I share them here as a pastebin (because githup lacks syntax highlighting):
Breakdown of settings
All the settings are stored in subkeys of HKEY_CURRENT_USER\Software\ConEmu\.Vanilla\Tasks with the name TaskN where N is a base 10 integer. In addition, that key has a DWORD value named Count that contains the number of tasks.
Each task contains the following key/value pairs:
• Name This is the name of the task
• GuiArgs These are the ConEmu configuration options. In all my cases I use /single /Dir %userprofile%. The /single flag adds the task to the currently open ConEmu instance, if there is one. The /Dir %userprofile% switch sets the working directory to my home directory.
• CmdN These are the commands executed. Each one represents a command executed in a new tab by a task. All the tasks I have configured execute exactly one tab.
• CountThis is the number of tabs opened by this command. Like the TaskN keys, it should match up to the number CmdN Values in a Task.
• Active I set this to zero, but if you have a task that open multiple tabs you can set this to the tab number you want activated after running that task. For example, If you have a task with a Cmd1 that opens mongod.exe, and a Cmd2 that opens up an instance of tail.exe tailing the mongo logs, setting Active to 2 will display the console running the tail.
ConEmu’s true power is your ability to customize it, so by showing you how I customized it, I hope you have found it to be more powerful. | {
"url": "https://justaprogrammer.net/2012/11/",
"source_domain": "justaprogrammer.net",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "31960",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:36ACWFGUDCDFWZWJOLP5X6UO3FPWDZY2",
"WARC-Concurrent-To": "<urn:uuid:8bf1129f-90c1-4893-aa40-fc4aa06749fd>",
"WARC-Date": "2019-03-23T07:18:38Z",
"WARC-IP-Address": "45.79.173.117",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BS3XTBDFYQ3ST35YSSWULMBXU5EF4KTD",
"WARC-Record-ID": "<urn:uuid:03f26b1b-bef7-4913-a04c-0d0619018cb2>",
"WARC-Target-URI": "https://justaprogrammer.net/2012/11/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5de9247b-c976-47cf-b118-a865b374f331>"
},
"warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-155-175-115.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
8,
111,
112,
406,
407,
838,
839,
1170,
1171,
1365,
1366,
1410,
1498,
1499,
1966,
1967,
2452,
2453,
2526,
2527,
2695,
2696,
2748,
2749,
2954,
2955,
2990,
2991,
3570,
3571,
3617,
3618,
3934,
3935,
4126,
4127,
4143,
4144,
4231,
4232,
4578,
4579,
5194,
5195,
5367,
5368,
5390,
5391,
5619,
5620,
5670,
5671,
5709,
5981,
6143,
6280,
6640,
6641
],
"line_end_idx": [
7,
8,
111,
112,
406,
407,
838,
839,
1170,
1171,
1365,
1366,
1410,
1498,
1499,
1966,
1967,
2452,
2453,
2526,
2527,
2695,
2696,
2748,
2749,
2954,
2955,
2990,
2991,
3570,
3571,
3617,
3618,
3934,
3935,
4126,
4127,
4143,
4144,
4231,
4232,
4578,
4579,
5194,
5195,
5367,
5368,
5390,
5391,
5619,
5620,
5670,
5671,
5709,
5981,
6143,
6280,
6640,
6641,
6778
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6778,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39211469888687134,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03584228828549385,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1620071679353714,
"rps_doc_frac_unique_words": 0.43167972564697266,
"rps_doc_mean_word_length": 4.697998046875,
"rps_doc_num_sentences": 105,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.580625534057617,
"rps_doc_word_count": 1149,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.005187110044062138,
"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.01778436079621315,
"rps_doc_frac_chars_top_3gram": 0.014820300042629242,
"rps_doc_frac_chars_top_4gram": 0.006669139955192804,
"rps_doc_books_importance": -546.7952880859375,
"rps_doc_books_importance_length_correction": -546.7952880859375,
"rps_doc_openwebtext_importance": -300.9292297363281,
"rps_doc_openwebtext_importance_length_correction": -300.9292297363281,
"rps_doc_wikipedia_importance": -216.17575073242188,
"rps_doc_wikipedia_importance_length_correction": -216.17575073242188
},
"fasttext": {
"dclm": 0.05301940068602562,
"english": 0.9237269759178162,
"fineweb_edu_approx": 1.7310079336166382,
"eai_general_math": 0.8859020471572876,
"eai_open_web_math": 0.32999348640441895,
"eai_web_code": 0.4431212544441223
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,634,519,433,605,577,700 | Implementation of Microsoft's XNA 4 APIS for Android, iOS, MacOS and Linux.
learn more… | top users | synonyms
1
vote
0answers
26 views
Accelerate top-down 2d ship based on heading and engine power
I'm trying to implement some sort of faux space physics in my 2D game. I have a top down view of my space ship. You can change direction and set a speed up to a maximum which then accelerates the ship ...
1
vote
0answers
8 views
Monogame - Not enough storage is available to complete this operation, on backgrounds
I am making a level selector, which works like a web slider. I am showing 12 levels per page, and I have a total number of 60, which means 5 pages of 12 levels. Each level has his on background ...
0
votes
0answers
11 views
Using Farseer Physics, how can I get objects to bounce at the correct angle
I am using the Farseer Physics engine in my MonoGame project. I have static walls which have "body" friction 0 and "body" restitution 1. I have dynamic objects, which are circles, with "body" friction ...
1
vote
1answer
38 views
Black Rectangle instead of texture
I am trying to draw a textured ractangle like in this example. But instead of a texture the rectangle is just black. Draw method: protected override void Draw(GameTime gameTime) { ...
0
votes
1answer
38 views
Monogame / XNA - Multple 2D Cameras (Rectangle) on screen
I recently started building a simple 2D roguelike game using Monogame 3.4. I was keen on building the game "engine" myself as I saw it as a fun learning curve. Monogame was pretty much the best option ...
0
votes
0answers
20 views
Rotation before scaling image/Lower resolution rotation? (XNA/C#)
Currently, when I rotate the image using SpriteBatch.Draw() the image is rotated after it is scaled. Resulting in: Which is using the code public override void Draw(GameTime gameTime) { ...
1
vote
1answer
20 views
Adding shadow and other effects on a spritefont Monogame
Is there a way that I can add shadow effect on text drawn in monogame? Because you cannot add shadow effect when creating a new spritefont file in Monogame Content Pipeline. Thanks.
0
votes
1answer
49 views
Circle Depth Penetration
I'm resolving some collision between circles and I keep getting this problem. Note: The rectangles are perfect squares fitting the circles so when I type rect.Width I mean the radius of the circle. ...
0
votes
0answers
25 views
How to get plausible platformer physics with Farseer on MonoGame/XNA?
I am creating a 2D Vectorial (made of polygons, not tiles !) platformer using MonoGame and Farseer Physics Engine. Everything works perfectly, except the movement of the character which doesn't feels ...
1
vote
2answers
41 views
Best practice for scrollable viewport rendering
I am working on a tile based game that renders the playing surface in a viewport. I am struggling with getting my head around the mechanics and best practices of rendering a viewport, specifically a ...
0
votes
1answer
34 views
Enemy Follow Player Orthogonal Movement
I have a Enemy class that Seeks a player if he is in his field of view. Problem is i want the enemy only to move up/down/right/left, not like for example up and left at the same time (diagonal ...
0
votes
0answers
15 views
How to Dispose SharpDX resources?
I have made two different posts the last couple of days about we going from XNA to MonoGame and how the application increase in memory and no input from keyboard is detected after the first time it ...
1
vote
1answer
87 views
Keyboard.GetState() only work first time, and Memory increase (not Disposing)
EDIT UPDATE 3 I been searching the web for a solution and found several people struggling with Memoryleak using MonoGame while trying to dispose objects. It could be the case that MonoGame should be ...
0
votes
0answers
18 views
MonoGame disable spritefont anti-alising?
Ive got a pixel art font and when I draw it theres a lot of antialiasing going on which totally ruins the point of making the font pixel art? How can I disable this? My SamplerState is set to ...
2
votes
0answers
57 views
In MonoGame, how can I disable font anti-aliasing?
I am building a game with a "low resolution" aesthetic, so I would like to disable the default font anti-aliasing. The text is drawn using the built-in SpriteFont and SpriteBatch classes. Here is ...
1
vote
1answer
37 views
MonoGame deltaTime isn't the same in Draw function as in Update function
In the Update function gameTime.elapsedGameTime.TotalSeconds always gives me 0.01666666667 which is the deltaTime value for 60 FPS, no matter if the FPS is 30 it always shows me 0.01666666667 but the ...
-1
votes
1answer
85 views
How to optimize my movement & collision code?
I am trying to implement movement & collision the simplest way possible. public void MovePlayer() { KeyboardState keyState = Keyboard.GetState(); Vector2 checkVec = ...
0
votes
1answer
197 views
Lightning bolt effect with particles is not continuous
I am Drawing a lightning effect animation using this image: Below the result: As you can see the outcome is not a continuous purple color as I wanted it to be, but it has black spaces in ...
0
votes
2answers
180 views
How to correctly enable anti aliasing in XNA?
In my project when I add graphics.PreferMultiSampling = true; this line in the Game1 Constructor (as the msdn website suggests), anti aliasing does not enable. Any idea what I might be missing ? Here ...
1
vote
1answer
189 views
Word in different color in middle of string XNA
Is it possible to use different font colors for the same string, for example, when buying a weapon in CoD AW Exo Zombies: How do I do this? Thanks.
1
vote
0answers
57 views
AABB collision resolution issues
I'm trying to make a character collide with some tiled terrain. I have an issue with the collision resolution, and after days of shooting in the dark ant not finding any relevant help online, I'm no ...
3
votes
2answers
49 views
Managing cross-platform targets/compatibility with Monogame
I recently started using Monogame for the first time because of it's cross platform compatibilities and heavily active development. The first thing I did is installing the whole framework using their ...
0
votes
1answer
105 views
Center a 3D model to cursor's position
I am having a hard time understanding how to go about this. I have a 2D game with some 3D models in it. I want to move a 3D model to where the mouse cursor is currently at in every frame (In other ...
1
vote
0answers
49 views
Supported Orientation, Monogame, Windows Phone 8
I am developing a game in which I need to rotate the screen on Landscape mode or Portrait, and lock it that way. In Monogame, targeting Windows Phone 8.1 adding this code: ...
5
votes
1answer
192 views
How do I letterbox a C#/Monogame viewport within a resizeable window?
I am making a 2d game with xna/monogame. I want the main view area to always show 15x15 tiles, or 480x480px. I've got something that sort of works, following this guide. It expands the view range ...
1
vote
1answer
174 views
Is sidescroller movement just offsetting the background?, MonoGame/XNA
When I make a sidescroller game and what to move my character do I just offset the background, or is there another better way?
1
vote
1answer
95 views
FPS issue between computers results in slow down of animations and moving
I have been developing my game on two computers. I recently got a new computer and have noticed an issue that seems to be happening in my game. When computer 1 runs the game at 60 FPS everything ...
1
vote
0answers
55 views
How do I distribute MonoGame games in Windows?
I'm using VS2013 and MonoGame to create a simple game. The things is I can't make it run on others PCs. I've tried to copy Content to the Release folder using the "always copy" option in VS2013; ...
2
votes
1answer
311 views
Disappearring instances of VertexPositionColor using MonoGame
I am a complete beginner in graphics developing with XNA/Monogame. Started my own project using Monogame 3.0 for WinRT. I have this unexplainable issue that some of the vertices disappear while doing ...
4
votes
1answer
578 views
Spritebatch Vertex shader world matrix change after each draw
I have a spritebatch where I draw some textures transformed in 3d space. The easy way was just Begin with the transformation matrix, draw, and end it right after. But that is silly, so I'm trying ...
1
vote
1answer
44 views
Porting WP8 to IOS GraphicsDevice Error (Monogame/Xamarin)
I seem to be having a problem porting to IOS. I have my game working on WP8 and Android with any major issues but when trying to run on iPhone I seem to get an error when initialising the ...
1
vote
1answer
38 views
User extendable content with Contentmanager
I developed a towerdefense game that uses xml-Files for almost everything, (creeps, levels, towers, upgrades). Those Xml-files define properties like textures, sounds and values like hitpoints. My ...
2
votes
1answer
589 views
Windows 8 C# Compile spritefonts for MonoGame without XNA
Hello Stack Exchange community. Recently, I've been attempting to in some way generate sprite-fonts into XNB files for use with MonoGame. The issue is however, as you may be aware, XNA is very ...
1
vote
1answer
42 views
Issue with rotating particle effects with DrawUserPrimitves
I am creating a voxel-like game in XNA/Monogame. I am trying to create particle effect of which I create by making a list that is populated every frame. My issue is here: I am using a WorldMatrix to ...
2
votes
0answers
59 views
Read custom content in MONO-GAME in a cross-platform way
using Mono-Game, i have some custom content files in some binary format (not .xnb) in run-time i need to read the content of those files. i prefer to get a stream, but if something will give me a ...
1
vote
1answer
27 views
6DOF camera: inverted yaw and roll when orientation changes
Whenever I change the orientation of the camera, yaw and roll become inverted (or correct); the strafing, movement and pitch do remain correct however. Can you tell what is causing this and how to ...
2
votes
2answers
224 views
How to deform 2D tileable texture in XNA/MonoGame
I'm looking for a way to deform tillable texture in a 2D game I'm building using MonoGame but I'm not sure how this effect is called and searching the internet for "deforming textures" gives me mostly ...
2
votes
1answer
299 views
Loading Song in MonoGame Windows
I cannot load the song into my game. I got error in both templates WindowsDX and WindowsGL. Monogame Develop Build 1252 Both files .wma and .xnb are exist in Content folder and Build Actions are sets ...
1
vote
0answers
81 views
tex2Dlod to limit max mip level to use for a texture (atlas)
I'm developing a 3D multitexturing terrain engine in C# on Monogame (XNA) plateform. I would like my engine works on Windows XP or upper, so on DirectX 9c minimum. Monogame allow me to build a DirectX ...
1
vote
0answers
50 views
How do I port a simple 2D Monogame to MacOSX
I have made a simple Windows Monogame project (using the DirectX template). What are the steps to port my game over to MacOSX? If I need to change my Monogame project so that it uses a OpenGL ...
1
vote
1answer
100 views
MonoGame InstancePlayLimitException on Windows w/ OpenGL
Why am I getting the InstancePlayLimitException when playing several SoundEffects per second despite there being no limit unless programming for mobile? It occurs after only a few seconds of repeated ...
3
votes
2answers
146 views
How to make my installer install XNA framework and .NET 4.0
I have made a simple Monogame game. Right now I am using this installation-package maker: http://installforge.net/ Currently my installer only installs my "game". (All the output files generated by ...
1
vote
0answers
61 views
Monogame 3.3 SoundEffect play Freezes
After using Monogame 3.3 with Xamarin Android, SoundEffect.Play method freezes the game. I try to convert wav files 8bit mono, 16bit mono no changes. This error on Samsung T101 android 4.0.3 but ...
1
vote
2answers
93 views
How to draw to a surface, then draw that surface to the screen
i have a 2D MonoGame Game (using DirectX), that was originally an XNA game. It involves prerendered shadows (they are Texture2Ds drawn with SpriteBatch.draw). Right now the shadows are being drawn ...
1
vote
1answer
50 views
XNA/MonoGame RenderTargets not working
I'm having a problem with drawing 2 RenderTargets to the screen. using System; using System.Collections.Generic; using System.Linq; using System.Text; using Microsoft.Xna.Framework; using ...
0
votes
1answer
59 views
how to stop camera at the end of world map when zoomed in
Im building a tile-based game, and Im trying to implement zooming in on the center of the screen. My problem is, when I get to the edge of the map and im zoomed in, Im noticing that my camera doesn't ...
1
vote
1answer
52 views
Monogame - stopping a custom shader (drawable game component) when inside another drawable game component [closed]
I have run into a bit of trouble when using a custom shader (gaussian effect) within another drawable game component, as I cant figure out how to break out of the draw method, so the effect is applied ...
2
votes
1answer
752 views
What is AABBvsAABB Collision detection?
Currently studying Game Engineering at university and my lecturer has asked us to implement a collision manager. He asks us to use AABBvsAABB to build it, so then we can add the physics. My question ...
0
votes
1answer
617 views
In Monogame, why is multiple tile drawing slow when rendering in “windowed fullscreen”?
I have this drawing function (recommended as a solution here). It draws tiles on the whole window with no problem but my game slows down to ~30fps after maximizing it to "windowed fullscreen", which ...
2
votes
3answers
261 views
MonoGame 3.3 Font loading
Is there any way to have fonts in game without making a separate Content Project and adding a .spritefont file in the new 3.3 Monogame? You can now load other resources directly from the Content ... | {
"url": "http://gamedev.stackexchange.com/questions/tagged/monogame?sort=active&pagesize=15",
"source_domain": "gamedev.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2015-27",
"warc_metadata": {
"Content-Length": "181418",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZOXNC5ST5PGD7BSITOP7U3AIRYFCYGCZ",
"WARC-Concurrent-To": "<urn:uuid:894979e7-de8e-4ade-b84d-bb6fbaa586cb>",
"WARC-Date": "2015-07-06T02:59:34Z",
"WARC-IP-Address": "104.16.13.13",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WRI766CUDED3CDF2HDNHHRWX5UIE64SH",
"WARC-Record-ID": "<urn:uuid:e537817c-422d-40fe-a3ec-00c6c7d74267>",
"WARC-Target-URI": "http://gamedev.stackexchange.com/questions/tagged/monogame?sort=active&pagesize=15",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:323afcbb-6929-43f4-8ff5-b507404982e3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-179-60-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-27\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
76,
77,
112,
113,
115,
120,
129,
138,
139,
201,
202,
407,
409,
414,
423,
431,
432,
518,
519,
717,
719,
725,
734,
743,
744,
820,
821,
1026,
1028,
1033,
1041,
1050,
1051,
1086,
1087,
1271,
1273,
1279,
1287,
1296,
1297,
1355,
1356,
1561,
1563,
1569,
1578,
1587,
1588,
1654,
1655,
1845,
1847,
1852,
1860,
1869,
1870,
1927,
1928,
2110,
2112,
2118,
2126,
2135,
2136,
2161,
2162,
2364,
2366,
2372,
2381,
2390,
2391,
2461,
2462,
2666,
2668,
2673,
2682,
2691,
2692,
2740,
2741,
2944,
2946,
2952,
2960,
2969,
2970,
3010,
3011,
3208,
3210,
3216,
3225,
3234,
3235,
3269,
3270,
3472,
3474,
3479,
3487,
3496,
3497,
3575,
3576,
3779,
3781,
3787,
3796,
3805,
3806,
3848,
3849,
4045,
4047,
4053,
4062,
4071,
4072,
4123,
4124,
4324,
4326,
4331,
4339,
4348,
4349,
4422,
4423,
4627,
4630,
4636,
4644,
4653,
4654,
4700,
4701,
4870,
4872,
4878,
4886,
4896,
4897,
4952,
4953,
5144,
5146,
5152,
5161,
5171,
5172,
5218,
5219,
5423,
5425,
5430,
5438,
5448,
5449,
5497,
5498,
5646,
5648,
5653,
5662,
5671,
5672,
5705,
5706,
5909,
5911,
5917,
5926,
5935,
5936,
5996,
5997,
6201,
6203,
6209,
6217,
6227,
6228,
6267,
6268,
6469,
6471,
6476,
6485,
6494,
6495,
6544,
6545,
6721,
6723,
6729,
6737,
6747,
6748,
6818,
6819,
7019,
7021,
7026,
7034,
7044,
7045,
7116,
7117,
7244,
7246,
7251,
7259,
7268,
7269,
7343,
7344,
7543,
7545,
7550,
7559,
7568,
7569,
7616,
7617,
7816,
7818,
7824,
7832,
7842,
7843,
7905,
7906,
8110,
8112,
8118,
8126,
8136,
8137,
8199,
8200,
8400,
8402,
8407,
8415,
8424,
8425,
8484,
8485,
8677,
8679,
8684,
8692,
8701,
8702,
8746,
8747,
8948,
8950,
8956,
8964,
8974,
8975,
9033,
9034,
9231,
9233,
9238,
9246,
9255,
9256,
9316,
9317,
9520,
9522,
9528,
9537,
9546,
9547,
9604,
9605,
9805,
9807,
9812,
9820,
9829,
9830,
9890,
9891,
10092,
10094,
10100,
10109,
10119,
10120,
10170,
10171,
10376,
10378,
10384,
10392,
10402,
10403,
10436,
10437,
10641,
10643,
10648,
10657,
10666,
10667,
10728,
10729,
10934,
10936,
10941,
10950,
10959,
10960,
11005,
11006,
11202,
11204,
11209,
11217,
11227,
11228,
11285,
11286,
11490,
11492,
11498,
11507,
11517,
11518,
11578,
11579,
11781,
11783,
11788,
11797,
11806,
11807,
11845,
11846,
12045,
12047,
12052,
12061,
12070,
12071,
12134,
12135,
12336,
12338,
12343,
12351,
12360,
12361,
12400,
12401,
12593,
12595,
12601,
12609,
12618,
12619,
12677,
12678,
12882,
12884,
12889,
12897,
12906,
12907,
13022,
13023,
13228,
13230,
13236,
13244,
13254,
13255,
13295,
13296,
13499,
13501,
13507,
13515,
13525,
13526,
13614,
13615,
13818,
13820,
13826,
13835,
13845,
13846,
13872,
13873
],
"line_end_idx": [
76,
77,
112,
113,
115,
120,
129,
138,
139,
201,
202,
407,
409,
414,
423,
431,
432,
518,
519,
717,
719,
725,
734,
743,
744,
820,
821,
1026,
1028,
1033,
1041,
1050,
1051,
1086,
1087,
1271,
1273,
1279,
1287,
1296,
1297,
1355,
1356,
1561,
1563,
1569,
1578,
1587,
1588,
1654,
1655,
1845,
1847,
1852,
1860,
1869,
1870,
1927,
1928,
2110,
2112,
2118,
2126,
2135,
2136,
2161,
2162,
2364,
2366,
2372,
2381,
2390,
2391,
2461,
2462,
2666,
2668,
2673,
2682,
2691,
2692,
2740,
2741,
2944,
2946,
2952,
2960,
2969,
2970,
3010,
3011,
3208,
3210,
3216,
3225,
3234,
3235,
3269,
3270,
3472,
3474,
3479,
3487,
3496,
3497,
3575,
3576,
3779,
3781,
3787,
3796,
3805,
3806,
3848,
3849,
4045,
4047,
4053,
4062,
4071,
4072,
4123,
4124,
4324,
4326,
4331,
4339,
4348,
4349,
4422,
4423,
4627,
4630,
4636,
4644,
4653,
4654,
4700,
4701,
4870,
4872,
4878,
4886,
4896,
4897,
4952,
4953,
5144,
5146,
5152,
5161,
5171,
5172,
5218,
5219,
5423,
5425,
5430,
5438,
5448,
5449,
5497,
5498,
5646,
5648,
5653,
5662,
5671,
5672,
5705,
5706,
5909,
5911,
5917,
5926,
5935,
5936,
5996,
5997,
6201,
6203,
6209,
6217,
6227,
6228,
6267,
6268,
6469,
6471,
6476,
6485,
6494,
6495,
6544,
6545,
6721,
6723,
6729,
6737,
6747,
6748,
6818,
6819,
7019,
7021,
7026,
7034,
7044,
7045,
7116,
7117,
7244,
7246,
7251,
7259,
7268,
7269,
7343,
7344,
7543,
7545,
7550,
7559,
7568,
7569,
7616,
7617,
7816,
7818,
7824,
7832,
7842,
7843,
7905,
7906,
8110,
8112,
8118,
8126,
8136,
8137,
8199,
8200,
8400,
8402,
8407,
8415,
8424,
8425,
8484,
8485,
8677,
8679,
8684,
8692,
8701,
8702,
8746,
8747,
8948,
8950,
8956,
8964,
8974,
8975,
9033,
9034,
9231,
9233,
9238,
9246,
9255,
9256,
9316,
9317,
9520,
9522,
9528,
9537,
9546,
9547,
9604,
9605,
9805,
9807,
9812,
9820,
9829,
9830,
9890,
9891,
10092,
10094,
10100,
10109,
10119,
10120,
10170,
10171,
10376,
10378,
10384,
10392,
10402,
10403,
10436,
10437,
10641,
10643,
10648,
10657,
10666,
10667,
10728,
10729,
10934,
10936,
10941,
10950,
10959,
10960,
11005,
11006,
11202,
11204,
11209,
11217,
11227,
11228,
11285,
11286,
11490,
11492,
11498,
11507,
11517,
11518,
11578,
11579,
11781,
11783,
11788,
11797,
11806,
11807,
11845,
11846,
12045,
12047,
12052,
12061,
12070,
12071,
12134,
12135,
12336,
12338,
12343,
12351,
12360,
12361,
12400,
12401,
12593,
12595,
12601,
12609,
12618,
12619,
12677,
12678,
12882,
12884,
12889,
12897,
12906,
12907,
13022,
13023,
13228,
13230,
13236,
13244,
13254,
13255,
13295,
13296,
13499,
13501,
13507,
13515,
13525,
13526,
13614,
13615,
13818,
13820,
13826,
13835,
13845,
13846,
13872,
13873,
14071
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 14071,
"ccnet_original_nlines": 403,
"rps_doc_curly_bracket": 0.00021319999359548092,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3430088460445404,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05238937959074974,
"rps_doc_frac_lines_end_with_ellipsis": 0.1163366287946701,
"rps_doc_frac_no_alph_words": 0.18194690346717834,
"rps_doc_frac_unique_words": 0.3210815489292145,
"rps_doc_mean_word_length": 4.669623851776123,
"rps_doc_num_sentences": 167,
"rps_doc_symbol_to_word_ratio": 0.018407080322504044,
"rps_doc_unigram_entropy": 5.733745098114014,
"rps_doc_word_count": 2367,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.006333120167255402,
"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.010856780223548412,
"rps_doc_frac_chars_top_3gram": 0.015199489891529083,
"rps_doc_frac_chars_top_4gram": 0.0029856099281460047,
"rps_doc_books_importance": -954.023193359375,
"rps_doc_books_importance_length_correction": -954.023193359375,
"rps_doc_openwebtext_importance": -671.11181640625,
"rps_doc_openwebtext_importance_length_correction": -671.11181640625,
"rps_doc_wikipedia_importance": -528.7215576171875,
"rps_doc_wikipedia_importance_length_correction": -528.7215576171875
},
"fasttext": {
"dclm": 0.08306270837783813,
"english": 0.9056644439697266,
"fineweb_edu_approx": 1.1523138284683228,
"eai_general_math": 0.017430540174245834,
"eai_open_web_math": 0.1275588870048523,
"eai_web_code": 0.005043089855462313
}
} | {
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
3,515,075,514,822,853,000 | Theano/Theano
Theano / Theano
Theano / Theano
Theano is a Python library that allows you to define, optimize, and evaluate mathematical expressions involving multi-dimensional arrays efficiently. It can use GPUs and perform efficient symbolic differentiation. http://www.deeplearning.net/software/…
README
To install the package, see this page:
http://deeplearning.net/software/theano/install.html
For the documentation, see the project website:
http://deeplearning.net/software/theano/
Related Projects:
https://github.com/Theano/Theano/wiki/Related-projects
It is recommended that you look at the documentation on the website, as it will be more current than the documentation included with the package.
In order to build the documentation yourself, you will need sphinx. Issue the following command:
python ./doc/scripts/docgen.py
Documentation is built into html/
The PDF of the documentation can be found at html/theano.pdf
DIRECTORY LAYOUT
Theano (current directory) is the distribution directory.
* Theano/theano contains the package
* Theano/theano has several submodules:
* gof + compile are the core
* scalar depends upon core
* tensor depends upon scalar
* sparse depends upon tensor
* sandbox can depend on everything else
* Theano/examples are copies of the example found on the wiki
* Theano/benchmark and Theano/examples are in the distribution, but not in
the Python package
* Theano/bin contains executable scripts that are copied to the bin folder
when the Python package is installed
* Tests are distributed and are part of the package, i.e. fall in
the appropriate submodules
* Theano/doc contains files and scripts used to generate the documentation
* Theano/html is where the documentation will be generated | {
"url": "http://jiaxin.im/project/a248badb5adb6f10da9e3aff5a7da6f4",
"source_domain": "jiaxin.im",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "702510",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BFY5IWXITJQVKPNIWL64TPJQI6YZ5AWJ",
"WARC-Concurrent-To": "<urn:uuid:a0299257-38bd-419f-8103-953832c26404>",
"WARC-Date": "2017-11-23T08:32:25Z",
"WARC-IP-Address": "47.91.130.68",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LULVE5BLQ7IH3U74BTFVVNUDI5Z5I72R",
"WARC-Record-ID": "<urn:uuid:146d4e4c-ef1e-46f7-8980-0b2a0d01dc5e>",
"WARC-Target-URI": "http://jiaxin.im/project/a248badb5adb6f10da9e3aff5a7da6f4",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c15f416c-3237-4e37-92f2-b888dc4dc79d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-65-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-47\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for November 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
14,
15,
32,
33,
49,
50,
52,
54,
55,
308,
309,
317,
318,
357,
358,
414,
415,
463,
464,
508,
509,
527,
528,
586,
587,
733,
734,
831,
866,
867,
901,
902,
963,
964,
965,
982,
983,
1041,
1082,
1126,
1163,
1198,
1235,
1272,
1320,
1386,
1465,
1490,
1569,
1612,
1682,
1715,
1794
],
"line_end_idx": [
14,
15,
32,
33,
49,
50,
52,
54,
55,
308,
309,
317,
318,
357,
358,
414,
415,
463,
464,
508,
509,
527,
528,
586,
587,
733,
734,
831,
866,
867,
901,
902,
963,
964,
965,
982,
983,
1041,
1082,
1126,
1163,
1198,
1235,
1272,
1320,
1386,
1465,
1490,
1569,
1612,
1682,
1715,
1794,
1856
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1856,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3126843571662903,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011799409985542297,
"rps_doc_frac_lines_end_with_ellipsis": 0.018518520519137383,
"rps_doc_frac_no_alph_words": 0.2300885021686554,
"rps_doc_frac_unique_words": 0.5446428656578064,
"rps_doc_mean_word_length": 6.263392925262451,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.002949849935248494,
"rps_doc_unigram_entropy": 4.41799783706665,
"rps_doc_word_count": 224,
"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.07982894033193588,
"rps_doc_frac_chars_top_3gram": 0.038488950580358505,
"rps_doc_frac_chars_top_4gram": 0.034212399274110794,
"rps_doc_books_importance": -136.41085815429688,
"rps_doc_books_importance_length_correction": -136.28509521484375,
"rps_doc_openwebtext_importance": -74.15874481201172,
"rps_doc_openwebtext_importance_length_correction": -74.15874481201172,
"rps_doc_wikipedia_importance": -58.492794036865234,
"rps_doc_wikipedia_importance_length_correction": -58.492706298828125
},
"fasttext": {
"dclm": 0.9689080715179443,
"english": 0.8040242195129395,
"fineweb_edu_approx": 2.433427095413208,
"eai_general_math": 0.9804035425186157,
"eai_open_web_math": 0.6423502564430237,
"eai_web_code": 0.9946638345718384
}
} | {
"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.4",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"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": "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": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,529,315,027,805,648,600 | 스프링 부트, 입문!
준비중..
스프링 부트, 입문!
기본 게시판 만들기!
04 깃허브 연동
# 깃허브 연동 ## 미션 --- 코드 공유 미션! 스프링부트 프로젝트를 깃허브와 연동하고, 저장소에 업로드(push) 하시오.  ## 개념 --- #### ⭐ 깃과 깃허브 소스코드 버전 관리하는 도구. 이를 깃(Git)이라 한다. 깃으로 관리된 코드는 깃허브(GitHub)라는 클라우드 저장소에 업로드할 수 있다.  근데 깃은 왜 쓸까? 그냥 저장해서 관리하면 안 되나? 답변을 위해 한 가지 묻겠다. 만약 타임머신이 있다면, 안 쓸 것인가? 깃은 소스코드의 타임머신이다. 깃은 코드 전체를 역사로 기록하고, 언제든 되돌아갈 수 있게 한다. ~~심지어 멀티 유니버스를 합치고 나눌 수 있게 한다..!~~  #### ⭐ 로컬 vs 리모트 깃으로 작업하는 컴퓨터. 이를 로컬(local)이라 한다. 로컬 코드는 깃허브에 업로드(push) 될 수 있는데, 업로드 공간을 리모트(remote)라 한다. 리모트에 올라간 코드는, 또 다른 작업 공간에서 다운(pull) 받을 수 있다. 다시 말해, 코드 공유가 쉬워진다. ~~취업 시, 깃허브 코드로 당락이 결정될 수 있다..!~~  #### ⭐ 커밋과 푸시 깃의 작업 흐름은 커밋(commit)과 푸시(push)다. 커밋은 코드의 세이브 포인트를 만들고, 푸시는 이를 공유하게 한다. ~~push는 위 그림 참조! add는 생략한다~~  ## 튜토리얼 --- #### ⭐ 깃 설치 - 윈도우: https://boogong.tistory.com/58 - 맥OS: https://t.ly/e8ya #### ⭐ 깃허브 1) 접속 및 가입: https://github.com/  #### ⭐ 인텔리제이 연동 2) 액션 검색(Ctrl + Shift + A): "Github"  3) 로그인: 깃허브 계정  4) 저장소명 설정  5) 업로드 파일 선택  6) 업로드 확인 - 성공 메세지  - 실제 깃허브 저장소  7) README.md 추가 - 파일명 변경: HELP.md -> README.md  8) .gitignore 변경: "READ.md 제거" 9) 프로젝트 재 업로드 - 커밋(Ctrl + K)  - 푸시(Ctrl + Shift + K)  10) 업로드 재확인  ## 훈련하기 --- - 기본 자바 프로젝트를 만들고, 깃허브 저장소에 업로드 하시오. - 포트폴리오 프로젝트를, 깃허브 저장소에 업로드 하시오. ## 면접 준비 --- - 깃이란 무엇이고, 왜 사용할까? - 깃과 깃허브의 차이는? - 일반 파일 저장과 깃을 통한 버전 관리는 무엇이 다른가? | {
"url": "https://cloudstudying.kr/lectures/436",
"source_domain": "cloudstudying.kr",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "15065",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2FKTII37LRQCKNKVT4PZDPTITP5VGQTX",
"WARC-Concurrent-To": "<urn:uuid:6a0d3efc-847d-460b-b5bc-550c0f66b818>",
"WARC-Date": "2020-09-19T09:11:05Z",
"WARC-IP-Address": "128.199.204.142",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M6ZQHHFDIHBYS6S77RKWHCI435SYUZOE",
"WARC-Record-ID": "<urn:uuid:4b586f3a-44df-495e-8e35-c4035b09ed95>",
"WARC-Target-URI": "https://cloudstudying.kr/lectures/436",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:85c9aafd-315e-4319-b38c-f6b1716b6bd1>"
},
"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-226.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
12,
13,
19,
20,
32,
33,
45,
46,
56,
57
],
"line_end_idx": [
12,
13,
19,
20,
32,
33,
45,
46,
56,
57,
2308
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2308,
"ccnet_original_nlines": 10,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04551045969128609,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011070109903812408,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8228782415390015,
"rps_doc_frac_unique_words": 0.7453874349594116,
"rps_doc_mean_word_length": 10.487085342407227,
"rps_doc_num_sentences": 99,
"rps_doc_symbol_to_word_ratio": 0.043050430715084076,
"rps_doc_unigram_entropy": 5.1346940994262695,
"rps_doc_word_count": 271,
"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.007389159873127937,
"rps_doc_frac_chars_top_3gram": 0.011963410302996635,
"rps_doc_frac_chars_top_4gram": 0.020408159121870995,
"rps_doc_books_importance": -489.20733642578125,
"rps_doc_books_importance_length_correction": -489.20733642578125,
"rps_doc_openwebtext_importance": -274.69366455078125,
"rps_doc_openwebtext_importance_length_correction": -274.69366455078125,
"rps_doc_wikipedia_importance": -185.9178466796875,
"rps_doc_wikipedia_importance_length_correction": -185.9178466796875
},
"fasttext": {
"dclm": 0.9978408217430115,
"english": 0.0028882999904453754,
"fineweb_edu_approx": 2.2385828495025635,
"eai_general_math": 0.1578596830368042,
"eai_open_web_math": 0.38448917865753174,
"eai_web_code": 0.9962428212165833
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.778",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,102,564,565,047,016,000 | Blog
APC And Drupal
Sunday, March 17, 2013 - 23:36
Alternative PHP Cache (APC) is an opcode and variable cache for PHP. When you run a PHP script it is first compiled into a series of opcodes which are then used by the Zend engine to run the program before being discarded. APC sits between the source files and the Zend engine and will stop the opcodes generated during the PHP script execution being thrown away. This means that when you run a PHP script a second time the work done in generating the opcodes has already been done and the script will execute faster.
Category:
Using XPath With HTML Files In PHP
Thursday, March 14, 2013 - 09:53
I recently have started looking into making myself a PHP Zend Certified Engineer and after doing a bit of research I found that the standard PHP string and array functions appear to be a large part of the exam material. So as a starting point (and for future revision) I decided it might be a good idea to create a revision sheet for those functions.
Category:
What Browser Supports What CSS Styles?
Monday, March 4, 2013 - 23:06
Ever sat there and pondered which browsers support what css styles? If so I’d like to quickly introduce http://www.caniuse.com. This is a great tool and sometimes the quickest way to find answers to your questions. But what about W3Schools; I hear you say. W3Schools does have a comprehensive list of styles, complete with examples of how to use them and a list of properties that you can use. However, what I find W3Schools fails on is a comprehensive outline of browser support.
Category:
How I Learned To Stop Using strtotime() And Love PHP DateTime
Friday, March 1, 2013 - 15:50
The DateTime classes in PHP have been available since version 5.2, but I have largely ignored them until recently. This was partly due to the fact that I was working in PHP 5.1 environments a lot (don't ask) but mostly because I was just used to using the standard date functions that have always been a part of PHP (well, since version 4). I wanted to explain why I will be using the new DateTime classes more from now on and why you shouldn't be hesitant to use them.
Category:
Bookmarklet To Run XDebug Profiler
Tuesday, February 5, 2013 - 17:24
XDebug is a great PHP debugging tool, but it also comes with a very useful profiler that can tell you all sorts of information about your PHP application. This includes things like memory footprint and CPU load but will also have detailed information about the entire callstack of the code that was run. To enable the profiler part of XDebug you just need to set up a few rules in your xdebug.ini file.
Category:
Turning Off Drupal CSS and JavaScript Aggregation With Drush
Monday, February 4, 2013 - 15:07
I often find that after recreating a Drupal site locally to do some testing that I have left CSS and JS aggregation turned on. This can be turned off easily enough via the performance page, but this often breaks the flow of what I am doing. As an alternative I use Drush to reset the values via the command line.
The Drush command variable-set can be used to alter any value in the variable table. The two values needed for CSS and JavaScript aggregation are preprocess_css and preprocess_js. To turn these values of we just set them to 0 like this.
Category: | {
"url": "http://www.hashbangcode.com/blog?page=1",
"source_domain": "www.hashbangcode.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "23150",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B3G6IB33QIF52FAM6TNKWOUCBCUQ7ZIR",
"WARC-Concurrent-To": "<urn:uuid:2446a83f-df37-4524-8f0f-5aafa9c1fc85>",
"WARC-Date": "2013-05-18T13:41:12Z",
"WARC-IP-Address": "46.32.252.5",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:S52NBD5YIAHUPPUH5E7DE67RJT6ZMAMF",
"WARC-Record-ID": "<urn:uuid:9d5d1860-d737-495a-8a54-ec958a3f6ec4>",
"WARC-Target-URI": "http://www.hashbangcode.com/blog?page=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:954f1980-697e-4197-93d6-9d47b0cebd03>"
},
"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,
5,
6,
21,
22,
53,
54,
572,
573,
584,
585,
620,
621,
654,
655,
1006,
1007,
1018,
1019,
1058,
1059,
1089,
1090,
1571,
1572,
1583,
1584,
1646,
1647,
1677,
1678,
2148,
2149,
2160,
2161,
2196,
2197,
2231,
2232,
2635,
2646,
2647,
2708,
2709,
2742,
2743,
3056,
3057,
3294,
3295
],
"line_end_idx": [
5,
6,
21,
22,
53,
54,
572,
573,
584,
585,
620,
621,
654,
655,
1006,
1007,
1018,
1019,
1058,
1059,
1089,
1090,
1571,
1572,
1583,
1584,
1646,
1647,
1677,
1678,
2148,
2149,
2160,
2161,
2196,
2197,
2231,
2232,
2635,
2646,
2647,
2708,
2709,
2742,
2743,
3056,
3057,
3294,
3295,
3305
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3305,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4035346210002899,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05891016125679016,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16200295090675354,
"rps_doc_frac_unique_words": 0.4734133780002594,
"rps_doc_mean_word_length": 4.4631218910217285,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.151139736175537,
"rps_doc_word_count": 583,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.015372790396213531,
"rps_doc_frac_chars_dupe_6grams": 0.015372790396213531,
"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.004611840005964041,
"rps_doc_frac_chars_top_3gram": 0.007686399854719639,
"rps_doc_frac_chars_top_4gram": 0.00845502968877554,
"rps_doc_books_importance": -285.4478759765625,
"rps_doc_books_importance_length_correction": -285.4478759765625,
"rps_doc_openwebtext_importance": -187.33775329589844,
"rps_doc_openwebtext_importance_length_correction": -187.33775329589844,
"rps_doc_wikipedia_importance": -145.32139587402344,
"rps_doc_wikipedia_importance_length_correction": -145.32139587402344
},
"fasttext": {
"dclm": 0.03180849924683571,
"english": 0.9456178545951843,
"fineweb_edu_approx": 1.834213137626648,
"eai_general_math": 0.6337736248970032,
"eai_open_web_math": 0.23253309726715088,
"eai_web_code": 0.4907107353210449
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.136",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,113,653,778,785,886,000 |
How learning who is behind social media accounts for big and small companies has changed the way I interact with social media
Throughout this class along with many other experiences, I have been able to hear perspectives from many different social media managers. From the social media controller at New Belgium Brewery to CSU’s small team to others, their hard work and techniques has changed the way I approach social media.
On social media platforms I tend to prefer to take in information rather than engage in it. Even when I like a picture, it doesn’t occur to me to actually push the like button, because so what? I did not see the hard work and technique that goes on in PR ad advertising groups to make a successful post, or how they measure it.
By clicking the like button, these companies that I support can actually see their hard work paying off and have a realistic idea of their reach to their audience.
I have never been big on sharing, commenting, or even something as simple as liking things on social media. But a click of a like is more than a little heart icon- it is a sign of support and loyalty.
I now do as much as I can to interact with the brands, companies, and even individuals that I identify with in order to show my loyalty and support. Although it seems like a small thing to do, I have had the opportunity to see how much the people in charge of these accounts value their fans and customers, and I would want others to do the same. | {
"url": "https://medium.com/@katiespencer/how-learning-who-is-behind-social-media-accounts-for-big-and-small-companies-has-changed-the-way-i-2fa199385261",
"source_domain": "medium.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "70327",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DALK7TE6N7ERR3SI3QWFJH2CKSWRZZDD",
"WARC-Concurrent-To": "<urn:uuid:7b17a81f-dfa4-46e6-8b8d-1395a3492264>",
"WARC-Date": "2017-10-17T07:00:42Z",
"WARC-IP-Address": "104.16.124.127",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3GUGTWOHGGR6RYANGCCL7WKI6WDSQFQQ",
"WARC-Record-ID": "<urn:uuid:da350bdb-8482-4c31-80e3-98c4afdd1af4>",
"WARC-Target-URI": "https://medium.com/@katiespencer/how-learning-who-is-behind-social-media-accounts-for-big-and-small-companies-has-changed-the-way-i-2fa199385261",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:05358b6d-610c-4512-82a8-956fa75ee3e1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-138-94-242.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
1,
127,
128,
429,
430,
758,
759,
923,
924,
1125,
1126
],
"line_end_idx": [
1,
127,
128,
429,
430,
758,
759,
923,
924,
1125,
1126,
1472
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1472,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5150501728057861,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05016722157597542,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.08361203968524933,
"rps_doc_frac_unique_words": 0.5147058963775635,
"rps_doc_mean_word_length": 4.308823585510254,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.583403587341309,
"rps_doc_word_count": 272,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.029010239988565445,
"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.06569965928792953,
"rps_doc_frac_chars_top_3gram": 0.022184299305081367,
"rps_doc_frac_chars_top_4gram": 0.027303749695420265,
"rps_doc_books_importance": -138.64891052246094,
"rps_doc_books_importance_length_correction": -132.19544982910156,
"rps_doc_openwebtext_importance": -69.861083984375,
"rps_doc_openwebtext_importance_length_correction": -69.861083984375,
"rps_doc_wikipedia_importance": -45.8889274597168,
"rps_doc_wikipedia_importance_length_correction": -35.708160400390625
},
"fasttext": {
"dclm": 0.10098416358232498,
"english": 0.9815357327461243,
"fineweb_edu_approx": 1.805222988128662,
"eai_general_math": 0.10476666688919067,
"eai_open_web_math": 0.16604113578796387,
"eai_web_code": 0.1426548957824707
}
} | {
"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.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,744,177,037,684,942,300 | Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.
Patents
1. Advanced Patent Search
Publication numberUS6681239 B1
Publication typeGrant
Application numberUS 08/771,550
Publication dateJan 20, 2004
Filing dateDec 23, 1996
Priority dateDec 23, 1996
Fee statusPaid
Publication number08771550, 771550, US 6681239 B1, US 6681239B1, US-B1-6681239, US6681239 B1, US6681239B1
InventorsSteven Jay Munroe, Scott Alan Plaetzer, James William Stopyro
Original AssigneeInternational Business Machines Corporation
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Computer system having shared address space among multiple virtual address spaces
US 6681239 B1
Abstract
A multi-tasking computer operating system allocates a respective virtual address space to each task. A portion of virtual address space is reserved as a shared address space (SAS) region, the SAS region occupying the same range of virtual addresses in the virtual address space of each task. Certain classes of data intended for sharing among multiple tasks are assigned unique and persistent addresses in the range of the shared address space region. Preferably, certain facilities are added to a conventional base operating system to support the SAS region and associated function. These include a join facility for initiating a task to the SAS region, an attach facility for attaching blocks of memory within the SAS region, and a paging facility for retrieving a page within the SAS region from storage. In this manner, it is possible for a multi-tasking multiple virtual address space computer system to assume the advantages of a single level store computer system when performing certain tasks.
Images(21)
Previous page
Next page
Claims(31)
What is claimed is:
1. A computer system, comprising:
a processor;
a memory;
an operating system for supporting concurrent execution of a plurality of tasks on said computer system, said operating system comprising a plurality of instructions executable on said processor, said plurality of instructions maintaining a plurality of data structures supporting operating system functions performed by said plurality of instructions executing on said processor;
wherein said operating system allocates a plurality of overlapping task virtual address spaces, each task virtual address space being allocated to a respective task;
wherein said operating system allocates, within a plurality of said task virtual address spaces, a shared address space region, said shared address space region occupying the same virtual address range within each respective task virtual address space, said shared address space region being less than the entire task virtual address space; and
wherein said operating system allocates, within said virtual address range occupied by said shared address space region, a plurality address ranges assigned to respective addressable entities, each respective one of said range of addresses being uniquely and persistently assigned to its respective addressable entity, and wherein the virtual address range of an addressable entity shared by two or more tasks resides at the same address within each task's shared address space region.
2. The computer system of claim 1, wherein said processor defines a processor address space, and wherein each respective task virtual address space includes the full range of addresses in the processor address space.
3. The computer system of claim 1, wherein said operating system selectively allocates, with respect to each task, said shared address space region within the virtual address space of the respective task, said data structures including at least one data structure which records whether said shared address space region has been allocated within the virtual address space of a task.
4. The computer system of claim 1, wherein said operating system comprises:
a base operating system portion, said base operating system portion including instructions supporting concurrent execution of a plurality of tasks and concurrent allocation of a plurality of overlapping task virtual address spaces; and
a shared address space server portion, said shared address space server portion including instructions supporting said shared address space region, said shared address space server portion responding to calls from said base operating system portion.
5. The computer system of claim 1, wherein said operating system further allocates discrete blocks of virtual address space within said shared address space region, said data structures including at least one data structure which records blocks allocated within said shared address space region.
6. The computer system of claim 5,
wherein said at least one data structure which records blocks allocated within said shared address space region further associates access control information with each respective block allocated within said shared address space region, said access control information including whether a task is authorized to access the respective block; and
wherein said operating system grants a task access to a block within said shared address space region based on the access control information associated with said block.
7. The computer system of claim 6, wherein said access control information associated with each respective block comprises an access control list associated with each respective block.
8. The computer system of claim 5, wherein said operating system further allocates physical storage to selective portions of virtual address space within a block, said data structures including at least one data structure which records physical storage allocated within the virtual address space of a block.
9. A method of operating a multi-tasking computer system, said multi-tasking computer system concurrently executing a plurality of tasks, said method comprising the steps of:
defining a plurality of overlapping virtual address space mappings, each mapping being associated with a respective task executing on said multi-tasking computer system;
designating a fixed portion of a plurality of said virtual address space mappings as a shared address region, said fixed portion being less than the entire virtual address space, said shared address region occupying the same range of virtual addresses in each respective virtual address space mapping;
assigning to each of a first set of addressable entities in said computer system a respective range of addresses in said shared address region, each range of addresses assigned to an addressable entity being uniquely and persistently assigned to the entity, wherein the address range of an addressable entity shared by two or more tasks resides at the same address within each task's shared address space region; and
assigning to each of a second set of addressable entities in said computer system at least one respective range of addresses, each respective range of addresses being in a respective virtual address space mapping, said ranges lying outside said shared address region.
10. The method of claim 9, wherein said multi-tasking computer system inherently designates a fixed portion of each virtual address space mapping associated with a task as a shared address region.
11. The method of claim 9, wherein said step of designating a fixed portion of a plurality of said virtual address space mappings as a shared address region selectively designates, with respect to each task, a fixed portion of the respective virtual address space mapping of the task as a shared address region.
12. The method of claim 11, wherein said step of designating a fixed portion of a plurality of said virtual address space mappings as a shared address region comprises:
receiving requests from a plurality of tasks to designate a fixed portion of the respective virtual address space mapping of each requesting task as a shared address region; and
designating a fixed portion of the respective virtual address space mapping of each requesting task as a shared address region, in response to said requests.
13. The method of claim 9, wherein said computer system includes at least one processor defining a virtual address space, and said step of defining a plurality of overlapping virtual address space mappings comprises defining, for each task, a respective virtual address space mapping which includes the full range of addresses in the processor address space.
14. The method of claim 9, wherein said step of assigning to each of a first set of addressable entities in said computer system a respective range of addresses in said shared address region comprises:
allocating discrete blocks of virtual address space within said shared address space region; and
recording, in at least one data structure of said computer system, blocks allocated within said shared address space region.
15. The method of claim 14, further comprising the steps of:
associating access control information with each respective block allocated within said shared address space region, said access control information including whether a task is authorized to access the respective block; and
granting a task access to a block within said shared address space region based on the access control information associated with said block.
16. A computer operating system program product for supporting concurrent execution of a plurality of tasks on a computer system, said computer operating system program product comprising:
a plurality of instructions executable on a processor of said computer system and recorded on a computer readable medium;
wherein said plurality of instructions when executed on said processor maintain a plurality of data structures supporting operating system functions performed by said plurality of instructions executing on said processor;
wherein said plurality of instructions when executed on said processor allocate a plurality of overlapping task virtual address spaces, each task virtual address space being allocated to a respective task;
wherein said plurality of instructions when executed on said processor allocate, within a plurality of said task virtual address spaces, a shared address space region, said shared address space region occupying the same virtual address range within each respective task virtual address space, said shared address space region being less than the entire task virtual address space; and
wherein said plurality of instructions when executed on said processor allocate, within said virtual address range occupied by said shared address space region, a plurality address ranges assigned to respective addressable entities, each respective one of said range of addresses being uniquely and persistently assigned to its respective addressable entity, and wherein the virtual address range of an addressable entity shared by two or more tasks resides at the same address within each task's shared address space region.
17. The computer operating system program product of claim 16, wherein said plurality of instructions when executed on said processor selectively allocates, with respect to each task, said shared address space region within the virtual address space of the respective task, said data structures including at least one data structure which records whether said shared address space region has been allocated within the virtual address space of a task.
18. The computer operating system program product of claim 16, wherein said computer operating system comprises:
a base operating system portion, said base operating system portion including instructions supporting concurrent execution of a plurality of tasks and concurrent allocation of a plurality of overlapping task virtual address spaces; and
a shared address space server portion, said shared address space server portion including instructions supporting said shared address space region, said shared address space server portion responding to calls from said base operating system portion.
19. The computer operating system program product of claim 16, wherein said plurality of instructions when executed on said processor further allocate discrete blocks of virtual address space within said shared address space region, said data structures including at least one data structure which records blocks allocated within said shared address space region.
20. The computer operating system program product of claim 19,
wherein said at least one data structure which records blocks allocated within said shared address space region further associates access control information with each respective block allocated within said shared address space region, said access control information including whether a task is authorized to access the respective block; and
wherein said plurality of instructions when executed on said processor grant a task access to a block within said shared address space region based on the access control information associated with said block.
21. The computer operating system program product of claim 20, wherein said access control information associated with each respective block comprises an access control list associated with each respective block.
22. The computer operating system program product of claim 19, wherein said plurality of instructions further allocate physical storage to selective portions of virtual address space within a block, said data structures including at least one data structure which records physical storage allocated within the virtual address space of a block.
23. A shared address space server program product for a base computer operating system, said base computer operating system supporting concurrent execution of a plurality of tasks on a computer system and allocating a plurality of overlapping task virtual address spaces, each task virtual address space being allocated to a respective task, said shared address space server program product comprising:
a plurality of instructions executable on a processor of said computer system and recorded on a computer readable medium;
wherein said plurality of instructions when executed on said processor respond to calls from said base operating system;
wherein said plurality of instructions when executed on said processor allocate, within a plurality of said task virtual address spaces, a shared address space region, said shared address space region occupying the same virtual address range within each respective task virtual address space, said shared address space region being less than the entire task virtual address space; and
wherein said plurality of instructions when executed on said processor allocate, within said virtual address range occupied by said shared address space region, a plurality address ranges assigned to respective addressable entities, each respective one of said range of addresses being uniquely and persistently assigned to its respective addressable entity, and wherein the virtual address range of an addressable entity shared by two or more tasks resides at the same address within each task's shared address space region.
24. The shared address space server program product of claim 23,
wherein said plurality of instructions when executed on said processor selectively allocates, with respect to each task, said shared address space region within the virtual address space of the respective task; and
wherein said plurality of instructions when executed on said processor maintain at least one data structure supporting functions performed by said plurality of instructions executing on said processor said at least one data structure including at least one data structure which records whether said shared address space region has been allocated within the virtual address space of a task.
25. The shared address space server program product of claim 23,
wherein said plurality of instructions when executed on said processor further allocate discrete blocks of virtual address space within said shared address space region; and
wherein said plurality of instructions when executed on said processor maintain at least one data structure supporting functions performed by said plurality of instructions executing on said processor, said at least one data structure including at least one data structure which records blocks allocated within said shared address space region.
26. The shared address space server program product of claim 25, wherein said plurality of instructions further allocate physical storage to selective portions of virtual address space within a block, said at least one data structure including at least one data structure which records physical storage allocated within the virtual address space of a block.
27. A multi-tasking computer system having a processor defining a processor address space, said multi-tasking computer system comprising:
means for supporting concurrent execution of a plurality of tasks on said computer system;
means for concurrently allocating a plurality of overlapping task virtual address spaces, each task virtual address space being contained within said processor address space, and each task virtual address space being allocated to a respective task;
means for allocating, within a plurality of said task virtual address spaces, a shared address space region, said shared address space region occupying the same virtual address range within each respective task virtual address space, said shared address space region being less than the entire task virtual address space; and
means for persistently and uniquely assigning address ranges to addressable entities within said shared address space region, wherein the virtual address range of an addressable entity shared by two or more tasks resides at the same address within each task's shared address space region.
28. The computer system of claim 27, further comprising:
means for selectively determining, with respect to each of a plurality of tasks, whether said shared address space region will be allocated within the respective task virtual address space of the task;
wherein said means for allocating a shared address space region allocates said region in response to said means for selectively determining whether said shared address space region will be allocated.
29. The computer system of claim 27, wherein said operating system further comprises:
means for allocating discrete blocks of virtual address space within said shared address space region.
30. The computer system of claim 29, wherein said operating system further comprises:
means for associating access control information with each respective block of virtual address space, said access control information including whether a task is authorized to access the respective block;
means for determining whether a task is authorized to access a block based on the access control information associated with said block; and
means, responsive to said means for determining whether a task is authorized to access a block, for granting a task access to a block only if said task is authorized to access said block.
31. The computer system of claim 30, wherein said access control information associated with each respective block comprises an access control list associated with each respective block.
Description
FIELD OF THE INVENTION
The present invention relates to digital computer systems, and in particular computer operating systems which support multiple simultaneous tasks.
BACKGROUND OF THE INVENTION
A modem computer system typically comprises a central processing unit (CPU), and other supporting hardware such as system memory, communications busses, input/output controllers, storage devices, etc. The CPU is the heart of the system. It executes the instructions which comprise a computer program and directs the operation of the other system components. Typically, the instructions which execute on the CPU may be part of the computer's operating system, or may be part of an application program which performs some particular work for a user.
The operating system may be thought of as that part of the programming code executing on the computer, which regulates the computer's function, while the application programs perform specific work on behalf of a user. Operating systems vary considerably in complexity and function. A very simple operating system for a single-user computer may handle only a single task at a time, mapping all data into a single address space, and swapping data into and out of the address space whenever a new task must be performed. An operating system for a computer which supports multiple simultaneous users must manage the allocation of system resources among the different users. In particular, it must manage the allocation of address space and system memory.
The address space of the system is the range of addresses available to reference data, instructions, etc., and is determined by the size (bit length) of the address. Usually, the address space is significantly larger than the number of actual physical memory locations available on the system. The address size is one of the fundamental architectural features of the computer system. All other things being equal, a larger address size is naturally desirable from the standpoint of capacity of the system to do work. However, the address size entails significant hardware cost. The size of buses, registers, and logic units throughout the system is intimately tied to the address size.
In the early days of computers, hardware was a relatively expensive commodity. Many early systems used 16-bit or smaller addresses. Usually, the amount of data contained in these systems exceeded the size of the address space. An individual program might fit well within the address space, but a user might have many programs to execute on the system. Additionally, multi-user systems required space for each user.
The earliest systems executed only a single application at a time. Typically, storage became hierarchical. Although the total number of addresses exceeded the address space available in main memory, address space could be re-used. Data (including programs) were normally stored in a large secondary storage on disk, drum, tape or other secondary storage devices. When a particular application was needed, it was loaded into main memory and addresses were mapped into the address space of main memory. When no longer needed, it was deleted from main memory but retained in secondary storage. The address space was then re-used. If the same application was needed again, it could be loaded again into main memory.
As computers became more sophisticated, it became common for computer systems to execute multiple tasks concurrently. Operating systems designed for such computer systems were required to manage operations within the available address space of the computer. Since the addresses needed typically exceeded the address space available in the processor's hardware, this was done by allocating a separate address space to each task, resulting in multiple virtual address spaces. Typically, the task's virtual address space was the same size as the address space of the computer's processor.
This multiple virtual address space approach necessarily meant that different bytes of data might have the same virtual address, although they would be in the virtual address spaces of different tasks. When a task was loaded into main memory from secondary storage, a mapping mechanism mapped virtual addresses in the virtual address space of the task to physical addresses in the main memory of the computer system. This increased the complexity of the operating system, but was necessary to cope with the limited size of the system's address space.
As an alternative to the multiple virtual address space architecture, it possible to utilize a single very large system address space, one which is sufficiently large that it is not necessary to have multiple overlapping virtual address spaces, one for each task. Each task has its own discrete portion of the large system address space. One major impediment to this alternative architecture is that is requires a very large system address space, and consequently requires additional hardware to support it. When hardware was very expensive, this alternative appeared unattractive. For that reason, most multi-tasking systems have utilized the multiple virtual address space approach.
With the alternative single large address space approach, programs and other data stored in a computer system can be assigned persistent, unique logical addresses in the large system address space. Because these logical addresses are not duplicated, they can be used to identify data either in main memory or in secondary memory. For this reason, this alternative is sometimes referred to as a single level storage architecture. Examples of such an alternative architecture are the IBM System/38 computer system (formerly manufactured and distributed by IBM Corporation), its successor, the IBM AS/400 System (currently manufactured and distributed by IBM Corporation), and the Opal system at the University of Washington. For additional background concerning the IBM System/38 and IBM AS/400 System, see IBM System/38 Technical Developments (International Business Machines Corporation, 1978), IBM Application System/400 Technology (International Business Machines Corporation, 1988), and IBM Application System/400 Technology Journal, Version 2 (International Business Machines Corporation, 1992). The Opal system is described in a series of academic papers, including J. Chase, et al., “Opal: A Single Address Space System for 64-bit Architectures”, Proc. IEEE Workshop on Workstation Operating Systems (April, 1992).
When compared with the more traditional multiple virtual address space approach, the single level storage architecture offers certain advantages. These advantages are particularly applicable to object oriented programming applications. The object oriented (OO) programming paradigm anticipates that a large number of small code segments will have internal references (pointers) to one another, that these segments may be owned by different users, that during execution of a task, flow of control may jump frequently from one segment to another, and that different tasks executing on behalf of different users will often execute the same code segment.
Where a system uses multiple virtual address spaces, the pointers to different code segments will reference code in the virtual address space of another task or user. Resolution of these pointers becomes difficult. Because multiple overlapping virtual address spaces exist, it is possible that different code segments will share the same virtual address, but in the address space of different tasks or users. It is also possible that the executing task will have assigned the virtual address to some other data. Therefore, it is not possible to directly reference data or code in a segment belonging to a different task or user in the same manner an executing task would use a pointer to its own code in its own virtual address space. There must be a mechanism for resolving the various pointers so that the correct code segment is referenced.
Such mechanisms for resolving pointers in a multiple virtual address space system are possible, but they are awkward and tend to impose a burden on system performance. On the other hand, a single level store architecture can cope with such pointers more easily. Because each code or other data segment will have its own logical address in the single large system address space, there is no need for a mapping mechanism when referencing another code or data segment, even where that code or data is controlled by another task or user. It may be necessary to have a mechanism for verifying access rights, but the pointer addresses themselves do not need to be re-mapped for each new task. This is a substantial advantage where many pointers are used to point to code or other data segments of different tasks or users, and task execution can flow unpredictably from one to another.
Recently, there has been a significant interest in the object-oriented (OO) programming paradigm. The number of OO applications available is rapidly mushrooming. Object-oriented applications are not the only ones which may have pointers referencing code or other data controlled by different users. But OO application rely heavily on these types of operations. As object-oriented applications become more common, the burden of resolving pointers in a multiple virtual address space environment increases.
Another development in the evolution of the computer industry has been the relative decline in hardware costs. Historically, the size of addresses has grown as hardware costs have declined. The earlier 16-bit address based systems have largely been supplanted by 32-bit system. More recently, several commodity processors have been introduced having 64-bit address capability.
Unlike the earlier increases in address size, the increase in size to 64 bits has a revolutionary potential. Even where every task has its own range of addresses and every new piece of data is assigned a persistent address which is not re-used, it is unlikely that all the addresses in a 64-bit address space will be consumed in the lifetime of a given computer system. Thus, a 64-bit address is large enough to support a single level storage architecture. Moreover, it is a capability which is available to the system designer at no cost. Commodity processors simply offer this enormous range of addresses, whether the system designer uses them or not. At the present time, few systems have taken advantage of the full range of 64-bit address space.
The increasing use of OO applications, as well as the availability of large addresses on modem processor hardware, provide some justification for a single level storage architecture. However, architectural decisions for computer systems are not made in a vacuum. There is a long history of computer system development using the multiple virtual address space model. Any computer system architecture has its own characteristic advantages and disadvantages. Operating systems have been designed, and application software written, to take advantage of multiple virtual address spaces. Given the existing investment in these designs, it is difficult for many systems designers and users to change to a single level store architecture, despite any theoretical advantage that may be available.
It would be desirable to obtain the benefits of a single level store architecture computer system, particularly in systems which execute a significant number of OO applications. However, it is very difficult to change something so fundamental as the addressing model used in a computer system. Altering a conventional multi-tasking, multiple virtual address space system, to conform to a single level store design would typically require massive re-writing of the operating system and the application software.
SUMMARY OF THE INVENTION
It is therefore an object of the present invention to provide an enhanced computer system architecture.
Another object of this invention is to increase the performance of a computer system.
Another object of this invention is to enhance the ability of a computer system to execute multiple concurrent tasks.
Another object of this invention is to enhance the ability of a computer system to share data and code between multiple concurrent tasks.
Another object of this invention is to enhance the ability of a computer system to execute tasks involving object-oriented programming applications.
Another object of this invention is to reduce the complexity of pointer resolution among different tasks in a multi-tasking computer system.
Another object of this invention is to enhance the ability of a multi-tasking computer system having multiple virtual address spaces to provide functional advantages of a single address space computer system.
A multi-tasking operating system of a computer system allocates a respective virtual address space to each task, the virtual address spaces for the different tasks overlapping. For at least some tasks, a portion of virtual address space is reserved as a shared address space (SAS) region. These tasks are said to be “participating” in the SAS region. The SAS region occupies the same range of virtual addresses in the virtual address space of each participating task. Certain classes of data intended for sharing among multiple tasks are assigned addresses in the range of the shared address space region. Assignments of such addresses in the shared address space region are unique and persistent. In this manner, it is possible for a multi-tasking multiple virtual address space computer system to behave like a single level store computer system when performing certain tasks.
In the preferred embodiment, certain facilities are added to the base operating system of a conventional multi-tasking computer system to support the SAS region and associated function. These facilities are collectively referred to as the “SAS Server”. The three chief facilities are a join facility, an attach facility, and an external paging facility.
The join facility permits a task to “join” (“participate” in) the SAS region, i.e., to take advantage of the single level storage characteristics of the SAS region. It is preferred that each task can join the SAS region individually, so that tasks are not required to join. By allowing a task to not participate in the SAS region, the operating system retains full compatibility with applications that may use portions of the SAS region for application specific purposes. A task joins a region by issuing a specific command to invoke the join facility. The SAS server maintains a record of tasks which are participating in the SAS region.
The attach facility is used by a participating task to attach blocks of memory within the SAS region. The SAS region is logically partitioned into blocks, which are the basic unit of access control. After joining the SAS region, a task can create blocks in the SAS region or attach blocks in the SAS region created by other tasks. The attach facility may either be invoked explicitly by a command to attach blocks, or implicitly by a memory reference to a location within a block which has not yet been attached. The SAS server maintains a record of attached blocks for each individual task. The fact that a task has joined the SAS region does not automatically grant it authority to access any particular block within the region. The attach facility is therefore responsible for verifying the authority of the task to access the requested block, and updating the record of attached blocks if an explicit or implicit request to access a block is successful. The SAS server also maintains a record of all persistent allocated blocks. This record enables the facility to allocate new blocks in unused address ranges, and guarantee that objects within the SAS region are loaded to consistent virtual addresses.
The external pager (called “external” because in the preferred embodiment it is external to the base operating system) manages paging within the SAS region. In the base operating system, when an executing task references a memory location, the system checks to determine whether the referenced page is currently loaded in physical memory. If not, an exception is generated by the operating system. A system default memory pager is called to bring the requested page in from storage.
This normal procedure is modified if the memory reference is within the SAS region. In that case, the exception causes the external pager to be called. The pager looks for the block in the executing task's record of attached blocks (which indicates authority to access the block containing the requested page). If the block entry is found (the block has been attached), the requested page is added to the task's page table. If necessary, the page is also loaded from storage and placed in memory (note that the page may already be in physical memory if it is used by another task). Subsequent attempts by the same task to access the same page will find it in the task's page table, so that no exception will be generated and the memory location will be accessed directly.
The above described system is a hybrid, which is neither purely a multiple address space system nor a single level store system. Because it builds upon a multiple virtual address space system, it is compatible with many existing architectures, and may execute programs written for these architectures with little or no modification. At the same time, it provides many of the advantages of single level store, e.g., improved ability to resolve pointers among different tasks and execute object-oriented applications where objects are controlled by different users.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a high level diagram of the major hardware components of a computer system according to the preferred embodiment.
FIG. 2 is a conceptual diagram at a high level of main memory according to the preferred embodiment.
FIG. 3 is a high level depiction of the mapping of entities in virtual address space of a conventional multiple virtual address space operating system.
FIG. 4 is a high level depiction of the mapping of entities in virtual address space of a single-level store computer system.
FIG. 5 is a high level depiction of the mapping of entities in virtual address space of a computer system according to the preferred embodiment of the preferred embodiment of the present invention.
FIG. 6 illustrates certain addressing constructs according to the preferred embodiment.
FIG. 7 shows the format of an active task list data structure, according to the preferred embodiment.
FIG. 8 shows the format of a cohort mapping table data structure, according to the preferred embodiment.
FIG. 9 shows the format of a cohort block index data structure, according to the preferred embodiment.
FIG. 10 shows the format of a permanent directory data structure, according to the preferred embodiment.
FIG. 11 shows the format of a free space directory data structure, according to the preferred embodiment.
FIG. 12 shows the format of an active block table data structure, according to the preferred embodiment.
FIG. 13 shows a high-level flow diagram of task execution on the system, according to the preferred embodiment.
FIG. 14 illustrates in greater detail the steps taken by the system when a task joins the SAS region, according to the preferred embodiment.
FIG. 15 illustrates in greater detail the steps taken by the system when a block within the SAS region is created, according to the preferred embodiment.
FIG. 16 illustrates in greater detail the steps taken by the system when an call is made to explicitly attach a block within the SAS region, according to the preferred embodiment.
FIG. 17 illustrates in greater detail the steps taken by the system when an attempt to reference a page from a previously attached block in the SAS region generates a page fault, according to the preferred embodiment.
FIG. 18 illustrates in greater detail the steps, taken by the system when an attempt to reference a page from an unattached block in the SAS region generates a page fault, according to the preferred embodiment.
FIG. 19 illustrates the steps taken by the system when physical storage is assigned to blocks within the SAS region, according to the preferred embodiment.
FIG. 20 illustrates the steps taken by the system when a page within the SAS region is written back to storage, according to the preferred embodiment.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT System Overview
The major hardware components of a computer system 100 for supporting SAS regions in a multiple virtual address space environment in accordance with the preferred embodiment of the present invention are shown in FIG. 1. CPU 101 for processing instructions is coupled to random access main memory 102 via a memory bus 103. CPU 101 and main memory 102 also communicate via I/O interface 105 with I/O buses 110,111. Various I/O devices 112-118 attach to system buses 110,111, such as direct access storage devices (DASD), tape drives, workstations, printers, and remote communication lines.
FIG. 1 shows some of the major components of CPU 101. CPU 101 comprises instruction register 121 for holding the current instruction being executed by the CPU; instruction address register 122 for storing the address of an instruction; control unit 123, which decodes the instruction in register 121, determines the next instruction to be executed, and controls the flow of data internally within the CPU; arithmetic logic unit 124 for performing arithmetic and logical operations on data; and a plurality of general purpose registers 125 which can be used for temporary storage of data or addresses. Depending on the design of CPU 101, it may include various special purpose registers, caches, internal data buses, multiple arithmetic logic units, instruction registers, and instruction address registers for pipelining, and other features. In the preferred embodiment, CPU 101 is a Motorola 64-bit PowerPC processor, it being understood that various other processors could be used. It will be further understood that almost any multi-tasking computer system could be used, and that great variations are possible in the number, type and arrangement of processors, memory, busses, I/O units, etc. In particular, it would be possible to employ a system having a plurality of central processing units.
The size of registers 122 and 125 determines the maximum size of addresses that can be conveniently manipulated and addressed by CPU 101. In many current processor designs, including the processor of the preferred embodiment, it is customary to handle data and addresses in general purpose registers of the same size. While it is theoretically possible to create and manipulate larger addresses by concatenating the contents of multiple registers, this would create a substantial programming and performance burden. Therefore, the size of the registers can be said to define a virtual address space of CPU 101, this address space having a size 2n addressable units, where n is the number of bits in one of the registers. In the preferred embodiment, the registers can store a 64-bit address, defining a virtual address space of 264 bytes.
Applicants experimented with a prototype using a modified version of an IBM RISC System/6000 computer system. The RISC System/6000 computer is available from IBM Corporation, although the version used by applicants is not publicly available. However, applicants' invention is not dependent on the existence of specific hardware features not common to most, if not all, computer systems, and could therefore be implemented using any of various general purpose and special purpose computer systems.
FIG. 2 is a conceptual diagram at a high level of main memory 102. Main memory is preferably a large random access memory which stores programs and other data for use by processor 101 and other components of system 100. Memory 102 includes base operating system 201, SAS server 210, a plurality of applications 220, and shared entities 230. Base operating system 201 is a multi-tasking computer operating system which provides basic operational functions for computer system 100, such as task initiation and termination, resource scheduling, page mapping and swapping, storage I/O, etc. Base operating system maintains numerous data structures for its varied functions, among them address to memory object table (AMOT) 202, page table 203 , and memory object table 205 , which are described more fully herein. It will be understood that base operating system 201 maintains many other data structures in addition, these not being critical to an understanding of applicants' embodiment. SAS server 210 also maintains various data structures, including active task list 211, cohort mapping table 212, cohort block indices 213, permanent directories 214, free space directories 215, and active block table 216. Applications 220 contain programming code or data used by particular tasks executing on system 100. Shared entities are programming code or data structures which have virtual addresses within a shared address space (SAS) region. Typically, these could be entities in an object-oriented programming environment, such as objects, classes, methods, etc. However, the use of the SAS region is not limited to object-oriented programming environments, and the region could also contain conventional files, programs and other data structures. The SAS region is described more fully below.
Although main memory is conceptually shown in FIG. 2 as a single entity in which significant programs and data are contained, it will be understood that in typical operation it is not possible to store all programs and data in main memory simultaneously. Portions of base operating system 201 and other components may be loaded into main memory, while other portions remain on auxiliary storage, such as disk drive storage. These portions may be swapped in or out depending on demand. Additionally, portions of programs or data may be contained in one or more high-speed caches for improved performance.
In the preferred embodiment, base operating system 201 is the Micro-Kernel Operating System available from the Open Software Foundation. However, it should be understood that other multi-tasking operating systems perform similar or analogous functions, and the present invention could be adapted to other multi-tasking operating systems by making minor modifications to the SAS facilities. Particularly, operating systems which support shared memory between different tasks and memory mapped files are appropriate, although the present invention is not necessarily limited in use to operating systems of that type. In reality, applicants experimented with a prototype using IBM's version of the Micro-Kernel Operating System, which is a slight modification of the Open Software Foundation's version. However, it is believed that none of the modifications made in the IBM version of the Micro-Kernel Operating System are relevant to the present invention.
It is expected that typically the operating system described herein would be distributed as an inherent part of a computer system and stored in the non-volatile storage (e.g. magnetic disk drives) of the computer system. However, because the operating system has few, if any, specific hardware dependencies, it would also be possible to distribute the operating system separately from hardware. Additionally, it would be possible to distribute a server portion of an operating system separately for use with an existing base operating system. In these cases, the operating system instructions which maintain data structures as exemplified by FIG. 2 and perform the functions described herein could be distributed on any computer readable medium, such as magnetic tape, removable magnetic disk, optical disk, etc. Appropriate data structures may be distributed in skeleton form on the computer readable medium, or may be created by the code upon execution.
System 100 may be part of a network of computer systems, each of which recognizes unique and persistent virtual addresses within a shared region. In this manner, entities can be shared among the various computer systems in the network. Alternatively, the computer system described herein need not necessarily be attached to a network of systems having similar characteristics, or to any network at all. It would be possible to utilize a shared address region as described herein on a single system, which does not share entities in a network environment.
Virtual Address Space
As noted above, the registers of CPU 101 define a virtual address space, which in the preferred embodiment is 264 addressable bytes. Base operating system 201 in conjunction with SAS server 210 maps this address space for each executing task. A significant feature of the present invention is the form of this mapping, as explained below and shown in FIGS. 3-5. As used in FIGS. 3-5 and the accompanying explanatory text, an “entity” could be a code module, data structure, data space, etc. The term “entity” is used rather than “object”, because “object” has specific meaning in certain contexts. However, an “entity” could also be an object. An “entity” could also be one or more “blocks”, as that term is used below.
FIG. 3 depicts at a high level the mapping of entities in virtual address space of a multi-tasking computer system utilizing a conventional multiple virtual address space operating system of the prior art. A range of addresses from 0 to 2n−1 can be expressed in CPU registers holding n bits of information. For each task executing on the system, there exists a separate mapping 301-303 of entities to virtual addresses. While three task mappings 301-303 are shown in FIG. 3, it will be understood that this is for illustrative purposes only, and that typically a much larger number of tasks can be handled by the system. A table, list or other data structure contains the mapping information for a task. The mapping may be specified on a segment or block basis (i.e., each fixed-size range of addresses), or on an entity basis, or some other basis.
As shown in FIG. 3, each task can map the entire virtual address space of 2n addressable units, and each task's map is different. Because each virtual addresses are duplicating in different virtual address spaces, the spaces are “overlapping”. Some entities, such as A, C, and L, are mapped in the address space of more than one task, but are not necessarily at the same virtual address. Other entities, such as D and P, exist only within a single task. An entity, such as B, may be noncontiguously stored in the virtual address space of one task, and contiguously stored in the virtual address space of another.
Because the virtual address of a particular entity in the system of FIG. 3 may vary from task to task, there is no persistent virtual address associated with an entity. Typically, an arbitrary virtual address is assigned each time the entity is loaded or linked by the task from available virtual address space. Therefore, not only may the same entity have differing virtual addresses in different task address spaces, but the same entity may have differing virtual addresses in the address space of a single application for each instance of the application. If pointers are used to reference locations in different entities, these must be resolved to the current environment of the executing task. This typically introduces considerable complexity in the operation of the system, and can significantly affect performance. For example, pointers will be stored in some convertable form, address resolution data structures will exist, operating system code will manipulate the pointers to resolve the address to a particular environment, etc.
FIG. 4 depicts a high level mapping of entities in virtual address space of a computer system utilizing a single-level store architecture. As shown in FIG. 4, there is but a single large virtual address space map 401, and all entities are mapped into this one space. Entities which are used only by one task, as well as entities which are used by more than one task, are all mapped in the same space. A consequence of this single large mapping is that each mappable entity has its own unique range of virtual addresses, which do not overlap or duplicate those of any other entity. As explained in the background section, this provides certain advantages when accessing entities which are used by different tasks. Since there is only one virtual address associated with an entity, this virtual address is persistent, and will be the same whenever the entity is referenced. This obviates the need to re-assign pointers in the virtual address space, and these pointers may be permanently assigned.
Typically, single-level store architectures are expected to have a sparse utilization of the virtual address space. When an entity is created, a chunk of virtual address space is permanently allocated to the entity, and therefore removed from use by other entities. The operating system will usually allocate virtual address space liberally, because it is not possible to reassign addresses later. Because all entities must share the same virtual address space in the system using single-level store architecture, and addresses are rapidly allocated without actually holding any data, the address space defined by n must be very large. While 16-, 24- and 32-bit addresses have been used with conventional multiple virtual address space architectures, a larger number is usually considered necessary for single-level store. The original IBM System/38 used 48-bit addresses, and more modem implementations envision 64-bit or larger addresses.
FIG. 5 depicts a high level mapping of entities in virtual address space of a computer system utilizing a shared address space region architecture, according to the preferred embodiment of the present invention. As in the case of the conventional multiple virtual address space architecture of FIG. 3, each task has its own mapping 501-503 of entities to virtual address space. Unlike the conventional system, however, a large portion of the virtual address space, designated the shared address space (SAS) region 510, contains a single common mapping across multiple tasks.
The SAS region 510 has characteristics of a single-level store architecture. SAS server 210 enforces a mapping of entities within the SAS region, and assures that all entities within this region are uniquely and persistently mapped. This address range is unique within the SAS region. However, outside SAS region 510, the mapping of entities in virtual memory is handled in the same manner as a conventional multiple virtual address space architecture. As shown in FIG. 5, entities outside the SAS region are mapped differently for each of the different tasks.
It should be understood that although addresses within the SAS region are persistently assigned to entities, there are certain system global events which may cause a re-assignment of addresses, depending on the design of the operating system. For example, the system may be designed so that addresses are re-assigned in the event of a re-building of the system following disaster recovery, or following a major alteration of the system. On the other hand, the system may be designed so that addresses are never re-assigned under any circumstances, and are indeed permanent. As used herein, “persistent” assignment means that addresses are not re-assigned whenever a new task is initiated or an entity is loaded from auxiliary storage. The very purpose of the SAS region and persistent assignment is that the same virtual address can be used to reference the same entity time and again.
As with a single-level store architecture, it is expected that address space in SAS region 510 will be sparsely used, and a very large address space is therefore desirable. In the preferred embodiment, the top and bottom 252 addresses in the processor's virtual address space lie outside the SAS region, and all addresses in the middle are in the SAS region. I.e., addresses 0 through 252−1, and addresses 264−252 through 264−1, lie outside the SAS region, while addresses 252 through 264−252−1 are in the SAS region. In other words, approximately 99.95% of the virtual address space lies in the SAS region. But even with such a large proportion of virtual address space taken by the SAS region, the remaining virtual address space still contains 253 addresses. This is larger than required by most, if not all, of the conventional multiple virtual address space architectures used today.
Because a sufficiently large range of addresses lies outside the SAS region, a multiple virtual address space operating system which has been modified as described herein can function in a normal manner without invoking the SAS facility. It can create multiple virtual address space mappings for multiple tasks, and within the address range lying outside the SAS region, each task can arbitrarily assign addresses to entities without regard to the mappings of other tasks. More significantly, computer programming code which was written and compiled for use on a conventional multiple virtual address space operating system will execute normally as a task in the system of the preferred embodiment, without the need to re-write or re-compile the code. Thus, a system having advantages of a single-level storage architecture is compatible with code written for a conventional multiple virtual address space system.
It should be understood that the mappings of FIGS. 3-5 are intended to illustrate the concepts of different address mapping approaches, and are not intended to show actual mappings for a particular system. In particular, the mappings are not drawn to scale. Typically, the number of mappable entities would be much larger, the size of an individual entity in relation to the total address space would be much smaller, and for larger values of n, the amount of unallocated space in a map would far exceed the amount of allocated space. As explained previously with regard to FIG. 5, SAS region 510 occupies a larger proportion of total address space than graphically depicted in the figure.
Addressing Constructs and Terminology
In order to efficiently support addressing in SAS region 510 as described herein, and to further enable sharing of objects across different systems in a potentially large network of systems, certain addressing constructs are used in the preferred embodiment. These are illustrated in FIG. 6. It should be understood that the addressing constructs illustrated in FIG. 6 are shown here in order to describe applicants' preferred embodiment, and that many variations of address length and address constructs are possible.
In the preferred embodiment, memory is byte-addressable. A virtual address 601 contains 64 bits, that being a convenient number established by the length of hardware registers in CPU 101 and other hardware constraints. A page is a 4 Kbyte contiguous segment of memory, in which all address bits are the same except the lowest order 12 bits. Therefore virtual address 601 may be divided into 52-bit virtual page index 602 and 12-bit byte index 603. Virtual page index 602 is sufficient to specify any page within the 64-bit address space of CPU 101, while byte index 603 is sufficient to specify any byte within a 4 Kbyte page.
In the preferred embodiment, address space is assigned to storage devices in large chunks called cohorts. Each cohort contains 240 (approximately one trillion) bytes of address space. A cohort is simply a convenient unit of assigning large portions of the address space, and is particularly useful in a distributed processing environment. Normally, a single cohort is assigned to a set of physical storage devices. If the set uses up all the virtual addresses in the cohort, additional cohorts may be assigned to the set.
In a distributed processing network, each cohort is uniquely identified by 64-bit cohort identifier 604. Within a cohort, any byte is uniquely identified by 40-bit cohort offset 606. Therefore, it is possible to uniquely identify any address in the network by the concatenation of the 64-bit cohort ID 604 and 40-bit cohort offset 606. This 104-bit identifier is also referred to as the object identifier.
It will be observed that the 104-bit object ID does not fit within the 64-bit address space of CPU 101. A 64-bit cohort ID is used in order to conveniently assure uniqueness of the cohort identifier throughout a potentially large network of systems. While 64 bits are potentially needed to identify all cohorts in a very large network, it is believed to be much larger than needed for identifying all cohorts on a single system. Within the processor address space of a single system, a cohort is identified by 24-bit cohort mapping prefix (CMP) 605. The concatenation of CMP 605 and cohort offset 606 form the 64-bit virtual address 601
The 64-bit space of cohort IDs is mapped into the 24-bit space of CMPs on any single system. A data structure in memory 102 contains the mapping, as described more fully below. This means that any single system can address only a small fraction of the possible number of cohort IDs in the entire distributed processing network. However, even this small fraction is extremely large, amounting to approximately 16 million cohorts. Moreover, 64 bits are provided for cohort identifier to conveniently assure uniqueness of the identifier in a distributed processing network. This does not mean that 264 cohorts actually exist in physical storage. Generally, this range of identifiers will be very sparsely allocated. The large 64-bit range makes it possible to assign portions of the range to different nodes in the network on some predetermined basis, without requiring a global cohort allocater to allocate cohorts sequentially. On a single system, only cohorts which are actually assigned to some physical storage need be given a CMP, allowing CMPs 605 to be assigned sequentially or on some other basis which assures that addresses are not wasted. The 24-bit size of CMP 605 is deemed adequate for this purpose.
If system 100 is not intended to share data in a network environment, the 64-bit cohort ID is unnecessary, and cohorts can simply be identified locally by CMU 605. In this case, certain references to the cohort ID in data structures and procedures described below should be understood to refer to CMP 605.
Cohort ID 604, CMP 605 and cohort offset 606 together constitute a 128-bit object reference, i.e., all the addressing information relating to an addressable entity on the system. However, as explained above, this 128-bit object reference is not itself an address; it is larger than an address. CMP 605 is duplicative of cohort ID 604, and only one or the other is needed to specify a cohort within a system.
As explained above, a cohort is a unit of allocation for sets of storage devices. Within a cohort, address space is allocated for use by the operating system and application programs in blocks. The system of the preferred embodiment supports block allocations of different sizes although the block size must be a power of two, and must be at least a page (4 Kbyte) and no larger than a cohort. Typically, a block is much smaller that a cohort and much larger than a page. As illustrated in FIG. 6, within a cohort, a block is identified by block index 607, and a byte within a block is identified by block offset 608. Block offset 608 can be further subdivided into block page index 609 and byte index 603.
Data Structures
In the preferred embodiment, SAS server 210 maintains various data structures to support the functions of the SAS region. The key structures are active task list 211, cohort mapping table 212, cohort block index 213, permanent directory 214, free space directory 215, and active block table 216, it being understood that these are not necessarily the only data structures maintained by SAS server 210. Because SAS server 210 operates as a server responding to calls from base operating system 201, these data structures are transparent to the base operating system. The structure and function of these data structures is described more fully below.
FIG. 7 depicts the format of active task list data structure 211. Active task list 211 contains a record of all active tasks which have joined the SAS region and the blocks which they have attached within the SAS region, i.e., the blocks for which access has already been requested and verified. Active task list 211 contains a plurality of entries, each entry representing either a pairing of a task with a block attached to that task or a pairing of a task with the SAS region, the latter entry being made when the task first joins the SAS region. If a block is attached to more than one task, its address may appear in multiple entries in active task list 211. Each entry contains task identifier field 701 for identifying the task, and virtual address range field 702 containing the starting virtual address and length of the block or SAS region.
The SAS server 210 maintains a single active task list 211, which contains information for all tasks and blocks.
FIG. 8 depicts the format of cohort mapping table data structure 212. Cohort mapping table 212 contains a mapping of the 64-bit cohort ID 604 into 24-bit CMPs 605 and identifies the set of storage devices to which the cohort is allocated. Cohort mapping table 212 contains a plurality of entries, each entry containing a cohort ID field 801, a cohort mapping prefix field 802, and a media ID field 803. Media ID field 803 contains an identifier for a set of physical storage devices. SAS server 210 maintains a single cohort mapping table 212 for system 100, containing a system-wide mapping of cohort ID to CMP.
FIG. 9 depicts the format of cohort block index data structure 213. Cohort block index 213 is a record of all blocks which have been allocated (created) within a set of storage devices (media group). Generally, a media group will have one cohort of virtual address space allotted for its use, but it may have more than one. Cohort block index contains a header portion containing the starting address of the next unallocated block 901, and a list of all physical storage devices which are in the media group 902. Following the header are a plurality of block entries, each representing an allocated block. Each block entry contains block address range field 903 and authority control field 904. Block address range field 903 contains the starting virtual address and length of a block which has been allocated within one of the cohorts assigned to the media group. Authority control field 904 contains a pointer to an authority control mechanism (such as an access control list) which controls authorization to the block.
As noted above, there is one cohort block index 213 for each media group, and therefore the system may have multiple cohort block index data structures, each one recording allocated blocks within its respective media group. Collectively, the cohort block index data structures contain a complete, permanent record of allocated blocks within the SAS region. It will be recalled that block allocations are persistent, and can not be duplicated by different tasks. The cohort block indices provide the record for assuring that blocks are never allocated more than once. For this reason, cohort block indices are persistent records which survive a system initial program load (IPL) or re-initialization.
FIG. 10 depicts the format of permanent directory data structure 214. Permanent directory 214 constitutes a mapping of virtual address space for which storage has actually been allocated to the physical storage. Permanent directory 214 contains a plurality of entries, each entry representing a contiguous range of virtual addresses which have been allocated a contiguous range of physical storage space. Permanent directory 214 contains virtual address field 1001 containing a starting virtual address for the range of addresses which have been allocated physical storage space, device identifier field 1002 containing the identifier of the physical storage device, sector field 1003 containing the starting sector of the allocated space on the physical storage device, and length field 1004 containing the length of the allocation of physical storage.
Like cohort block index 213, there is one permanent directory 214 for each media group. However, there is not a one-to-one correspondence of entries in the two data structures. When a block is allocated, the virtual address space within the block is reserved for some particular task, but the block does not necessarily contain any data. Typically, the size of the address space far exceeds the amount of physical storage. Address space is intended to be is sparsely used, so that most of the address space in an allocated block will never be allocated any physical storage.
FIG. 11 depicts the format of free space directory data structure 215. Free space directory 215 contains a record of all space on physical storage media which has not yet been allocated to any block. Like permanent directory 214 and cohort block index 213, there is one free space directory 215 for each media group. I.e., there is a one-to-one correspondence between cohort block index data structures 213, permanent directory data structures 214, and free space directory data structures 215. Free space directory contains a plurality of entries each representing a segment of free physical space on storage media. Each entry in free space directory 215 contains device identifier field 1101 containing the identifier of the physical storage device, sector field 1102 containing the starting sector of the free space on the physical storage device, and length field 1003 containing the length of the free physical storage.
FIG. 12 depicts the format of active block table data structure 216. Active block table 216records currently active blocks, media and authority control. The information is active block table 216is largely duplicated in other data structures such as cohort block index 213 and cohort mapping table 212, but the table is used for performance reasons, as explained later. SAS server 210 maintains a single active block table 216for the system. Active block table 216contains a plurality of entries, each entry representing an active block. Each entry in table 216contains memory object identifier field 1201, virtual address range field 1202, cohort identifier field 1203, media identifier field 1204, authority control field 1205, and task count field 1206. Memory object identifier field 1201 contains a memory object identifier which is assigned to the active block by base operating system 201, and used for identifying the block in certain procedure calls between base operating system 201 and SAS server 210. Task count field 1206 contains a count of the number of currently active tasks which have attached the block; this field is used for removing table entries which are no longer being used. Virtual address range field 1202 cohort ID field 1203, media ID field 1204, and authority control field 1205 contain the same information which is contained in virtual address range field 903, cohort ID field 801, media ID field 803, and authority control field 904, respectively, of cohort mapping table 212 and cohort block index 213.
It will be appreciated that, with respect to the above described data structures, it is not necessary to store a complete virtual address and block length in fields 702, 903, 1001, and 1202. For example, since cohort block index 213 is used to identify blocks, it is sufficient to store that portion of the virtual address sufficient to identify a block. In addition, if block size is fixed, it is not necessary to store a block length. In the preferred embodiment, it is deemed better to store the entire virtual address and mask out unwanted bits, and to store the length in order to support blocks of various sizes. Although this requires a small amount of additional memory, it is easier to move entire addresses and gives the system greater flexibility. It will also be appreciated that the data structures may contain additional fields not critical to an understanding of the embodiment described herein.
In addition to the data structures described above, which are maintained by SAS server 210, there are several data structures which are maintained by base operating system 201, and which are significant to the operation of SAS server 210. Base operating system maintains address to memory object tables (AMOT) 202, page table 203 , and memory object table 205 . It should be understood that base operating system 201 further maintains a large number of other data structures which are not described herein, as is common in an operating system for a multi-tasking computer system.
AMOT 202 maps blocks in virtual memory to memory object identifiers, pagers, and block access rights. In base operating system 201, a “pager” is a software port for a page request, i.e., the identity of a service utility for handling a page request. By providing a mapping of blocks to pagers, it is possible to provide different facilities for handling page requests to different parts of memory. Specifically, in the case of SAS regions, a page request to a page in the SAS region will be routed to the pager identified in AMOT 202, which will be SAS Server 210. A page request to a page outside the SAS region will be routed to a default paging utility. AMOT also records for each block the access rights that the task has been given for that block, e.g., “read”, “write” and “execute”. AMOT 202 is also used to reserve ranges of virtual address space, effectively removing these ranges from free space available for allocation. AMOT is referenced by operating system 201 when allocating available free space. Base operating system 201 maintains a separate AMOT for each active task.
Page table 203 maps virtual page indices to page indices in real storage, i.e., it records where a page actually is in real storage. Conceptually, the page table can be visualized as pairs of virtual page indices and real page indices, there being a separate set of pairs for each task on the system. In reality, the table may have a different, more complex structure, for reasons of performance or memory size. The actual structure of the table is not critical to an understanding of the preferred embodiment.
Memory object table 205 records which virtual pages are in real storage on a global basis (i.e., unlike the mapping in page table 203 , which is on a task basis). Memory object table 205 is used to map a page in real storage being used by one task to another task in page table 203 , thus avoiding the need to duplicate the page in real storage.
Operation
In operation, SAS Server 210 offers a battery of facilities that are invoked as necessary to make the system behave in accordance with the shared address space model. FIG. 13 shows a high-level flow diagram of task execution on the system of the preferred embodiment. In this embodiment, each task has the option to join or not to join the SAS region. As shown in FIG. 13, the key facilities available to support the SAS region are Join 1303, Create 1305, Attach Explicit 1306, Load 1307, Attach Implicit 1308, Assign Physical Storage 1309 and Write Back 1310.
A task is initiated in a conventional manner upon the request of a user by base operating system 201 as represented by block 1301. Base operating system creates all the data structures and table entries normally required to support execution of the task in the multi-tasking system. In particular, base operating system creates an AMOT 202 and entries in page table 203.
If the task is to join the SAS region and take advantage of its facilities, it must contain an explicit call to join the SAS region. It is not absolutely necessary that this call be made before any execution of the task takes place, but it would normally be done as one of the earliest commands issued by the task, and the decision to join the SAS region 1302 is therefore shown in FIG. 13 immediately following task initialization 1301. In applicants' embodiment, block 1302 is not a “decision” in the classical sense of a comparison of data, but is simply the presence or absence in the executing task of a call to join the SAS region.
If the task does not join the SAS region, execution proceeds in the conventional manner until completed, as represented by block 1311. In this case, no special allocation is made regarding virtual address space in the range otherwise reserved for the SAS region. Accordingly, the task is free to use any of this virtual address space for any purpose that would normally be permitted under conventional operating system constraints. Because base operating system 201 maintains a separate virtual address map for each task on the system, the use by a task which has not joined the SAS region of a virtual address range within the region will not affect the use by other tasks of that same virtual address range. Thus the system can concurrently execute tasks which have joined the SAS region and tasks which have not.
If a task is to join the SAS region, it initiates a call to the SAS server's join facility. This call is only made once for each task which joins the SAS region. The join call has the effect of reserving virtual address space in the SAS region and directing certain address references within the region to SAS server 210.
FIG. 14 illustrates in greater detail the steps taken by the system when a join call is made. At step 1401, the executing task asks to join the SAS region by issuing a remote procedure call to SAS server 210. SAS server receives the call 1402. SAS server 210 then issues a call back to base operating system 201 to reserve the SAS region for its use. Base operating system receives this call 1404, and reserves the entire SAS region of virtual address space. The reservation of space in the virtual memory map means only that the address space can not be used by the base operating system to satisfy a request for free space; it does not prevent memory accesses to addresses within the SAS region. Base operating system 201 satisfies a request for free space by parsing the entries in AMOT 202 to determine which address ranges have not been allocated. Therefore, the SAS region is reserved by adding an entry to AMOT 202 covering the entire SAS region, effectively preventing the operating system from allocating free space from the SAS region. Base operating system then returns to the SAS server at 1406. Upon returning to the SAS server, the server updates active task list 211 by adding an entry for the task which initially called the SAS server requesting to join the SAS region, at step 1407. The entry contains the identifier of the task in task ID field 701 and the address of the SAS region in virtual address field 702. SAS server 210 then returns at step 1408 to the task which initially called it, and the task resumes execution at 1409.
Having joined the SAS region, the task may invoke any of the SAS server's facilities or may continue execution, as represented in FIG. 13. Generally, the SAS server's facilities may be invoked multiple times and in varying order, as represented by blocks 1304-1310. Conventional execution of the task is represented by block 1304. Typically, the task will execute in a conventional manner until it either explicitly or implicitly requires one of the SAS server's facilities, which is then called (blocks 1305-1310). Upon return the task continues execution. The process repeats until the task completes. Upon completion; base operating system 201 and.SAS server 210 perform certain clean-up functions (block 1312), described more fully below.
The task may create entities having addresses within the SAS region for use by itself and/or other tasks. In order to do this, an address range within the SAS region is assigned to a block using the Create call 1305. Upon creation, a block is like an empty container of virtual memory; it is the unit of allocation and access control within the SAS region. Having created the block and specified access rights to it, the task which created it (or other tasks) will then determine what to place within the block, e.g., text data, object code, database, etc. SAS server 210 only provides the mechanism for block allocation, attachment, etc., and,does not control what is placed in the block by a task which is authorized to access it.
FIG. 15 illustrates in greater detail the steps taken by the system when a create call is made to SAS server 210. A task creates a block by issuing a remote procedure call to SAS server 210 at step 1501, requesting the SAS server to create a block. With the create call, the task passes a cohort identifier, identifying cohort in which the block will be created, and a length identifying the block size. Block size is a power of two, is at least one page, and no larger than a cohort. SAS server 210 receives the call at step 1502. SAS server then refers cohort mapping table 212 to determine the media group (and hence the cohort block index data structure 213) associated with the cohort specified in the create call, and then to the cohort block index 213 to determine the location of the next available unallocated address for the block, at step 1503. This address will be the address in next block field 901.
SAS server 210 creates an appropriate authority control structure for the block to be created at step 1504. In the preferred embodiment, the authority control structure is an access control list. Specifically, it is a list of users who are authorized to access the block (in some implementations, the access control list is a list of tasks authorized to access the block). The access control list will also identify an “owner”, i.e., someone authorized to change the authority to access the block. If no access control list is specified in the create call, SAS server 210 creates a default access control list. As a default, the user on whose behalf the calling task is running is identified as the owner of the block. No other individual authority is granted to access the block, but read only access is granted globally to all users. The calling task, or another task executing on behalf of the same user, may later change this access control list using any utility which may be available on the system for this purpose. Because the cohort block index 213 contains a pointer to the authority control structure in field 904, it is possible for more than one block to reference the same authority control structure. It will be understood by those skilled in the art that alternative (or no) authority control mechanisms may be used, and that SAS server 210 may alternatively call some system security utility provided in base operating system 201 or elsewhere to create an appropriate authority control mechanism.
SAS server 210 then updates cohort block index 213 at step 1505 to reflect the newly created block. A new entry is created in index 213, having the starting address and length of the new block in virtual address range field 903 and a pointer to the authority control structure in field 904. Next block field 901 is advanced to the address immediately after the highest address within the newly created block, this to be the address assigned to the any subsequently created block. Thus, blocks are allocated from the SAS region's address space sequentially, although it will be understood that alternative allocation schemes could also be used. Because cohort block index 213 is the master record of block allocations, and these allocations must not be duplicated, cohort block index 213 is saved to non-volatile storage after each update.
At this point, SAS server 210 may optionally return to the calling task, or may continue by assigning physical storage, as depicted at step 1506. If the server continues, it calls an assign storage subroutine at step 1507 to assign physical space on storage media, which in the preferred embodiment will typically be magnetic disk drive media. The steps taken by SAS server in the assign storage subroutine are illustrated in FIG. 19 as steps 1903-1905. Basically, server 210 searches free space directory 215 for a sufficiently large range of unassigned physical storage at step 1903; updates the free space directory at step 1904 to reflect that the storage range to be assigned is no longer available as free space; and adds a new entry for the newly assigned physical storage to permanent directory 214 at step 1905. These steps are described more fully below with respect to FIG. 19.
After allocating physical storage, the server may optionally immediately attach the block to the calling task by invoking the explicit attach function, as illustrated in steps 1508, 1509. If the explicit attach function is invoked, it is called internally by SAS server 210. This amounts to performing the applicable steps shown in FIG. 16 and described in the accompanying text below. SAS server 210 then returns to the calling task at step 1510, which continues execution at step 1511.
The task may “attach” a block within the SAS region after that block has been created. Attachment is the mechanism by which the task is authorized to access the block. A task which has joined the SAS region may attach any block which it is authorized to access (regardless of which task created the block in the first instance). A task may attach any number of blocks within the SAS region, and a block may be attached by multiple tasks simultaneously, thus enabling shared access to objects in the SAS region. A particular block is attached to a particular task only once; after a task has attached a particular block, it need not attach it again although it may access it multiple times. Attachment is performed either explicitly or implicitly. An explicit attachment is one which is performed as a result of a direct call of the explicit attach function from the task. An implicit attachment is performed when the task attempts to access a block within the SAS region to which it has not previously been attached.
FIG. 16 illustrates in greater detail the steps taken by the system when an explicit attach call is made to SAS server 210. A task initiates the explicit attach function by issuing a remote procedure call to SAS server 210 at step 1601, requesting the SAS server to attach a block. The block starting address and type of access requested (e.g., read only, read/write, etc.) are passed parameters of the remote procedure call. SAS server 210 receives the call at step 1602.
Server 210 then checks active task list 211 for an entry corresponding to the executing task and block requested at step 1603. A corresponding entry in active task list 211 means that the block has already been attached, and need not be attached again; in this case, the server returns immediately to the calling task.
If no entry for the task and block exists in active task list 211, server 210 then accesses cohort block index 213 to find the applicable authority control structure, and verifies that the requesting task has authority to access the block at step 1604. In the preferred embodiment, server 210 parses an access control list identified by a pointer in authority control field 904 to determine whether authority exists. However, it will be recognized that many different and more complex authority verification schemes are possible, and verification of authority may be accomplished by calling a separate authority verification utility for that purpose. If insufficient authority exists (step 1605), server 210 returns immediately to the calling task without attaching any block.
If the requested authority exists, and no entry for the block and task exists in active task list 211, an entry is added to active task list 211 at step 1606. Server 210 then checks active block table 216to determine whether an entry corresponding to the block to be attached already exists in the table at step 1607. An entry may exist in table 216, notwithstanding the fact that there was no entry for the executing task and block in active task list 211, because another active task may have previously attached the block.
If an entry for the block already exists in active block table 216, task count field 1206 of the corresponding entry is incremented at step 1608. Incrementing the count field indicates that another task has attached the block. Server 210 then issues a virtual memory Map call to base operating system 201 at step 1610 (see below).
If, at step 1607, an entry for the block does not exist in active block table 216, the above procedure is slightly modified. SAS Server 210 creates an entry for the block in active block table 216, specifying a block count of one in field 1206, and specifying the appropriate values of fields 1202-1265, at step 1611. Server 210 also generates a memory object identifier for the new block, which is placed in field 1201 of the newly created entry in active block table 216.
Server 210 then issues a virtual memory map call to base operating system 201 at step 1610. The VM map call requests base operating system 201 to update the virtual memory map applicable to the executing task so that the block to be attached is now included in AMOT 202. In the map call, server 210 specifies the memory object ID (from field 1201 of table 216), block virtual address range, pager (which is the SAS server) and type of authority.
Upon receipt of the VM map call, base operating system 201 is acting as a server which has no way of knowing whether the pager specified in the call will respond for the memory object ID. It therefore issues a “notify” call back to the specified pager (i.e., SAS server 210) at step 1611, requesting Server 210 to verify that it will respond for the memory object ID. On receipt of the notify call, a separate thread running on SAS server 210 accesses active block table 216, verifies that the specified memory object ID is in the table, and returns with a positive result at step 1612. Base operating system, 201 then adds the appropriate entry for the newly attached block to AMOT 202 of the executing task at step 1613, and returns to SAS server 210. SAS Server then returns to the executing task at step 1615, which continues execution at step 1616.
Having attached a block, the task is free to reference virtual memory locations within the block. These references are handled with the assistance of base operating system's page fault handling capabilities, and are essentially transparent to the executing task. Base operating system 201 maintains a page table 203 which maps virtual pages to real storage for each executing task, as explained previously. A virtual page in the SAS region is added to the page table using the SAS server's external page facility as part of a load procedure or an implicit attach procedure, both of which are explained below. The authority of the task to access the virtual page is verified before the page entry can be added to table 203 , so that it is not necessary to verify authority to access any page that is already mapped in page table 203 for a particular task.
FIG. 17 illustrates in greater detail the steps taken by the system when an attempt to reference a page from a previously attached block generates a page fault, which may require that the page be loaded from storage to real memory (“Load procedure”). At step 1701, the executing task requires access to a page in virtual memory. At step 1702, the system looks in page table 203 and is unable to find an entry mapping the virtual memory address to real storage (a page fault condition exists).
Base operating system 201 then consults address to memory object table (AMOT) 202 in order to determine the memory object ID and appropriate pager port at step 1703. If the block was previously attached, an entry for the block will exist in AMOT. If no entry for the block exists, or if inadequate authority exists, an exception is generated (see below with respect to FIG. 18). Assuming no exception is generated, base operating system 201 uses memory object ID from AMOT 202 to search memory object table 205 , in order to determine whether the requested page already exists in real memory (i.e., has been read into real memory on behalf of some other task) at step 1704. If the page already exists in real memory, base operating system 201 simply updates page table 203 so that the page is mapped to the appropriate real memory location in the page table entries for the executing task at step 1705. Base operating system then directs the task to re-try the instruction at step 1713 (see below). If the page does not exist in real memory, a pager is called.
In the base operating system of the preferred embodiment, it is possible to specify different software ports for handling page faults to different virtual memory locations. A default pager is provided with the base operating system, but different pagers may be specified. The software port is specified in a pager field in the AMOT entry corresponding to the block to be accessed. It should be understood that other operating systems could use other mechanisms. For a block in the SAS region, the pager specified in the pager field will be the SAS server's external pager. Accordingly, base operating system 201 issues a remote procedure call (in effect a page request) to SAS server 210 at step 1706, passing the memory object ID (from AMOT 202), block index 607 and block page index 609.
SAS server 210 receives the call at step 1707. Server 210 uses the memory object ID as an index to access the appropriate entry in active block table 216. Because the block has already been attached, an entry for the block should exist in active block table 216(if not, an exception is generated). SAS server 210 determines the correct permanent directory 214 from media ID field 1204 in ABT 216 at step 1708. Server 210 then accesses the appropriate permanent directory to find the storage device and sector corresponding to the virtual address sought at step 1709 (if no entry exists in permanent directory 214, an exception is generated). SAS server 210 requests an I/O server to fetch the appropriate page from the designated storage device and sector at step 1710, and returns this page to base operating system 201 at step 1711. Base operating system 201 updates page table 203 and memory object table 205 with entries mapping the virtual address of the page to its real storage location at step 1712. Base operating system then directs the executing task to re-try the instruction at step 1713, as it normally would following any page fault after the desired page has been loaded into memory. Upon re-try by the executing task, the page will be found in page table 203 and the instruction will execute at step 1714. It will be noted that while the page remains in real storage, subsequent memory references to the same page will be mapped directly by base operating system 201 using page table 203 , making further calls to SAS server 210 unnecessary. If the page is “paged out” of real storage, it will be necessary to perform the load function again.
In some circumstances, an executing task may attempt to access an address in the SAS region virtual memory which it has not yet attached. For example, this may occur because the task is following a chain of pointers during execution of an object-oriented application, where different objects of the application are controlled by different users. Because it is difficult for the task to predict which blocks will be necessary for execution beforehand, it is desirable to have a mechanism which allows the executing task to simply attempt access with any pointer, and which automatically attaches the required block where appropriate. In the preferred embodiment, this is accomplished with the implicit attach function.
FIG. 18 illustrates in greater detail the steps taken by the system when an attempt to reference a page from an unattached block generates a page fault. The initial steps are similar to those shown in FIG. 17 and described above with respect to the load procedure. At step 1801, the executing task requires access to a page in virtual memory. At step 1802, base operating system 201 looks in page table 203 and is unable to find an entry mapping the virtual memory address to real storage (a page fault condition exists). Base operating system 201 then consults AMOT 202 to determine the proper pager port at step 1803. Because in this instance the block is unattached, there is no entry in the AMOT, and base operating system 201 generates a bad address exception.
The base operating system 201 of the preferred embodiment has the capability to alter the designation of exception ports. In this embodiment, all bad address exceptions are directed to SAS server 210. At step 1804, SAS server 210 receives the bad address exception. Server 210 then determines at steps 1805-1808 whether it should correct the exception condition or re-route the exception back to the default exception handler.
SAS server 210 first verifies whether the virtual address which generated the exception is within the SAS region at step 1805. If not, the exception is returned to the default exception port of base operating system 201 to be handled as a normal bad address exception at step 1809. SAS Server then accesses active task list to verify that the executing task has joined the SAS region at step 1806; if not, the exception is returned to the default exception port at step 1809. Server 210 then checks cohort block index 213 to verify that the requested block has been created at step 1807; if not, the exception is returned at step 1809. Finally, server 210 uses authority control field 904 to verify authority of the executing task to access the block at step 1808. As previously stated, in the preferred embodiment, field 904 is a pointer to an access control list, which is used to verify authority. If insufficient authority exists, the exception is returned at step 1809. It will be noted that by this method, an invalid address is treated in the same manner as a valid address to which the executing task lacks authority. For purposes of task execution, this is considered acceptable. In either case, the net effect is that task will be unable to access the address.
If the address is within the SAS region, the task has joined the SAS region, the block exists and authority to access the block exists, SAS server 210 will “implicitly” attach the block so that the task can access it. SAS server 210 adds an entry to active task list 211 corresponding to the executing task and block to be attached, at step 1810. The procedure followed at this point is similar to that used for an “explicit attach”, particularly, steps 1607 through 1614, described above. SAS server 210 checks active block table 216for the existence of an entry corresponding to the block to be accessed at step 1811. Even though the block has not yet been attached by the executing task, an entry may exist in table 216 because some other task has previously attached the block.
If an entry for the block already exists in active block table 216, task count field 1206 of the corresponding entry is incremented at step 1812. If, at step 1811, an entry for the block does not exist in active block table 216, server 210 creates an entry for the block in active block table 216, specifying a block count of one in field 1206, and specifying the appropriate values of fields 1202-1205, at step 1813. Server 210 also generates a memory object identifier for the new block, which is placed in field 1201 of the newly created entry in active block table 216.
Server 210 then issues a virtual memory map call to base operating system 201 at step 1814. The VM map call requests base operating system 201 to update the virtual memory map applicable to the executing task so that the block to be attached is now included in AMOT 202. In the VM map call, server 210 specifies the memory object ID (from field 1201 of table 216), block virtual address range, pager (which is the SAS server) and type of authority.
Upon receipt of the VM map call, base operating system 201 is acting as a server which has no way of knowing whether the pager specified in the call will respond for the memory object ID. It therefore issues a “notify” call back to the specified pager (i.e., SAS server 210) at step 1815, requesting Server 210 to verify that it will respond for the memory object ID. On receipt of the notify call, a separate thread running on SAS server 210 accesses active block table 216, verifies that the specified memory object ID is in the table, and returns with a positive result at step 1816. Base operating system 201 then adds the appropriate entry for the newly attached block to AMOT 202 of the executing task at step 1817, and returns to SAS server 210. SAS Server then returns to the executing task at step 1818.
Upon return, the executing task retries the instruction at step 1819. Again, base operating system checks the page table for the existence of the page (which will not be there). However, in this instance there will be an entry in AMOT 202. Therefore, the system performs the “load” procedure described above and shown in FIG. 17, represented as step 1820. Upon return from the “load” procedure, the instruction must be retried again. This time the instruction will be able to access the desired memory location, the page now being in memory and mapped in page table 203 . As described above, if the page is “paged out” of real storage, it will be necessary to perform the load function again. However, it will not be necessary to attach the block again.
Sometimes, a task which has attached a block may need to assign additional physical storage within the block. It will be recalled that a block is like a large container of virtual address space, which is typically sparsely used. Physical storage will normally be allocated on a more conservative basis, because it represents actual hardware capacity. As objects within a block are created or expanded, additional physical storage may be necessary. FIG. 19 illustrates the steps taken by the system when additional physical storage is assigned to blocks within the SAS region. The executing task calls SAS server 210 at step 1901, requesting the server to assign additional physical storage. The amount of physical storage requested is a passed parameter. Server 210 receives the request at step 1902, and searches free space directory 215 for a sufficiently large range of unassigned physical storage, taking the first entry it finds in the free space directory of sufficient size, at step 1903. If no single contiguous range sufficiently large exists, server 210 will take multiple smaller non-contiguous ranges. At step 1904, the free space directory is updated to reflect that the range of storage to be assigned is no longer available as free space. At step 1905, a new entry is added to permanent directory 214 with the information of the newly assigned space. If multiple non-contiguous areas of storage are needed, a separate entry in permanent directory 214 is needed for each such area. The server then returns to the executing procedure at step 1906, which continues execution at step 1907. In the preferred embodiment, the system will not automatically assign physical storage if the executing task references an address within an attached block for which no storage has been assigned; the task must explicitly call the server, requesting it to assign storage. The requirement of an explicit call to assign storage is a design decision intended to the reduce the effect of erroneous references to unassigned addresses. It would alternatively be possible to assign storage automatically.
FIG. 20 illustrates the steps taken by the system when a page within the SAS region is written back to storage. This process may be initiated by base operating system 201 because a “dirty” page (i.e., a page which has been altered since it was loaded) is being paged out (step 2001), or may be initiated by an explicit command from the executing task (step 2002). At step 2003, base operating system accesses AMOT 202 to determine the appropriate pager for the memory object of which the page to be written back is a part. For a page within the SAS region, the pager will be SAS server 210. At step 2004, base operating system 201 issues a call to SAS server 210, requesting that the page be written to storage. SAS server 210 receives the call at step 2005. Server 210 accesses active block table 216 to determine the appropriate media group at step 2006, and then accesses the permanent directory of the corresponding media group to determine the storage device and sector where the page should be written, at step 2007. SAS server then calls the base operating system's file server to write the page to storage, passing the device, media, and page location, at step 2008. The file server is a general purpose I/0 handler which is used by base operating system and SAS server to write data to storage locations. The file server returns control to base operating system 201 when finished writing the page to storage at step 2009.
When a task completes execution, base operating system 201 performs conventional clean-up functions with respect to data structures that it maintains, particularly AMOT 202, page table 203 , free address list 204, and memory object table 205 . Additionally, SAS server is called to clean up its data areas. In particular, SAS server 210 parses active task list 211 to determine whether the task has joined the SAS region. If so, for each task/block pair entry in active task list 211, the SAS server decrements count field 1206 in active block table 216. If the count is zero after decrementing, no active task is any longer attached to the block. Accordingly, the corresponding entry is removed from table 216. Lastly, all the entries for the task are removed from active task list 211. Cohort mapping table 212, cohort block index 213, permanent directory 214, and free space directory 215 are not affected by task termination. These functions are represented in FIG. 13 as step 1312.
A further refinement is employed to support execution of application programs compiled from certain languages which use static storage areas for temporary storage, such as C and C++. Typically, such code contains pointers to static storage locations. The code itself is read-only and doesn't change, but each executing task will need a separate copy of the static storage. If the program is intended to be a shared entity having a virtual address in the SAS region (and the static storage area likewise has a virtual address in the SAS region), some provision is necessary to allow different tasks to have different copies of the static storage area.
In applicant's embodiment, such static storage is allocated to a different block within the SAS region than the block containing the actual code. When the block containing static storage is first attached by an executing task and an entry is created in active block table 216, a field (not shown) in table 216 identifies the block as a “copy-on-write” block. Thereafter, when a virtual memory map call is made by server 210 (step 1610 or step 1814), the call also identifies the block as a “copy-on- write” block, and this information is placed in a field (not shown) in AMOT 202. If the executing task subsequently alters any data in the static storage, base operating system 201 creates a separate copy of the static storage in real memory, and alters the pager designation in the corresponding entry in AMOT 202 to specify the operating system's default pager. If a page in the static storage must be paged out to a temporary area of disk storage, it can be retrieved intact. The task is thus free to alter its copy of the static storage, and the copy remains at the same virtual address within the SAS region, without compromising the corresponding static storage areas of other tasks. In this limited sense, it is possible for different versions of an entity in the SAS region to exist in applicants' preferred embodiment.
Examples of Alternative Embodiments
In the preferred embodiment, a conventional multi-tasking operating system is used as a “base”, and additional functions are added to it in order to support use of the SAS region, as described above. The use of a conventional multi-tasking operating system as a base greatly reduces the amount of development effort required for a new system, and facilitates compatibility with an existing operating system. However, the fact that the functions which support the SAS region in the preferred embodiment are external to the base operating system should not be taken as a design requirement. It would alternatively be possible to design and construct an operating system from scratch, in which the SAS functions are fully integrated into the operating system. There may be advantages to the alternative of a fully integrated operating system which would make it desirable, particularly where compatibility with preexisting software is not a concern.
It will also be understood that, where a SAS server is used to enhance the capabilities of a base operating system as in the preferred embodiment, the functions performed by the SAS server may depend on the capabilities of the base operating system, and the SAS server will not necessarily perform every function performed by the SAS server of the preferred embodiment, or perform every such function in exactly the same way.
It will be further understood that many alternative data structures may be used to support a shared address space among multiple virtual address spaces. A set of data structures has been described with respect to the preferred embodiment, and particularly with respect to a system having a base operating system and a server supporting the SAS region. The description of these particular data structures should not be construed to mean that alternative data structures are not possible, that all of the functions performed by the described data structures are essential for every embodiment, or that other functions might not be necessary, depending on the embodiment.
In the preferred embodiment, a task is not required to “join” the SAS region, and so may choose not to utilize the capabilities of that region. By not joining the SAS region, the full amount of virtual address space is available to the task for whatever use it may make of it. This embodiment enables the system to be fully compatible with a base system having no SAS region capability, since it is possible that certain applications will make use of addresses in the range of the SAS region for purposes other than access to the SAS region facilities. However, since it is anticipated that the total size of the virtual address space available to a task in the system is much larger than it needs, it is unlikely to be unduly constraining if a portion of that space is always reserved for the SAS region. Therefore, in an alternative embodiment, all tasks are required to reserve a fixed range of virtual address space for the SAS region, whether they use this facility or not. Depending on the implementation, this alternative may simplify some of the code required to manage the SAS region.
In the preferred embodiment, there is a single SAS region which consumes the bulk of the virtual address space, and which all participating tasks join. It would alternatively be possible to construct a system with multiple SAS regions for sharing among groups of tasks. As a general rule, the use of multiple SAS regions would appear to contravene the purpose of the shared address space, i.e., the ability to more easily share objects among different tasks. However, there may be situations in which it is desirable for purposes of security or other reasons.
In the preferred embodiment, an access control list is associated with each block and controls access to it. However, many alternative methods of access control are possible. It will be noted that the use of SAS regions already provide a form of access control, i.e., entities within the SAS region have one type of control mechanism, while entities outside the SAS region have different control. It would, for example, be possible to have no authority control within the SAS region, so that any task which has joined the region has authority to access any block within the region. Because each task has a portion of virtual address space outside the SAS region, any entities which the task wishes to protect from use by other tasks can be placed in its private virtual address space outside the SAS region. This alternative embodiment would simplify some of the functions described above. It would also be possible to use other forms of access control within the SAS region, such as domain attributes (described in U.S. Pat. No. 5,280,614, to Munroe et al., herein incorporated by reference) hierarchical rings, or task or user profiles. For example, a task or user profile might contain a list of blocks or other entities to which a task or user is authorized, and these might be automatically attached upon joining the SAS region, or attached on demand for access to a particular block by searching the list. SAS regions provide an addressing and access mechanism which is generally compatible with a wide range of authority control methods.
Although a specific embodiment of the invention has been disclosed along with certain alternatives, it will be recognized by those skilled in the art that additional variations in form and detail may be made within the scope of the following claims.
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US4455602May 22, 1981Jun 19, 1984Data General CorporationDigital data processing system having an I/O means using unique address providing and access priority control techniques
US5123094 *Jan 26, 1990Jun 16, 1992Apple Computer, Inc.Interprocessor communications includes second CPU designating memory locations assigned to first CPU and writing their addresses into registers
US5347649 *Mar 6, 1990Sep 13, 1994International Business Machines Corp.System for dynamically generating, correlating and reading multiprocessing trace data in a shared memory
US5581765Aug 30, 1994Dec 3, 1996International Business Machines CorporationSystem for combining a global object identifier with a local object address in a single object pointer
US5729710 *Jun 22, 1994Mar 17, 1998International Business Machines CorporationMethod and apparatus for management of mapped and unmapped regions of memory in a microkernel data processing system
US5752249 *Nov 14, 1996May 12, 1998Macon, Jr.; Charles E.System and method for instantiating a sharable, presistent parameterized collection class and real time process control system embodying the same
US5771383 *Feb 13, 1997Jun 23, 1998International Business Machines Corp.Shared memory support method and apparatus for a microkernel data processing system
US5790852 *Aug 27, 1991Aug 4, 1998International Business Machines CorporationComputer with extended virtual storage concept
EP0327798A2Jan 5, 1989Aug 16, 1989International Business Machines CorporationControl method and apparatus for zero-origin data spaces
EP0398695A2May 16, 1990Nov 22, 1990International Business Machines CorporationA single physical main storage unit shared by two or more processors executing respective operating systems
GB2282470A Title not available
Non-Patent Citations
Reference
1"An Operating System Structure for Wide-Address Architectures," Jeffrey S. Chase. Technical Report Aug. 6, 1995, Department of Computer Science and Engineering, University of Washington.
2"Architectural Support for Single Address Space Operating Systems," Eric J. Koldinger et al. In Proc. of the 5th Int. Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Oct. 1992.
3"AS/400 System Overview," Ronald O. Fess et al., IBM Application System/400 Technology, pp. 2-10, Jun. 1988.
4"Distribution in a Single Address Space Operating System," Jeff Chase et al. Department of Computer Science and Engineering, University of Washington.
5"Fine-Grained Mobility in the Emerald System," Eric Jul et al. ACM Trans. on Computer Systems 6(1), Feb. 1988.
6"How to Use a 64-Bit Virtual Address Space," Jeffrey S. Chase et al. Technical Report Mar. 2, 1999, Department of Computer Science and Enginering, University of Washington.
7"Implementing Global Memory Management in a Workstation Cluster," Michael J. Feeley et al., In Proc. of the 15th ACM Symposium on Operating Systems Principles, Dec. 1995.
8"Integrating Coherency and Recoverability in Distributed Systems," Michael J. Feeley et al. In Proc. of the First Symposium on Operating Systems Design and Implementation, Nov. 1994.
9"Introduction to IBM System/38 Architecture," G. G. Henry, IBM System/38 Technical Developments, pp. 3-6, Dec. 1978.
10"Lightweight Shared Objects in a 64-Bit Operating System," Jeffrey S. Chase et al. In Proc. of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), Oct. 1992.
11"Opal: A Single Address Space System for 64-bit Architectures," Jeff Chase et al. In Proc. IEEE Workshop on Workstation Operating Systems, Apr. 1992.
12"Shared Memory Suport for Object-based RPC," Rene' W. Schmidt et al. Department of Computer Science and Engineering, University of Washington.
13"Sharing and Protection in a Single Address Space Operating System," Jeffrey S. Chase et al. ACM Transactions on Computer Systems, 12(4), Nov. 1994.
14"Some Issues for Single Address Space Systems," Jeff Chase et al. In Proc. of the Fourth IEEE Workshop on Workstation Operating Systems, Oct. 1993.
15"Supporting Cooperation on Wide-Address Computers," Jeffrey S. Chase et al. Technical Report Mar. 3, 1991, Department of Computer Science and Engineering, University of Washington.
16"System/38-A High-Level Machine," S. H. Dahlby et al., IBM System/38 Technical Developments, pp. 47-58, Dec. 1978.
17"The Amber System: Parallel Programming on a Network of Multiprocessors," Jeffrey S. Chase et al. Proc. of the 12th ACM Symposium on Operating Systems Principles, Dec. 1989.
18"The Protection Lookaside Buffer: Efficient Protection for Single Address-Space Computers," Eric J. Koldinger et al. Technical REport Nov. 5, 1991, Department of Computer Science and Engineering, University of Washington.
19"User-level Threads and Interprocess Communications," Michael J. Freeley et al. Technical Report Feb. 3, 1993, Department of Computer Science and Engineering, University of Washington.
20 *"Using Captured Storage for Accessing Debug Break Points and Storage," IBM Technical Disclosure Bulletin, pp. 261-263, Dec. 1, 1996.*
21"Using Virtual Addresses as Object Referecnes," Jeff Chase et al. In Proc. 2nd Int. Workshop on Object Orientation in Operating Systems, Sep. 1992.
22"System/38—A High-Level Machine," S. H. Dahlby et al., IBM System/38 Technical Developments, pp. 47-58, Dec. 1978.
23 *J. Chase, et al, "Sharing and Protection in a Single-Address-Space Operating System", ACM Trans. Computer Systems, pp. 271-307, Nov. 1994.*
24 *P. Amaral, et al, "A model for persistent shared memory addressing in distributed systems", IWOOOS'92, Chorus Systems, Sep. 1992.*
25 *S. Jagannathan, et al, "A Reseach Prospectus for Advanced Software Systems", NEC Research Institute, 1995.*
26 *Y. Jiang, et al, "Integrating Parallel Functions into the Manipulation for Distributed Persistent Objects", IEEE, pp. 76-82, 1996.*
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7028299 *Jun 30, 2000Apr 11, 2006Intel CorporationTask-based multiprocessing system
US7110373 *Dec 23, 2002Sep 19, 2006Lg Electronics Inc.Apparatus and method for controlling memory for a base station modem
US7130840 *May 30, 2001Oct 31, 2006Matsushita Electric Industrial Co., Ltd.Information recording medium, information recording method, information recording apparatus, information reproducing method, and information reproducing apparatus
US7213098 *Feb 11, 2002May 1, 2007Sun Microsystems, Inc.Computer system and method providing a memory buffer for use with native and platform-independent software code
US7269613Apr 21, 2006Sep 11, 2007Matsushita Electric Industrial Co., Ltd.Information recording medium, information recording method, information recording apparatus, information reproducing method and information reproducing apparatus
US7330907 *Oct 2, 2003Feb 12, 2008Internet Associates, LlcMethods, computer systems, and computer readable media for controlling the status of network address space
US7401196 *Oct 11, 2005Jul 15, 2008Hitachi, Ltd.Storage system and storage control method for access exclusion control of each storage area unit comprising storage area of storage device
US7437390Apr 21, 2006Oct 14, 2008Matsushita Electric Industrial Co., Ltd.Information recording medium, information recording method, information recording apparatus, information reproducing method and information reproducing apparatus
US7450420May 8, 2006Nov 11, 2008Sandisk CorporationReclaiming data storage capacity in flash memories
US7480766 *Aug 3, 2005Jan 20, 2009Sandisk CorporationInterfacing systems operating through a logical address space and on a direct data file basis
US7509333Apr 21, 2006Mar 24, 2009Panasonic CorporationInformation recording medium, information recording method, information recording apparatus, information reproducing method and information reproducing apparatus
US7539989Oct 12, 2004May 26, 2009International Business Machines CorporationFacilitating intra-node data transfer in collective communications
US7552271Jul 21, 2006Jun 23, 2009Sandisk CorporationNonvolatile memory with block management
US7558881 *Jan 9, 2008Jul 7, 2009Internet Associates, LlcMethods, computer systems, and computer readable media for controlling the status of network address space
US7558905May 8, 2006Jul 7, 2009Sandisk CorporationReclaiming data storage capacity in flash memory systems
US7558906Jul 21, 2006Jul 7, 2009Sandisk CorporationMethods of managing blocks in nonvolatile memory
US7562181Aug 2, 2006Jul 14, 2009Sandisk CorporationFlash memory systems with direct data file storage utilizing data consolidation and garbage collection
US7581057May 8, 2006Aug 25, 2009Sandisk CorporationMemory system with management of memory blocks that directly store data files
US7590794Aug 2, 2006Sep 15, 2009Sandisk CorporationData operations in flash memories utilizing direct data file storage
US7590795Aug 2, 2006Sep 15, 2009Sandisk CorporationFlash memory systems utilizing direct data file storage
US7610437Aug 2, 2006Oct 27, 2009Sandisk CorporationData consolidation and garbage collection in direct data file storage memories
US7627733Aug 3, 2005Dec 1, 2009Sandisk CorporationMethod and system for dual mode access for storage devices
US7669003 *Jul 21, 2006Feb 23, 2010Sandisk CorporationReprogrammable non-volatile memory systems with indexing of directly stored data files
US7680987 *Mar 29, 2006Mar 16, 2010Emc CorporationSub-page-granular cache coherency using shared virtual memory mechanism
US7739406Jun 10, 2009Jun 15, 2010Internet Associates, LlcControlling the status of network address space
US7747837Dec 21, 2005Jun 29, 2010Sandisk CorporationMethod and system for accessing non-volatile storage devices
US7769978Dec 21, 2005Aug 3, 2010Sandisk CorporationMethod and system for accessing non-volatile storage devices
US7793068Dec 21, 2005Sep 7, 2010Sandisk CorporationDual mode access for non-volatile storage devices
US7844781Feb 23, 2006Nov 30, 2010International Business Machines CorporationMethod, apparatus, and computer program product for accessing process local storage of another process
US7877539Feb 16, 2005Jan 25, 2011Sandisk CorporationDirect data file storage in flash memories
US7900011 *Jul 19, 2007Mar 1, 2011International Business Machines CorporationApparatus, system, and method for improving system performance in a large memory heap environment
US7949845Jul 21, 2006May 24, 2011Sandisk CorporationIndexing of file data in reprogrammable non-volatile memories that directly store data files
US7975018Jul 7, 2005Jul 5, 2011Emc CorporationSystems and methods for providing distributed cache coherence
US8046759 *Aug 26, 2005Oct 25, 2011Hewlett-Packard Development Company, L.P.Resource allocation method and system
US8055832May 8, 2006Nov 8, 2011SanDisk Technologies, Inc.Management of memory blocks that directly store data files
US8117615May 5, 2009Feb 14, 2012International Business Machines CorporationFacilitating intra-node data transfer in collective communications, and methods therefor
US8209516Feb 26, 2010Jun 26, 2012Sandisk Technologies Inc.Method and system for dual mode access for storage devices
US8438341Jun 16, 2010May 7, 2013International Business Machines CorporationCommon memory programming
US8650278Jun 23, 2011Feb 11, 2014Internet Associates, LlcGenerating displays of networking addresses
US8825903Apr 29, 2010Sep 2, 2014Infoblox Inc.Controlling the status of network address space
US8832234Mar 29, 2012Sep 9, 2014Amazon Technologies, Inc.Distributed data storage controller
US8832411Dec 14, 2011Sep 9, 2014Microsoft CorporationWorking set swapping using a sequentially ordered swap file
US8918392 *Mar 29, 2012Dec 23, 2014Amazon Technologies, Inc.Data storage mapping and management
US8930364Mar 29, 2012Jan 6, 2015Amazon Technologies, Inc.Intelligent data integration
US8935203Mar 29, 2012Jan 13, 2015Amazon Technologies, Inc.Environment-sensitive distributed data management
US8972696Mar 7, 2011Mar 3, 2015Microsoft Technology Licensing, LlcPagefile reservations
US20120137282 *Jul 1, 2011May 31, 2012Covia Labs, Inc.System method and model for social synchronization interoperability among intermittently connected interoperating devices
US20140066034 *Aug 26, 2013Mar 6, 2014Pantech Co., Ltd.Apparatus and method for displaying callback information
Classifications
U.S. Classification718/104, 711/E12.068, 719/312
International ClassificationG06F12/10
Cooperative ClassificationG06F12/109
European ClassificationG06F12/10S
Legal Events
DateCodeEventDescription
Jul 15, 2011FPAYFee payment
Year of fee payment: 8
Jul 13, 2007FPAYFee payment
Year of fee payment: 4
Mar 10, 1997ASAssignment
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MUNROE, STEVEN J.;PLAETZER, SCOTT ALAN;STOPYRO, JAMES WILLIAM;REEL/FRAME:008514/0616;SIGNING DATES FROM 19961220 TO 19970304 | {
"url": "http://www.google.com/patents/US6681239?dq=6031454",
"source_domain": "www.google.com",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "206897",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W2FBSQX2BLQ3I57UZUISOYB4MGZWTAI3",
"WARC-Concurrent-To": "<urn:uuid:baabf1a0-6671-4e0a-bdcb-47a188f448b9>",
"WARC-Date": "2015-05-29T13:37:08Z",
"WARC-IP-Address": "216.58.217.132",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:Q3L35NJ3AAIF3EBN5LEPOGXAUI32SOBR",
"WARC-Record-ID": "<urn:uuid:430f776d-6b1f-4687-a7d8-00c4fdfb498c>",
"WARC-Target-URI": "http://www.google.com/patents/US6681239?dq=6031454",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7f8e76e9-f5d5-44c2-84d4-26d1e7e13eb4>"
},
"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,
56,
64,
205,
206,
214,
215,
243,
274,
296,
328,
357,
381,
407,
422,
528,
599,
660,
699,
750,
832,
846,
855,
1857,
1868,
1882,
1892,
1903,
1923,
1957,
1970,
1980,
2361,
2527,
2872,
3358,
3575,
3957,
4033,
4269,
4519,
4815,
4850,
5193,
5363,
5548,
5856,
6031,
6201,
6503,
6920,
7188,
7385,
7697,
7866,
8044,
8202,
8561,
8763,
8860,
8985,
9046,
9270,
9412,
9601,
9723,
9945,
10151,
10536,
11062,
11513,
11626,
11862,
12112,
12476,
12539,
12882,
13092,
13305,
13649,
14052,
14174,
14295,
14680,
15206,
15271,
15486,
15876,
15941,
16115,
16460,
16818,
16956,
17047,
17296,
17622,
17911,
17968,
18170,
18370,
18456,
18559,
18645,
18850,
18991,
19179,
19366,
19378,
19401,
19402,
19549,
19550,
19578,
19579,
20127,
20128,
20879,
20880,
21566,
21567,
21982,
21983,
22695,
22696,
23282,
23283,
23834,
23835,
24520,
24521,
25842,
25843,
26494,
26495,
27339,
27340,
28220,
28221,
28726,
28727,
29104,
29105,
29856,
29857,
30645,
30646,
31157,
31158,
31183,
31184,
31288,
31289,
31375,
31376,
31494,
31495,
31633,
31634,
31783,
31784,
31925,
31926,
32135,
32136,
33015,
33016,
33370,
33371,
34010,
34011,
35219,
35220,
35703,
35704,
36476,
36477,
37041,
37042,
37076,
37077,
37201,
37202,
37303,
37304,
37456,
37457,
37583,
37584,
37782,
37783,
37871,
37872,
37974,
37975,
38080,
38081,
38184,
38185,
38290,
38291,
38397,
38398,
38503,
38504,
38616,
38617,
38758,
38759,
38913,
38914,
39094,
39095,
39313,
39314,
39525,
39526,
39682,
39683,
39834,
39835,
39900,
39901,
40489,
40490,
41790,
41791,
42630,
42631,
43128,
43129,
44918,
44919,
45523,
45524,
46479,
46480,
47436,
47437,
47992,
47993,
48015,
48016,
48736,
48737,
49586,
49587,
50200,
50201,
51242,
51243,
52238,
52239,
53180,
53181,
53756,
53757,
54318,
54319,
55205,
55206,
56095,
56096,
57010,
57011,
57701,
57702,
57740,
57741,
58260,
58261,
58888,
58889,
59411,
59412,
59818,
59819,
60456,
60457,
61669,
61670,
61976,
61977,
62385,
62386,
63093,
63094,
63110,
63111,
63760,
63761,
64612,
64613,
64726,
64727,
65340,
65341,
66363,
66364,
67064,
67065,
67919,
67920,
68495,
68496,
69421,
69422,
70959,
70960,
71871,
71872,
72452,
72453,
73540,
73541,
74052,
74053,
74399,
74400,
74410,
74411,
74972,
74973,
75344,
75345,
75983,
75984,
76800,
76801,
77123,
77124,
78676,
78677,
79420,
79421,
80154,
80155,
81069,
81070,
82584,
82585,
83424,
83425,
84314,
84315,
84803,
84804,
85821,
85822,
86295,
86296,
86615,
86616,
87393,
87394,
87920,
87921,
88252,
88253,
88727,
88728,
89174,
89175,
90029,
90030,
90885,
90886,
91379,
91380,
92441,
92442,
93232,
93233,
94893,
94894,
95612,
95613,
96379,
96380,
96807,
96808,
98079,
98080,
98862,
98863,
99437,
99438,
99887,
99888,
100701,
100702,
101456,
101457,
103555,
103556,
104987,
104988,
105975,
105976,
106627,
106628,
107956,
107957,
107993,
107994,
108941,
108942,
109368,
109369,
110038,
110039,
111133,
111134,
111694,
111695,
113240,
113241,
113491,
113492,
113509,
113563,
113741,
113940,
114116,
114294,
114489,
114692,
114848,
114972,
115106,
115292,
115323,
115344,
115354,
115542,
115766,
115876,
116028,
116140,
116314,
116486,
116670,
116788,
116989,
117141,
117286,
117437,
117587,
117770,
117887,
118063,
118287,
118474,
118612,
118762,
118879,
119023,
119158,
119270,
119406,
119420,
119475,
119561,
119684,
119922,
120090,
120325,
120490,
120677,
120912,
121014,
121161,
121377,
121520,
121613,
121777,
121884,
121984,
122138,
122267,
122387,
122494,
122624,
122733,
122874,
122996,
123101,
123214,
123326,
123427,
123606,
123701,
123876,
124021,
124129,
124243,
124359,
124523,
124640,
124741,
124842,
124935,
125028,
125141,
125237,
125323,
125431,
125519,
125695,
125807,
125823,
125872,
125910,
125947,
125981,
125994,
126019,
126047,
126070,
126098,
126121,
126146,
126209
],
"line_end_idx": [
56,
64,
205,
206,
214,
215,
243,
274,
296,
328,
357,
381,
407,
422,
528,
599,
660,
699,
750,
832,
846,
855,
1857,
1868,
1882,
1892,
1903,
1923,
1957,
1970,
1980,
2361,
2527,
2872,
3358,
3575,
3957,
4033,
4269,
4519,
4815,
4850,
5193,
5363,
5548,
5856,
6031,
6201,
6503,
6920,
7188,
7385,
7697,
7866,
8044,
8202,
8561,
8763,
8860,
8985,
9046,
9270,
9412,
9601,
9723,
9945,
10151,
10536,
11062,
11513,
11626,
11862,
12112,
12476,
12539,
12882,
13092,
13305,
13649,
14052,
14174,
14295,
14680,
15206,
15271,
15486,
15876,
15941,
16115,
16460,
16818,
16956,
17047,
17296,
17622,
17911,
17968,
18170,
18370,
18456,
18559,
18645,
18850,
18991,
19179,
19366,
19378,
19401,
19402,
19549,
19550,
19578,
19579,
20127,
20128,
20879,
20880,
21566,
21567,
21982,
21983,
22695,
22696,
23282,
23283,
23834,
23835,
24520,
24521,
25842,
25843,
26494,
26495,
27339,
27340,
28220,
28221,
28726,
28727,
29104,
29105,
29856,
29857,
30645,
30646,
31157,
31158,
31183,
31184,
31288,
31289,
31375,
31376,
31494,
31495,
31633,
31634,
31783,
31784,
31925,
31926,
32135,
32136,
33015,
33016,
33370,
33371,
34010,
34011,
35219,
35220,
35703,
35704,
36476,
36477,
37041,
37042,
37076,
37077,
37201,
37202,
37303,
37304,
37456,
37457,
37583,
37584,
37782,
37783,
37871,
37872,
37974,
37975,
38080,
38081,
38184,
38185,
38290,
38291,
38397,
38398,
38503,
38504,
38616,
38617,
38758,
38759,
38913,
38914,
39094,
39095,
39313,
39314,
39525,
39526,
39682,
39683,
39834,
39835,
39900,
39901,
40489,
40490,
41790,
41791,
42630,
42631,
43128,
43129,
44918,
44919,
45523,
45524,
46479,
46480,
47436,
47437,
47992,
47993,
48015,
48016,
48736,
48737,
49586,
49587,
50200,
50201,
51242,
51243,
52238,
52239,
53180,
53181,
53756,
53757,
54318,
54319,
55205,
55206,
56095,
56096,
57010,
57011,
57701,
57702,
57740,
57741,
58260,
58261,
58888,
58889,
59411,
59412,
59818,
59819,
60456,
60457,
61669,
61670,
61976,
61977,
62385,
62386,
63093,
63094,
63110,
63111,
63760,
63761,
64612,
64613,
64726,
64727,
65340,
65341,
66363,
66364,
67064,
67065,
67919,
67920,
68495,
68496,
69421,
69422,
70959,
70960,
71871,
71872,
72452,
72453,
73540,
73541,
74052,
74053,
74399,
74400,
74410,
74411,
74972,
74973,
75344,
75345,
75983,
75984,
76800,
76801,
77123,
77124,
78676,
78677,
79420,
79421,
80154,
80155,
81069,
81070,
82584,
82585,
83424,
83425,
84314,
84315,
84803,
84804,
85821,
85822,
86295,
86296,
86615,
86616,
87393,
87394,
87920,
87921,
88252,
88253,
88727,
88728,
89174,
89175,
90029,
90030,
90885,
90886,
91379,
91380,
92441,
92442,
93232,
93233,
94893,
94894,
95612,
95613,
96379,
96380,
96807,
96808,
98079,
98080,
98862,
98863,
99437,
99438,
99887,
99888,
100701,
100702,
101456,
101457,
103555,
103556,
104987,
104988,
105975,
105976,
106627,
106628,
107956,
107957,
107993,
107994,
108941,
108942,
109368,
109369,
110038,
110039,
111133,
111134,
111694,
111695,
113240,
113241,
113491,
113492,
113509,
113563,
113741,
113940,
114116,
114294,
114489,
114692,
114848,
114972,
115106,
115292,
115323,
115344,
115354,
115542,
115766,
115876,
116028,
116140,
116314,
116486,
116670,
116788,
116989,
117141,
117286,
117437,
117587,
117770,
117887,
118063,
118287,
118474,
118612,
118762,
118879,
119023,
119158,
119270,
119406,
119420,
119475,
119561,
119684,
119922,
120090,
120325,
120490,
120677,
120912,
121014,
121161,
121377,
121520,
121613,
121777,
121884,
121984,
122138,
122267,
122387,
122494,
122624,
122733,
122874,
122996,
123101,
123214,
123326,
123427,
123606,
123701,
123876,
124021,
124129,
124243,
124359,
124523,
124640,
124741,
124842,
124935,
125028,
125141,
125237,
125323,
125431,
125519,
125695,
125807,
125823,
125872,
125910,
125947,
125981,
125994,
126019,
126047,
126070,
126098,
126121,
126146,
126209,
126394
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 126394,
"ccnet_original_nlines": 521,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35143810510635376,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02663658931851387,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1595592349767685,
"rps_doc_frac_unique_words": 0.10502670705318451,
"rps_doc_mean_word_length": 5.164628505706787,
"rps_doc_num_sentences": 974,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.872737884521484,
"rps_doc_word_count": 20033,
"rps_doc_frac_chars_dupe_10grams": 0.19580912590026855,
"rps_doc_frac_chars_dupe_5grams": 0.3757188618183136,
"rps_doc_frac_chars_dupe_6grams": 0.2960575222969055,
"rps_doc_frac_chars_dupe_7grams": 0.25168418884277344,
"rps_doc_frac_chars_dupe_8grams": 0.22677671909332275,
"rps_doc_frac_chars_dupe_9grams": 0.209611177444458,
"rps_doc_frac_chars_top_2gram": 0.029807759448885918,
"rps_doc_frac_chars_top_3gram": 0.02222049981355667,
"rps_doc_frac_chars_top_4gram": 0.01229424960911274,
"rps_doc_books_importance": -10520.9228515625,
"rps_doc_books_importance_length_correction": -10520.9228515625,
"rps_doc_openwebtext_importance": -6615.18408203125,
"rps_doc_openwebtext_importance_length_correction": -6615.18408203125,
"rps_doc_wikipedia_importance": -4663.2431640625,
"rps_doc_wikipedia_importance_length_correction": -4663.2431640625
},
"fasttext": {
"dclm": 0.3745041489601135,
"english": 0.9097057580947876,
"fineweb_edu_approx": 2.5557479858398438,
"eai_general_math": 0.5330557227134705,
"eai_open_web_math": 0.09606379270553589,
"eai_web_code": 0.5368528366088867
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.62",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "11",
"label": "Legal/Regulatory"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "11",
"label": "Legal Notices"
}
},
"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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,867,812,781,888,707,000 | Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I really like functional programming concepts, but I've been bitten on two separate occasions now by the same gotcha, when mapping across a collection which happens to be a Set (i.e. automatically removes duplicates). The issue is that after transforming the elements of such a set, the output container is also a set, and so removes any duplicates of the tranformed output.
A very brief REPL session to illustrate the issue:
scala> case class Person(name: String, age: Int)
defined class Person
scala> val students = Set(Person("Alice", 18), Person("Bob", 18), Person("Charles", 19))
students: scala.collection.immutable.Set[Person] = Set(Person(Alice,18), Person(Bob,18), Person(Charles,19))
scala> val totalAge = (students map (_.age)).sum
totalAge: Int = 37
I would of course expect the total age to be 18 + 18 + 19 = 55, but because the students were stored in a Set, so were their ages after the mapping, hence one of the 18s disappeared before the ages were summed.
In real code this is often more insidious and harder to spot, especially if you write utility code which simply takes a Traversable and/or use the output of methods which are declared to return a Traversable (the implementation of which happens to be a Set). It seems to me that these situations are almost impossible to spot reliably, until/unless they manifest as a bug.
So, are there any best practices which will reduce my exposure to this issue? Am I wrong to think about map-ping over a general Traversable as conceptually transforming each element in place, as opposed to adding the transformed elements in turn into some new collection? Should I call .toStream on everything before mapping, if I want to keep this mental model?
Any tips/recommendations would be greatly appreciated.
Update: Most of the answers so far have focused on the mechanics of including the duplicates in the sum. I'm more interested in the practices involved when writing code in the general case - have you drilled yourself to always call toList on every collection before calling map? Do you fastidiously check the concrete classes of all the collections in your app before calling methods on them? Etc.
Fixing up something that's already been identified as a problem is trivial - the hard part is preventing these errors from creeping in in the first place.
share|improve this question
+1, nice example. Leaving as a Set will obviously bring surprising results, so you "must" do something, creating a new collection, or other means to ensure that what-you-see-is-what-you-will-get – virtualeyes Apr 3 '12 at 11:36
2
Exact duplicate of: stackoverflow.com/questions/7040806/…. Though the title is chosen better here. – ziggystar Apr 3 '12 at 12:18
Thanks for the pointer, @ziggy. I did try to search for existing questions first, but didn't come up with anything (it's difficult to arrive at a definitive description). – Andrzej Doyle Apr 3 '12 at 14:45
6 Answers 6
up vote 18 down vote accepted
You might wish to use the scalaz foldMap for this purpose, as it works on anything for which there is a Foldable typeclass available. The usage in your case will look like this:
persons foldMap (_.age)
The signature of foldMap is as follows:
trait MA[M[_], A] {
val value: M[A]
def foldMap[B](f: A => B)(implicit f: Foldable[M], m: Monoid[B])
}
So; as long as you have some collection CC[A] where CC can be folded over (i.e. traversed), a function from A => B where B is a monoid, you can accumulate a result.
share|improve this answer
I like this - Dave Griffith's answer was on the right tracks but is still quite specific. This covers every situation where a collection is mapped and then combined into a single result (via Monoid), which in practice is where I've seen this problem. – Andrzej Doyle Apr 3 '12 at 15:19
(0 /: students) { case (sum, s) => sum + s.age } – Viktor Klang Apr 3 '12 at 15:28
2
(0 /: students)(_ + _.age) is even shorter – oxbow_lakes Apr 3 '12 at 15:55
1
I think the issue with the standard fold is that it's less readable when used in place (e.g. as an argument to a method). It also requires a break in the flow of thinking (for me). that is, you think I want to perform an operations on my collection, so you want cc.op. I suppose cc.foldl(0)(_ + _.age) would do that – oxbow_lakes Apr 3 '12 at 15:57
3
Yup, you _ +_.age is shorter, but I think there's a balance to be had between terseness and readability. – Viktor Klang Apr 3 '12 at 16:28
As not to drag extra dependencies into the picture:
(0 /: students) { case (sum, s) => sum + s.age }
share|improve this answer
Are you suggesting not using .map() at all, in order to avoid my mistake? – Andrzej Doyle Apr 3 '12 at 15:45
Your example doesn't need map at all, using map also introduces the creating of an intermediate data structure, which in your example is unnecessary. So in this example you solve the problem by more carefully and efficiently expressing your intent. – Viktor Klang Apr 3 '12 at 15:52
That's a good point; most if not all of these problems arise when I immediately transform the mapped collection into something else (e.g. the .sum here). In which case the intermediate collection doesn't need to exist and so you might be right that avoiding .map altogether is a practical solution. – Andrzej Doyle Apr 3 '12 at 16:03
Odd that it works both with and without the case; I both a Function2 as well as PartialFunction are accepted. – Erik Allik Sep 18 '14 at 13:51
You can breakOut the collection type
scala> import collection.breakOut
import collection.breakOut
scala> val ages = students.map(_.age)(breakOut): List[Int]
ages: List[Int] = List(18, 18, 19)
Then you can sum as expected
Based on the update to the question, the best practice to prevent these types of errors is good unit test coverage with representative data, together with sensible API's coupled with knowledge of how the scala compiler maintains source types through map/for generators etc. If you're returning a Set of something you should make that obvious, as returning a Collection/Traversable is hiding a relevant implementation detail.
share|improve this answer
2
You can just say toList - I think the point is that the OP keeps forgetting about it – oxbow_lakes Apr 3 '12 at 15:00
You might like to use the toIterable or toList methods to convert the set to another datastructure first. http://www.scala-lang.org/api/current/scala/collection/immutable/Set.html
(Note that toIterable may return any Iterable, although the reference implementation will not, according to the linked documentation. @Debilski informs me in the comments that it nevertheless returns a Set.)
share|improve this answer
toIterable may still yield a Set. – Debilski Apr 3 '12 at 12:22
@Debilski The linked documentation suggests that the reference implementation will not do that. I will also slightly update the answer. – Marcin Apr 3 '12 at 12:25
1
(students.toIterable map (_.age)) == Set(18, 19) on Scala 2.9.1-1. Also, I don’t see where it says otherwise in the documentation. – Debilski Apr 3 '12 at 12:39
Why creating an intermediate collection? set.iterator is enough when used with sum. – sschaef Apr 3 '12 at 13:23
@Antoras the question asks about mapping. – Marcin Apr 3 '12 at 13:46
If you find yourself repeatedly hitting the same error, your first problem isn't the error, but rather that you're repeating yourself. map().sum is a common enough use case (particularly in data analysis contexts) to merit it's own method on Traversable. From my personal, never-go-anywhere-without-it Traversable pimp class.
implicit def traversable2RichTraversable[A](t: Traversable[A]) = new {
///many many methods deleted
def sumOf[C: Numeric](g: A => C): C = t.view.toList.map(g).sum
///many many more methods deleted
}
(That .view may not be necessary, but can't hurt.)
share|improve this answer
2
sumBy seems like a name that's more in line with the std lib. – ziggystar Apr 3 '12 at 13:10
1
+1, I would remove the .view unless there is actually an example where it helps. – huynhjl Apr 3 '12 at 13:46
2
could you share your personal, never-go-anywhere-without-it Traversable pimp class? – Adam Rabung Apr 3 '12 at 14:36
I use "sumBy" for my pimped traversable method that's equivalent (but more efficient than) traversable.toList.groupBy(f).mapValues(g).sum . This splits a traversable into buckets based on some function f, then sums some function g over the values in each bucket. Again, very common for data analysis (more so than sumOf, actually). – Dave Griffith Apr 3 '12 at 15:27
It will take some work to get that class into shape for public viewing (and get work permission to make it public), but I'll see what I can do. As an exercise, based on what you've seen so far, ponder what goodies it might contain (and then write a few of them yourself). – Dave Griffith Apr 3 '12 at 15:31
A clumsy but possibly faster way of transforming it (as compared to an explicit toList/toSeq) would be to use collection.breakOut (more information) with a type ascription
(students map (_.age))(collection.breakOut) : Seq[Int]
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/9992307/avoiding-accidental-removal-of-duplicates-when-mapping-a-set",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "120853",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AQTN2YKKDR3P7P6C6F5TRC4UFWKSVCYR",
"WARC-Concurrent-To": "<urn:uuid:4131808f-d76d-4b6a-9a2a-561b3f23d3fc>",
"WARC-Date": "2015-05-24T23:57:03Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:GBDAVBCIAKZDKALGX42RETK7BMVHXZWC",
"WARC-Record-ID": "<urn:uuid:b88db52c-6035-462f-82e3-625de63bb0e1>",
"WARC-Target-URI": "http://stackoverflow.com/questions/9992307/avoiding-accidental-removal-of-duplicates-when-mapping-a-set",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d0b87ba0-d864-4605-90d7-4468e2cd0373>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
157,
158,
533,
534,
585,
586,
635,
656,
657,
746,
855,
856,
905,
924,
925,
1136,
1137,
1510,
1511,
1874,
1875,
1930,
1931,
2329,
2330,
2485,
2486,
2514,
2519,
2748,
2752,
2883,
2888,
3095,
3096,
3108,
3109,
3139,
3140,
3318,
3319,
3343,
3344,
3384,
3385,
3405,
3423,
3424,
3491,
3493,
3494,
3659,
3660,
3686,
3691,
3978,
3983,
4067,
4071,
4148,
4152,
4502,
4506,
4646,
4647,
4699,
4700,
4749,
4775,
4780,
4890,
4895,
5179,
5184,
5519,
5524,
5668,
5669,
5706,
5707,
5741,
5768,
5769,
5828,
5863,
5864,
5893,
5894,
6319,
6320,
6346,
6350,
6469,
6470,
6650,
6651,
6859,
6860,
6886,
6891,
6956,
6961,
7126,
7130,
7292,
7297,
7411,
7416,
7487,
7488,
7814,
7815,
7888,
7917,
7918,
7985,
7986,
8020,
8021,
8023,
8024,
8075,
8076,
8102,
8106,
8200,
8204,
8315,
8319,
8437,
8442,
8810,
8815,
9123,
9124,
9296,
9297,
9352,
9378,
9379,
9391,
9392,
9394,
9402,
9403,
9481,
9482
],
"line_end_idx": [
25,
157,
158,
533,
534,
585,
586,
635,
656,
657,
746,
855,
856,
905,
924,
925,
1136,
1137,
1510,
1511,
1874,
1875,
1930,
1931,
2329,
2330,
2485,
2486,
2514,
2519,
2748,
2752,
2883,
2888,
3095,
3096,
3108,
3109,
3139,
3140,
3318,
3319,
3343,
3344,
3384,
3385,
3405,
3423,
3424,
3491,
3493,
3494,
3659,
3660,
3686,
3691,
3978,
3983,
4067,
4071,
4148,
4152,
4502,
4506,
4646,
4647,
4699,
4700,
4749,
4775,
4780,
4890,
4895,
5179,
5184,
5519,
5524,
5668,
5669,
5706,
5707,
5741,
5768,
5769,
5828,
5863,
5864,
5893,
5894,
6319,
6320,
6346,
6350,
6469,
6470,
6650,
6651,
6859,
6860,
6886,
6891,
6956,
6961,
7126,
7130,
7292,
7297,
7411,
7416,
7487,
7488,
7814,
7815,
7888,
7917,
7918,
7985,
7986,
8020,
8021,
8023,
8024,
8075,
8076,
8102,
8106,
8200,
8204,
8315,
8319,
8437,
8442,
8810,
8815,
9123,
9124,
9296,
9297,
9352,
9378,
9379,
9391,
9392,
9394,
9402,
9403,
9481,
9482,
9572
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9572,
"ccnet_original_nlines": 148,
"rps_doc_curly_bracket": 0.0008357699844054878,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3543488383293152,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023009659722447395,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2931431233882904,
"rps_doc_frac_unique_words": 0.394908607006073,
"rps_doc_mean_word_length": 4.756527423858643,
"rps_doc_num_sentences": 115,
"rps_doc_symbol_to_word_ratio": 0.000460190000012517,
"rps_doc_unigram_entropy": 5.723876953125,
"rps_doc_word_count": 1532,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08467133343219757,
"rps_doc_frac_chars_dupe_6grams": 0.05914643034338951,
"rps_doc_frac_chars_dupe_7grams": 0.03211198002099991,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012076299637556076,
"rps_doc_frac_chars_top_3gram": 0.018114449456334114,
"rps_doc_frac_chars_top_4gram": 0.024152599275112152,
"rps_doc_books_importance": -950.3975830078125,
"rps_doc_books_importance_length_correction": -950.3975830078125,
"rps_doc_openwebtext_importance": -550.9794311523438,
"rps_doc_openwebtext_importance_length_correction": -550.9794311523438,
"rps_doc_wikipedia_importance": -369.1957092285156,
"rps_doc_wikipedia_importance_length_correction": -369.1957092285156
},
"fasttext": {
"dclm": 0.23582333326339722,
"english": 0.9009357690811157,
"fineweb_edu_approx": 1.7416571378707886,
"eai_general_math": 0.4453360438346863,
"eai_open_web_math": 0.4214683175086975,
"eai_web_code": 0.0044152699410915375
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,701,042,852,989,288,000 | Questions? Call 888-404-2542
Your Dashboard Stack is Showing
Assembling an efficient, streamlined technology stack can be a challenge. With so many variables in both the number of solutions available and the vast needs of your organization, selecting the best option can quickly become overwhelming. Ideally, a single, end-to-end solution that encompasses all your needs and requirements would rise to the top of the options you evaluate. In many cases, however, there is no such choice.
Fortunately, when it comes to building your dashboard stack, choosing an end-to-end solution is possible. While there are certainly many solutions on the market that perform individual functions, there is indeed a single solution that performs all the necessary functions of a BI dashboard including data management, dashboard creation, collaboration and more. Let’s look at the key requirements of an all-inclusive BI dashboard solution.
Data Management
Effective data management is the core requirement that enables uniformity across all data sources. Because it is widely prevalent for organizations to work across multiple tools in multiple departments, a comprehensive dashboard stack should bring all sources into one application to create a master data warehouse. Look for a tool that includes ETL (Extract, Transfer, Load) vs. needing a separate tool to complete these functions.
Once data sources are connected, data transformation is key. Bringing everything into a single SQL database, instead of keeping raw data in different formats, enables consistent functionality across applications. For this reason, it is important to find a solution that unifies data tables across all platforms. Be sure that you can combine different sources to manipulate data and create specific calculations when needed.
There are times when you may need to merge two data sources into one. For example, a Google AdWords database may contain spending data but not full budget information. If you have your budget in Google Sheets, you will need to combine those two sources using a data merge so that you can analyze the combined data and get a complete picture of how your Google AdWords initiatives are tracking to budget.
Alternately, you may have occasions where you want to simplify your data. Using Google Analytics as an example, you may receive data that identifies sources from Google UK, Google US, etc. If that level of detail is excessive for specific audiences, you can cleanse the data to show all Google segments simply as Google for simplified reporting.
Dashboards
Dashboards and reports are arguably one of the most valuable aspects of BI. With a user-friendly BI tool, anyone can create a dashboard based on their specific needs without support from the IT team. This ability to create different dashboard variations needed for both business and technical users saves business professionals and IT teams significant time.
In the event multiple users could benefit from an existing dashboard, a replication function makes the process a snap. It provides the ability to replicate templates easily through master templates, greatly minimizing time and effort.
Accessibility is key for today’s mobile workforce. Users need access across devices, platforms and locations 24/7. Full functionality and real-time information that is automatically refreshed is mandatory so that users always have the latest data available right from the dashboard on their device.
Collaboration
The ability to share data and easily collaborate with colleagues based on a single source of truth eliminates conflict and delayed decision-making. It provides the flexibility to share dashboards and reports with other associates that have required credentials.
To ensure proper credentialing, data segregation enables you to set access parameters based on roles, departments, regions, etc. For example, if you have locations in different countries and want managers to have access to all countries but need to limit individual contributors’ access to only their specific country, data segregation is the answer. Another example might be separating access rights by individual franchise locations, etc.
It also enables users to access the same data in different ways based on their needs. For example, technical users will need to perform deep dives, while most executives will want a higher-level dashboard view. Look for a system that also enables automated report generation and distribution.
If you are looking for a dashboard solution that offers all necessary functionality in a single solution, look at ClicData BI tools. These comprehensive solutions were designed from the ground up based on ease-of-use, customer needs and use cases. | {
"url": "https://www.clicdata.com/blog/i-think-your-dashboard-stack-is-showing-what-your-dashboard-stack-should-really-encompass/",
"source_domain": "www.clicdata.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "92836",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4VDQUUMYCSX6UFMEJYG3V5VITNYBJHZA",
"WARC-Concurrent-To": "<urn:uuid:d22d63c8-1250-4f9e-84b9-176232ebbc75>",
"WARC-Date": "2018-04-25T02:57:04Z",
"WARC-IP-Address": "40.112.62.195",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X6JFZQLYCOOQXCCLL47JHOKSKVW4JO5B",
"WARC-Record-ID": "<urn:uuid:81cf0fd7-7458-43f4-9795-a6a118c25166>",
"WARC-Target-URI": "https://www.clicdata.com/blog/i-think-your-dashboard-stack-is-showing-what-your-dashboard-stack-should-really-encompass/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8da16e43-5427-43e4-b127-62b2f87ed630>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-197-161.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,
29,
30,
62,
63,
490,
491,
930,
931,
947,
948,
1381,
1382,
1806,
1807,
2211,
2212,
2558,
2559,
2570,
2571,
2930,
2931,
3166,
3167,
3466,
3467,
3481,
3482,
3744,
3745,
4186,
4187,
4480,
4481
],
"line_end_idx": [
29,
30,
62,
63,
490,
491,
930,
931,
947,
948,
1381,
1382,
1806,
1807,
2211,
2212,
2558,
2559,
2570,
2571,
2930,
2931,
3166,
3167,
3466,
3467,
3481,
3482,
3744,
3745,
4186,
4187,
4480,
4481,
4728
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4728,
"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.40334129333496094,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013126489706337452,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12410500645637512,
"rps_doc_frac_unique_words": 0.43983402848243713,
"rps_doc_mean_word_length": 5.384509086608887,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.244155406951904,
"rps_doc_word_count": 723,
"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.008990500122308731,
"rps_doc_frac_chars_top_3gram": 0.009247370064258575,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -332.5869140625,
"rps_doc_books_importance_length_correction": -332.5869140625,
"rps_doc_openwebtext_importance": -227.32501220703125,
"rps_doc_openwebtext_importance_length_correction": -227.32501220703125,
"rps_doc_wikipedia_importance": -184.1329345703125,
"rps_doc_wikipedia_importance_length_correction": -184.1329345703125
},
"fasttext": {
"dclm": 0.11290503293275833,
"english": 0.9262608289718628,
"fineweb_edu_approx": 1.7571523189544678,
"eai_general_math": 0.4162798523902893,
"eai_open_web_math": 0.10291147232055664,
"eai_web_code": 0.7520685791969299
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,576,063,064,222,699,500 | Difference between revisions of "JEG Reproducible Video Quality Analysis Framework"
From VQEG JEG Wiki
Jump to: navigation, search
Line 43: Line 43:
First of all, the source content should be placed in (DATA/SRC). The current scripts deal with three resolutions (960x544, 1280x720, and 1920x1080).
First of all, the source content should be placed in (DATA/SRC). The current scripts deal with three resolutions (960x544, 1280x720, and 1920x1080).
In the first module (Large-scale encoding environment), the file has to be run (SoftwareLibraries/ENC\_SRC/ENC\_lin.py) to generate and encode the whole coding conditions (ENC\_win.py is a Windows script). The `.265' and `.txt' output files will be placed in (DATA/ENC). The `.265' is the bitstream file and the `.txt' is the encoding information.
+
In the first module (Large-scale encoding environment), the file has to be run (SoftwareLibraries/ENC_SRC/ENC_lin.py) to generate and encode the whole coding conditions (ENC_win.py is a Windows script). The `.265' and `.txt' output files will be placed in (DATA/ENC). The `.265' is the bitstream file and the `.txt' is the encoding information.
===Step 2: Quality measure===
===Step 2: Quality measure===
The quality measure module calculates the objective quality measure by running `SoftwareLibraries/DEC.py'. The software will firstly decode the bitstream file (.265 file) and then uses the (SoftwareLibraries/VQMT\_Binaries/VQMT.exe) to calculate the PSNR, SSIM, and VIF quality measures and saves the output per frame and in average in separate files in the (DATA/QUAL) folder.
+
The quality measure module calculates the objective quality measure by running `SoftwareLibraries/DEC.py'. The software will firstly decode the bitstream file (.265 file) and then uses the (SoftwareLibraries/VQMT_Binaries/VQMT.exe) to calculate the PSNR, SSIM, and VIF quality measures and saves the output per frame and in average in separate files in the (DATA/QUAL) folder.
The final step in this module is to run `SoftwareLibraries/AggregatePSNRtoCSV.py' to aggregate all the quality measures in two files; one keeps sequence-level records, see part and the second keeps the sequence and the frame levels records.
The final step in this module is to run `SoftwareLibraries/AggregatePSNRtoCSV.py' to aggregate all the quality measures in two files; one keeps sequence-level records, see part and the second keeps the sequence and the frame levels records.
Revision as of 09:05, 2 June 2017
Contents
Main idea
The work on this page presents a framework to facilitate reproducibility of research in video quality evaluation. Its initial version is built around the JEG-Hybrid database of HEVC coded video sequences. The framework is modular, organized in the form of pipelined activities, which range from the tools needed to generate the whole database from reference signals up to the analysis of the video quality measures already present in the database. Researchers can rerun, modify and extend any module, starting from any point in the pipeline, while always achieving perfect reproducibility of the results. The modularity of the structure allows to work on subsets of the database since for some analysis this might be too computationally intensive. To this purpose, the framework also includes a software module to compute interesting subsets, in terms of coding conditions, of the whole database.
Software Architecture
The software consists of a pipeline architecture where each active component communicates to the other component using directories. Each individual component will be explained next.
SoftwareArchitectureReproducibleFramework.png
Large scale encoding environment
The large scale encoding environment performs the Hypothetical Reference Circuit (HRC) processing. At this moment, this module consists of the HEVC standardization reference encoding package (http://hevc.kw.bbc.co.uk/svn/jctvc-a124/tags/HM-11.1/) accompanied by a valuable set of configuration files and scripts in order to reproduce or extend the first version of the HEVC large scale database. Whenever the proposed video quality analysis framework needs improvement with more compression standards, other compression parameters, or network impairment simulations, then solely this block must be extended upon.
The correct creation or download of the large-scale database can be verified by SHA512 checksums available at: (ftp://ivc.univ-nantes.fr/VQEG/JEG/HYBRID/hevc_database/sha512_hashas_for_hevc_database_enc.txt.bz2).
Subset selection
This process facilitates the research work if a proper HRCs are selected to represent a large-scale database. Therefore, this component consists of two algorithms for subset selection. The first one is optimized to cover different ranges of quality and bitrate. The second algorithm is optimized for HRCs that behave differently with different source contents. The two algorithms are demonstrated in the accompanying DSP paper.
Quality measure
The quality measurement component consists of a collection of full reference quality measurements like Peak Signal-to-Noise Ratio (PSNR), Structural Similarity (SSIM), Multi-Scale Structural Similarity (MS-SSIM), and Visual Information Fidelity (VIFp). These measurements are integrated in this Reproducible Video Quality Analysis software package using the Video Quality Measurement Tool (VQMT) from Ecole Polytechnique Fédérale de Lausanne (EPFL).
Quality measure analysis
The quality measure analysis focuses on extracting the relevant data from the full reference quality measurement database and process them in order to perform the analysis. In this particular work we extracted frame-level MSE and PSNR values to compare the effect of temporal pooling through averaging either MSE or PSNR. Moreover, the variance of the frame-level PSNR is also computed and made available for the next visualization block. The module can be easily customized to handle different measures either present in the database or made available through files in the same format. Moreover, other indicators (e.g., moving averages etc., can be included in the output for the visualization block.
Visualization
The visualization block is currently a set of gnuplot command files that can be used to easily visualize the data produced in the previous step. In particular, they can automatically generate scatter plots and, with the aid of some custom-developed external modules, interpolation parameters for better visualization.
Running the software
The package contains scripts that are written in different language environments but can be executed under Linux and Windows platforms.
The software package contains 2 directories `DATA' and `SoftwareLibraries'. `DATA' directory contains sub directories that contains the source data and the outputs of running the softwares that can be found in `SoftwareLibraries'.
Step 1: Large Scale Encoding Environment
First of all, the source content should be placed in (DATA/SRC). The current scripts deal with three resolutions (960x544, 1280x720, and 1920x1080).
In the first module (Large-scale encoding environment), the file has to be run (SoftwareLibraries/ENC_SRC/ENC_lin.py) to generate and encode the whole coding conditions (ENC_win.py is a Windows script). The `.265' and `.txt' output files will be placed in (DATA/ENC). The `.265' is the bitstream file and the `.txt' is the encoding information.
Step 2: Quality measure
The quality measure module calculates the objective quality measure by running `SoftwareLibraries/DEC.py'. The software will firstly decode the bitstream file (.265 file) and then uses the (SoftwareLibraries/VQMT_Binaries/VQMT.exe) to calculate the PSNR, SSIM, and VIF quality measures and saves the output per frame and in average in separate files in the (DATA/QUAL) folder.
The final step in this module is to run `SoftwareLibraries/AggregatePSNRtoCSV.py' to aggregate all the quality measures in two files; one keeps sequence-level records, see part and the second keeps the sequence and the frame levels records.
Subset selection
Quality measure analysis | {
"url": "http://vqegjeg.intec.ugent.be/wiki/index.php?title=JEG_Reproducible_Video_Quality_Analysis_Framework&diff=prev&oldid=327",
"source_domain": "vqegjeg.intec.ugent.be",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "30649",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NJDTQO7JKXRPZY3FKDQH2RRPCZAFTS37",
"WARC-Concurrent-To": "<urn:uuid:73652684-7116-4c81-ae9e-1b471a7cf1c8>",
"WARC-Date": "2022-12-09T06:37:05Z",
"WARC-IP-Address": "157.193.215.79",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6TYCDZMLKL2QCN4ZJQG5I2N6WULKECWM",
"WARC-Record-ID": "<urn:uuid:8692e942-a878-45c7-acab-5e758be78f53>",
"WARC-Target-URI": "http://vqegjeg.intec.ugent.be/wiki/index.php?title=JEG_Reproducible_Video_Quality_Analysis_Framework&diff=prev&oldid=327",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bc3cd27c-8fee-425d-bddc-ab71b522edde>"
},
"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-71\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,
84,
85,
104,
132,
150,
152,
303,
305,
456,
459,
807,
809,
1154,
1157,
1159,
1189,
1191,
1221,
1601,
1603,
1982,
1985,
1987,
2230,
2232,
2475,
2476,
2510,
2511,
2520,
2521,
2531,
2532,
3429,
3430,
3452,
3453,
3635,
3636,
3682,
3683,
3716,
3717,
4330,
4331,
4544,
4545,
4562,
4563,
4991,
4992,
5008,
5009,
5459,
5460,
5485,
5486,
6188,
6189,
6203,
6204,
6522,
6523,
6524,
6545,
6546,
6682,
6683,
6914,
6915,
6916,
6957,
6958,
7107,
7108,
7453,
7454,
7478,
7479,
7856,
7857,
8098,
8099,
8116,
8117
],
"line_end_idx": [
84,
85,
104,
132,
150,
152,
303,
305,
456,
459,
807,
809,
1154,
1157,
1159,
1189,
1191,
1221,
1601,
1603,
1982,
1985,
1987,
2230,
2232,
2475,
2476,
2510,
2511,
2520,
2521,
2531,
2532,
3429,
3430,
3452,
3453,
3635,
3636,
3682,
3683,
3716,
3717,
4330,
4331,
4544,
4545,
4562,
4563,
4991,
4992,
5008,
5009,
5459,
5460,
5485,
5486,
6188,
6189,
6203,
6204,
6522,
6523,
6524,
6545,
6546,
6682,
6683,
6914,
6915,
6916,
6957,
6958,
7107,
7108,
7453,
7454,
7478,
7479,
7856,
7857,
8098,
8099,
8116,
8117,
8141
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8141,
"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.30588236451148987,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.043790850788354874,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20849673449993134,
"rps_doc_frac_unique_words": 0.3065502345561981,
"rps_doc_mean_word_length": 5.730131149291992,
"rps_doc_num_sentences": 97,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.050741672515869,
"rps_doc_word_count": 1145,
"rps_doc_frac_chars_dupe_10grams": 0.41106539964675903,
"rps_doc_frac_chars_dupe_5grams": 0.41106539964675903,
"rps_doc_frac_chars_dupe_6grams": 0.41106539964675903,
"rps_doc_frac_chars_dupe_7grams": 0.41106539964675903,
"rps_doc_frac_chars_dupe_8grams": 0.41106539964675903,
"rps_doc_frac_chars_dupe_9grams": 0.41106539964675903,
"rps_doc_frac_chars_top_2gram": 0.010669110342860222,
"rps_doc_frac_chars_top_3gram": 0.009144949726760387,
"rps_doc_frac_chars_top_4gram": 0.005944219883531332,
"rps_doc_books_importance": -789.7518920898438,
"rps_doc_books_importance_length_correction": -789.7518920898438,
"rps_doc_openwebtext_importance": -443.3153991699219,
"rps_doc_openwebtext_importance_length_correction": -443.3153991699219,
"rps_doc_wikipedia_importance": -393.2684020996094,
"rps_doc_wikipedia_importance_length_correction": -393.2684020996094
},
"fasttext": {
"dclm": 0.01876246929168701,
"english": 0.8535337448120117,
"fineweb_edu_approx": 2.78031325340271,
"eai_general_math": 0.9029557704925537,
"eai_open_web_math": 0.4074633717536926,
"eai_web_code": 0.11163687705993652
}
} | {
"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": "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": "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": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,882,205,301,939,922,000 | • frank
1.8k
Is infinity properly thought of as a number? Is it a quantity? Is that the same question?
• fdrake
1.5k
There are a few different conceptions of infinity in mathematics.
There's what the usual infinity symbol represents: , which usually denotes a limiting process: , IE what value tends to when becomes arbitrarily large. Formally this corresponds to a definition of a limit and can be considered shorthand for it.
Then you've got cardinal numbers, which count how many of something there are. The smallest infinite cardinal is called , which is the size of the set of natural numbers . Then there are ordinal numbers, which agree with cardinal numbers up to and can disagree beyond that - they correspond to different ways of ordering infinite sets of things. For example, the standard ordering of is given the symbol , which denotes its order type. If you removed 42 from and stuck it on the end (after the infinity of numbers), you'd have the same set of elements but it would look like , and this is given the order type . You can separate out the odds and evens similarly and end up with . This operations allow you to define standard arithmetic operations on infinities relating to orders, and similarly for cardinals.
In the first case, infinity is a shorthand for a limiting process (the infinity is hidden in the quantifier 'for all epsilon'), in the second case infinite objects are referred to explicitly.
• frank
1.8k
in the second case infinite objects are referred to explicitly.fdrake
Does that mean that in the second case "infinite" is being used as a quantity?
• fdrake
1.5k
In the first case it's easier to think of as a direction. In the second case - for cardinals - they give the size of infinite sets, so yes they are probably quantities since they represent the magnitude of something.
• Gustavo Fontinelli
3
Following the "default definition", quantity stands for the magnitude of countable and reducible things. I mean, in a geometric view, would be like distance, the space between the initial and the final point. When you're counting something, you're presuming that there's a limit and when you reach the limit you'll be known the quantity.
Also, a x quantity of filler stuff fill in a x quantity of fillable things.
For example, two shoes fits in a box, if you increase the quantity of shoes to 3 shoes, it won't fit any more because it crosses the limit, it can also happen in the negative way. The thing is that with you have an infinitely large box, with an infinite amount of shoes in, no matter how many shoes you take off from the box, it won't change nothing. So talking about quantity doesn't make sense any more.
• alan1000
27
"Limiting processes" tend to have a somewhat uneasy relationship with the axioms of Set Theory and Peano Arithmetic which underlie damn near everything about number theory. If you are talking about aleph-null infinities then, of course, every aleph-null infinity has a precise numeric value (though this value is impossible to identify).
• fdrake
1.5k
Is this a criticism of the epsilon-delta and epsilon-N convergence/continuity criteria?
• alan1000
27
Not at all; I am trying to tread a delicate line between "mathematics" and "mathematical philosophy". Most non-mathematicians, and even many mathematicians, conceive of mathematics as the quintessential, monolithic embodiment of perfect rationalism, the ultimate logical system; and of course, it isn't. There are many logical grey areas, even at basic levels. For example, is 0.9... equal to 1? Or is it the largest real number which is less than 1? There are persuasive mathematical arguments on both sides.
"The wise man doubts often, and his views are changeable; the fool is constant in his opinions, and doubts nothing, because he knows everything, except his own ignorance" (Pharaoh Akhenaton).
• fdrake
1.5k
Ok. Well epsilon-N implies 0.9 recurring = 1 anyway. AFAIK it's even true in non-standard analysis. 1 - infinitesimal isn't the same thing as 0.9 recurring.
• AngleWyrm
66
No, infinity is not a quantity it is a direction on any scale in which it is listed as a measurement.
East is not a location, destination, or even an obtainable goal. It is a direction relative to the current position and might more properly be stated as "east of here," wherever here may be, in the same sense that x + 1 is not an absolute quantity but instead something greater than x.
• Count Radetzky von Radetz
28
From a Hegelian perspective, I would rationally perceive infinity not as a quantity.
• Mr Phil O'Sophy
966
1. A quantity is a specified amount of something. It has a limit. The infinite is that which has no limits and so cannot be quantified. Therefore, not a quantity as not quantifiable.
2. Infinity is not limited to numbers (because it has no limit). if you say infinity is only a number you have broken the law of none contradiction as you have put a limit on something defined as having no limits. Therefore, infinity contains numbers but numbers do not contain infinity as numbers are limited to number.
• MindForged
563
1. A quantity is a specified amount of something. It has a limit. The infinite is that which has no limits and so cannot be quantified. Therefore, not a quantity as not quantifiable.
This is just... no. Look, even if I take your definition of quantity, I can easily show infinity is a quantity. Take the set of Natural Numbers (o, 1, 2, 3...). In set theory, the concept of "size" is formalized as what is known as "cardinality". The cardinality (size) of the set of Natural Numbers is infinity, specifically aleph-null. QED. You can say the Natural Numbers have "no limit" in the sense that it can always get bigger, but that doesn't mean it's impossible to quantify.
2. Infinity is not limited to numbers (because it has no limit). if you say infinity is only a number you have broken the law of none contradiction as you have put a limit on something defined as having no limits. Therefore, infinity contains numbers but numbers do not contain infinity as numbers are limited to number.
A better way to think about it is there are different kinds of infinite numbers, some larger or smaller than others. The set of Real numbers, for instance, is a larger infinity than the infinity of the Natural numbers. Cantor proved this with a proof by contradiction. No one is contradicting themselves saying there are infinite quantities.
• Mr Phil O'Sophy
966
This is just... no. Look, even if I take your definition of quantity, I can easily show infinity is a quantity. Take the set of Natural Numbers (o, 1, 2, 3...). In set theory, the concept of "size" is formalized as what is known as "cardinality". The cardinality (size) of the set of Natural Numbers is infinity, specifically aleph-null. QED. You can say the Natural Numbers have "no limit" in the sense that it can always get bigger, but that doesn't mean it's impossible to quantify.MindForged
The thing you missed here is the unspoken inference you make. The cardinality of the set of Natural Numbers is not infinity (which is defined as having no limits) as by referring to Natural Numbers you are limiting it to Natural Numbers alone. You are not including anything which is not a Natural Number, it does not include different colours, shapes, texture etc. It is a concept limited to that which is considered a natural number.
You can say that the numbers have no end.. or could go on forever.. or go on indefinitely.. but you cannot refer to them as infinite as you contradict yourself by describing them as such. As they are limited... to Natural Numbers. I am aware that mathematicians are fond of using the word infinite, but I would argue that its an illogical thing to do. As I think I have sufficiently shown.
A better way to think about it is there are different kinds of infinite numbers, some larger or smaller than othersMindForged
No because then you're not talking about the infinite any more.
Consider the following:
1. There are two infinite numbers, A and B
2. A is not B, and B is not A.
3. A is larger than B.
this isn't a description of something without limits. You are specifically saying that A is limited to A and does not include B. And that B is limited to B and does not include A. These are limits.
You can say it has no limits in one specific sense but has limits in others, but then you are not referring to the infinite or to a limitless thing anymore.
No one is contradicting themselves saying there are infinite quantities.MindForged
You are if you are saying this thing has no limits when it defined within the specific limits of Real or Natural numbers as in the examples you gave. You are therefore saying that this thing is both limited and not limited simultaneously. Which is a contradiction. It cannot be A and ~A.
• GreenPhilosophy
11
You can add 1 to any real number, so infinity isn't a real number. Infinity is a concept.
• jorndoe
625
Colloquially, infinite is a quantity that's not a number, .
But it's ambiguous (hence the ).
As it turns out there's more than one infinite, there are infinitely many different infinites, no less (Cantor).
Anyway, Dedekind and Tarski came up with different (general) definitions that can be shown equivalent.
• fishfry
469
You can separate out the odds and evens similarly and end up with ω+ω = 2ω.fdrake
Very nice post.
A quibble. I just happen to be brushing up on ordinal arithmetic this week. Ordinal multiplication is defined backwards from our intuition in my opinion. is defined to be copies of concatenated.
So for example means copies of 2 strung together. The ordinal 2 represents the order 0, 1. If you line up of those, you get ... drum roll ... .
On the other hand, is two copies of side-by-side. You can visualize this as 0, 2, 4,6 , 8,...,1, 3, 5, 7, ... the evens-before-odds order. That's .
Other than that quibble, great post.
https://en.wikipedia.org/wiki/Ordinal_arithmetic#Multiplication
• tom
1.5k
You can add 1 to any real number, so infinity isn't a real number. Infinity is a concept.GreenPhilosophy
Nothing to prevent you from adding 1 to infinity.
• Mr Phil O'Sophy
966
Nothing to prevent you from adding 1 to infinity.tom
Yes there is. If it is Infinity then it should already contain the 1 you’re attempting to add to it. If it doesn’t contain that 1 being added then it’s not infinity, as it is limited to not containing the 1 you are adding. This means what you are calling ‘infinity’ is not limitless at all and so not worthy of the title.
• tom
1.5k
Yes there is. If it is Infinity then it should already contain the 1 you’re attempting to add to it. If it doesn’t contain that 1 being added then it’s not infinity, as it is limited to not containing the 1 you are adding. This means what you are calling ‘infinity’ is not limitless at all and so not worthy of the title.Mr Phil O'Sophy
Seriously, you can even add infinity to infinity. Plenty of cases where that happens in mathematics.
• Mr Phil O'Sophy
966
Seriously, you can even add infinity to infinity. Plenty of cases where that happens in mathematics.tom
I understand that mathematics uses the concept of multiple infinities. I’ve been exposed to the idea before.
I’m saying that I fundementally disagree with it. What ever they are adding is more worthy of the title ‘indefinite’ than infinity.
As I said before. If you try to have more than one infinity then you create a problem.
Infinity is boundless, without limit, Etc.
If you have two infinity’s, A & B, then you are saying that in order to add infinity A to infinity B that A does not contain B. Which is to say that both A and B are limited or bounded to A and only A or B and only B.
This making two infinity’s then leads to the logical conclusion that it is an indefinite number; an undisclosed amount that is limited to not containing that which you wish to add to it; not an infinite quantity as the mathematitions like to insist.
• tom
1.5k
I understand that mathematics uses the concept of multiple infinities. I’ve been exposed to the idea before.Mr Phil O'Sophy
Do you understand though?
I’m saying that I fundementally disagree with it. What ever they are adding is more worthy of the title ‘indefinite’ than infinity.Mr Phil O'Sophy
So, we have established that you DON'T understand it.
As I said before. If you try to have more than one infinity then you create a problem.Mr Phil O'Sophy
Repeating an error ad infinitum does not correct it.
Infinity is boundless, without limit, Etc.Mr Phil O'Sophy
And some of those are bigger, infinitely bigger, than the others.
If you have two infinity’s, A & B, then you are saying that in order to add infinity A to infinity B that A does not contain B. Which is to say that both A and B are limited or bounded to A and only A or B and only BMr Phil O'Sophy
You have never studied mathematics.
This making two infinity’s then leads to the logical conclusion that it is an indefinite number; an undisclosed amount that is limited to not containing that which you wish to add to it; not an infinite quantity as the mathematitions like to insist.Mr Phil O'Sophy
Indefinite in number, you say.
• Mr Phil O'Sophy
966
You haven’t actually confronted my rebuttal, only used an appeal to authority fallacy a kin to ‘the mathematitions disagree with you so you’re wrong’.
So it would appear that I understand the problem more than you do, unless of course you can demonstrate why i’m wrong, which so far you haven’t.
Simply agreeing with authority without actually confronting the argument being made against it ad infinitum is not itself an argument.
You have never studied mathematicstom
Yes I have.
Indefinite in number, you say.tom
Yes, that’s something that algebra can also deal with. Unspecified (or indefinite) quantities such as x + y = z
Please feel free to actually deal with the argument. I’m genuinely interested to hear a counter argument, which you have failed to offer so far.
:p
• tom
1.5k
You haven’t actually confronted my rebuttal, only used an appeal to authority fallacy a kin to ‘the mathematitions disagree with you so you’re wrong’.Mr Phil O'Sophy
You have no rebuttal short of "I don't understand this".
So it would appear that I understand the problem more than you do, unless of course you can demonstrate why i’m wrong, which so far you haven’t.Mr Phil O'Sophy
So it's you versus Cantor?
Simply agreeing with authority without actually confronting the argument being made against it ad infinitum is not itself an argument.Mr Phil O'Sophy
Demonstrating your lack of comprehension does not constitute an argument.
Yes I have.Mr Phil O'Sophy
Primary school doesn't count.
Please feel free to actually deal with the argument. I’m genuinely interested to hear a counter argument, which you have failed to offer so far.Mr Phil O'Sophy
You don't have an argument.
• Mr Phil O'Sophy
966
My education isn’t limited to primary school .
And you still haven’t explained what i’m not comprehending.
If you don’t want to do any philosophy and just commit to the appeal to authority fallacy while repeating the whole ‘nah nah you’re wrong’ thing that’s fine. I won’t waste my time with you ;) Enjoy your day.
• GreenPhilosophy
11
Infinity isn't a real number, but it is an extended real number. Infinity can be used to describe infinite things, such as an infinitely sized universe.
By the way, I'm pretty bad at math, so don't take my word for it. I should just stop before I spread false information.
• MindForged
563
The thing you missed here is the unspoken inference you make. The cardinality of the set of Natural Numbers is not infinity (which is defined as having no limits) as by referring to Natural Numbers you are limiting it to Natural Numbers alone. You are not including anything which is not a Natural Number, it does not include different colours, shapes, texture etc. It is a concept limited to that which is considered a natural number.
How was it unspoken if I literally said the assumption (the the natural numbers are infinite)? That aside, you aren't making sense. That the natural numbers do no, for instance, include the Real Numbers does not entail that the set of Natural Numbers is not infinity. In mathematics, infinity is not (as you claimed) defined as "having no limits". In this case that's especially obvious, because by "limit" you're already sneaking in the assumption of finitude (e.g. the natural numbers are finite, somehow, because the set doesn't include other types of numbers). This argument makes no sense.
You can say that the numbers have no end.. or could go on forever.. or go on indefinitely.. but you cannot refer to them as infinite as you contradict yourself by describing them as such. As they are limited... to Natural Numbers. I am aware that mathematicians are fond of using the word infinite, but I would argue that its an illogical thing to do. As I think I have sufficiently shown.
No because then you're not talking about the infinite any more.
Consider the following:
1. There are two infinite numbers, A and B
2. A is not B, and B is not A.
3. A is larger than B.
this isn't a description of something without limits. You are specifically saying that A is limited to A and does not include B. And that B is limited to B and does not include A. These are limits.
You can say it has no limits in one specific sense but has limits in others, but then you are not referring to the infinite or to a limitless thing anymore.
You are simply ignoring the definition of infinity that mathematicians use and thereby conclude that it's incoherent because of we assumed your definition we'd get a contradiction. QED, your definition is wrong because it leads to a contradiction. That's ridiculous.
Your argument makes an obvious assumption, namely that all infinite sets are of the same size That's quite literally rejected in mathematics. Infinite sets which are countable, like the natural numbers, have the ability to be put into a one-to-one correspondence with a proper subset of themselves, e.g. we can map all the even numbers onto the set of natural numbers. Uncountably infinite sets (e.g. the reals) cannot do this mapping with the natural numbers, entailing that such sets are larger. Your definition leaves no real ability to use infinity in mathematically useful ways, e.g. Calculus.
You are if you are saying this thing has no limits when it defined within the specific limits of Real or Natural numbers as in the examples you gave. You are therefore saying that this thing is both limited and not limited simultaneously. Which is a contradiction. It cannot be A and ~A.
Incorrect. The natural numbers are the counting numbers, so they do no include the reals. That does not entail the Natural Numbers have a finite *cardinality*, it simply means the set of natural numbers leaves out particular types of numbers. This simply means the set of natural numbers has a particular size of infinity.
• Relativist
491
It comes down to semantics. Infinity can be considered a quantity in terms of transfinite math - so there are actually many "infinities" (aleph-0 is less than aleph-1; there are "more" real numbers than integers). But it's not a quantity in a sense that it corresponds to anything that exists in the material world.
• MindForged
563
I would say that space and time exist, and both are generally thought to be infinite.
• Relativist
491
The existence of an actual infinity (vs a potential infinity) is controversial among philosophers. I'm of the opinion an actual infinity cannot exist. I feel strongest about the impossibility of an infinite past, because that would entail a completed infinity: how could infinitely many days have passed?
Physicists accept the possibility of infinity in space and time simply because there is no known law of nature that rules it out. That doesn't imply the philosophical analysis is wrong, it just means that we don't know of any particular limits.
My opinions are consistent with the dominant opinion among philosophers prior to Cantor's set theory, but that doesn't seem like a very good reason to believe an actual infinity exists in the world.
• MindForged
563
A lot of this, in my estimation, doesn't make sense under scrutiny.
I'm of the opinion an actual infinity cannot exist. I feel strongest about the impossibility of an infinite past, because that would entail a completed infinity: how could infinitely many days have passed?
Um, before every day there is another day. QED. Or to put it more directly, the cardinality of the set of days prior to day "n" can be put into a one-to-one correspondence with the members of the set of natural numbers. Ergo, the number of past days are infinite. I don't know if this is actually true, but there is no logical argument against the *possibility* of it.
However, this wasn't even really what I was suggesting. Between any two moments of time there's another moment. That's what I had in mind. And it's even clearer with the divisibility of space. It's nearly always taken to be a continuum, meaning it would be infinitely divisible.
That doesn't imply the philosophical analysis is wrong, it just means that we don't know of any particular limits
What philosophical analysis? If we are adopting perfectly standard mathematics (or even most non-standard math systems) there is no contradiction whatsoever in supposing the past days are infinite. This will play into a bigger point I make at the end.
My opinions are consistent with the dominant opinion among philosophers prior to Cantor's set theory, but that doesn't seem like a very good reason to believe an actual infinity exists in the world.
I hope it doesn't come across rude, but that just reads as "If you ignore the last 150 years of mathematics most philosophers would agree with me". Well that's... a defense anyone can make to defend their belief in whatever.
Look, my broader issue/point is this. The interplay between our beliefs about the world and the formal tools (maths, logics) is more complex than often made out (i.e. the influence goes both ways). However, generally the idea is that our physics needs math to guide it's conjectures, and our beliefs about the world ought to be in line with the dominant physical theories. If maths has explicated infinity as a coherent, precise concept - and it has - then presumably it becomes irrational to say (as I understand you to be saying) that "Yea yea, there's infinity in mathematics and in physics, but if you try to apply it to real things it entails a contradiction." I just don't get it.
Infinity is not a contradictory concept, so how is it supposed to produce a contradiction if applied to real things? Or is it supposed to be a category mistake? But how does that work? We talk about infinite collections in mathematics all the time, it's central to set theory. That doesn't mean infinite collections (or other infinite whatevers) can exist in our universe, just that you cannot rule them out as incoherent and thus fail to obtain in every possible universe.
bold
italic
underline
strike
code
quote
ulist
image
url
mention
reveal
youtube
tweet
Add a Comment
Welcome to The Philosophy Forum!
Get involved in philosophical discussions about knowledge, truth, language, consciousness, science, politics, religion, logic and mathematics, art, history, and lots more. No ads, no clutter, and very little agreement — just fascinating conversations. | {
"url": "https://thephilosophyforum.com/discussion/3059/is-infinity-a-quantity/p1",
"source_domain": "thephilosophyforum.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "94269",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7PONTSRCYP6XYWVW36NMFUAYFCPECDYQ",
"WARC-Concurrent-To": "<urn:uuid:0a282648-ee50-4429-943c-b20cce6f041e>",
"WARC-Date": "2018-12-18T17:14:38Z",
"WARC-IP-Address": "104.27.174.93",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:S7RC37Q5S2PRUZZPWVVTSBJ5TFBP4JCN",
"WARC-Record-ID": "<urn:uuid:a407f811-df21-4c01-9266-f9e0633b1a0c>",
"WARC-Target-URI": "https://thephilosophyforum.com/discussion/3059/is-infinity-a-quantity/p1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f9b59006-56a2-47df-b184-aa823dcba819>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-51-223-157.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,
10,
19,
113,
124,
133,
203,
204,
453,
454,
1268,
1269,
1465,
1475,
1484,
1558,
1559,
1642,
1653,
1662,
1663,
1664,
1885,
1908,
1914,
2256,
2257,
2337,
2747,
2760,
2767,
3109,
3120,
3129,
3130,
3131,
3223,
3236,
3243,
3757,
3758,
3954,
3965,
3974,
3975,
3976,
4137,
4151,
4158,
4264,
4265,
4555,
4585,
4592,
4681,
4701,
4709,
4896,
4897,
5222,
5237,
5245,
5432,
5433,
5923,
5924,
6249,
6250,
6596,
6616,
6624,
7124,
7125,
7565,
7566,
7960,
7961,
8091,
8092,
8160,
8161,
8189,
8190,
8237,
8272,
8299,
8300,
8502,
8503,
8664,
8665,
8752,
8753,
9045,
9065,
9072,
9166,
9178,
9186,
9250,
9287,
9404,
9511,
9523,
9531,
9617,
9618,
9638,
9639,
9838,
9839,
9987,
9988,
10140,
10141,
10182,
10183,
10251,
10259,
10268,
10377,
10378,
10432,
10452,
10460,
10517,
10518,
10844,
10852,
10861,
11202,
11203,
11308,
11328,
11336,
11444,
11445,
11558,
11559,
11695,
11696,
11787,
11788,
11835,
11836,
12058,
12059,
12313,
12321,
12330,
12458,
12459,
12489,
12490,
12641,
12642,
12700,
12701,
12807,
12808,
12865,
12866,
12928,
12929,
12999,
13000,
13236,
13237,
13277,
13278,
13547,
13548,
13583,
13603,
13611,
13612,
13613,
13768,
13769,
13918,
13919,
14058,
14059,
14101,
14102,
14118,
14119,
14157,
14158,
14274,
14275,
14424,
14425,
14432,
14440,
14449,
14619,
14620,
14681,
14682,
14846,
14847,
14878,
14879,
15033,
15034,
15112,
15113,
15144,
15145,
15179,
15180,
15344,
15345,
15377,
15397,
15405,
15406,
15407,
15458,
15459,
15523,
15524,
15736,
15756,
15763,
15920,
15921,
16045,
16060,
16068,
16508,
16509,
17108,
17109,
17503,
17571,
17572,
17600,
17601,
17648,
17683,
17710,
17711,
17913,
17914,
18075,
18076,
18347,
18348,
18951,
18952,
19244,
19245,
19572,
19587,
19595,
19915,
19930,
19938,
20028,
20043,
20051,
20052,
20361,
20362,
20611,
20612,
20815,
20830,
20838,
20910,
20911,
21121,
21122,
21495,
21496,
21779,
21780,
21898,
21899,
22155,
22156,
22359,
22360,
22589,
22590,
23281,
23282,
23760,
23765,
23772,
23782,
23789,
23794,
23800,
23806,
23812,
23816,
23824,
23831,
23839,
23845,
23859,
23860,
23893,
23894
],
"line_end_idx": [
10,
19,
113,
124,
133,
203,
204,
453,
454,
1268,
1269,
1465,
1475,
1484,
1558,
1559,
1642,
1653,
1662,
1663,
1664,
1885,
1908,
1914,
2256,
2257,
2337,
2747,
2760,
2767,
3109,
3120,
3129,
3130,
3131,
3223,
3236,
3243,
3757,
3758,
3954,
3965,
3974,
3975,
3976,
4137,
4151,
4158,
4264,
4265,
4555,
4585,
4592,
4681,
4701,
4709,
4896,
4897,
5222,
5237,
5245,
5432,
5433,
5923,
5924,
6249,
6250,
6596,
6616,
6624,
7124,
7125,
7565,
7566,
7960,
7961,
8091,
8092,
8160,
8161,
8189,
8190,
8237,
8272,
8299,
8300,
8502,
8503,
8664,
8665,
8752,
8753,
9045,
9065,
9072,
9166,
9178,
9186,
9250,
9287,
9404,
9511,
9523,
9531,
9617,
9618,
9638,
9639,
9838,
9839,
9987,
9988,
10140,
10141,
10182,
10183,
10251,
10259,
10268,
10377,
10378,
10432,
10452,
10460,
10517,
10518,
10844,
10852,
10861,
11202,
11203,
11308,
11328,
11336,
11444,
11445,
11558,
11559,
11695,
11696,
11787,
11788,
11835,
11836,
12058,
12059,
12313,
12321,
12330,
12458,
12459,
12489,
12490,
12641,
12642,
12700,
12701,
12807,
12808,
12865,
12866,
12928,
12929,
12999,
13000,
13236,
13237,
13277,
13278,
13547,
13548,
13583,
13603,
13611,
13612,
13613,
13768,
13769,
13918,
13919,
14058,
14059,
14101,
14102,
14118,
14119,
14157,
14158,
14274,
14275,
14424,
14425,
14432,
14440,
14449,
14619,
14620,
14681,
14682,
14846,
14847,
14878,
14879,
15033,
15034,
15112,
15113,
15144,
15145,
15179,
15180,
15344,
15345,
15377,
15397,
15405,
15406,
15407,
15458,
15459,
15523,
15524,
15736,
15756,
15763,
15920,
15921,
16045,
16060,
16068,
16508,
16509,
17108,
17109,
17503,
17571,
17572,
17600,
17601,
17648,
17683,
17710,
17711,
17913,
17914,
18075,
18076,
18347,
18348,
18951,
18952,
19244,
19245,
19572,
19587,
19595,
19915,
19930,
19938,
20028,
20043,
20051,
20052,
20361,
20362,
20611,
20612,
20815,
20830,
20838,
20910,
20911,
21121,
21122,
21495,
21496,
21779,
21780,
21898,
21899,
22155,
22156,
22359,
22360,
22589,
22590,
23281,
23282,
23760,
23765,
23772,
23782,
23789,
23794,
23800,
23806,
23812,
23816,
23824,
23831,
23839,
23845,
23859,
23860,
23893,
23894,
24145
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 24145,
"ccnet_original_nlines": 306,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4473208785057068,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027894839644432068,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17800521850585938,
"rps_doc_frac_unique_words": 0.20868486166000366,
"rps_doc_mean_word_length": 4.59057092666626,
"rps_doc_num_sentences": 312,
"rps_doc_symbol_to_word_ratio": 0.0026088699232786894,
"rps_doc_unigram_entropy": 5.602838039398193,
"rps_doc_word_count": 4030,
"rps_doc_frac_chars_dupe_10grams": 0.4381621479988098,
"rps_doc_frac_chars_dupe_5grams": 0.4812973141670227,
"rps_doc_frac_chars_dupe_6grams": 0.4653513431549072,
"rps_doc_frac_chars_dupe_7grams": 0.4627567529678345,
"rps_doc_frac_chars_dupe_8grams": 0.45378378033638,
"rps_doc_frac_chars_dupe_9grams": 0.44843241572380066,
"rps_doc_frac_chars_top_2gram": 0.022702699527144432,
"rps_doc_frac_chars_top_3gram": 0.006054049823433161,
"rps_doc_frac_chars_top_4gram": 0.00972972996532917,
"rps_doc_books_importance": -2165.186279296875,
"rps_doc_books_importance_length_correction": -2165.186279296875,
"rps_doc_openwebtext_importance": -1241.2259521484375,
"rps_doc_openwebtext_importance_length_correction": -1241.2259521484375,
"rps_doc_wikipedia_importance": -665.0234375,
"rps_doc_wikipedia_importance_length_correction": -665.0234375
},
"fasttext": {
"dclm": 0.9588490128517151,
"english": 0.9572702050209045,
"fineweb_edu_approx": 2.0130021572113037,
"eai_general_math": 0.984454870223999,
"eai_open_web_math": 0.7541421055793762,
"eai_web_code": 0.4578467607498169
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "511.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
},
"secondary": {
"code": "121",
"labels": {
"level_1": "Philosophy and psychology",
"level_2": "",
"level_3": "Knowledge, Theory of"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "4",
"label": "Metacognitive"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
8,011,972,113,713,904,000 | Publicidad
ES
Descargar Inno Setup 5.3.6
Inno Setup 5.3.6
Por Jordan Russell (Open Source)
Valoración de los usuarios
Publicidad
# Windows 7 change:
- Added new [Setup] section directive: UninstallDisplaySize. On Windows 7 and newer, Setup uses this directive to set the EstimatedSize value in the Uninstall registry key when possible since the Windows 7 Add/Remove Programs Control Panel (called Program and Features) no longer automatically calculates it. If an UninstallDisplaySize is not set, Setup estimates the size itself by taking the size of all files installed and adding any ExtraDiskSpaceRequired values set. Note: Windows 7 only supports the display of values smaller than 4 GB.
# Pascal Scripting now supports IUnknown based COM. Previously it only supported IDispatch based COM but a growing number of Windows API functions are COM based without implementing the IDispatch interface, and you can now use these as well. See the new CodeAutomation2.iss example script for an example. Note: this is only supported by Unicode Inno Setup at the moment, because of Delphi 2's limitations (Delphi 2 is used to compile Non Unicode Inno Setup):
- Added StringToGUID, CreateComObject, and OleCheck support functions.
- Added HResult, TGUID, TCLSID, and TIID support types.
# The compiler no longer allows a single LanguageCodePage directive to be applied to multiple languages at once. If you were using this to force Non Unicode Setup to allow the user to select any language regardless of the system code page, set [Setup] section directive ShowUndisplayableLanguages to yes instead.
# Added new CodePrepareToInstall.iss example script.
# Fix: Unicode Pascal scripting: passing a very long string to Format caused an error.
# Minor tweaks.
¿En qué consiste la garantía de protección de FileHippo?
Close
Sabemos lo importante que resulta mantenerse seguro en la red, y por ello FileHippo utiliza la tecnología de escaneado de virus que Avira proporciona para asegurar que todas las descargas realizadas por medio de FileHippo son seguras. Es seguro instalar en tu dispositivo el programa que estás a punto de descargar. | {
"url": "http://www.filehippo.com/es/download_inno_setup/changelog/6538/",
"source_domain": "www.filehippo.com",
"snapshot_id": "crawl=CC-MAIN-2016-18",
"warc_metadata": {
"Content-Length": "52678",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AZR2V2JUAZHGNCI6XKXAFY4NCYBDUY3R",
"WARC-Concurrent-To": "<urn:uuid:fba6ae2f-cd1b-4a49-8804-21e68a273eb7>",
"WARC-Date": "2016-05-05T10:37:19Z",
"WARC-IP-Address": "23.235.33.196",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DBGWVLG5UU7C7EMW2CY46KZYDN36SUA7",
"WARC-Record-ID": "<urn:uuid:6bc31a3d-6ba1-4c1f-ab48-44d229584c48>",
"WARC-Target-URI": "http://www.filehippo.com/es/download_inno_setup/changelog/6538/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8741660e-232d-4bae-a43f-3a932dd8634e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-239-7-51.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
11,
14,
41,
42,
59,
60,
94,
121,
132,
133,
153,
154,
697,
698,
1157,
1158,
1229,
1285,
1286,
1599,
1600,
1653,
1654,
1741,
1742,
1758,
1759,
1816,
1817,
1823,
1824
],
"line_end_idx": [
11,
14,
41,
42,
59,
60,
94,
121,
132,
133,
153,
154,
697,
698,
1157,
1158,
1229,
1285,
1286,
1599,
1600,
1653,
1654,
1741,
1742,
1758,
1759,
1816,
1817,
1823,
1824,
2139
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2139,
"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.2639593780040741,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022842640057206154,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1903553307056427,
"rps_doc_frac_unique_words": 0.6234567761421204,
"rps_doc_mean_word_length": 5.361111164093018,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.015228429809212685,
"rps_doc_unigram_entropy": 5.064571857452393,
"rps_doc_word_count": 324,
"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.020725389942526817,
"rps_doc_frac_chars_top_3gram": 0.01381693035364151,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -143.03048706054688,
"rps_doc_books_importance_length_correction": -143.03048706054688,
"rps_doc_openwebtext_importance": -82.44290161132812,
"rps_doc_openwebtext_importance_length_correction": -82.44290161132812,
"rps_doc_wikipedia_importance": -74.13616180419922,
"rps_doc_wikipedia_importance_length_correction": -74.13616180419922
},
"fasttext": {
"dclm": 0.0791165828704834,
"english": 0.4628063440322876,
"fineweb_edu_approx": 1.713171124458313,
"eai_general_math": 0.5637776255607605,
"eai_open_web_math": 0.3413013219833374,
"eai_web_code": 0.9419476389884949
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "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": "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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,858,854,389,757,292,500 | 7.2. Configuración (básica) de Debian después del arranque
Una vez haya arrancado, tendrá que completar la configuración de su sistema base, y luego elegir los paquetes adicionales que desea instalar. La aplicación que le guía en este proceso se llama base-config. Su formato es muy similar al de debian-installer desde la primera etapa. De hecho, base-config está constituido por un número de componentes especializados, donde cada componente gestiona una tarea de configuración, contiene un “menú oculto en el segundo plano” y también usa el mismo sistema de navegación.
Si desea volver a ejecutar base-config en cualquier momento después de finalizada la instalación, ejecute como superusuario la orden base-config.
7.2.1. Configuración de su zona horaria
Se le pedirá configurar su zona horaria después de mostrarle la pantalla de bienvenida. Primero debe elegir si el reloj de hardware de su sistema está configurado a la hora local o a la hora del Meridiano de Greenwich («Greenwich Mean Time», GMT ó UTC). La hora mostrada en el diálogo le ayudará a elegir la opción correcta.
A continuación se le mostrará solamente una zona horaria o bien una lista de zonas horarias que sean relevantes, dependiendo de la ubicación elegida al inicio del proceso de instalación. Si se le muestra sólo una opción puede seleccionar la zona horaria mostrada seleccionando para confirmarla. Puede seleccionar No para elegir su zona de la lista completa de zonas horarias. Si se le muestra una lista, deberá elegir su zona horaria de entre los valores mostrados o elegir «Otra» para seleccionar su zona de la lista completa.
7.2.2. Configuración de usuarios y contraseñas
7.2.2.1. Configuración de la contraseña del superusuario
La cuenta root también se conoce como superusuario. Se trata de un usuario que se salta todas las protecciones de seguridad en su sistema. La cuenta del superusuario sólo debe ser usada para tareas de administración del sistema y sólo durante el menor tiempo posible.
Cualquier contraseña que cree deberá contener por lo menos seis caracteres y utilizar caracteres en mayúsculas y minúsculas, así como caracteres de puntuación. Al tratarse de un usuario con privilegios especiales debe tener mucho cuidado cuando defina la contraseña del superusuario. Evite la utilización de palabras de diccionario de cualquier tipo de información personal que pueda adivinar fácilmente.
Sea extremadamente precavido si cualquier persona le dice que necesita su contraseña de superusuario. Normalmente no debería proporcionar la contraseña de superusuario a ninguna persona, a no ser que la máquina la esté administrando más de un administrador.
7.2.2.2. Creación de un usuario corriente
Aquí el sistema le preguntará si desea crear una cuenta de usuario corriente. Este usuario debería ser la cuenta con la que usted accede usualmente al sistema. No debe usar la cuenta del superusuario para uso diario o como su usuario personal.
Usted se podrá preguntar «¿Por qué no?». Una de las razones justificadas para evitar el uso de la cuenta de superusuario es que es muy fácil dañar al sistema de forma irreparable con esta cuenta por error. También, podrían engañarle y hacerle ejecutar un caballo de troya (o troyano), es decir, un programa que hace uso de la ventaja que suponen los poderes especiales en el sistema del superusuario para comprometer la seguridad de éste sin que usted se dé cuenta. Un buen libro sobre administración de sistemas Unix cubrirá este tema con más detalle, debería considerar leer sobre este problema si este tema es algo nuevo para usted.
Se le preguntará en primer lugar por el nombre completo del usuario. A continuación se le pedirá un nombre para la cuenta de este usuario; generalmente es suficiente con el nombre o algo similar. De hecho, el valor predeterminado será éste. Finalmente, se le pedirá la contraseña de acceso para esta cuenta.
Puede utilizar la orden adduser para crear otra cuenta en cualquier momento una vez haya terminado la instalación.
7.2.3. Configuración de PPP
Se le preguntará si desea instalar el resto del sistema usando PPP si no se ha configurado la red durante la primera fase de la instalación. PPP es un protocolo usado para establecer conexiones telefónicas usando módems. El sistema de instalación podrá descargar paquetes adicionales o actualizaciones de seguridad desde Internet durante las siguientes fases de la instalación si configura el módem en este momento. Puede obviar este paso si no tiene un módem en su ordenador o si prefiere configurarlo después de la instalación.
Necesitará algunos datos de su proveedor de acceso a Internet (en adelante, ISP, «Internet Service Provider») para configurar su conexión PPP. Estos datos son: un número de teléfono al que llamar, un nombre de usuario, una clave y los servidores DNS (opcionalmente). Algunos ISPs ofrecen guías de instalación para distribuciones Linux. Puede usar esta información incluso si no está específicamente orientada a Debian, puesto que la gran mayoría de parámetros de configuración (y software) son similares entre las distintas distribuciones de Linux.
Se ejecutará un programa llamado pppconfig si elije configurar PPP en este momento. Este programa le ayudará a configurar su conexión PPP. Asegúrese de utilizar provider (del inglés, proveedor, no debe traducirlo) como nombre de su conexión de acceso telefónico cuando se le solicite.
Con un poco de suerte, el programa pppconfig le guiará a través de una configuración de PPP libre de problemas. Sin embargo, si esto no funciona para su caso, puede consultar a continuación algunas instrucciones detalladas de la instalación.
Para configurar PPP, necesitará saber realizar las operaciones básicas de edición y visualización de ficheros en GNU/Linux. Para ver ficheros, deberá usar more, y zmore, en el caso de ficheros comprimidos con extensión .gz. Por ejemplo, para ver README.debian.gz, escriba zmore README.Debian.gz. El sistema base dispone de un editor llamado nano, que es muy simple de usar pero que no tiene muchas características. Es posible que desee instalar después editores y visores con más funcionalidades, como puedan ser jed, nvi, less y emacs.
Debe editar el fichero /etc/ppp/peers/provider y sustituir /dev/modem por /dev/ttyS#, donde # es el número de su puerto serie. En Linux, los puertos serie se numeran desde el cero. Para Linux el primer puerto serie es /dev/ttyS0. El siguiente paso es editar /etc/chatscripts/provider e insertar el número telefónico de su proveedor, su nombre de usuario y clave. Por favor, no elimine el carácter “\q” que precede a la clave, evita que la clave aparezca en los ficheros de registro.
Muchos proveedores usan PAP ó CHAP para la secuencia de autenticación de acceso en modo texto. Otros usan ambos. Deberá seguir un procedimiento distinto en función de que su proveedor utilice PAP ó CHAP. Comente todo lo que hay después de la cadena de marcado (la que empieza con “ATDT”) en /etc/chatscripts/provider, modifique /etc/ppp/peers/provider como se ha descrito anteriormente, y añada user nombre donde nombre es su nombre de usuario para el proveedor al va a conectarse. A continuación, edite /etc/ppp/pap-secrets o /etc/ppp/chap-secrets y ponga allí su clave de acceso.
También deberá editar /etc/resolv.conf y añadir las direcciones IP de los servidores de nombres (DNS) de su proveedor. El formato de las líneas de /etc/resolv.conf es el siguiente: nameserver xxx.xxx.xxx.xxx donde las xs son los números de la dirección IP. Opcionalmente, puede añadir la opción usepeerdns al fichero /etc/ppp/peers/provider, el cual habilitará la elección automática de los servidores DNS apropiados, usando la configuración que generalmente proporcionará el sistema remoto.
Vd. habrá terminado, a menos de que su proveedor tenga una secuencia de acceso diferente de la mayoría de ISPs. Inicie la conexión PPP escribiendo pon como superusuario, y supervise el proceso de conexión usando plog. Para desconectarse, use poff que deberá ejecutar, de nuevo, como superusuario.
Consulte el fichero /usr/share/doc/ppp/README.Debian.gz para leer más información sobre el uso de PPP en Debian.
Para configurar conexiones estáticas SLIP, necesitará añadir la orden slattach (del paquete net-tools) en /etc/init.d/network. Para configurar las conexiones SLIP dinámicas tendrá que tener instalado el paquete gnudip.
7.2.3.1. Configuración de PPP a través de Ethernet (PPPOE)
PPPOE es un protocolo relacionado con PPP que se utiliza en algunas conexiones de banda ancha. Actualmente no existe soporte de base para asistirle en su configuración. Sin embargo, el software necesario está instalado, lo que significa que puede configurar PPPOE manualmente en este momento de la instalación si cambia a VT2 (segunda consola virtual) y ejecuta la orden pppoeconf.
7.2.4. Configuración de APT
El método principal de instalación de paquetes en un sistema es el uso de un programa llamado «apt-get», que pertenece al paquete apt.[4] Otras interfaces de la gestión de paquetes, como aptitude, «synaptic» y el viejo «dselect» también hacen uso y dependen de «apt-get». A los usuarios nóveles se les recomienda éstas interfaces puesto que integran algunas características adicionales (búsqueda de paquetes y verificación de estado) en una interfaz de usuario agradable.
Debe configurarse APT para que sepa de dónde recuperar los paquetes. La aplicación de ayuda que asiste en esta tarea se llama «apt-setup».
El siguiente paso en su proceso de configuración es indicar a APT dónde puede encontrar otros paquetes Debian. Tenga en cuenta que puede volver a ejecutar esta herramienta en cualquier momento después de la instalación ejecutando «apt-setup», o cambiar la configuración editando manualmente el fichero /etc/apt/sources.list.
Si en este punto vd. tiene un CD-ROM oficial dentro de su unidad lectora, entonces éste se configurará automáticamente como fuente apt sin hacerle ninguna pregunta. Se podrá dar cuenta porque podrá ver que se está leyendo del CD-ROM para analizarlo.
Si no dispone de un CD-ROM oficial, se le mostrarán diversas opciones para que indique un método a utilizar para acceder a paquetes Debian, ya sea a través de FTP, HTTP, CD-ROM o utilizando un sistema de ficheros local.
Puede tener más de una fuente APT, incluso para el mismo repositorio de Debian. «apt-get» elegirá automáticamente el paquete con el número de versión más alto de todas las versiones disponibles. O, por ejemplo, si tiene configuradas fuentes que usan el protocolo HTTP y también el CD-ROM, «apt-get» utilizará automáticamente el CD-ROM local si es posible y solamente utilizará el protocolo HTTP si se dispone de una versión más actualizada a través de éste que la que hay en el CD-ROM. Sin embargo, no es una buena idea añadir fuentes de APT inútiles dado que esto tenderá a alargar en el tiempo el proceso de verificiar los repositorios disponibles en red para determinar la existencia de nuevas versiones.
7.2.4.1. Configuración de las fuentes de paquetes en red
Si planea instalar el resto del sistema a través de la red, la opción más común es elegir como fuente http. También es aceptable la fuente ftp, pero ésta tiende ser un poco más lenta en establecer las conexiones.
El siguiente paso a dar durante la configuración de las fuentes de paquetes en red es indicar a «apt-setup» el país en que se encuentra. Esto configura a qué sistema de la red de réplicas (también llamados servidores espejos) de Debian en Internet se conectará su sistema. Se le mostrará una lista de sistemas disponibles dependiendo del país que elija. Lo habitual es elegir el primero de la lista, pero debería funcionar cualquiera de ellos. Tenga en cuenta, sin embargo, que la lista de réplicas ofrecidas durante instalación se generó cuando se publicó esta versión de Debian, por lo que es posible que algunos de los sistemas no estén disponibles en el momento en que realiza la instalación.
Después de elegir una réplica, se le preguntará si se es necesario usar un servidor proxy. Un servidor proxy es un servidor que reenvía todas sus solicitudes HTTP ó FTP a Internet. Se utiliza habitualmente para optimizar el acceso a Internet en redes corporativas. En algunas redes solamente tiene permitido acceso a Internet el servidor proxy, si este es su caso deberá indicar el nombre del servidor proxy. También podría necesitar incluir un usuario y clave. La mayoría de los usuarios domésticos no tendrán que especificar un servidor proxy, aunque algunos proveedores de Internet ofrecen servidores proxy para sus usuarios.
Su nueva fuente de paquetes en red se comprobará después que elija una réplica. Si todo va bien, se le preguntará si desea añadir o no otra fuente de paquetes. Intente usar otra réplica (ya sea de la lista correspondiente a su país o de la lista mundial) si tiene algún problema usando la fuente de paquetes que ha elegido o intente usar una fuente distinta de paquetes en red.
7.2.5. Instalación de paquetes
A continuación se le presentará un número de configuraciones de software preestablecidas disponibles en Debian. Siempre podrá elegir, paquete por paquete, lo que desea instalar en su nuevo sistema. Éste es el propósito del programa aptitude, descrito a continuación. Tenga en cuenta, sin embargo, que esto puede ser una ardua tarea ya que ¡hay cerca de 14700 paquetes disponibles en Debian!.
Así, puede elegir primero tareas, y luego añadir más paquetes de manera individual. Las tareas representan, a rasgos generales, distintas cosas que podría desear hacer con su ordenador como usarlo para “entorno de escritorio”, “servidor de web”, o “servidor de impresión”.[5]. La Sección C.3, “Espacio en disco requerido para las tareas” muestra los requisitos de espacio disponible en disco para las tareas existentes.
Seleccione Finalizar una vez que haya elegido sus tareas. aptitude instalará los paquetes que ha seleccionado a continuación.
Nota
Aunque no seleccione ninguna tarea, se instalarán todos los paquetes con prioridad «estándar», «importante» o «requerido» que aún no estén instalados en su sistema. Esta funcionalidad es la misma que obtiene si ejecuta tasksel -ris en la línea de órdenes, y actualmente supone la descarga de aproximadamente 37 MB en ficheros. Se le mostrará el número de paquetes que van a instalarse, así como cuántos kilobytes es necesario descargar.
Si quiere elegir qué instalar paquete a paquete seleccione la opción “selección manual de paquetes” en tasksel. Se llamará a aptitude con la opción --visual-preview si selecciona al mismo tiempo una o más tareas. Lo que significa que podrá revisar [6] los paquetes que se van a instalar. Si no selecciona ninguna tarea se mostrará la pantalla habitual de aptitude. Debe pulsar “g” después de haber hecho su selección para empezar la descarga e instalación de los paquetes.
Nota
No se instalará ningún paquete por omisión si selecciona “selección manual de paquetessin seleccionar ninguna de las tareas. Esto significa que puede utilizar esta opción si quiere instalar un sistema reducido, pero también significa que tiene la responsabilidad de seleccionar cualquier paquete que no se haya instalado como parte del sistema base (antes del rearranque) y que pueda necesitar su sistema.
Las tareas que ofrece el instalador de tareas sólo cubre un número pequeño de paquetes comparados con los 14700 paquetes disponibles en Debian. Si desea consultar información sobre más paquetes, puede utilizar apt-cache search cadena a buscar para buscar alguna cadena dada (consulte la página de manual apt-cache(8)), o ejecute aptitude como se describe a continuación.
7.2.5.1. Selección avanzada de paquetes con aptitude
Aptitude es un programa moderno para gestionar paquetes. aptitude le permite seleccionar paquetes individualmente, conjuntos de paquetes que concuerdan con un criterio dado (para usuarios avanzados) o tareas completas.
Las combinaciones de teclas más básicas son:
Tecla Acción
Arriba, Abajo Mueve la selección arriba o abajo.
Enter Abre/colapsa/activa un elemento.
+ Marca el paquete para su instalación.
- Marca el paquete para su eliminación.
d Muestra las dependencias del paquete.
g Descarga/instala/elimina paquetes.
q Sale de la vista actual.
F10 Activa el menú.
Puede consultar más órdenes con la ayuda en línea si pulsa la tecla ?.
7.2.6. Interacciones durante la instalación de software
Cada paquete que elija, ya sea con tasksel o aptitude, es descargado, desempaquetado e instalado en turnos por los programas apt-get y dpkg. Si un programa particular necesita más información del usuario, se le preguntará durante este proceso. Además, debería revisar la salida en pantalla generada durante el proceso, para detectar cualquier error de instalación (aunque se le pedirá que acepte los errores que impidieron la instalación de un paquete).
7.2.7. Configuración del agente de transporte de correo
Hoy en día el correo electrónico es una parte muy importante de la vida diaria de las personas. Por eso no es sorprendente que Debian le permita configurar su sistema de correo como parte del proceso de instalación. El agente de transporte de correo estándar en Debian es exim4, que es relativamente pequeño, flexible y fácil de aprender.
Puede preguntarse ¿es ésto necesario incluso si mi ordenador no está conectado a ninguna red? La respuesta corta es: Sí. La respuesta larga es que algunas herramientas propias del sistema (como es el caso de cron, quota, aide, …) pueden querer enviarle notificaciones de importancia utilizando para ello el correo electrónico.
Así pues, en la primera pantalla de configuración se le presentará diferentes escenarios comunes de correo. Debe elegir el que mejor refleje sus necesidades:
Servidor en Internet («Internet site»)
Su sistema está conectado a una red y envía y recibe su correo directamente usando SMTP. En las siguientes pantallas deberá responder a algunas preguntas básicas, como el nombre de correo de su servidor, o una lista de dominios para los que acepta o reenvía correo.
Correo enviado a través de un «smarthost»
En este escenario su sistema reenvía el correo a otra máquina llamada “smarthost”, que es la que realiza el trabajo real de envío de correo. Habitualmente el «smarthost» también almacena el correo entrante dirigido a su ordenador de forma que no necesite estar permanentemente conectado. Como consecuencia de esto, debe descargar su correo del «smarthost» a través de programas como «fetchmail». Esta opción es la más habitual para los usuarios que utilizan una conexión telefónica para acceder a Internet.
Solamente entrega local
Su sistema no está en una red y sólo se envía y recibe correo entre usuarios locales. Esta opción es la más recomendable aún cuando no tenga pensado enviar ningún mensaje. Es posible que algunas herramientas del sistema envíen diversas alertas cada cierto tiempo (como por ejemplo, el simpático “Se ha excedido la cuota de disco” ). También es conveniente esta opción para usuarios nóveles, ya que no le hará ninguna pregunta adicional.
Sin configuración de momento
Elija ésta opción si está absolutamente convencido de que sabe lo que esta haciendo. Esta opción dejará su sistema de correo sin configurar. No podrá enviar o recibir correo hasta que lo configure, y podría perder algunos mensajes importantes que le envíen las herramientas del sistema.
Si ninguno de estos escenarios se adapta a sus necesidades, o si necesita una configuración más específica, deberá editar los ficheros de configuración en el directorio /etc/exim4 una vez finalice la instalación. Puede encontrar más información acerca de exim4 en /usr/share/doc/exim4.
[4] Tenga en cuenta que el programa que realmente instala los paquetes se llama «dpkg». Sin embargo, este programa es una herramienta de más bajo nivel. «apt-get» es una herramienta de alto nivel que invocará a «dpkg» cuando sea necesario y también sabe como instalar otros paquetes necesarios para el paquete que está intentando instalar, así como obtener el paquete de sus CD-ROMs, de la red o de cualquier otro lugar.
[5] Conviene que sepa que base-config sólo llama al programa tasksel para mostrar esta lista. Para la selección manual de paquetes se ejecuta el programa aptitude. Puede ejecutar cualquiera de ellos en cualquier momento posterior a la instalación para instalar (o eliminar) paquetes. Si desea instalar un paquete en específico, simplemente ejecute aptitude install paquete, una vez haya terminado la instalación, donde paquete es el nombre del paquete que desea instalar.
[6] También puede cambiar la selección por omisión. Si desea seleccionar algún paquete más utilice Vistas->Nueva vista de paquetes. | {
"url": "http://www.debian.org/releases/sarge/hppa/ch07s02.html.es",
"source_domain": "www.debian.org",
"snapshot_id": "crawl=CC-MAIN-2014-42",
"warc_metadata": {
"Content-Length": "32564",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MSZNDCVDTQ6PFOCQOHYPO2KY7CIBPHV3",
"WARC-Concurrent-To": "<urn:uuid:0c92b220-14f5-4aa5-84d8-b655af3de1b7>",
"WARC-Date": "2014-10-22T13:50:57Z",
"WARC-IP-Address": "128.31.0.62",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7YOXYKK2DRGTB57E4AKSNCRV7PBBXU53",
"WARC-Record-ID": "<urn:uuid:0adec982-02f2-4b00-b640-e33011c4427f>",
"WARC-Target-URI": "http://www.debian.org/releases/sarge/hppa/ch07s02.html.es",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:63d7e03e-a642-49d1-847a-b032b8aca111>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-133-185.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-42\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for October 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
59,
60,
574,
575,
721,
722,
762,
763,
1088,
1089,
1617,
1618,
1665,
1666,
1723,
1724,
1992,
1993,
2398,
2399,
2657,
2658,
2700,
2701,
2945,
2946,
3582,
3583,
3891,
3892,
4007,
4008,
4036,
4037,
4567,
4568,
5117,
5118,
5403,
5404,
5646,
5647,
6184,
6185,
6668,
6669,
7251,
7252,
7744,
7745,
8042,
8043,
8156,
8157,
8376,
8377,
8436,
8437,
8819,
8820,
8848,
8849,
9321,
9322,
9461,
9462,
9787,
9788,
10038,
10039,
10259,
10260,
10968,
10969,
11026,
11027,
11240,
11241,
11938,
11939,
12568,
12569,
12947,
12948,
12979,
12980,
13372,
13373,
13793,
13794,
13920,
13921,
13926,
13927,
14364,
14365,
14838,
14839,
14844,
14845,
15251,
15252,
15623,
15624,
15677,
15678,
15897,
15898,
15943,
15944,
15957,
16006,
16045,
16085,
16125,
16165,
16202,
16229,
16249,
16250,
16321,
16322,
16378,
16379,
16833,
16834,
16890,
16891,
17230,
17231,
17558,
17559,
17717,
17718,
17757,
17758,
18024,
18025,
18067,
18068,
18575,
18576,
18600,
18601,
19038,
19039,
19068,
19069,
19356,
19357,
19643,
19644,
19645,
19646,
20067,
20068,
20540,
20541
],
"line_end_idx": [
59,
60,
574,
575,
721,
722,
762,
763,
1088,
1089,
1617,
1618,
1665,
1666,
1723,
1724,
1992,
1993,
2398,
2399,
2657,
2658,
2700,
2701,
2945,
2946,
3582,
3583,
3891,
3892,
4007,
4008,
4036,
4037,
4567,
4568,
5117,
5118,
5403,
5404,
5646,
5647,
6184,
6185,
6668,
6669,
7251,
7252,
7744,
7745,
8042,
8043,
8156,
8157,
8376,
8377,
8436,
8437,
8819,
8820,
8848,
8849,
9321,
9322,
9461,
9462,
9787,
9788,
10038,
10039,
10259,
10260,
10968,
10969,
11026,
11027,
11240,
11241,
11938,
11939,
12568,
12569,
12947,
12948,
12979,
12980,
13372,
13373,
13793,
13794,
13920,
13921,
13926,
13927,
14364,
14365,
14838,
14839,
14844,
14845,
15251,
15252,
15623,
15624,
15677,
15678,
15897,
15898,
15943,
15944,
15957,
16006,
16045,
16085,
16125,
16165,
16202,
16229,
16249,
16250,
16321,
16322,
16378,
16379,
16833,
16834,
16890,
16891,
17230,
17231,
17558,
17559,
17717,
17718,
17757,
17758,
18024,
18025,
18067,
18068,
18575,
18576,
18600,
18601,
19038,
19039,
19068,
19069,
19356,
19357,
19643,
19644,
19645,
19646,
20067,
20068,
20540,
20541,
20672
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 20672,
"ccnet_original_nlines": 158,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07804132252931595,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01810763031244278,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1573578268289566,
"rps_doc_frac_unique_words": 0.2851863205432892,
"rps_doc_mean_word_length": 5.303664684295654,
"rps_doc_num_sentences": 229,
"rps_doc_symbol_to_word_ratio": 0.0007651100168004632,
"rps_doc_unigram_entropy": 5.712793350219727,
"rps_doc_word_count": 3247,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.034260500222444534,
"rps_doc_frac_chars_dupe_6grams": 0.01428487990051508,
"rps_doc_frac_chars_dupe_7grams": 0.004761630203574896,
"rps_doc_frac_chars_dupe_8grams": 0.004761630203574896,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.005574590060859919,
"rps_doc_frac_chars_top_3gram": 0.004064800217747688,
"rps_doc_frac_chars_top_4gram": 0.0034841198939830065,
"rps_doc_books_importance": -1698.25439453125,
"rps_doc_books_importance_length_correction": -1698.25439453125,
"rps_doc_openwebtext_importance": -827.1158447265625,
"rps_doc_openwebtext_importance_length_correction": -827.1158447265625,
"rps_doc_wikipedia_importance": -721.256591796875,
"rps_doc_wikipedia_importance_length_correction": -721.256591796875
},
"fasttext": {
"dclm": 0.9027414321899414,
"english": 0.0004167199949733913,
"fineweb_edu_approx": 1.2262866497039795,
"eai_general_math": 0.00018257000192534178,
"eai_open_web_math": 0.554794192314148,
"eai_web_code": 0.626865804195404
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.02854",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,847,087,967,092,113,000 | Get American Netflix
How to watch Whiplash (2014) on Netflix Japan!
Sorry, Whiplash is not available on Japanese Netflix, but you can unlock it right now in Japan and start watching! With a few simple steps you can change your Netflix region to a country like United Kingdom and start watching British Netflix, which includes Whiplash.
Change your Netflix Country
Whiplash
Whiplash
Netflix Japan
4.5 / 5.0 (compiled from 1 review source)
Whiplash is not available in Japan BUT it can be unlocked and viewed!
Buy from Amazon
Netflix Countries:
New Zealand Belgium Mexico Costa Rica Panama Brazil Argentina Spain Ireland United Kingdom Italy France Egypt Pakistan India
Dramas, Independent Movies, Music
Director(s): Damien Chazelle
Synopsis
Driven by his demanding music teacher, drummer Andrew is determined to succeed as a jazz musician -- even if it destroys his personality.
Unable to Watch without Unlocking
Cast
Nate Lang, Damon Gupton, Miles Teller, Melissa Benoist, Chris Mulkey, Paul Reiser, Austin Stowell, J.K. Simmons
Watch "Whiplash" on Netflix in Japan
There is a way to watch Whiplash in Japan, even though it isn't currently available on Netflix locally. What you need is a system that lets you change your Netflix country. With a few simple steps you can be watching Whiplash and thousands of other titles!
1. Visit Express-VPN.tv in your browser and create an account
2. Download and install the software
3. Choose your Netflix country
4. Watch "Whiplash"!
Get more information about changing your Netflix country | {
"url": "https://whatsnewonnetflix.com/japan/10449/whiplash-2014",
"source_domain": "whatsnewonnetflix.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "180481",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RMCE2WFWRA5JX6JHVRW4NHBJW6JOZ6IZ",
"WARC-Concurrent-To": "<urn:uuid:d85f53d5-bbd0-4ebe-87c4-d7b68ddc8dc8>",
"WARC-Date": "2022-08-15T04:14:21Z",
"WARC-IP-Address": "143.244.176.209",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BTE6DQEEGDLAJLQ7ZJJ4YVKYBQZRVXQ7",
"WARC-Record-ID": "<urn:uuid:ffcc80ff-da0a-4898-b8c2-dd4f18817852>",
"WARC-Target-URI": "https://whatsnewonnetflix.com/japan/10449/whiplash-2014",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:afa791b4-96d9-4f34-9f2a-44bf9664f4e5>"
},
"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-91\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,
21,
22,
69,
70,
338,
339,
367,
376,
377,
386,
400,
401,
445,
515,
531,
550,
675,
709,
738,
739,
748,
749,
887,
888,
922,
923,
928,
929,
1041,
1042,
1079,
1080,
1337,
1338,
1402,
1441,
1474,
1497,
1498
],
"line_end_idx": [
21,
22,
69,
70,
338,
339,
367,
376,
377,
386,
400,
401,
445,
515,
531,
550,
675,
709,
738,
739,
748,
749,
887,
888,
922,
923,
928,
929,
1041,
1042,
1079,
1080,
1337,
1338,
1402,
1441,
1474,
1497,
1498,
1554
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1554,
"ccnet_original_nlines": 39,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2939189076423645,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01351351011544466,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18918919563293457,
"rps_doc_frac_unique_words": 0.604938268661499,
"rps_doc_mean_word_length": 5.0905351638793945,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.684998512268066,
"rps_doc_word_count": 243,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04042036831378937,
"rps_doc_frac_chars_dupe_6grams": 0.04042036831378937,
"rps_doc_frac_chars_dupe_7grams": 0.04042036831378937,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0444624088704586,
"rps_doc_frac_chars_top_3gram": 0.058205340057611465,
"rps_doc_frac_chars_top_4gram": 0.035569928586483,
"rps_doc_books_importance": -129.6480712890625,
"rps_doc_books_importance_length_correction": -117.37747192382812,
"rps_doc_openwebtext_importance": -83.18571472167969,
"rps_doc_openwebtext_importance_length_correction": -83.18571472167969,
"rps_doc_wikipedia_importance": -42.60244369506836,
"rps_doc_wikipedia_importance_length_correction": -28.965572357177734
},
"fasttext": {
"dclm": 0.3149346709251404,
"english": 0.897756814956665,
"fineweb_edu_approx": 1.0633399486541748,
"eai_general_math": 0.00009703999967314303,
"eai_open_web_math": 0.040048301219940186,
"eai_web_code": -1.199999957179898e-7
}
} | {
"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": "791.4372",
"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": "1",
"label": "Factual"
}
},
"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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-3,838,770,470,698,495,500 | Commit bfddd4f3 authored by Philip Carns's avatar Philip Carns
another stab at overview wording
parent 827c983f
# Margo
Margo is a utility library built atop Mercury that simplifies RPC service
development by providing bindings that can issue concurrent operations
without using callback functions and without manual invocation of progress
or trigger function loops.
Margo does this by leveraging the Argobots user-level threading system
to transparently context switch between blocking operations and progress
loops while still retaining the performance advantages of Mercury's
native event-driven progress model.
development by providing bindings that can issue concurrent operations while
hiding the complexity of callback functions and progress loops.
Margo does this by leveraging the Argobots user-level threading system to
transparently and efficiently context switch when functions are waiting
on the completion of Margo operations. Other user-level threads can
therefore continue to make progress while one or more user-level threads
are blocked on network resources. This approach combines the performance
advantages of Mercury's native event-driven execution model with the
progamming simplicity of a multi-threaded execution model.
See the following for more details about Mercury and Argobots:
......
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://xgitlab.cels.anl.gov/sds/margo/commit/bfddd4f344f55a6aa43c2b82e35ef0705fe647e7",
"source_domain": "xgitlab.cels.anl.gov",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "70697",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HRNLVO6UNKFQ6OLWWCMGNLPR3B7QM623",
"WARC-Concurrent-To": "<urn:uuid:5a384f66-4f79-487b-8ca7-a3be31206ce0>",
"WARC-Date": "2020-05-26T14:19:41Z",
"WARC-IP-Address": "140.221.6.150",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SMTFHPFQ7URIMIYZX3WNK23BMQ34ZNOH",
"WARC-Record-ID": "<urn:uuid:6670d9c8-befd-431e-a6d3-b77603a3507f>",
"WARC-Target-URI": "https://xgitlab.cels.anl.gov/sds/margo/commit/bfddd4f344f55a6aa43c2b82e35ef0705fe647e7",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4d13decd-4525-419c-a097-685881161d9b>"
},
"warc_info": "isPartOf: CC-MAIN-2020-24\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-121.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,
97,
98,
114,
122,
196,
267,
342,
369,
440,
513,
581,
617,
694,
758,
832,
904,
972,
1045,
1118,
1187,
1246,
1309,
1316,
1338,
1344,
1415,
1450
],
"line_end_idx": [
63,
64,
97,
98,
114,
122,
196,
267,
342,
369,
440,
513,
581,
617,
694,
758,
832,
904,
972,
1045,
1118,
1187,
1246,
1309,
1316,
1338,
1344,
1415,
1450,
1479
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1479,
"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.33195021748542786,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004149380140006542,
"rps_doc_frac_lines_end_with_ellipsis": 0.03333333134651184,
"rps_doc_frac_no_alph_words": 0.10373444110155106,
"rps_doc_frac_unique_words": 0.557692289352417,
"rps_doc_mean_word_length": 5.961538314819336,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.012448130175471306,
"rps_doc_unigram_entropy": 4.550994396209717,
"rps_doc_word_count": 208,
"rps_doc_frac_chars_dupe_10grams": 0.12903225421905518,
"rps_doc_frac_chars_dupe_5grams": 0.31129032373428345,
"rps_doc_frac_chars_dupe_6grams": 0.31129032373428345,
"rps_doc_frac_chars_dupe_7grams": 0.31129032373428345,
"rps_doc_frac_chars_dupe_8grams": 0.2290322631597519,
"rps_doc_frac_chars_dupe_9grams": 0.2290322631597519,
"rps_doc_frac_chars_top_2gram": 0.020967740565538406,
"rps_doc_frac_chars_top_3gram": 0.03548387065529823,
"rps_doc_frac_chars_top_4gram": 0.04838709905743599,
"rps_doc_books_importance": -86.21340942382812,
"rps_doc_books_importance_length_correction": -79.08922576904297,
"rps_doc_openwebtext_importance": -57.94355010986328,
"rps_doc_openwebtext_importance_length_correction": -57.94355010986328,
"rps_doc_wikipedia_importance": -50.92076873779297,
"rps_doc_wikipedia_importance_length_correction": -40.270206451416016
},
"fasttext": {
"dclm": 0.5767795443534851,
"english": 0.8952372074127197,
"fineweb_edu_approx": 1.5363332033157349,
"eai_general_math": 0.032626211643218994,
"eai_open_web_math": 0.11985313892364502,
"eai_web_code": 0.04388738051056862
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,251,818,899,795,445,200 | Microsoft Surface Pro 3
Watched the Microsoft Surface Event today and here’s some of my observations. The display is 12 inches with a 3:2 aspect ratio. Remember 3:2? That’s the aspect ratio the first iPhone had and all the way up to the iPhone 4s. Then Apple made the dumb mistake of making it 16:9. 3:2 is close to the aspect ratio of paper and that was intentional: Microsoft wants you to get work done on the Surface Pro 3. In fact Microsoft wants you to ditch your notebook for a Surface Pro 3. I can see myself ditching my MacBook Pro and my iPad. The only thing keeping me back is not the hardware, which I think is pretty cool, but the operating system.
The Surface Pro 3 is claimed to sport the thinnest display stack on a tablet, or was it a notebook, or was it both. Probably both. There’s good reason: when you’re using a stylus, a thick display stack will put your stylus visually above the digital ink. Not a good experience. The Surface Pro 3 comes with a stylus that looks and feels like a real pen, because Microsoft wants you to use the stylus like a real pen. One example: Click the back of the stylus like you would a real pen and the Surface Pro 3 comes to life, puts you right into OneNote, and you can immediately start writing that awesome idea you had while you were dreaming. With a thin display stack the digital ink is where the tip is, which should make the experience of writing on the 12-inch paper-like display really nice.
One last thing about the Surface Pro 3’s display: 2160×1440 pixels. That’s two 1080×1440 windows side by side, which is just the way I like it. Two windows on an iPad sounds complicated, but two windows on a tablet that’s designed to replace a notebook sounds good.
Shop at Amazon.com and support DISPLAYBLOG | {
"url": "http://www.displayblog.com/2014/05/20/microsoft-surface-pro-3/",
"source_domain": "www.displayblog.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "3626",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XFGBEUNRLG3ZXMRQBB75OJ5USSYATZUS",
"WARC-Concurrent-To": "<urn:uuid:f97a07ac-1492-42d1-a091-bf2a37be07e9>",
"WARC-Date": "2015-08-31T21:45:57Z",
"WARC-IP-Address": "98.129.229.26",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AFPYMR65B3SD4X6INWVYVYPUQT5WK5AG",
"WARC-Record-ID": "<urn:uuid:ff5666e0-80bd-481b-9e8c-319fdbb09f34>",
"WARC-Target-URI": "http://www.displayblog.com/2014/05/20/microsoft-surface-pro-3/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:99df02cd-1502-48b7-a9e2-f27ec0043d24>"
},
"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,
24,
25,
662,
663,
1457,
1458,
1724,
1725
],
"line_end_idx": [
24,
25,
662,
663,
1457,
1458,
1724,
1725,
1767
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1767,
"ccnet_original_nlines": 8,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4285714328289032,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010204079560935497,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18112245202064514,
"rps_doc_frac_unique_words": 0.48159509897232056,
"rps_doc_mean_word_length": 4.285275936126709,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.637547969818115,
"rps_doc_word_count": 326,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.027201149612665176,
"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.05010737106204033,
"rps_doc_frac_chars_top_3gram": 0.04724409058690071,
"rps_doc_frac_chars_top_4gram": 0.04008590057492256,
"rps_doc_books_importance": -149.2138671875,
"rps_doc_books_importance_length_correction": -141.51622009277344,
"rps_doc_openwebtext_importance": -104.77902221679688,
"rps_doc_openwebtext_importance_length_correction": -104.77902221679688,
"rps_doc_wikipedia_importance": -72.78907775878906,
"rps_doc_wikipedia_importance_length_correction": -69.81034088134766
},
"fasttext": {
"dclm": 0.044108688831329346,
"english": 0.9250866174697876,
"fineweb_edu_approx": 1.1387624740600586,
"eai_general_math": 0.07052409648895264,
"eai_open_web_math": 0.21292513608932495,
"eai_web_code": 0.003848250024020672
}
} | {
"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.17",
"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": "14",
"label": "Reviews/Critiques"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,641,517,679,616,423,400 | Postfix issue: Relay access denied and problem with sending mails
Discussion in 'Installation/Configuration' started by Debianer, Feb 6, 2009.
1. Debianer
Debianer New Member
Hi,
I've just installed postfix and popa3d - debian packages.
1. When I try to send an e-mail from Gmail account to me:
Code:
[email protected]
I'm getting error:
Code:
Google tried to deliver your message, but it was rejected by the recipient domain. We recommend contacting the other email provider for further information about the cause of this error. The error that the other server returned was: 554 554 5.7.1 <[email protected]>: Relay access denied (state 14).
2. When I try to send an e-mail from Postfix to Gmail it normally, go out, but I am not getting this e-mail on my Gmail account.
My main.cf is:
Code:
myorigin = /etc/mailname # domain.com
smtpd_banner = $myhostname ESMTP $mail_name (Debian/GNU)
biff = no
append_dot_mydomain = no
readme_directory = no
smtpd_tls_cert_file=/etc/ssl/certs/ssl-cert-snakeoil.pem
smtpd_tls_key_file=/etc/ssl/private/ssl-cert-snakeoil.key
smtpd_use_tls=yes
smtpd_tls_session_cache_database = btree:${data_directory}/smtpd_scache
smtp_tls_session_cache_database = btree:${data_directory}/smtp_scache
myhostname = my computer static ISP hostname
mydomain = domain.com
mydestination = $myhostname
mynetworks = 192.168.0.0/24
inet_interfaces = all
alias_maps = hash:/etc/aliases
alias_database = hash:/etc/aliases
disable_dns_lookups = yes
mailbox_command = procmail -a "$EXTENSION"
mailbox_size_limit = 0
recipient_delimiter = +
What should I do?
2. falko
falko Super Moderator ISPConfig Developer
3. Debianer
Debianer New Member
MX Record is my server IP.
Blacklist check:
Code:
Checking 78.88.117.27 against 123 known blacklists...
Listed: 2 time(s)
Timeouts:7
4. falko
falko Super Moderator ISPConfig Developer
The MX record must point to a hostname (e.g. mail.example.com) which then points to an IP (using an A record).
Is your server hosted on a dynamic IP and/or was it abused by spammers?
5. Debianer
Debianer New Member
My server is hosted on static IP and it was not abused by spammers.
Fixed MX record. Now it points to hostname, which points to server IP.
... but still e-mails from Gmail cannot be sent, beacuse there is same error with Relay Access Denied.
Checked log when sending an e-mail to Gmail and other mail server. Most servers (maybe all) say that I am spammer.
I am not sure is it spam block or becuase I dont have revDNS configured properly for my domain.
Found somewhere that configuring revDNS helped for this problem.
Now have problem with configuring bind9. Installed it then
Added to named.conf, my IP is 73.48.217.17
Code:
zone "17.217.48.73.in-addr.arpa" {
type master;
file "/etc/bind/17.217.48.73.in-addr.arpa";
};
17.217.48.73.in-addr.arpa - file
Code:
17.217.48.73.in-addr.arpa. IN PTR domain.com.
I am not Primary DNS for domain.com, it has external default DNS servers.
I've checked the RevDNS and its still not correct. Here: remote.12dt.com/lookup.php
What should be inside of 17.217.48.73.in-addr.arpa file?
I've only one line of code as you see.
Last edited: Feb 8, 2009
6. falko
falko Super Moderator ISPConfig Developer
IT can take up to 72 hours until DNS changes propagate, so you might have to wait a little bit longer.
Please contact the maintainers of the blacklists and ask them to remove your server.
A PTR record is important, but it must be created by your ISP/hoster (the one who gave you the IP address).
Also make sure you have SPF records for your domains.
7. Debianer
Debianer New Member
Still Relay Acces Denied. POP3 port 110 open.
Dont know why it blocks.
PTR record must be created by my ISP?
My hostname is vectranet.pl, but my domain is different, so revDNS for my IP do not point to my mail domain.
About SPF
Here is my bind9 zone file:
Code:
27.117.88.78.in-addr.arpa. IN PTR guid.pl.
guid.pl. TXT "v=spf1 ip4:78.88.117.27 -all"
8. falko
falko Super Moderator ISPConfig Developer
The PTR must point to a domain/hostname that in return points back to the same IP. It doesn't matter if it's your hostname or something like dgbg123523452.rthrt435634.yourisp.com.
9. Debianer
Debianer New Member
So revDNS is propably set up correclty. RevDNS for my IP get my hostname created by ISP.
What about sending from email account to my server account?
What about SPF is set up correctly in bind9?
10. falko
falko Super Moderator ISPConfig Developer
If you send guid.pl mails only from the 78.88.117.27 server, then the SPF record is ok.
Can you send an email to your server and at the same time take a look at the mail log? What happens there?
Share This Page | {
"url": "https://www.howtoforge.com/community/threads/postfix-issue-relay-access-denied-and-problem-with-sending-mails.31045/",
"source_domain": "www.howtoforge.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "51368",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6OFE7AY2F66B2D7BO3VRXLNJ4WXTB2QQ",
"WARC-Concurrent-To": "<urn:uuid:a1b9bb72-ff50-4800-9036-15a850c8089a>",
"WARC-Date": "2016-07-30T13:55:54Z",
"WARC-IP-Address": "104.25.204.33",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6T2BQ3EYFRCT3F2CHZEJDNHYJCZJRICX",
"WARC-Record-ID": "<urn:uuid:e34a53e2-532d-4172-a9ea-961c5c79bcb2>",
"WARC-Target-URI": "https://www.howtoforge.com/community/threads/postfix-issue-relay-access-denied-and-problem-with-sending-mails.31045/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:954a4dbf-2ac0-4351-b413-f6b6636c05f8>"
},
"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,
66,
67,
144,
145,
159,
160,
184,
185,
193,
255,
256,
318,
328,
350,
373,
383,
687,
820,
821,
840,
850,
892,
897,
958,
972,
977,
1006,
1011,
1037,
1042,
1047,
1108,
1170,
1192,
1268,
1342,
1347,
1396,
1422,
1454,
1486,
1512,
1517,
1552,
1591,
1596,
1626,
1631,
1678,
1705,
1733,
1755,
1761,
1772,
1773,
1819,
1820,
1834,
1835,
1859,
1860,
1891,
1892,
1913,
1923,
1981,
2003,
2018,
2023,
2029,
2040,
2041,
2087,
2088,
2203,
2204,
2280,
2286,
2300,
2301,
2325,
2326,
2398,
2473,
2580,
2581,
2700,
2701,
2801,
2870,
2871,
2872,
2935,
2936,
2983,
2993,
3032,
3049,
3097,
3104,
3109,
3146,
3156,
3210,
3215,
3293,
3294,
3382,
3383,
3444,
3487,
3493,
3522,
3533,
3534,
3580,
3581,
3688,
3689,
3778,
3779,
3891,
3892,
3950,
3956,
3970,
3971,
3995,
3996,
4046,
4075,
4076,
4118,
4231,
4232,
4246,
4278,
4288,
4339,
4387,
4393,
4404,
4405,
4451,
4452,
4636,
4642,
4656,
4657,
4681,
4682,
4775,
4839,
4888,
4894,
4906,
4907,
4953,
4954,
5046,
5047,
5158,
5164,
5165
],
"line_end_idx": [
66,
67,
144,
145,
159,
160,
184,
185,
193,
255,
256,
318,
328,
350,
373,
383,
687,
820,
821,
840,
850,
892,
897,
958,
972,
977,
1006,
1011,
1037,
1042,
1047,
1108,
1170,
1192,
1268,
1342,
1347,
1396,
1422,
1454,
1486,
1512,
1517,
1552,
1591,
1596,
1626,
1631,
1678,
1705,
1733,
1755,
1761,
1772,
1773,
1819,
1820,
1834,
1835,
1859,
1860,
1891,
1892,
1913,
1923,
1981,
2003,
2018,
2023,
2029,
2040,
2041,
2087,
2088,
2203,
2204,
2280,
2286,
2300,
2301,
2325,
2326,
2398,
2473,
2580,
2581,
2700,
2701,
2801,
2870,
2871,
2872,
2935,
2936,
2983,
2993,
3032,
3049,
3097,
3104,
3109,
3146,
3156,
3210,
3215,
3293,
3294,
3382,
3383,
3444,
3487,
3493,
3522,
3533,
3534,
3580,
3581,
3688,
3689,
3778,
3779,
3891,
3892,
3950,
3956,
3970,
3971,
3995,
3996,
4046,
4075,
4076,
4118,
4231,
4232,
4246,
4278,
4288,
4339,
4387,
4393,
4404,
4405,
4451,
4452,
4636,
4642,
4656,
4657,
4681,
4682,
4775,
4839,
4888,
4894,
4906,
4907,
4953,
4954,
5046,
5047,
5158,
5164,
5165,
5180
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5180,
"ccnet_original_nlines": 164,
"rps_doc_curly_bracket": 0.0011582999723032117,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27407407760620117,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04722221940755844,
"rps_doc_frac_lines_end_with_ellipsis": 0.006060610059648752,
"rps_doc_frac_no_alph_words": 0.3166666626930237,
"rps_doc_frac_unique_words": 0.42981186509132385,
"rps_doc_mean_word_length": 5.198263168334961,
"rps_doc_num_sentences": 129,
"rps_doc_symbol_to_word_ratio": 0.0027777799405157566,
"rps_doc_unigram_entropy": 5.3068156242370605,
"rps_doc_word_count": 691,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07405345141887665,
"rps_doc_frac_chars_dupe_6grams": 0.07405345141887665,
"rps_doc_frac_chars_dupe_7grams": 0.03897549957036972,
"rps_doc_frac_chars_dupe_8grams": 0.013919820077717304,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.022271709516644478,
"rps_doc_frac_chars_top_3gram": 0.026447659358382225,
"rps_doc_frac_chars_top_4gram": 0.03479954972863197,
"rps_doc_books_importance": -458.2727355957031,
"rps_doc_books_importance_length_correction": -458.2727355957031,
"rps_doc_openwebtext_importance": -266.1264953613281,
"rps_doc_openwebtext_importance_length_correction": -266.1264953613281,
"rps_doc_wikipedia_importance": -232.0260772705078,
"rps_doc_wikipedia_importance_length_correction": -232.0260772705078
},
"fasttext": {
"dclm": 0.06042987108230591,
"english": 0.8261585831642151,
"fineweb_edu_approx": 1.718415379524231,
"eai_general_math": 0.037675801664590836,
"eai_open_web_math": 0.22750765085220337,
"eai_web_code": 0.03684264048933983
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.442",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-4,068,425,018,140,340,000 | blob: 91154d82aae6de5f1206413215c0ca9caead6e41 [file] [log] [blame]
// Copyright (c) 2011 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "courgette/base_test_unittest.h"
#include <string>
#include "base/basictypes.h"
#include "courgette/courgette.h"
#include "courgette/streams.h"
#include "courgette/third_party/bsdiff.h"
class VersioningTest : public BaseTest {
public:
void TestApplyingOldBsDiffPatch(const char* src_file,
const char* patch_file,
const char* expected_file) const;
};
void VersioningTest::TestApplyingOldBsDiffPatch(
const char* src_file,
const char* patch_file,
const char* expected_file) const {
std::string old_buffer = FileContents(src_file);
std::string new_buffer = FileContents(patch_file);
std::string expected_buffer = FileContents(expected_file);
courgette::SourceStream old_stream;
courgette::SourceStream patch_stream;
old_stream.Init(old_buffer);
patch_stream.Init(new_buffer);
courgette::SinkStream generated_stream;
courgette::BSDiffStatus status = courgette::ApplyBinaryPatch(
&old_stream, &patch_stream, &generated_stream);
EXPECT_EQ(status, courgette::OK);
size_t expected_length = expected_buffer.size();
size_t generated_length = generated_stream.Length();
EXPECT_EQ(generated_length, expected_length);
EXPECT_EQ(0, memcmp(generated_stream.Buffer(),
expected_buffer.c_str(),
expected_length));
}
TEST_F(VersioningTest, BsDiff) {
TestApplyingOldBsDiffPatch("setup1.exe", "setup1-setup2.v1.bsdiff",
"setup2.exe");
TestApplyingOldBsDiffPatch("chrome64_1.exe", "chrome64-1-2.v1.bsdiff",
"chrome64_2.exe");
// We also need a way to test that newly generated patches are appropriately
// applicable by older clients... not sure of the best way to do that.
} | {
"url": "https://chromium.googlesource.com/chromium/src/+/7d5426fdb05ade9631fa3d9d0fe6135b272eb147/courgette/versioning_unittest.cc",
"source_domain": "chromium.googlesource.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "24582",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D4UG3SWU3BVP4Z3JONRTDV3MKIN4NSUY",
"WARC-Concurrent-To": "<urn:uuid:46b90581-d5fe-4708-b8ee-82811b11dd36>",
"WARC-Date": "2021-07-23T20:21:36Z",
"WARC-IP-Address": "173.194.66.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DAOGY656DJ73JOZNMP5DP5LV7EF7OAJM",
"WARC-Record-ID": "<urn:uuid:4136dc96-476a-429f-85fc-89c5ffefa1d6>",
"WARC-Target-URI": "https://chromium.googlesource.com/chromium/src/+/7d5426fdb05ade9631fa3d9d0fe6135b272eb147/courgette/versioning_unittest.cc",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1dd9f896-2f89-4a79-9dd1-b45a5768fed6>"
},
"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-248.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,
68,
133,
207,
237,
279,
297,
326,
359,
390,
432,
473,
481,
535,
559,
593,
596,
645,
667,
691,
726,
775,
826,
885,
921,
959,
988,
1019,
1059,
1121,
1169,
1203,
1252,
1305,
1351,
1398,
1423,
1442,
1444,
1477,
1545,
1560,
1631,
1650,
1727,
1798
],
"line_end_idx": [
68,
133,
207,
237,
279,
297,
326,
359,
390,
432,
473,
481,
535,
559,
593,
596,
645,
667,
691,
726,
775,
826,
885,
921,
959,
988,
1019,
1059,
1121,
1169,
1203,
1252,
1305,
1351,
1398,
1423,
1442,
1444,
1477,
1545,
1560,
1631,
1650,
1727,
1798,
1799
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1799,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0.0033351900056004524,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09428571164608002,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019999999552965164,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4514285624027252,
"rps_doc_frac_unique_words": 0.7152777910232544,
"rps_doc_mean_word_length": 9.6875,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.019999999552965164,
"rps_doc_unigram_entropy": 4.470696449279785,
"rps_doc_word_count": 144,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0788530483841896,
"rps_doc_frac_chars_dupe_6grams": 0.0788530483841896,
"rps_doc_frac_chars_dupe_7grams": 0.0788530483841896,
"rps_doc_frac_chars_dupe_8grams": 0.0788530483841896,
"rps_doc_frac_chars_dupe_9grams": 0.0788530483841896,
"rps_doc_frac_chars_top_2gram": 0.032258059829473495,
"rps_doc_frac_chars_top_3gram": 0.02293906919658184,
"rps_doc_frac_chars_top_4gram": 0.028673840686678886,
"rps_doc_books_importance": -183.21539306640625,
"rps_doc_books_importance_length_correction": -178.49490356445312,
"rps_doc_openwebtext_importance": -120.35888671875,
"rps_doc_openwebtext_importance_length_correction": -120.35888671875,
"rps_doc_wikipedia_importance": -108.73497009277344,
"rps_doc_wikipedia_importance_length_correction": -108.41658782958984
},
"fasttext": {
"dclm": 0.034706950187683105,
"english": 0.594059944152832,
"fineweb_edu_approx": 2.9929513931274414,
"eai_general_math": 0.9009145498275757,
"eai_open_web_math": 0.04407858848571777,
"eai_web_code": 0.04351108893752098
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,078,580,579,623,230,000 | A simplified Device Identifier and Device DNA AXI read IP for PYNQ
Dear all,
I am sharing a simple DNA IP without HLS and pure Verilog coding.
This example is targeted ZYNQ 7000 series.
This can be read via Python MMIO script.
DNA is an unique ID preprogrammed onto each FPGA and can be used to identify the device for production or development board logging in University and Corporation.
ENJOY~
1 Like | {
"url": "https://discuss.pynq.io/t/a-simplified-device-identifier-and-device-dna-axi-read-ip-for-pynq/6141",
"source_domain": "discuss.pynq.io",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "19465",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UFKAA252KOZZSTCKVOV7EKOIYUBBSQDZ",
"WARC-Concurrent-To": "<urn:uuid:6b95ef4f-d295-4ee4-981c-7848e4c0d70e>",
"WARC-Date": "2023-12-03T04:35:09Z",
"WARC-IP-Address": "184.105.99.43",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BDDM2T2UAAQT6SPIA5J6C4ML6X742TBH",
"WARC-Record-ID": "<urn:uuid:60af7d42-6419-4b5a-9bf2-30f61e5a1d19>",
"WARC-Target-URI": "https://discuss.pynq.io/t/a-simplified-device-identifier-and-device-dna-axi-read-ip-for-pynq/6141",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4d8f2c12-472a-4a33-9882-b7033af1fe62>"
},
"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-66\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
67,
68,
78,
79,
145,
188,
229,
392,
393,
400,
401
],
"line_end_idx": [
67,
68,
78,
79,
145,
188,
229,
392,
393,
400,
401,
407
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 407,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3333333432674408,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.19230769574642181,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10256409645080566,
"rps_doc_frac_unique_words": 0.7916666865348816,
"rps_doc_mean_word_length": 4.527777671813965,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.954066038131714,
"rps_doc_word_count": 72,
"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.030674850568175316,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -36.3536491394043,
"rps_doc_books_importance_length_correction": -36.35365295410156,
"rps_doc_openwebtext_importance": -22.459047317504883,
"rps_doc_openwebtext_importance_length_correction": -22.459049224853516,
"rps_doc_wikipedia_importance": -16.55270767211914,
"rps_doc_wikipedia_importance_length_correction": -16.552709579467773
},
"fasttext": {
"dclm": 0.7154830694198608,
"english": 0.8508135676383972,
"fineweb_edu_approx": 2.654299020767212,
"eai_general_math": 0.02845931053161621,
"eai_open_web_math": 0.04651784896850586,
"eai_web_code": 0.02764981985092163
}
} | {
"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": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
864,135,006,178,647,000 | Server Fault is a question and answer site for system and network administrators. It's 100% free, no registration required.
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
I'd like to dynamically be able to host client's domains, with just having to provide them instructions like this: http://www.tumblr.com/docs/en/custom_domains
I'm running a pretty typical LAMP stack; any good tutorials for configuring this for Apache, or other server-side configurations I need to be aware of?
share|improve this question
possible duplicate of Dynamic Virtual Hosts In Apache – John Gardeniers May 28 '10 at 5:09
Apache supports virtual host configuration. There is plenty of information on how to set this up available at http://httpd.apache.org/docs/2.0/mod/mod_vhost_alias.html and http://httpd.apache.org/docs/2.0/vhosts/mass.html. Just set this up in Apache with a dedicated IP address, then tell your clients to set their DNS records to point to the IP address in question. Their folder names on the server will need to match their domain name (or other matching criteria per the first link above).
With Tumblr, they likely have a single application running on the specified IP address which determines which site settings to use based on a CGI variable (server_name, usually). If each of your customer sites will be using their own webroot, then the Apache configuration should work for you. If you're hosting an application that they're all using, then you can have Apache listen for all requests on a dedicated IP address and then differentiate them within the application through the CGI variable.
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://serverfault.com/questions/146081/dynamically-hosting-new-domains-on-apache",
"source_domain": "serverfault.com",
"snapshot_id": "crawl=CC-MAIN-2016-26",
"warc_metadata": {
"Content-Length": "74774",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6LFFO2CO5OZRBOYCRQBV5HLEJ7WDK45J",
"WARC-Concurrent-To": "<urn:uuid:937ee23f-76c4-49dd-8b32-7f87de073857>",
"WARC-Date": "2016-06-27T13:23:01Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6ORMAX5P5LDJOGF27SBNCCKNHYDKPYPV",
"WARC-Record-ID": "<urn:uuid:28e795c8-8780-4ce2-9d3b-05af44ab01e8>",
"WARC-Target-URI": "http://serverfault.com/questions/146081/dynamically-hosting-new-domains-on-apache",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bb7403a5-944c-4f0a-9e94-9f0c262bdadf>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-164-35-72.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-26\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
124,
125,
133,
154,
186,
210,
265,
266,
426,
427,
579,
580,
608,
613,
704,
705,
1197,
1198,
1701,
1702,
1728,
1729,
1741,
1742,
1744,
1752,
1753,
1831,
1832
],
"line_end_idx": [
124,
125,
133,
154,
186,
210,
265,
266,
426,
427,
579,
580,
608,
613,
704,
705,
1197,
1198,
1701,
1702,
1728,
1729,
1741,
1742,
1744,
1752,
1753,
1831,
1832,
1922
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1922,
"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.3870967626571655,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027295289561152458,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20099255442619324,
"rps_doc_frac_unique_words": 0.568561851978302,
"rps_doc_mean_word_length": 5.083611965179443,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.857757091522217,
"rps_doc_word_count": 299,
"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.02368420921266079,
"rps_doc_frac_chars_top_3gram": 0.011842110194265842,
"rps_doc_frac_chars_top_4gram": 0.02500000037252903,
"rps_doc_books_importance": -184.94969177246094,
"rps_doc_books_importance_length_correction": -184.94967651367188,
"rps_doc_openwebtext_importance": -102.3991470336914,
"rps_doc_openwebtext_importance_length_correction": -102.3991470336914,
"rps_doc_wikipedia_importance": -80.52064514160156,
"rps_doc_wikipedia_importance_length_correction": -80.52064514160156
},
"fasttext": {
"dclm": 0.25781434774398804,
"english": 0.9084582924842834,
"fineweb_edu_approx": 1.5221710205078125,
"eai_general_math": 0.00005506999877979979,
"eai_open_web_math": 0.03283869847655296,
"eai_web_code": 0.000011439999980211724
}
} | {
"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.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.