id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
8,896,718,602,681,429,000
|
2014 Latest Microsoft 70-416 Exam Dumps Free Download(51-60)!
QUESTION 51
You need to deploy App1 and App2 to the RD Session Host servers. The solution must meet the application requirements. What should you do first?
A. Install Microsoft Silverlight.
B. Install the Windows Internal Database feature.
C. Install the Quality Windows Audio Video feature
D. Install the App-V Remote Desktop Services client.
Answer: D
QUESTION 52
You need to monitor the usage of the APP-V applications. The Solution must meet the application requirements. What should you do?
A. On the App-V management servers, run Update-AppvrServerConnectionGroup.
B. On the App-V publisihing servers, run Set-AppvPublishingServer.
C. On the clients computers, run Publish-AppVClientPackages.
D. On the client computers, run Set-AppvClientConfiguration.
Answer: D
QUESTION 53
Your network contains an Active Directory domain named contoso.com. Client computers run either Windows 7 or Windows 8. You plan to replace the client computers that run Windows 7. You need to migrate the application settings and the configurations from the client computers that run Windows 7 to the client computers that run Windows 8. What should you do?
A. On the client computers that run Windows 7, run loadstate.exe.
On the client computers that run Windows 8, run scanstate.exe.
B. On the client computers that run Windows 7, run scanstate.exe.
On the client computers that run Windows 8, run loadstate.exe.
C. On a server that runs Windows Server 2012, install the Windows Server Migration Tools.
Run the Export-SmigServerSetting cmdlet and the Import-SmigServerSetting cmdlet.
D. On a server that runs Windows Server 2012, install the Windows Server Migration Tools.
Run the Send-SmigServerData cmdlet and the Receive-SmigServerData cmdlet.
Answer: B
QUESTION 54
Your network contains an Active Directory domain named contoso.com. All client computers are configured to download Windows updates from a server that runs Windows Server Update Services (WSUS). Microsoft Office 2010 is deployed to the client computers. You need to configure WSUS to update Office 2010 automatically on the client computers. What should you do? (Each correct answer presents part of the solution. Choose all that apply.)
A. From the Update Services console, modify the Products and Classifications settings.
B. From the Update Services console, create an update rule.
C. From the Update Services console, modify the update Files settings.
D. From the Group Policy Management console, modify the Default Domain Controllers Policy.
E. From the Group Policy Management console, modify the Default Domain Policy.
Answer: AB
Explanation:
Products and Classifications settings allows you to choose to update Office
The update rule allows you to set it to update automatically for updates to Office (Default is critical and security updates)
Since WSUS is already being used by client machines to update, there is no reason to modify any GPO.
QUESTION 55
Your company has offices in France and England. The network contains an Active Directory domain named contoso.com. You plan to deploy Microsoft Word 2010 to all users by using Group Policy objects (GPOs). The users in the office in France must receive a version of Word that contains custom options. You need to recommend a solution for the planned deployment of Word. What should you include in the recommendation?
A. Application control policies
B. A Windows Installer transform (.mst) file
C. Software restriction policies
D. A Windows Installer patch (.msp) file
Answer: B
QUESTION 56
Your network contains an Active Directory domain named contoso.com. The domain contains five servers that run Windows Server 2012 and 500 client computers that run Windows 7. You deploy five third-party applications named App1, App2, App3, App4, and App5 to 50 of the client computers. You need to recommend an application update solution for the third-party applications. The solution must ensure that an administrator can generate reports that contain installation information. What should you recommend implementing? More than one answer choice may achieve the goal. Select the BEST answer.
A. Windows Server Update Services (WSUS)
B. Windows Intune
C. Assigned applications by using Group Policy
D. Microsoft System Center 2012 Configuration Manager
Answer: D
QUESTION 57
You plan to deploy three Remote Desktop Gateway (RD Gateway) servers. You need to recommend a solution to ensure that if a single RD Gateway server fails, users can continue to access resources through the other RD Gateway servers. What should you recommend? More than one answer choice may achieve the goal. Select the BEST answer.
A. Network Load Balancing (NLB)
B. Hyper-V replicas
C. Failover Clustering
D. DNS round robin
Answer: A
QUESTION 58
Your network contains an Active Directory domain named contoso.com. The domain contains multiple servers that run Windows Server 2012. All of the servers run as virtual machines on Hyper-V hosts. The network contains a Remote Desktop Services (RDS) infrastructure. The infrastructure contains four servers. The servers are configured as shown in the following table.
clip_image001
You publish a RemoteApp program named App1. App1 is accessed from client computers by using a web browser. You need to recommend changes to the RDS infrastructure to meet the following requirements:
App1 must be available from a web browser if Server3 fails. The connection requests for App1 must be distributed evenly between Server3 and Server4. What should you recommend adding to the RDS infrastructure?
A. A replica of Server3 and Server4 on another Hyper-v host
B. A Network Load Balancing (NLB) cluster that contains Server3 and Server4
C. A failover cluster that contains Server3 and Server4
D. An additional Remote Desktop Connection Broker (RD Connection Broker)
Answer: B
QUESTION 59
Drag and Drop Question
Your network contains an Active Directory domain named contoso.com. The domain contains four servers named Server1, Server2, Server3, and Server4. The domain contains a RemoteApp farm. You install the Remote Desktop Connection Broker role service on Server1 and Server2. You need to recommend a Remote Desktop solution to ensure that users can reconnect to existing sessions if a single server fails. What should you recommend deploying on Server3 and Server4? To answer, drag the appropriate software to the correct server in the answer are a. Each software may be used once, more than once, or not at all. Additionally, you may need to drag the split bar between panes or scroll to view content.
clip_image002
Answer:
clip_image002[4]
QUESTION 60
You are an enterprise administrator for your company, which is named Contoso, Ltd. You plan to publish applications to virtual desktops by using Microsoft Application Virtualization (App-V) 5.0. You need to recommend a solution to prevent the virtual desktops from caching App- V 5.0 packages to disk. What should you include in the recommendation?
A. Dynamic Memory
B. Non-uniform memory access (NUMA)
C. A dynamic user configuration file
D. Shared Content Store Mode
Answer: D
Passing Microsoft 70-416 Exam successfully in a short time! Just using Braindump2go’s Latest Microsoft 70-416 Dump: http://www.braindump2go.com/70-416.html
Comments are closed.
|
{
"url": "https://www.appledumps.com/2014-latest-microsoft-70-416-exam-dumps-free-download51-60.html",
"source_domain": "www.appledumps.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "271075",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JZSSMBBBOVF5DWZ2CSC3X4CL4DTSUUPU",
"WARC-Concurrent-To": "<urn:uuid:dd4765d0-9d35-4ddf-b6bc-b8d6d6853553>",
"WARC-Date": "2022-01-16T22:04:07Z",
"WARC-IP-Address": "104.21.50.224",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NUPYIGFFNTRILOCIMECDEF36PXRXP3KI",
"WARC-Record-ID": "<urn:uuid:5c345132-2db0-4ac2-8ca5-3f3e34bf5003>",
"WARC-Target-URI": "https://www.appledumps.com/2014-latest-microsoft-70-416-exam-dumps-free-download51-60.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bab1d8cb-b2c0-4ff7-83b6-2d4738d510e7>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-78\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
62,
63,
75,
219,
220,
257,
310,
364,
420,
421,
431,
432,
444,
574,
575,
653,
723,
787,
851,
852,
862,
863,
875,
1233,
1234,
1303,
1366,
1435,
1498,
1591,
1672,
1765,
1839,
1840,
1850,
1851,
1863,
2301,
2302,
2392,
2455,
2529,
2623,
2705,
2706,
2717,
2730,
2806,
2932,
3033,
3034,
3046,
3462,
3463,
3498,
3546,
3582,
3626,
3627,
3637,
3638,
3650,
4244,
4245,
4289,
4310,
4360,
4417,
4418,
4428,
4429,
4441,
4774,
4775,
4810,
4833,
4859,
4881,
4882,
4892,
4893,
4905,
5272,
5287,
5486,
5695,
5696,
5759,
5838,
5897,
5973,
5974,
5984,
5985,
5997,
6020,
6718,
6733,
6741,
6759,
6760,
6772,
7121,
7122,
7143,
7182,
7222,
7254,
7255,
7265,
7421,
7422
],
"line_end_idx": [
62,
63,
75,
219,
220,
257,
310,
364,
420,
421,
431,
432,
444,
574,
575,
653,
723,
787,
851,
852,
862,
863,
875,
1233,
1234,
1303,
1366,
1435,
1498,
1591,
1672,
1765,
1839,
1840,
1850,
1851,
1863,
2301,
2302,
2392,
2455,
2529,
2623,
2705,
2706,
2717,
2730,
2806,
2932,
3033,
3034,
3046,
3462,
3463,
3498,
3546,
3582,
3626,
3627,
3637,
3638,
3650,
4244,
4245,
4289,
4310,
4360,
4417,
4418,
4428,
4429,
4441,
4774,
4775,
4810,
4833,
4859,
4881,
4882,
4892,
4893,
4905,
5272,
5287,
5486,
5695,
5696,
5759,
5838,
5897,
5973,
5974,
5984,
5985,
5997,
6020,
6718,
6733,
6741,
6759,
6760,
6772,
7121,
7122,
7143,
7182,
7222,
7254,
7255,
7265,
7421,
7422,
7442
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7442,
"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.25017818808555603,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06414824724197388,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20099785923957825,
"rps_doc_frac_unique_words": 0.28762245178222656,
"rps_doc_mean_word_length": 5.281389236450195,
"rps_doc_num_sentences": 139,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.07373571395874,
"rps_doc_word_count": 1123,
"rps_doc_frac_chars_dupe_10grams": 0.12308210879564285,
"rps_doc_frac_chars_dupe_5grams": 0.3041645586490631,
"rps_doc_frac_chars_dupe_6grams": 0.2800539433956146,
"rps_doc_frac_chars_dupe_7grams": 0.23908278346061707,
"rps_doc_frac_chars_dupe_8grams": 0.19035576283931732,
"rps_doc_frac_chars_dupe_9grams": 0.1679312139749527,
"rps_doc_frac_chars_top_2gram": 0.037936270236968994,
"rps_doc_frac_chars_top_3gram": 0.033383920788764954,
"rps_doc_frac_chars_top_4gram": 0.02967458963394165,
"rps_doc_books_importance": -572.3088989257812,
"rps_doc_books_importance_length_correction": -572.3088989257812,
"rps_doc_openwebtext_importance": -360.1737976074219,
"rps_doc_openwebtext_importance_length_correction": -360.1737976074219,
"rps_doc_wikipedia_importance": -259.99346923828125,
"rps_doc_wikipedia_importance_length_correction": -259.99346923828125
},
"fasttext": {
"dclm": 0.16275036334991455,
"english": 0.787461519241333,
"fineweb_edu_approx": 1.7271862030029297,
"eai_general_math": 0.46058571338653564,
"eai_open_web_math": 0.05681509152054787,
"eai_web_code": 0.040854450315237045
}
}
|
{
"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": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,235,805,173,806,990,000
|
This is our old Q&A Site. Please post any new questions and answers at ask.wireshark.org.
Hello All
We use a few different packet analysis suites - Wireshark being one of the main ones. One of the biggest problems I have is Wireshark's often incorrect assumption about retransmitted packets. I know that NG and OpNet follow an entire TCP stream before assessing the number of retransmissions - but I'm not sure how WireShark handles it. Another issue we're having right now is a few of our probes are tapped into fiber uplinks - and as of a recent code change the packets aren't always being written onto disk in the correct order (maybe off just a few ms) - and this has thrown WS for a loop. I expected the number of OOS packets to go up, which it did, but the number of suspected retransmissions has gone through the roof. Is there a way to avoid this?
asked 29 Sep '10, 10:31
GeonJay's gravatar image
GeonJay
4705922
accept rate: 5%
Hi, you're saying you've "tapped into fiber uplinks" - how exactly do you do that? Are you using a full duplex fiber tap with 2 downlinks that are captured on two separate interfaces and then merged? Or do you use SPAN ports, or even link aggregation taps?
(29 Sep '10, 15:46) Jasper ♦♦
These are full duplex taps. To be honest they're one of my favorite desktop conversation items. I've cracked one open and it's literally a small mirror sitting at what I assume to be a 45 degree angle. We only trust TAPs at our core-to-dist border because of the high throughput (we have 10G bowties). So, two switches and two headend routers meshed gives you 4 connections, each consisting of two fibers for a total of 8 fibers - so we have 8 TAPs that feed a monstrous probe. The probe then aggregates all 8 interfaces into a single virtual interface from which we can grab captures.
(30 Sep '10, 05:38) GeonJay
I like FDX Taps to, especially the optical ones. I don't like aggregation taps as they sometimes introduce errors either to the production connection or in the connection to the capture device.
Problem with full duplex captures is that sometimes the single interfaces have difficulties "delivering" the packets to the merge process in time and get delayed because the other cards have higher priority or just "better luck" with IRQs etc. Then the merge reorders packets and you have stuff like for example a "200 OK" appearing before the "GET" request is issued. It throws Wireshark off, too.
(30 Sep '10, 05:53) Jasper ♦♦
This is our current problem. We use one of the well known probe manufacturers (rhymes with petsnout). As of the last two code releases we have major issues with aggregate interfaces in high volume network segments writing the packets to the disk out of order AND the AGG interfaces have started dropping segments. This is a code issue for sure - it didn't happen until the last 2 updates. That's the code change I mentioned in my earlier post - those OOO packets are part of our incorrectly reported retrans. Lately we've been unAGGing the interfaces and grabbing individual captures :(
(30 Sep '10, 06:45) GeonJay
Ouch, that's no fun, but unfortunately I think you'll have to get the code guys to fix things so that the automatic aggregations do work correctly again. There's not much that you can do to avoid OoO packets otherwise, and probably no way to fix things within Wireshark either. It will keep displaying suspected retransmissions messages since it sees a lower sequence number appearing after a higher sequence number in the packet before the current one.
(30 Sep '10, 07:21) Jasper ♦♦
You can read the code at http://anonsvn.wireshark.org/viewvc/trunk-1.4/epan/dissectors/packet-tcp.c?revision=33861&view=markup (that's the location for verion 1.4.0) - search for:
/* RETRANSMISSION/FAST RETRANSMISSION/OUT-OF-ORDER
That section explains how the decision to mark a packet as a retransmission/fast_retransmission/out-of-order is made.
You could turn off TCP Preferences Analyze Sequence Numbers, but then you'd miss so much interpretation of TCP issues...
Hope this helps.
permanent link
answered 29 Sep '10, 16:20
lchappell's gravatar image
lchappell ♦
1.2k2730
accept rate: 8%
Your answer
toggle preview
Follow this question
By Email:
Once you sign in you will be able to subscribe for any updates here
By RSS:
Answers
Answers and Comments
Markdown Basics
• *italic* or _italic_
• **bold** or __bold__
• link:[text](http://url.com/ "title")
• image?
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
Question tags:
×104
question asked: 29 Sep '10, 10:31
question was seen: 17,424 times
last updated: 30 Sep '10, 07:21
powered by OSQA
|
{
"url": "https://osqa-ask.wireshark.org/questions/354/suspected-retransmissions",
"source_domain": "osqa-ask.wireshark.org",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "33378",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VAKN2Q2TR5BORPITFFUPC2CJNECMEF6B",
"WARC-Concurrent-To": "<urn:uuid:ef9c0ed5-52a5-41b0-ac97-2fbf96e15a14>",
"WARC-Date": "2020-01-25T15:50:43Z",
"WARC-IP-Address": "104.26.10.240",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:BUJF2J25RZYKUVIJ6EYRJKMXEURYCOEU",
"WARC-Record-ID": "<urn:uuid:59ba5f79-74ab-47c0-a817-4f994c5aa4eb>",
"WARC-Target-URI": "https://osqa-ask.wireshark.org/questions/354/suspected-retransmissions",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f32d8b06-9e5a-4e47-b5d7-61c53906a865>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-141.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,
90,
91,
101,
102,
858,
859,
883,
884,
909,
910,
918,
926,
942,
943,
1200,
1201,
1231,
1232,
1818,
1819,
1847,
1848,
2042,
2043,
2442,
2443,
2473,
2474,
3061,
3062,
3090,
3091,
3545,
3546,
3576,
3577,
3757,
3758,
3809,
3810,
3928,
3929,
4050,
4051,
4068,
4069,
4084,
4085,
4112,
4113,
4140,
4141,
4153,
4162,
4178,
4179,
4191,
4206,
4207,
4228,
4229,
4239,
4240,
4308,
4309,
4317,
4318,
4326,
4327,
4348,
4349,
4365,
4366,
4391,
4416,
4457,
4502,
4535,
4625,
4664,
4665,
4680,
4681,
4686,
4687,
4721,
4722,
4754,
4755,
4787,
4788
],
"line_end_idx": [
90,
91,
101,
102,
858,
859,
883,
884,
909,
910,
918,
926,
942,
943,
1200,
1201,
1231,
1232,
1818,
1819,
1847,
1848,
2042,
2043,
2442,
2443,
2473,
2474,
3061,
3062,
3090,
3091,
3545,
3546,
3576,
3577,
3757,
3758,
3809,
3810,
3928,
3929,
4050,
4051,
4068,
4069,
4084,
4085,
4112,
4113,
4140,
4141,
4153,
4162,
4178,
4179,
4191,
4206,
4207,
4228,
4229,
4239,
4240,
4308,
4309,
4317,
4318,
4326,
4327,
4348,
4349,
4365,
4366,
4391,
4416,
4457,
4502,
4535,
4625,
4664,
4665,
4680,
4681,
4686,
4687,
4721,
4722,
4754,
4755,
4787,
4788,
4812
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4812,
"ccnet_original_nlines": 91,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3522833287715912,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03541472926735878,
"rps_doc_frac_lines_end_with_ellipsis": 0.010869570076465607,
"rps_doc_frac_no_alph_words": 0.25535881519317627,
"rps_doc_frac_unique_words": 0.5050632953643799,
"rps_doc_mean_word_length": 4.730379581451416,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.000931970018427819,
"rps_doc_unigram_entropy": 5.547713756561279,
"rps_doc_word_count": 790,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.008563020266592503,
"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.012041740119457245,
"rps_doc_frac_chars_top_3gram": 0.009365799836814404,
"rps_doc_frac_chars_top_4gram": 0.011774149723351002,
"rps_doc_books_importance": -515.8457641601562,
"rps_doc_books_importance_length_correction": -515.8457641601562,
"rps_doc_openwebtext_importance": -278.7137451171875,
"rps_doc_openwebtext_importance_length_correction": -278.7137451171875,
"rps_doc_wikipedia_importance": -179.04319763183594,
"rps_doc_wikipedia_importance_length_correction": -179.04319763183594
},
"fasttext": {
"dclm": 0.05744146928191185,
"english": 0.9267488718032837,
"fineweb_edu_approx": 1.4528659582138062,
"eai_general_math": 0.5393608212471008,
"eai_open_web_math": 0.21186912059783936,
"eai_web_code": 0.10479903221130371
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.656",
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,275,828,504,939,054,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 an existing program where a message (for example, an email, or some other kind of message) will be coming into a program on stdin. I know stdin is a FILE* but I'm somewhat confused as to what other special characteristics it has. I'm currently trying to add a check to the program, and handle the message differently if it contains a particular line (say, the word "hello"). The problem is, I need to search through the file for that word, but I still need stdin to point to its original location later in the program. An outline of the structure is below:
Currently:
//actual message body is coming in on stdin
read_message(char type)
{
//checks and setup
if(type == 'm')
{
//when it reaches this point, nothing has touched stdin
open_and_read(); //it will read from stdin
}
//else, never open the message
}
I want to add another check, but where I have to search the message body. Like so:
//actual message body is coming in on stdin
read_message(char type)
{
//checks and setup
//new check
if(message_contains_hello()) //some function that reads through the message looking for the word hello
{
other_functionality();
}
if(type == 'm')
{
//when it reaches this point, my new check may have modified stdin
open_and_read(); //it will read from stdin
}
//else, never open the message
}
The problem with this is that to search the message body, I have to touch the file pointer stdin. But, if I still need to open and read the message in the second if statement (if type = 'm'), stdin needs to point to the same place it was pointing at the start of the program. I tried creating a copy of the pointer but was only successful in creating a copy that would also modify stdin if modified itself.
I don't have a choice about how to pass the message - it has to stay on stdin. How can I access the actual body of a message coming in on stdin without modifying stdin itself? Basically, how can I read from it, and then have another function be able to read from the beginning of the message as well?
share|improve this question
4 Answers 4
up vote 2 down vote accepted
The short answer is that you can't. Once you read data from standard input, it's gone.
As such, your only real choice is to save what you read, and do the later processing on that rather than reading directly from standard input. If your later processing demands reading from a file, one possibility would be to structure this as two separate programs, with one acting as a filter for the other.
share|improve this answer
Well, darn. Thank you for the info! – VMills Nov 23 '11 at 17:53
Another possibility would be to use tmpfile and store all the data read to the FILE it gives you, then later rewind and read from there. – R.. Nov 23 '11 at 18:29
also unputc... :) – Prof. Falken Nov 23 '11 at 23:05
In general, you can only read bytes from stdin once. There is no fseek() functionality. To solve this problem, you can read the bytes into a buffer in your program, look at the bytes, and then pass the buffer off to another function that actually does something with the rest of the data.
Depending on your program, you may need to only read some of the data on stdin, or you may need to read all of it into that buffer. Either way, you will probably have to modify the existing code in the program in some way.
share|improve this answer
I know stdin is a FILE* but I'm somewhat confused as to what other special characteristics it has.
Well, it's opened for reading. But it's not guaranteed to be seekable, so you'll want to read in its contents entirely, then handle the resulting string (or list of strings, or whatever).
share|improve this answer
You should use and take advantage of buffering (<stdio.h> provides buffered I/O, but see setbuf).
My suggestion is to read your stdin line by line, e.g. using getline. Once you've read an entire line, you can do some minimal look-ahead inside.
Perhaps you might read more about parsing techniques.
share|improve this answer
setbuf is irrelevant to OP's question (and in fact completely useless). – R.. Nov 23 '11 at 18:29
Yes, except to ask for line buffering.... – Basile Starynkevitch Nov 23 '11 at 21:48
setbuf cannot ask for line buffering. Only setvbuf can. – R.. Nov 23 '11 at 23:54
It is the same man page and same URL. I designate a man page with its most usual name... – Basile Starynkevitch Nov 24 '11 at 1:25
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/8246564/c-file-pointers-multiple-reads-on-stdin",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "86827",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JLLSVFNTWJXJ4W2EFKRY5YEUV3CLK55Y",
"WARC-Concurrent-To": "<urn:uuid:ea065905-408d-472b-ad93-ba8fad7f6d67>",
"WARC-Date": "2015-03-30T10:19:05Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KDQGAI66RDEHXYBXJKL3U7IVPEY4QDQ7",
"WARC-Record-ID": "<urn:uuid:f62ac1c5-fdf5-40f6-a22e-d3d27ecfba5a>",
"WARC-Target-URI": "http://stackoverflow.com/questions/8246564/c-file-pointers-multiple-reads-on-stdin",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:09875e25-050b-4ca2-ae00-b4fb20f2a2a8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-14-71.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-14\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
722,
723,
734,
735,
779,
803,
805,
806,
825,
826,
842,
846,
906,
957,
961,
962,
993,
995,
996,
1079,
1080,
1124,
1148,
1150,
1151,
1170,
1171,
1183,
1288,
1290,
1318,
1320,
1321,
1337,
1341,
1416,
1463,
1467,
1468,
1499,
1501,
1502,
1909,
1910,
2211,
2212,
2240,
2241,
2253,
2254,
2283,
2284,
2371,
2372,
2681,
2682,
2708,
2713,
2779,
2784,
2948,
2953,
3007,
3008,
3297,
3298,
3521,
3522,
3548,
3549,
3648,
3649,
3837,
3838,
3864,
3865,
3963,
3964,
4110,
4111,
4165,
4166,
4192,
4197,
4296,
4301,
4387,
4392,
4475,
4480,
4612,
4613,
4625,
4626,
4628,
4636,
4637,
4715,
4716
],
"line_end_idx": [
25,
157,
158,
722,
723,
734,
735,
779,
803,
805,
806,
825,
826,
842,
846,
906,
957,
961,
962,
993,
995,
996,
1079,
1080,
1124,
1148,
1150,
1151,
1170,
1171,
1183,
1288,
1290,
1318,
1320,
1321,
1337,
1341,
1416,
1463,
1467,
1468,
1499,
1501,
1502,
1909,
1910,
2211,
2212,
2240,
2241,
2253,
2254,
2283,
2284,
2371,
2372,
2681,
2682,
2708,
2713,
2779,
2784,
2948,
2953,
3007,
3008,
3297,
3298,
3521,
3522,
3548,
3549,
3648,
3649,
3837,
3838,
3864,
3865,
3963,
3964,
4110,
4111,
4165,
4166,
4192,
4197,
4296,
4301,
4387,
4392,
4475,
4480,
4612,
4613,
4625,
4626,
4628,
4636,
4637,
4715,
4716,
4806
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4806,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0.002080729929730296,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.432251900434494,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025763360783457756,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21374045312404633,
"rps_doc_frac_unique_words": 0.35542169213294983,
"rps_doc_mean_word_length": 4.3481926918029785,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.0028625999111682177,
"rps_doc_unigram_entropy": 5.133606910705566,
"rps_doc_word_count": 830,
"rps_doc_frac_chars_dupe_10grams": 0.11249653995037079,
"rps_doc_frac_chars_dupe_5grams": 0.1521196961402893,
"rps_doc_frac_chars_dupe_6grams": 0.1399279534816742,
"rps_doc_frac_chars_dupe_7grams": 0.136880025267601,
"rps_doc_frac_chars_dupe_8grams": 0.11249653995037079,
"rps_doc_frac_chars_dupe_9grams": 0.11249653995037079,
"rps_doc_frac_chars_top_2gram": 0.02493765950202942,
"rps_doc_frac_chars_top_3gram": 0.011637570336461067,
"rps_doc_frac_chars_top_4gram": 0.014962590299546719,
"rps_doc_books_importance": -511.4527282714844,
"rps_doc_books_importance_length_correction": -511.4527282714844,
"rps_doc_openwebtext_importance": -271.9790954589844,
"rps_doc_openwebtext_importance_length_correction": -271.9790954589844,
"rps_doc_wikipedia_importance": -212.61070251464844,
"rps_doc_wikipedia_importance_length_correction": -212.61070251464844
},
"fasttext": {
"dclm": 0.36685436964035034,
"english": 0.9240408539772034,
"fineweb_edu_approx": 1.5966323614120483,
"eai_general_math": 0.06945555657148361,
"eai_open_web_math": 0.1521921157836914,
"eai_web_code": 0.014865820296108723
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,380,735,899,503,483,000
|
Titelbild Game Hero
Diese Seite verwendet eigene Cookies und Cookies von Dritten damit wir die bestmögliche Bedienbarkeit und Funktionalität bieten können. Wenn Sie auf diesen Seiten surfen, stimmen Sie der Verwendung von Cookies zu. Mehr erfahren OK
share
C64 Emulation am Nintendo DS
Was wird benötigt?
• Flash-Karte für Nintendo DS
• Systemdateien für Flashkarte
• FrodoDS
Close
LoadingBild wird geladen...
Picture
Hinweis: Dies ist keine Anleitung für Raubkopierer! Hier wird lediglich erklärt wie man legale Homebrew-Programme nutzt.
Wer noch einen Nintendo DS (oder Lite) besitzt, der kann ohne große Mühe die tollen C64-Klassicker darauf spielen. Die Emulation eines C64-Systems auf den NintendoDS ist verhältnismäßig einfach und auch nicht teuer. Einzige Voraussetzung ist ein spezielles Modul mit Speicherkarte auf der der C64-Emulator installiert werden kann. Im meinem Fall kommt eine M3 zum Einsatz die um ca 20€ zu bekommen ist. Eine Micro-SD Speicherkarte wird selbstverständlich auch benötigt, welche in vielen Fällen schon dabei ist. Es gibt sehr viele, auch günstigere Alternativen, aber auch wenn eine andere Karte zum Einsatz kommt, sollte sich der Weg der Installation bzw. Einrichtung nicht allzu viel von dieser Anleitung unterscheiden.
M3
Klicke auf das Bild zum Vergrößern
Das M3-Modul ist noch nicht betriebsbereit. Es werden die Systemdateien benötigt, die man hier herunterladen kann. Das heruntergeladene Paket enthält den Ordner "System" der direkt auf die Speicherkarte kopiert werden muss. Zum Glück liegt den Modul ein Kartenlesegerät bei, das es ermöglicht die Karte unter allen gängigen Betriebsystemen zu beschreiben. Befinden sich die Systemdateien auf der Karte ist das Modul einsatzbereit. Beim Einschalten des NintendoDS sollte als erstes die Sprachauswahl erscheinen und schließlich das Menu.
M3 Menu
Zuerst müssen wir aber noch den C64-Emulator FrodoDS installieren, den man hier kostenlos runterladen kann. Die Datei Frodo.nds die sich im Paket befindet muss jetzt auf die Speicherkarte kopiert werden, allerdings nicht in den Root-Ordner sondern im Verzeichnis "NDS" das zuerst erstellt werden muss. Jetzt sollte der Inhalt der Speicherkarte wie in folgender Liste aussehen.
Rootverzeichnis
|_System
|_NDS
Jetzt ist unser Nintendo DS bereit für die Emulation. Natürlich brauchen wir noch ein paar C64-Roms die wir in das Verzeichnis "rd" kopieren. Da dieses Verzeichnis nicht existiert, erstellen wir es (Im Rootverzeichnis). Wir schalten den NintendoDS ein und im Hauptmenu wählen wir die erste Option oben Links (NDS). Daraufhin werden alle Spiele/Programme aufgelistet die sich im Ordner "NDS" befinden. In unserem Fall starten wir FrodoDS. Jetzt wählen wir den Slot in dem sich unsere Karte befindet, also Slot-1und schon startet Frodo und zeigt das gewohnte Startbild.
Start Screen
Klicke auf das Bild zum Vergrößern
Um nun ein C64-Rom auszuwählen drücken wir auf die "L-Taste" unseres Nintendos. Sollte keine Liste mit den Roms erscheinen, dann wurden diese nicht in das Verzeichnis "rd" kopiert. Mit der "A-Taste" wird das gewünschte Rom ausgewählt. Es scheint so als hätte sich nichts getan, aber im Hintergrund wurde unsere virtuelle Diskette in das Laufwerk 8 eingelegt. Nun könnte man die üblichen C64-Befehle eingeben um das Spiel zu starten. Schneller geht es mit der "R-Taste". Diese bewirkt, daß der Befehl load"*",8,1 automatisch eingegeben wird. Nach dem Laden wird schließlich der Befehl "Run" eingegeben der das geladene Programm/Spiel ausführt.
Giana Sisters M3
Klicke auf das Bild zum Vergrößern
Die Steuerung ist recht simpel. Die Tasten A und B dienen als Feuerknöpfe und das Steuerkreuz bewegt den Held in die gewünschte Richtung. Sollte es notwendig sein den Joystick-Port zu wechseln, dann drücke auf die Taste "Select" um zwischen Port 1 und 2 umzuschalten. Um das Spiel/Programm zu beenden und zum Startbildschirm zurückzukehren genügt ein Tastendruck auf "Start". Dies löst einen Reset aus.
Fazit: FrodoDS ist ein recht stabiler und einfacher C64-Emulator, dennoch würde ich mir noch ein paar Optionen wünschen, wie z.B. Screenshot-Funktion oder die Emulation von Speichererweiterungen, so wie das große Vorbild Vice auf anderen Systemen.
Zurück
Besucher total: 1836521 Heute: 333
|
{
"url": "http://mingos-commodorepage.com/tutorials/c64emuds.php?title=C64%20Emulation%20auf%20den%20NintendoDS%20mit%20FrodoDS",
"source_domain": "mingos-commodorepage.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "23038",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CRRB6JYLQCO2OITFFFNP37OPVYRMOTQJ",
"WARC-Concurrent-To": "<urn:uuid:a0eab024-0fad-470b-8eff-3d73385a0331>",
"WARC-Date": "2017-06-26T20:46:10Z",
"WARC-IP-Address": "52.58.88.229",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:3KVIU3V7GTO7RZV6PXT2K3MHIWE5FNEA",
"WARC-Record-ID": "<urn:uuid:aa02e587-0a16-4dfb-aa18-7d1deeb354a5>",
"WARC-Target-URI": "http://mingos-commodorepage.com/tutorials/c64emuds.php?title=C64%20Emulation%20auf%20den%20NintendoDS%20mit%20FrodoDS",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eac90bd0-465a-45ec-affa-4f1c9a4105f7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-147-9.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,
21,
252,
258,
259,
288,
289,
308,
340,
373,
385,
391,
419,
427,
428,
549,
550,
1270,
1271,
1274,
1309,
1310,
1846,
1847,
1855,
1856,
2233,
2234,
2250,
2259,
2265,
2266,
2834,
2835,
2848,
2883,
2884,
3527,
3528,
3545,
3580,
3581,
3984,
3985,
4233,
4234,
4241
],
"line_end_idx": [
21,
252,
258,
259,
288,
289,
308,
340,
373,
385,
391,
419,
427,
428,
549,
550,
1270,
1271,
1274,
1309,
1310,
1846,
1847,
1855,
1856,
2233,
2234,
2250,
2259,
2265,
2266,
2834,
2835,
2848,
2883,
2884,
3527,
3528,
3545,
3580,
3581,
3984,
3985,
4233,
4234,
4241,
4275
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4275,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.019255459308624268,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03851091116666794,
"rps_doc_frac_lines_end_with_ellipsis": 0.021276600658893585,
"rps_doc_frac_no_alph_words": 0.16944800317287445,
"rps_doc_frac_unique_words": 0.5253164768218994,
"rps_doc_mean_word_length": 5.5981011390686035,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.0012836999958381057,
"rps_doc_unigram_entropy": 5.3911261558532715,
"rps_doc_word_count": 632,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04465800151228905,
"rps_doc_frac_chars_dupe_6grams": 0.02656867913901806,
"rps_doc_frac_chars_dupe_7grams": 0.01808932051062584,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01130582019686699,
"rps_doc_frac_chars_top_3gram": 0.010175240226089954,
"rps_doc_frac_chars_top_4gram": 0.01356699038296938,
"rps_doc_books_importance": -418.2669982910156,
"rps_doc_books_importance_length_correction": -418.2669982910156,
"rps_doc_openwebtext_importance": -221.6111602783203,
"rps_doc_openwebtext_importance_length_correction": -221.6111602783203,
"rps_doc_wikipedia_importance": -154.06460571289062,
"rps_doc_wikipedia_importance_length_correction": -154.06460571289062
},
"fasttext": {
"dclm": 0.8575549125671387,
"english": 0.00036577999708242714,
"fineweb_edu_approx": 1.703170657157898,
"eai_general_math": 0.004501159768551588,
"eai_open_web_math": 0.5795109272003174,
"eai_web_code": 0.3306041359901428
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,189,712,270,725,873,000
|
;;; auth-source.el --- authentication sources for Gnus and Emacs ;; Copyright (C) 2008-2013 Free Software Foundation, Inc. ;; Author: Ted Zlatanov ;; Keywords: news ;; This file is part of GNU Emacs. ;; GNU Emacs is free software: you can redistribute it and/or modify ;; it under the terms of the GNU General Public License as published by ;; the Free Software Foundation, either version 3 of the License, or ;; (at your option) any later version. ;; GNU Emacs is distributed in the hope that it will be useful, ;; but WITHOUT ANY WARRANTY; without even the implied warranty of ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ;; GNU General Public License for more details. ;; You should have received a copy of the GNU General Public License ;; along with GNU Emacs. If not, see . ;;; Commentary: ;; This is the auth-source.el package. It lets users tell Gnus how to ;; authenticate in a single place. Simplicity is the goal. Instead ;; of providing 5000 options, we'll stick to simple, easy to ;; understand options. ;; See the auth.info Info documentation for details. ;; TODO: ;; - never decode the backend file unless it's necessary ;; - a more generic way to match backends and search backend contents ;; - absorb netrc.el and simplify it ;; - protect passwords better ;; - allow creating and changing netrc lines (not files) e.g. change a password ;;; Code: (require 'password-cache) (require 'mm-util) (require 'gnus-util) (eval-when-compile (require 'cl)) (require 'eieio) (autoload 'secrets-create-item "secrets") (autoload 'secrets-delete-item "secrets") (autoload 'secrets-get-alias "secrets") (autoload 'secrets-get-attributes "secrets") (autoload 'secrets-get-secret "secrets") (autoload 'secrets-list-collections "secrets") (autoload 'secrets-search-items "secrets") (autoload 'rfc2104-hash "rfc2104") (autoload 'plstore-open "plstore") (autoload 'plstore-find "plstore") (autoload 'plstore-put "plstore") (autoload 'plstore-delete "plstore") (autoload 'plstore-save "plstore") (autoload 'plstore-get-file "plstore") (autoload 'epg-make-context "epg") (autoload 'epg-context-set-passphrase-callback "epg") (autoload 'epg-decrypt-string "epg") (autoload 'epg-context-set-armor "epg") (autoload 'epg-encrypt-string "epg") (autoload 'help-mode "help-mode" nil t) (defvar secrets-enabled) (defgroup auth-source nil "Authentication sources." :version "23.1" ;; No Gnus :group 'gnus) ;;;###autoload (defcustom auth-source-cache-expiry 7200 "How many seconds passwords are cached, or nil to disable expiring. Overrides `password-cache-expiry' through a let-binding." :version "24.1" :group 'auth-source :type '(choice (const :tag "Never" nil) (const :tag "All Day" 86400) (const :tag "2 Hours" 7200) (const :tag "30 Minutes" 1800) (integer :tag "Seconds"))) ;; The slots below correspond with the `auth-source-search' spec, ;; so a backend with :host set, for instance, would match only ;; searches for that host. Normally they are nil. (defclass auth-source-backend () ((type :initarg :type :initform 'netrc :type symbol :custom symbol :documentation "The backend type.") (source :initarg :source :type string :custom string :documentation "The backend source.") (host :initarg :host :initform t :type t :custom string :documentation "The backend host.") (user :initarg :user :initform t :type t :custom string :documentation "The backend user.") (port :initarg :port :initform t :type t :custom string :documentation "The backend protocol.") (data :initarg :data :initform nil :documentation "Internal backend data.") (create-function :initarg :create-function :initform ignore :type function :custom function :documentation "The create function.") (search-function :initarg :search-function :initform ignore :type function :custom function :documentation "The search function."))) (defcustom auth-source-protocols '((imap "imap" "imaps" "143" "993") (pop3 "pop3" "pop" "pop3s" "110" "995") (ssh "ssh" "22") (sftp "sftp" "115") (smtp "smtp" "25")) "List of authentication protocols and their names" :group 'auth-source :version "23.2" ;; No Gnus :type '(repeat :tag "Authentication Protocols" (cons :tag "Protocol Entry" (symbol :tag "Protocol") (repeat :tag "Names" (string :tag "Name"))))) ;; Generate all the protocols in a format Customize can use. ;; TODO: generate on the fly from auth-source-protocols (defconst auth-source-protocols-customize (mapcar (lambda (a) (let ((p (car-safe a))) (list 'const :tag (upcase (symbol-name p)) p))) auth-source-protocols)) (defvar auth-source-creation-defaults nil "Defaults for creating token values. Usually let-bound.") (defvar auth-source-creation-prompts nil "Default prompts for token values. Usually let-bound.") (make-obsolete 'auth-source-hide-passwords nil "Emacs 24.1") (defcustom auth-source-save-behavior 'ask "If set, auth-source will respect it for save behavior." :group 'auth-source :version "23.2" ;; No Gnus :type `(choice :tag "auth-source new token save behavior" (const :tag "Always save" t) (const :tag "Never save" nil) (const :tag "Ask" ask))) ;; TODO: make the default (setq auth-source-netrc-use-gpg-tokens `((,(if (boundp 'epa-file-auto-mode-alist-entry) (car (symbol-value 'epa-file-auto-mode-alist-entry)) "\\.gpg\\'") never) (t gpg))) ;; TODO: or maybe leave as (setq auth-source-netrc-use-gpg-tokens 'never) (defcustom auth-source-netrc-use-gpg-tokens 'never "Set this to tell auth-source when to create GPG password tokens in netrc files. It's either an alist or `never'. Note that if EPA/EPG is not available, this should NOT be used." :group 'auth-source :version "23.2" ;; No Gnus :type `(choice (const :tag "Always use GPG password tokens" (t gpg)) (const :tag "Never use GPG password tokens" never) (repeat :tag "Use a lookup list" (list (choice :tag "Matcher" (const :tag "Match anything" t) (const :tag "The EPA encrypted file extensions" ,(if (boundp 'epa-file-auto-mode-alist-entry) (car (symbol-value 'epa-file-auto-mode-alist-entry)) "\\.gpg\\'")) (regexp :tag "Regular expression")) (choice :tag "What to do" (const :tag "Save GPG-encrypted password tokens" gpg) (const :tag "Don't encrypt tokens" never)))))) (defvar auth-source-magic "auth-source-magic ") (defcustom auth-source-do-cache t "Whether auth-source should cache information with `password-cache'." :group 'auth-source :version "23.2" ;; No Gnus :type `boolean) (defcustom auth-source-debug nil "Whether auth-source should log debug messages. If the value is nil, debug messages are not logged. If the value is t, debug messages are logged with `message'. In that case, your authentication data will be in the clear (except for passwords). If the value is a function, debug messages are logged by calling that function using the same arguments as `message'." :group 'auth-source :version "23.2" ;; No Gnus :type `(choice :tag "auth-source debugging mode" (const :tag "Log using `message' to the *Messages* buffer" t) (const :tag "Log all trivia with `message' to the *Messages* buffer" trivia) (function :tag "Function that takes arguments like `message'") (const :tag "Don't log anything" nil))) (defcustom auth-sources '("~/.authinfo" "~/.authinfo.gpg" "~/.netrc") "List of authentication sources. The default will get login and password information from \"~/.authinfo.gpg\", which you should set up with the EPA/EPG packages to be encrypted. If that file doesn't exist, it will try the unencrypted version \"~/.authinfo\" and the famous \"~/.netrc\" file. See the auth.info manual for details. Each entry is the authentication type with optional properties. It's best to customize this with `M-x customize-variable' because the choices can get pretty complex." :group 'auth-source :version "24.1" ;; No Gnus :type `(repeat :tag "Authentication Sources" (choice (string :tag "Just a file") (const :tag "Default Secrets API Collection" 'default) (const :tag "Login Secrets API Collection" "secrets:Login") (const :tag "Temp Secrets API Collection" "secrets:session") (const :tag "Default internet Mac OS Keychain" macos-keychain-internet) (const :tag "Default generic Mac OS Keychain" macos-keychain-generic) (list :tag "Source definition" (const :format "" :value :source) (choice :tag "Authentication backend choice" (string :tag "Authentication Source (file)") (list :tag "Secret Service API/KWallet/GNOME Keyring" (const :format "" :value :secrets) (choice :tag "Collection to use" (string :tag "Collection name") (const :tag "Default" 'default) (const :tag "Login" "Login") (const :tag "Temporary" "session"))) (list :tag "Mac OS internet Keychain" (const :format "" :value :macos-keychain-internet) (choice :tag "Collection to use" (string :tag "internet Keychain path") (const :tag "default" 'default))) (list :tag "Mac OS generic Keychain" (const :format "" :value :macos-keychain-generic) (choice :tag "Collection to use" (string :tag "generic Keychain path") (const :tag "default" 'default)))) (repeat :tag "Extra Parameters" :inline t (choice :tag "Extra parameter" (list :tag "Host" (const :format "" :value :host) (choice :tag "Host (machine) choice" (const :tag "Any" t) (regexp :tag "Regular expression"))) (list :tag "Protocol" (const :format "" :value :port) (choice :tag "Protocol" (const :tag "Any" t) ,@auth-source-protocols-customize)) (list :tag "User" :inline t (const :format "" :value :user) (choice :tag "Personality/Username" (const :tag "Any" t) (string :tag "Name"))))))))) (defcustom auth-source-gpg-encrypt-to t "List of recipient keys that `authinfo.gpg' encrypted to. If the value is not a list, symmetric encryption will be used." :group 'auth-source :version "24.1" ;; No Gnus :type '(choice (const :tag "Symmetric encryption" t) (repeat :tag "Recipient public keys" (string :tag "Recipient public key")))) ;; temp for debugging ;; (unintern 'auth-source-protocols) ;; (unintern 'auth-sources) ;; (customize-variable 'auth-sources) ;; (setq auth-sources nil) ;; (format "%S" auth-sources) ;; (customize-variable 'auth-source-protocols) ;; (setq auth-source-protocols nil) ;; (format "%S" auth-source-protocols) ;; (auth-source-pick nil :host "a" :port 'imap) ;; (auth-source-user-or-password "login" "imap.myhost.com" 'imap) ;; (auth-source-user-or-password "password" "imap.myhost.com" 'imap) ;; (auth-source-user-or-password-imap "login" "imap.myhost.com") ;; (auth-source-user-or-password-imap "password" "imap.myhost.com") ;; (auth-source-protocol-defaults 'imap) ;; (let ((auth-source-debug 'debug)) (auth-source-do-debug "hello")) ;; (let ((auth-source-debug t)) (auth-source-do-debug "hello")) ;; (let ((auth-source-debug nil)) (auth-source-do-debug "hello")) (defun auth-source-do-debug (&rest msg) (when auth-source-debug (apply 'auth-source-do-warn msg))) (defun auth-source-do-trivia (&rest msg) (when (or (eq auth-source-debug 'trivia) (functionp auth-source-debug)) (apply 'auth-source-do-warn msg))) (defun auth-source-do-warn (&rest msg) (apply ;; set logger to either the function in auth-source-debug or 'message ;; note that it will be 'message if auth-source-debug is nil (if (functionp auth-source-debug) auth-source-debug 'message) msg)) ;; (auth-source-read-char-choice "enter choice? " '(?a ?b ?q)) (defun auth-source-read-char-choice (prompt choices) "Read one of CHOICES by `read-char-choice', or `read-char'. `dropdown-list' support is disabled because it doesn't work reliably. Only one of CHOICES will be returned. The PROMPT is augmented with \"[a/b/c] \" if CHOICES is '\(?a ?b ?c\)." (when choices (let* ((prompt-choices (apply 'concat (loop for c in choices collect (format "%c/" c)))) (prompt-choices (concat "[" (substring prompt-choices 0 -1) "] ")) (full-prompt (concat prompt prompt-choices)) k) (while (not (memq k choices)) (setq k (cond ((fboundp 'read-char-choice) (read-char-choice full-prompt choices)) (t (message "%s" full-prompt) (setq k (read-char)))))) k))) ;; (auth-source-pick nil :host "any" :port 'imap :user "joe") ;; (auth-source-pick t :host "any" :port 'imap :user "joe") ;; (setq auth-sources '((:source (:secrets default) :host t :port t :user "joe") ;; (:source (:secrets "session") :host t :port t :user "joe") ;; (:source (:secrets "Login") :host t :port t) ;; (:source "~/.authinfo.gpg" :host t :port t))) ;; (setq auth-sources '((:source (:secrets default) :host t :port t :user "joe") ;; (:source (:secrets "session") :host t :port t :user "joe") ;; (:source (:secrets "Login") :host t :port t) ;; )) ;; (setq auth-sources '((:source "~/.authinfo.gpg" :host t :port t))) ;; (auth-source-backend-parse "myfile.gpg") ;; (auth-source-backend-parse 'default) ;; (auth-source-backend-parse "secrets:Login") ;; (auth-source-backend-parse 'macos-keychain-internet) ;; (auth-source-backend-parse 'macos-keychain-generic) ;; (auth-source-backend-parse "macos-keychain-internet:/path/here.keychain") ;; (auth-source-backend-parse "macos-keychain-generic:/path/here.keychain") (defun auth-source-backend-parse (entry) "Creates an auth-source-backend from an ENTRY in `auth-sources'." (auth-source-backend-parse-parameters entry (cond ;; take 'default and recurse to get it as a Secrets API default collection ;; matching any user, host, and protocol ((eq entry 'default) (auth-source-backend-parse '(:source (:secrets default)))) ;; take secrets:XYZ and recurse to get it as Secrets API collection "XYZ" ;; matching any user, host, and protocol ((and (stringp entry) (string-match "^secrets:\\(.+\\)" entry)) (auth-source-backend-parse `(:source (:secrets ,(match-string 1 entry))))) ;; take 'macos-keychain-internet and recurse to get it as a Mac OS ;; Keychain collection matching any user, host, and protocol ((eq entry 'macos-keychain-internet) (auth-source-backend-parse '(:source (:macos-keychain-internet default)))) ;; take 'macos-keychain-generic and recurse to get it as a Mac OS ;; Keychain collection matching any user, host, and protocol ((eq entry 'macos-keychain-generic) (auth-source-backend-parse '(:source (:macos-keychain-generic default)))) ;; take macos-keychain-internet:XYZ and recurse to get it as MacOS ;; Keychain "XYZ" matching any user, host, and protocol ((and (stringp entry) (string-match "^macos-keychain-internet:\\(.+\\)" entry)) (auth-source-backend-parse `(:source (:macos-keychain-internet ,(match-string 1 entry))))) ;; take macos-keychain-generic:XYZ and recurse to get it as MacOS ;; Keychain "XYZ" matching any user, host, and protocol ((and (stringp entry) (string-match "^macos-keychain-generic:\\(.+\\)" entry)) (auth-source-backend-parse `(:source (:macos-keychain-generic ,(match-string 1 entry))))) ;; take just a file name and recurse to get it as a netrc file ;; matching any user, host, and protocol ((stringp entry) (auth-source-backend-parse `(:source ,entry))) ;; a file name with parameters ((stringp (plist-get entry :source)) (if (equal (file-name-extension (plist-get entry :source)) "plist") (auth-source-backend (plist-get entry :source) :source (plist-get entry :source) :type 'plstore :search-function 'auth-source-plstore-search :create-function 'auth-source-plstore-create :data (plstore-open (plist-get entry :source))) (auth-source-backend (plist-get entry :source) :source (plist-get entry :source) :type 'netrc :search-function 'auth-source-netrc-search :create-function 'auth-source-netrc-create))) ;; the MacOS Keychain ((and (not (null (plist-get entry :source))) ; the source must not be nil (listp (plist-get entry :source)) ; and it must be a list (or (plist-get (plist-get entry :source) :macos-keychain-generic) (plist-get (plist-get entry :source) :macos-keychain-internet))) (let* ((source-spec (plist-get entry :source)) (keychain-generic (plist-get source-spec :macos-keychain-generic)) (keychain-type (if keychain-generic 'macos-keychain-generic 'macos-keychain-internet)) (source (plist-get source-spec (if keychain-generic :macos-keychain-generic :macos-keychain-internet)))) (when (symbolp source) (setq source (symbol-name source))) (auth-source-backend (format "Mac OS Keychain (%s)" source) :source source :type keychain-type :search-function 'auth-source-macos-keychain-search :create-function 'auth-source-macos-keychain-create))) ;; the Secrets API. We require the package, in order to have a ;; defined value for `secrets-enabled'. ((and (not (null (plist-get entry :source))) ; the source must not be nil (listp (plist-get entry :source)) ; and it must be a list (require 'secrets nil t) ; and we must load the Secrets API secrets-enabled) ; and that API must be enabled ;; the source is either the :secrets key in ENTRY or ;; if that's missing or nil, it's "session" (let ((source (or (plist-get (plist-get entry :source) :secrets) "session"))) ;; if the source is a symbol, we look for the alias named so, ;; and if that alias is missing, we use "Login" (when (symbolp source) (setq source (or (secrets-get-alias (symbol-name source)) "Login"))) (if (featurep 'secrets) (auth-source-backend (format "Secrets API (%s)" source) :source source :type 'secrets :search-function 'auth-source-secrets-search :create-function 'auth-source-secrets-create) (auth-source-do-warn "auth-source-backend-parse: no Secrets API, ignoring spec: %S" entry) (auth-source-backend (format "Ignored Secrets API (%s)" source) :source "" :type 'ignore)))) ;; none of them (t (auth-source-do-warn "auth-source-backend-parse: invalid backend spec: %S" entry) (auth-source-backend "Empty" :source "" :type 'ignore))))) (defun auth-source-backend-parse-parameters (entry backend) "Fills in the extra auth-source-backend parameters of ENTRY. Using the plist ENTRY, get the :host, :port, and :user search parameters." (let ((entry (if (stringp entry) nil entry)) val) (when (setq val (plist-get entry :host)) (oset backend host val)) (when (setq val (plist-get entry :user)) (oset backend user val)) (when (setq val (plist-get entry :port)) (oset backend port val))) backend) ;; (mapcar 'auth-source-backend-parse auth-sources) (defun* auth-source-search (&rest spec &key type max host user port secret require create delete &allow-other-keys) "Search or modify authentication backends according to SPEC. This function parses `auth-sources' for matches of the SPEC plist. It can optionally create or update an authentication token if requested. A token is just a standard Emacs property list with a :secret property that can be a function; all the other properties will always hold scalar values. Typically the :secret property, if present, contains a password. Common search keys are :max, :host, :port, and :user. In addition, :create specifies how tokens will be or created. Finally, :type can specify which backend types you want to check. A string value is always matched literally. A symbol is matched as its string value, literally. All the SPEC values can be single values (symbol or string) or lists thereof (in which case any of the search terms matches). :create t means to create a token if possible. A new token will be created if no matching tokens were found. The new token will have only the keys the backend requires. For the netrc backend, for instance, that's the user, host, and port keys. Here's an example: \(let ((auth-source-creation-defaults '((user . \"defaultUser\") (A . \"default A\")))) (auth-source-search :host \"mine\" :type 'netrc :max 1 :P \"pppp\" :Q \"qqqq\" :create t)) which says: \"Search for any entry matching host 'mine' in backends of type 'netrc', maximum one result. Create a new entry if you found none. The netrc backend will automatically require host, user, and port. The host will be 'mine'. We prompt for the user with default 'defaultUser' and for the port without a default. We will not prompt for A, Q, or P. The resulting token will only have keys user, host, and port.\" :create '(A B C) also means to create a token if possible. The behavior is like :create t but if the list contains any parameter, that parameter will be required in the resulting token. The value for that parameter will be obtained from the search parameters or from user input. If any queries are needed, the alist `auth-source-creation-defaults' will be checked for the default value. If the user, host, or port are missing, the alist `auth-source-creation-prompts' will be used to look up the prompts IN THAT ORDER (so the 'user prompt will be queried first, then 'host, then 'port, and finally 'secret). Each prompt string can use %u, %h, and %p to show the user, host, and port. Here's an example: \(let ((auth-source-creation-defaults '((user . \"defaultUser\") (A . \"default A\"))) (auth-source-creation-prompts '((password . \"Enter IMAP password for %h:%p: \")))) (auth-source-search :host '(\"nonesuch\" \"twosuch\") :type 'netrc :max 1 :P \"pppp\" :Q \"qqqq\" :create '(A B Q))) which says: \"Search for any entry matching host 'nonesuch' or 'twosuch' in backends of type 'netrc', maximum one result. Create a new entry if you found none. The netrc backend will automatically require host, user, and port. The host will be 'nonesuch' and Q will be 'qqqq'. We prompt for the password with the shown prompt. We will not prompt for Q. The resulting token will have keys user, host, port, A, B, and Q. It will not have P with any value, even though P is used in the search to find only entries that have P set to 'pppp'.\" When multiple values are specified in the search parameter, the user is prompted for which one. So :host (X Y Z) would ask the user to choose between X, Y, and Z. This creation can fail if the search was not specific enough to create a new token (it's up to the backend to decide that). You should `catch' the backend-specific error as usual. Some backends (netrc, at least) will prompt the user rather than throw an error. :require (A B C) means that only results that contain those tokens will be returned. Thus for instance requiring :secret will ensure that any results will actually have a :secret property. :delete t means to delete any found entries. nil by default. Use `auth-source-delete' in ELisp code instead of calling `auth-source-search' directly with this parameter. :type (X Y Z) will check only those backend types. 'netrc and 'secrets are the only ones supported right now. :max N means to try to return at most N items (defaults to 1). When 0 the function will return just t or nil to indicate if any matches were found. More than N items may be returned, depending on the search and the backend. :host (X Y Z) means to match only hosts X, Y, or Z according to the match rules above. Defaults to t. :user (X Y Z) means to match only users X, Y, or Z according to the match rules above. Defaults to t. :port (P Q R) means to match only protocols P, Q, or R. Defaults to t. :K (V1 V2 V3) for any other key K will match values V1, V2, or V3 (note the match rules above). The return value is a list with at most :max tokens. Each token is a plist with keys :backend :host :port :user, plus any other keys provided by the backend (notably :secret). But note the exception for :max 0, which see above. The token can hold a :save-function key. If you call that, the user will be prompted to save the data to the backend. You can't request that this should happen right after creation, because `auth-source-search' has no way of knowing if the token is actually useful. So the caller must arrange to call this function. The token's :secret key can hold a function. In that case you must call it to obtain the actual value." (let* ((backends (mapcar 'auth-source-backend-parse auth-sources)) (max (or max 1)) (ignored-keys '(:require :create :delete :max)) (keys (loop for i below (length spec) by 2 unless (memq (nth i spec) ignored-keys) collect (nth i spec))) (cached (auth-source-remembered-p spec)) ;; note that we may have cached results but found is still nil ;; (there were no results from the search) (found (auth-source-recall spec)) filtered-backends accessor-key backend) (if (and cached auth-source-do-cache) (auth-source-do-debug "auth-source-search: found %d CACHED results matching %S" (length found) spec) (assert (or (eq t create) (listp create)) t "Invalid auth-source :create parameter (must be t or a list): %s %s") (assert (listp require) t "Invalid auth-source :require parameter (must be a list): %s") (setq filtered-backends (copy-sequence backends)) (dolist (backend backends) (dolist (key keys) ;; ignore invalid slots (condition-case signal (unless (eval `(auth-source-search-collection (plist-get spec key) (oref backend ,key))) (setq filtered-backends (delq backend filtered-backends)) (return)) (invalid-slot-name)))) (auth-source-do-trivia "auth-source-search: found %d backends matching %S" (length filtered-backends) spec) ;; (debug spec "filtered" filtered-backends) ;; First go through all the backends without :create, so we can ;; query them all. (setq found (auth-source-search-backends filtered-backends spec ;; to exit early max ;; create is always nil here nil delete require)) (auth-source-do-debug "auth-source-search: found %d results (max %d) matching %S" (length found) max spec) ;; If we didn't find anything, then we allow the backend(s) to ;; create the entries. (when (and create (not found)) (setq found (auth-source-search-backends filtered-backends spec ;; to exit early max create delete require)) (auth-source-do-debug "auth-source-search: CREATED %d results (max %d) matching %S" (length found) max spec)) ;; note we remember the lack of result too, if it's applicable (when auth-source-do-cache (auth-source-remember spec found))) found)) (defun auth-source-search-backends (backends spec max create delete require) (let (matches) (dolist (backend backends) (when (> max (length matches)) ; when we need more matches... (let* ((bmatches (apply (slot-value backend 'search-function) :backend backend :type (slot-value backend :type) ;; note we're overriding whatever the spec ;; has for :require, :create, and :delete :require require :create create :delete delete spec))) (when bmatches (auth-source-do-trivia "auth-source-search-backend: got %d (max %d) in %s:%s matching %S" (length bmatches) max (slot-value backend :type) (slot-value backend :source) spec) (setq matches (append matches bmatches)))))) matches)) ;; (auth-source-search :max 1) ;; (funcall (plist-get (nth 0 (auth-source-search :max 1)) :secret)) ;; (auth-source-search :host "nonesuch" :type 'netrc :K 1) ;; (auth-source-search :host "nonesuch" :type 'secrets) (defun* auth-source-delete (&rest spec &key delete &allow-other-keys) "Delete entries from the authentication backends according to SPEC. Calls `auth-source-search' with the :delete property in SPEC set to t. The backend may not actually delete the entries. Returns the deleted entries." (auth-source-search (plist-put spec :delete t))) (defun auth-source-search-collection (collection value) "Returns t is VALUE is t or COLLECTION is t or COLLECTION contains VALUE." (when (and (atom collection) (not (eq t collection))) (setq collection (list collection))) ;; (debug :collection collection :value value) (or (eq collection t) (eq value t) (equal collection value) (member value collection))) (defvar auth-source-netrc-cache nil) (defun auth-source-forget-all-cached () "Forget all cached auth-source data." (interactive) (loop for sym being the symbols of password-data ;; when the symbol name starts with auth-source-magic when (string-match (concat "^" auth-source-magic) (symbol-name sym)) ;; remove that key do (password-cache-remove (symbol-name sym))) (setq auth-source-netrc-cache nil)) (defun auth-source-format-cache-entry (spec) "Format SPEC entry to put it in the password cache." (concat auth-source-magic (format "%S" spec))) (defun auth-source-remember (spec found) "Remember FOUND search results for SPEC." (let ((password-cache-expiry auth-source-cache-expiry)) (password-cache-add (auth-source-format-cache-entry spec) found))) (defun auth-source-recall (spec) "Recall FOUND search results for SPEC." (password-read-from-cache (auth-source-format-cache-entry spec))) (defun auth-source-remembered-p (spec) "Check if SPEC is remembered." (password-in-cache-p (auth-source-format-cache-entry spec))) (defun auth-source-forget (spec) "Forget any cached data matching SPEC exactly. This is the same SPEC you passed to `auth-source-search'. Returns t or nil for forgotten or not found." (password-cache-remove (auth-source-format-cache-entry spec))) ;; (loop for sym being the symbols of password-data when (string-match (concat "^" auth-source-magic) (symbol-name sym)) collect (symbol-name sym)) ;; (auth-source-remember '(:host "wedd") '(4 5 6)) ;; (auth-source-remembered-p '(:host "wedd")) ;; (auth-source-remember '(:host "xedd") '(1 2 3)) ;; (auth-source-remembered-p '(:host "xedd")) ;; (auth-source-remembered-p '(:host "zedd")) ;; (auth-source-recall '(:host "xedd")) ;; (auth-source-recall '(:host t)) ;; (auth-source-forget+ :host t) (defun* auth-source-forget+ (&rest spec &allow-other-keys) "Forget any cached data matching SPEC. Returns forgotten count. This is not a full `auth-source-search' spec but works similarly. For instance, \(:host \"myhost\" \"yourhost\") would find all the cached data that was found with a search for those two hosts, while \(:host t) would find all host entries." (let ((count 0) sname) (loop for sym being the symbols of password-data ;; when the symbol name matches with auth-source-magic when (and (setq sname (symbol-name sym)) (string-match (concat "^" auth-source-magic "\\(.+\\)") sname) ;; and the spec matches what was stored in the cache (auth-source-specmatchp spec (read (match-string 1 sname)))) ;; remove that key do (progn (password-cache-remove sname) (incf count))) count)) (defun auth-source-specmatchp (spec stored) (let ((keys (loop for i below (length spec) by 2 collect (nth i spec)))) (not (eq (dolist (key keys) (unless (auth-source-search-collection (plist-get stored key) (plist-get spec key)) (return 'no))) 'no)))) ;; (auth-source-pick-first-password :host "z.lifelogs.com") ;; (auth-source-pick-first-password :port "imap") (defun auth-source-pick-first-password (&rest spec) "Pick the first secret found from applying SPEC to `auth-source-search'." (let* ((result (nth 0 (apply 'auth-source-search (plist-put spec :max 1)))) (secret (plist-get result :secret))) (if (functionp secret) (funcall secret) secret))) ;; (auth-source-format-prompt "test %u %h %p" '((?u "user") (?h "host"))) (defun auth-source-format-prompt (prompt alist) "Format PROMPT using %x (for any character x) specifiers in ALIST." (dolist (cell alist) (let ((c (nth 0 cell)) (v (nth 1 cell))) (when (and c v) (setq prompt (replace-regexp-in-string (format "%%%c" c) (format "%s" v) prompt nil t))))) prompt) (defun auth-source-ensure-strings (values) (unless (listp values) (setq values (list values))) (mapcar (lambda (value) (if (numberp value) (format "%s" value) value)) values)) ;;; Backend specific parsing: netrc/authinfo backend (defun auth-source--aput-1 (alist key val) (let ((seen ()) (rest alist)) (while (and (consp rest) (not (equal key (caar rest)))) (push (pop rest) seen)) (cons (cons key val) (if (null rest) alist (nconc (nreverse seen) (if (equal key (caar rest)) (cdr rest) rest)))))) (defmacro auth-source--aput (var key val) `(setq ,var (auth-source--aput-1 ,var ,key ,val))) (defun auth-source--aget (alist key) (cdr (assoc key alist))) ;; (auth-source-netrc-parse :file "~/.authinfo.gpg") (defun* auth-source-netrc-parse (&rest spec &key file max host user port delete require &allow-other-keys) "Parse FILE and return a list of all entries in the file. Note that the MAX parameter is used so we can exit the parse early." (if (listp file) ;; We got already parsed contents; just return it. file (when (file-exists-p file) (setq port (auth-source-ensure-strings port)) (with-temp-buffer (let* ((max (or max 5000)) ; sanity check: default to stop at 5K (modified 0) (cached (cdr-safe (assoc file auth-source-netrc-cache))) (cached-mtime (plist-get cached :mtime)) (cached-secrets (plist-get cached :secret)) (check (lambda(alist) (and alist (auth-source-search-collection host (or (auth-source--aget alist "machine") (auth-source--aget alist "host") t)) (auth-source-search-collection user (or (auth-source--aget alist "login") (auth-source--aget alist "account") (auth-source--aget alist "user") t)) (auth-source-search-collection port (or (auth-source--aget alist "port") (auth-source--aget alist "protocol") t)) (or ;; the required list of keys is nil, or (null require) ;; every element of require is in n(ormalized) (let ((n (nth 0 (auth-source-netrc-normalize (list alist) file)))) (loop for req in require always (plist-get n req))))))) result) (if (and (functionp cached-secrets) (equal cached-mtime (nth 5 (file-attributes file)))) (progn (auth-source-do-trivia "auth-source-netrc-parse: using CACHED file data for %s" file) (insert (funcall cached-secrets))) (insert-file-contents file) ;; cache all netrc files (used to be just .gpg files) ;; Store the contents of the file heavily encrypted in memory. ;; (note for the irony-impaired: they are just obfuscated) (auth-source--aput auth-source-netrc-cache file (list :mtime (nth 5 (file-attributes file)) :secret (lexical-let ((v (mapcar '1+ (buffer-string)))) (lambda () (apply 'string (mapcar '1- v))))))) (goto-char (point-min)) (let ((entries (auth-source-netrc-parse-entries check max)) alist) (while (setq alist (pop entries)) (push (nreverse alist) result))) (when (< 0 modified) (when auth-source-gpg-encrypt-to ;; (see bug#7487) making `epa-file-encrypt-to' local to ;; this buffer lets epa-file skip the key selection query ;; (see the `local-variable-p' check in ;; `epa-file-write-region'). (unless (local-variable-p 'epa-file-encrypt-to (current-buffer)) (make-local-variable 'epa-file-encrypt-to)) (if (listp auth-source-gpg-encrypt-to) (setq epa-file-encrypt-to auth-source-gpg-encrypt-to))) ;; ask AFTER we've successfully opened the file (when (y-or-n-p (format "Save file %s? (%d deletions)" file modified)) (write-region (point-min) (point-max) file nil 'silent) (auth-source-do-debug "auth-source-netrc-parse: modified %d lines in %s" modified file))) (nreverse result)))))) (defun auth-source-netrc-parse-next-interesting () "Advance to the next interesting position in the current buffer." ;; If we're looking at a comment or are at the end of the line, move forward (while (or (looking-at "#") (and (eolp) (not (eobp)))) (forward-line 1)) (skip-chars-forward "\t ")) (defun auth-source-netrc-parse-one () "Read one thing from the current buffer." (auth-source-netrc-parse-next-interesting) (when (or (looking-at "'\\([^']+\\)'") (looking-at "\"\\([^\"]+\\)\"") (looking-at "\\([^ \t\n]+\\)")) (forward-char (length (match-string 0))) (auth-source-netrc-parse-next-interesting) (match-string-no-properties 1))) ;; with thanks to org-mode (defsubst auth-source-current-line (&optional pos) (save-excursion (and pos (goto-char pos)) ;; works also in narrowed buffer, because we start at 1, not point-min (+ (if (bolp) 1 0) (count-lines 1 (point))))) (defun auth-source-netrc-parse-entries(check max) "Parse up to MAX netrc entries, passed by CHECK, from the current buffer." (let ((adder (lambda(check alist all) (when (and alist (> max (length all)) (funcall check alist)) (push alist all)) all)) item item2 all alist default) (while (setq item (auth-source-netrc-parse-one)) (setq default (equal item "default")) ;; We're starting a new machine. Save the old one. (when (and alist (or default (equal item "machine"))) ;; (auth-source-do-trivia ;; "auth-source-netrc-parse-entries: got entry %S" alist) (setq all (funcall adder check alist all) alist nil)) ;; In default entries, we don't have a next token. ;; We store them as ("machine" . t) (if default (push (cons "machine" t) alist) ;; Not a default entry. Grab the next item. (when (setq item2 (auth-source-netrc-parse-one)) ;; Did we get a "machine" value? (if (equal item2 "machine") (progn (gnus-error 1 "%s: Unexpected 'machine' token at line %d" "auth-source-netrc-parse-entries" (auth-source-current-line)) (forward-line 1)) (push (cons item item2) alist))))) ;; Clean up: if there's an entry left over, use it. (when alist (setq all (funcall adder check alist all)) ;; (auth-source-do-trivia ;; "auth-source-netrc-parse-entries: got2 entry %S" alist) ) (nreverse all))) (defvar auth-source-passphrase-alist nil) (defun auth-source-token-passphrase-callback-function (context key-id file) (let* ((file (file-truename file)) (entry (assoc file auth-source-passphrase-alist)) passphrase) ;; return the saved passphrase, calling a function if needed (or (copy-sequence (if (functionp (cdr entry)) (funcall (cdr entry)) (cdr entry))) (progn (unless entry (setq entry (list file)) (push entry auth-source-passphrase-alist)) (setq passphrase (read-passwd (format "Passphrase for %s tokens: " file) t)) (setcdr entry (lexical-let ((p (copy-sequence passphrase))) (lambda () p))) passphrase)))) ;; (auth-source-epa-extract-gpg-token "gpg:LS0tLS1CRUdJTiBQR1AgTUVTU0FHRS0tLS0tClZlcnNpb246IEdudVBHIHYxLjQuMTEgKEdOVS9MaW51eCkKCmpBMEVBd01DT25qMjB1ak9rZnRneVI3K21iNm9aZWhuLzRad3cySkdlbnVaKzRpeEswWDY5di9icDI1U1dsQT0KPS9yc2wKLS0tLS1FTkQgUEdQIE1FU1NBR0UtLS0tLQo=" "~/.netrc") (defun auth-source-epa-extract-gpg-token (secret file) "Pass either the decoded SECRET or the gpg:BASE64DATA version. FILE is the file from which we obtained this token." (when (string-match "^gpg:\\(.+\\)" secret) (setq secret (base64-decode-string (match-string 1 secret)))) (let ((context (epg-make-context 'OpenPGP)) plain) (epg-context-set-passphrase-callback context (cons #'auth-source-token-passphrase-callback-function file)) (epg-decrypt-string context secret))) ;; (insert (auth-source-epa-make-gpg-token "mysecret" "~/.netrc")) (defun auth-source-epa-make-gpg-token (secret file) (let ((context (epg-make-context 'OpenPGP)) (pp-escape-newlines nil) cipher) (epg-context-set-armor context t) (epg-context-set-passphrase-callback context (cons #'auth-source-token-passphrase-callback-function file)) (setq cipher (epg-encrypt-string context secret nil)) (with-temp-buffer (insert cipher) (base64-encode-region (point-min) (point-max) t) (concat "gpg:" (buffer-substring-no-properties (point-min) (point-max)))))) (defun auth-source-netrc-normalize (alist filename) (mapcar (lambda (entry) (let (ret item) (while (setq item (pop entry)) (let ((k (car item)) (v (cdr item))) ;; apply key aliases (setq k (cond ((member k '("machine")) "host") ((member k '("login" "account")) "user") ((member k '("protocol")) "port") ((member k '("password")) "secret") (t k))) ;; send back the secret in a function (lexical binding) (when (equal k "secret") (setq v (lexical-let ((lexv v) (token-decoder nil)) (when (string-match "^gpg:" lexv) ;; it's a GPG token: create a token decoder ;; which unsets itself once (setq token-decoder (lambda (val) (prog1 (auth-source-epa-extract-gpg-token val filename) (setq token-decoder nil))))) (lambda () (when token-decoder (setq lexv (funcall token-decoder lexv))) lexv)))) (setq ret (plist-put ret (intern (concat ":" k)) v)))) ret)) alist)) ;; (setq secret (plist-get (nth 0 (auth-source-search :host t :type 'netrc :K 1 :max 1)) :secret)) ;; (funcall secret) (defun* auth-source-netrc-search (&rest spec &key backend require create delete type max host user port &allow-other-keys) "Given a property list SPEC, return search matches from the :backend. See `auth-source-search' for details on SPEC." ;; just in case, check that the type is correct (null or same as the backend) (assert (or (null type) (eq type (oref backend type))) t "Invalid netrc search: %s %s") (let ((results (auth-source-netrc-normalize (auth-source-netrc-parse :max max :require require :delete delete :file (oref backend source) :host (or host t) :user (or user t) :port (or port t)) (oref backend source)))) ;; if we need to create an entry AND none were found to match (when (and create (not results)) ;; create based on the spec and record the value (setq results (or ;; if the user did not want to create the entry ;; in the file, it will be returned (apply (slot-value backend 'create-function) spec) ;; if not, we do the search again without :create ;; to get the updated data. ;; the result will be returned, even if the search fails (apply 'auth-source-netrc-search (plist-put spec :create nil))))) results)) (defun auth-source-netrc-element-or-first (v) (if (listp v) (nth 0 v) v)) ;; (auth-source-search :host "nonesuch" :type 'netrc :max 1 :create t) ;; (auth-source-search :host "nonesuch" :type 'netrc :max 1 :create t :create-extra-keys '((A "default A") (B))) (defun* auth-source-netrc-create (&rest spec &key backend secret host user port create &allow-other-keys) (let* ((base-required '(host user port secret)) ;; we know (because of an assertion in auth-source-search) that the ;; :create parameter is either t or a list (which includes nil) (create-extra (if (eq t create) nil create)) (current-data (car (auth-source-search :max 1 :host host :port port))) (required (append base-required create-extra)) (file (oref backend source)) (add "") ;; `valist' is an alist valist ;; `artificial' will be returned if no creation is needed artificial) ;; only for base required elements (defined as function parameters): ;; fill in the valist with whatever data we may have from the search ;; we complete the first value if it's a list and use the value otherwise (dolist (br base-required) (when (symbol-value br) (let ((br-choice (cond ;; all-accepting choice (predicate is t) ((eq t (symbol-value br)) nil) ;; just the value otherwise (t (symbol-value br))))) (when br-choice (auth-source--aput valist br br-choice))))) ;; for extra required elements, see if the spec includes a value for them (dolist (er create-extra) (let ((name (concat ":" (symbol-name er))) (keys (loop for i below (length spec) by 2 collect (nth i spec)))) (dolist (k keys) (when (equal (symbol-name k) name) (auth-source--aput valist er (plist-get spec k)))))) ;; for each required element (dolist (r required) (let* ((data (auth-source--aget valist r)) ;; take the first element if the data is a list (data (or (auth-source-netrc-element-or-first data) (plist-get current-data (intern (format ":%s" r) obarray)))) ;; this is the default to be offered (given-default (auth-source--aget auth-source-creation-defaults r)) ;; the default supplementals are simple: ;; for the user, try `given-default' and then (user-login-name); ;; otherwise take `given-default' (default (cond ((and (not given-default) (eq r 'user)) (user-login-name)) (t given-default))) (printable-defaults (list (cons 'user (or (auth-source-netrc-element-or-first (auth-source--aget valist 'user)) (plist-get artificial :user) "[any user]")) (cons 'host (or (auth-source-netrc-element-or-first (auth-source--aget valist 'host)) (plist-get artificial :host) "[any host]")) (cons 'port (or (auth-source-netrc-element-or-first (auth-source--aget valist 'port)) (plist-get artificial :port) "[any port]")))) (prompt (or (auth-source--aget auth-source-creation-prompts r) (case r (secret "%p password for %u@%h: ") (user "%p user name for %h: ") (host "%p host name for user %u: ") (port "%p port for %u@%h: ")) (format "Enter %s (%%u@%%h:%%p): " r))) (prompt (auth-source-format-prompt prompt `((?u ,(auth-source--aget printable-defaults 'user)) (?h ,(auth-source--aget printable-defaults 'host)) (?p ,(auth-source--aget printable-defaults 'port)))))) ;; Store the data, prompting for the password if needed. (setq data (or data (if (eq r 'secret) ;; Special case prompt for passwords. ;; TODO: make the default (setq auth-source-netrc-use-gpg-tokens `((,(if (boundp 'epa-file-auto-mode-alist-entry) (car (symbol-value 'epa-file-auto-mode-alist-entry)) "\\.gpg\\'") nil) (t gpg))) ;; TODO: or maybe leave as (setq auth-source-netrc-use-gpg-tokens 'never) (let* ((ep (format "Use GPG password tokens in %s?" file)) (gpg-encrypt (cond ((eq auth-source-netrc-use-gpg-tokens 'never) 'never) ((listp auth-source-netrc-use-gpg-tokens) (let ((check (copy-sequence auth-source-netrc-use-gpg-tokens)) item ret) (while check (setq item (pop check)) (when (or (eq (car item) t) (string-match (car item) file)) (setq ret (cdr item)) (setq check nil))))) (t 'never))) (plain (or (eval default) (read-passwd prompt)))) ;; ask if we don't know what to do (in which case ;; auth-source-netrc-use-gpg-tokens must be a list) (unless gpg-encrypt (setq gpg-encrypt (if (y-or-n-p ep) 'gpg 'never)) ;; TODO: save the defcustom now? or ask? (setq auth-source-netrc-use-gpg-tokens (cons `(,file ,gpg-encrypt) auth-source-netrc-use-gpg-tokens))) (if (eq gpg-encrypt 'gpg) (auth-source-epa-make-gpg-token plain file) plain)) (if (stringp default) (read-string (if (string-match ": *\\'" prompt) (concat (substring prompt 0 (match-beginning 0)) " (default " default "): ") (concat prompt "(default " default ") ")) nil nil default) (eval default))))) (when data (setq artificial (plist-put artificial (intern (concat ":" (symbol-name r))) (if (eq r 'secret) (lexical-let ((data data)) (lambda () data)) data)))) ;; When r is not an empty string... (when (and (stringp data) (< 0 (length data))) ;; this function is not strictly necessary but I think it ;; makes the code clearer -tzz (let ((printer (lambda () ;; append the key (the symbol name of r) ;; and the value in r (format "%s%s %s" ;; prepend a space (if (zerop (length add)) "" " ") ;; remap auth-source tokens to netrc (case r (user "login") (host "machine") (secret "password") (port "port") ; redundant but clearer (t (symbol-name r))) (if (string-match "[\"# ]" data) (format "%S" data) data))))) (setq add (concat add (funcall printer))))))) (plist-put artificial :save-function (lexical-let ((file file) (add add)) (lambda () (auth-source-netrc-saver file add)))) (list artificial))) ;;(funcall (plist-get (nth 0 (auth-source-search :host '("nonesuch2") :user "tzz" :port "imap" :create t :max 1)) :save-function)) (defun auth-source-netrc-saver (file add) "Save a line ADD in FILE, prompting along the way. Respects `auth-source-save-behavior'. Uses `auth-source-netrc-cache' to avoid prompting more than once." (let* ((key (format "%s %s" file (rfc2104-hash 'md5 64 16 file add))) (cached (assoc key auth-source-netrc-cache))) (if cached (auth-source-do-trivia "auth-source-netrc-saver: found previous run for key %s, returning" key) (with-temp-buffer (when (file-exists-p file) (insert-file-contents file)) (when auth-source-gpg-encrypt-to ;; (see bug#7487) making `epa-file-encrypt-to' local to ;; this buffer lets epa-file skip the key selection query ;; (see the `local-variable-p' check in ;; `epa-file-write-region'). (unless (local-variable-p 'epa-file-encrypt-to (current-buffer)) (make-local-variable 'epa-file-encrypt-to)) (if (listp auth-source-gpg-encrypt-to) (setq epa-file-encrypt-to auth-source-gpg-encrypt-to))) ;; we want the new data to be found first, so insert at beginning (goto-char (point-min)) ;; Ask AFTER we've successfully opened the file. (let ((prompt (format "Save auth info to file %s? " file)) (done (not (eq auth-source-save-behavior 'ask))) (bufname "*auth-source Help*") k) (while (not done) (setq k (auth-source-read-char-choice prompt '(?y ?n ?N ?e ??))) (case k (?y (setq done t)) (?? (save-excursion (with-output-to-temp-buffer bufname (princ (concat "(y)es, save\n" "(n)o but use the info\n" "(N)o and don't ask to save again\n" "(e)dit the line\n" "(?) for help as you can see.\n")) ;; Why? Doesn't with-output-to-temp-buffer already do ;; the exact same thing anyway? --Stef (set-buffer standard-output) (help-mode)))) (?n (setq add "" done t)) (?N (setq add "" done t) (customize-save-variable 'auth-source-save-behavior nil)) (?e (setq add (read-string "Line to add: " add))) (t nil))) (when (get-buffer-window bufname) (delete-window (get-buffer-window bufname))) ;; Make sure the info is not saved. (when (null auth-source-save-behavior) (setq add "")) (when (< 0 (length add)) (progn (unless (bolp) (insert "\n")) (insert add "\n") (write-region (point-min) (point-max) file nil 'silent) ;; Make the .authinfo file non-world-readable. (set-file-modes file #o600) (auth-source-do-debug "auth-source-netrc-create: wrote 1 new line to %s" file) (message "Saved new authentication information to %s" file) nil)))) (auth-source--aput auth-source-netrc-cache key "ran")))) ;;; Backend specific parsing: Secrets API backend ;; (let ((auth-sources '(default))) (auth-source-search :max 1 :create t)) ;; (let ((auth-sources '(default))) (auth-source-search :max 1 :delete t)) ;; (let ((auth-sources '(default))) (auth-source-search :max 1)) ;; (let ((auth-sources '(default))) (auth-source-search)) ;; (let ((auth-sources '("secrets:Login"))) (auth-source-search :max 1)) ;; (let ((auth-sources '("secrets:Login"))) (auth-source-search :max 1 :signon_realm "https://git.gnus.org/Git")) (defun* auth-source-secrets-search (&rest spec &key backend create delete label type max host user port &allow-other-keys) "Search the Secrets API; spec is like `auth-source'. The :label key specifies the item's label. It is the only key that can specify a substring. Any :label value besides a string will allow any label. All other search keys must match exactly. If you need substring matching, do a wider search and narrow it down yourself. You'll get back all the properties of the token as a plist. Here's an example that looks for the first item in the 'Login' Secrets collection: \(let ((auth-sources '(\"secrets:Login\"))) (auth-source-search :max 1) Here's another that looks for the first item in the 'Login' Secrets collection whose label contains 'gnus': \(let ((auth-sources '(\"secrets:Login\"))) (auth-source-search :max 1 :label \"gnus\") And this one looks for the first item in the 'Login' Secrets collection that's a Google Chrome entry for the git.gnus.org site authentication tokens: \(let ((auth-sources '(\"secrets:Login\"))) (auth-source-search :max 1 :signon_realm \"https://git.gnus.org/Git\")) " ;; TODO (assert (not create) nil "The Secrets API auth-source backend doesn't support creation yet") ;; TODO ;; (secrets-delete-item coll elt) (assert (not delete) nil "The Secrets API auth-source backend doesn't support deletion yet") (let* ((coll (oref backend source)) (max (or max 5000)) ; sanity check: default to stop at 5K (ignored-keys '(:create :delete :max :backend :label :require :type)) (search-keys (loop for i below (length spec) by 2 unless (memq (nth i spec) ignored-keys) collect (nth i spec))) ;; build a search spec without the ignored keys ;; if a search key is nil or t (match anything), we skip it (search-spec (apply 'append (mapcar (lambda (k) (if (or (null (plist-get spec k)) (eq t (plist-get spec k))) nil (list k (plist-get spec k)))) search-keys))) ;; needed keys (always including host, login, port, and secret) (returned-keys (mm-delete-duplicates (append '(:host :login :port :secret) search-keys))) (items (loop for item in (apply 'secrets-search-items coll search-spec) unless (and (stringp label) (not (string-match label item))) collect item)) ;; TODO: respect max in `secrets-search-items', not after the fact (items (butlast items (- (length items) max))) ;; convert the item name to a full plist (items (mapcar (lambda (item) (append ;; make an entry for the secret (password) element (list :secret (lexical-let ((v (secrets-get-secret coll item))) (lambda () v))) ;; rewrite the entry from ((k1 v1) (k2 v2)) to plist (apply 'append (mapcar (lambda (entry) (list (car entry) (cdr entry))) (secrets-get-attributes coll item))))) items)) ;; ensure each item has each key in `returned-keys' (items (mapcar (lambda (plist) (append (apply 'append (mapcar (lambda (req) (if (plist-get plist req) nil (list req nil))) returned-keys)) plist)) items))) items)) (defun* auth-source-secrets-create (&rest spec &key backend type max host user port &allow-other-keys) ;; TODO ;; (apply 'secrets-create-item (auth-get-source entry) name passwd spec) (debug spec)) ;;; Backend specific parsing: Mac OS Keychain (using /usr/bin/security) backend ;; (let ((auth-sources '(macos-keychain-internet))) (auth-source-search :max 1 :create t)) ;; (let ((auth-sources '(macos-keychain-internet))) (auth-source-search :max 1 :delete t)) ;; (let ((auth-sources '(macos-keychain-internet))) (auth-source-search :max 1)) ;; (let ((auth-sources '(macos-keychain-internet))) (auth-source-search)) ;; (let ((auth-sources '(macos-keychain-generic))) (auth-source-search :max 1 :create t)) ;; (let ((auth-sources '(macos-keychain-generic))) (auth-source-search :max 1 :delete t)) ;; (let ((auth-sources '(macos-keychain-generic))) (auth-source-search :max 1)) ;; (let ((auth-sources '(macos-keychain-generic))) (auth-source-search)) ;; (let ((auth-sources '("macos-keychain-internet:/Users/tzz/Library/Keychains/login.keychain"))) (auth-source-search :max 1)) ;; (let ((auth-sources '("macos-keychain-generic:Login"))) (auth-source-search :max 1 :host "git.gnus.org")) (defun* auth-source-macos-keychain-search (&rest spec &key backend create delete label type max host user port &allow-other-keys) "Search the MacOS Keychain; spec is like `auth-source'. All search keys must match exactly. If you need substring matching, do a wider search and narrow it down yourself. You'll get back all the properties of the token as a plist. The :type key is either 'macos-keychain-internet or 'macos-keychain-generic. For the internet keychain type, the :label key searches the item's labels (\"-l LABEL\" passed to \"/usr/bin/security\"). Similarly, :host maps to \"-s HOST\", :user maps to \"-a USER\", and :port maps to \"-P PORT\" or \"-r PROT\" (note PROT has to be a 4-character string). For the generic keychain type, the :label key searches the item's labels (\"-l LABEL\" passed to \"/usr/bin/security\"). Similarly, :host maps to \"-c HOST\" (the \"creator\" keychain field), :user maps to \"-a USER\", and :port maps to \"-s PORT\". Here's an example that looks for the first item in the default generic MacOS Keychain: \(let ((auth-sources '(macos-keychain-generic))) (auth-source-search :max 1) Here's another that looks for the first item in the internet MacOS Keychain collection whose label is 'gnus': \(let ((auth-sources '(macos-keychain-internet))) (auth-source-search :max 1 :label \"gnus\") And this one looks for the first item in the internet keychain entries for git.gnus.org: \(let ((auth-sources '(macos-keychain-internet\"))) (auth-source-search :max 1 :host \"git.gnus.org\")) " ;; TODO (assert (not create) nil "The MacOS Keychain auth-source backend doesn't support creation yet") ;; TODO ;; (macos-keychain-delete-item coll elt) (assert (not delete) nil "The MacOS Keychain auth-source backend doesn't support deletion yet") (let* ((coll (oref backend source)) (max (or max 5000)) ; sanity check: default to stop at 5K (ignored-keys '(:create :delete :max :backend :label)) (search-keys (loop for i below (length spec) by 2 unless (memq (nth i spec) ignored-keys) collect (nth i spec))) ;; build a search spec without the ignored keys ;; if a search key is nil or t (match anything), we skip it (search-spec (apply 'append (mapcar (lambda (k) (if (or (null (plist-get spec k)) (eq t (plist-get spec k))) nil (list k (plist-get spec k)))) search-keys))) ;; needed keys (always including host, login, port, and secret) (returned-keys (mm-delete-duplicates (append '(:host :login :port :secret) search-keys))) (items (apply 'auth-source-macos-keychain-search-items coll type max search-spec)) ;; ensure each item has each key in `returned-keys' (items (mapcar (lambda (plist) (append (apply 'append (mapcar (lambda (req) (if (plist-get plist req) nil (list req nil))) returned-keys)) plist)) items))) items)) (defun* auth-source-macos-keychain-search-items (coll type max &rest spec &key label type host user port &allow-other-keys) (let* ((keychain-generic (eq type 'macos-keychain-generic)) (args `(,(if keychain-generic "find-generic-password" "find-internet-password") "-g")) (ret (list :type type))) (when label (setq args (append args (list "-l" label)))) (when host (setq args (append args (list (if keychain-generic "-c" "-s") host)))) (when user (setq args (append args (list "-a" user)))) (when port (if keychain-generic (setq args (append args (list "-s" port))) (setq args (append args (list (if (string-match "[0-9]+" port) "-P" "-r") port))))) (unless (equal coll "default") (setq args (append args (list coll)))) (with-temp-buffer (apply 'call-process "/usr/bin/security" nil t nil args) (goto-char (point-min)) (while (not (eobp)) (cond ((looking-at "^password: \"\\(.+\\)\"$") (auth-source-macos-keychain-result-append ret keychain-generic "secret" (lexical-let ((v (match-string 1))) (lambda () v)))) ;; TODO: check if this is really the label ;; match 0x00000007 ="AppleID" ((looking-at "^[ ]+0x00000007 =\"\\(.+\\)\"") (auth-source-macos-keychain-result-append ret keychain-generic "label" (match-string 1))) ;; match "crtr"="aapl" ;; match "svce"="AppleID" ((looking-at "^[ ]+\"\\([a-z]+\\)\"[^=]+=\"\\(.+\\)\"") (auth-source-macos-keychain-result-append ret keychain-generic (match-string 1) (match-string 2)))) (forward-line))) ;; return `ret' iff it has the :secret key (and (plist-get ret :secret) (list ret)))) (defun auth-source-macos-keychain-result-append (result generic k v) (push v result) (setq k (cond ((equal k "acct") "user") ;; for generic keychains, creator is host, service is port ((and generic (equal k "crtr")) "host") ((and generic (equal k "svce")) "port") ;; for internet keychains, protocol is port, server is host ((and (not generic) (equal k "ptcl")) "port") ((and (not generic) (equal k "srvr")) "host") (t k))) (push (intern (format ":%s" k)) result)) (defun* auth-source-macos-keychain-create (&rest spec &key backend type max host user port &allow-other-keys) ;; TODO (debug spec)) ;;; Backend specific parsing: PLSTORE backend (defun* auth-source-plstore-search (&rest spec &key backend create delete label type max host user port &allow-other-keys) "Search the PLSTORE; spec is like `auth-source'." (let* ((store (oref backend data)) (max (or max 5000)) ; sanity check: default to stop at 5K (ignored-keys '(:create :delete :max :backend :label :require :type)) (search-keys (loop for i below (length spec) by 2 unless (memq (nth i spec) ignored-keys) collect (nth i spec))) ;; build a search spec without the ignored keys ;; if a search key is nil or t (match anything), we skip it (search-spec (apply 'append (mapcar (lambda (k) (let ((v (plist-get spec k))) (if (or (null v) (eq t v)) nil (if (stringp v) (setq v (list v))) (list k v)))) search-keys))) ;; needed keys (always including host, login, port, and secret) (returned-keys (mm-delete-duplicates (append '(:host :login :port :secret) search-keys))) (items (plstore-find store search-spec)) (item-names (mapcar #'car items)) (items (butlast items (- (length items) max))) ;; convert the item to a full plist (items (mapcar (lambda (item) (let* ((plist (copy-tree (cdr item))) (secret (plist-member plist :secret))) (if secret (setcar (cdr secret) (lexical-let ((v (car (cdr secret)))) (lambda () v)))) plist)) items)) ;; ensure each item has each key in `returned-keys' (items (mapcar (lambda (plist) (append (apply 'append (mapcar (lambda (req) (if (plist-get plist req) nil (list req nil))) returned-keys)) plist)) items))) (cond ;; if we need to create an entry AND none were found to match ((and create (not items)) ;; create based on the spec and record the value (setq items (or ;; if the user did not want to create the entry ;; in the file, it will be returned (apply (slot-value backend 'create-function) spec) ;; if not, we do the search again without :create ;; to get the updated data. ;; the result will be returned, even if the search fails (apply 'auth-source-plstore-search (plist-put spec :create nil))))) ((and delete item-names) (dolist (item-name item-names) (plstore-delete store item-name)) (plstore-save store))) items)) (defun* auth-source-plstore-create (&rest spec &key backend secret host user port create &allow-other-keys) (let* ((base-required '(host user port secret)) (base-secret '(secret)) ;; we know (because of an assertion in auth-source-search) that the ;; :create parameter is either t or a list (which includes nil) (create-extra (if (eq t create) nil create)) (current-data (car (auth-source-search :max 1 :host host :port port))) (required (append base-required create-extra)) (file (oref backend source)) (add "") ;; `valist' is an alist valist ;; `artificial' will be returned if no creation is needed artificial secret-artificial) ;; only for base required elements (defined as function parameters): ;; fill in the valist with whatever data we may have from the search ;; we complete the first value if it's a list and use the value otherwise (dolist (br base-required) (when (symbol-value br) (let ((br-choice (cond ;; all-accepting choice (predicate is t) ((eq t (symbol-value br)) nil) ;; just the value otherwise (t (symbol-value br))))) (when br-choice (auth-source--aput valist br br-choice))))) ;; for extra required elements, see if the spec includes a value for them (dolist (er create-extra) (let ((name (concat ":" (symbol-name er))) (keys (loop for i below (length spec) by 2 collect (nth i spec)))) (dolist (k keys) (when (equal (symbol-name k) name) (auth-source--aput valist er (plist-get spec k)))))) ;; for each required element (dolist (r required) (let* ((data (auth-source--aget valist r)) ;; take the first element if the data is a list (data (or (auth-source-netrc-element-or-first data) (plist-get current-data (intern (format ":%s" r) obarray)))) ;; this is the default to be offered (given-default (auth-source--aget auth-source-creation-defaults r)) ;; the default supplementals are simple: ;; for the user, try `given-default' and then (user-login-name); ;; otherwise take `given-default' (default (cond ((and (not given-default) (eq r 'user)) (user-login-name)) (t given-default))) (printable-defaults (list (cons 'user (or (auth-source-netrc-element-or-first (auth-source--aget valist 'user)) (plist-get artificial :user) "[any user]")) (cons 'host (or (auth-source-netrc-element-or-first (auth-source--aget valist 'host)) (plist-get artificial :host) "[any host]")) (cons 'port (or (auth-source-netrc-element-or-first (auth-source--aget valist 'port)) (plist-get artificial :port) "[any port]")))) (prompt (or (auth-source--aget auth-source-creation-prompts r) (case r (secret "%p password for %u@%h: ") (user "%p user name for %h: ") (host "%p host name for user %u: ") (port "%p port for %u@%h: ")) (format "Enter %s (%%u@%%h:%%p): " r))) (prompt (auth-source-format-prompt prompt `((?u ,(auth-source--aget printable-defaults 'user)) (?h ,(auth-source--aget printable-defaults 'host)) (?p ,(auth-source--aget printable-defaults 'port)))))) ;; Store the data, prompting for the password if needed. (setq data (or data (if (eq r 'secret) (or (eval default) (read-passwd prompt)) (if (stringp default) (read-string (if (string-match ": *\\'" prompt) (concat (substring prompt 0 (match-beginning 0)) " (default " default "): ") (concat prompt "(default " default ") ")) nil nil default) (eval default))))) (when data (if (member r base-secret) (setq secret-artificial (plist-put secret-artificial (intern (concat ":" (symbol-name r))) data)) (setq artificial (plist-put artificial (intern (concat ":" (symbol-name r))) data)))))) (plstore-put (oref backend data) (sha1 (format "%s@%s:%s" (plist-get artificial :user) (plist-get artificial :host) (plist-get artificial :port))) artificial secret-artificial) (if (y-or-n-p (format "Save auth info to file %s? " (plstore-get-file (oref backend data)))) (plstore-save (oref backend data))))) ;;; older API ;; (auth-source-user-or-password '("login" "password") "imap.myhost.com" t "tzz") ;; deprecate the old interface (make-obsolete 'auth-source-user-or-password 'auth-source-search "Emacs 24.1") (make-obsolete 'auth-source-forget-user-or-password 'auth-source-forget "Emacs 24.1") (defun auth-source-user-or-password (mode host port &optional username create-missing delete-existing) "Find MODE (string or list of strings) matching HOST and PORT. DEPRECATED in favor of `auth-source-search'! USERNAME is optional and will be used as \"login\" in a search across the Secret Service API (see secrets.el) if the resulting items don't have a username. This means that if you search for username \"joe\" and it matches an item but the item doesn't have a :user attribute, the username \"joe\" will be returned. A non nil DELETE-EXISTING means deleting any matching password entry in the respective sources. This is useful only when CREATE-MISSING is non nil as well; the intended use case is to remove wrong password entries. If no matching entry is found, and CREATE-MISSING is non nil, the password will be retrieved interactively, and it will be stored in the password database which matches best (see `auth-sources'). MODE can be \"login\" or \"password\"." (auth-source-do-debug "auth-source-user-or-password: DEPRECATED get %s for %s (%s) + user=%s" mode host port username) (let* ((listy (listp mode)) (mode (if listy mode (list mode))) (cname (if username (format "%s %s:%s %s" mode host port username) (format "%s %s:%s" mode host port))) (search (list :host host :port port)) (search (if username (append search (list :user username)) search)) (search (if create-missing (append search (list :create t)) search)) (search (if delete-existing (append search (list :delete t)) search)) ;; (found (if (not delete-existing) ;; (gethash cname auth-source-cache) ;; (remhash cname auth-source-cache) ;; nil))) (found nil)) (if found (progn (auth-source-do-debug "auth-source-user-or-password: DEPRECATED cached %s=%s for %s (%s) + %s" mode ;; don't show the password (if (and (member "password" mode) t) "SECRET" found) host port username) found) ; return the found data ;; else, if not found, search with a max of 1 (let ((choice (nth 0 (apply 'auth-source-search (append '(:max 1) search))))) (when choice (dolist (m mode) (cond ((equal "password" m) (push (if (plist-get choice :secret) (funcall (plist-get choice :secret)) nil) found)) ((equal "login" m) (push (plist-get choice :user) found))))) (setq found (nreverse found)) (setq found (if listy found (car-safe found))))) found)) (defun auth-source-user-and-password (host &optional user) (let* ((auth-info (car (if user (auth-source-search :host host :user "yourusername" :max 1 :require '(:user :secret) :create nil) (auth-source-search :host host :max 1 :require '(:user :secret) :create nil)))) (user (plist-get auth-info :user)) (password (plist-get auth-info :secret))) (when (functionp password) (setq password (funcall password))) (list user password auth-info))) (provide 'auth-source) ;;; auth-source.el ends here
|
{
"url": "https://emba.gnu.org/emacs/emacs/-/raw/924d6997866a444f833ea0a2f0da25058a351564/lisp/gnus/auth-source.el",
"source_domain": "emba.gnu.org",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "93182",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4L43WLEXAYFE3I6QBJ25GIMCLDU5ISJA",
"WARC-Concurrent-To": "<urn:uuid:9f9c441a-a942-4891-980c-03f0659d8d90>",
"WARC-Date": "2022-01-27T03:34:02Z",
"WARC-IP-Address": "209.51.188.225",
"WARC-Identified-Payload-Type": "text/x-emacs-lisp",
"WARC-Payload-Digest": "sha1:H47J22HXGMRMUCITLVUUNRIYLB7OOC2Y",
"WARC-Record-ID": "<urn:uuid:7288b0c7-e360-40f8-874a-8bed51f56374>",
"WARC-Target-URI": "https://emba.gnu.org/emacs/emacs/-/raw/924d6997866a444f833ea0a2f0da25058a351564/lisp/gnus/auth-source.el",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b5058dff-82eb-4bcd-aeee-774a01b51450>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-243\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
66670
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 66670,
"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.1660195291042328,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014144659973680973,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.42861104011535645,
"rps_doc_frac_unique_words": 0.1309736669063568,
"rps_doc_mean_word_length": 5.695268630981445,
"rps_doc_num_sentences": 323,
"rps_doc_symbol_to_word_ratio": 0.0007211000192910433,
"rps_doc_unigram_entropy": 5.9502949714660645,
"rps_doc_word_count": 8391,
"rps_doc_frac_chars_dupe_10grams": 0.22944611310958862,
"rps_doc_frac_chars_dupe_5grams": 0.3345121443271637,
"rps_doc_frac_chars_dupe_6grams": 0.3060746192932129,
"rps_doc_frac_chars_dupe_7grams": 0.2836636006832123,
"rps_doc_frac_chars_dupe_8grams": 0.25978782773017883,
"rps_doc_frac_chars_dupe_9grams": 0.24587248265743256,
"rps_doc_frac_chars_top_2gram": 0.002845840062946081,
"rps_doc_frac_chars_top_3gram": 0.009625650011003017,
"rps_doc_frac_chars_top_4gram": 0.0016740299761295319,
"rps_doc_books_importance": -9320.21484375,
"rps_doc_books_importance_length_correction": -9320.21484375,
"rps_doc_openwebtext_importance": -4609.564453125,
"rps_doc_openwebtext_importance_length_correction": -4609.564453125,
"rps_doc_wikipedia_importance": -4565.0576171875,
"rps_doc_wikipedia_importance_length_correction": -4565.0576171875
},
"fasttext": {
"dclm": 0.13108432292938232,
"english": 0.6656095385551453,
"fineweb_edu_approx": 1.6802746057510376,
"eai_general_math": 0.27701878547668457,
"eai_open_web_math": 0.3184943199157715,
"eai_web_code": 0.9737629294395447
}
}
|
{
"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.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,894,458,184,777,243,000
|
Documentation Center
• Trials
• Product Updates
unicode2native
Convert Unicode character representation to numeric bytes
Syntax
bytes = unicode2native(unicodestr)
bytes = unicode2native(unicodestr,encoding)
Description
bytes = unicode2native(unicodestr) converts a char vector of Unicode® character representations, unicodestr, to the user default encoding, and returns the bytes as a uint8 vector, bytes. Output vector bytes has the same general array shape as the unicodestr input. You can save the output of unicode2native to a file using the fwrite function.
bytes = unicode2native(unicodestr,encoding) converts unicodestr to the character encoding scheme specified by the string encoding. encoding must be the empty string ('') or a name or alias for an encoding scheme. Some examples are 'UTF-8', 'latin1', 'US-ASCII', and 'Shift_JIS'. If encoding is unspecified or is the empty string (''), the default encoding scheme is used.
Examples
This example begins with two strings containing Unicode character representations. It assumes that string str1 contains text in a Western European language and string str2 contains Japanese text. The example writes both strings into the same file, using the ISO-8859-1 character encoding scheme for the first string and the Shift-JIS encoding scheme for the second string. The example uses unicode2native to convert the two strings to the appropriate encoding schemes.
fid = fopen('mixed.txt', 'w');
bytes1 = unicode2native(str1, 'ISO-8859-1');
fwrite(fid, bytes1, 'uint8');
bytes2 = unicode2native(str2, 'Shift_JIS');
fwrite(fid, bytes2, 'uint8');
fclose(fid);
See Also
Was this topic helpful?
|
{
"url": "http://www.mathworks.de/de/help/matlab/ref/unicode2native.html?nocookie=true",
"source_domain": "www.mathworks.de",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "42743",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HMOBZDYFMERGITAACTL3K5IM2MXQAGKG",
"WARC-Concurrent-To": "<urn:uuid:5ab3d0af-f139-44be-bf8c-fefd383f6214>",
"WARC-Date": "2014-03-15T20:58:50Z",
"WARC-IP-Address": "23.6.21.97",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AP6CTDCU5VO62OUBJGUNBHCNAXF7JW3G",
"WARC-Record-ID": "<urn:uuid:fad0f22e-73a4-43a5-8aff-51c7940638dd>",
"WARC-Target-URI": "http://www.mathworks.de/de/help/matlab/ref/unicode2native.html?nocookie=true",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a4bda855-aa54-475b-8f61-682db0af51ae>"
},
"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,
21,
22,
33,
53,
54,
69,
70,
128,
129,
136,
137,
172,
216,
217,
229,
230,
574,
575,
947,
948,
957,
958,
1427,
1428,
1459,
1504,
1534,
1578,
1608,
1621,
1622,
1631,
1632
],
"line_end_idx": [
21,
22,
33,
53,
54,
69,
70,
128,
129,
136,
137,
172,
216,
217,
229,
230,
574,
575,
947,
948,
957,
958,
1427,
1428,
1459,
1504,
1534,
1578,
1608,
1621,
1622,
1631,
1632,
1655
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1655,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25159236788749695,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019108280539512634,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26433122158050537,
"rps_doc_frac_unique_words": 0.5183486342430115,
"rps_doc_mean_word_length": 6.013761520385742,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.375944137573242,
"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.05339435860514641,
"rps_doc_frac_chars_top_3gram": 0.022883299738168716,
"rps_doc_frac_chars_top_4gram": 0.03051106072962284,
"rps_doc_books_importance": -122.1329345703125,
"rps_doc_books_importance_length_correction": -108.61966705322266,
"rps_doc_openwebtext_importance": -86.56403350830078,
"rps_doc_openwebtext_importance_length_correction": -86.56403350830078,
"rps_doc_wikipedia_importance": -63.56361770629883,
"rps_doc_wikipedia_importance_length_correction": -51.59406280517578
},
"fasttext": {
"dclm": 0.7724940180778503,
"english": 0.589033842086792,
"fineweb_edu_approx": 3.5345466136932373,
"eai_general_math": 0.8878665566444397,
"eai_open_web_math": 0.04703276976943016,
"eai_web_code": 0.8878586888313293
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,377,391,021,700,241,400
|
This action shooter has a strong RPG component and can be played solo, multiplayer, or in multiplayer mode. During the game, you play as a superpowered guardian (3 classes) and upgrade your gear by completing different activities.
In my opinion, Destiny is the best video game franchise at the moment. With each release, there has been something I enjoy; I started out casually but became more involved after year one. However, having recently split from Activision and released shadow keep and new light, Bungie’s game is in excellent shape. But, unfortunately, there are still some flaws that bother users.
Recently, some users started reporting that Destiny 2 keeps crashing on Steam. Well, when team iTechHacks investigate this issue, we found some solutions that will surely help you resolve the Destiny 2 keeps crashing issue on Steam. So, let’s have a look at those fixes.
Fix Destiny 2 That Keeps Crashing on Steam
Fixing Destiny 2 keeps crashing issues on Steam isn’t going to be very tough for you as you have to perform some simple fixes that we have mentioned further in this article. So, let’s have a look at them:
How To Fix Destiny 2 That Keeps Crashing on Steam
Restart the Destiny 2 Game
If you are experiencing crashing in Destiny 2, the first step is to restart the game on your Steam launcher. It is generally true that closing and reopening the game will resolve half of the problems encountered by people. Restarting the game reduces the chances of carrying any bugs or glitches causing the issue.
Stop Apps Running in The Background
You can run Destiny 2 without any issues if you close any updates, downloads, or applications running in the background. By doing so, you’ll be able to give your PC or console the computing power it needs to run Destiny 2 smoothly. To do so,
1. Initially, open the task manager and go to the processes tab.
2. Thereafter, select the apps one by one and hit the end task button.End Task
Restart your PC/Console
You can resolve the error by restarting your PC and reopening the game after it has been closed. The whole system will be opened and restarted, which should fix some bugs and errors that might be causing the issue.
Check for Windows Update
Another reason a system may crash the application is if it is not keeping up with system updates. Almost everyone makes this error almost every day, and it goes unnoticed. If you wish for your PC to run smoothly, it is recommended that you update your Windows 11. You can check whether any updates are viable by following the steps below.
1. Initially, click the settings icon in the start menu.
2. Next, tap on Windows Update and select Check for updates. Once you have done this, the system will take a few minutes to check for updates. If there are any, we will notify you.Check For Updates
Update Your GPU Driver
You may be required to update your GPU drivers if you frequently encounter stuttering, crashing, or lagging issues while playing Destiny 2 in the Steam client. It sometimes happens that an old GPU driver causes you to face crash issues while playing games. You can update your GPU driver by following these steps:
1. Initially, on your Windows 11 computer, open Device Manager.
2. Click on Display Adapters.
3. Afterward, right-click on your GPU’s manufacturer name and select Update driver.Update GPU Driver
Reset Device
If you have been experiencing crashes or stutters while playing Destiny 2 on Steam for a while now, then you should restart your device. Furthermore, many Destiny 2 players have reported that these types of technical problems have been resolved by doing this.
Please try this and let me know if it works for you. Nevertheless, if you are unsure how to reset your Windows device, then follow these steps:
1. To begin, open the Windows Settings and select the System option.
2. Then, tap on the Recovery button.
3. After that, click Reset This PC next to Reset PC.Reset PC
Reinstall The Steam Client
If you still find that Destiny 2 keeps crashing on Steam at startup, then you must try reinstalling the Steam Client, as chances are there that some of your Steam installation files may get corrupted, due to which you are facing this issue.
So, when you reinstall the client, each file gets removed and reinstalled automatically on your PC. Therefore, you must do this and check whether it helps or not.
Try changing Nvidia/AMD GPU Settings
The next step is to try tweaking some GPU settings on your device if something else is needed with Destiny 2 keeps crashing on the Steam problem. To accomplish this:
For Nvidia GPU Settings:
Use advanced 3D image settings if you want to adjust image settings with a preview. Click ‘Adjust image settings with preview‘ under 3D settings. In this situation:
1. Click Manage 3D settings on the left bar.
2. Click on the Program Settings tab.
3. Go to Select a program to customize and select Destiny 2.
4. If you cannot find it on the list, click the Add button.
5. It is necessary to manually add Destiny 2 if you are still waiting to see it in your list. Select Browse from the menu.
6. Find the installation folder for the game.
7. You will need to select the executable file (.exe) using Destiny2.exe as the executable file.
8. Since the program settings have been added, the game can use them now.
9. Edit as follows:
• Power Management: Prefer Maximum Performance
• Low Latency Mode: Off
• Image Sharpening: Off
• Threaded Optimization: On
• Texture filtering – Quality: Performance
You don’t need to touch anything else. You will need to restart your PC once you have applied the settings. Once that’s done, rerun Destiny 2 and see if the keeps crashing issues persist on your Windows PC or not.
For AMD Settings:
• Radeon Boost: Disabled
• Image Sharpening: Off
• Texture Filtering Quality: Performance
• OpenGL Triple Buffering: Off
• Shader Cache: AMD optimized
• Anti-Aliasing Mode: Use Application settings
• Anti-aliasing Method: Multi-sampling
• Morphological Filtering: Off
• Anisotropic Filtering: Disabled
• Radeon Anti-Lag: Disabled
• Maximum Tesselation Level: Off
• GPU Workload: Graphics
• Radeon Chill: Off
• Frame Rate Target Control: Disabled
• Surface Format Optimization: Enabled
• Tesselation Mode: AMD Optimized
• Wait for V-sync: Off
Set High Priority
Users report that the keeps crashing on Steam issue disappears automatically if they set high priority to Destiny 2 on Task Manager. As a result, you should also give it a try:
1. Launch Destiny 2.
2. Press Alt+Tab to minimize the game.
3. Open Task Manager.
4. Go to the Details tab.
5. Locate Destiny2.exe in the list.
6. Finally, right-click on the process and Set Priority to High.Set To High Priority
Reinstall The Game
You can try reinstalling Destiny 2 if nothing else works to get rid of the Destiny 2 keeps crashing on Steam issue if nothing else works. It is, therefore, necessary for you to reinstall the game and test if everything has been resolved for you.
From Author’s Desk
So, that’s how to fix Destiny 2 keeps crashing on Steam on your device. We hope the troubleshooting methods discussed earlier in this article have helped you. However, now that you know what we mean, if you have any questions, let us know in the comments below.
RELATED GUIDES:
LEAVE A REPLY
Please enter your comment!
Please enter your name here
|
{
"url": "https://itechhacks.com/destiny-2-that-keeps-crashing/",
"source_domain": "itechhacks.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "252220",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TLYCPK4MPUUIUUCCJFJYAH7JJS4ADP36",
"WARC-Concurrent-To": "<urn:uuid:9f00c73a-a888-470e-9d94-86fdb98e3e6b>",
"WARC-Date": "2022-12-02T23:30:33Z",
"WARC-IP-Address": "172.67.144.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HYH77Y5UJU4IKRPGF5F3K6WPFXSBBVRQ",
"WARC-Record-ID": "<urn:uuid:b2651a99-2a83-45ae-85b8-4b39c4e8a0a0>",
"WARC-Target-URI": "https://itechhacks.com/destiny-2-that-keeps-crashing/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:00c1ebec-c994-4db0-8b6a-5fd79e454aff>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-28\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
231,
232,
610,
611,
882,
883,
926,
927,
1132,
1133,
1183,
1184,
1211,
1212,
1528,
1529,
1565,
1566,
1809,
1810,
1877,
1958,
1959,
1983,
1984,
2199,
2200,
2225,
2226,
2565,
2566,
2625,
2825,
2826,
2849,
2850,
3164,
3165,
3231,
3263,
3366,
3367,
3380,
3381,
3641,
3642,
3787,
3788,
3859,
3898,
3961,
3962,
3989,
3990,
4231,
4232,
4396,
4397,
4434,
4435,
4601,
4602,
4627,
4628,
4793,
4794,
4841,
4881,
4944,
5006,
5131,
5179,
5278,
5354,
5376,
5427,
5455,
5483,
5515,
5562,
5563,
5777,
5778,
5796,
5797,
5824,
5850,
5893,
5926,
5958,
6007,
6048,
6081,
6117,
6147,
6182,
6209,
6231,
6271,
6312,
6348,
6373,
6374,
6392,
6393,
6570,
6571,
6594,
6635,
6659,
6687,
6725,
6812,
6813,
6832,
6833,
7080,
7081,
7100,
7101,
7364,
7365,
7381,
7382,
7396,
7397,
7424
],
"line_end_idx": [
231,
232,
610,
611,
882,
883,
926,
927,
1132,
1133,
1183,
1184,
1211,
1212,
1528,
1529,
1565,
1566,
1809,
1810,
1877,
1958,
1959,
1983,
1984,
2199,
2200,
2225,
2226,
2565,
2566,
2625,
2825,
2826,
2849,
2850,
3164,
3165,
3231,
3263,
3366,
3367,
3380,
3381,
3641,
3642,
3787,
3788,
3859,
3898,
3961,
3962,
3989,
3990,
4231,
4232,
4396,
4397,
4434,
4435,
4601,
4602,
4627,
4628,
4793,
4794,
4841,
4881,
4944,
5006,
5131,
5179,
5278,
5354,
5376,
5427,
5455,
5483,
5515,
5562,
5563,
5777,
5778,
5796,
5797,
5824,
5850,
5893,
5926,
5958,
6007,
6048,
6081,
6117,
6147,
6182,
6209,
6231,
6271,
6312,
6348,
6373,
6374,
6392,
6393,
6570,
6571,
6594,
6635,
6659,
6687,
6725,
6812,
6813,
6832,
6833,
7080,
7081,
7100,
7101,
7364,
7365,
7381,
7382,
7396,
7397,
7424,
7451
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7451,
"ccnet_original_nlines": 127,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3676861822605133,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02393616922199726,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18949468433856964,
"rps_doc_frac_unique_words": 0.3533596694469452,
"rps_doc_mean_word_length": 4.611067295074463,
"rps_doc_num_sentences": 98,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.418701648712158,
"rps_doc_word_count": 1265,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06154637038707733,
"rps_doc_frac_chars_dupe_6grams": 0.03874507173895836,
"rps_doc_frac_chars_dupe_7grams": 0.02297274023294449,
"rps_doc_frac_chars_dupe_8grams": 0.012000690214335918,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.030173150822520256,
"rps_doc_frac_chars_top_3gram": 0.0205726008862257,
"rps_doc_frac_chars_top_4gram": 0.02520143985748291,
"rps_doc_books_importance": -713.6127319335938,
"rps_doc_books_importance_length_correction": -713.6127319335938,
"rps_doc_openwebtext_importance": -381.7887268066406,
"rps_doc_openwebtext_importance_length_correction": -381.7887268066406,
"rps_doc_wikipedia_importance": -228.081298828125,
"rps_doc_wikipedia_importance_length_correction": -228.081298828125
},
"fasttext": {
"dclm": 0.0228195209056139,
"english": 0.8725868463516235,
"fineweb_edu_approx": 1.133513331413269,
"eai_general_math": 0.06412457674741745,
"eai_open_web_math": 0.20918023586273193,
"eai_web_code": 0.01043837983161211
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,148,088,806,033,880,000
|
Take the 2-minute tour ×
Server Fault is a question and answer site for professional system and network administrators. It's 100% free, no registration required.
I happen to run into various problems regarding grub and kernels. I don't really care about the kernel internas. All I want is VMware server in that dedicated root-server.
1.) What is a bzImage vs. vmlinuz?
kaze:~# ls /boot/
System.map-2.6.32-5-amd64 bzImage-2.6.33.2 config-2.6.33.2 initrd.img-2.6.32-5-amd64
System.map-2.6.33.2 bzImage-2.6.35.6 config-2.6.35.6 vmlinuz-2.6.32-5-amd64
System.map-2.6.35.6 config-2.6.32-5-amd64 grub
I updated my menu.lst (grub2):
timeout 5
default 0
fallback 1
title 2.6.32.5
kernel (hd0,1)/boot/vmlinuz-2.6.32-5-amd64 root=/dev/sda2 panic=60 noapic acpi=off
title 2.6.35.6
kernel (hd0,1)/boot//bzImage-2.6.35.6 root=/dev/sda2 panic=60 noapic acpi=off
title 2.6.32.3
kernel (hd0,1)/boot//bzImage-2.6.33.2 root=/dev/sda2 panic=60 noapic acpi=off
That doesn't do well... I think the vmlinuz file is missing initrd or so. Dunno. In fact I don't give too much about kernel boot voodoo as long as it works. update-grub(2) does not work. Does anybody know what magical trick there is to get the 2.6.32-5 booting?
2.) I thought t follow the Deban wiki.. I cannot get header-files for the installed 35.6 or 33.2 kernel in the repositories. I cannot build foreign headers because they will not match the running kernel. So how does one deal with that situtation? I'd prefer not to have to downgrade the kernel.
Thanks for any answers!
share|improve this question
closed as too localized by voretaq7 Nov 16 '12 at 20:12
This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.
1
Oh god, VMWare server is EOL. Use a supported and current product. – MDMarra Jun 7 '12 at 20:59
1 Answer 1
Well from the looks these 2.6.33 and 2.6.35 images were built by someone by hand... because once you build your kernel from source kernel image is named bzImage, and whoever made it just moved bzImage file to /boot and appended the version to the name. There is no difference in vmlinuz and bzImage; it's just convention once you install the kernel in boot you name it vmlinuz. Now those made by hand probably don't need initrd for booting but the 2.6.32-5-amd64 one needs it.
Try adding the line
initrd /boot/initrd.img-2.6.32-5-amd64
in the block after kernel line.
share|improve this answer
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://serverfault.com/questions/237816/update-grub-on-squeeze-kernel-downgrade-due-vmware-server",
"source_domain": "serverfault.com",
"snapshot_id": "crawl=CC-MAIN-2014-42",
"warc_metadata": {
"Content-Length": "60269",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:42VX5ZCMZ5ZXA7AFRVCDWKJLKCTYREOK",
"WARC-Concurrent-To": "<urn:uuid:5f12be4f-e52d-4c81-87cb-7d5bd1ae32b9>",
"WARC-Date": "2014-10-23T11:57:33Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AWCZ7MC6DV7XVCPRJKPKENPW3HRUDMG5",
"WARC-Record-ID": "<urn:uuid:30d2f6f6-109f-4f8d-a2bc-f07c1a78d69c>",
"WARC-Target-URI": "http://serverfault.com/questions/237816/update-grub-on-squeeze-kernel-downgrade-due-vmware-server",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:714cce74-a849-4a21-abf2-42a822444a49>"
},
"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,
162,
163,
335,
336,
371,
372,
390,
479,
561,
612,
613,
644,
645,
655,
673,
684,
685,
700,
787,
788,
803,
886,
887,
902,
985,
986,
1248,
1249,
1544,
1545,
1569,
1570,
1598,
1599,
1655,
1656,
2074,
2075,
2079,
2176,
2177,
2188,
2189,
2666,
2667,
2687,
2688,
2727,
2728,
2760,
2761,
2787,
2788
],
"line_end_idx": [
25,
162,
163,
335,
336,
371,
372,
390,
479,
561,
612,
613,
644,
645,
655,
673,
684,
685,
700,
787,
788,
803,
886,
887,
902,
985,
986,
1248,
1249,
1544,
1545,
1569,
1570,
1598,
1599,
1655,
1656,
2074,
2075,
2079,
2176,
2177,
2188,
2189,
2666,
2667,
2687,
2688,
2727,
2728,
2760,
2761,
2787,
2788,
2878
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2878,
"ccnet_original_nlines": 54,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25500667095184326,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014686250127851963,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.39786380529403687,
"rps_doc_frac_unique_words": 0.5806451439857483,
"rps_doc_mean_word_length": 5.025345802307129,
"rps_doc_num_sentences": 94,
"rps_doc_symbol_to_word_ratio": 0.004005339927971363,
"rps_doc_unigram_entropy": 5.168476104736328,
"rps_doc_word_count": 434,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.033012378960847855,
"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.022008249536156654,
"rps_doc_frac_chars_top_3gram": 0.033012378960847855,
"rps_doc_frac_chars_top_4gram": 0.042640991508960724,
"rps_doc_books_importance": -322.1207580566406,
"rps_doc_books_importance_length_correction": -322.1207580566406,
"rps_doc_openwebtext_importance": -151.91445922851562,
"rps_doc_openwebtext_importance_length_correction": -151.91445922851562,
"rps_doc_wikipedia_importance": -55.98023223876953,
"rps_doc_wikipedia_importance_length_correction": -55.98023223876953
},
"fasttext": {
"dclm": 0.10226219892501831,
"english": 0.8801109790802002,
"fineweb_edu_approx": 1.557273030281067,
"eai_general_math": 0.017838479951024055,
"eai_open_web_math": 0.15785259008407593,
"eai_web_code": 0.0015600300393998623
}
}
|
{
"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": "-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": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,041,725,323,193,931,000
|
chickadee » chicken » sort
Module (chicken sort)
This module contains several procedures which deal with sorting of sequences (i.e., lists and vectors).
merge
merge LIST1 LIST2 LESS?procedure
merge! LIST1 LIST2 LESS?procedure
Joins two lists in sorted order. merge! is the destructive version of merge. LESS? should be a procedure of two arguments, that returns true if the first argument is to be ordered before the second argument.
sort
sort SEQUENCE LESS?procedure
sort! SEQUENCE LESS?procedure
Sort SEQUENCE, which should be a list or a vector. sort! is the destructive version of sort.
sorted?
sorted? SEQUENCE LESS?procedure
Returns true if the list or vector SEQUENCE is already sorted.
topological-sort
topological-sort DAG PREDprocedure
Sorts the directed acyclic graph dag DAG so that for every edge from vertex u to v, u will come before v in the resulting list of vertices.
DAG is a list of sublists. The car of each sublist is a vertex. The cdr is the adjacency list of that vertex, i.e. a list of all vertices to which there exists an edge from the car vertex. pred is procedure of two arguments that should compare vertices for equality.
Time complexity: O (|V| + |E|)
(topological-sort
'((shirt tie belt)
(tie jacket)
(belt jacket)
(watch)
(pants shoes belt)
(undershorts pants shoes)
(socks shoes))
eq?)
=>
(socks undershorts pants shoes watch shirt belt tie jacket)
If a cycle is detected during the sorting process, an exception of the condition kinds (exn runtime cycle) is thrown.
Previous: Module (chicken repl)
Next: Module (chicken string)
Contents »
|
{
"url": "http://api.call-cc.org/5/doc/chicken/sort",
"source_domain": "api.call-cc.org",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "6370",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7UYVYO5PTLOUKB2WG5DEW2BDWTSISTZL",
"WARC-Concurrent-To": "<urn:uuid:7280cea6-ecdb-4deb-9e2e-0be99f1c9b5b>",
"WARC-Date": "2024-02-22T12:17:23Z",
"WARC-IP-Address": "173.230.137.156",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QJN2KRGIGTXMBCO2FNAR5CQKLGL35ARW",
"WARC-Record-ID": "<urn:uuid:2e88edb0-d44b-41a8-8e2d-25494b79cccc>",
"WARC-Target-URI": "http://api.call-cc.org/5/doc/chicken/sort",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7c800761-54f0-4ca1-9919-28d4fdd6139b>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-31\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,
27,
28,
50,
51,
155,
156,
162,
163,
196,
230,
231,
439,
440,
445,
446,
475,
505,
506,
599,
600,
608,
609,
641,
642,
705,
706,
723,
724,
759,
760,
900,
901,
1168,
1169,
1200,
1201,
1219,
1245,
1267,
1290,
1307,
1335,
1370,
1394,
1406,
1407,
1410,
1411,
1471,
1472,
1590,
1591,
1592,
1624,
1625,
1655,
1656
],
"line_end_idx": [
27,
28,
50,
51,
155,
156,
162,
163,
196,
230,
231,
439,
440,
445,
446,
475,
505,
506,
599,
600,
608,
609,
641,
642,
705,
706,
723,
724,
759,
760,
900,
901,
1168,
1169,
1200,
1201,
1219,
1245,
1267,
1290,
1307,
1335,
1370,
1394,
1406,
1407,
1410,
1411,
1471,
1472,
1590,
1591,
1592,
1624,
1625,
1655,
1656,
1666
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1666,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28358209133148193,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06268656998872757,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22686566412448883,
"rps_doc_frac_unique_words": 0.4523809552192688,
"rps_doc_mean_word_length": 4.916666507720947,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.4479475021362305,
"rps_doc_word_count": 252,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.13397902250289917,
"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.019370460882782936,
"rps_doc_frac_chars_top_3gram": 0.02421307936310768,
"rps_doc_frac_chars_top_4gram": 0.0451977401971817,
"rps_doc_books_importance": -131.18563842773438,
"rps_doc_books_importance_length_correction": -117.91607666015625,
"rps_doc_openwebtext_importance": -75.8976058959961,
"rps_doc_openwebtext_importance_length_correction": -75.8976058959961,
"rps_doc_wikipedia_importance": -64.98818969726562,
"rps_doc_wikipedia_importance_length_correction": -53.57927703857422
},
"fasttext": {
"dclm": 0.09124910831451416,
"english": 0.8218612670898438,
"fineweb_edu_approx": 1.980209469795227,
"eai_general_math": 0.7579280734062195,
"eai_open_web_math": 0.17536956071853638,
"eai_web_code": 0.7030388712882996
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "511.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,475,077,515,831,477,000
|
dompointer
Dom Pointer ==========
Usage no npm install needed!
<script type="module">
import dompointer from 'https://cdn.skypack.dev/dompointer';
</script>
README
Dom Pointer
Positional Templating
<div id="example" class="panel panel-default">
<!-- Default panel contents -->
<div class="panel-heading">Panel heading</div>
<div class="panel-body">
<p>Some default panel content here.</p>
</div>
<!-- List group -->
<ul class="list-group">
<li class="list-group-item">Cras justo odio</li>
<li class="list-group-item">Dapibus ac facilisis in</li>
<li class="list-group-item">Morbi leo risus</li>
<li class="list-group-item">Porta ac consectetur ac</li>
<li class="list-group-item">Vestibulum at eros</li>
</ul>
</div>
import DomPointer from 'dompointer'
const el = document.querySelector('#example')
const dp = DomPointer.create(el, { comments: false })
dp.data(':0:0', 'Dom Pointer')
dp.data(':0:1', 'Pointers for a simple template engine');
dp.setAttibutes([
{ op: 'remove', 'path': ':0:0', name: 'class', val: 'panel-heading'}
{ op: 'add', 'path': ':0:0', name: 'class', val: 'panel-heading'}
])
dp.alias('heading', ':0:0')
dp.alias('body', ':0:1')
dp.data('heading', 'Dom Pointer')
dp.data('body', 'Pointers for a simple template engine');
dp.setAttibutes([
{ op: 'remove', 'path': 'heading', name: 'class', val: 'panel-heading'}
{ op: 'add', 'path': 'heading', name: 'class', val: 'panel-heading'}
])
Tests
Client Side:
npm run test
Server Side:
TODO
Bitdeli Badge
|
{
"url": "https://www.skypack.dev/view/dompointer",
"source_domain": "www.skypack.dev",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "39278",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BFQFFB2SRNKZKD3QI2ANOXY2IPNN5N42",
"WARC-Concurrent-To": "<urn:uuid:cc110607-f395-428a-a150-1314952a8d1c>",
"WARC-Date": "2024-04-23T07:03:49Z",
"WARC-IP-Address": "76.76.21.93",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:G3BLZ27TIKCD7ME2VQLWWF6Z5C4LYHXV",
"WARC-Record-ID": "<urn:uuid:8ac3e49d-4c0e-4346-8b71-5bdbcc8c5b59>",
"WARC-Target-URI": "https://www.skypack.dev/view/dompointer",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a6260740-3593-4b1b-ab5a-85440cd3fc04>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
12,
35,
36,
65,
66,
89,
152,
162,
163,
170,
171,
183,
184,
206,
207,
254,
288,
337,
364,
408,
417,
418,
440,
466,
519,
580,
633,
694,
750,
758,
765,
801,
802,
848,
902,
903,
934,
992,
1010,
1081,
1149,
1152,
1153,
1181,
1206,
1207,
1241,
1299,
1317,
1391,
1462,
1465,
1466,
1472,
1473,
1486,
1487,
1500,
1501,
1514,
1515,
1520,
1521
],
"line_end_idx": [
11,
12,
35,
36,
65,
66,
89,
152,
162,
163,
170,
171,
183,
184,
206,
207,
254,
288,
337,
364,
408,
417,
418,
440,
466,
519,
580,
633,
694,
750,
758,
765,
801,
802,
848,
902,
903,
934,
992,
1010,
1081,
1149,
1152,
1153,
1181,
1206,
1207,
1241,
1299,
1317,
1391,
1462,
1465,
1466,
1472,
1473,
1486,
1487,
1500,
1501,
1514,
1515,
1520,
1521,
1534
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1534,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0.00651889992877841,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04316547140479088,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004796159919351339,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5059952139854431,
"rps_doc_frac_unique_words": 0.6122449040412903,
"rps_doc_mean_word_length": 6.7959184646606445,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.0023980799596756697,
"rps_doc_unigram_entropy": 4.330414295196533,
"rps_doc_word_count": 147,
"rps_doc_frac_chars_dupe_10grams": 0.11611612141132355,
"rps_doc_frac_chars_dupe_5grams": 0.24824824929237366,
"rps_doc_frac_chars_dupe_6grams": 0.24824824929237366,
"rps_doc_frac_chars_dupe_7grams": 0.182182177901268,
"rps_doc_frac_chars_dupe_8grams": 0.11611612141132355,
"rps_doc_frac_chars_dupe_9grams": 0.11611612141132355,
"rps_doc_frac_chars_top_2gram": 0.0400400385260582,
"rps_doc_frac_chars_top_3gram": 0.048048049211502075,
"rps_doc_frac_chars_top_4gram": 0.09609609842300415,
"rps_doc_books_importance": -159.0972137451172,
"rps_doc_books_importance_length_correction": -147.83799743652344,
"rps_doc_openwebtext_importance": -113.22511291503906,
"rps_doc_openwebtext_importance_length_correction": -113.22511291503906,
"rps_doc_wikipedia_importance": -62.391212463378906,
"rps_doc_wikipedia_importance_length_correction": -49.189491271972656
},
"fasttext": {
"dclm": 0.7478242516517639,
"english": 0.19187642633914948,
"fineweb_edu_approx": 1.9017597436904907,
"eai_general_math": 0.007373270113021135,
"eai_open_web_math": 0.00676060002297163,
"eai_web_code": 0.8061618208885193
}
}
|
{
"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": "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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,060,248,367,993,020,000
|
iOS/Android的WebView中用file input支持拍照或选择相册的照片
如果我们的一个移动端的网页需要让用户上传一张照片，那么，通常而言，我们可以写了以下一段HTML代码
<input type='file' />
那么Mobile Web界面将会显示下面的一个控件，通过该控件，用户可以拍照或者选择手机中的文件而上传。
在iOS下，Mobile Safari会在你点击上面的控件之后弹出如下界面
Screen Shot 2017-03-12 at 下午6.44.31
在Android系统下，弹出的界面根据具体的Android版本（不同的厂商定制版本、不同的Android系统版本）不同而略有不同，不过，通常也会提供相机，相册等选项。下图为小米手机的例子。
IMG_20170312_184934
然而，如果你在原生的应用中内嵌了一个UIWebView/WKWebView（iOS）或者WebView（Android），你就会发现，原来在Mobile Safari和Chrome中可以正常运行的代码很有可能不能正常工作了。
在iOS系统下，你会发现，如果UIWebView所在的View Controller是通过presentViewController展示的，那么，你会发现，用户点击 后，你的iOS应用会出现一些奇怪的问题，如应用崩溃，如你在相册选择了照片之后，UIWebView所在的View Controller不见了，等等。
最后，我的解决方法是，不通过presentViewController展示UIWebView所在的View Controller，而是通过UINavigationController的pushViewController去展示View Controller。
而对于Android系统，应用内嵌的WebView本来就不支持使用文件上传功能，所以，<input type=’file’ />在Mobile Chrome上有效，到了应用内嵌的WebView中就无效了。
在Android上，我的解决方法是这样的，通过WebView的addJavascriptInterface注入一个camera对象，让WebView中的js代码通过camera对象从而唤起相机或者相册。
webView.addJavascriptInterface(new DemoJavaScriptInterface(), “demo”);
Javascript代码
window.demo.camera();
假设DemoJavaScriptInterface的是位于WebViewActivity里面的一个内部类，且WebViewActivity有一个私有变量String mCameraPhotoPath，那么，DemoJavaScriptInterface代码如下
final class DemoJavaScriptInterface {
DemoJavaScriptInterface() {
}
@JavascriptInterface
public void camera() {
Intent takePictureIntent = new Intent(MediaStore.ACTION_IMAGE_CAPTURE);
if (takePictureIntent.resolveActivity(getPackageManager()) != null) {
// Create the File where the photo should go
File photoFile = null;
try {
photoFile = createImageFile();
takePictureIntent.putExtra("PhotoPath", mCameraPhotoPath);
} catch (Exception ex) {
// Error occurred while creating the File
Log.e("WebViewSetting", "Unable to create Image File", ex);
}
// Continue only if the File was successfully created
if (photoFile != null) {
mCameraPhotoPath = photoFile.getAbsolutePath();
takePictureIntent.putExtra(MediaStore.EXTRA_OUTPUT,
Uri.fromFile(photoFile));
} else {
takePictureIntent = null;
}
}
Intent contentSelectionIntent = new Intent(Intent.ACTION_GET_CONTENT);
contentSelectionIntent.addCategory(Intent.CATEGORY_OPENABLE);
contentSelectionIntent.setType("image/*");
Intent[] intentArray;
if (takePictureIntent != null) {
intentArray = new Intent[]{takePictureIntent};
} else {
intentArray = new Intent[0];
}
chooserIntent = new Intent(Intent.ACTION_CHOOSER);
chooserIntent.putExtra(Intent.EXTRA_INTENT, contentSelectionIntent);
chooserIntent.putExtra(Intent.EXTRA_TITLE, "拍照或者选择图片");
chooserIntent.putExtra(Intent.EXTRA_INITIAL_INTENTS, intentArray);
Activity mContext = WebViewActivity.this;
if (Build.VERSION.SDK_INT >= 23) {
int checkCallPhonePermission = ContextCompat.checkSelfPermission(mContext, Manifest.permission.CAMERA);
if (checkCallPhonePermission != PackageManager.PERMISSION_GRANTED) {
ActivityCompat.requestPermissions(mContext, new String[]{Manifest.permission.CAMERA}, REQUEST_CODE_ASK_CAMERA);
return;
}
}
WebViewActivity.this.startActivityForResult(chooserIntent, 101);
}
}
WebViewActivity中的onActivityResult方法代码如下
@Override
protected void onActivityResult(int requestCode, int resultCode, Intent data) {
if (resultCode == Activity.RESULT_OK) {
switch (requestCode) {
case 101:
if(data == null){
String imageurl = mCameraPhotoPath;
//相机拍好的照片就保存在路径imageurl中
}
else{
Uri uri = data.getData();
//通过uri获取照片数据
}
break;
default:
return;
}
}
}
发表评论
电子邮件地址不会被公开。 必填项已用*标注
Solve : *
15 ⁄ 5 =
|
{
"url": "https://huang.sh/2017/03/iosandroid%E7%9A%84webview%E4%B8%AD%E7%94%A8file-input%E6%94%AF%E6%8C%81%E6%8B%8D%E7%85%A7%E6%88%96%E9%80%89%E6%8B%A9%E7%9B%B8%E5%86%8C%E7%9A%84%E7%85%A7%E7%89%87/",
"source_domain": "huang.sh",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "28302",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GAQHXMC6AUG5LBBNCM2C2DPLAUFLYGSJ",
"WARC-Concurrent-To": "<urn:uuid:947b5092-cd75-4586-801d-dc0cd036c941>",
"WARC-Date": "2017-12-11T05:30:36Z",
"WARC-IP-Address": "198.255.103.245",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QJFA3OZWN7VR4D4MLAOZZLEF3RQXVT65",
"WARC-Record-ID": "<urn:uuid:79350ed9-e442-4792-89f7-ea74438102b8>",
"WARC-Target-URI": "https://huang.sh/2017/03/iosandroid%E7%9A%84webview%E4%B8%AD%E7%94%A8file-input%E6%94%AF%E6%8C%81%E6%8B%8D%E7%85%A7%E6%88%96%E9%80%89%E6%8B%A9%E7%9B%B8%E5%86%8C%E7%9A%84%E7%85%A7%E7%89%87/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dabcf58b-ea1d-4760-8c3b-d8f636cf8c1b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-71-85.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
44,
45,
95,
96,
118,
119,
172,
173,
211,
247,
248,
343,
363,
364,
477,
478,
635,
636,
766,
767,
870,
871,
973,
974,
1045,
1046,
1059,
1060,
1082,
1083,
1214,
1215,
1254,
1290,
1300,
1301,
1330,
1361,
1362,
1450,
1536,
1601,
1644,
1670,
1725,
1808,
1853,
1919,
2003,
2025,
2026,
2100,
2145,
2217,
2293,
2351,
2380,
2430,
2452,
2470,
2471,
2558,
2636,
2695,
2696,
2734,
2783,
2850,
2875,
2924,
2942,
2943,
3010,
3095,
3167,
3250,
3251,
3309,
3360,
3484,
3573,
3709,
3741,
3763,
3781,
3782,
3863,
3864,
3878,
3879,
3885,
3886,
3926,
3927,
3937,
4021,
4069,
4104,
4130,
4168,
4228,
4277,
4299,
4325,
4375,
4413,
4435,
4436,
4463,
4464,
4489,
4517,
4531,
4541,
4542,
4548,
4549,
4554,
4555,
4577,
4578,
4588
],
"line_end_idx": [
44,
45,
95,
96,
118,
119,
172,
173,
211,
247,
248,
343,
363,
364,
477,
478,
635,
636,
766,
767,
870,
871,
973,
974,
1045,
1046,
1059,
1060,
1082,
1083,
1214,
1215,
1254,
1290,
1300,
1301,
1330,
1361,
1362,
1450,
1536,
1601,
1644,
1670,
1725,
1808,
1853,
1919,
2003,
2025,
2026,
2100,
2145,
2217,
2293,
2351,
2380,
2430,
2452,
2470,
2471,
2558,
2636,
2695,
2696,
2734,
2783,
2850,
2875,
2924,
2942,
2943,
3010,
3095,
3167,
3250,
3251,
3309,
3360,
3484,
3573,
3709,
3741,
3763,
3781,
3782,
3863,
3864,
3878,
3879,
3885,
3886,
3926,
3927,
3937,
4021,
4069,
4104,
4130,
4168,
4228,
4277,
4299,
4325,
4375,
4413,
4435,
4436,
4463,
4464,
4489,
4517,
4531,
4541,
4542,
4548,
4549,
4554,
4555,
4577,
4578,
4588,
4596
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4596,
"ccnet_original_nlines": 122,
"rps_doc_curly_bracket": 0.00826806016266346,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06509946286678314,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030741410329937935,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5424954891204834,
"rps_doc_frac_unique_words": 0.7326202988624573,
"rps_doc_mean_word_length": 15.347593307495117,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.741623878479004,
"rps_doc_word_count": 187,
"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.007317069917917252,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -175.49082946777344,
"rps_doc_books_importance_length_correction": -175.49082946777344,
"rps_doc_openwebtext_importance": -90.84736633300781,
"rps_doc_openwebtext_importance_length_correction": -90.84736633300781,
"rps_doc_wikipedia_importance": -9.396161079406738,
"rps_doc_wikipedia_importance_length_correction": -9.396161079406738
},
"fasttext": {
"dclm": 0.9959103465080261,
"english": 0.08587437868118286,
"fineweb_edu_approx": 3.1516854763031006,
"eai_general_math": 0.055139780044555664,
"eai_open_web_math": 0.03227167949080467,
"eai_web_code": 0.8209435343742371
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-286,657,871,757,067,200
|
Make Ajax HTTP unauthorized response code customizable #458
Closed
wants to merge 1 commit into
from
Conversation
Projects
None yet
2 participants
Cake currently returns 403 Forbidden when a user is unauthorized. This is the wrong response and should be changed to 401 Unauthorized (Request requires user authentication). 403 should be used when access is denied for a resource. Since such a change probably breaks loads of things a better solution would be to make it customizable.
Owner
markstory commented Feb 3, 2012
Why? The HTTP spec is pretty clean about the difference between 401 and 403. Since we aren't going to offer basic/digest auth 403 is more correct. 401 implies that there is an HTTP layer authentication possible, which there generally isn't.
@markstory markstory closed this Feb 3, 2012
The actual authentication implementation (digest, basic or whatever) is outside the scope of HTTP. Code 401 just implies the request failed because the user is unauthorized. The response should include a WWW-Authenticate for the client so that it knows what authentication implementation is expected. For 403 the HTTP spec clearly states "the request SHOULD NOT be repeated". With Cake's the request is repeated for authentication.
Furthermore after authentication you need a response code to indicate somebody (who's authenticated) not having permissions (due to ACL for example). Response 403 Forbidden fits perfectly for that requirement. Since 403 is already taken with Cake we're forced to abuse another response code. (Suggestions?)
Either way. The response code being hardcoded like it currently is, is not very pretty.
Owner
markstory commented Feb 4, 2012
Sure, but the only widely implemented versions of WWW-Authenticate are basic and digest. The property name doesn't sit well with me either, as the name doesn't match the default value. Lastly, no new features or behavior changes outside of bugfixes are being applied to 1.3.
If you have a better name suggestion I'll be happy to make pull requests for the 2.0 / 2.1 branches. I'd also suggest changing the default to 401 so that we can use 403 for ACL permissions. But that's up to you. :)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
|
{
"url": "https://github.com/cakephp/cakephp/pull/458",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "61484",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:N4GSFC6QZLKOTNZE3NK7IT5OUPIWOSKJ",
"WARC-Concurrent-To": "<urn:uuid:68405667-8776-44bd-a647-f67a628525e6>",
"WARC-Date": "2018-02-23T03:15:16Z",
"WARC-IP-Address": "192.30.253.113",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H65HQEM3EO344OQY7IA2AEF35M5E2IP7",
"WARC-Record-ID": "<urn:uuid:5c563672-c692-4ab3-9768-8aeac10f9bcc>",
"WARC-Target-URI": "https://github.com/cakephp/cakephp/pull/458",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8529ad15-6afe-4e98-b1d0-cd0b59214782>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-90-19.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,
60,
61,
68,
97,
102,
103,
116,
117,
126,
135,
150,
151,
487,
488,
494,
495,
527,
528,
769,
770,
815,
816,
1248,
1249,
1556,
1557,
1645,
1646,
1652,
1653,
1685,
1686,
1961,
1962,
2177,
2178
],
"line_end_idx": [
60,
61,
68,
97,
102,
103,
116,
117,
126,
135,
150,
151,
487,
488,
494,
495,
527,
528,
769,
770,
815,
816,
1248,
1249,
1556,
1557,
1645,
1646,
1652,
1653,
1685,
1686,
1961,
1962,
2177,
2178,
2275
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2275,
"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.3918918967247009,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029279280453920364,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20720720291137695,
"rps_doc_frac_unique_words": 0.5357142686843872,
"rps_doc_mean_word_length": 5.013736248016357,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.0022522499784827232,
"rps_doc_unigram_entropy": 4.926440715789795,
"rps_doc_word_count": 364,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.026301369071006775,
"rps_doc_frac_chars_top_3gram": 0.01972603052854538,
"rps_doc_frac_chars_top_4gram": 0.02849314920604229,
"rps_doc_books_importance": -194.96360778808594,
"rps_doc_books_importance_length_correction": -194.96360778808594,
"rps_doc_openwebtext_importance": -111.02096557617188,
"rps_doc_openwebtext_importance_length_correction": -111.02096557617188,
"rps_doc_wikipedia_importance": -100.59257507324219,
"rps_doc_wikipedia_importance_length_correction": -100.59257507324219
},
"fasttext": {
"dclm": 0.22630131244659424,
"english": 0.9295247197151184,
"fineweb_edu_approx": 1.1951031684875488,
"eai_general_math": 0.15246456861495972,
"eai_open_web_math": 0.08369970321655273,
"eai_web_code": 0.2966749668121338
}
}
|
{
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,919,255,004,308,324,000
|
Mark posts/replies as "Accepted answer" - StackOverflow style
I was wondering if Discourse could be enhanced by giving the topic starter the possibility to label an answer as “accepted”, similar to how StackOverflow works. Whenever I try to answer a question, and my answer turns out to be, let’s say, less than helpful, I go out of my way to keep my answer in plain view with strike-through formatting and give a reason why it was not such a brilliant idea.
But, it would be nice if when one came looking for an answer to a question, then find out that the question has already been posted and that there is an accepted answer to it. This will really help sifting through long threads that are potentially full of off-topic stuff and answers that turn out to be, “less than helpful”.
This could also help in identifying questions that have gone unanswered, giving e.g. McNeel staff the opportunity to focus on unanswered questions.
1 Like
We do not currently have this, however, we hope that good answers will have many “likes” and can be found that way.
We are adding some advanced querystring operators that could help there, you might be able to say “show me all topics in the {foo} category with no replies”.
I see my suggestion has been implemented, many thanks!
Examples from the first post I spotted it in:
|
{
"url": "https://discourse.mcneel.com/t/mark-posts-replies-as-accepted-answer-stackoverflow-style/4582",
"source_domain": "discourse.mcneel.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "27446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3J7JBIQMNWAYTGL5U7CIXBRVIZ5RIQLN",
"WARC-Concurrent-To": "<urn:uuid:2c501279-6ec9-4071-9bf7-e1d8fe8fd32c>",
"WARC-Date": "2022-06-26T11:25:48Z",
"WARC-IP-Address": "64.71.144.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ENBABR524OO7AWKDQVGGAVF2NQHJQJ7O",
"WARC-Record-ID": "<urn:uuid:49d14892-e83f-4eb3-9750-1a11742cbe12>",
"WARC-Target-URI": "https://discourse.mcneel.com/t/mark-posts-replies-as-accepted-answer-stackoverflow-style/4582",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b04b7215-71c1-4c7a-b2a1-97d851033d56>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-253\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,
62,
63,
460,
461,
787,
788,
936,
937,
944,
945,
1061,
1062,
1220,
1221,
1276,
1277
],
"line_end_idx": [
62,
63,
460,
461,
787,
788,
936,
937,
944,
945,
1061,
1062,
1220,
1221,
1276,
1277,
1322
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1322,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0.0015128599479794502,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5199999809265137,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01818181946873665,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14181818068027496,
"rps_doc_frac_unique_words": 0.6120689511299133,
"rps_doc_mean_word_length": 4.525862216949463,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.710585594177246,
"rps_doc_word_count": 232,
"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.0266666691750288,
"rps_doc_frac_chars_top_3gram": 0.013333329930901527,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -123.81827545166016,
"rps_doc_books_importance_length_correction": -123.81827545166016,
"rps_doc_openwebtext_importance": -70.440673828125,
"rps_doc_openwebtext_importance_length_correction": -70.440673828125,
"rps_doc_wikipedia_importance": -42.02900695800781,
"rps_doc_wikipedia_importance_length_correction": -42.02872085571289
},
"fasttext": {
"dclm": 0.032911598682403564,
"english": 0.9779983758926392,
"fineweb_edu_approx": 1.383978009223938,
"eai_general_math": 0.9342636466026306,
"eai_open_web_math": 0.3799179792404175,
"eai_web_code": 0.19886046648025513
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "302.22",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,450,709,436,180,104,000
|
DIGITAL FORENSICS SKILLSETS
Dear Readers,
Thanks for reaching out.
The need for computer and digital forensics experts is growing significantly due to the increase in cyberattacks, with digital forensics skillsets becoming a critical element in helping IT security teams learn from security incidents.
Computer Forensics is the application of scientific examination and data analysis performed on computer storage media to discover potential digital evidence for the purpose of presentation in a court of law.
This type of knowledge, also referred to as computer forensics, allows IT-Security Professionals to learn more about the techniques that cybercriminals use and abuse, so that they can implement security controls that makes those techniques less successful.
From that perspective, “Digital Forensics” is a key part of the organization’s risk management approach.
Forensic need practical exposures. Patience and discipline are of the utmost important factor for the same. As an average, most of the forensicators are depends on toolset and far away from the basic understanding with the concept of fundamentals.
Digital Forensics is NOT only a tool, its require combination of set of standards, tools and intelligence (common sense) to make it successful.
Remember, cyber forensics in NOT a single dedicated domain, its an amalgamation of various domains. And If you’re find cyber forensics boring, actually you’re learning it from wrong teacher.
Myself learning from day to day cyber incidents and every case having a unique modus operandi, hence depending on the defined principle is not sufficient. Well, coming back to objective of the article, “to catch a criminal, you have to think like criminla mindset. Hence, these Tactics, Techniques, and Procedures (TTPs) key concept is required.
The most important skills completely depend on what all steps are focusing in “digital forensics” from A to B;
A: Technical SkillSet
As I simplified in old article, nutshell (IPAD)
I identification
P preservation
A analysis
D documentation
I
Understanding and identification of different types of evidence, where the data could reside, understanding of file systems, different acquisitions methodologies, order of volatilities according to live and dead Forensics, triage as in best practices etc.
P
Follow the proper chain of custody, maintain integrity, understanding of hashing, verification, practical knowledge of a different set of tools for imaging, working on case management
A
Manual analysis rather depends on automated parsers forensics tools, interpretation with artefacts, capable to build parsers, enscript, automation, hex analysis, data carving, work on different tools which are available in the market, proven ability to benchmark toolsets, understanding of latest technology transformation respect to digital forensics, knowledge of working culture such as Government authority, Law enforcement, corporate etc. Updated with emerging technology Forensics.
D
Must have report writing skill set, good in presenting findings, data analysis, documentation (doc, excel), knowledge of different standard operating procedures, expertise in techno legal etc
B: Common Skillsets
Understanding of fundamentals in information security
Must be a keen learner of technology-focused
Knowledge of cyber threat intelligence and incident response
Networking, Programming, Malware Analysis domain-based skillset as addon
Some pointers mentioned long back, may found here
https://d3pakblog.wordpress.com/2017/07/16/forensics-as-career/
Disclaimer: Jotted down some pointers as per my understanding and experience. Pls, ignore grammatical mistakes. Thanks
One Comment Add yours
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
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
{
"url": "https://d3pakblog.wordpress.com/2021/04/04/digital-forensics-skillsets/",
"source_domain": "d3pakblog.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "83969",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5FP3LMMQNCUDQKKFCRARUFCWXD2CP22T",
"WARC-Concurrent-To": "<urn:uuid:185c83f0-37c3-40b0-8a6e-aa951c4192c7>",
"WARC-Date": "2021-04-15T07:16:46Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OGVCJKUGVNDFZDZG5LAKUJECFCMON4OV",
"WARC-Record-ID": "<urn:uuid:fbaf2905-3acb-4366-9910-7de5021ec19b>",
"WARC-Target-URI": "https://d3pakblog.wordpress.com/2021/04/04/digital-forensics-skillsets/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ee2c61a5-036e-4b62-b335-5fb2a3c83d9f>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-36.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,
28,
29,
43,
44,
69,
70,
305,
306,
514,
515,
772,
773,
878,
879,
1127,
1128,
1272,
1273,
1464,
1465,
1811,
1812,
1923,
1924,
1946,
1947,
1995,
2012,
2027,
2038,
2054,
2055,
2057,
2313,
2314,
2316,
2500,
2501,
2503,
2991,
2992,
2994,
3186,
3187,
3207,
3208,
3262,
3263,
3308,
3309,
3370,
3371,
3444,
3445,
3495,
3559,
3560,
3679,
3680,
3702,
3703,
3717,
3718,
3773,
3774,
3793,
3794,
3867,
3868,
3881,
3882,
3948,
3949,
3965,
3966,
4033,
4034,
4049,
4050,
4118,
4119,
4136,
4137
],
"line_end_idx": [
28,
29,
43,
44,
69,
70,
305,
306,
514,
515,
772,
773,
878,
879,
1127,
1128,
1272,
1273,
1464,
1465,
1811,
1812,
1923,
1924,
1946,
1947,
1995,
2012,
2027,
2038,
2054,
2055,
2057,
2313,
2314,
2316,
2500,
2501,
2503,
2991,
2992,
2994,
3186,
3187,
3207,
3208,
3262,
3263,
3308,
3309,
3370,
3371,
3444,
3445,
3495,
3559,
3560,
3679,
3680,
3702,
3703,
3717,
3718,
3773,
3774,
3793,
3794,
3867,
3868,
3881,
3882,
3948,
3949,
3965,
3966,
4033,
4034,
4049,
4050,
4118,
4119,
4136,
4137,
4217
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4217,
"ccnet_original_nlines": 83,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30686405301094055,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028263799846172333,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1668909788131714,
"rps_doc_frac_unique_words": 0.5404958724975586,
"rps_doc_mean_word_length": 5.699173450469971,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.361567974090576,
"rps_doc_word_count": 605,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03190255165100098,
"rps_doc_frac_chars_dupe_6grams": 0.01740138977766037,
"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.02320186048746109,
"rps_doc_frac_chars_top_3gram": 0.018561480566859245,
"rps_doc_frac_chars_top_4gram": 0.024361949414014816,
"rps_doc_books_importance": -289.54638671875,
"rps_doc_books_importance_length_correction": -289.54638671875,
"rps_doc_openwebtext_importance": -155.2696075439453,
"rps_doc_openwebtext_importance_length_correction": -155.2696075439453,
"rps_doc_wikipedia_importance": -132.64915466308594,
"rps_doc_wikipedia_importance_length_correction": -132.64915466308594
},
"fasttext": {
"dclm": 0.14997828006744385,
"english": 0.8890038132667542,
"fineweb_edu_approx": 2.5533957481384277,
"eai_general_math": 0.00031030000536702573,
"eai_open_web_math": 0.11327534914016724,
"eai_web_code": 9.500000146545062e-7
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "363.25",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Political activists"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,642,721,078,279,652,000
|
Вычисление объема
Нахождение расстояния между двумя точками
Пример решили: 52070 раз Сегодня решили: 4 раза
Выберите размерность:
Введите координаты точек:
Нахождение расстояния между двумя точками
Данный сервис поможет рассчитать расстояние между двумя точками на плоскости и в пространстве.
Расстояние между двумя точками
Расстояние между двумя точками равно квадратному корню из суммы квадратов разностей координат по каждой оси. Каждая точка на плоскости характеризуется двумя координатами, а каждая точка в пространстве – тремя.
Для того, чтобы определить расстояние между двумя точками на плоскости, надо ввести две координаты двух точек.
$$ \sqrt{(x_2 - x_1)^2 + (y_2 - y_1)^2} $$
Для того, чтобы найти расстояние между двумя точками в пространстве, надо ввести три координаты двух точек.
$$ \sqrt{(x_2 - x_1)^2 + (y_2 - y_1)^2 + (z_2 - z_1)^2} $$
Примеры решений
1. Найдите длину отрезка с координатами крайних точек А(3;-4) и В(-6;5).
Посмотреть решение
Решение:
Для нахождения длины отрезка воспользуемся формулой для определения расстояния между точками:
$$ d=\sqrt{((x2-x1)^2+(y2-y1)^2)} $$
Произведем подстановку:
$$ x1=3 $$
$$ x2=-6 $$
$$ y1=-4 $$
$$ y2=5 $$
$$ d=\sqrt{ (-6-3)^2+(5+4)^2)} = \sqrt{(81+81)} = 12,73 $$
Ответ:
$$ R = 12,73 $$
2. Определите расстояние между точками в трехмерной системе координат M(9;-3;1) и N(4;6;-14).
Посмотреть решение
Решение:
Воспользуемся формулой для определения расстояния между точками с тремя координатами:
$$ d=\sqrt{ ((x2-x1)^2+(y2-y1)^2+(z2-z1)^2) } $$
Подставим значения:
$$ x1=9 $$
$$ x2=4 $$
$$ y1=-3 $$
$$ y2=6 $$
$$ z1=1 $$
$$ z2=-14 $$
$$ d=\sqrt{((4-9)^2+(6+3)^2+(-14-1)^2)} = \sqrt{(25+81+225)}=18,19 $$
Ответ:
$$ R = 18,19 $$
3. Найдите периметр треугольника АВС с координатами вершин А(2;5), В(6;0), С(-3;-3)
Посмотреть решение
Решение:
Чтобы найти периметр треугольника, найдем длину каждой из его сторон, воспользовавшись формулой нахождения расстояния между двумя точками:
$$ d= \sqrt{ ((x2-x1)^2+(y2-y1)^2) } $$
Произведем подстановку:
$$ АВ= \sqrt{ ((6 -4)^2+(0-5)^2) }= \sqrt{(4+25)}=5,39 $$
$$ АС=\sqrt{((-3-2)^2+(-3-5)^2)}= \sqrt{(25+64)}=9,43 $$
$$ ВС= \sqrt{((-3-6)^2+(-3-0)^2)}= \sqrt{(81+9)}=9,49 $$
Периметр равен сумме всех сторон треугольника. Произведем расчет:
$$ Р=5,39+9,43+9,49=24,31 $$
Ответ:
$$ Р = 24,31 $$
Попробуйте другие сервисы
Написать нам
Оставить отзыв
Подтверждение
Теперь Вам нужно перейти в свою почту и подтвердить отправку отзыва
Обработка информации о пользователях
Мы обрабатываем ваши персональные данные исключительно для:
– организации Вашего участия в мероприятиях и опросах, организованных нами и нашими партнерами;
– коммуникации с вами, когда вы обращаетесь к нам, например, для получения консультационной поддержки.
|
{
"url": "https://algebra24.ru/rasstojanie-mezhdu-dvumja-tochkami",
"source_domain": "algebra24.ru",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "24621",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OULFQCUUKOBJRZURUQVFWJNXBEQ3BGEX",
"WARC-Concurrent-To": "<urn:uuid:08e46dd4-4900-45c5-9a49-1d6950988ec4>",
"WARC-Date": "2020-06-06T23:54:30Z",
"WARC-IP-Address": "92.53.76.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DNDLFSURJ554G7OXPYU2DMEDKYLHLWLE",
"WARC-Record-ID": "<urn:uuid:ff60a47d-b2f4-4a69-8c2a-6de33604128f>",
"WARC-Target-URI": "https://algebra24.ru/rasstojanie-mezhdu-dvumja-tochkami",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0cd33d6d-f42f-4f01-88af-79938f8850eb>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-190.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,
18,
19,
61,
62,
110,
132,
133,
159,
160,
161,
162,
163,
205,
206,
301,
302,
333,
334,
544,
545,
656,
657,
700,
701,
809,
810,
869,
870,
886,
961,
984,
997,
998,
1096,
1097,
1138,
1139,
1167,
1168,
1183,
1184,
1200,
1201,
1217,
1218,
1233,
1234,
1297,
1298,
1309,
1310,
1330,
1331,
1427,
1450,
1463,
1464,
1554,
1555,
1608,
1609,
1633,
1634,
1649,
1650,
1665,
1666,
1682,
1683,
1698,
1699,
1714,
1715,
1732,
1733,
1807,
1808,
1819,
1820,
1840,
1841,
1927,
1950,
1963,
1964,
2107,
2108,
2152,
2153,
2181,
2182,
2244,
2245,
2306,
2307,
2368,
2369,
2439,
2440,
2473,
2474,
2485,
2486,
2506,
2507,
2533,
2534,
2547,
2548,
2563,
2564,
2578,
2579,
2647,
2648,
2685,
2686,
2746,
2747,
2843,
2844
],
"line_end_idx": [
18,
19,
61,
62,
110,
132,
133,
159,
160,
161,
162,
163,
205,
206,
301,
302,
333,
334,
544,
545,
656,
657,
700,
701,
809,
810,
869,
870,
886,
961,
984,
997,
998,
1096,
1097,
1138,
1139,
1167,
1168,
1183,
1184,
1200,
1201,
1217,
1218,
1233,
1234,
1297,
1298,
1309,
1310,
1330,
1331,
1427,
1450,
1463,
1464,
1554,
1555,
1608,
1609,
1633,
1634,
1649,
1650,
1665,
1666,
1682,
1683,
1698,
1699,
1714,
1715,
1732,
1733,
1807,
1808,
1819,
1820,
1840,
1841,
1927,
1950,
1963,
1964,
2107,
2108,
2152,
2153,
2181,
2182,
2244,
2245,
2306,
2307,
2368,
2369,
2439,
2440,
2473,
2474,
2485,
2486,
2506,
2507,
2533,
2534,
2547,
2548,
2563,
2564,
2578,
2579,
2647,
2648,
2685,
2686,
2746,
2747,
2843,
2844,
2946
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2946,
"ccnet_original_nlines": 121,
"rps_doc_curly_bracket": 0.010183299891650677,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.00721501000225544,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021645020693540573,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9163058996200562,
"rps_doc_frac_unique_words": 0.6084142327308655,
"rps_doc_mean_word_length": 6.336569786071777,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.972908020019531,
"rps_doc_word_count": 309,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1695607751607895,
"rps_doc_frac_chars_dupe_6grams": 0.13176710903644562,
"rps_doc_frac_chars_dupe_7grams": 0.09295199066400528,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04085801914334297,
"rps_doc_frac_chars_top_3gram": 0.06945863366127014,
"rps_doc_frac_chars_top_4gram": 0.06894791126251221,
"rps_doc_books_importance": -352.9366455078125,
"rps_doc_books_importance_length_correction": -352.9366455078125,
"rps_doc_openwebtext_importance": -196.93357849121094,
"rps_doc_openwebtext_importance_length_correction": -196.93357849121094,
"rps_doc_wikipedia_importance": -199.31919860839844,
"rps_doc_wikipedia_importance_length_correction": -199.31919860839844
},
"fasttext": {
"dclm": 0.9999938011169434,
"english": 0.0001268600026378408,
"fineweb_edu_approx": 2.7462189197540283,
"eai_general_math": 0.00007904000085545704,
"eai_open_web_math": 0.8323166370391846,
"eai_web_code": 0.9813359975814819
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.15",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "516.1",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,994,630,100,753,640,000
|
What is the percentage increase/decrease from 826 to 6615?
Quickly work out the percentage increase or decrease from 826 to 6615 in this step-by-step percentage calculator tutorial. (Spoiler alert: it's 700.85%!)
So you want to work out the percentage increase or decrease from 826 to 6615? Fear not, intrepid math seeker! Today, we will guide you through the calculation so you can figure out how to work out the increase or decrease in any numbers as a percentage. Onwards!
In a rush and just need to know the answer? The percentage increase from 826 to 6615 is 700.85%.
What is the % change from to
Percentage increase/decrease from 826 to 6615?
An increase or decrease percentage of two numbers can be very useful. Let's say you are a shop that sold 826 t-shirts in January, and then sold 6615 t-shirts in February. What is the percentage increase or decrease there? Knowing the answer allows you to compare and track numbers to look for trends or reasons for the change.
Working out a percentage increase or decrease between two numbers is pretty simple. The resulting number (the second input) is 6615 and what we need to do first is subtract the old number, 826, from it:
6615 - 826 = 5789
Once we've done that we need to divide the result, 5789, by the original number, 826. We do this because we need to compare the difference between the new number and the original:
5789 / 826 = 7.0084745762712
We now have our answer in decimal format. How do we get this into percentage format? Multiply 7.0084745762712 by 100? Ding ding ding! We have a winner:
7.0084745762712 x 100 = 700.85%
We're done! You just successfully calculated the percentage difference from 826 to 6615. You can now go forth and use this method to work out and calculate the increase/decrease in percentage of any numbers.
Head back to the percentage calculator to work out any more calculations you need to make or be brave and give it a go by hand. Hopefully this article has shown you that it's easier than you might think!
|
{
"url": "https://nineplanets.org/percentage-calculator/what-is-percentage-difference-from-826-to-6615/",
"source_domain": "nineplanets.org",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "9553",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5GNS45QM74O24JROO5IC7SKZMOFUHSFY",
"WARC-Concurrent-To": "<urn:uuid:dc312200-dce2-4f71-a53a-26f9a2243fc1>",
"WARC-Date": "2020-10-28T11:46:49Z",
"WARC-IP-Address": "172.67.184.11",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Q2ORKGKNR5WCUTIARBEJO7WK6WGOF42A",
"WARC-Record-ID": "<urn:uuid:f86e58cc-e3d5-431e-a31c-82e2479677b7>",
"WARC-Target-URI": "https://nineplanets.org/percentage-calculator/what-is-percentage-difference-from-826-to-6615/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ca4e31ba-1f08-4f9d-b170-682c43846881>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-17.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,
59,
60,
214,
215,
478,
479,
576,
577,
606,
607,
654,
655,
982,
983,
1186,
1187,
1205,
1206,
1386,
1387,
1416,
1417,
1569,
1570,
1602,
1603,
1811,
1812
],
"line_end_idx": [
59,
60,
214,
215,
478,
479,
576,
577,
606,
607,
654,
655,
982,
983,
1186,
1187,
1205,
1206,
1386,
1387,
1416,
1417,
1569,
1570,
1602,
1603,
1811,
1812,
2015
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2015,
"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.4465116262435913,
"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.23720930516719818,
"rps_doc_frac_unique_words": 0.4005763828754425,
"rps_doc_mean_word_length": 4.5561957359313965,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.454458236694336,
"rps_doc_word_count": 347,
"rps_doc_frac_chars_dupe_10grams": 0.06451612710952759,
"rps_doc_frac_chars_dupe_5grams": 0.13345983624458313,
"rps_doc_frac_chars_dupe_6grams": 0.11385198682546616,
"rps_doc_frac_chars_dupe_7grams": 0.06451612710952759,
"rps_doc_frac_chars_dupe_8grams": 0.06451612710952759,
"rps_doc_frac_chars_dupe_9grams": 0.06451612710952759,
"rps_doc_frac_chars_top_2gram": 0.057558510452508926,
"rps_doc_frac_chars_top_3gram": 0.034155599772930145,
"rps_doc_frac_chars_top_4gram": 0.04933585971593857,
"rps_doc_books_importance": -158.33872985839844,
"rps_doc_books_importance_length_correction": -158.33872985839844,
"rps_doc_openwebtext_importance": -124.39629364013672,
"rps_doc_openwebtext_importance_length_correction": -124.39629364013672,
"rps_doc_wikipedia_importance": -95.18821716308594,
"rps_doc_wikipedia_importance_length_correction": -95.18821716308594
},
"fasttext": {
"dclm": 0.9936664700508118,
"english": 0.9222291707992554,
"fineweb_edu_approx": 2.933790683746338,
"eai_general_math": 0.9588960409164429,
"eai_open_web_math": 0.6240876317024231,
"eai_web_code": 0.08379161357879639
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"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": "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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,622,083,809,369,507,000
|
JavaScript
Article
By Craig Buckler
How to Block the Advert Blockers
By Craig Buckler
block advert blockersI recently wrote an article about why it’s important to choose file names that are not inadvertently blocked by ad blockers. The comments revealed that advert-blocking technology annoyed many site owners. Why should they produce premium content if they can not receive revenue in return?
Detecting for the presence of advert blockers is not possible. Different implementation technologies are used and they are not necessarily embedded in the browser. Ad blockers also work in different ways: some use a long list of advertiser domains whilst others use regular expressions to suppress matching URLs.
Regular expression matching is used by one of the most popular blockers, Firefox’s Adblock Plus add-on. However, we can exploit URL checking using a technique that prevents Adblock users viewing your content unless they disable the add-on.
--ADVERTISEMENT--
Your HTML page should follow this example:
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
<html lang="en">
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
<title>Advert Blocker blocking</title>
<meta http-equiv="content-language" content="en"><meta name="language" content="en">
<style type="text/css">
#content { display: none; }
#blockermessage
{
font-weight: bold;
text-align: center;
padding: 4px;
color: #fff;
background-color: #c00;
}
</style>
<script type="text/javascript" src="/banner-advert.js"></script>
</head>
<body>
<div id="content">
<h1>Main content</h1>
<p>This will be hidden to people using advert blockers.</p>
</div>
<div id="blockermessage">
<p>Please switch of your advert blocker and enable JavaScript to view this page.</p>
</div>
</body>
</html>
Explanation:
• The main content should be contained within an outer element, such as <div id="content">.
• You should provide an alternative message for people using an advert blocker, as shown in <div id="blockermessage">.
• It is important that the first two CSS rules on the page style these elements. Since external CSS file can be blocked, I would recommend embedding it directly in the HTML. The #content rule must be set to display: none, whilst the #blockermessage rule can be styled big, bold or in any way you choose.
• Finally, an external JavaScript file is included. This should be given a file/folder name that will trigger ad-blocking rules, e.g. banner-advert.js.
The code for banner-advert.js:
// reveal content to those not using an advert blocker
if (document.styleSheets && document.styleSheets.length > 0) {
var ss = document.styleSheets[0];
var bRule = (ss.cssRules ? ss.cssRules : ss.rules);
if (bRule.length > 1) {
bRule[0].style.display = "block";
bRule[1].style.display = "none";
}
}
It works in the following way:
1. As the page is loaded, the main content is switched off for everyone and only the #blockermessage is shown.
2. For most people, the banner-advert.js code is executed immediately. This alters the embedded styles so #content becomes visible and #blockermessage is hidden. It occurs before the main content is displayed so users should not see any difference.
3. AdBlock will spot banner-advert.js and refuse to load it. The styles are not modified so the main content remains hidden.
That should please many premium content site owners. But — hold back — I strongly recommend you do not implement this on your web site! There are a number of technical issues and blocking the blockers is futile … see Why Blocking Ad Blockers Will Fail.
See also: Why File Naming is More Important Than You Think.
Recommended
Sponsors
The most important and interesting stories in tech. Straight to your inbox, daily. Get Versioning.
Login or Create Account to Comment
Login Create Account
|
{
"url": "https://www.sitepoint.com/block-ad-blockers/",
"source_domain": "www.sitepoint.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "125708",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZETLG45P6JY2BP7KQNDB364GIXN23VW4",
"WARC-Concurrent-To": "<urn:uuid:07adf10d-5967-461a-8106-899902113a00>",
"WARC-Date": "2017-08-19T08:04:01Z",
"WARC-IP-Address": "54.148.84.95",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BUTTNF2VWYOVLLK25SYDGB5V7AYJA3QO",
"WARC-Record-ID": "<urn:uuid:560e2949-0273-4f45-96b2-95c2d14597bb>",
"WARC-Target-URI": "https://www.sitepoint.com/block-ad-blockers/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e38b07e9-1e0c-4a27-b5f5-1944145bd832>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-166-41-69.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,
11,
19,
36,
37,
70,
71,
88,
89,
398,
399,
712,
713,
953,
954,
972,
973,
1016,
1017,
1018,
1109,
1126,
1133,
1201,
1240,
1325,
1326,
1350,
1378,
1379,
1395,
1397,
1417,
1438,
1453,
1467,
1492,
1494,
1503,
1504,
1569,
1570,
1578,
1585,
1586,
1606,
1630,
1692,
1700,
1701,
1728,
1815,
1823,
1824,
1832,
1840,
1841,
1854,
1855,
1949,
2070,
2376,
2530,
2531,
2562,
2563,
2564,
2619,
2682,
2717,
2770,
2795,
2831,
2866,
2869,
2871,
2872,
2903,
2904,
3017,
3268,
3395,
3396,
3649,
3650,
3710,
3711,
3723,
3732,
3831,
3866
],
"line_end_idx": [
11,
19,
36,
37,
70,
71,
88,
89,
398,
399,
712,
713,
953,
954,
972,
973,
1016,
1017,
1018,
1109,
1126,
1133,
1201,
1240,
1325,
1326,
1350,
1378,
1379,
1395,
1397,
1417,
1438,
1453,
1467,
1492,
1494,
1503,
1504,
1569,
1570,
1578,
1585,
1586,
1606,
1630,
1692,
1700,
1701,
1728,
1815,
1823,
1824,
1832,
1840,
1841,
1854,
1855,
1949,
2070,
2376,
2530,
2531,
2562,
2563,
2564,
2619,
2682,
2717,
2770,
2795,
2831,
2866,
2869,
2871,
2872,
2903,
2904,
3017,
3268,
3395,
3396,
3649,
3650,
3710,
3711,
3723,
3732,
3831,
3866,
3886
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3886,
"ccnet_original_nlines": 90,
"rps_doc_curly_bracket": 0.002058669924736023,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24032825231552124,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018757330253720284,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2930832505226135,
"rps_doc_frac_unique_words": 0.5184502005577087,
"rps_doc_mean_word_length": 5.4852399826049805,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0.011723330244421959,
"rps_doc_unigram_entropy": 5.295870780944824,
"rps_doc_word_count": 542,
"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.009418100118637085,
"rps_doc_frac_chars_top_3gram": 0.018836190924048424,
"rps_doc_frac_chars_top_4gram": 0.013454419560730457,
"rps_doc_books_importance": -275.1431579589844,
"rps_doc_books_importance_length_correction": -275.1431579589844,
"rps_doc_openwebtext_importance": -190.68408203125,
"rps_doc_openwebtext_importance_length_correction": -190.68408203125,
"rps_doc_wikipedia_importance": -134.39328002929688,
"rps_doc_wikipedia_importance_length_correction": -134.39328002929688
},
"fasttext": {
"dclm": 0.07654047012329102,
"english": 0.7586774826049805,
"fineweb_edu_approx": 2.0084855556488037,
"eai_general_math": 0.1536296010017395,
"eai_open_web_math": 0.20923388004302979,
"eai_web_code": 0.10378987342119217
}
}
|
{
"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": "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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,054,779,583,960,556,000
|
Tips to Write Efficient SQL Queries
PURPOSE
=======
This document gives some tips on writing effective SQL queries.
SCOPE & APPLICATION
===================
This is intended for any user who uses DML statements in his/her application.
RELATED DOCUMENTS
=================
Oracle7 Server Tuning – On-line Documentation.
SQL is a flexible language. More than one SQL statement may meet the needs of
your application. Although two SQL statements may produce the same result,
Oracle may process one faster than the other. You can use the results of the
EXPLAIN PLAN statement to compare the execution plans and costs of the two
statements and determine which is more efficient. Following are some tips
which help in writing efficient queries.
1. If you specify 2 tables in the FROM clause of a SELECT statement, the
parser will process the tables from right to left, so the table name you
specify last will be processed first. In this case you have to choose one
table as driving table. Always choose the table with less number of records
as the driving table.
2. If three tables are being joined, select the intersection tables as the
driving table. The intersection table is the table that has many tables
dependent on it.
3. Never compare NULL to anything else. All expressions return NULL if one of
the operands is NULL. This is applicable for all operators except
Concatenation operator (||).
4. Use DECODE when you want to scan same rows repetitively or join the same
table repetitively.
Example:
——–
SELECT COUNT(*) , SUM(SAL)
FROM EMP
WHERE DEPTNO = 10
AND ENAME LIKE ‘MILLER’ ;
SELECT COUNT(*) , SUM(SAL)
FROM EMP
WHERE DEPTNO = 20
AND ENAME LIKE ‘MILLER’ ;
The same result can be achieved using a single query as follows:
SELECT COUNT(DECODE(DEPTNO,20,’X’)) DEPT20_COUNT,
COUNT(DECODE(DEPTNO,10,’X’)) DEPT10_COUNT,
SUM(DECODE(DEPTNO,20,SAL)) DEPT20_SAL,
SUM(DECODE(DEPTNO,10,SAL)) DEPT10_SAL
FROM EMP
WHERE ENAME LIKE ‘MILLER’ ;
5. Always use table alias and prefix all column names with the aliases when you
are using more than one table.
6. Use NOT EXISTS in place of NOT IN.
In sub-query statement such as the following NOT IN clause causes an
internal Sort/Merge.
SELECT *
FROM emp e
WHERE e.deptno NOT IN ( SELECT d.deptno
FROM dept d
WHERE d.dname like %S% ) ;
To improve performance use the following code.
SELECT *
FROM emp e
WHERE NOT EXISTS ( SELECT d.deptno
FROM dept d
WHERE d.deptno = e.deptno
AND d.dname LIKE ‘%S%’ ) ;
This would allow such statements to use an index, if one exists.
7. Use Joins in place of EXISTS.
In general, join tables rather than specifying sub-queries.
SELECT *
FROM emp e
WHERE EXISTS ( SELECT d.deptno
FROM dept d
WHERE e.deptno = d.deptno
AND d.dname = ‘RESEARCH’) ;
To improve performance use the following:
SELECT *
FROM emp e, dept d
WHERE e.deptno = d.deptno
AND d.dname = ‘RESEARCH’ ;
8. EXISTS in place of DISTINCT.
Use EXISTS in place of DISTINCT if you want the result set to contain
distinct values while joining tables.
SELECT DISTINCT d.deptno ,
d.dname ,
FROM dept d ,
emp e
WHERE d.deptno = e.deptno ;
The following SQL statement is a better alternative.
SELECT d.deptno ,
d.dname
FROM dept d
WHERE EXISTS ( SELECT e.deptno
FROM emp e
WHERE d.deptno = e.deptno ) ;
9. The optimizer fully evaluates expressions whenever possible and translates
certain syntactic constructs into equivalent constructs. This is done either
because Oracle can more quickly evaluate the resulting expression than the
original expression or because the original expression is merely a syntactic
equivalent of the resulting expression.
Any computation of constants is performed only once when the statement is
optimized rather than each time the statement is executed. Consider these
conditions that test for monthly salaries greater than 2000:
sal > 24000/12
sal > 2000
sal*12 > 24000
If a SQL statement contains the first condition, the optimizer simplifies it
into the second condition.
Note that the optimizer does not simplify expressions across comparison
operators. The optimizer does not simplify the third expression into the
second. For this reason, application developers should write conditions
that compare columns with constants whenever possible, rather than
conditions with expressions involving columns.
The Optimizer does not use index for the following statement.
SELECT *
FROM emp
WHERE sal*12 > 24000 ;
Instead use the following statement.
SELECT *
FROM emp
WHERE sal > 24000/12 ;
10. Never use NOT on an indexed column. Whenever Oracle encounters a NOT on an
index column, it will perform full-table scan.
SELECT *
FROM emp
WHERE NOT deptno = 0;
Instead use the following.
Note : Optimizer uses the index only when optimizer_goal=FIRST_ROWS,
otherwise it doesn’t use it in the below query either:
SELECT *
FROM emp
WHERE deptno > 0;
11. Never use a function / calculation on an indexed column. If there is any
function is used on an index column, optimizer will not use index. Use some
other alternative.
Examples:
/** Do Not use **/
SELECT *
FROM emp
WHERE SUBSTR(ENAME,1,3) = ‘MIL’ ;
/** Suggested Alternative **/
Note: Optimizer uses the index only when optimizer_goal is set to
FIRST_ROWS.
SELECT *
FROM emp
WHERE ENAME LIKE ‘MIL%’ ;
/** Do Not use **/
SELECT *
FROM emp
WHERE sal != 0 ;
Note: Index can tell you what is there in a table but not what is not in a
table.
Note: Optimizer uses the index only when optimizer_goal = FIRST_ROWS.
/** Suggested Alternative **/
SELECT *
FROM emp
WHERE sal > 0 ;
/** Do Not use **/
SELECT *
FROM emp
WHERE ename || job = ‘MILLERCLERK’ ;
Note: || is the concatenate function. Like other functions it disables
index.
/** Suggested Alternative **/
Note : Optimizer uses the index only when optimizer_goal=FIRST_ROWS.
SELECT *
FROM emp
WHERE ename = ‘MILLER’
AND job = ‘CLERK’ ;
.
Anúncios
Sobre Alexandre Pires
ORACLE OCS Goldengate Specialist, OCE RAC 10g R2, OCP 12C, 11g, 10g , 9i e 8i - Mais de 25 anos de experiência na área de TI. Participei de projetos na G&P alocado na TOK STOK, EDINFOR alocado na TV CIDADE "NET", 3CON Alocado no PÃO DE AÇUCAR, DISCOVER alocado na VIVO, BANCO IBI e TIVIT, SPC BRASIL, UOLDIVEO alocado no CARREFOUR e atualmente na ORACLE ACS atendendo os seguintes projetos: VIVO, CLARO, TIM, CIELO, CAIXA SEGUROS, MAPFRE, PORTO SEGURO, SULAMERICA, BRADESCO SEGUROS, BANCO BRADESCO, BASA, SANTANDER, CNJ, TSE, ELETROPAULO, EDP, SKY, NATURA, ODEBRESHT, NISSEI, SICREDI, CELEPAR, TAM, TIVIT, IBM, SMILES, CELEPAR, SERPRO,OKI,BANCO PAN, etc
Esse post foi publicado em PLSQL TUNING e marcado . Guardar link permanente.
Deixe um comentário
Preencha os seus dados abaixo ou clique em um ícone para log in:
Logotipo do WordPress.com
Você está comentando utilizando sua conta WordPress.com. Sair / Alterar )
Foto do Google+
Você está comentando utilizando sua conta Google+. Sair / Alterar )
Imagem do Twitter
Você está comentando utilizando sua conta Twitter. Sair / Alterar )
Foto do Facebook
Você está comentando utilizando sua conta Facebook. Sair / Alterar )
w
Conectando a %s
|
{
"url": "https://xanpires.wordpress.com/2012/05/20/tips-to-write-efficient-sql-queries/",
"source_domain": "xanpires.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "95486",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UP66OK4QEUNBAZOBMIAXZ3PRCGQDD4ZV",
"WARC-Concurrent-To": "<urn:uuid:e217a1f6-fe88-4c6b-9af9-eb84fe50230f>",
"WARC-Date": "2018-04-22T04:29:48Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JCIPIILPT6GA2V2QK5FWCWK47DD4GLUZ",
"WARC-Record-ID": "<urn:uuid:a90748b9-e281-4a73-8dd1-3d34e25b72bd>",
"WARC-Target-URI": "https://xanpires.wordpress.com/2012/05/20/tips-to-write-efficient-sql-queries/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:08ac667f-c262-437f-9e6f-5eb5a08988ee>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-35-148-49.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,
36,
37,
45,
53,
54,
118,
119,
139,
159,
160,
238,
239,
257,
275,
276,
323,
324,
402,
477,
554,
629,
703,
744,
745,
818,
891,
965,
1041,
1063,
1064,
1139,
1211,
1228,
1229,
1307,
1373,
1402,
1403,
1479,
1499,
1500,
1509,
1513,
1514,
1541,
1550,
1568,
1594,
1595,
1622,
1631,
1649,
1675,
1676,
1741,
1742,
1792,
1835,
1874,
1912,
1921,
1949,
1950,
2030,
2061,
2062,
2100,
2101,
2170,
2191,
2192,
2201,
2212,
2252,
2264,
2291,
2292,
2339,
2340,
2349,
2360,
2395,
2407,
2433,
2460,
2461,
2526,
2527,
2560,
2561,
2621,
2622,
2631,
2642,
2673,
2685,
2711,
2739,
2740,
2782,
2783,
2792,
2811,
2837,
2864,
2865,
2897,
2898,
2968,
3006,
3007,
3034,
3044,
3058,
3064,
3092,
3093,
3146,
3147,
3165,
3173,
3185,
3216,
3227,
3257,
3258,
3336,
3413,
3488,
3565,
3605,
3606,
3680,
3754,
3815,
3816,
3831,
3832,
3843,
3844,
3859,
3860,
3937,
3964,
3965,
4037,
4110,
4182,
4249,
4296,
4297,
4359,
4360,
4369,
4378,
4401,
4402,
4439,
4440,
4449,
4458,
4481,
4482,
4561,
4608,
4609,
4618,
4627,
4649,
4650,
4677,
4678,
4747,
4802,
4803,
4812,
4821,
4839,
4840,
4917,
4993,
5012,
5013,
5023,
5024,
5043,
5044,
5053,
5062,
5096,
5097,
5127,
5128,
5194,
5206,
5207,
5216,
5225,
5251,
5252,
5271,
5272,
5281,
5290,
5307,
5308,
5383,
5390,
5391,
5461,
5462,
5492,
5493,
5502,
5511,
5527,
5528,
5547,
5548,
5557,
5566,
5603,
5604,
5675,
5682,
5683,
5713,
5714,
5783,
5784,
5793,
5802,
5825,
5845,
5846,
5848,
5849,
5858,
5859,
5881,
5882,
6536,
6613,
6614,
6634,
6635,
6700,
6701,
6727,
6728,
6803,
6804,
6820,
6821,
6890,
6891,
6909,
6910,
6979,
6980,
6997,
6998,
7068,
7069,
7071,
7072
],
"line_end_idx": [
36,
37,
45,
53,
54,
118,
119,
139,
159,
160,
238,
239,
257,
275,
276,
323,
324,
402,
477,
554,
629,
703,
744,
745,
818,
891,
965,
1041,
1063,
1064,
1139,
1211,
1228,
1229,
1307,
1373,
1402,
1403,
1479,
1499,
1500,
1509,
1513,
1514,
1541,
1550,
1568,
1594,
1595,
1622,
1631,
1649,
1675,
1676,
1741,
1742,
1792,
1835,
1874,
1912,
1921,
1949,
1950,
2030,
2061,
2062,
2100,
2101,
2170,
2191,
2192,
2201,
2212,
2252,
2264,
2291,
2292,
2339,
2340,
2349,
2360,
2395,
2407,
2433,
2460,
2461,
2526,
2527,
2560,
2561,
2621,
2622,
2631,
2642,
2673,
2685,
2711,
2739,
2740,
2782,
2783,
2792,
2811,
2837,
2864,
2865,
2897,
2898,
2968,
3006,
3007,
3034,
3044,
3058,
3064,
3092,
3093,
3146,
3147,
3165,
3173,
3185,
3216,
3227,
3257,
3258,
3336,
3413,
3488,
3565,
3605,
3606,
3680,
3754,
3815,
3816,
3831,
3832,
3843,
3844,
3859,
3860,
3937,
3964,
3965,
4037,
4110,
4182,
4249,
4296,
4297,
4359,
4360,
4369,
4378,
4401,
4402,
4439,
4440,
4449,
4458,
4481,
4482,
4561,
4608,
4609,
4618,
4627,
4649,
4650,
4677,
4678,
4747,
4802,
4803,
4812,
4821,
4839,
4840,
4917,
4993,
5012,
5013,
5023,
5024,
5043,
5044,
5053,
5062,
5096,
5097,
5127,
5128,
5194,
5206,
5207,
5216,
5225,
5251,
5252,
5271,
5272,
5281,
5290,
5307,
5308,
5383,
5390,
5391,
5461,
5462,
5492,
5493,
5502,
5511,
5527,
5528,
5547,
5548,
5557,
5566,
5603,
5604,
5675,
5682,
5683,
5713,
5714,
5783,
5784,
5793,
5802,
5825,
5845,
5846,
5848,
5849,
5858,
5859,
5881,
5882,
6536,
6613,
6614,
6634,
6635,
6700,
6701,
6727,
6728,
6803,
6804,
6820,
6821,
6890,
6891,
6909,
6910,
6979,
6980,
6997,
6998,
7068,
7069,
7071,
7072,
7087
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7087,
"ccnet_original_nlines": 266,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26351815462112427,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1663244366645813,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25188228487968445,
"rps_doc_frac_unique_words": 0.38576778769493103,
"rps_doc_mean_word_length": 5.094569206237793,
"rps_doc_num_sentences": 94,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.458093643188477,
"rps_doc_word_count": 1068,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.22256937623023987,
"rps_doc_frac_chars_dupe_6grams": 0.16265392303466797,
"rps_doc_frac_chars_dupe_7grams": 0.11211173981428146,
"rps_doc_frac_chars_dupe_8grams": 0.06028303876519203,
"rps_doc_frac_chars_dupe_9grams": 0.019481709226965904,
"rps_doc_frac_chars_top_2gram": 0.0231575109064579,
"rps_doc_frac_chars_top_3gram": 0.03344973176717758,
"rps_doc_frac_chars_top_4gram": 0.03308214992284775,
"rps_doc_books_importance": -618.3522338867188,
"rps_doc_books_importance_length_correction": -618.3522338867188,
"rps_doc_openwebtext_importance": -280.5793151855469,
"rps_doc_openwebtext_importance_length_correction": -280.5793151855469,
"rps_doc_wikipedia_importance": -237.94717407226562,
"rps_doc_wikipedia_importance_length_correction": -237.94717407226562
},
"fasttext": {
"dclm": 0.8998560905456543,
"english": 0.6569218635559082,
"fineweb_edu_approx": 2.871579647064209,
"eai_general_math": 0.446479856967926,
"eai_open_web_math": 0.39811253547668457,
"eai_web_code": 0.4656040668487549
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,344,510,459,905,153,000
|
The Coordinate Plane
Views:
Category: Education
Presentation Description
No description available.
Comments
By: alielbasry (64 month(s) ago)
This presentation have lines written in Arabic language
Presentation Transcript
The Coordinate plane :
The Coordinate plane To represent the number plane, two number lines are used. One is drawn horizontally, while the other vertically, intersecting each other at the zero positions of both lines. The horizontal line is usually referred to as the x-axis and the vertical line as the y-axis. لتمثيل مستوى الأعداد ، يستعمل خطى أعداد. يرسم أحدهما أفقياً بينما الآخر رأسياً ، يتقاطع الخطان في موقع الصفر لكى الخطين. يطلق على الخط الأفقي محور x والمحور الرأسي محور y . A generic member of the number plane is denoted by the ordered pair (x , y) يرمز إلى أي عنصر عام في مستوى الأعداد بالزوج المرتب ( x , y ) The x-axis and the y-axis together form the coordinate axes and the plane formed by these axes is called the coordinate plane (sometimes known as the xy-plane). محور x ومحور y يكونان المحورين الإحداثيين والمستوى المتكون منهما يسمى المستوى الإحداثي ( معروف أحياناً بمستوى xy )
Slide 2:
1 2 3 4 1 2 3 4 5 6 5 6 7 -7 -6 -5 -4 -3 -2 -1 -1 -2 -6 -5 -4 -3 0
Properties of the xy-plane :
Properties of the xy-plane The graph of (0, 0) is called the origin. 1 ) النقطة (0,0) تسمى نقطة الأصل The graph of all ordered pairs of real numbers is the entire coordinate plane. 2) الممثل لكل الأزواج المرتبة من الأعداد الحقيقة هو المستوى الإحداثي كله. The first member of the ordered pair is called the abscissa while the second member is the ordinate. 3) يقـــال للعـنصـر الأول في الزوج المرتب بأنه ” فصل ” بينما العنـصـر الثانيهو ” ترتيب ” The abscissa of (2, -7) is 2 while the ordinate is -7. 4) إن فصل النقطة ( 2,-7) هو 2 وترتيبها هو -7 .
Slide 4:
1 2 3 4 1 2 3 4 5 6 5 6 7 -7 -6 -5 -4 -3 -2 -1 -1 -2 -6 -5 -4 -3 0 A B Q ( – 5 , 2) ( 2 , 5) (6 , – 2)
Slide 5:
1 2 3 4 1 2 3 4 5 6 5 6 7 -7 -6 -5 -4 -3 -2 -1 -1 -2 -6 -5 -4 -3 0 F G P M Give the coordinate of the pints whose are given below Example
Slide 6:
1 2 3 4 1 2 3 4 5 6 5 6 7 -7 -6 -5 -4 -3 -2 -1 -1 -2 -6 -5 -4 -3 0 Q II QI Q IV Q III Quadrant I y x Quadrant II Quadrant III Quadrant IV
Slide 7:
Thank you for listening to me Mr. Ali Abdalla
authorStream Live Help
|
{
"url": "http://www.authorstream.com/Presentation/alielbasry-914838-the-coordinate-plane/",
"source_domain": "www.authorstream.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "144056",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KDXMO6KOWXOI2RXPVRM6MRZLUUHBWXZB",
"WARC-Concurrent-To": "<urn:uuid:e2847055-ece8-4cf5-98c1-8e28b4c11df3>",
"WARC-Date": "2016-07-23T19:21:04Z",
"WARC-IP-Address": "104.16.61.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YVUAPOGNX3B36AL7S4ASKOTLS4O2RX63",
"WARC-Record-ID": "<urn:uuid:686ef894-7ffa-4d46-acbb-2ca4004f65c9>",
"WARC-Target-URI": "http://www.authorstream.com/Presentation/alielbasry-914838-the-coordinate-plane/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:693319fc-c31b-476a-85ad-7a13aa695cfa>"
},
"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,
21,
22,
29,
31,
51,
57,
59,
60,
85,
86,
112,
113,
122,
123,
156,
157,
213,
214,
238,
239,
263,
264,
1140,
1141,
1151,
1152,
1219,
1220,
1250,
1251,
1798,
1799,
1809,
1810,
1913,
1914,
1924,
1925,
2063,
2064,
2074,
2075,
2213,
2214,
2224,
2225,
2271,
2272,
2295
],
"line_end_idx": [
21,
22,
29,
31,
51,
57,
59,
60,
85,
86,
112,
113,
122,
123,
156,
157,
213,
214,
238,
239,
263,
264,
1140,
1141,
1151,
1152,
1219,
1220,
1250,
1251,
1798,
1799,
1809,
1810,
1913,
1914,
1924,
1925,
2063,
2064,
2074,
2075,
2213,
2214,
2224,
2225,
2271,
2272,
2295,
2296
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2296,
"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.16500000655651093,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03166666999459267,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5983333587646484,
"rps_doc_frac_unique_words": 0.4248366057872772,
"rps_doc_mean_word_length": 3.6405229568481445,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.619178771972656,
"rps_doc_word_count": 459,
"rps_doc_frac_chars_dupe_10grams": 0.06463196128606796,
"rps_doc_frac_chars_dupe_5grams": 0.06523039937019348,
"rps_doc_frac_chars_dupe_6grams": 0.06463196128606796,
"rps_doc_frac_chars_dupe_7grams": 0.06463196128606796,
"rps_doc_frac_chars_dupe_8grams": 0.06463196128606796,
"rps_doc_frac_chars_dupe_9grams": 0.06463196128606796,
"rps_doc_frac_chars_top_2gram": 0.014362660236656666,
"rps_doc_frac_chars_top_3gram": 0.014362660236656666,
"rps_doc_frac_chars_top_4gram": 0.019150210544466972,
"rps_doc_books_importance": -311.7413024902344,
"rps_doc_books_importance_length_correction": -311.7413024902344,
"rps_doc_openwebtext_importance": -184.36949157714844,
"rps_doc_openwebtext_importance_length_correction": -184.36949157714844,
"rps_doc_wikipedia_importance": -116.3563003540039,
"rps_doc_wikipedia_importance_length_correction": -116.3563003540039
},
"fasttext": {
"dclm": 0.7532132267951965,
"english": 0.23058517277240753,
"fineweb_edu_approx": 1.476500153541565,
"eai_general_math": 0.40489017963409424,
"eai_open_web_math": 0.7229059338569641,
"eai_web_code": 0.09453027695417404
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.15",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "516.1",
"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": "-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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,796,334,136,357,462,000
|
using System; using System.Collections.Generic; using System.Net; using System.Threading.Tasks; using Newtonsoft.Json; using Nibriboard.Client; using Nibriboard.Client.Messages; using Nibriboard.RippleSpace; using SBRL.GlidingSquirrel.Http; using SBRL.GlidingSquirrel.Websocket; using SBRL.Utilities; namespace Nibriboard { public class NibriboardAppStartInfo { public string FilePrefix { get; set; } public ClientSettings ClientSettings { get; set; } public RippleSpaceManager SpaceManager { get; set; } } public class NibriboardApp : WebsocketServer { private string filePrefix; private List embeddedFiles = new List(EmbeddedFiles.ResourceList); /// /// The ripple space manager that this client manager is connected to. /// public RippleSpaceManager SpaceManager { get; private set; } public LineIncubator LineIncubator = new LineIncubator(); private ClientSettings clientSettings; public List NibriClients = new List(); /// /// The number of clients currently connected to this Nibriboard. /// public int ClientCount { get { return Clients.Count; } } public NibriboardApp(NibriboardAppStartInfo startInfo, IPAddress inBindAddress, int inPort) : base(inBindAddress, inPort) { clientSettings = startInfo.ClientSettings; SpaceManager = startInfo.SpaceManager; filePrefix = startInfo.FilePrefix; MimeTypeOverrides.Add(".ico", "image/x-icon"); } public override Task HandleClientConnected(object sender, ClientConnectedEventArgs eventArgs) { NibriClient client = new NibriClient(this, eventArgs.ConnectingClient); client.Disconnected += (NibriClient disconnectedClient) => { NibriClients.Remove(disconnectedClient); Log.WriteLine("[NibriClient/#{0}] Client disconnected and removed from active clients list.", disconnectedClient.Id); }; NibriClients.Add(client); return Task.CompletedTask; } public override Task HandleClientDisconnected(object sender, ClientDisconnectedEventArgs eventArgs) { // We can't use this to remove the NibriClient from the list since we don't know which // NibriClient objects wrap which WebsocketClient instances return Task.CompletedTask; } public override async Task HandleHttpRequest(HttpRequest request, HttpResponse response) { if(request.Method != HttpMethod.GET) { response.ResponseCode = HttpResponseCode.MethodNotAllowed; response.ContentType = "text/plain"; await response.SetBody("Error: That method isn't supported yet."); logRequest(request, response); return HttpConnectionAction.Continue; } if(request.Url == "/Settings.json") { string settingsJson = JsonConvert.SerializeObject(clientSettings); response.ContentLength = settingsJson.Length; response.ContentType = "application/json"; await response.SetBody(settingsJson); Log.WriteLine("[Http/ClientSettings] Sent settings to {0}", request.ClientAddress); return HttpConnectionAction.Continue; } string expandedFilePath = getEmbeddedFileReference(request.Url); if(!embeddedFiles.Contains(expandedFilePath)) { expandedFilePath += "index.html"; } if(!embeddedFiles.Contains(expandedFilePath)) { response.ResponseCode = HttpResponseCode.NotFound; response.ContentType = "text/plain"; await response.SetBody($"Can't find '{expandedFilePath}'."); logRequest(request, response); return HttpConnectionAction.Continue; } response.ContentType = LookupMimeType(expandedFilePath); byte[] embeddedFile = EmbeddedFiles.ReadAllBytes(expandedFilePath); try { await response.SetBody(embeddedFile); } catch(Exception error) { Log.WriteLine($"[Nibriboard/EmbeddedFileHandler] Error: {error.Message} Details:"); Log.WriteLine(error.ToString()); } logRequest(request, response); return HttpConnectionAction.Continue; } #region Interface Methods /// /// Sends a message to all the connected clients, except the one who's sending it. /// /// The client sending the message. /// The message that is to bee sent. public void Broadcast(NibriClient sendingClient, Message message) { foreach(NibriClient client in NibriClients) { // Don't send the message to the sender if(client == sendingClient) continue; client.Send(message); } } /// /// Sends a message to everyone on the same plane as the sender, except the sender themselves. /// /// The sending client. /// The message to send. public void BroadcastPlane(NibriClient sendingClient, Message message) { foreach(NibriClient client in NibriClients) { // Don't send the message to the sender if(client == sendingClient) continue; // Only send the message to others on the same plane if(client.CurrentPlane != sendingClient.CurrentPlane) continue; client.Send(message); } } /// /// Sends a message to everyone on a specified plane. /// /// The plane to send the message to. /// The message to send. public void ReflectPlane(Plane plane, Message message) { foreach(NibriClient client in NibriClients) { if(client.CurrentPlane != plane) continue; client.Send(message); } } #endregion #region Utility Methods protected string getEmbeddedFileReference(string uri) { return filePrefix + "." + uri.TrimStart("/".ToCharArray()).Replace('/', '.'); } private void logRequest(HttpRequest request, HttpResponse response) { Log.WriteLine( "[Http/FileHandler] {0} {1} {2} {3}", response.ResponseCode, response.ContentType, request.Method, request.Url ); } public override bool ShouldAcceptConnection(HttpRequest connectionRequest, HttpResponse connectionResponse) { // TODO: Implement support for user accounts here return true; } #endregion } }
|
{
"url": "https://git.starbeamrainbowlabs.com/sbrl-github/Nibriboard/raw/commit/668f5be2f7ca37384db1feeaf0021c1d56c0f61d/Nibriboard/NibriboardApp.cs",
"source_domain": "git.starbeamrainbowlabs.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "7346",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CDDSHYMIDQM3BIVAEJ6Y5MLMUNQZB2GD",
"WARC-Concurrent-To": "<urn:uuid:20e068df-7124-441c-a20a-d640823bd657>",
"WARC-Date": "2022-12-09T20:30:27Z",
"WARC-IP-Address": "5.196.73.75",
"WARC-Identified-Payload-Type": "text/x-csharp",
"WARC-Payload-Digest": "sha1:Y7Z4P6K2PQQEEE3AKYSQ7MSO3OYDGG3I",
"WARC-Record-ID": "<urn:uuid:32315abd-ce19-4b50-8b34-a13634ffadad>",
"WARC-Target-URI": "https://git.starbeamrainbowlabs.com/sbrl-github/Nibriboard/raw/commit/668f5be2f7ca37384db1feeaf0021c1d56c0f61d/Nibriboard/NibriboardApp.cs",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dfb7dc30-6b90-4dfc-8037-032e0da2a8fe>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-177\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
5351
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5351,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.013829190284013748,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11454182863235474,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004980079829692841,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4243027865886688,
"rps_doc_frac_unique_words": 0.471783310174942,
"rps_doc_mean_word_length": 9.532731056213379,
"rps_doc_num_sentences": 100,
"rps_doc_symbol_to_word_ratio": 0.004980079829692841,
"rps_doc_unigram_entropy": 4.918892860412598,
"rps_doc_word_count": 443,
"rps_doc_frac_chars_dupe_10grams": 0.05825243145227432,
"rps_doc_frac_chars_dupe_5grams": 0.10845371335744858,
"rps_doc_frac_chars_dupe_6grams": 0.10466492921113968,
"rps_doc_frac_chars_dupe_7grams": 0.08003789186477661,
"rps_doc_frac_chars_dupe_8grams": 0.08003789186477661,
"rps_doc_frac_chars_dupe_9grams": 0.05825243145227432,
"rps_doc_frac_chars_top_2gram": 0.019180679693818092,
"rps_doc_frac_chars_top_3gram": 0.01704948954284191,
"rps_doc_frac_chars_top_4gram": 0.015155100263655186,
"rps_doc_books_importance": -490.2552185058594,
"rps_doc_books_importance_length_correction": -490.2552185058594,
"rps_doc_openwebtext_importance": -290.78033447265625,
"rps_doc_openwebtext_importance_length_correction": -290.78033447265625,
"rps_doc_wikipedia_importance": -140.6460723876953,
"rps_doc_wikipedia_importance_length_correction": -140.6460723876953
},
"fasttext": {
"dclm": 0.9772108793258667,
"english": 0.41080525517463684,
"fineweb_edu_approx": 2.530491352081299,
"eai_general_math": 0.7370939254760742,
"eai_open_web_math": 0.09924448281526566,
"eai_web_code": 0.9608620405197144
}
}
|
{
"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": "629.132",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-238,841,500,642,574,880
|
Friday, April 11, 2014
Spinner with different display text and return value
In the most basic Spinner implementation, selected item can be retrieved by calling parent.getItemAtPosition(position) in onItemSelected() method in OnItemSelectedListener. It will be the same object of the display items, as show in the spinner0 of the example.
Sometimes, we want to display some meaningful text in Spinner (such as "Sunday", "Monday"...), but return some other value when any item selected (such as 0, 2...).
Spinner with different display text and return value
Here I show two approaches:
• The first one may be the simplest method, spinner1 in the example. Create another array to hold the values we want to return. And return the coresponding item on position in onItemSelected().
• The second approach implement our custom class to hold the display text and the return value. And implement our custom Adapter, as shown in spinner2 in the example.
package com.example.androidspinnertext;
import android.app.Activity;
import android.content.Context;
import android.os.Bundle;
import android.view.View;
import android.view.ViewGroup;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemSelectedListener;
import android.widget.ArrayAdapter;
import android.widget.Spinner;
import android.widget.TextView;
public class MainActivity extends Activity {
String[] text0 = { "Sunday", "Monday", "Tuesday",
"Wednesday", "Thursday", "Friday", "Saturday" };
String[] text1 = { "SUNDAY", "MONDAY", "TUESDAY",
"WEDNESDAY", "THURSDAY", "FRIDAY", "SATURDAY" };
int[] val1 = { 0, 1, 2, 3, 4, 5, 6};
MyClass[] obj2 ={
new MyClass("SUN", 0),
new MyClass("MON", 1),
new MyClass("TUE", 2),
new MyClass("WED", 3),
new MyClass("THU", 4),
new MyClass("FRI", 5),
new MyClass("SAT", 6)
};
Spinner spinner0, spinner1, spinner2;
TextView textView0, textView1, textView2;
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_main);
textView0 = (TextView)findViewById(R.id.text0);
spinner0 = (Spinner)findViewById(R.id.spinner0);
ArrayAdapter<String> adapter0 =
new ArrayAdapter<String>(MainActivity.this,
android.R.layout.simple_spinner_item, text0);
adapter0.setDropDownViewResource(android.R.layout.simple_spinner_dropdown_item);
spinner0.setAdapter(adapter0);
spinner0.setOnItemSelectedListener(onItemSelectedListener0);
textView1 = (TextView)findViewById(R.id.text1);
spinner1 = (Spinner)findViewById(R.id.spinner1);
ArrayAdapter<String> adapter1 =
new ArrayAdapter<String>(MainActivity.this,
android.R.layout.simple_spinner_item, text1);
adapter1.setDropDownViewResource(android.R.layout.simple_spinner_dropdown_item);
spinner1.setAdapter(adapter1);
spinner1.setOnItemSelectedListener(onItemSelectedListener1);
textView2 = (TextView)findViewById(R.id.text2);
spinner2 = (Spinner)findViewById(R.id.spinner2);
MySpinnerAdapter adapter2 =
new MySpinnerAdapter(MainActivity.this,
android.R.layout.simple_spinner_item, obj2);
//adapter2.setDropDownViewResource(android.R.layout.simple_spinner_dropdown_item);
spinner2.setAdapter(adapter2);
spinner2.setOnItemSelectedListener(onItemSelectedListener2);
}
OnItemSelectedListener onItemSelectedListener0 =
new OnItemSelectedListener(){
@Override
public void onItemSelected(AdapterView<?> parent, View view,
int position, long id) {
String s0 = (String)parent.getItemAtPosition(position);
textView0.setText(s0);
}
@Override
public void onNothingSelected(AdapterView<?> parent) {}
};
OnItemSelectedListener onItemSelectedListener1 =
new OnItemSelectedListener(){
@Override
public void onItemSelected(AdapterView<?> parent, View view,
int position, long id) {
String s1 = String.valueOf(val1[position]);
textView1.setText(s1);
}
@Override
public void onNothingSelected(AdapterView<?> parent) {}
};
OnItemSelectedListener onItemSelectedListener2 =
new OnItemSelectedListener(){
@Override
public void onItemSelected(AdapterView<?> parent, View view,
int position, long id) {
MyClass obj = (MyClass)(parent.getItemAtPosition(position));
textView2.setText(String.valueOf(obj.getValue()));
}
@Override
public void onNothingSelected(AdapterView<?> parent) {}
};
//define our custom class
public class MyClass{
private String text;
private int value;
public MyClass(String text, int value){
this.text = text;
this.value = value;
}
public void setText(String text){
this.text = text;
}
public String getText(){
return this.text;
}
public void setValue(int value){
this.value = value;
}
public int getValue(){
return this.value;
}
}
//custom adapter
public class MySpinnerAdapter extends ArrayAdapter<MyClass>{
private Context context;
private MyClass[] myObjs;
public MySpinnerAdapter(Context context, int textViewResourceId,
MyClass[] myObjs) {
super(context, textViewResourceId, myObjs);
this.context = context;
this.myObjs = myObjs;
}
public int getCount(){
return myObjs.length;
}
public MyClass getItem(int position){
return myObjs[position];
}
public long getItemId(int position){
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
TextView label = new TextView(context);
label.setText(myObjs[position].getText());
return label;
}
@Override
public View getDropDownView(int position, View convertView,
ViewGroup parent) {
TextView label = new TextView(context);
label.setText(myObjs[position].getText());
return label;
}
}
}
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
xmlns:tools="http://schemas.android.com/tools"
android:layout_width="match_parent"
android:layout_height="match_parent"
android:orientation="vertical"
android:paddingBottom="@dimen/activity_vertical_margin"
android:paddingLeft="@dimen/activity_horizontal_margin"
android:paddingRight="@dimen/activity_horizontal_margin"
android:paddingTop="@dimen/activity_vertical_margin"
tools:context="com.example.androidspinnertext.MainActivity" >
<TextView
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:layout_gravity="center_horizontal"
android:autoLink="web"
android:text="http://android-er.blogspot.com/"
android:textStyle="bold" />
<Spinner
android:id="@+id/spinner0"
android:layout_width="fill_parent"
android:layout_height="wrap_content" />
<TextView
android:id="@+id/text0"
android:layout_width="fill_parent"
android:layout_height="wrap_content" />
<Spinner
android:id="@+id/spinner1"
android:layout_width="fill_parent"
android:layout_height="wrap_content" />
<TextView
android:id="@+id/text1"
android:layout_width="fill_parent"
android:layout_height="wrap_content" />
<Spinner
android:id="@+id/spinner2"
android:layout_width="fill_parent"
android:layout_height="wrap_content" />
<TextView
android:id="@+id/text2"
android:layout_width="fill_parent"
android:layout_height="wrap_content" />
</LinearLayout>
download filesDownload the files.
6 comments:
Anonymous said...
Description Resource Path Location Type
error: Error retrieving parent for item: No resource found that matches the given name 'Theme.AppCompat.Light'. styles.xml /AndroidSpinnerText/res/values line 7 Android AAPT Problem
Mohammad jahangir sandhu said...
thanks good yr......
nandkishor mewara said...
Thnx...
Deepak said...
Can we not use a Map instead of MyClass?
Marco Antonio Pérez Hernández said...
this tutorial is great thanks
Unknown said...
thx
|
{
"url": "http://android-er.blogspot.com/2014/04/spinner-with-different-displat-text-and.html",
"source_domain": "android-er.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "195206",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5PQEXNVWEFNK5QD3OHL2UCAXNIFFNVWB",
"WARC-Concurrent-To": "<urn:uuid:44113693-dde3-4615-9aba-1530b561f35b>",
"WARC-Date": "2017-03-27T20:25:38Z",
"WARC-IP-Address": "216.58.217.161",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:H7MXQ4QGINWJURG5DW7OK75HARWFFUY7",
"WARC-Record-ID": "<urn:uuid:535c0d75-268e-4879-af8e-272418e8adc4>",
"WARC-Target-URI": "http://android-er.blogspot.com/2014/04/spinner-with-different-displat-text-and.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e3215447-74be-442b-882a-1ead43ca91eb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
23,
24,
77,
78,
340,
341,
506,
507,
560,
588,
784,
953,
954,
994,
995,
1024,
1056,
1082,
1108,
1139,
1174,
1232,
1268,
1299,
1331,
1332,
1377,
1379,
1431,
1483,
1485,
1537,
1589,
1627,
1629,
1648,
1673,
1698,
1723,
1748,
1773,
1798,
1822,
1826,
1828,
1867,
1910,
1911,
1922,
1976,
2014,
2056,
2059,
2109,
2160,
2195,
2243,
2294,
2377,
2410,
2473,
2476,
2526,
2577,
2612,
2660,
2711,
2794,
2827,
2890,
2893,
2943,
2994,
3025,
3069,
3119,
3204,
3237,
3300,
3301,
3304,
3306,
3356,
3388,
3389,
3402,
3466,
3496,
3556,
3583,
3588,
3589,
3602,
3661,
3665,
3667,
3717,
3749,
3750,
3763,
3827,
3857,
3905,
3932,
3937,
3938,
3951,
4010,
4011,
4015,
4017,
4067,
4099,
4100,
4113,
4177,
4207,
4272,
4327,
4332,
4333,
4346,
4405,
4406,
4410,
4412,
4439,
4462,
4463,
4486,
4510,
4516,
4517,
4562,
4586,
4612,
4619,
4625,
4664,
4691,
4698,
4699,
4729,
4756,
4763,
4764,
4802,
4831,
4838,
4839,
4867,
4895,
4902,
4905,
4907,
4925,
4987,
4988,
5018,
5049,
5050,
5120,
5147,
5200,
5233,
5264,
5271,
5272,
5300,
5330,
5337,
5338,
5381,
5414,
5421,
5422,
5464,
5489,
5496,
5497,
5512,
5589,
5638,
5690,
5713,
5720,
5721,
5736,
5801,
5834,
5883,
5935,
5958,
5965,
5968,
5969,
5971,
5972,
6045,
6096,
6136,
6177,
6212,
6272,
6332,
6393,
6450,
6516,
6517,
6531,
6575,
6620,
6671,
6702,
6757,
6793,
6794,
6807,
6842,
6885,
6933,
6947,
6979,
7022,
7070,
7071,
7084,
7119,
7162,
7210,
7224,
7256,
7299,
7347,
7352,
7365,
7400,
7443,
7491,
7505,
7537,
7580,
7628,
7633,
7649,
7650,
7651,
7652,
7686,
7687,
7699,
7700,
7718,
7719,
7759,
7941,
7942,
7975,
7976,
7997,
7998,
8024,
8025,
8033,
8034,
8049,
8050,
8091,
8092,
8130,
8131,
8161,
8162,
8178,
8179
],
"line_end_idx": [
23,
24,
77,
78,
340,
341,
506,
507,
560,
588,
784,
953,
954,
994,
995,
1024,
1056,
1082,
1108,
1139,
1174,
1232,
1268,
1299,
1331,
1332,
1377,
1379,
1431,
1483,
1485,
1537,
1589,
1627,
1629,
1648,
1673,
1698,
1723,
1748,
1773,
1798,
1822,
1826,
1828,
1867,
1910,
1911,
1922,
1976,
2014,
2056,
2059,
2109,
2160,
2195,
2243,
2294,
2377,
2410,
2473,
2476,
2526,
2577,
2612,
2660,
2711,
2794,
2827,
2890,
2893,
2943,
2994,
3025,
3069,
3119,
3204,
3237,
3300,
3301,
3304,
3306,
3356,
3388,
3389,
3402,
3466,
3496,
3556,
3583,
3588,
3589,
3602,
3661,
3665,
3667,
3717,
3749,
3750,
3763,
3827,
3857,
3905,
3932,
3937,
3938,
3951,
4010,
4011,
4015,
4017,
4067,
4099,
4100,
4113,
4177,
4207,
4272,
4327,
4332,
4333,
4346,
4405,
4406,
4410,
4412,
4439,
4462,
4463,
4486,
4510,
4516,
4517,
4562,
4586,
4612,
4619,
4625,
4664,
4691,
4698,
4699,
4729,
4756,
4763,
4764,
4802,
4831,
4838,
4839,
4867,
4895,
4902,
4905,
4907,
4925,
4987,
4988,
5018,
5049,
5050,
5120,
5147,
5200,
5233,
5264,
5271,
5272,
5300,
5330,
5337,
5338,
5381,
5414,
5421,
5422,
5464,
5489,
5496,
5497,
5512,
5589,
5638,
5690,
5713,
5720,
5721,
5736,
5801,
5834,
5883,
5935,
5958,
5965,
5968,
5969,
5971,
5972,
6045,
6096,
6136,
6177,
6212,
6272,
6332,
6393,
6450,
6516,
6517,
6531,
6575,
6620,
6671,
6702,
6757,
6793,
6794,
6807,
6842,
6885,
6933,
6947,
6979,
7022,
7070,
7071,
7084,
7119,
7162,
7210,
7224,
7256,
7299,
7347,
7352,
7365,
7400,
7443,
7491,
7505,
7537,
7580,
7628,
7633,
7649,
7650,
7651,
7652,
7686,
7687,
7699,
7700,
7718,
7719,
7759,
7941,
7942,
7975,
7976,
7997,
7998,
8024,
8025,
8033,
8034,
8049,
8050,
8091,
8092,
8130,
8131,
8161,
8162,
8178,
8179,
8182
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8182,
"ccnet_original_nlines": 275,
"rps_doc_curly_bracket": 0.006844290066510439,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0935792326927185,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01980873942375183,
"rps_doc_frac_lines_end_with_ellipsis": 0.028985509648919106,
"rps_doc_frac_no_alph_words": 0.43510928750038147,
"rps_doc_frac_unique_words": 0.475298136472702,
"rps_doc_mean_word_length": 9.800681114196777,
"rps_doc_num_sentences": 129,
"rps_doc_symbol_to_word_ratio": 0.007513660006225109,
"rps_doc_unigram_entropy": 5.212045669555664,
"rps_doc_word_count": 587,
"rps_doc_frac_chars_dupe_10grams": 0.09299495816230774,
"rps_doc_frac_chars_dupe_5grams": 0.16078567504882812,
"rps_doc_frac_chars_dupe_6grams": 0.15174691379070282,
"rps_doc_frac_chars_dupe_7grams": 0.12602120637893677,
"rps_doc_frac_chars_dupe_8grams": 0.10863897204399109,
"rps_doc_frac_chars_dupe_9grams": 0.09299495816230774,
"rps_doc_frac_chars_top_2gram": 0.019468100741505623,
"rps_doc_frac_chars_top_3gram": 0.018772810697555542,
"rps_doc_frac_chars_top_4gram": 0.020337220281362534,
"rps_doc_books_importance": -653.9409790039062,
"rps_doc_books_importance_length_correction": -653.9409790039062,
"rps_doc_openwebtext_importance": -365.3250427246094,
"rps_doc_openwebtext_importance_length_correction": -365.3250427246094,
"rps_doc_wikipedia_importance": -225.69412231445312,
"rps_doc_wikipedia_importance_length_correction": -225.69412231445312
},
"fasttext": {
"dclm": 0.4368312954902649,
"english": 0.28554096817970276,
"fineweb_edu_approx": 2.427335739135742,
"eai_general_math": 0.14040887355804443,
"eai_open_web_math": 0.08257555961608887,
"eai_web_code": 0.8197412490844727
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,402,298,293,612,054,800
|
Math & Data Science Q&A - Get answers from our AI that are verified by human experts
First time here? Checkout the FAQs!
x
*Math Image Search only works best with zoomed in and well cropped math screenshots. Check DEMO
Recent questions tagged strategy
0 like 0 dislike
1 answer
asked Dec 17, 2022 in General Knowledge by MathsGee Platinum (163,818 points) | 33 views
2 like 0 dislike
1 answer
0 like 0 dislike
1 answer
0 like 0 dislike
1 answer
0 like 0 dislike
1 answer
0 like 0 dislike
0 answers
asked Feb 5, 2022 in General Knowledge by Gauss Diamond (71,959 points) | 127 views
1 like 0 dislike
0 answers
1 like 0 dislike
1 answer
0 like 0 dislike
1 answer
0 like 0 dislike
0 answers
1 like 0 dislike
0 answers
0 like 0 dislike
0 answers
0 like 0 dislike
1 answer
0 like 0 dislike
1 answer
0 like 0 dislike
1 answer
asked May 17, 2021 in General Knowledge by MathsGee Platinum (163,818 points) | 191 views
0 like 0 dislike
1 answer
asked May 16, 2021 in General Knowledge by MathsGee Platinum (163,818 points) | 221 views
0 like 0 dislike
0 answers
0 like 0 dislike
1 answer
asked Sep 16, 2020 in Mathematics by MathsGee Platinum (163,818 points) | 194 views
0 like 0 dislike
1 answer
asked Sep 13, 2020 in Mathematics by MathsGee Platinum (163,818 points) | 177 views
0 like 0 dislike
1 answer
0 like 0 dislike
0 answers
0 like 0 dislike
1 answer
asked Jun 5, 2020 in Mathematics by MathsGee Platinum (163,818 points) | 180 views
0 like 0 dislike
1 answer
asked Jun 5, 2020 in Mathematics by MathsGee Platinum (163,818 points) | 185 views
1 like 0 dislike
1 answer
0 like 0 dislike
1 answer
asked May 28, 2020 in Mathematics by Nyasha Midzi Bronze Status (8,508 points) | 177 views
0 like 0 dislike
1 answer
asked May 28, 2020 in Mathematics by MathsGee Platinum (163,818 points) | 252 views
0 like 0 dislike
1 answer
asked Apr 25, 2020 in Mathematics by MathsGee Platinum (163,818 points) | 143 views
0 like 0 dislike
1 answer
Join MathsGee, where you get expert-verified math and data science education support from our community fast.
On the MathsGee, you can:
1. Ask and answer questions
2. Get expert-verified answers
3. Vote on questions and answers
4. Tip your favorite community members
5. Join expert live video sessions (Paid/Free)
6. Earn points by participating
7. Start a Fundraiser
Posting on MathsGee
1. Remember the human
2. Act like you would in real life
3. Find original source of content
4. Check for duplicates before publishing
5. Read the community guidelines
MathsGee Rules
1. Answers to questions will be posted immediately after moderation
2. Questions will be queued for posting immediately after moderation
3. Depending on the number of messages we receive, you could wait up to 24 hours for your message to appear. But be patient as posts will appear after passing our moderation.
MathsGee Android Q&A
MathsGee Android Q&A
|
{
"url": "https://mathsgee.com/tag/strategy",
"source_domain": "mathsgee.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "201020",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QCAK5XLXLEKQJNS3HVOVB2V7OXZEFN35",
"WARC-Concurrent-To": "<urn:uuid:fefa8f8e-978c-424c-a85b-09b1c4522842>",
"WARC-Date": "2023-01-30T01:53:30Z",
"WARC-IP-Address": "104.196.162.239",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3BUV3GB6HVFGMWBSJEGEFYEOMKVOOID4",
"WARC-Record-ID": "<urn:uuid:1ff181ec-ddd5-46a5-80d7-cfc788d716a5>",
"WARC-Target-URI": "https://mathsgee.com/tag/strategy",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a891e547-4ff2-4081-bbf4-b2e603881b7e>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-197\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,
85,
121,
123,
124,
220,
221,
254,
255,
272,
281,
370,
387,
396,
413,
422,
439,
448,
465,
474,
491,
501,
585,
602,
612,
629,
638,
655,
664,
681,
691,
708,
718,
735,
745,
762,
771,
788,
797,
814,
823,
913,
930,
939,
1029,
1046,
1056,
1073,
1082,
1166,
1183,
1192,
1276,
1293,
1302,
1319,
1329,
1346,
1355,
1438,
1455,
1464,
1547,
1564,
1573,
1590,
1599,
1690,
1707,
1716,
1800,
1817,
1826,
1910,
1927,
1936,
1937,
2047,
2048,
2049,
2075,
2076,
2077,
2105,
2106,
2107,
2138,
2139,
2140,
2173,
2174,
2175,
2214,
2215,
2216,
2263,
2264,
2265,
2297,
2298,
2299,
2321,
2322,
2323,
2324,
2344,
2345,
2346,
2368,
2369,
2370,
2405,
2406,
2407,
2442,
2443,
2444,
2486,
2487,
2488,
2521,
2522,
2523,
2524,
2525,
2540,
2541,
2542,
2610,
2611,
2612,
2681,
2682,
2683,
2858,
2859,
2860,
2861,
2862,
2883,
2884
],
"line_end_idx": [
85,
121,
123,
124,
220,
221,
254,
255,
272,
281,
370,
387,
396,
413,
422,
439,
448,
465,
474,
491,
501,
585,
602,
612,
629,
638,
655,
664,
681,
691,
708,
718,
735,
745,
762,
771,
788,
797,
814,
823,
913,
930,
939,
1029,
1046,
1056,
1073,
1082,
1166,
1183,
1192,
1276,
1293,
1302,
1319,
1329,
1346,
1355,
1438,
1455,
1464,
1547,
1564,
1573,
1590,
1599,
1690,
1707,
1716,
1800,
1817,
1826,
1910,
1927,
1936,
1937,
2047,
2048,
2049,
2075,
2076,
2077,
2105,
2106,
2107,
2138,
2139,
2140,
2173,
2174,
2175,
2214,
2215,
2216,
2263,
2264,
2265,
2297,
2298,
2299,
2321,
2322,
2323,
2324,
2344,
2345,
2346,
2368,
2369,
2370,
2405,
2406,
2407,
2442,
2443,
2444,
2486,
2487,
2488,
2521,
2522,
2523,
2524,
2525,
2540,
2541,
2542,
2610,
2611,
2612,
2681,
2682,
2683,
2858,
2859,
2860,
2861,
2862,
2883,
2884,
2904
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2904,
"ccnet_original_nlines": 140,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18638573586940765,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012965960428118706,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.398703396320343,
"rps_doc_frac_unique_words": 0.31827113032341003,
"rps_doc_mean_word_length": 4.408644199371338,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.255884170532227,
"rps_doc_word_count": 509,
"rps_doc_frac_chars_dupe_10grams": 0.2704991102218628,
"rps_doc_frac_chars_dupe_5grams": 0.5298573970794678,
"rps_doc_frac_chars_dupe_6grams": 0.510695219039917,
"rps_doc_frac_chars_dupe_7grams": 0.5102495551109314,
"rps_doc_frac_chars_dupe_8grams": 0.48796790838241577,
"rps_doc_frac_chars_dupe_9grams": 0.36229947209358215,
"rps_doc_frac_chars_top_2gram": 0.0623885914683342,
"rps_doc_frac_chars_top_3gram": 0.14973261952400208,
"rps_doc_frac_chars_top_4gram": 0.13324421644210815,
"rps_doc_books_importance": -159.20033264160156,
"rps_doc_books_importance_length_correction": -159.20033264160156,
"rps_doc_openwebtext_importance": -167.68600463867188,
"rps_doc_openwebtext_importance_length_correction": -167.68600463867188,
"rps_doc_wikipedia_importance": -109.9961166381836,
"rps_doc_wikipedia_importance_length_correction": -109.9961166381836
},
"fasttext": {
"dclm": 0.6533078551292419,
"english": 0.9040918350219727,
"fineweb_edu_approx": 1.8971186876296997,
"eai_general_math": 0.6647142767906189,
"eai_open_web_math": 0.15116119384765625,
"eai_web_code": 0.00003374000152689405
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,149,608,927,951,007,500
|
Here is my code
#import <stdio.h>
#import <string.h>
int main(int argc, const char *argv[])
{
char *str = "First string";
char *str2 = "Second string";
strcpy(str, str2);
return 0;
}
It compiles just fine without any warning or errors, but when I run the app I get that error
Bus error: 10
What I miss ?
• 1
Well, strlen(str)<strlen(str2). – user554546 Jan 3 '12 at 18:11
• 34
Is everyone missing the #import?!! – Sangeeth Saravanaraj Jan 3 '12 at 18:18
• 4
@SangeethSaravanaraj Yes, I can't believe it myself. lol Everyone missed it... – Mysticial Jan 3 '12 at 18:24
• 1
also const char *argv[] which is not valid in hosted environment. You should use char *argv[] – ouah Jan 3 '12 at 18:25
up vote 36 down vote accepted
For one, you can't modify string literals. It's undefined behavior.
To fix that you can make str a local array:
char str[] = "First string";
Now, you will have a second problem, is that str isn't large enough to hold str2. So you will need to increase the length of it. Otherwise, you will overrun str - which is also undefined behavior.
To get around this second problem, you either need to make str at least as long as str2. Or allocate it dynamically:
char *str2 = "Second string";
char *str = malloc(strlen(str2) + 1); // Allocate memory
// Maybe check for NULL.
strcpy(str, str2);
// Always remember to free it.
free(str);
There are other more elegant ways to do this involving VLAs (in C99) and stack allocation, but I won't go into those as their use is somewhat questionable.
As @SangeethSaravanaraj pointed out in the comments, everyone missed the #import. It should be #include:
#include <stdio.h>
#include <string.h>
• 16
Mystical, #import is supported in C for both clang and GCC, and is an objective-c extension. There is no problem with the OP's code, as it only adds automatic include guards and nothing else. – Richard J. Ross III Jan 29 '13 at 1:33
There is no space allocated for the strings. use array (or) pointers with malloc() and free()
Other than that
#import <stdio.h>
#import <string.h>
should be
#include <stdio.h>
#include <string.h>
NOTE:
• anything that is malloc()ed must be free()'ed
• you need to allocate n + 1 bytes for a string which is of length n (the last byte is for \0)
Please you the following code as a reference
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(int argc, char *argv[])
{
//char *str1 = "First string";
char *str1 = "First string is a big string";
char *str2 = NULL;
if ((str2 = (char *) malloc(sizeof(char) * strlen(str1) + 1)) == NULL) {
printf("unable to allocate memory \n");
return -1;
}
strcpy(str2, str1);
printf("str1 : %s \n", str1);
printf("str2 : %s \n", str2);
free(str2);
return 0;
}
• 1
+1 for being the only person to notice the #import. – Mysticial Jan 3 '12 at 18:38
str2 is pointing to a statically allocated constant character array. You can't write to it/over it. You need to dynamically allocate space via the *alloc family of functions.
Your code attempts to overwrite a string literal. This is undefined behaviour.
There are several ways to fix this:
1. use malloc() then strcpy() then free();
2. turn str into an array and use strcpy();
3. use strdup().
this is because str is pointing to a string literal means a constant string ...but you are trying to modify it by copying . Note : if it would have been an error due to memory allocation it would have been given segmentation fault at the run time .But this error is coming due to constant string modification or you can go through the below for more details abt bus error :
Bus errors are rare nowadays on x86 and occur when your processor cannot even attempt the memory access requested, typically:
• using a processor instruction with an address that does not satisfy its alignment requirements.
Segmentation faults occur when accessing memory which does not belong to your process, they are very common and are typically the result of:
• using a pointer to something that was deallocated.
• using an uninitialized hence bogus pointer.
• using a null pointer.
• overflowing a buffer.
To be more precise this is not manipulating the pointer itself that will cause issues, it's accessing the memory it points to (dereferencing).
string literals are non-modifiable in C
Whenever you are using pointer variables ( the asterix ) such as
char *str = "First string";
you need to asign memory to it
str = malloc(strlen(*str))
Your Answer
By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://stackoverflow.com/questions/8716714/bus-error-10-error",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "142219",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KASCJRO5CO7EOV7CY6GIQH5PYWYVULPH",
"WARC-Concurrent-To": "<urn:uuid:24301828-9731-4d76-90c3-f79f274d4b5c>",
"WARC-Date": "2018-10-19T03:36:28Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HATJLXQE73WIUSKFBZCR3P5XHYI6NLQ2",
"WARC-Record-ID": "<urn:uuid:e4ceeab4-82b1-4805-b139-2a2ed99c099f>",
"WARC-Target-URI": "https://stackoverflow.com/questions/8716714/bus-error-10-error",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0078ad45-325a-45e1-8f03-1ab944d4258f>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-164-201-98.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,
16,
17,
35,
54,
55,
94,
96,
128,
162,
163,
186,
200,
202,
203,
296,
297,
311,
312,
326,
327,
333,
401,
408,
489,
495,
609,
615,
739,
769,
770,
838,
839,
883,
884,
913,
914,
1111,
1112,
1229,
1230,
1260,
1319,
1345,
1346,
1365,
1366,
1398,
1409,
1410,
1566,
1567,
1568,
1673,
1674,
1693,
1713,
1720,
1957,
1958,
2052,
2053,
2069,
2070,
2088,
2107,
2108,
2118,
2119,
2138,
2158,
2159,
2165,
2166,
2216,
2313,
2314,
2359,
2360,
2379,
2399,
2419,
2420,
2453,
2455,
2490,
2539,
2562,
2563,
2640,
2688,
2708,
2717,
2718,
2742,
2743,
2777,
2811,
2812,
2828,
2842,
2844,
2850,
2937,
2938,
3113,
3114,
3193,
3194,
3230,
3231,
3276,
3322,
3341,
3342,
3716,
3717,
3843,
3844,
3944,
3945,
4086,
4087,
4142,
4190,
4216,
4242,
4243,
4386,
4387,
4427,
4428,
4493,
4494,
4522,
4523,
4554,
4555,
4582,
4583,
4595,
4596,
4598,
4599,
4803,
4804
],
"line_end_idx": [
16,
17,
35,
54,
55,
94,
96,
128,
162,
163,
186,
200,
202,
203,
296,
297,
311,
312,
326,
327,
333,
401,
408,
489,
495,
609,
615,
739,
769,
770,
838,
839,
883,
884,
913,
914,
1111,
1112,
1229,
1230,
1260,
1319,
1345,
1346,
1365,
1366,
1398,
1409,
1410,
1566,
1567,
1568,
1673,
1674,
1693,
1713,
1720,
1957,
1958,
2052,
2053,
2069,
2070,
2088,
2107,
2108,
2118,
2119,
2138,
2158,
2159,
2165,
2166,
2216,
2313,
2314,
2359,
2360,
2379,
2399,
2419,
2420,
2453,
2455,
2490,
2539,
2562,
2563,
2640,
2688,
2708,
2717,
2718,
2742,
2743,
2777,
2811,
2812,
2828,
2842,
2844,
2850,
2937,
2938,
3113,
3114,
3193,
3194,
3230,
3231,
3276,
3322,
3341,
3342,
3716,
3717,
3843,
3844,
3944,
3945,
4086,
4087,
4142,
4190,
4216,
4242,
4243,
4386,
4387,
4427,
4428,
4493,
4494,
4522,
4523,
4554,
4555,
4582,
4583,
4595,
4596,
4598,
4599,
4803,
4804,
4894
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4894,
"ccnet_original_nlines": 145,
"rps_doc_curly_bracket": 0.0012259900104254484,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3154602348804474,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01429848000407219,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3074173331260681,
"rps_doc_frac_unique_words": 0.4223918616771698,
"rps_doc_mean_word_length": 4.503816604614258,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0.0160857904702425,
"rps_doc_unigram_entropy": 5.311161518096924,
"rps_doc_word_count": 786,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.010169490240514278,
"rps_doc_frac_chars_dupe_6grams": 0.010169490240514278,
"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.015536719933152199,
"rps_doc_frac_chars_top_3gram": 0.008474580012261868,
"rps_doc_frac_chars_top_4gram": 0.011299439705908298,
"rps_doc_books_importance": -488.9897155761719,
"rps_doc_books_importance_length_correction": -488.9897155761719,
"rps_doc_openwebtext_importance": -287.80712890625,
"rps_doc_openwebtext_importance_length_correction": -287.80712890625,
"rps_doc_wikipedia_importance": -162.79270935058594,
"rps_doc_wikipedia_importance_length_correction": -162.79270935058594
},
"fasttext": {
"dclm": 0.4176117777824402,
"english": 0.8596318960189819,
"fineweb_edu_approx": 1.9878370761871338,
"eai_general_math": 0.2914873957633972,
"eai_open_web_math": 0.1299208402633667,
"eai_web_code": 0.20095157623291016
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,865,383,205,160,249,000
|
Submit Benchmarks!
Submit SSD Benchmark
Submit GPU Benchmark
Compare any two graphics cards:
VS
GeForce 9800 GTX vs Radeon HD 5550
Intro
The GeForce 9800 GTX uses a 65 nm design. nVidia has set the core frequency at 675 MHz. The GDDR3 RAM is set to run at a speed of 1100 MHz on this particular card. It features 128 SPUs as well as 64 Texture Address Units and 16 ROPs.
Compare all that to the Radeon HD 5550, which makes use of a 40 nm design. AMD has set the core speed at 550 MHz. The DDR2 memory works at a speed of 400 MHz on this particular card. It features 320(64x5) SPUs as well as 16 TAUs and 8 Rasterization Operator Units.
Display Graphs
Hide Graphs
Power Usage and Theoretical Benchmarks
Memory Bandwidth
In theory, the GeForce 9800 GTX will be 450% faster than the Radeon HD 5550 overall, due to its greater bandwidth. (explain)
GeForce 9800 GTX 70400 MB/sec
Radeon HD 5550 12800 MB/sec
Difference: 57600 (450%)
Texel Rate
The GeForce 9800 GTX is much (approximately 391%) faster with regards to anisotropic filtering than the Radeon HD 5550. (explain)
GeForce 9800 GTX 43200 Mtexels/sec
Radeon HD 5550 8800 Mtexels/sec
Difference: 34400 (391%)
Pixel Rate
If running with lots of anti-aliasing is important to you, then the GeForce 9800 GTX is superior to the Radeon HD 5550, by far. (explain)
GeForce 9800 GTX 10800 Mpixels/sec
Radeon HD 5550 4400 Mpixels/sec
Difference: 6400 (145%)
Please note that the above 'benchmarks' are all just theoretical - the results were calculated based on the card's specifications, and real-world performance may (and probably will) vary at least a bit.
Price Comparison
GeForce 9800 GTX
Radeon HD 5550
Specifications
Display Specifications
Hide Specifications
Model GeForce 9800 GTX Radeon HD 5550
Manufacturer nVidia AMD
Year April 2008 February 9, 2010
Code Name G92 Redwood LE
Memory 512 MB 512 MB
Core Speed 675 MHz 550 MHz
Memory Speed 2200 MHz 800 MHz
Power (Max TDP) 140 watts (Unknown) watts
Bandwidth 70400 MB/sec 12800 MB/sec
Texel Rate 43200 Mtexels/sec 8800 Mtexels/sec
Pixel Rate 10800 Mpixels/sec 4400 Mpixels/sec
Unified Shaders 128 320(64x5)
Texture Mapping Units 64 16
Render Output Units 16 8
Bus Type GDDR3 DDR2
Bus Width 256-bit 128-bit
Fab Process 65 nm 40 nm
Transistors 754 million 627 million
Bus PCIe x16 2.0 PCIe 2.1 x16
DirectX Version DirectX 10 DirectX 11
OpenGL Version OpenGL 3.0 OpenGL 3.2
Memory Bandwidth: Memory bandwidth is the maximum amount of information (measured in MB per second) that can be transferred over the external memory interface within a second. It is worked out by multiplying the card's bus width by its memory speed. In the case of DDR RAM, it should be multiplied by 2 once again. If it uses DDR5, multiply by ANOTHER 2x. The higher the memory bandwidth, the better the card will be in general. It especially helps with AA, HDR and higher screen resolutions.
Texel Rate: Texel rate is the maximum texture map elements (texels) that can be processed in one second. This number is worked out by multiplying the total number of texture units by the core speed of the chip. The better this number, the better the graphics card will be at handling texture filtering (anisotropic filtering - AF). It is measured in millions of texels in one second.
Pixel Rate: Pixel rate is the most pixels the video card could possibly write to the local memory in one second - measured in millions of pixels per second. Pixel rate is calculated by multiplying the amount of ROPs by the the card's clock speed. ROPs (Raster Operations Pipelines - sometimes also referred to as Render Output Units) are responsible for drawing the pixels (image) on the screen. The actual pixel fill rate also depends on quite a few other factors, especially the memory bandwidth of the card - the lower the bandwidth is, the lower the ability to reach the maximum fill rate.
GeForce 9800 GTX
Radeon HD 5550
Comments
Be the first to leave a comment!
Your email address will not be published. Required fields are marked *
*
WordPress Anti-Spam by WP-SpamShield
[X]
[X]
|
{
"url": "http://www.hwcompare.com/336/geforce-9800-gtx-vs-radeon-hd-5550/",
"source_domain": "www.hwcompare.com",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "69234",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YGFPYRA7PL3PFH2BC2OSBRHUS7AA54QX",
"WARC-Concurrent-To": "<urn:uuid:6d78068a-a1e6-41da-8f50-a31409020cf5>",
"WARC-Date": "2017-07-23T20:38:08Z",
"WARC-IP-Address": "173.199.157.212",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5ZRL5IHP6K764M7UTYZDTCCTO6QQTSED",
"WARC-Record-ID": "<urn:uuid:8fef2734-715c-463a-b738-46dd54e51c3f>",
"WARC-Target-URI": "http://www.hwcompare.com/336/geforce-9800-gtx-vs-radeon-hd-5550/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8593f241-b88b-4798-bb7d-8bd99e43bc33>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-226-229.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
19,
20,
41,
62,
63,
95,
98,
99,
134,
135,
136,
142,
143,
377,
378,
643,
644,
659,
660,
672,
673,
712,
713,
730,
731,
856,
857,
887,
915,
940,
941,
952,
953,
1083,
1084,
1119,
1151,
1176,
1177,
1188,
1189,
1327,
1328,
1363,
1395,
1419,
1420,
1623,
1624,
1641,
1642,
1659,
1660,
1675,
1676,
1691,
1692,
1715,
1716,
1736,
1737,
1775,
1799,
1832,
1857,
1878,
1905,
1935,
1977,
2013,
2059,
2105,
2135,
2163,
2188,
2208,
2234,
2258,
2294,
2324,
2362,
2399,
2400,
2893,
2894,
3278,
3279,
3873,
3874,
3891,
3892,
3907,
3908,
3917,
3918,
3951,
3952,
4023,
4024,
4025,
4027,
4028,
4065,
4066,
4067,
4071
],
"line_end_idx": [
19,
20,
41,
62,
63,
95,
98,
99,
134,
135,
136,
142,
143,
377,
378,
643,
644,
659,
660,
672,
673,
712,
713,
730,
731,
856,
857,
887,
915,
940,
941,
952,
953,
1083,
1084,
1119,
1151,
1176,
1177,
1188,
1189,
1327,
1328,
1363,
1395,
1419,
1420,
1623,
1624,
1641,
1642,
1659,
1660,
1675,
1676,
1691,
1692,
1715,
1716,
1736,
1737,
1775,
1799,
1832,
1857,
1878,
1905,
1935,
1977,
2013,
2059,
2105,
2135,
2163,
2188,
2208,
2234,
2258,
2294,
2324,
2362,
2399,
2400,
2893,
2894,
3278,
3279,
3873,
3874,
3891,
3892,
3907,
3908,
3917,
3918,
3951,
3952,
4023,
4024,
4025,
4027,
4028,
4065,
4066,
4067,
4071,
4074
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4074,
"ccnet_original_nlines": 106,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26076555252075195,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06220095977187157,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25,
"rps_doc_frac_unique_words": 0.4133915603160858,
"rps_doc_mean_word_length": 4.678311347961426,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.17227840423584,
"rps_doc_word_count": 687,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09583073854446411,
"rps_doc_frac_chars_dupe_6grams": 0.06160547956824303,
"rps_doc_frac_chars_dupe_7grams": 0.02053515985608101,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0376477912068367,
"rps_doc_frac_chars_top_3gram": 0.047915369272232056,
"rps_doc_frac_chars_top_4gram": 0.021157439798116684,
"rps_doc_books_importance": -322.0386047363281,
"rps_doc_books_importance_length_correction": -322.0386047363281,
"rps_doc_openwebtext_importance": -199.53262329101562,
"rps_doc_openwebtext_importance_length_correction": -199.53262329101562,
"rps_doc_wikipedia_importance": -147.7598114013672,
"rps_doc_wikipedia_importance_length_correction": -147.7598114013672
},
"fasttext": {
"dclm": 0.026575149968266487,
"english": 0.8651994466781616,
"fineweb_edu_approx": 2.3585784435272217,
"eai_general_math": 0.03550314903259277,
"eai_open_web_math": 0.2752574682235718,
"eai_web_code": 0.0032452300656586885
}
}
|
{
"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": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "14",
"label": "Reviews/Critiques"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,705,679,167,057,108,500
|
Tensor shapes in Pyro
This tutorial introduces Pyro’s organization of tensor dimensions. Before starting, you should familiarize yourself with PyTorch broadcasting semantics. After this tutorial, you may want to also read about enumeration.
Summary:
• Tensors broadcast by aligning on the right: torch.ones(3,4,5) + torch.ones(5).
• Distribution .sample().shape == batch_shape + event_shape.
• Distribution .log_prob(x).shape == batch_shape (but not event_shape!).
• Use .expand() to draw a batch of samples, or rely on plate to expand automatically.
• Use my_dist.to_event(1) to declare a dimension as dependent.
• Use with pyro.plate('name', size): to declare a dimension as conditionally independent.
• All dimensions must be declared either dependent or conditionally independent.
• Try to support batching on the left. This lets Pyro auto-parallelize.
• use negative indices like x.sum(-1) rather than x.sum(2)
• use ellipsis notation like pixel = image[..., i, j]
• use Vindex if i,j are enumerated, pixel = Vindex(image)[..., i, j]
• When using pyro.plate’s automatic subsampling, be sure to subsample your data:
• Either manually subample by capturing the index with pyro.plate(...) as i: ...
• or automatically subsample via batch = pyro.subsample(data, event_dim=...).
• When debugging, examine all shapes in a trace using Trace.format_shapes().
Table of Contents
[1]:
import os
import torch
import pyro
from torch.distributions import constraints
from pyro.distributions import Bernoulli, Categorical, MultivariateNormal, Normal
from pyro.distributions.util import broadcast_shape
from pyro.infer import Trace_ELBO, TraceEnum_ELBO, config_enumerate
import pyro.poutine as poutine
from pyro.optim import Adam
smoke_test = ('CI' in os.environ)
assert pyro.__version__.startswith('1.7.0')
# We'll ue this helper to check our models are correct.
def test_model(model, guide, loss):
pyro.clear_param_store()
loss.loss(model, guide)
Distributions shapes: batch_shape and event_shape
PyTorch Tensors have a single .shape attribute, but Distributions have two shape attributions with special meaning: .batch_shape and .event_shape. These two combine to define the total shape of a sample
x = d.sample()
assert x.shape == d.batch_shape + d.event_shape
Indices over .batch_shape denote conditionally independent random variables, whereas indices over .event_shape denote dependent random variables (ie one draw from a distribution). Because the dependent random variables define probability together, the .log_prob() method only produces a single number for each event of shape .event_shape. Thus the total shape of .log_prob() is .batch_shape:
assert d.log_prob(x).shape == d.batch_shape
Note that the Distribution.sample() method also takes a sample_shape parameter that indexes over independent identically distributed (iid) random varables, so that
x2 = d.sample(sample_shape)
assert x2.shape == sample_shape + batch_shape + event_shape
In summary
| iid | independent | dependent
------+--------------+-------------+------------
shape = sample_shape + batch_shape + event_shape
For example univariate distributions have empty event shape (because each number is an independent event). Distributions over vectors like MultivariateNormal have len(event_shape) == 1. Distributions over matrices like InverseWishart have len(event_shape) == 2.
Examples
The simplest distribution shape is a single univariate distribution.
[2]:
d = Bernoulli(0.5)
assert d.batch_shape == ()
assert d.event_shape == ()
x = d.sample()
assert x.shape == ()
assert d.log_prob(x).shape == ()
Distributions can be batched by passing in batched parameters.
[3]:
d = Bernoulli(0.5 * torch.ones(3,4))
assert d.batch_shape == (3, 4)
assert d.event_shape == ()
x = d.sample()
assert x.shape == (3, 4)
assert d.log_prob(x).shape == (3, 4)
Another way to batch distributions is via the .expand() method. This only works if parameters are identical along the leftmost dimensions.
[4]:
d = Bernoulli(torch.tensor([0.1, 0.2, 0.3, 0.4])).expand([3, 4])
assert d.batch_shape == (3, 4)
assert d.event_shape == ()
x = d.sample()
assert x.shape == (3, 4)
assert d.log_prob(x).shape == (3, 4)
Multivariate distributions have nonempty .event_shape. For these distributions, the shapes of .sample() and .log_prob(x) differ:
[5]:
d = MultivariateNormal(torch.zeros(3), torch.eye(3, 3))
assert d.batch_shape == ()
assert d.event_shape == (3,)
x = d.sample()
assert x.shape == (3,) # == batch_shape + event_shape
assert d.log_prob(x).shape == () # == batch_shape
Reshaping distributions
In Pyro you can treat a univariate distribution as multivariate by calling the .to_event(n) property where n is the number of batch dimensions (from the right) to declare as dependent.
[6]:
d = Bernoulli(0.5 * torch.ones(3,4)).to_event(1)
assert d.batch_shape == (3,)
assert d.event_shape == (4,)
x = d.sample()
assert x.shape == (3, 4)
assert d.log_prob(x).shape == (3,)
While you work with Pyro programs, keep in mind that samples have shape batch_shape + event_shape, whereas .log_prob(x) values have shape batch_shape. You’ll need to ensure that batch_shape is carefully controlled by either trimming it down with .to_event(n) or by declaring dimensions as independent via pyro.plate.
It is always safe to assume dependence
Often in Pyro we’ll declare some dimensions as dependent even though they are in fact independent, e.g.
x = pyro.sample("x", Normal(0, 1).expand([10]).to_event(1))
assert x.shape == (10,)
This is useful for two reasons: First it allows us to easily swap in a MultivariateNormal distribution later. Second it simplifies the code a bit since we don’t need a plate (see below) as in
with pyro.plate("x_plate", 10):
x = pyro.sample("x", Normal(0, 1)) # .expand([10]) is automatic
assert x.shape == (10,)
The difference between these two versions is that the second version with plate informs Pyro that it can make use of conditional independence information when estimating gradients, whereas in the first version Pyro must assume they are dependent (even though the normals are in fact conditionally independent). This is analogous to d-separation in graphical models: it is always safe to add edges and assume variables may be dependent (i.e. to widen the model class), but it is unsafe to assume independence when variables are actually dependent (i.e. narrowing the model class so the true model lies outside of the class, as in mean field). In practice Pyro’s SVI inference algorithm uses reparameterized gradient estimators for Normal distributions so both gradient estimators have the same performance.
Declaring independent dims with plate
Pyro models can use the context manager pyro.plate to declare that certain batch dimensions are independent. Inference algorithms can then take advantage of this independence to e.g. construct lower variance gradient estimators or to enumerate in linear space rather than exponential space. An example of an independent dimension is the index over data in a minibatch: each datum should be independent of all others.
The simplest way to declare a dimension as independent is to declare the rightmost batch dimension as independent via a simple
with pyro.plate("my_plate"):
# within this context, batch dimension -1 is independent
We recommend always providing an optional size argument to aid in debugging shapes
with pyro.plate("my_plate", len(my_data)):
# within this context, batch dimension -1 is independent
Starting with Pyro 0.2 you can additionally nest plates, e.g. if you have per-pixel independence:
with pyro.plate("x_axis", 320):
# within this context, batch dimension -1 is independent
with pyro.plate("y_axis", 200):
# within this context, batch dimensions -2 and -1 are independent
Note that we always count from the right by using negative indices like -2, -1.
Finally if you want to mix and match plates for e.g. noise that depends only on x, some noise that depends only on y, and some noise that depends on both, you can declare multiple plates and use them as reusable context managers. In this case Pyro cannot automatically allocate a dimension, so you need to provide a dim argument (again counting from the right):
x_axis = pyro.plate("x_axis", 3, dim=-2)
y_axis = pyro.plate("y_axis", 2, dim=-3)
with x_axis:
# within this context, batch dimension -2 is independent
with y_axis:
# within this context, batch dimension -3 is independent
with x_axis, y_axis:
# within this context, batch dimensions -3 and -2 are independent
Let’s take a closer look at batch sizes within plates.
[7]:
def model1():
a = pyro.sample("a", Normal(0, 1))
b = pyro.sample("b", Normal(torch.zeros(2), 1).to_event(1))
with pyro.plate("c_plate", 2):
c = pyro.sample("c", Normal(torch.zeros(2), 1))
with pyro.plate("d_plate", 3):
d = pyro.sample("d", Normal(torch.zeros(3,4,5), 1).to_event(2))
assert a.shape == () # batch_shape == () event_shape == ()
assert b.shape == (2,) # batch_shape == () event_shape == (2,)
assert c.shape == (2,) # batch_shape == (2,) event_shape == ()
assert d.shape == (3,4,5) # batch_shape == (3,) event_shape == (4,5)
x_axis = pyro.plate("x_axis", 3, dim=-2)
y_axis = pyro.plate("y_axis", 2, dim=-3)
with x_axis:
x = pyro.sample("x", Normal(0, 1))
with y_axis:
y = pyro.sample("y", Normal(0, 1))
with x_axis, y_axis:
xy = pyro.sample("xy", Normal(0, 1))
z = pyro.sample("z", Normal(0, 1).expand([5]).to_event(1))
assert x.shape == (3, 1) # batch_shape == (3,1) event_shape == ()
assert y.shape == (2, 1, 1) # batch_shape == (2,1,1) event_shape == ()
assert xy.shape == (2, 3, 1) # batch_shape == (2,3,1) event_shape == ()
assert z.shape == (2, 3, 1, 5) # batch_shape == (2,3,1) event_shape == (5,)
test_model(model1, model1, Trace_ELBO())
It is helpful to visualize the .shapes of each sample site by aligning them at the boundary between batch_shape and event_shape: dimensions to the right will be summed out in .log_prob() and dimensions to the left will remain.
batch dims | event dims
-----------+-----------
| a = sample("a", Normal(0, 1))
|2 b = sample("b", Normal(zeros(2), 1)
| .to_event(1))
| with plate("c", 2):
2| c = sample("c", Normal(zeros(2), 1))
| with plate("d", 3):
3|4 5 d = sample("d", Normal(zeros(3,4,5), 1)
| .to_event(2))
|
| x_axis = plate("x", 3, dim=-2)
| y_axis = plate("y", 2, dim=-3)
| with x_axis:
3 1| x = sample("x", Normal(0, 1))
| with y_axis:
2 1 1| y = sample("y", Normal(0, 1))
| with x_axis, y_axis:
2 3 1| xy = sample("xy", Normal(0, 1))
2 3 1|5 z = sample("z", Normal(0, 1).expand([5])
| .to_event(1))
To examine the shapes of sample sites in a program automatically, you can trace the program and use the Trace.format_shapes() method, which prints three shapes for each sample site: the distribution shape (both site["fn"].batch_shape and site["fn"].event_shape), the value shape (site["value"].shape), and if log probability has been computed also the log_prob shape (site["log_prob"].shape):
[8]:
trace = poutine.trace(model1).get_trace()
trace.compute_log_prob() # optional, but allows printing of log_prob shapes
print(trace.format_shapes())
Trace Shapes:
Param Sites:
Sample Sites:
a dist |
value |
log_prob |
b dist | 2
value | 2
log_prob |
c_plate dist |
value 2 |
log_prob |
c dist 2 |
value 2 |
log_prob 2 |
d_plate dist |
value 3 |
log_prob |
d dist 3 | 4 5
value 3 | 4 5
log_prob 3 |
x_axis dist |
value 3 |
log_prob |
y_axis dist |
value 2 |
log_prob |
x dist 3 1 |
value 3 1 |
log_prob 3 1 |
y dist 2 1 1 |
value 2 1 1 |
log_prob 2 1 1 |
xy dist 2 3 1 |
value 2 3 1 |
log_prob 2 3 1 |
z dist 2 3 1 | 5
value 2 3 1 | 5
log_prob 2 3 1 |
Subsampling tensors inside a plate
One of the main uses of plate is to subsample data. This is possible within a plate because data are conditionally independent, so the expected value of the loss on, say, half the data should be half the expected loss on the full data.
To subsample data, you need to inform Pyro of both the original data size and the subsample size; Pyro will then choose a random subset of data and yield the set of indices.
[9]:
data = torch.arange(100.)
def model2():
mean = pyro.param("mean", torch.zeros(len(data)))
with pyro.plate("data", len(data), subsample_size=10) as ind:
assert len(ind) == 10 # ind is a LongTensor that indexes the subsample.
batch = data[ind] # Select a minibatch of data.
mean_batch = mean[ind] # Take care to select the relevant per-datum parameters.
# Do stuff with batch:
x = pyro.sample("x", Normal(mean_batch, 1), obs=batch)
assert len(x) == 10
test_model(model2, guide=lambda: None, loss=Trace_ELBO())
Broadcasting to allow parallel enumeration
Pyro 0.2 introduces the ability to enumerate discrete latent variables in parallel. This can significantly reduce the variance of gradient estimators when learning a posterior via SVI.
To use parallel enumeration, Pyro needs to allocate tensor dimension that it can use for enumeration. To avoid conflicting with other dimensions that we want to use for plates, we need to declare a budget of the maximum number of tensor dimensions we’ll use. This budget is called max_plate_nesting and is an argument to SVI (the argument is simply passed through to TraceEnum_ELBO). Usually Pyro can determine this budget on its own (it runs the (model,guide) pair once and record what happens), but in case of dynamic model structure you may need to declare max_plate_nesting manually.
To understand max_plate_nesting and how Pyro allocates dimensions for enumeration, let’s revisit model1() from above. This time we’ll map out three types of dimensions: enumeration dimensions on the left (Pyro takes control of these), batch dimensions in the middle, and event dimensions on the right.
max_plate_nesting = 3
|<--->|
enumeration|batch|event
-----------+-----+-----
|. . .| a = sample("a", Normal(0, 1))
|. . .|2 b = sample("b", Normal(zeros(2), 1)
| | .to_event(1))
| | with plate("c", 2):
|. . 2| c = sample("c", Normal(zeros(2), 1))
| | with plate("d", 3):
|. . 3|4 5 d = sample("d", Normal(zeros(3,4,5), 1)
| | .to_event(2))
| |
| | x_axis = plate("x", 3, dim=-2)
| | y_axis = plate("y", 2, dim=-3)
| | with x_axis:
|. 3 1| x = sample("x", Normal(0, 1))
| | with y_axis:
|2 1 1| y = sample("y", Normal(0, 1))
| | with x_axis, y_axis:
|2 3 1| xy = sample("xy", Normal(0, 1))
|2 3 1|5 z = sample("z", Normal(0, 1).expand([5]))
| | .to_event(1))
Note that it is safe to overprovision max_plate_nesting=4 but we cannot underprovision max_plate_nesting=2 (or Pyro will error). Let’s see how this works in practice.
[10]:
@config_enumerate
def model3():
p = pyro.param("p", torch.arange(6.) / 6)
locs = pyro.param("locs", torch.tensor([-1., 1.]))
a = pyro.sample("a", Categorical(torch.ones(6) / 6))
b = pyro.sample("b", Bernoulli(p[a])) # Note this depends on a.
with pyro.plate("c_plate", 4):
c = pyro.sample("c", Bernoulli(0.3))
with pyro.plate("d_plate", 5):
d = pyro.sample("d", Bernoulli(0.4))
e_loc = locs[d.long()].unsqueeze(-1)
e_scale = torch.arange(1., 8.)
e = pyro.sample("e", Normal(e_loc, e_scale)
.to_event(1)) # Note this depends on d.
# enumerated|batch|event dims
assert a.shape == ( 6, 1, 1 ) # Six enumerated values of the Categorical.
assert b.shape == ( 2, 1, 1, 1 ) # Two enumerated Bernoullis, unexpanded.
assert c.shape == ( 2, 1, 1, 1, 1 ) # Only two Bernoullis, unexpanded.
assert d.shape == (2, 1, 1, 1, 1, 1 ) # Only two Bernoullis, unexpanded.
assert e.shape == (2, 1, 1, 1, 5, 4, 7) # This is sampled and depends on d.
assert e_loc.shape == (2, 1, 1, 1, 1, 1, 1,)
assert e_scale.shape == ( 7,)
test_model(model3, model3, TraceEnum_ELBO(max_plate_nesting=2))
Let’s take a closer look at those dimensions. First note that Pyro allocates enumeration dims starting from the right at max_plate_nesting: Pyro allocates dim -3 to enumerate a, then dim -4 to enumerate b, then dim -5 to enumerate c, and finally dim -6 to enumerate d. Next note that samples only have extent (size > 1) in the new enumeration dimension. This helps keep tensors small and computation cheap. (Note that the log_prob shape will be broadcast up to contain both enumeratin shape and batch shape, so e.g. trace.nodes['d']['log_prob'].shape == (2, 1, 1, 1, 5, 4).)
We can draw a similar map of the tensor dimensions:
max_plate_nesting = 2
|<->|
enumeration batch event
------------|---|-----
6|1 1| a = pyro.sample("a", Categorical(torch.ones(6) / 6))
2 1|1 1| b = pyro.sample("b", Bernoulli(p[a]))
| | with pyro.plate("c_plate", 4):
2 1 1|1 1| c = pyro.sample("c", Bernoulli(0.3))
| | with pyro.plate("d_plate", 5):
2 1 1 1|1 1| d = pyro.sample("d", Bernoulli(0.4))
2 1 1 1|1 1|1 e_loc = locs[d.long()].unsqueeze(-1)
| |7 e_scale = torch.arange(1., 8.)
2 1 1 1|5 4|7 e = pyro.sample("e", Normal(e_loc, e_scale)
| | .to_event(1))
To automatically examine this model with enumeration semantics, we can create an enumerated trace and then use Trace.format_shapes():
[11]:
trace = poutine.trace(poutine.enum(model3, first_available_dim=-3)).get_trace()
trace.compute_log_prob() # optional, but allows printing of log_prob shapes
print(trace.format_shapes())
Trace Shapes:
Param Sites:
p 6
locs 2
Sample Sites:
a dist |
value 6 1 1 |
log_prob 6 1 1 |
b dist 6 1 1 |
value 2 1 1 1 |
log_prob 2 6 1 1 |
c_plate dist |
value 4 |
log_prob |
c dist 4 |
value 2 1 1 1 1 |
log_prob 2 1 1 1 4 |
d_plate dist |
value 5 |
log_prob |
d dist 5 4 |
value 2 1 1 1 1 1 |
log_prob 2 1 1 1 5 4 |
e dist 2 1 1 1 5 4 | 7
value 2 1 1 1 5 4 | 7
log_prob 2 1 1 1 5 4 |
Writing parallelizable code
It can be tricky to write Pyro models that correctly handle parallelized sample sites. Two tricks help: broadcasting and ellipsis slicing. Let’s look at a contrived model to see how these work in practice. Our aim is to write a model that works both with and without enumeration.
[12]:
width = 8
height = 10
sparse_pixels = torch.LongTensor([[3, 2], [3, 5], [3, 9], [7, 1]])
enumerated = None # set to either True or False below
def fun(observe):
p_x = pyro.param("p_x", torch.tensor(0.1), constraint=constraints.unit_interval)
p_y = pyro.param("p_y", torch.tensor(0.1), constraint=constraints.unit_interval)
x_axis = pyro.plate('x_axis', width, dim=-2)
y_axis = pyro.plate('y_axis', height, dim=-1)
# Note that the shapes of these sites depend on whether Pyro is enumerating.
with x_axis:
x_active = pyro.sample("x_active", Bernoulli(p_x))
with y_axis:
y_active = pyro.sample("y_active", Bernoulli(p_y))
if enumerated:
assert x_active.shape == (2, 1, 1)
assert y_active.shape == (2, 1, 1, 1)
else:
assert x_active.shape == (width, 1)
assert y_active.shape == (height,)
# The first trick is to broadcast. This works with or without enumeration.
p = 0.1 + 0.5 * x_active * y_active
if enumerated:
assert p.shape == (2, 2, 1, 1)
else:
assert p.shape == (width, height)
dense_pixels = p.new_zeros(broadcast_shape(p.shape, (width, height)))
# The second trick is to index using ellipsis slicing.
# This allows Pyro to add arbitrary dimensions on the left.
for x, y in sparse_pixels:
dense_pixels[..., x, y] = 1
if enumerated:
assert dense_pixels.shape == (2, 2, width, height)
else:
assert dense_pixels.shape == (width, height)
with x_axis, y_axis:
if observe:
pyro.sample("pixels", Bernoulli(p), obs=dense_pixels)
def model4():
fun(observe=True)
def guide4():
fun(observe=False)
# Test without enumeration.
enumerated = False
test_model(model4, guide4, Trace_ELBO())
# Test with enumeration.
enumerated = True
test_model(model4, config_enumerate(guide4, "parallel"),
TraceEnum_ELBO(max_plate_nesting=2))
Automatic broadcasting inside pyro.plate
Note that in all our model/guide specifications, we have relied on pyro.plate to automatically expand sample shapes to satisfy the constraints on batch shape enforced by pyro.sample statements. However this broadcasting is equivalent to hand-annotated .expand() statements.
We will demonstrate this using model4 from the previous section. Note the following changes to the code from earlier:
• For the purpose of this example, we will only consider “parallel” enumeration, but broadcasting should work as expected without enumeration or with “sequential” enumeration.
• We have separated out the sampling function which returns the tensors corresponding to the active pixels. Modularizing the model code into components is a common practice, and helps with maintainability of large models.
• We would also like to use the pyro.plate construct to parallelize the ELBO estimator over num_particles. This is done by wrapping the contents of model/guide inside an outermost pyro.plate context.
[13]:
num_particles = 100 # Number of samples for the ELBO estimator
width = 8
height = 10
sparse_pixels = torch.LongTensor([[3, 2], [3, 5], [3, 9], [7, 1]])
def sample_pixel_locations_no_broadcasting(p_x, p_y, x_axis, y_axis):
with x_axis:
x_active = pyro.sample("x_active", Bernoulli(p_x).expand([num_particles, width, 1]))
with y_axis:
y_active = pyro.sample("y_active", Bernoulli(p_y).expand([num_particles, 1, height]))
return x_active, y_active
def sample_pixel_locations_full_broadcasting(p_x, p_y, x_axis, y_axis):
with x_axis:
x_active = pyro.sample("x_active", Bernoulli(p_x))
with y_axis:
y_active = pyro.sample("y_active", Bernoulli(p_y))
return x_active, y_active
def sample_pixel_locations_partial_broadcasting(p_x, p_y, x_axis, y_axis):
with x_axis:
x_active = pyro.sample("x_active", Bernoulli(p_x).expand([width, 1]))
with y_axis:
y_active = pyro.sample("y_active", Bernoulli(p_y).expand([height]))
return x_active, y_active
def fun(observe, sample_fn):
p_x = pyro.param("p_x", torch.tensor(0.1), constraint=constraints.unit_interval)
p_y = pyro.param("p_y", torch.tensor(0.1), constraint=constraints.unit_interval)
x_axis = pyro.plate('x_axis', width, dim=-2)
y_axis = pyro.plate('y_axis', height, dim=-1)
with pyro.plate("num_particles", 100, dim=-3):
x_active, y_active = sample_fn(p_x, p_y, x_axis, y_axis)
# Indices corresponding to "parallel" enumeration are appended
# to the left of the "num_particles" plate dim.
assert x_active.shape == (2, 1, 1, 1)
assert y_active.shape == (2, 1, 1, 1, 1)
p = 0.1 + 0.5 * x_active * y_active
assert p.shape == (2, 2, 1, 1, 1)
dense_pixels = p.new_zeros(broadcast_shape(p.shape, (width, height)))
for x, y in sparse_pixels:
dense_pixels[..., x, y] = 1
assert dense_pixels.shape == (2, 2, 1, width, height)
with x_axis, y_axis:
if observe:
pyro.sample("pixels", Bernoulli(p), obs=dense_pixels)
def test_model_with_sample_fn(sample_fn):
def model():
fun(observe=True, sample_fn=sample_fn)
@config_enumerate
def guide():
fun(observe=False, sample_fn=sample_fn)
test_model(model, guide, TraceEnum_ELBO(max_plate_nesting=3))
test_model_with_sample_fn(sample_pixel_locations_no_broadcasting)
test_model_with_sample_fn(sample_pixel_locations_full_broadcasting)
test_model_with_sample_fn(sample_pixel_locations_partial_broadcasting)
In the first sampling function, we had to do some manual book-keeping and expand the Bernoulli distribution’s batch shape to account for the conditionally independent dimensions added by the pyro.plate contexts. In particular, note how sample_pixel_locations needs knowledge of num_particles, width and height and is accessing these variables from the global scope, which is not ideal.
• The second argument to pyro.plate, i.e. the optional size argument needs to be provided for implicit broadasting, so that it can infer the batch shape requirement for each of the sample sites.
• The existing batch_shape of the sample site must be broadcastable with the size of the pyro.plate contexts. In our particular example, Bernoulli(p_x) has an empty batch shape which is universally broadcastable.
Note how simple it is to achieve parallelization via tensorized operations using pyro.plate! pyro.plate also helps in code modularization because model components can be written agnostic of the plate contexts in which they may subsequently get embedded in.
[ ]:
|
{
"url": "https://pyro.ai/examples/tensor_shapes.html",
"source_domain": "pyro.ai",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "123124",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PH46IJGR4PVSQVO7M72GDXBRHA5AUJLP",
"WARC-Concurrent-To": "<urn:uuid:4ee392af-81c7-4d9e-8b77-6df7ee74e7eb>",
"WARC-Date": "2021-09-17T12:13:59Z",
"WARC-IP-Address": "185.199.109.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4D4QHOTMF64HWR4SVVUYWRY4OIMEG5MC",
"WARC-Record-ID": "<urn:uuid:02b8cd1f-7857-499b-9221-12a2dcd1de6e>",
"WARC-Target-URI": "https://pyro.ai/examples/tensor_shapes.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6cdcfdbf-facc-4b58-9b7c-6a33a0234fc6>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-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,
22,
23,
242,
243,
252,
253,
336,
337,
400,
401,
476,
477,
565,
566,
631,
632,
724,
725,
808,
809,
883,
884,
947,
948,
1006,
1007,
1080,
1081,
1164,
1165,
1250,
1251,
1333,
1334,
1413,
1414,
1432,
1433,
1438,
1448,
1461,
1473,
1517,
1599,
1651,
1719,
1750,
1778,
1779,
1813,
1857,
1858,
1914,
1950,
1979,
2007,
2008,
2058,
2059,
2262,
2263,
2278,
2326,
2327,
2719,
2720,
2764,
2765,
2929,
2930,
2958,
3018,
3019,
3030,
3031,
3078,
3127,
3176,
3177,
3439,
3440,
3449,
3450,
3519,
3520,
3525,
3544,
3571,
3598,
3613,
3634,
3667,
3668,
3731,
3732,
3737,
3774,
3805,
3832,
3847,
3872,
3909,
3910,
4049,
4050,
4055,
4120,
4151,
4178,
4193,
4218,
4255,
4256,
4385,
4386,
4391,
4447,
4474,
4503,
4518,
4583,
4634,
4635,
4659,
4660,
4845,
4846,
4851,
4900,
4929,
4958,
4973,
4998,
5033,
5034,
5351,
5352,
5391,
5392,
5496,
5497,
5557,
5581,
5582,
5774,
5775,
5807,
5876,
5904,
5905,
6711,
6712,
6750,
6751,
7168,
7169,
7296,
7297,
7326,
7387,
7388,
7471,
7472,
7515,
7576,
7577,
7675,
7676,
7708,
7769,
7805,
7879,
7880,
7960,
7961,
8323,
8324,
8365,
8406,
8419,
8480,
8493,
8554,
8575,
8645,
8646,
8701,
8702,
8707,
8721,
8760,
8824,
8859,
8915,
8950,
9022,
9095,
9170,
9243,
9319,
9320,
9365,
9410,
9427,
9470,
9487,
9530,
9555,
9600,
9667,
9748,
9829,
9910,
9993,
9994,
10035,
10036,
10263,
10264,
10288,
10312,
10362,
10418,
10468,
10508,
10569,
10609,
10673,
10722,
10735,
10786,
10837,
10870,
10924,
10957,
11011,
11052,
11108,
11173,
11222,
11223,
11616,
11617,
11622,
11664,
11741,
11770,
11784,
11798,
11812,
11834,
11856,
11878,
11902,
11926,
11948,
11970,
11992,
12014,
12036,
12058,
12080,
12102,
12124,
12146,
12172,
12198,
12220,
12242,
12264,
12286,
12308,
12330,
12352,
12374,
12396,
12418,
12440,
12462,
12484,
12506,
12528,
12550,
12574,
12598,
12620,
12621,
12656,
12657,
12893,
12894,
13068,
13069,
13074,
13100,
13101,
13115,
13169,
13235,
13318,
13381,
13471,
13502,
13565,
13593,
13594,
13652,
13653,
13696,
13697,
13882,
13883,
14471,
14472,
14774,
14775,
14803,
14822,
14846,
14870,
14924,
14984,
15038,
15082,
15147,
15191,
15259,
15312,
15331,
15386,
15441,
15478,
15536,
15573,
15631,
15676,
15736,
15806,
15859,
15860,
16027,
16028,
16034,
16052,
16066,
16112,
16167,
16168,
16225,
16294,
16329,
16374,
16413,
16462,
16511,
16554,
16610,
16679,
16680,
16732,
16821,
16907,
16987,
17067,
17148,
17149,
17200,
17251,
17252,
17316,
17317,
17892,
17893,
17945,
17946,
17973,
17991,
18015,
18038,
18113,
18173,
18226,
18289,
18346,
18413,
18480,
18541,
18615,
18675,
18676,
18810,
18811,
18817,
18897,
18974,
19003,
19017,
19031,
19059,
19087,
19101,
19129,
19157,
19185,
19213,
19241,
19269,
19297,
19325,
19353,
19381,
19409,
19437,
19465,
19493,
19521,
19549,
19577,
19605,
19635,
19665,
19693,
19694,
19722,
19723,
20003,
20004,
20010,
20020,
20032,
20099,
20154,
20155,
20173,
20258,
20343,
20392,
20442,
20443,
20524,
20541,
20600,
20617,
20676,
20695,
20739,
20786,
20796,
20841,
20885,
20886,
20965,
21005,
21024,
21063,
21073,
21115,
21189,
21190,
21249,
21313,
21344,
21380,
21399,
21458,
21468,
21521,
21522,
21547,
21567,
21633,
21634,
21648,
21670,
21671,
21685,
21708,
21709,
21737,
21756,
21797,
21798,
21823,
21841,
21898,
21946,
21947,
21988,
21989,
22263,
22264,
22382,
22383,
22561,
22562,
22786,
22787,
22989,
22990,
22996,
23060,
23070,
23082,
23149,
23150,
23220,
23237,
23330,
23347,
23441,
23471,
23472,
23544,
23561,
23620,
23637,
23696,
23726,
23727,
23802,
23819,
23897,
23914,
23990,
24020,
24021,
24050,
24135,
24220,
24269,
24319,
24320,
24371,
24436,
24507,
24563,
24610,
24660,
24704,
24746,
24747,
24825,
24860,
24900,
24962,
24963,
24992,
25016,
25086,
25087,
25129,
25146,
25193,
25194,
25216,
25233,
25281,
25282,
25348,
25349,
25415,
25483,
25554,
25555,
25941,
25942,
26139,
26140,
26355,
26356,
26613,
26614
],
"line_end_idx": [
22,
23,
242,
243,
252,
253,
336,
337,
400,
401,
476,
477,
565,
566,
631,
632,
724,
725,
808,
809,
883,
884,
947,
948,
1006,
1007,
1080,
1081,
1164,
1165,
1250,
1251,
1333,
1334,
1413,
1414,
1432,
1433,
1438,
1448,
1461,
1473,
1517,
1599,
1651,
1719,
1750,
1778,
1779,
1813,
1857,
1858,
1914,
1950,
1979,
2007,
2008,
2058,
2059,
2262,
2263,
2278,
2326,
2327,
2719,
2720,
2764,
2765,
2929,
2930,
2958,
3018,
3019,
3030,
3031,
3078,
3127,
3176,
3177,
3439,
3440,
3449,
3450,
3519,
3520,
3525,
3544,
3571,
3598,
3613,
3634,
3667,
3668,
3731,
3732,
3737,
3774,
3805,
3832,
3847,
3872,
3909,
3910,
4049,
4050,
4055,
4120,
4151,
4178,
4193,
4218,
4255,
4256,
4385,
4386,
4391,
4447,
4474,
4503,
4518,
4583,
4634,
4635,
4659,
4660,
4845,
4846,
4851,
4900,
4929,
4958,
4973,
4998,
5033,
5034,
5351,
5352,
5391,
5392,
5496,
5497,
5557,
5581,
5582,
5774,
5775,
5807,
5876,
5904,
5905,
6711,
6712,
6750,
6751,
7168,
7169,
7296,
7297,
7326,
7387,
7388,
7471,
7472,
7515,
7576,
7577,
7675,
7676,
7708,
7769,
7805,
7879,
7880,
7960,
7961,
8323,
8324,
8365,
8406,
8419,
8480,
8493,
8554,
8575,
8645,
8646,
8701,
8702,
8707,
8721,
8760,
8824,
8859,
8915,
8950,
9022,
9095,
9170,
9243,
9319,
9320,
9365,
9410,
9427,
9470,
9487,
9530,
9555,
9600,
9667,
9748,
9829,
9910,
9993,
9994,
10035,
10036,
10263,
10264,
10288,
10312,
10362,
10418,
10468,
10508,
10569,
10609,
10673,
10722,
10735,
10786,
10837,
10870,
10924,
10957,
11011,
11052,
11108,
11173,
11222,
11223,
11616,
11617,
11622,
11664,
11741,
11770,
11784,
11798,
11812,
11834,
11856,
11878,
11902,
11926,
11948,
11970,
11992,
12014,
12036,
12058,
12080,
12102,
12124,
12146,
12172,
12198,
12220,
12242,
12264,
12286,
12308,
12330,
12352,
12374,
12396,
12418,
12440,
12462,
12484,
12506,
12528,
12550,
12574,
12598,
12620,
12621,
12656,
12657,
12893,
12894,
13068,
13069,
13074,
13100,
13101,
13115,
13169,
13235,
13318,
13381,
13471,
13502,
13565,
13593,
13594,
13652,
13653,
13696,
13697,
13882,
13883,
14471,
14472,
14774,
14775,
14803,
14822,
14846,
14870,
14924,
14984,
15038,
15082,
15147,
15191,
15259,
15312,
15331,
15386,
15441,
15478,
15536,
15573,
15631,
15676,
15736,
15806,
15859,
15860,
16027,
16028,
16034,
16052,
16066,
16112,
16167,
16168,
16225,
16294,
16329,
16374,
16413,
16462,
16511,
16554,
16610,
16679,
16680,
16732,
16821,
16907,
16987,
17067,
17148,
17149,
17200,
17251,
17252,
17316,
17317,
17892,
17893,
17945,
17946,
17973,
17991,
18015,
18038,
18113,
18173,
18226,
18289,
18346,
18413,
18480,
18541,
18615,
18675,
18676,
18810,
18811,
18817,
18897,
18974,
19003,
19017,
19031,
19059,
19087,
19101,
19129,
19157,
19185,
19213,
19241,
19269,
19297,
19325,
19353,
19381,
19409,
19437,
19465,
19493,
19521,
19549,
19577,
19605,
19635,
19665,
19693,
19694,
19722,
19723,
20003,
20004,
20010,
20020,
20032,
20099,
20154,
20155,
20173,
20258,
20343,
20392,
20442,
20443,
20524,
20541,
20600,
20617,
20676,
20695,
20739,
20786,
20796,
20841,
20885,
20886,
20965,
21005,
21024,
21063,
21073,
21115,
21189,
21190,
21249,
21313,
21344,
21380,
21399,
21458,
21468,
21521,
21522,
21547,
21567,
21633,
21634,
21648,
21670,
21671,
21685,
21708,
21709,
21737,
21756,
21797,
21798,
21823,
21841,
21898,
21946,
21947,
21988,
21989,
22263,
22264,
22382,
22383,
22561,
22562,
22786,
22787,
22989,
22990,
22996,
23060,
23070,
23082,
23149,
23150,
23220,
23237,
23330,
23347,
23441,
23471,
23472,
23544,
23561,
23620,
23637,
23696,
23726,
23727,
23802,
23819,
23897,
23914,
23990,
24020,
24021,
24050,
24135,
24220,
24269,
24319,
24320,
24371,
24436,
24507,
24563,
24610,
24660,
24704,
24746,
24747,
24825,
24860,
24900,
24962,
24963,
24992,
25016,
25086,
25087,
25129,
25146,
25193,
25194,
25216,
25233,
25281,
25282,
25348,
25349,
25415,
25483,
25554,
25555,
25941,
25942,
26139,
26140,
26355,
26356,
26613,
26614,
26618
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 26618,
"ccnet_original_nlines": 572,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2078651636838913,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0010533699532970786,
"rps_doc_frac_lines_end_with_ellipsis": 0.0017452000174671412,
"rps_doc_frac_no_alph_words": 0.44627809524536133,
"rps_doc_frac_unique_words": 0.2500801384449005,
"rps_doc_mean_word_length": 5.50432825088501,
"rps_doc_num_sentences": 413,
"rps_doc_symbol_to_word_ratio": 0.00877808965742588,
"rps_doc_unigram_entropy": 5.731630802154541,
"rps_doc_word_count": 3119,
"rps_doc_frac_chars_dupe_10grams": 0.10589469224214554,
"rps_doc_frac_chars_dupe_5grams": 0.19280056655406952,
"rps_doc_frac_chars_dupe_6grams": 0.15202702581882477,
"rps_doc_frac_chars_dupe_7grams": 0.13787278532981873,
"rps_doc_frac_chars_dupe_8grams": 0.12896086275577545,
"rps_doc_frac_chars_dupe_9grams": 0.11830148845911026,
"rps_doc_frac_chars_top_2gram": 0.007222739979624748,
"rps_doc_frac_chars_top_3gram": 0.005067570134997368,
"rps_doc_frac_chars_top_4gram": 0.004193849861621857,
"rps_doc_books_importance": -2068.603271484375,
"rps_doc_books_importance_length_correction": -2068.603271484375,
"rps_doc_openwebtext_importance": -1319.05419921875,
"rps_doc_openwebtext_importance_length_correction": -1319.05419921875,
"rps_doc_wikipedia_importance": -942.481201171875,
"rps_doc_wikipedia_importance_length_correction": -942.481201171875
},
"fasttext": {
"dclm": 0.7216262817382812,
"english": 0.7351601719856262,
"fineweb_edu_approx": 2.5020604133605957,
"eai_general_math": 0.9968115091323853,
"eai_open_web_math": 0.4566701650619507,
"eai_web_code": 0.9860851168632507
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,184,449,782,919,013,000
|
Trig.
posted by .
Josh kicks a soccer ball with an initial velocity of 18 feet per second out of a window from a height of 12 feet. The function h(t)= -16t^2+18t+12 represents the height of the soccer ball after t seconds.What is the domain of this function in the context of this problem?
• Trig. -
the domain of any polynomial is all real numbers, but in this context, I'd have to say it'd be all reals greater than zero.
Getting even more restrictive, we'd need the height to never be negative, so that would restrict the domain to the interval between 0 and where h(t) = 0.
Find that value for t, and that interval will be the domain.
• Trig. -
0 greater or equal to t greater or equal to 1.6
Respond to this Question
First Name
School Subject
Your Answer
Similar Questions
1. Algebra - word problem
A red ball and a green ball are simultaneously tossed into the air. The red ball is given an initial velocity of 96 feet per second, and its height, t seconds after it is tossed is (-16t^2 + 96t) feet. The green ball is given an initial …
2. algebra 1b
Arianna kicks a soccer ball off the ground and in the air with an initial velocity of 42 feet per second. Approximately what maximum height does the soccer ball reach?
3. ALGEBRA...[HELPP!!]
Arianna kicks a soccer ball off the ground and in the air with an initial velocity of 42 feet per second. Approximately what maximum height does the soccer ball reach?
4. math
a baseball is hit with an initial velocity of 75 feet per second from the height of 3 feet. The function h(t)=-16t squared + 75t + 3 models the path of the baseball where t represents the time in seconds that the ball has been traveling …
5. algebra 1 NEED NOW!!! PLEASE HELPPP
The height of a soccer ball that is kicked from the ground can be approximated by the function: y = -12⋅x2 + 48⋅x where y is the height of the soccer ball in feet x seconds after it is kicked. Find the time it takes the …
6. algebra 1 NEED NOW!!! PLEASE HELPPP
The height of a soccer ball that is kicked from the ground can be approximated by the function: y = -12⋅x^2 + 48⋅x where y is the height of the soccer ball in feet x seconds after it is kicked. Find the time it takes the …
7. math
The height of a soccer ball that is kicked from the ground can be approximated by the function y=-16x^2 +32x where y is the height of the soccer ball on feet x seconds after it is kicked. Graph this function. find the soccer balls …
8. math
Mariano is standing at the top of a hill when he kicks a soccer ball into the air. The height of the hill is h feet, and the ball is kicked with an initial velocity of v feet per second. The height of the ball above the bottom of the …
9. Math
Suppose Paul kicks a soccer ball straight up into the air with an initial velocity of 96 feet per second. The function f(x) = -16t2 + 96t gives the height, in feet, of the soccer ball after t seconds What are the zeros?
10. algebra
Suppose Paul kicks a soccer ball straight up into the air with an initial velocity of 96 feet per second. The function f(x) = -16t2 + 96t gives the height, in feet, of the soccer ball after t seconds.Show all work to find the axis …
More Similar Questions
|
{
"url": "https://www.jiskha.com/display.cgi?id=1333304269",
"source_domain": "www.jiskha.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "13209",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:74TPHNISPD6ZIBTPMXDKTNCOOIXVWEUN",
"WARC-Concurrent-To": "<urn:uuid:235b8bb8-4ad9-46e7-928f-38d5cd8ce181>",
"WARC-Date": "2017-11-19T18:09:37Z",
"WARC-IP-Address": "69.16.226.225",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DBTFWEA5J3EUCWPJO2RHQATE4IEB5A7R",
"WARC-Record-ID": "<urn:uuid:30af9595-3537-42b2-bf3c-6021da4a45ab>",
"WARC-Target-URI": "https://www.jiskha.com/display.cgi?id=1333304269",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fc4f241f-fd67-4bf3-8dce-2d8f9b646ae2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-144-140-14.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,
6,
7,
19,
20,
292,
293,
305,
306,
434,
435,
593,
594,
659,
660,
672,
673,
725,
726,
751,
752,
763,
778,
790,
791,
809,
810,
838,
839,
1082,
1098,
1099,
1271,
1296,
1297,
1469,
1479,
1480,
1723,
1764,
1765,
1991,
2032,
2033,
2260,
2270,
2271,
2508,
2518,
2519,
2759,
2769,
2770,
2994,
3008,
3009,
3246,
3247
],
"line_end_idx": [
6,
7,
19,
20,
292,
293,
305,
306,
434,
435,
593,
594,
659,
660,
672,
673,
725,
726,
751,
752,
763,
778,
790,
791,
809,
810,
838,
839,
1082,
1098,
1099,
1271,
1296,
1297,
1469,
1479,
1480,
1723,
1764,
1765,
1991,
2032,
2033,
2260,
2270,
2271,
2508,
2518,
2519,
2759,
2769,
2770,
2994,
3008,
3009,
3246,
3247,
3269
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3269,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4128943681716919,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016460910439491272,
"rps_doc_frac_lines_end_with_ellipsis": 0.12068966031074524,
"rps_doc_frac_no_alph_words": 0.20301783084869385,
"rps_doc_frac_unique_words": 0.2906976640224457,
"rps_doc_mean_word_length": 4.046511650085449,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.010973939672112465,
"rps_doc_unigram_entropy": 4.487239837646484,
"rps_doc_word_count": 602,
"rps_doc_frac_chars_dupe_10grams": 0.4248768389225006,
"rps_doc_frac_chars_dupe_5grams": 0.5164203643798828,
"rps_doc_frac_chars_dupe_6grams": 0.4753694534301758,
"rps_doc_frac_chars_dupe_7grams": 0.46305418014526367,
"rps_doc_frac_chars_dupe_8grams": 0.4519704282283783,
"rps_doc_frac_chars_dupe_9grams": 0.43801313638687134,
"rps_doc_frac_chars_top_2gram": 0.06978654116392136,
"rps_doc_frac_chars_top_3gram": 0.04515599086880684,
"rps_doc_frac_chars_top_4gram": 0.062397368252277374,
"rps_doc_books_importance": -244.0745391845703,
"rps_doc_books_importance_length_correction": -244.0745391845703,
"rps_doc_openwebtext_importance": -113.09488677978516,
"rps_doc_openwebtext_importance_length_correction": -113.09488677978516,
"rps_doc_wikipedia_importance": -75.62676239013672,
"rps_doc_wikipedia_importance_length_correction": -75.62676239013672
},
"fasttext": {
"dclm": 0.9490524530410767,
"english": 0.909582793712616,
"fineweb_edu_approx": 2.8810834884643555,
"eai_general_math": 0.996300220489502,
"eai_open_web_math": 0.6840410828590393,
"eai_web_code": 0.023566419258713722
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.94",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "515.15",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "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": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-686,482,644,850,217,600
|
0
This is Orbiter:
Ok what is wrong?
I have start =0 at the beginning.
then this:
case OAPI_KEY_K: // start
if (start=0)
start=0;
else
PlayVesselWave3(MySoundID,START,NOLOOP,255,22100);
start=1;
return 1;
So start should be 0 until K is pressed. If K is pressed then the wav is played and start =1
and this:
// engine sound
double pit = (vsAirSpeed * pit2) + 11025;
double sp = (190 +((vsAirSpeed)*5));
if (sp>=225)sp=225;
sprintf(oapiDebugString(),"anim %2.2f", start );
if (start=1){PlayVesselWave3(MySoundID,ENG,LOOP,sp,pit);
}
if ((vsAirSpeed == 0) & (start==1)) { PlayVesselWave3(MySoundID,ENG,LOOP,190);
}
}
so if start =1 vehicle is started after K was pressed. play wav
if start =0 not started skip
if start =1 (started) and VS =0 not moving play this wav
else nothing.
So unless it is started no wav should play.
the variable "double start=0 is set at thefirst. When I start the scenario. start shows up as 1 , before pressing K and I can press k and the start wav plays.
It compiles fine
4
Contributors
13
Replies
14
Views
11 Years
Discussion Span
Last Post by gattispilot
0
line 2 in your first code snippet: use the boolean == operator instead of the assignment = operator.
lines 4-7 -- you need to use braces "='{' and '}' in order to put lines 5-7 inside the else block on line 4.
In the second code snippet its difficult to see what is going on because it is so poorly formatted.
0
Consider following the coding practice:
When you compare a const with a non-const for equality put const on LHS instead of RHS.
E.g.
//instead of this:
if ( start == 0 )
//do this:
if ( 0 == start )
0
case OAPI_KEY_K: // start
if (0 ==start);
start=0;
else
{PlayVesselWave3(MySoundID,START,NOLOOP,255,22100);
start=1;}
return 1;
now I get this:
Chariotsound3.cpp(965) : error C2181: illegal else without matching if
Now what?
> Terminated with exit code 2.c2181 illegal case
line 2 in your first code snippet: use the boolean == operator instead of the assignment = operator.
lines 4-7 -- you need to use braces "='{' and '}' in order to put lines 5-7 inside the else block on line 4.
In the second code snippet its difficult to see what is going on because it is so poorly formatted.
0
that switch statement you posted doesn't make any sense. If start is 0 why set it to 0 again ? Can start be anything other than 0 or 1 (such as can it ever be 2) ? If not then how does it get set to 1?
0
I did thatbecause it worked. Any ideas. for another way.
What I want to happen is:
the letter K is pressed
if start =0 then play the start wav and set start to 1. So that that wav will not play again. if start=1 than it is started
0
>>I did thatbecause it worked
no it doesn't. This is how it should have been coded
case OAPI_KEY_K: // start
if (0 ==start)
{
PlayVesselWave3(MySoundID,START,NOLOOP,255,22100);
start=1;
}
else
{
start = 0;
}
return 1;
0
how about this:
case OAPI_KEY_I: // forward
gear=1;
return 1;
case OAPI_KEY_M: // reverse
gear=-1;
return 1;
the value for gear changes when the key is pressed but then goes back to 0. I have tried putting brackets around the gear= but no change
0
I thought that also. But check all references to gear. Here they are, they are mainly if gear=....
sprintf(oapiDebugString(),"gear %2.2f", thr );
SetThrusterGroupLevel (THGROUP_ATT_YAWLEFT, thr);
SetThrusterGroupLevel (THGROUP_ATT_YAWRIGHT, thr);
if (gear=-1)
{
SetThrusterGroupLevel (THGROUP_ATT_YAWLEFT, thr);
SetThrusterGroupLevel (THGROUP_ATT_YAWRIGHT, thr);
}
if (gear=0)
{
SetThrusterGroupLevel (THGROUP_ATT_YAWLEFT, 0);
SetThrusterGroupLevel (THGROUP_ATT_YAWRIGHT, 0);
}
//Anim Levers
// Forward LEFT Lever animation
if (gear=-1)
{
i2=i2 + 0.01;
if (i2 > .75) i2= .75;
SetAnimation (anim_leverleft, i2);
}
if (gear=1)
{
i2=i2 - 0.01;
if (i2 < 0.25) i2= 0.25;
SetAnimation (anim_leverleft, i2);
}
if (gear=0)
{
i2 = 0.5;
SetAnimation (anim_leverleft, i2);
}
// Forward RIGHT Lever animation
if (gear=-1)
{
i4=i4 + 0.01;
if (i4 > .75) i4= .75;
SetAnimation (anim_leverright, i4);
}
if (gear=1)
{
i4=i4 - 0.01;
if (i4 < 0.25) i4= 0.25;
SetAnimation (anim_leverright, i4);
}
if (gear=0)
{
i4 = 0.5;
SetAnimation (anim_leverright, i4);
}
0
I have run into this:
if (GetThrusterLevel (th_main) >0 && i3 == 0)
{
if (i > 1)i=0;
if (vsAirSpeed > 0.15) {
if (vsAirSpeed > 55) vsAirSpeed = 55;
if (i > 1)i=0;
i = i + (vsAirSpeed /3);
if (vsAirSpeed ==0) i=0;
sprintf(oapiDebugString(),"anim %2.2f", i );
SetAnimation (anim_wheelright, i);
SetAnimation (anim_wheelleft, i);
main_on = 1;
retro_on = 0;
what is to happen if thrust level is more than 0 the value I is added. but what happens is even though the thrust level is above 0 , I is increased only once. Rather than keepin increasing til it gets to 1
0
Thanks that fixed that part.
case OAPI_KEY_K: // start
if (0 ==start)
{
PlayVesselWave3(MySoundID,START,NOLOOP,255,22100);
start=1;
}
else
{
start = 0;
}
return 1;
Okay I think this is right but the value for STart is always 1 not 0 until k is pressed
This question has already been answered. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.
|
{
"url": "https://www.daniweb.com/programming/software-development/threads/80975/what-is-wrong",
"source_domain": "www.daniweb.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "70808",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AW4BWJFXPQMM53VTGJUN6XLAHKWL7U4M",
"WARC-Concurrent-To": "<urn:uuid:b3d198aa-4341-4376-9198-c3bee5052811>",
"WARC-Date": "2018-07-20T08:56:15Z",
"WARC-IP-Address": "198.23.117.137",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2ZXY2TJTP24DPCNIQHPAOQ3QNYTJXK5Q",
"WARC-Record-ID": "<urn:uuid:1607357e-2b15-407a-ba89-1647caa3f276>",
"WARC-Target-URI": "https://www.daniweb.com/programming/software-development/threads/80975/what-is-wrong",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:66e2a034-489f-4281-ae77-d654c26ff6f8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-201-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
2,
3,
20,
38,
39,
73,
84,
85,
111,
132,
161,
175,
238,
259,
289,
290,
383,
384,
394,
395,
411,
454,
492,
512,
563,
620,
622,
623,
624,
703,
705,
723,
725,
726,
790,
819,
876,
890,
934,
1093,
1110,
1111,
1113,
1126,
1129,
1137,
1140,
1146,
1155,
1171,
1196,
1198,
1199,
1300,
1301,
1410,
1411,
1511,
1512,
1514,
1515,
1555,
1643,
1644,
1649,
1650,
1669,
1687,
1698,
1716,
1718,
1744,
1781,
1818,
1843,
1915,
1945,
1975,
1976,
1992,
1993,
2064,
2065,
2075,
2076,
2125,
2126,
2227,
2228,
2337,
2338,
2438,
2439,
2441,
2442,
2644,
2645,
2647,
2648,
2705,
2706,
2732,
2756,
2880,
2881,
2883,
2884,
2914,
2967,
2968,
2994,
3017,
3025,
3089,
3111,
3119,
3130,
3138,
3163,
3171,
3187,
3189,
3190,
3206,
3207,
3235,
3251,
3269,
3278,
3314,
3331,
3349,
3350,
3487,
3488,
3490,
3491,
3590,
3591,
3638,
3639,
3693,
3748,
3749,
3763,
3769,
3823,
3878,
3880,
3893,
3899,
3951,
4008,
4017,
4035,
4040,
4076,
4081,
4098,
4103,
4109,
4131,
4162,
4171,
4214,
4223,
4232,
4238,
4243,
4248,
4256,
4276,
4281,
4287,
4309,
4342,
4351,
4360,
4403,
4412,
4421,
4427,
4432,
4437,
4456,
4462,
4480,
4488,
4497,
4506,
4549,
4558,
4567,
4573,
4614,
4619,
4636,
4641,
4647,
4669,
4700,
4709,
4753,
4762,
4771,
4777,
4782,
4787,
4795,
4815,
4820,
4826,
4848,
4881,
4890,
4899,
4943,
4952,
4961,
4967,
4972,
4977,
4993,
4998,
5004,
5022,
5030,
5039,
5048,
5092,
5101,
5110,
5116,
5118,
5119,
5141,
5142,
5188,
5191,
5196,
5215,
5220,
5249,
5258,
5304,
5305,
5310,
5329,
5358,
5364,
5393,
5398,
5447,
5452,
5491,
5529,
5534,
5551,
5569,
5570,
5776,
5777,
5779,
5780,
5809,
5810,
5836,
5859,
5867,
5931,
5953,
5961,
5972,
5980,
6005,
6013,
6029,
6030,
6118,
6119,
6192
],
"line_end_idx": [
2,
3,
20,
38,
39,
73,
84,
85,
111,
132,
161,
175,
238,
259,
289,
290,
383,
384,
394,
395,
411,
454,
492,
512,
563,
620,
622,
623,
624,
703,
705,
723,
725,
726,
790,
819,
876,
890,
934,
1093,
1110,
1111,
1113,
1126,
1129,
1137,
1140,
1146,
1155,
1171,
1196,
1198,
1199,
1300,
1301,
1410,
1411,
1511,
1512,
1514,
1515,
1555,
1643,
1644,
1649,
1650,
1669,
1687,
1698,
1716,
1718,
1744,
1781,
1818,
1843,
1915,
1945,
1975,
1976,
1992,
1993,
2064,
2065,
2075,
2076,
2125,
2126,
2227,
2228,
2337,
2338,
2438,
2439,
2441,
2442,
2644,
2645,
2647,
2648,
2705,
2706,
2732,
2756,
2880,
2881,
2883,
2884,
2914,
2967,
2968,
2994,
3017,
3025,
3089,
3111,
3119,
3130,
3138,
3163,
3171,
3187,
3189,
3190,
3206,
3207,
3235,
3251,
3269,
3278,
3314,
3331,
3349,
3350,
3487,
3488,
3490,
3491,
3590,
3591,
3638,
3639,
3693,
3748,
3749,
3763,
3769,
3823,
3878,
3880,
3893,
3899,
3951,
4008,
4017,
4035,
4040,
4076,
4081,
4098,
4103,
4109,
4131,
4162,
4171,
4214,
4223,
4232,
4238,
4243,
4248,
4256,
4276,
4281,
4287,
4309,
4342,
4351,
4360,
4403,
4412,
4421,
4427,
4432,
4437,
4456,
4462,
4480,
4488,
4497,
4506,
4549,
4558,
4567,
4573,
4614,
4619,
4636,
4641,
4647,
4669,
4700,
4709,
4753,
4762,
4771,
4777,
4782,
4787,
4795,
4815,
4820,
4826,
4848,
4881,
4890,
4899,
4943,
4952,
4961,
4967,
4972,
4977,
4993,
4998,
5004,
5022,
5030,
5039,
5048,
5092,
5101,
5110,
5116,
5118,
5119,
5141,
5142,
5188,
5191,
5196,
5215,
5220,
5249,
5258,
5304,
5305,
5310,
5329,
5358,
5364,
5393,
5398,
5447,
5452,
5491,
5529,
5534,
5551,
5569,
5570,
5776,
5777,
5779,
5780,
5809,
5810,
5836,
5859,
5867,
5931,
5953,
5961,
5972,
5980,
6005,
6013,
6029,
6030,
6118,
6119,
6192,
6330
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6330,
"ccnet_original_nlines": 281,
"rps_doc_curly_bracket": 0.005845179781317711,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.254004567861557,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037376049906015396,
"rps_doc_frac_lines_end_with_ellipsis": 0.0035461001098155975,
"rps_doc_frac_no_alph_words": 0.4340198338031769,
"rps_doc_frac_unique_words": 0.3539822995662689,
"rps_doc_mean_word_length": 4.701643466949463,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0.000762780022341758,
"rps_doc_unigram_entropy": 5.025237083435059,
"rps_doc_word_count": 791,
"rps_doc_frac_chars_dupe_10grams": 0.17316482961177826,
"rps_doc_frac_chars_dupe_5grams": 0.30196288228034973,
"rps_doc_frac_chars_dupe_6grams": 0.2933584153652191,
"rps_doc_frac_chars_dupe_7grams": 0.21887603402137756,
"rps_doc_frac_chars_dupe_8grams": 0.17316482961177826,
"rps_doc_frac_chars_dupe_9grams": 0.17316482961177826,
"rps_doc_frac_chars_top_2gram": 0.011293360032141209,
"rps_doc_frac_chars_top_3gram": 0.018284490332007408,
"rps_doc_frac_chars_top_4gram": 0.020435599610209465,
"rps_doc_books_importance": -479.0732116699219,
"rps_doc_books_importance_length_correction": -479.0732116699219,
"rps_doc_openwebtext_importance": -252.0594024658203,
"rps_doc_openwebtext_importance_length_correction": -252.0594024658203,
"rps_doc_wikipedia_importance": -98.3752212524414,
"rps_doc_wikipedia_importance_length_correction": -98.3752212524414
},
"fasttext": {
"dclm": 0.9146008491516113,
"english": 0.7686267495155334,
"fineweb_edu_approx": 1.8457504510879517,
"eai_general_math": 0.8787195682525635,
"eai_open_web_math": 0.48164403438568115,
"eai_web_code": 0.8698768615722656
}
}
|
{
"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": "3",
"label": "Incoherent Flow"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,837,193,816,809,202,000
|
Python feature server
Overview
The Python feature server is an HTTP endpoint that serves features with JSON I/O. This enables users to write and read features from the online store using any programming language that can make HTTP requests.
CLI
There is a CLI command that starts the server: feast serve. By default, Feast uses port 6566; the port be overridden with a --port flag.
Deploying as a service
One can deploy a feature server by building a docker image that bundles in the project's feature_store.yaml. See this helm chart for an example on how to run Feast on Kubernetes.
A remote feature server on AWS Lambda is also available.
Example
Initializing a feature server
Here's an example of how to start the Python feature server with a local feature repo:
$ feast init feature_repo
Creating a new Feast repository in /home/tsotne/feast/feature_repo.
$ cd feature_repo
$ feast apply
Created entity driver
Created feature view driver_hourly_stats
Created feature service driver_activity
Created sqlite table feature_repo_driver_hourly_stats
$ feast materialize-incremental $(date +%Y-%m-%d)
Materializing 1 feature views to 2021-09-09 17:00:00-07:00 into the sqlite online store.
driver_hourly_stats from 2021-09-09 16:51:08-07:00 to 2021-09-09 17:00:00-07:00:
100%|████████████████████████████████████████████████████████████████| 5/5 [00:00<00:00, 295.24it/s]
$ feast serve
09/10/2021 10:42:11 AM INFO:Started server process [8889]
INFO: Waiting for application startup.
09/10/2021 10:42:11 AM INFO:Waiting for application startup.
INFO: Application startup complete.
09/10/2021 10:42:11 AM INFO:Application startup complete.
INFO: Uvicorn running on http://127.0.0.1:6566 (Press CTRL+C to quit)
09/10/2021 10:42:11 AM INFO:Uvicorn running on http://127.0.0.1:6566 (Press CTRL+C to quit)
Retrieving features
After the server starts, we can execute cURL commands from another terminal tab:
$ curl -X POST \
"http://localhost:6566/get-online-features" \
-d '{
"features": [
"driver_hourly_stats:conv_rate",
"driver_hourly_stats:acc_rate",
"driver_hourly_stats:avg_daily_trips"
],
"entities": {
"driver_id": [1001, 1002, 1003]
}
}' | jq
{
"metadata": {
"feature_names": [
"driver_id",
"conv_rate",
"avg_daily_trips",
"acc_rate"
]
},
"results": [
{
"values": [
1001,
0.7037263512611389,
308,
0.8724706768989563
],
"statuses": [
"PRESENT",
"PRESENT",
"PRESENT",
"PRESENT"
],
"event_timestamps": [
"1970-01-01T00:00:00Z",
"2021-12-31T23:00:00Z",
"2021-12-31T23:00:00Z",
"2021-12-31T23:00:00Z"
]
},
{
"values": [
1002,
0.038169607520103455,
332,
0.48534533381462097
],
"statuses": [
"PRESENT",
"PRESENT",
"PRESENT",
"PRESENT"
],
"event_timestamps": [
"1970-01-01T00:00:00Z",
"2021-12-31T23:00:00Z",
"2021-12-31T23:00:00Z",
"2021-12-31T23:00:00Z"
]
},
{
"values": [
1003,
0.9665873050689697,
779,
0.7793770432472229
],
"statuses": [
"PRESENT",
"PRESENT",
"PRESENT",
"PRESENT"
],
"event_timestamps": [
"1970-01-01T00:00:00Z",
"2021-12-31T23:00:00Z",
"2021-12-31T23:00:00Z",
"2021-12-31T23:00:00Z"
]
}
]
}
It's also possible to specify a feature service name instead of the list of features:
curl -X POST \
"http://localhost:6566/get-online-features" \
-d '{
"feature_service": <feature-service-name>,
"entities": {
"driver_id": [1001, 1002, 1003]
}
}' | jq
Pushing features to the online and offline stores
The Python feature server also exposes an endpoint for push sources. This endpoint allows you to push data to the online and/or offline store.
The request definition for pushmode is a string parameter to where the options are: ["online", "offline", "online_and_offline"]. Note that timestamps need to be strings.
curl -X POST "http://localhost:6566/push" -d '{
"push_source_name": "driver_hourly_stats_push_source",
"df": {
"driver_id": [1001],
"event_timestamp": ["2022-05-13 10:59:42"],
"created": ["2022-05-13 10:59:42"],
"conv_rate": [1.0],
"acc_rate": [1.0],
"avg_daily_trips": [1000]
},
"to": "online_and_offline",
}' | jq
or equivalently from Python:
import json
import requests
import pandas as pd
from datetime import datetime
event_dict = {
"driver_id": [1001],
"event_timestamp": [str(datetime(2021, 5, 13, 10, 59, 42))],
"created": [str(datetime(2021, 5, 13, 10, 59, 42))],
"conv_rate": [1.0],
"acc_rate": [1.0],
"avg_daily_trips": [1000],
"string_feature": "test2",
}
push_data = {
"push_source_name":"driver_stats_push_source",
"df":event_dict,
"to":"online",
}
requests.post(
"http://localhost:6566/push",
data=json.dumps(push_data))
Last updated
|
{
"url": "https://docs.feast.dev/v/untitled/reference/feature-servers/python-feature-server?fallback=true",
"source_domain": "docs.feast.dev",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "616268",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y2OZFXBGCTJCKYE3JEB3F46EHLEQHWKO",
"WARC-Concurrent-To": "<urn:uuid:8e19b8b6-de85-4361-a74d-0dfaf7b47b94>",
"WARC-Date": "2024-09-19T03:09:10Z",
"WARC-IP-Address": "104.18.40.47",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UIQIJ2FJS2OCKFQ52AZKL63SSPEHW46Z",
"WARC-Record-ID": "<urn:uuid:90f47e30-1e5a-49a5-8d0a-07faab7abcc8>",
"WARC-Target-URI": "https://docs.feast.dev/v/untitled/reference/feature-servers/python-feature-server?fallback=true",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c910f4f2-fd82-4d3f-890f-f252c8ed12bc>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-5\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
22,
23,
32,
33,
243,
244,
248,
249,
386,
387,
410,
411,
590,
591,
648,
649,
657,
658,
688,
689,
776,
777,
803,
871,
872,
890,
891,
905,
927,
968,
1008,
1009,
1063,
1064,
1114,
1203,
1204,
1285,
1386,
1387,
1401,
1459,
1502,
1563,
1603,
1661,
1735,
1827,
1828,
1848,
1849,
1930,
1931,
1949,
1997,
2005,
2023,
2062,
2100,
2144,
2151,
2169,
2207,
2213,
2223,
2225,
2241,
2264,
2283,
2302,
2327,
2344,
2350,
2355,
2370,
2376,
2394,
2408,
2436,
2449,
2476,
2485,
2505,
2524,
2543,
2562,
2580,
2589,
2617,
2649,
2681,
2713,
2744,
2752,
2759,
2765,
2783,
2797,
2827,
2840,
2868,
2877,
2897,
2916,
2935,
2954,
2972,
2981,
3009,
3041,
3073,
3105,
3136,
3144,
3151,
3157,
3175,
3189,
3217,
3230,
3257,
3266,
3286,
3305,
3324,
3343,
3361,
3370,
3398,
3430,
3462,
3494,
3525,
3533,
3539,
3543,
3545,
3546,
3632,
3633,
3648,
3696,
3704,
3751,
3769,
3807,
3813,
3823,
3824,
3874,
3875,
4018,
4019,
4189,
4190,
4238,
4297,
4309,
4342,
4398,
4446,
4478,
4509,
4547,
4554,
4586,
4596,
4597,
4626,
4627,
4639,
4655,
4675,
4705,
4706,
4721,
4746,
4811,
4868,
4892,
4915,
4946,
4977,
4979,
4993,
5044,
5065,
5084,
5086,
5101,
5135,
5167,
5168
],
"line_end_idx": [
22,
23,
32,
33,
243,
244,
248,
249,
386,
387,
410,
411,
590,
591,
648,
649,
657,
658,
688,
689,
776,
777,
803,
871,
872,
890,
891,
905,
927,
968,
1008,
1009,
1063,
1064,
1114,
1203,
1204,
1285,
1386,
1387,
1401,
1459,
1502,
1563,
1603,
1661,
1735,
1827,
1828,
1848,
1849,
1930,
1931,
1949,
1997,
2005,
2023,
2062,
2100,
2144,
2151,
2169,
2207,
2213,
2223,
2225,
2241,
2264,
2283,
2302,
2327,
2344,
2350,
2355,
2370,
2376,
2394,
2408,
2436,
2449,
2476,
2485,
2505,
2524,
2543,
2562,
2580,
2589,
2617,
2649,
2681,
2713,
2744,
2752,
2759,
2765,
2783,
2797,
2827,
2840,
2868,
2877,
2897,
2916,
2935,
2954,
2972,
2981,
3009,
3041,
3073,
3105,
3136,
3144,
3151,
3157,
3175,
3189,
3217,
3230,
3257,
3266,
3286,
3305,
3324,
3343,
3361,
3370,
3398,
3430,
3462,
3494,
3525,
3533,
3539,
3543,
3545,
3546,
3632,
3633,
3648,
3696,
3704,
3751,
3769,
3807,
3813,
3823,
3824,
3874,
3875,
4018,
4019,
4189,
4190,
4238,
4297,
4309,
4342,
4398,
4446,
4478,
4509,
4547,
4554,
4586,
4596,
4597,
4626,
4627,
4639,
4655,
4675,
4705,
4706,
4721,
4746,
4811,
4868,
4892,
4915,
4946,
4977,
4979,
4993,
5044,
5065,
5084,
5086,
5101,
5135,
5167,
5168,
5180
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5180,
"ccnet_original_nlines": 193,
"rps_doc_curly_bracket": 0.005019309930503368,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10729990899562836,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05892699956893921,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5813544392585754,
"rps_doc_frac_unique_words": 0.4906054437160492,
"rps_doc_mean_word_length": 6.757828712463379,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.1265740394592285,
"rps_doc_word_count": 479,
"rps_doc_frac_chars_dupe_10grams": 0.11028730124235153,
"rps_doc_frac_chars_dupe_5grams": 0.2171763926744461,
"rps_doc_frac_chars_dupe_6grams": 0.18999072909355164,
"rps_doc_frac_chars_dupe_7grams": 0.1343836933374405,
"rps_doc_frac_chars_dupe_8grams": 0.11028730124235153,
"rps_doc_frac_chars_dupe_9grams": 0.11028730124235153,
"rps_doc_frac_chars_top_2gram": 0.0389249287545681,
"rps_doc_frac_chars_top_3gram": 0.0389249287545681,
"rps_doc_frac_chars_top_4gram": 0.020389249548316002,
"rps_doc_books_importance": -573.801513671875,
"rps_doc_books_importance_length_correction": -573.801513671875,
"rps_doc_openwebtext_importance": -356.60601806640625,
"rps_doc_openwebtext_importance_length_correction": -356.60601806640625,
"rps_doc_wikipedia_importance": -283.8673400878906,
"rps_doc_wikipedia_importance_length_correction": -283.8673400878906
},
"fasttext": {
"dclm": 0.43608564138412476,
"english": 0.590003252029419,
"fineweb_edu_approx": 2.07065749168396,
"eai_general_math": 0.15488910675048828,
"eai_open_web_math": 0.09519457817077637,
"eai_web_code": 0.8917287588119507
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,588,744,842,848,051,700
|
libaec: Issues https://www.dkrz.de/redmine/ https://www.dkrz.de/redmine/redmine/favicon.ico?1586192449 2014-05-21T21:35:12Z DKRZ projects Redmine Feature #330 (New): Come up with soname and soversion https://www.dkrz.de/redmine/issues/330 2014-05-21T21:35:12Z Thomas Jahns jahns@dkrz.de <p>To include the library with Debian, the Debian Science Maintainers ask us to provide sonames and versions for shared libraries. See <a href="https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=740613" class="external">the corresponding Debian bug report to include libaec in Debian</a></p>
|
{
"url": "https://www.dkrz.de/redmine/projects/aec/issues.atom?author_id=7&set_filter=1&sort=subject%2Cid%3Adesc%2Cstatus&status_id=%2A&subproject_id=%21%2A",
"source_domain": "www.dkrz.de",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "3311",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:R7ZEJC347WMYKTFRJ7372JYUPKIOYTWX",
"WARC-Concurrent-To": "<urn:uuid:092531a1-b1a3-41f2-ac89-9161aa670e61>",
"WARC-Date": "2021-06-23T08:04:49Z",
"WARC-IP-Address": "136.172.11.20",
"WARC-Identified-Payload-Type": "application/atom+xml",
"WARC-Payload-Digest": "sha1:EREYI7FH43RUG6IHKFST2HYEHX3IS55A",
"WARC-Record-ID": "<urn:uuid:d236d0aa-0a5c-49fc-b7a3-1cf0cad2dac2>",
"WARC-Target-URI": "https://www.dkrz.de/redmine/projects/aec/issues.atom?author_id=7&set_filter=1&sort=subject%2Cid%3Adesc%2Cstatus&status_id=%2A&subproject_id=%21%2A",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:597cc9c8-edd1-4e5b-ad24-9e18baef4ea0>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-200.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
],
"line_end_idx": [
577
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 577,
"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.125,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.032894741743803024,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.42105263471603394,
"rps_doc_frac_unique_words": 0.8363636136054993,
"rps_doc_mean_word_length": 8.254545211791992,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.006578950211405754,
"rps_doc_unigram_entropy": 3.7709712982177734,
"rps_doc_word_count": 55,
"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": -78.17710876464844,
"rps_doc_books_importance_length_correction": -92.49591064453125,
"rps_doc_openwebtext_importance": -44.13005065917969,
"rps_doc_openwebtext_importance_length_correction": -58.4488525390625,
"rps_doc_wikipedia_importance": -51.817047119140625,
"rps_doc_wikipedia_importance_length_correction": -66.13584899902344
},
"fasttext": {
"dclm": 0.02368462085723877,
"english": 0.6144810318946838,
"fineweb_edu_approx": 1.594698190689087,
"eai_general_math": 0.08203048259019852,
"eai_open_web_math": 0.26954662799835205,
"eai_web_code": 0.15350830554962158
}
}
|
{
"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": "025.04",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "Library science",
"level_3": "Library administration"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,277,872,528,194,262,300
|
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'm trying to use inotifywait for monitoring specific folders and recompiling if needed. The problem is that I'm using vim heavily, and when I'm editing in vim any file modified actually triggers some 'redundant' events, something like:
:w
sass/somefolder/ CREATE 4913
sass/somefolder/ CREATE some
sass/somefolder/ MODIFY some
It took me some time to realize that actually everything is OK with inotifywait - I've tried to use nano and everything worked just as expected, only "MODIFY" is triggered, and only once.
I've tried to edit (just for test purposes, don't judge me hard) Emacs and there are problems with Emacs as well - each time I'm pressing Ctrl-X + Ctrl+S MODIFY triggers 3 times.
The question is how can I resolve issues with superfluous events in vim?
By the way, directory and backupdir in my .vimrc are not in the folder that is monitored.
UPD: This link explains why actually things happen how they happen, but I still have no idea how to fix this. Well, of course I can ignore 4913 containing string, but this is too kludgy even for one who tries to use inotify to compile SASS)))
UPD: VIM version is 7.3.429
share|improve this question
add comment
3 Answers
up vote 4 down vote accepted
If you're looking to trigger an action (such as recompiling code) after you have edited a file, you usually want to look at the IN_CLOSE_WRITE event and ignore everything else.
You absolutely do not want to monitor IN_MODIFY events because, as you have discovered, they may be triggered many times while editing a file.
So:
inotifywait -e close_write ...
share|improve this answer
thank you for this answer. -e close_write option is definitely better, but resolves only issue with multiple modifies, but not with mysterious sass/somefolder/ CLOSE_WRITE,CLOSE 4913 event – shabunc Apr 24 '12 at 15:25
You could just ignore events on directories...if you have inotifywait wait output the path, you can have your script check if it's a directory ([ -d ... ]) and only trigger your actions if files are modified. – larsks Apr 24 '12 at 16:45
By default, when vim saves a file it creates a new one and writes into it, and when it's sure it wrote successfully, it deletes the old file and renames the new one. This might be the cause of some spurious events. You can turn this off with set nowritebackup. See :help backup-table and friends. – David Pope Apr 25 '12 at 15:46
add comment
The better editors do it that way to enforce atomicity. In other words, you won't end up with a half-written file if power dies at the wrong moment.
One option that may help is to just use autocmd BufWritePost to do your recompile.
However, if you make other changes outside of vim, you probably want to wait on multiple notifications and do the compile after none have happened for a period of time, say a half second. That's going to cover other contingencies like doing a source control pull, for example.
share|improve this answer
+1 for suggesting intelligent script behavior – Steven Lu May 16 at 20:00
add comment
Most editors will use a temporary file to write undo information, or file edits, before you commit and save. Additionally, most editors need to write to a temp file to talk to sub-shells and scripts. I suspect the 4913 file could be a factor of your vim setup, or a function of your numeric user-id, to uniquify the files.
You could strace vim to see when the files gets updated and what happens either side, e.g. a fork + exec, or another file is touched which might hint which macro or facility is causing this.
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/10300835/too-many-inotify-events-while-editing-in-vim",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "71904",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U522ZUZSKUZNR3HGIN6PJGNPSRU2VZFB",
"WARC-Concurrent-To": "<urn:uuid:e14e7bdd-329e-4a8d-b9d1-8ba855436777>",
"WARC-Date": "2013-12-18T10:39:01Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5CEY5XQD2OQQT2Q7BRRVUVCZTK2FHIQJ",
"WARC-Record-ID": "<urn:uuid:45c33d97-d6f0-4e2c-a718-1cd375bbf2ce>",
"WARC-Target-URI": "http://stackoverflow.com/questions/10300835/too-many-inotify-events-while-editing-in-vim",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2819b8a6-0240-4029-8f65-573c29664ecc>"
},
"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,
25,
157,
158,
395,
396,
399,
428,
457,
486,
487,
675,
676,
855,
856,
929,
930,
1020,
1021,
1264,
1265,
1293,
1294,
1322,
1334,
1335,
1345,
1346,
1375,
1376,
1553,
1554,
1697,
1698,
1702,
1703,
1734,
1760,
1762,
1982,
1984,
2223,
2225,
2556,
2568,
2569,
2718,
2719,
2802,
2803,
3080,
3081,
3107,
3109,
3184,
3196,
3197,
3520,
3521,
3712,
3713,
3739,
3751,
3752,
3764,
3765,
3767,
3775,
3776,
3854,
3855
],
"line_end_idx": [
25,
157,
158,
395,
396,
399,
428,
457,
486,
487,
675,
676,
855,
856,
929,
930,
1020,
1021,
1264,
1265,
1293,
1294,
1322,
1334,
1335,
1345,
1346,
1375,
1376,
1553,
1554,
1697,
1698,
1702,
1703,
1734,
1760,
1762,
1982,
1984,
2223,
2225,
2556,
2568,
2569,
2718,
2719,
2802,
2803,
3080,
3081,
3107,
3109,
3184,
3196,
3197,
3520,
3521,
3712,
3713,
3739,
3751,
3752,
3764,
3765,
3767,
3775,
3776,
3854,
3855,
3945
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3945,
"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.41617122292518616,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030915580689907074,
"rps_doc_frac_lines_end_with_ellipsis": 0.014084509573876858,
"rps_doc_frac_no_alph_words": 0.19976219534873962,
"rps_doc_frac_unique_words": 0.492514967918396,
"rps_doc_mean_word_length": 4.609281539916992,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.003567179897800088,
"rps_doc_unigram_entropy": 5.366502285003662,
"rps_doc_word_count": 668,
"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.020785970613360405,
"rps_doc_frac_chars_top_3gram": 0.021435530856251717,
"rps_doc_frac_chars_top_4gram": 0.005846050102263689,
"rps_doc_books_importance": -357.2077941894531,
"rps_doc_books_importance_length_correction": -357.2077941894531,
"rps_doc_openwebtext_importance": -165.389404296875,
"rps_doc_openwebtext_importance_length_correction": -165.389404296875,
"rps_doc_wikipedia_importance": -157.9405517578125,
"rps_doc_wikipedia_importance_length_correction": -157.9405517578125
},
"fasttext": {
"dclm": 0.5278732776641846,
"english": 0.9419202208518982,
"fineweb_edu_approx": 1.255813717842102,
"eai_general_math": 0.08397287130355835,
"eai_open_web_math": 0.25476914644241333,
"eai_web_code": 0.0060310401022434235
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,496,197,686,467,187,700
|
Deduplikation
aus Wikipedia, der freien Enzyklopädie
(Weitergeleitet von Deduplizierung)
Wechseln zu: Navigation, Suche
Deduplikation, auch Datendeduplikation (engl. Deduplication) oder Deduplizierung, ist in der Informationstechnik ein Prozess, der redundante Daten identifiziert (Duplikaterkennung) und eliminiert, bevor diese auf einen nichtflüchtigen Datenträger geschrieben werden. Der Prozess komprimiert wie andere Verfahren auch die Datenmenge, die von einem Sender an einen Empfänger geschickt wird. Es ist nahezu unmöglich, die Effizienz bei der Verwendung von Deduplikations-Algorithmen vorherzusagen, da sie immer von der Datenstruktur und der Änderungsrate abhängig ist. Deduplikation kann eine sehr effiziente Methode sein, Datenmengen zu reduzieren, bei denen eine Mustererkennung möglich ist (unverschlüsselte Daten).
Vorrangiges Einsatzgebiet der Deduplikation ist vorerst die Datensicherung (Backup), bei der sich in der Praxis meistens eine stärkere Datenkomprimierung als mit anderen Methoden erzielen lässt. Das Verfahren eignet sich grundsätzlich für jeden Einsatzbereich, bei dem Daten wiederholt kopiert werden.
Funktionsweise[Bearbeiten | Quelltext bearbeiten]
Deduplikations-Systeme arbeiten anders als klassische Kompressionsverfahren, die nur wenige Vergleichsmuster benutzen, meistens auf dem sogenannten "Blocklevel", d. h. die Dateien werden als in eine Anzahl Blöcke gleicher Größe (meist Zweierpotenzen) zerlegt betrachtet. Hierin liegt auch die Abgrenzung zum Single Instance Storage (SIS), das identische Dateien eliminieren soll (siehe auch inhaltsadressierte Speichersysteme, CAS). Eine wichtige Funktion der Deduplikation ist das "Fingerprinting". Hier werden Dateien in Segmente unterschiedlichster Größe (Chunks) zerlegt. Auf Byte-Ebene wird dann analysiert, welche Segmente die höchste Wiederholrate bieten, um durch Referenzierung (Pointer) auf das Ursprungselement größtmögliche Datenreduzierungen zu bieten.
Ein Beispiel: Bei der Datensicherung von Festplatte auf Bandmedien ist das Verhältnis von neuen bzw. veränderten zu unveränderten Daten zwischen zwei Vollsicherungen meist nur relativ gering. Zwei Vollsicherungen benötigen bei der klassischen Datensicherung aber trotzdem mindestens die doppelte Speicherkapazität auf Band, verglichen mit den Originaldaten. Die Deduplikation erkennt die identischen Datenbestandteile. In einer Liste werden dazu eindeutige Segmente festgehalten, und beim erneuten Auftreten dieses Datenteils werden Zeitpunkt und Ort im Datenstrom notiert, so dass letztlich die Originaldaten wiederhergestellt werden können.
Diese Zeiger beanspruchen wesentlich weniger Platz als die referenzierte Bitfolge. Wird die Datei wieder aufgerufen, so wird sie sowohl aus ihren einzigartigen Bestandteilen als auch aus den Teilen, die sie mit anderen Dateien gemein hat, zusammengefügt. Der Index besagt, welche Teile das sind und wie sie mit den einzigartigen Bestandteilen verbunden werden müssen, um wieder die Ursprungsdatei zu ergeben.
Allerdings handelt es sich damit nicht mehr um voneinander unabhängige Vollsicherungen, d h. dass der Verlust eines Versionsstandes zu unwiederbringlichem Datenverlust führt. Deduplikation ist somit ähnlich inkrementellen Sicherungen ein Verfahren, das einen Kompromiss zwischen Datensicherheit und Speicherbedarf macht.
Methoden[Bearbeiten | Quelltext bearbeiten]
Es gibt zwei Methoden, einen Datei-Bauplan zu erzeugen. Beim "Reverse-Referencing" wird das erste gemeinsame Element gespeichert, alle weiteren identischen erhalten einen Verweis auf das erste. "Forward-Referencing" legt immer den zuletzt aufgetretenen gemeinsamen Datenblock ab und referenziert die vorher aufgetretenen Elemente. Bei diesem Methodenstreit geht es darum, ob Daten schneller verarbeitet respektive schneller wiederhergestellt werden können. Weitere Vorgehensweisen, wie "Inband" und "Outband", konkurrieren darum, ob der Datenstrom "on the fly", also im laufenden Betrieb, analysiert wird oder erst, nachdem dieser am Zielort gespeichert worden ist. Im ersten Fall darf nur ein Datenstrom existieren, im zweiten können die Daten mittels mehrerer Datenströme parallel untersucht werden.
Chunking (Fingerprinting)[Bearbeiten | Quelltext bearbeiten]
Das Fingerprinting versucht auch festzustellen, wie der eingehende Datenstrom am besten in Stücke zerlegt werden kann, so dass möglichst viele identische Datenblöcke entstehen. Dieser Vorgang heißt Chunking (von englisch chunk ‚Stück‘, ‚Block‘).
Identifikation von Blöcken[Bearbeiten | Quelltext bearbeiten]
Je genauer die Änderungen einer Datei bestimmt werden können, desto weniger muss redundant gesichert werden. Allerdings vergrößert sich dadurch der Index, also der Bauplan, wie und aus welchen Bestandteilen die Datei beim Aufruf wieder zusammengesetzt wird. Daher ist auch die Methode der Identifikation von gemeinsamen Blöcken entscheidend.
Siehe auch[Bearbeiten | Quelltext bearbeiten]
Weblinks[Bearbeiten | Quelltext bearbeiten]
|
{
"url": "https://de.wikipedia.org/wiki/Deduplizierung",
"source_domain": "de.wikipedia.org",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "33647",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:23TUJ2XBAWNRGTWR47R2HIG7OD457F6D",
"WARC-Concurrent-To": "<urn:uuid:153a4a7d-2823-4bfc-b0a9-a78880e22a1d>",
"WARC-Date": "2016-07-28T09:36:31Z",
"WARC-IP-Address": "208.80.154.224",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:P4RERVMPWU6U5AWL2CIM5SYLSPIPCQXM",
"WARC-Record-ID": "<urn:uuid:a981c919-f6f0-4a62-a2b4-089f70434be1>",
"WARC-Target-URI": "https://de.wikipedia.org/wiki/Deduplizierung",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3f353837-6e36-48aa-aed3-a567a0af612e>"
},
"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,
14,
15,
54,
90,
121,
122,
836,
837,
1139,
1140,
1190,
1191,
1957,
1958,
2601,
2602,
3011,
3012,
3333,
3334,
3378,
3379,
4181,
4182,
4243,
4244,
4490,
4491,
4553,
4554,
4896,
4897,
4943,
4944
],
"line_end_idx": [
14,
15,
54,
90,
121,
122,
836,
837,
1139,
1140,
1190,
1191,
1957,
1958,
2601,
2602,
3011,
3012,
3333,
3334,
3378,
3379,
4181,
4182,
4243,
4244,
4490,
4491,
4553,
4554,
4896,
4897,
4943,
4944,
4987
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4987,
"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.024967150762677193,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002628119895234704,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18134033679962158,
"rps_doc_frac_unique_words": 0.5744680762290955,
"rps_doc_mean_word_length": 6.957446575164795,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.490255832672119,
"rps_doc_word_count": 611,
"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.026817219331860542,
"rps_doc_frac_chars_top_3gram": 0.00893906969577074,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -406.2107238769531,
"rps_doc_books_importance_length_correction": -406.2107238769531,
"rps_doc_openwebtext_importance": -214.1318359375,
"rps_doc_openwebtext_importance_length_correction": -214.1318359375,
"rps_doc_wikipedia_importance": -124.76153564453125,
"rps_doc_wikipedia_importance_length_correction": -124.76153564453125
},
"fasttext": {
"dclm": 0.9491649866104126,
"english": 0.0007523400126956403,
"fineweb_edu_approx": 1.8923248052597046,
"eai_general_math": 0.027624789625406265,
"eai_open_web_math": 0.4807146191596985,
"eai_web_code": 0.7939751744270325
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.6",
"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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,173,500,345,137,051,400
|
Linux Mint and GPL license Violation
Chat about anything related to Linux Mint
scorp123
Level 8
Level 8
Posts: 2277
Joined: Sat Dec 02, 2006 4:19 pm
Location: Switzerland
Post by scorp123 » Mon Dec 11, 2006 3:35 pm
Fragadelic wrote:The grey area is not so grey for Kororaa since they removed the drivers from their live cd.
Ever heard about Sabayon Linux? Give it a try, it's very nice, and also a very nice way to get a Gentoo installation without all that typing and manually editing. ... And yes, they ship with all the binary drivers pre-installed. Don't tell Greg :lol:
http://www.sabayonlinux.org/
User avatar
Fragadelic
Level 4
Level 4
Posts: 244
Joined: Wed Nov 15, 2006 11:05 am
Location: Canada
Contact:
Post by Fragadelic » Mon Dec 11, 2006 3:39 pm
scorp123 wrote:
Ever heard about Sabayon Linux? Give it a try, it's very nice, and also a very nice way to get a Gentoo installation without all that typing and manually editing. ... And yes, they ship with all the binary drivers pre-installed. Don't tell Greg :lol:
http://www.sabayonlinux.org/
I've tried Sabayon - both the 32-bit and 64-bit but it wasn't my cup of tea. I'm not into compiling from source just for a usable system for upgrades. I prefer to let someone else do it for me ;)
scorp123
Level 8
Level 8
Posts: 2277
Joined: Sat Dec 02, 2006 4:19 pm
Location: Switzerland
Post by scorp123 » Mon Dec 11, 2006 4:21 pm
Fragadelic wrote:
I prefer to let someone else do it for me ;)
Yes, me too. But I find the fact that so far them shipping the binary Nvidia drivers on their ISO managed to remain undisturbed and unnoticed by Greg and others quite interesting :D
User avatar
Fragadelic
Level 4
Level 4
Posts: 244
Joined: Wed Nov 15, 2006 11:05 am
Location: Canada
Contact:
Post by Fragadelic » Mon Dec 11, 2006 4:33 pm
They are out of Italy so it might not be worth the trouble to try to get them to do anything.
scorp123
Level 8
Level 8
Posts: 2277
Joined: Sat Dec 02, 2006 4:19 pm
Location: Switzerland
Post by scorp123 » Mon Dec 11, 2006 4:59 pm
Fragadelic wrote:They are out of Italy so it might not be worth the trouble to try to get them to do anything.
Unless you "gonna make them an offer they can't refuse ...." :lol:
User avatar
Fragadelic
Level 4
Level 4
Posts: 244
Joined: Wed Nov 15, 2006 11:05 am
Location: Canada
Contact:
Post by Fragadelic » Mon Dec 11, 2006 5:06 pm
lol - lets clear a few things up.
If you want to launch legal proceedings of this kind, they have to be launched in the country the offense is taking place.
Thatsa alla I'ma gonna saya abouta thata.
User avatar
clem
Level 12
Level 12
Posts: 4071
Joined: Wed Nov 15, 2006 8:34 am
Contact:
Post by clem » Mon Dec 11, 2006 5:55 pm
Are people complaining about them including those drivers? Is there controversy over it? We're getting the FUD even without doing it.. so I'm wondering :)
User avatar
amano
Level 1
Level 1
Posts: 6
Joined: Sat Dec 02, 2006 4:14 pm
Post by amano » Mon Dec 11, 2006 6:27 pm
From a practical standpoint, including these drivers would make Mint the perfect offline distribution. 3D effects, DVD playback and support for most codecs...
It is a shame that linux has become that broadband hungry in these times... :roll: Without getting online there is no chance for a suitable system.
YourDoom123
Level 1
Level 1
Posts: 4
Joined: Wed Dec 27, 2006 1:49 am
Post by YourDoom123 » Thu Dec 28, 2006 4:25 pm
clem wrote:I understand what you meant Tony and I'm not arguing it. But you compared GPL violations to reverse-engineering, and while they're both against US law (as I understand it) I find one unacceptable and have no problem with the other.. so I just wanted to react on that.
The mentioned drivers do need to be linked to the kernel in order to work. So , whoever it is that links them, they need someone to break the GPL in order to work. That's why I have a problem with them.
On the other hand, they are de facto a standard in personal computing, and people do need them. So I understand the fact that no licence should be in the way of making users able to use their hardware.
It's a very debatable question, and as I said before I have mixed feelings about it. In the end I want to help users using what they need, no matter what license, but I also want to respect the GPL because it's an ideal and a beautiful thing that ought to be respected. Nvidia and ATI are to blame... the kernel developers have a point, but the users do as well... so the question is still open.
In Bea envy was added. I know it doesn't violate the GPL but it makes it easier for the user to do so. I suppose this is the best compromise we can achieve on this... but again, I don't really know what to think of it.
Anyway.. I'm talking too much and not focusing on what's important here: among all the licenses and regional laws that we can disregard and ignore in the name of our alienable rights to use our computers the way we should be able to, the one license that definitely still has importance and ought to be respected is the GPL. Don't mind the reverse engineering :)
That's what I wanted to say. :)
Clem
I definitely need a drink now :)
I haven't read the whole thread yet, but I wanted to react a little bit to this. It is perfectly legal, and does not violate the GPL, to link nvidia/ati proprietary drivers. What you can't do is distribute the linked binaries together on the same medium. When you do that, you've broken the law. The codecs included with mint don't violate the GPL because they don't link /w the kernel. Their legality comes into question in other ways (its illegal to use those codecs in the US because the license has not been purchashed :( ). Anyway, there is a way to get around the whole ati/nvidia thing, and that's what Sabayon does. Instead of statically linking in the proprietary drivers, they just include the binary blobs, and during boot-up, they dynamically link in the blobs. This satisfies the GPL's requirements. Its sad that it has to be done this way, but the world is such.
As for your reverse engineering comments, I have to ask... If we lived a world without intellectual property, why would people keep innovating? Yes, there are people like you and me who don't do it for the money, but there are far too many people care only for the status and money an invention brings them. The problem is the companies, don't offend the people. Take ati/nvidia for example... Why can they not release the full specifications of their hardware, so that real 3d drivers can be independently developed in an open source manner? because it may or may not "help the competition". Their greed is holding us all back :(.
EDIT: alright, i finished the thread, and found several comments refering to sabayon. as far as i know, they do not violate the GPL, because the proprietary binaries do not link into the kernel until runtime. Someone correct me if I'm wrong.
User avatar
Fragadelic
Level 4
Level 4
Posts: 244
Joined: Wed Nov 15, 2006 11:05 am
Location: Canada
Contact:
Post by Fragadelic » Thu Dec 28, 2006 5:06 pm
No.
Actually linking the blob to the kernel violates the GPL since it states that any code linking to the kernel has to be gpl as well and this is why they are thinking of including a GPL hook in the kernel to prevent these types of binary blobs from being usable. They either hope that it forces ati and nvidia to open source their drivers or they are going to fork a commercial linux kernel fork to allow this.
Right now this is a legal grey area but if they put the hook in the kernel, it will be black and white and unless someone forks the kernel to remove the gpl hook, it will kill desktop linux gaming and any other function where decent 3d video drivers are required. It will also render wireless that only has windows binary blobs to stop working.
I hate to make it sound doom and gloom but unfortunately that is what it is. Linux may just become a strictly server OS after all.
YourDoom123
Level 1
Level 1
Posts: 4
Joined: Wed Dec 27, 2006 1:49 am
Post by YourDoom123 » Thu Dec 28, 2006 6:30 pm
Are you sure? The GPL clearly allows for users to link non-GPL'ed (read proprietary drivers) code into GPL'ed code (the kernel). What you cannot do is distribute the result of that. Sabayon doesn't violate the GPL because on the CD, the drivers aren't linked into the kernel, they simply exist as a blob. On boot-up though, the blobs are temporarily linked into the kernel. If you could not do this, even using the drivers would be a violation of the GPL, and nvidia/ati are breaking the law... I know Stallman wants this to be the case, but as things stand right now, nvidia/ati are alright (hence the grey area...).
User avatar
Fragadelic
Level 4
Level 4
Posts: 244
Joined: Wed Nov 15, 2006 11:05 am
Location: Canada
Contact:
Post by Fragadelic » Thu Dec 28, 2006 9:06 pm
Nvidia aren't breaking the law since they aren't the ones that actually do the linking - the end user is. This is why the kernel devs are looking to put a gpl hook in the kernel to prevent this from even being able to take place in the first place.
Do some searching on the kernel mailing list and you will see the discussion on the gpl hook.
Right now, the kernel devs aren't going after the end user for using the blob but in the future they will. Linus prefers to keep it as a grey area as it has been leaving it up to the end user to "taint" the kernel. What do you think the whole "tainted kernel" message is all about?
They are attempting to prevent even the end user from using these blobs in the future preventing tainting the kernel. This is their right but it isn't necessarily a smart move.
This has been discussed and beat with a dead stick all over the place. I suggest you do some searching.
User avatar
Fragadelic
Level 4
Level 4
Posts: 244
Joined: Wed Nov 15, 2006 11:05 am
Location: Canada
Contact:
Post by Fragadelic » Thu Dec 28, 2006 9:30 pm
Here is a copy of some emails from Linus himself. Modules MUST be GPL since they are considered derivative works. User space stuff doesn't necessarily have to be gpl but kernel modules are clearly not user space. they are in the domain of the kernel code and must know how to interact with the kernel at an intimate and explicit level.
http://linuxmafia.com/faq/Kernel/propri ... dules.html
User avatar
clem
Level 12
Level 12
Posts: 4071
Joined: Wed Nov 15, 2006 8:34 am
Contact:
Post by clem » Fri Dec 29, 2006 6:45 am
Btw, I definitely think Linus is right on this. Distribution and personal use are two different things. Nobody can tell you how you should and should not use what you legally acquired. I don't believe this gpl hook is actually going to be done, and if it is then either we just won't upgrade or we'll use a forked/tweaked kernel. You just don't tell people what to do. People know what they want to do, and they do find ways to do it.. the only power you have is to decide whether you provide that way or not.
I understand the motivation behind that and the frustration of the developers, but they simply don't have the power to do something like that. I wouldn't worry too much about this, Linux is ready for the desktop and it's not going to change.
Clem
scorp123
Level 8
Level 8
Posts: 2277
Joined: Sat Dec 02, 2006 4:19 pm
Location: Switzerland
Post by scorp123 » Fri Dec 29, 2006 8:07 am
Fragadelic wrote:Here is a copy of some emails from Linus himself. Modules MUST be GPL since they are considered derivative works. User space stuff doesn't necessarily have to be gpl but kernel modules are clearly not user space. they are in the domain of the kernel code and must know how to interact with the kernel at an intimate and explicit level.
As far as I know this is Greg Kroah-Hartmann's philosophy ... or should I say "religious belief"? I personally think this is BS, sorry to say so. A module can only be derivative work technically if it actually contains GPL'd kernel code, and this hasn't yet been proven in the case of Nvidia or ATI (and others).
A web browser too needs "intimate and explicit level" of knowledge about the HTTP protocol in order to talk to a web server, and yet nobody would be as daft and call a web browser a "derivative work" of someone's web server software.
What Kroah-Hartmann is trying to do is to brand binary modules "illegal" (he repeats that over and over again on his web page) and to convince everyone that whatever links with the kernel is a "derivative work" ... Again sorry, but I think this is BS.
http://en.wikipedia.org/wiki/GNU_Genera ... d_disputes
Quote from there:
Wikipedia wrote:However, it is not clear whether an executable that dynamically links to a GPL library should be considered a derivative work. The free/open-source software community is split on this issue, with the FSF asserting that such an executable is indeed a derivative work, and other experts disagreeing. This is ultimately a question not of the GPL per se, but of how copyright law defines derivative works.
There you go. It is a legal question ... because technically it is definitely not a question. As long as I don't use GPL'd code I am not creating a "derivative work", regardless what a zealot such as Kroah-Hartmann claims.
All this stupid talk of his will only cause "good citizens" such as Nvidia, ATI and HP (and others) to withdraw their Linux support. Thanks a lot, Greg ... :?
Regards,
Scorp123
User avatar
Fragadelic
Level 4
Level 4
Posts: 244
Joined: Wed Nov 15, 2006 11:05 am
Location: Canada
Contact:
Post by Fragadelic » Fri Dec 29, 2006 10:43 am
scorp123 - those are actual emails from Linus. Greg is not the only one that feels that way.
clem - hard to say at this point what will be done. It seems like a large portion of the kernel devs that are on a payroll work for big linux distros and their main focus is servers which is where the money is right now. These binary blobs really only affect the desktop portion of linux and wouldn't even make a dent in server issues and since server OS sales and support are the real money behind linux, this could very well become a reality.
scorp123
Level 8
Level 8
Posts: 2277
Joined: Sat Dec 02, 2006 4:19 pm
Location: Switzerland
Post by scorp123 » Fri Dec 29, 2006 2:32 pm
Fragadelic wrote:scorp123 - those are actual emails from Linus. Greg is not the only one that feels that way.
Those e-mails you refer to are from as far back as 1995 methinks? Because here is what Linus recently said on this issue:
From: Linus Torvalds <torvalds <at> osdl.org>
Subject: Re: GPL only modules [was Re: [GIT PATCH] more Driver core patches for 2.6.19]
Newsgroups: gmane.linux.kernel
Date: 2006-12-14 04:15:59 GMT (2 weeks, 1 day, 14 hours and 9 minutes ago)
On Wed, 13 Dec 2006, Greg KH wrote:
>
> Numerous kernel developers feel that loading non-GPL drivers into the
> kernel violates the license of the kernel and their copyright. Because
> of this, a one year notice for everyone to address any non-GPL
> compatible modules has been set.
Btw, I really think this is shortsighted.
It will only result in _exactly_ the crap we were just trying to avoid,
namely stupid "shell game" drivers that don't actually help anything at
all, and move code into user space instead.
What was the point again?
Was the point to alienate people by showing how we're less about the
technology than about licenses?
Was the point to show that we think we can extend our reach past derived
work boundaries by just saying so?
The silly thing is, the people who tend to push most for this are the
exact SAME people who say that the RIAA etc should not be able to tell
people what to do with the music copyrights that they own, and that the
DMCA is bad because it puts technical limits over the rights expressly
granted by copyright law.
Doesn't anybody else see that as being hypocritical?
So it's ok when we do it, but bad when other people do it? Somehow I'm not
surprised, but I still think it's sad how you guys are showing a marked
two-facedness about this.
The fact is, the reason I don't think we should force the issue is very
simple: copyright law is simply _better_off_ when you honor the admittedly
gray issue of "derived work".
It's gray. It's not black-and-white. But
being gray is _good_. Putting artificial black-and-white technical
counter-measures is actually bad. It's bad when the RIAA does it, it's bad
when anybody else does it.
If a module arguably isn't a derived work, we simply shouldn't try to say
that its authors have to conform to our worldview.
We should make decisions on TECHNICAL MERIT. And this one is clearly being
pushed on anything but.
I happen to believe that there shouldn't be technical measures that keep
me from watching my DVD or listening to my music on whatever device I damn
well please. Fair use, man. But it should go the other way too: we should
not try to assert _our_ copyright rules on other peoples code that wasn't
derived from ours, or assert _our_ technical measures that keep people
from combining things their way.
If people take our code, they'd better behave according to our rules. But
we shouldn't have to behave according to the RIAA rules just because we
_listen_ to their music. Similarly, nobody should be forced to behave
according to our rules just because they _use_ our system.
There's a big difference between "copy" and "use". It's exatcly the same
issue whether it's music or code. You can't re-distribute other peoples
music (becuase it's _their_ copyright), but they shouldn't put limits on
how you personally _use_ it (because it's _your_ life).
Same goes for code. Copyright is about _distribution_, not about use. We
shouldn't limit how people use the code.
Oh, well. I realize nobody is likely going to listen to me, and everybody
has their opinion set in stone.
That said, I'm going to suggest that you people talk to your COMPANY
LAWYERS on this, and I'm personally not going to merge that particular
code unless you can convince the people you work for to merge it first.
In other words, you guys know my stance. I'll not fight the combined
opinion of other kernel developers, but I sure as hell won't be the first
to merge this, and I sure as hell won't have _my_ tree be the one that
causes this to happen.
So go get it merged in the Ubuntu, (Open)SuSE and RHEL and Fedora trees
first. This is not something where we use my tree as a way to get it to
other trees. This is something where the push had better come from the
other direction.
Because I think it's stupid. So use somebody else than me to push your
political agendas, please.
Linus
This e-mail is on public display, e.g. here:
http://thread.gmane.org/gmane.linux.ker ... cus=475824
User avatar
Fragadelic
Level 4
Level 4
Posts: 244
Joined: Wed Nov 15, 2006 11:05 am
Location: Canada
Contact:
Post by Fragadelic » Fri Dec 29, 2006 2:58 pm
I've read that too but that doesn't change the legal wording of the gpl as it pertains to the kernel.
I'm not the one who developed the kernel or any part of it or the wording of the GPL but we must play by the same rules since this is what was chosen by Linus originally.
For the record - I use and have used the ati and nvidia drivers in Linux and don't agree with what is going on personally but this opinion, like Linus' current one, doesn't change how the kernel was licensed.
You can't license it under a certain license and then verbally make changes to how you want it to be perceived.
Unfortunately I don't think we will ever have a definite answer either way and I think Linus prefers this as it doesn't snub the manufacturers that provide closed source linux drivers and such.
The biggest problem is that nobody will say for sure where the line of kernel module interaction and userspace is.
Taking nvidia for example. The actual kernel module interface is GPL but it uses their binary blob that they also develop for windows. If we consider the GPL'd interface module as the only thing truly touching the kernel code, then we can assume that this is perfectly legal and then it should be distributable since nvidia allows this in their distribution license. If we consider that the GPL'd kernel interface module is merely a "code bridge" then the binary blob must be part of the code that is using the kernel directly and as such must be GLP'd code as the license states. This is the real issue at hand and nobody can definitely answer it either way. Everyone has an opinion but opinions don't mean much legally.
They need to think about all of this very carefully and come to a definitive conclusion one way or another.
For me, I will continue to use the nvidia and ati drivers and whatever else I need to make my PC work how it should.
scorp123
Level 8
Level 8
Posts: 2277
Joined: Sat Dec 02, 2006 4:19 pm
Location: Switzerland
Post by scorp123 » Fri Dec 29, 2006 3:04 pm
Fragadelic wrote:For me, I will continue to use the nvidia and ati drivers and whatever else I need to make my PC work how it should.
Exactly. Same here. :D
User avatar
hairy_Palms
Level 4
Level 4
Posts: 292
Joined: Mon Nov 27, 2006 10:46 am
Post by hairy_Palms » Wed Jan 03, 2007 5:02 pm
to me, its much, much better left as a grey area,
first im going to state a fact
1, people currently need the binary drivers
2, linux doesnt have the desktop market share to boss nvidia and ati around
so lets look at what would happen if this was defined as black or white either way,
lets assume that its made entirely illegal for binary drivers, nvidia and ati will pull out of linux rather than gpl their code , leaving linux without decent graphics support and a lot of people wont be able to use it as they would like.
lets assume its made entirely legal thenm if so nvidia and ati never even consider changing their drivers to open source meaning everyone must use proprietory drivers forever more.
neither of these are a good situation.
then theres the third option, leave it as the grey area, in this case nvidia and ati make binary drivers, but they are never sure if its legal or not, so people use binary drivers and linux grows etc,
until one day in the future. linux is widespread on the desktop...the grey area is stated as illegal by the kernel development team and the non-gpl hook is implemented, nvidia/ati has a choice now, it can
1,lose a LOT of customers, or
2, open source its drivers,
and we all know a company will choose the one that gains it the most money.
unfortunately right now we dont have the clout to enforce that kind of ultimatum.
Locked
Return to “Chat about Linux Mint”
|
{
"url": "https://forums.linuxmint.com/viewtopic.php?p=2559",
"source_domain": "forums.linuxmint.com",
"snapshot_id": "crawl=CC-MAIN-2018-39",
"warc_metadata": {
"Content-Length": "108178",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F2EENENYJSUXU5BADOIIPYUTKY4XZEDY",
"WARC-Concurrent-To": "<urn:uuid:0f15211c-5d96-4a34-af28-69a70243bdfd>",
"WARC-Date": "2018-09-23T11:13:09Z",
"WARC-IP-Address": "192.124.249.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:URY35OE4OEZWUX4O7WP736JXZWF47TSM",
"WARC-Record-ID": "<urn:uuid:e745a4e2-984a-4323-8b65-f10ece536b60>",
"WARC-Target-URI": "https://forums.linuxmint.com/viewtopic.php?p=2559",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9b19f2bc-9865-45f5-b760-52c101fb640c>"
},
"warc_info": "isPartOf: CC-MAIN-2018-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2018\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-43-199-9.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
37,
38,
80,
89,
97,
105,
117,
150,
172,
173,
217,
218,
327,
578,
579,
608,
609,
621,
632,
640,
648,
659,
693,
710,
719,
720,
766,
767,
783,
1034,
1035,
1064,
1260,
1261,
1270,
1278,
1286,
1298,
1331,
1353,
1354,
1398,
1399,
1417,
1462,
1644,
1645,
1657,
1668,
1676,
1684,
1695,
1729,
1746,
1755,
1756,
1802,
1803,
1897,
1898,
1907,
1915,
1923,
1935,
1968,
1990,
1991,
2035,
2036,
2147,
2214,
2215,
2227,
2238,
2246,
2254,
2265,
2299,
2316,
2325,
2326,
2372,
2373,
2407,
2408,
2531,
2532,
2574,
2575,
2587,
2592,
2601,
2610,
2622,
2655,
2664,
2665,
2705,
2706,
2861,
2862,
2874,
2880,
2888,
2896,
2905,
2938,
2939,
2980,
2981,
3140,
3141,
3289,
3290,
3302,
3310,
3318,
3327,
3360,
3361,
3408,
3409,
3688,
3689,
3892,
3893,
4095,
4096,
4492,
4493,
4712,
4713,
5076,
5077,
5109,
5110,
5115,
5148,
6025,
6026,
6658,
6659,
6660,
6902,
6903,
6915,
6926,
6934,
6942,
6953,
6987,
7004,
7013,
7014,
7060,
7061,
7065,
7066,
7475,
7476,
7821,
7822,
7953,
7954,
7966,
7974,
7982,
7991,
8024,
8025,
8072,
8073,
8691,
8692,
8704,
8715,
8723,
8731,
8742,
8776,
8793,
8802,
8803,
8849,
8850,
9099,
9100,
9194,
9195,
9477,
9478,
9655,
9656,
9760,
9761,
9773,
9784,
9792,
9800,
9811,
9845,
9862,
9871,
9872,
9918,
9919,
10255,
10256,
10257,
10312,
10313,
10325,
10330,
10339,
10348,
10360,
10393,
10402,
10403,
10443,
10444,
10954,
10955,
11197,
11198,
11203,
11204,
11213,
11221,
11229,
11241,
11274,
11296,
11297,
11341,
11342,
11695,
12008,
12009,
12243,
12244,
12496,
12551,
12552,
12570,
12988,
13211,
13212,
13371,
13372,
13381,
13390,
13391,
13403,
13414,
13422,
13430,
13441,
13475,
13492,
13501,
13502,
13549,
13550,
13643,
13644,
14089,
14090,
14099,
14107,
14115,
14127,
14160,
14182,
14183,
14227,
14228,
14338,
14460,
14461,
14507,
14595,
14626,
14701,
14702,
14738,
14740,
14812,
14885,
14950,
14985,
14986,
15028,
15029,
15101,
15173,
15217,
15218,
15244,
15245,
15314,
15346,
15347,
15420,
15455,
15456,
15526,
15597,
15669,
15740,
15766,
15767,
15820,
15821,
15822,
15897,
15969,
15995,
15996,
16068,
16143,
16173,
16214,
16281,
16356,
16383,
16384,
16458,
16509,
16510,
16511,
16586,
16610,
16611,
16684,
16759,
16833,
16907,
16978,
17011,
17012,
17086,
17158,
17228,
17287,
17288,
17361,
17433,
17506,
17562,
17563,
17636,
17677,
17678,
17752,
17784,
17785,
17854,
17925,
17997,
17998,
18067,
18141,
18212,
18235,
18236,
18308,
18380,
18451,
18468,
18469,
18540,
18567,
18568,
18574,
18575,
18576,
18621,
18676,
18677,
18689,
18700,
18708,
18716,
18727,
18761,
18778,
18787,
18788,
18834,
18835,
18937,
18938,
19109,
19110,
19319,
19320,
19432,
19433,
19627,
19628,
19743,
19744,
20466,
20467,
20575,
20576,
20693,
20694,
20703,
20711,
20719,
20731,
20764,
20786,
20787,
20831,
20832,
20966,
20989,
20990,
21002,
21014,
21022,
21030,
21041,
21075,
21076,
21123,
21124,
21174,
21175,
21206,
21207,
21251,
21252,
21328,
21329,
21413,
21414,
21653,
21654,
21835,
21836,
21875,
21876,
22077,
22078,
22283,
22313,
22341,
22417,
22418,
22500,
22501,
22508,
22509
],
"line_end_idx": [
37,
38,
80,
89,
97,
105,
117,
150,
172,
173,
217,
218,
327,
578,
579,
608,
609,
621,
632,
640,
648,
659,
693,
710,
719,
720,
766,
767,
783,
1034,
1035,
1064,
1260,
1261,
1270,
1278,
1286,
1298,
1331,
1353,
1354,
1398,
1399,
1417,
1462,
1644,
1645,
1657,
1668,
1676,
1684,
1695,
1729,
1746,
1755,
1756,
1802,
1803,
1897,
1898,
1907,
1915,
1923,
1935,
1968,
1990,
1991,
2035,
2036,
2147,
2214,
2215,
2227,
2238,
2246,
2254,
2265,
2299,
2316,
2325,
2326,
2372,
2373,
2407,
2408,
2531,
2532,
2574,
2575,
2587,
2592,
2601,
2610,
2622,
2655,
2664,
2665,
2705,
2706,
2861,
2862,
2874,
2880,
2888,
2896,
2905,
2938,
2939,
2980,
2981,
3140,
3141,
3289,
3290,
3302,
3310,
3318,
3327,
3360,
3361,
3408,
3409,
3688,
3689,
3892,
3893,
4095,
4096,
4492,
4493,
4712,
4713,
5076,
5077,
5109,
5110,
5115,
5148,
6025,
6026,
6658,
6659,
6660,
6902,
6903,
6915,
6926,
6934,
6942,
6953,
6987,
7004,
7013,
7014,
7060,
7061,
7065,
7066,
7475,
7476,
7821,
7822,
7953,
7954,
7966,
7974,
7982,
7991,
8024,
8025,
8072,
8073,
8691,
8692,
8704,
8715,
8723,
8731,
8742,
8776,
8793,
8802,
8803,
8849,
8850,
9099,
9100,
9194,
9195,
9477,
9478,
9655,
9656,
9760,
9761,
9773,
9784,
9792,
9800,
9811,
9845,
9862,
9871,
9872,
9918,
9919,
10255,
10256,
10257,
10312,
10313,
10325,
10330,
10339,
10348,
10360,
10393,
10402,
10403,
10443,
10444,
10954,
10955,
11197,
11198,
11203,
11204,
11213,
11221,
11229,
11241,
11274,
11296,
11297,
11341,
11342,
11695,
12008,
12009,
12243,
12244,
12496,
12551,
12552,
12570,
12988,
13211,
13212,
13371,
13372,
13381,
13390,
13391,
13403,
13414,
13422,
13430,
13441,
13475,
13492,
13501,
13502,
13549,
13550,
13643,
13644,
14089,
14090,
14099,
14107,
14115,
14127,
14160,
14182,
14183,
14227,
14228,
14338,
14460,
14461,
14507,
14595,
14626,
14701,
14702,
14738,
14740,
14812,
14885,
14950,
14985,
14986,
15028,
15029,
15101,
15173,
15217,
15218,
15244,
15245,
15314,
15346,
15347,
15420,
15455,
15456,
15526,
15597,
15669,
15740,
15766,
15767,
15820,
15821,
15822,
15897,
15969,
15995,
15996,
16068,
16143,
16173,
16214,
16281,
16356,
16383,
16384,
16458,
16509,
16510,
16511,
16586,
16610,
16611,
16684,
16759,
16833,
16907,
16978,
17011,
17012,
17086,
17158,
17228,
17287,
17288,
17361,
17433,
17506,
17562,
17563,
17636,
17677,
17678,
17752,
17784,
17785,
17854,
17925,
17997,
17998,
18067,
18141,
18212,
18235,
18236,
18308,
18380,
18451,
18468,
18469,
18540,
18567,
18568,
18574,
18575,
18576,
18621,
18676,
18677,
18689,
18700,
18708,
18716,
18727,
18761,
18778,
18787,
18788,
18834,
18835,
18937,
18938,
19109,
19110,
19319,
19320,
19432,
19433,
19627,
19628,
19743,
19744,
20466,
20467,
20575,
20576,
20693,
20694,
20703,
20711,
20719,
20731,
20764,
20786,
20787,
20831,
20832,
20966,
20989,
20990,
21002,
21014,
21022,
21030,
21041,
21075,
21076,
21123,
21124,
21174,
21175,
21206,
21207,
21251,
21252,
21328,
21329,
21413,
21414,
21653,
21654,
21835,
21836,
21875,
21876,
22077,
22078,
22283,
22313,
22341,
22417,
22418,
22500,
22501,
22508,
22509,
22542
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 22542,
"ccnet_original_nlines": 457,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4247858226299286,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027097029611468315,
"rps_doc_frac_lines_end_with_ellipsis": 0.002183410106226802,
"rps_doc_frac_no_alph_words": 0.20083682239055634,
"rps_doc_frac_unique_words": 0.23109139502048492,
"rps_doc_mean_word_length": 4.301798343658447,
"rps_doc_num_sentences": 218,
"rps_doc_symbol_to_word_ratio": 0.003984860144555569,
"rps_doc_unigram_entropy": 5.841283798217773,
"rps_doc_word_count": 4059,
"rps_doc_frac_chars_dupe_10grams": 0.18796174228191376,
"rps_doc_frac_chars_dupe_5grams": 0.20428383350372314,
"rps_doc_frac_chars_dupe_6grams": 0.1911688894033432,
"rps_doc_frac_chars_dupe_7grams": 0.1911688894033432,
"rps_doc_frac_chars_dupe_8grams": 0.1911688894033432,
"rps_doc_frac_chars_dupe_9grams": 0.18796174228191376,
"rps_doc_frac_chars_top_2gram": 0.0164938997477293,
"rps_doc_frac_chars_top_3gram": 0.006872459780424833,
"rps_doc_frac_chars_top_4gram": 0.008017869666218758,
"rps_doc_books_importance": -2257.95166015625,
"rps_doc_books_importance_length_correction": -2257.95166015625,
"rps_doc_openwebtext_importance": -1325.3299560546875,
"rps_doc_openwebtext_importance_length_correction": -1325.3299560546875,
"rps_doc_wikipedia_importance": -1031.6783447265625,
"rps_doc_wikipedia_importance_length_correction": -1031.6783447265625
},
"fasttext": {
"dclm": 0.04087859019637108,
"english": 0.9611222743988037,
"fineweb_edu_approx": 1.599131464958191,
"eai_general_math": 0.16247045993804932,
"eai_open_web_math": 0.2091396450996399,
"eai_web_code": 0.005662260111421347
}
}
|
{
"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": "344.730285",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Martial law"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,581,229,049,427,908,000
|
[request] htmlSerializer for Gatsby
There used to be a few documentation pages on creating a custom htmlSerializer for gatsby.
There has been a flurry of changes to Prismic documentation (which is great) but now it's really hard to find a good example of best practice.
You used to be able to specify a htmlSerializer in your gatsby config (had to be our JS and not react) and everything just kind of worked.
Now we are pushed towards @prismicio/react which means you seem to need to include a htmlSerializer on every call of PrismicRichText?
<PrismicRichText components={htmlSerializer} />
which works but is very repetitive, the other thing you need to do now is add
<PrismicProvider
internalLinkComponent={({ href, ...props }) => (
<Link to={href} {...props} />
)}
>
around your PrismicPreviewProvider just to get your internal links to work.
Is it possible to get an updated part of the documentation for gatsby on how to add your own serializer? An example of all 'types' potentially (this is what we used to have but had disappeared.
or even maybe update some of the examples - e.g GitHub - prismicio/gatsby-blog
Hello @thejuniperstudio
With the new @prismicio/react kit also, you can provide an HTML serializer in gatsby-config.js, but it will be limited to only returning HTML. For example, you cannot return a React component in gatsby-config.js.
We recommend providing the HTML serializer to <PrismicRichText> instead. With this, you can return React components or HTML.
If you have a standard set of components, you can also provide it once to <PrismicProvider> at the top of the app (in a Gatsby app, this would be in gatsby-browser.js ). All <PrismicRichText> components will automatically use that HTML Serializer. You can still override that serializer by passing a serializer to an individual <PrismicRichText> component.
Note: the HTML serializer in gatsby-config.js will affect the HTML field for Rich Text fields. It will not affect the text or richText fields.
You can learn more about HTML Serializer in the core-concepts guide.
The gatsby docs and the example blog projects are already updated using the *@prismicio/react kit.
Let me know if you have any other questions.
Thanks,
Priyanka
|
{
"url": "https://community.prismic.io/t/request-htmlserializer-for-gatsby/8707",
"source_domain": "community.prismic.io",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "25267",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PRDUHFCQW7VNE46G4WZOZMSNHHDVKO5Y",
"WARC-Concurrent-To": "<urn:uuid:a5b6abb8-2f2e-4c4b-bb00-44f378e21ce0>",
"WARC-Date": "2022-05-27T19:54:21Z",
"WARC-IP-Address": "184.104.202.139",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QM66NEYUPI6WJRB7G6BFU2UUZA3QSTKA",
"WARC-Record-ID": "<urn:uuid:69da625b-12a2-4198-a136-8104e1966cba>",
"WARC-Target-URI": "https://community.prismic.io/t/request-htmlserializer-for-gatsby/8707",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:19451309-e66d-4146-8468-5cfad34935b4>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-61\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
36,
37,
128,
271,
272,
411,
412,
546,
547,
595,
596,
674,
675,
692,
745,
781,
788,
792,
793,
869,
870,
1064,
1065,
1144,
1145,
1169,
1170,
1383,
1384,
1509,
1510,
1867,
1868,
2011,
2012,
2081,
2082,
2181,
2182,
2227,
2228,
2236
],
"line_end_idx": [
36,
37,
128,
271,
272,
411,
412,
546,
547,
595,
596,
674,
675,
692,
745,
781,
788,
792,
793,
869,
870,
1064,
1065,
1144,
1145,
1169,
1170,
1383,
1384,
1509,
1510,
1867,
1868,
2011,
2012,
2081,
2082,
2181,
2182,
2227,
2228,
2236,
2244
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2244,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0.004456330090761185,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4333333373069763,
"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.19333332777023315,
"rps_doc_frac_unique_words": 0.4898550808429718,
"rps_doc_mean_word_length": 5.078260898590088,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.004444439895451069,
"rps_doc_unigram_entropy": 4.754716873168945,
"rps_doc_word_count": 345,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01712328940629959,
"rps_doc_frac_chars_top_3gram": 0.027397260069847107,
"rps_doc_frac_chars_top_4gram": 0.031963471323251724,
"rps_doc_books_importance": -215.2239227294922,
"rps_doc_books_importance_length_correction": -215.2239227294922,
"rps_doc_openwebtext_importance": -115.19954681396484,
"rps_doc_openwebtext_importance_length_correction": -115.19954681396484,
"rps_doc_wikipedia_importance": -61.26259231567383,
"rps_doc_wikipedia_importance_length_correction": -61.26259231567383
},
"fasttext": {
"dclm": 0.23601704835891724,
"english": 0.8318919539451599,
"fineweb_edu_approx": 1.9164284467697144,
"eai_general_math": 0.6214989423751831,
"eai_open_web_math": 0.17969012260437012,
"eai_web_code": 0.8296560049057007
}
}
|
{
"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": "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": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,645,506,268,890,201,000
|
1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.
New Laptop for Uni
Discussion in 'Hardware' started by Jimbooo, Jun 3, 2008.
1. Jimbooo
Jimbooo Nibble Poster
96
1
29
Hi guys, I'm considering buying a new laptop with the following specs, and I was wondering if people could tell me if the price is good, if it's okay for gaming and I have a few other questions.
Screen: 15.4"
Weighs: Approx 2.7Kg
Processor: Intel Core 2 Duo T9500 (2 x 2.6Ghz) 800Mhz FSB 6MB L2 Cache
Memory/RAM: 4GB Corsair DDR2 667MHz
Graphics Card: 512MB Geforce 8600GT + D-SUB + TV-OUT
Hard Drive: 320GB 5400rpm 8MB Cache
Wireless: 802.11N Wireless Card
Comes with all the usuals, fingerprint scanner, 2 x 9 Cell Lithium Ion Batteries, 2 years warranty, Windows Vista 32 Bit.
£1193
So, I have a few questions that I hope some of you nice people could answer for me!
1. I can go up to 2 x 2.8 Ghz Extreme CPU's, for an extra hundred or so.. is it worth it? I'm not going to be doing heavy duty video editing or anything, just some gaming.
2. I know that all of the 4GB RAM will not be able to be used in Vista x32, so how much will be with the spec above? I'm hoping for at least 3GB, is there any way to tell?
3. What are the differences between 802.11G and 802.11N, are they important? I can save a tenner by choosing 802.11G..
4. And most importantly, the graphics card. Is it 512MB dedicated? It DOESN'T say 8600M GT. I want to know how good it is, as I will be planning on playing Company of Heroes, some Crysis etc.
Is the price good?
Edit: I can't find a better laptop anywhere for between £1000 and £1200. If anyone has other companies, please post them as I haven't ever bought a laptop before and obviously want the best deal!
Certifications: 4 A-Levels
WIP: BSc (Hons) Computing
2. Sparky
Highly Decorated Member Award
Sparky Zettabyte Poster Moderator
10,205
305
319
Playing games on laptops generally doesnt work very well mate :blink
Certifications: MSc MCSE MCSA:M MCSA:S MCITP:EA MCTS(x5) Security+ Network+ A+
WIP: Exchange 2007\2010
3. NightWalker
NightWalker Gigabyte Poster
1,172
25
92
Yep, its true. If you want good performance for any gaming you need a desktop machine, or an xbox :)
Certifications: A+, Network+, MCP, MCSA:M 2003, ITIL v3 Foundation
4. Jimbooo
Jimbooo Nibble Poster
96
1
29
Thanks, but I aim to take my laptop around Uni a lot and that's why I'm going for a 15.4" not a 17". So, if I'm getting a laptop, I am looking for it to be decent at playing some games too. Why not? You know, I can be sat there taking lecture notes on my laptop (hope to be studying computing :D) and afterwards switch to crysis for a quick gaming sesh.. That's my plan! :P
It's kind of annoying, being able to buy a Quad core computer with 8GB ram for the same price, but a Laptop is the way to go at uni.
Certifications: 4 A-Levels
WIP: BSc (Hons) Computing
5. Sparky
Highly Decorated Member Award
Sparky Zettabyte Poster Moderator
10,205
305
319
Hee hee! :biggrin
Dude,you will need to drag a fully loaded gaming rig around if you want to do that! :biggrin
Certifications: MSc MCSE MCSA:M MCSA:S MCITP:EA MCTS(x5) Security+ Network+ A+
WIP: Exchange 2007\2010
6. Jimbooo
Jimbooo Nibble Poster
96
1
29
Hehe *slings computer case onto back and straps screen to stomach*..
Okay, there is one other option that I have that I just thought of...
Maybe I could buy an asus ee pc, or equally tiny laptop that enables me to: Watch movies, listen to music, browse the web (wirelessly) and then buy a powerful desktop that can play these games to put in my dorm. I can take my notes on my laptop and transfer them to the computer.
I would still have the cost limit of £1200 or so, but perhaps that idea is a lot better? I'd appreciate any feedback, as this is definitely a big decision for me!
Certifications: 4 A-Levels
WIP: BSc (Hons) Computing
7. Sparky
Highly Decorated Member Award
Sparky Zettabyte Poster Moderator
10,205
305
319
Much better plan mate. :biggrin
I haven’t played any games on a PC for a few years now (got to pay a mortgage and all the other boring things!) but some of the other members here should be able you help out with a spec for your gaming rig.
You could pick up a laptop for around £500 if you just need it for basic Office tasks and to watch a DVD. 8)
Certifications: MSc MCSE MCSA:M MCSA:S MCITP:EA MCTS(x5) Security+ Network+ A+
WIP: Exchange 2007\2010
8. Modey
Modey Terabyte Poster
2,397
99
154
It's more than possible to get a very good gaming laptop these days as companies have been making specialist gaming laptops for a while now. Ok yes, you are going to have to spend a fair bit extra to get decent performance but sometimes it's nice to have something that's capable of playing the latest games in a portable format.
We are about to get a couple of these laptops at work. http://www.simplyacer.com/product/id/411994/LX.AP40X.121 Not I might add from that company, but that's the one we are going with. It just so happens that it's going to be a very capable gaming laptop as well as serve a number of other functions (virtualisation being high on the list).
Obviously if you do decide to get a gaming laptop then the main criteria is the graphics card that it comes with. Go with the best one you can afford then spec the rest of the laptop accordingly. CPU speed is definitely secondary to the power of the graphics chipset since you are going to be looking at at least a 2Ghz C2D (or higher).
The GFX chipset you originally mentioned is a pretty good one by laptop standards. Have a look here to see a comparison of most of the ones that are currently available ( http://www.notebookcheck.net/NVIDIA-GeForce-8600M-GT.3986.0.html ). The 8600GT should be capable of around about 4000 in 3DMark06.
If you do decide to go down the route of cheap laptop + decent gaming PC, then you should be able to do it for less that £1000 quite easily really.
You can get a laptop with a dual core chip and a couple of gigs of ram now for £350 ( http://www.ebuyer.com/product/139025# ) believe it or not. For the remaining £650ish you could get a gaming rig that could hit 10K+ in 3dmark06 no problems. If you do want a hand with a suggested spec, let me know.
Certifications: A+, N+, MCP, MCDST, MCSA 2K3, MCTS, MOS, MTA, MCT, MCITP:EDST7, MCSA W7, Citrix CCA, ITIL Foundation
WIP: Nada
9. asje1
asje1 Byte Poster
173
2
32
Certifications: A+, N+
10. Modey
Modey Terabyte Poster
2,397
99
154
The spec looks good, and the graphics chipset is a very good one (albeit oriented towards 2d / cad performance) but I'd be wary of going for a laptop that isn't from a mainstream manufacturer myself. I'd worry about the viability of extended warranties etc...
Certifications: A+, N+, MCP, MCDST, MCSA 2K3, MCTS, MOS, MTA, MCT, MCITP:EDST7, MCSA W7, Citrix CCA, ITIL Foundation
WIP: Nada
11. Mathematix
Mathematix Megabyte Poster
969
35
74
Please note that some games specifically do not support laptops of any kind. Not in the sense that they are guaranteed not to work, just that if they don't work you can't claim that the game is at fault. :dry
Certifications: BSc(Hons) Comp Sci, BCS Award of Merit
WIP: Not doing certs. Computer geek.
12. derkit
derkit Gigabyte Poster
1,479
54
112
I felt this way when I left for uni...... that soon disappeared, and I spent nearly 6 years away from the PC game scene (apart from the odd summer at home).
There's plenty of things to do at uni, I did a shed load in my time and only wished I had slept a couple of hours less to fit some more stuff in!
way of topic, but there's time to play in your house when your working - uni is probably the most stress-free, laid-back time I've ever experienced (and that includes deadlines for coursework/exams!)
Certifications: MBCS, BSc(Hons), Cert(Maths), A+, Net+, MCDST, ITIL-F v3, MCSA
WIP: 70-293
13. hbroomhall
hbroomhall Petabyte Poster Gold Member
6,623
115
224
You also need to remember that laptops disappear faster than almost anything else at Uni. Because of this many insurers won't cover them.
Harry.
Certifications: ECDL A+ Network+ i-Net+
WIP: Server+
14. Jimbooo
Jimbooo Nibble Poster
96
1
29
PLEASE DELETE POST
Certifications: 4 A-Levels
WIP: BSc (Hons) Computing
15. Jimbooo
Jimbooo Nibble Poster
96
1
29
Wow! The Acer Aspire 6920G has fantastic specs for the price... better than my best find above! The processor is 2.4Ghz as opposed to 2.6Ghz, but that wont make much difference will it?
Wont a 16" be a little too big to carry around Uni? Taking it to my computing lectures? It's 3.68Kg, what do you think?
There's that route, with a blueray player, for under £1000!! OR I can get myself a little Asus Eee PC that's small and has a lot more battery life and spend the rest on building a gaming rig with 4GB ram and quad core processors. It's a hard decision!
Thanks Derkit. I haven't actually experienced Uni yet, and no I'm not going to be a hermit and stay inside all the time! I'll be going out a lot :twisted: but say one day after a lecture there's nothing to do except.. wap on company of heroes..
I might point out here that if I buy a small laptop, I aim to be paying for the main computer on finance (ie, £40 a week tops), so it needs to last me my time at Uni :biggrin:.
First, I need to decide between powerful laptop which will look cool (that Asus!) or a tiny laptop which looks snazzy and a supercomputer in my dorm room which will play anything. I can't decide!!
Certifications: 4 A-Levels
WIP: BSc (Hons) Computing
16. Modey
Modey Terabyte Poster
2,397
99
154
edit: Double post deleted.
Certifications: A+, N+, MCP, MCDST, MCSA 2K3, MCTS, MOS, MTA, MCT, MCITP:EDST7, MCSA W7, Citrix CCA, ITIL Foundation
WIP: Nada
17. Modey
Modey Terabyte Poster
2,397
99
154
Funnily enough myself and WagnerK (he posts on here also and we work together) got our Aspire 6920's the same day I recommended it to you. I can't emphasis enough how incredibly cool this laptop is (I'm typing this on it actually :) ). It's got lots of loevely blue glowing lights all over it - if that wasn't enough, it's got a good spec also. :)
It is a heavy laptop, but certainly not a big deal. It doesn't feel heavy with it in it's bag over my shoulder. The screen is pretty amazing, it's a true 16:9 widescreen ratio, so it makes a 15.4" widescreen laptop look almost square in comparison. It also sports a resolution of 1920 x 1080, so if you have bad eyes, don't get this! In it's native resolution things do appear to be a little small on the screen. It's pretty easy to tweak Vista to use bigger fonts for most things though.
It's the 2.4Ghz C2D with 3MB of cache (45nm though which is nice). I'm sure it's going to be plenty fast enough for what I need. Nice fast video card as well (GeForce 9500 GS, 512MB). It scores about 4100 in 3D Mark 06 with all the default settings. So Crysis ain't exactly going to fly on it, but most games will run very well indeed.
The Blu-Ray player is very nice and somewhat of a bonus as we weren't after one in particular but this laptop had it built in. It also has a HDMI output on the laptop which I tested last night on my 42" 1080p TV. After I had tweaked a couple of settings I was watching some lovely HD footage on my big screen. The GeForce 9500 has the HD acceleration built in, so the processor doesn't have to work it's arse off just to display HD.
It also comes with a full size remote control, which will control Media Centre + the Blu-Ray player. And as a final little extra it has a built in digi tv tuner and comes with an ariel for it.
Negatives.
Not too many really. It does come with Vista Home Premium 32Bit, so even though the welcome screen displays 4GB of ram, it's only able to address 3GB. We are intending to upgrade it to Vista Ultimate 64bit though (oem version can be had for a little under £100).
As mentioned, HD output via the HDMI socket took a little tweaking to get right. You can't have the display in clone mode (built in panel and HD TV) at the same time for Blu-Ray due to HDCP bollocks. So you have to disable the on board panel for Blu-Ray. Once I figured this out though, it was ok.
Can't think of any other negatives at the moment, I suppose the battery life could be one (about 2hrs) but I didn't expect any more out of such a powerful laptop really.
Certifications: A+, N+, MCP, MCDST, MCSA 2K3, MCTS, MOS, MTA, MCT, MCITP:EDST7, MCSA W7, Citrix CCA, ITIL Foundation
WIP: Nada
18. Modey
Modey Terabyte Poster
2,397
99
154
Just to say, there is something funny going on with posts. I posted the above, and it was showing that I was the last poster on the thread, but not showing the post. I posted it again, so I don't know if it will end up showing a double entry.
Certifications: A+, N+, MCP, MCDST, MCSA 2K3, MCTS, MOS, MTA, MCT, MCITP:EDST7, MCSA W7, Citrix CCA, ITIL Foundation
WIP: Nada
19. NightWalker
NightWalker Gigabyte Poster
1,172
25
92
You need to enable Physical Address Extensions so it can see all 4GB. Open a CMD window as administrator, enter:
Code:
BCDEdit /set PAE forceenable
Then reboot.
Seen some posts on forums that say this doesn't work, I only have 2GB of RAM so I have not tested it. I have used the /PAE switch in boot.ini on Server 2003 32bit to address 16GB of RAM successfully.
Certifications: A+, Network+, MCP, MCSA:M 2003, ITIL v3 Foundation
20. Modey
Modey Terabyte Poster
2,397
99
154
Thanks for the tip, but it didn't work. I didn't really expect it to though because so far the only reliable way I have seen to be able to address more than 3GB in Windows is to use a 64bit edition. Isn't the 3 to 4Gb area reserverd for hardware addressing or somehting like that? Mapping ram for video adapters and other such things.
Anyway, I'm going ot experiment with multibooting it and see how I get on. It's got a 320GB HDD, so there is plenty of space for an OS party. :)
Certifications: A+, N+, MCP, MCDST, MCSA 2K3, MCTS, MOS, MTA, MCT, MCITP:EDST7, MCSA W7, Citrix CCA, ITIL Foundation
WIP: Nada
Share This Page
Loading...
|
{
"url": "http://www.certforums.com/threads/new-laptop-for-uni.25625/",
"source_domain": "www.certforums.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "133098",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CJR6ZAIXUOD6OWVIYMN6SOI6IPNB2VI7",
"WARC-Concurrent-To": "<urn:uuid:d2341588-f0da-41f6-8af7-7adf38bb37fe>",
"WARC-Date": "2017-05-29T17:27:55Z",
"WARC-IP-Address": "144.76.31.72",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PXDJKKECMJR6ETOP2WBNAXPUBBQGTEMN",
"WARC-Record-ID": "<urn:uuid:c6c0c35f-928e-4bde-813a-8a7bf86faf02>",
"WARC-Target-URI": "http://www.certforums.com/threads/new-laptop-for-uni.25625/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7341b893-65f6-4257-983a-0c1de24c9142>"
},
"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,
113,
114,
133,
134,
192,
193,
206,
207,
233,
234,
241,
247,
254,
453,
454,
472,
497,
572,
612,
669,
709,
745,
746,
872,
873,
888,
889,
977,
978,
1154,
1330,
1453,
1649,
1650,
1673,
1674,
1884,
1890,
1921,
1951,
1963,
1997,
1998,
2036,
2037,
2048,
2056,
2064,
2137,
2143,
2226,
2254,
2271,
2272,
2304,
2305,
2315,
2322,
2329,
2434,
2440,
2511,
2524,
2525,
2551,
2552,
2559,
2565,
2572,
2950,
2951,
3088,
3094,
3125,
3155,
3167,
3201,
3202,
3240,
3241,
3252,
3260,
3268,
3290,
3291,
3388,
3394,
3477,
3505,
3518,
3519,
3545,
3546,
3553,
3559,
3566,
3639,
3640,
3714,
3715,
3999,
4000,
4167,
4173,
4204,
4234,
4246,
4280,
4281,
4319,
4320,
4331,
4339,
4347,
4383,
4384,
4596,
4597,
4715,
4721,
4804,
4832,
4843,
4844,
4870,
4871,
4881,
4888,
4896,
5230,
5231,
5576,
5577,
5918,
5919,
6225,
6226,
6383,
6384,
6699,
6705,
6826,
6840,
6851,
6852,
6874,
6875,
6883,
6889,
6896,
6923,
6935,
6936,
6962,
6963,
6973,
6980,
6988,
7252,
7258,
7379,
7393,
7410,
7411,
7442,
7443,
7451,
7458,
7465,
7678,
7684,
7743,
7784,
7797,
7798,
7825,
7826,
7836,
7843,
7851,
8012,
8013,
8163,
8164,
8368,
8374,
8457,
8473,
8490,
8491,
8534,
8535,
8545,
8553,
8561,
8703,
8704,
8715,
8721,
8765,
8782,
8796,
8797,
8823,
8824,
8831,
8837,
8844,
8867,
8873,
8904,
8934,
8948,
8949,
8975,
8976,
8983,
8989,
8996,
9186,
9187,
9311,
9312,
9568,
9569,
9818,
9819,
10000,
10001,
10202,
10208,
10239,
10269,
10281,
10282,
10308,
10309,
10319,
10326,
10334,
10365,
10371,
10492,
10506,
10518,
10519,
10545,
10546,
10556,
10563,
10571,
10923,
10924,
11417,
11418,
11758,
11759,
12196,
12197,
12394,
12395,
12410,
12411,
12683,
12684,
12986,
12987,
13161,
13167,
13288,
13302,
13314,
13315,
13341,
13342,
13352,
13359,
13367,
13614,
13620,
13741,
13755,
13773,
13774,
13806,
13807,
13817,
13824,
13831,
13948,
13958,
13991,
14008,
14009,
14213,
14219,
14290,
14302,
14303,
14329,
14330,
14340,
14347,
14355,
14694,
14695,
14844,
14850,
14971,
14985,
14986,
15002,
15003
],
"line_end_idx": [
113,
114,
133,
134,
192,
193,
206,
207,
233,
234,
241,
247,
254,
453,
454,
472,
497,
572,
612,
669,
709,
745,
746,
872,
873,
888,
889,
977,
978,
1154,
1330,
1453,
1649,
1650,
1673,
1674,
1884,
1890,
1921,
1951,
1963,
1997,
1998,
2036,
2037,
2048,
2056,
2064,
2137,
2143,
2226,
2254,
2271,
2272,
2304,
2305,
2315,
2322,
2329,
2434,
2440,
2511,
2524,
2525,
2551,
2552,
2559,
2565,
2572,
2950,
2951,
3088,
3094,
3125,
3155,
3167,
3201,
3202,
3240,
3241,
3252,
3260,
3268,
3290,
3291,
3388,
3394,
3477,
3505,
3518,
3519,
3545,
3546,
3553,
3559,
3566,
3639,
3640,
3714,
3715,
3999,
4000,
4167,
4173,
4204,
4234,
4246,
4280,
4281,
4319,
4320,
4331,
4339,
4347,
4383,
4384,
4596,
4597,
4715,
4721,
4804,
4832,
4843,
4844,
4870,
4871,
4881,
4888,
4896,
5230,
5231,
5576,
5577,
5918,
5919,
6225,
6226,
6383,
6384,
6699,
6705,
6826,
6840,
6851,
6852,
6874,
6875,
6883,
6889,
6896,
6923,
6935,
6936,
6962,
6963,
6973,
6980,
6988,
7252,
7258,
7379,
7393,
7410,
7411,
7442,
7443,
7451,
7458,
7465,
7678,
7684,
7743,
7784,
7797,
7798,
7825,
7826,
7836,
7843,
7851,
8012,
8013,
8163,
8164,
8368,
8374,
8457,
8473,
8490,
8491,
8534,
8535,
8545,
8553,
8561,
8703,
8704,
8715,
8721,
8765,
8782,
8796,
8797,
8823,
8824,
8831,
8837,
8844,
8867,
8873,
8904,
8934,
8948,
8949,
8975,
8976,
8983,
8989,
8996,
9186,
9187,
9311,
9312,
9568,
9569,
9818,
9819,
10000,
10001,
10202,
10208,
10239,
10269,
10281,
10282,
10308,
10309,
10319,
10326,
10334,
10365,
10371,
10492,
10506,
10518,
10519,
10545,
10546,
10556,
10563,
10571,
10923,
10924,
11417,
11418,
11758,
11759,
12196,
12197,
12394,
12395,
12410,
12411,
12683,
12684,
12986,
12987,
13161,
13167,
13288,
13302,
13314,
13315,
13341,
13342,
13352,
13359,
13367,
13614,
13620,
13741,
13755,
13773,
13774,
13806,
13807,
13817,
13824,
13831,
13948,
13958,
13991,
14008,
14009,
14213,
14219,
14290,
14302,
14303,
14329,
14330,
14340,
14347,
14355,
14694,
14695,
14844,
14850,
14971,
14985,
14986,
15002,
15003,
15013
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 15013,
"ccnet_original_nlines": 313,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3582267165184021,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0931270495057106,
"rps_doc_frac_lines_end_with_ellipsis": 0.009554140269756317,
"rps_doc_frac_no_alph_words": 0.24546265602111816,
"rps_doc_frac_unique_words": 0.3214004635810852,
"rps_doc_mean_word_length": 4.2289533615112305,
"rps_doc_num_sentences": 181,
"rps_doc_symbol_to_word_ratio": 0.004462960176169872,
"rps_doc_unigram_entropy": 5.939985275268555,
"rps_doc_word_count": 2542,
"rps_doc_frac_chars_dupe_10grams": 0.09265115857124329,
"rps_doc_frac_chars_dupe_5grams": 0.16744185984134674,
"rps_doc_frac_chars_dupe_6grams": 0.16204650700092316,
"rps_doc_frac_chars_dupe_7grams": 0.16204650700092316,
"rps_doc_frac_chars_dupe_8grams": 0.10195349156856537,
"rps_doc_frac_chars_dupe_9grams": 0.10195349156856537,
"rps_doc_frac_chars_top_2gram": 0.004093020223081112,
"rps_doc_frac_chars_top_3gram": 0.010418600402772427,
"rps_doc_frac_chars_top_4gram": 0.01339535042643547,
"rps_doc_books_importance": -1131.78857421875,
"rps_doc_books_importance_length_correction": -1131.78857421875,
"rps_doc_openwebtext_importance": -737.0861206054688,
"rps_doc_openwebtext_importance_length_correction": -737.0861206054688,
"rps_doc_wikipedia_importance": -602.984375,
"rps_doc_wikipedia_importance_length_correction": -602.984375
},
"fasttext": {
"dclm": 0.11042814701795578,
"english": 0.9341878890991211,
"fineweb_edu_approx": 0.9583371877670288,
"eai_general_math": 0.055537279695272446,
"eai_open_web_math": 0.13086199760437012,
"eai_web_code": 0.008551480248570442
}
}
|
{
"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": "378.196",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"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": "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": "16",
"label": "Personal Blog"
}
},
"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": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,993,642,646,887,694,300
|
Every two weeks I send out a newsletter containing lots of interesting stuff for the modern PHP developer. You can expect quick tips, links to interesting tutorials, opinions and packages. Want to learn the cool stuff? Then sign up now!
Making call_user_func_array more readable
There’s a lot PHP 7 love going around these days, but PHP 5.6 has it’s fair share of nice features too. One of those features is the splat operator. It looks like this: ....
The splat operator can capture a variable number of arguments.
function logThis(...$messages)
{
foreach ($messages as $message) {
echo $message.PHP_EOL;
}
}
logThis('one', 'two', 'three');
You can still use regular arguments as well:
function logThis($firstMessage, ...$otherMessages)
{
echo "superimportant: {$firstMessage}".PHP_EOL;
foreach ($otherMessages as $message) {
echo $message.PHP_EOL;
}
}
logThis('one', 'two', 'three');
Another usage for the splat operator is argument unpacking:
$messages[] = "one";
$messages[] = "two";
$messages[] = "three";
logThis(...$messages);
The operator can also help replacing usages of call_user_func_array to something more readable. Consider this contrived example where all calls to a class are forwarded to a dependency.
class ClassA
{
protected $classB;
public function __construct(ClassB $classB)
{
$this->classB = $classB;
}
public function __call($method, $args)
{
call_user_func_array([$this->classB, $method], $args);
}
}
Using this splat operator this can be rewritten to:
class ClassA
{
protected $classB;
public function __construct(ClassB $classB)
{
$this->classB = $classB;
}
public function __call($method, $args)
{
$this->classB->$method(...$args);
}
}
Do you know some other cool usage of the operator? Let me know in the comments below.
Freek Van der Herten is a partner and developer at Spatie, an Antwerp based company that specializes in creating web apps with Laravel. After hours he writes about modern PHP and Laravel on this blog. When not coding he’s probably rehearsing with his kraut rock band. He loves waffles and butterflies.
|
{
"url": "https://murze.be/2015/12/making-call_user_func_array-more-readable/",
"source_domain": "murze.be",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "42998",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MTEA7ENLJQPH24XLZOB7DPYQBGJKVP7J",
"WARC-Concurrent-To": "<urn:uuid:460ad68c-64d3-4674-886b-8ca6b87caee0>",
"WARC-Date": "2017-09-23T23:33:37Z",
"WARC-IP-Address": "104.28.17.235",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5JHBWPPYSOKASNMPP3XPJO5WNMVX62QW",
"WARC-Record-ID": "<urn:uuid:f75fae2c-8eb7-4d07-b803-1215a11ef4a1>",
"WARC-Target-URI": "https://murze.be/2015/12/making-call_user_func_array-more-readable/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:52d5ccf9-e92a-4c50-86ad-a0f0c8032f47>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-157-139-144.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,
237,
238,
280,
281,
455,
456,
519,
520,
551,
553,
591,
622,
628,
630,
631,
663,
664,
709,
710,
761,
763,
815,
816,
859,
890,
896,
898,
899,
931,
932,
992,
993,
1014,
1035,
1058,
1059,
1082,
1083,
1269,
1270,
1283,
1285,
1308,
1309,
1357,
1363,
1396,
1402,
1403,
1446,
1452,
1515,
1521,
1523,
1524,
1576,
1577,
1590,
1592,
1615,
1616,
1664,
1670,
1703,
1709,
1710,
1753,
1759,
1801,
1807,
1809,
1810,
1896,
1897
],
"line_end_idx": [
237,
238,
280,
281,
455,
456,
519,
520,
551,
553,
591,
622,
628,
630,
631,
663,
664,
709,
710,
761,
763,
815,
816,
859,
890,
896,
898,
899,
931,
932,
992,
993,
1014,
1035,
1058,
1059,
1082,
1083,
1269,
1270,
1283,
1285,
1308,
1309,
1357,
1363,
1396,
1402,
1403,
1446,
1452,
1515,
1521,
1523,
1524,
1576,
1577,
1590,
1592,
1615,
1616,
1664,
1670,
1703,
1709,
1710,
1753,
1759,
1801,
1807,
1809,
1810,
1896,
1897,
2198
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2198,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0.01000909972935915,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.254004567861557,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018306640908122063,
"rps_doc_frac_lines_end_with_ellipsis": 0.013333329930901527,
"rps_doc_frac_no_alph_words": 0.32723110914230347,
"rps_doc_frac_unique_words": 0.6131386756896973,
"rps_doc_mean_word_length": 5.627737045288086,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.011441649869084358,
"rps_doc_unigram_entropy": 4.905910015106201,
"rps_doc_word_count": 274,
"rps_doc_frac_chars_dupe_10grams": 0.13618676364421844,
"rps_doc_frac_chars_dupe_5grams": 0.19325551390647888,
"rps_doc_frac_chars_dupe_6grams": 0.19325551390647888,
"rps_doc_frac_chars_dupe_7grams": 0.19325551390647888,
"rps_doc_frac_chars_dupe_8grams": 0.13618676364421844,
"rps_doc_frac_chars_dupe_9grams": 0.13618676364421844,
"rps_doc_frac_chars_top_2gram": 0.033722441643476486,
"rps_doc_frac_chars_top_3gram": 0.051880668848752975,
"rps_doc_frac_chars_top_4gram": 0.033722441643476486,
"rps_doc_books_importance": -238.5116729736328,
"rps_doc_books_importance_length_correction": -238.5116729736328,
"rps_doc_openwebtext_importance": -121.6872787475586,
"rps_doc_openwebtext_importance_length_correction": -121.6872787475586,
"rps_doc_wikipedia_importance": -92.57919311523438,
"rps_doc_wikipedia_importance_length_correction": -92.57919311523438
},
"fasttext": {
"dclm": 0.09775804728269577,
"english": 0.757627546787262,
"fineweb_edu_approx": 2.2994537353515625,
"eai_general_math": 0.38522350788116455,
"eai_open_web_math": 0.15562564134597778,
"eai_web_code": 0.24220699071884155
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,772,890,501,504,672,500
|
Как установить MariaDB 7.4 в Windows
О том, что такое MariaDB и чем она отличается от MySQL смотрите в статье «MariaDB для Windows».
Если вы хотите установить веб-сервер с MariaDB в качестве СУБД, то изучите «Инструкцию по установке веб-сервера Apache c PHP, MariaDB и phpMyAdmin в Windows. Настройка безопасности локального веб-сервера».
Особенности установки MariaDB 7.4 в Windows
Особенность данной версии (на момент написания она является самой новой) в том, что вместе с ней не поставляются необходимые файлы баз данных.
Дело в том, что все свои данные (например, пользователи и их пароли, метаинформацию о базах данных и таблицах, данные статистики), СУБД MariaDB хранит также в одной из своих базе данных. То есть для работы MariaDB нужно чтобы существовала хотя бы база данных со служебными таблицами.
Ранее архив MariaDB поставлялся с папкой data в которой присутствовали необходимые файлы. Но начиная с версии MariaDB 7.4 эта папка пустая.
Получается, мы не можем запустить службу MariaDB, пока не будут созданы нужные файлы. Для создания этих файлов используется так называемый процесс «инициализации».
В последних версиях MySQL всё аналогично — для работы требуется служебная база данных, но она не поставляется с программой. Для создания нужных файлов достаточно запустить mysqld с опцией --initialize-insecure.
И хотя MariaDB должна быть полностью совместимой с MySQL, в ней опция --initialize-insecure не работает!
mysql_install_db.exe
Для инициализации СУБД в MariaDB нужно использовать поставляющуюся в комплекте программу mysql_install_db.exe. Причём она не обращает внимание на файл настроек my.cnf! То есть даже если в этом файле вы установили значение datadir, при запуске команды mysql_install_db.exe всё равно нужно явно указать путь до папки с базами данных:
mysql_install_db --datadir=ПУТЬ_ДО_ПАПКИ_С_БАЗАМИ
У меня исполнимые файлы СУБД находятся в папке C:\Server\bin\mariadb, а базы данных должны размещаться в папке C:\Server\data\DB\data\, тогда моя команда следующая:
C:\Server\bin\mariadb\bin\mysql_install_db --datadir=C:\Server\data\DB\data\
Когда необходимые файлы созданы, можно выполнить установку и запуск службы как обычно:
C:\Server\bin\mariadb\bin\mysqld --install
net start mysql
Документация о mysql_install_db: https://mariadb.com/kb/en/library/mysql_install_dbexe/
Программа поддерживает следующие опции:
Параметр Описание
-?--help Показать справку и выйти
-d--datadir=name Директория новой базы данных
-S--service=name Имя службы Windows
-p--password=name Пароль пользователя root
-P--port=# mysqld порт
-W--socket=name имя именной трубы (pipe)
-D--default-user Создать дефолтного пользователя
-R--allow-remote-root-access Разрешить удалённый доступ из сети для пользователя root
-N--skip-networking Не использовать TCP подключения, вместо них использовать трубу (pipe)
-i--innodb-page-size Размер страницы Innodb
Помните: для создания сервиса Windows, mysql_install_db.exe должна быть запущена пользователем с полными правами администратора. Для простой инициализации баз данных права администратора не требуются.
Также обратите внимание, что в указанной папке БД будет создан новый файл конфигурации. Получается, если вы хотите, чтобы MariaDB учитывала настройки из этого файла (если вы ещё не создали свой собственный конфигурационный файл), то вам нужно перенести его в корневую папку MariaDB.
Следующие примеры взяты из официальной документации — сам я предпочитаю выполнять установку с помощью mysqld как это показано выше, и конфигурационный файл я создаю внучную.
Команда для создания необходимых баз данных в директории C:\db, регистрации автозапуска службы Windows с именем "MyDB" и установки пароля root на 'secret':
mysql_install_db.exe --datadir=C:\db --service=MyDB --password=secret
Для запуска службы из командной строки:
sc start MyDB
Удаление службы и баз данных
Если вы запустили вашу СУБД как службу, то для полного удаления из командной строки используйте команды:
sc stop <ИМЯ_СЛУЖБЫ>
sc delete <ИМЯ_СЛУЖБЫ>
rmdir /s /q <ПУТЬ_ДО_ПАПКИ_БАЗ>
Добавить комментарий
Ваш e-mail не будет опубликован. Обязательные поля помечены *
|
{
"url": "https://apache-windows.ru/%D0%BA%D0%B0%D0%BA-%D1%83%D1%81%D1%82%D0%B0%D0%BD%D0%BE%D0%B2%D0%B8%D1%82%D1%8C-mariadb-7-4-%D0%B2-windows/",
"source_domain": "apache-windows.ru",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "45941",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MICZ56EQOBDSJD34HI7LKEI2ETEZUBVC",
"WARC-Concurrent-To": "<urn:uuid:27d80d8f-1deb-40cd-83db-513c491d517e>",
"WARC-Date": "2019-11-14T01:26:53Z",
"WARC-IP-Address": "185.26.122.38",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PP2EZZ5ITMIQDTD6KW33IV7KRXNFW3DU",
"WARC-Record-ID": "<urn:uuid:1350d8e8-4c09-42cd-a2c8-d1f016927796>",
"WARC-Target-URI": "https://apache-windows.ru/%D0%BA%D0%B0%D0%BA-%D1%83%D1%81%D1%82%D0%B0%D0%BD%D0%BE%D0%B2%D0%B8%D1%82%D1%8C-mariadb-7-4-%D0%B2-windows/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:becc2c2b-31e1-4069-a2c2-ecb088a1d4d6>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-221.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
37,
38,
134,
135,
341,
342,
386,
387,
530,
531,
815,
816,
956,
957,
1121,
1122,
1333,
1334,
1439,
1440,
1461,
1462,
1794,
1795,
1845,
1846,
2011,
2012,
2089,
2090,
2177,
2178,
2221,
2237,
2238,
2326,
2327,
2367,
2368,
2386,
2420,
2466,
2502,
2545,
2568,
2609,
2658,
2744,
2834,
2878,
2879,
3080,
3081,
3364,
3365,
3539,
3540,
3696,
3697,
3767,
3768,
3808,
3809,
3823,
3824,
3853,
3854,
3959,
3960,
3981,
4004,
4036,
4037,
4058,
4059
],
"line_end_idx": [
37,
38,
134,
135,
341,
342,
386,
387,
530,
531,
815,
816,
956,
957,
1121,
1122,
1333,
1334,
1439,
1440,
1461,
1462,
1794,
1795,
1845,
1846,
2011,
2012,
2089,
2090,
2177,
2178,
2221,
2237,
2238,
2326,
2327,
2367,
2368,
2386,
2420,
2466,
2502,
2545,
2568,
2609,
2658,
2744,
2834,
2878,
2879,
3080,
3081,
3364,
3365,
3539,
3540,
3696,
3697,
3767,
3768,
3808,
3809,
3823,
3824,
3853,
3854,
3959,
3960,
3981,
4004,
4036,
4037,
4058,
4059,
4120
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4120,
"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.01953125,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0403645783662796,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8033854365348816,
"rps_doc_frac_unique_words": 0.6094339489936829,
"rps_doc_mean_word_length": 6.377358436584473,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.0013020799960941076,
"rps_doc_unigram_entropy": 5.443493843078613,
"rps_doc_word_count": 530,
"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.007100590039044619,
"rps_doc_frac_chars_top_3gram": 0.005917159840464592,
"rps_doc_frac_chars_top_4gram": 0.010059170424938202,
"rps_doc_books_importance": -289.5114440917969,
"rps_doc_books_importance_length_correction": -289.5114440917969,
"rps_doc_openwebtext_importance": -198.473388671875,
"rps_doc_openwebtext_importance_length_correction": -198.473388671875,
"rps_doc_wikipedia_importance": -143.53245544433594,
"rps_doc_wikipedia_importance_length_correction": -143.53245544433594
},
"fasttext": {
"dclm": 0.8221662640571594,
"english": 0.00004279000131646171,
"fineweb_edu_approx": 2.532021999359131,
"eai_general_math": -0.000008940000043367036,
"eai_open_web_math": 0.12783300876617432,
"eai_web_code": 0.6939613819122314
}
}
|
{
"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": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,694,429,438,198,039,000
|
Insphpect
This tool is currently proof-of-concept. Your feedback and evaluation is valuable in helping to improve it and ensure its reports are meaninful.
Please click here to complete a short survey to tell us what you think. It should take less than 5 minutes and help further this research project!
Symfony\Component\Routing\Matcher\Dumper\StaticPrefixCollection
Detected issues
Issue Method Line number
Use of static methods string 198
Code
Click highlighted lines for details
<?php/* * This file is part of the Symfony package. * * (c) Fabien Potencier <fabien@symfony.com> * * For the full copyright and license information, please view the LICENSE * file that was distributed with this source code. */namespace Symfony\Component\Routing\Matcher\Dumper;use Symfony\Component\Routing\RouteCollection;/** * Prefix tree of routes preserving routes order. * * @author Frank de Jonge <info@frankdejonge.nl> * @author Nicolas Grekas <p@tchwork.com> * * @internal */class StaticPrefixCollection{ private $prefix; /** * @var string[] */ private $staticPrefixes = []; /** * @var string[] */ private $prefixes = []; /** * @var array[]|self[] */ private $items = []; public function __construct(string $prefix = '/') { $this->prefix = $prefix; } public function getPrefix(): string { return $this->prefix; } /** * @return array[]|self[] */ public function getRoutes(): array { return $this->items; } /** * Adds a route to a group. * * @param array|self $route */ public function addRoute(string $prefix, $route) { [$prefix, $staticPrefix] = $this->getCommonPrefix($prefix, $prefix); for ($i = \count($this->items) - 1; 0 <= $i; --$i) { $item = $this->items[$i]; [$commonPrefix, $commonStaticPrefix] = $this->getCommonPrefix($prefix, $this->prefixes[$i]); if ($this->prefix === $commonPrefix) { // the new route and a previous one have no common prefix, let's see if they are exclusive to each others if ($this->prefix !== $staticPrefix && $this->prefix !== $this->staticPrefixes[$i]) { // the new route and the previous one have exclusive static prefixes continue; } if ($this->prefix === $staticPrefix && $this->prefix === $this->staticPrefixes[$i]) { // the new route and the previous one have no static prefix break; } if ($this->prefixes[$i] !== $this->staticPrefixes[$i] && $this->prefix === $this->staticPrefixes[$i]) { // the previous route is non-static and has no static prefix break; } if ($prefix !== $staticPrefix && $this->prefix === $staticPrefix) { // the new route is non-static and has no static prefix break; } continue; } if ($item instanceof self && $this->prefixes[$i] === $commonPrefix) { // the new route is a child of a previous one, let's nest it $item->addRoute($prefix, $route); } else { // the new route and a previous one have a common prefix, let's merge them $child = new self($commonPrefix); [$child->prefixes[0], $child->staticPrefixes[0]] = $child->getCommonPrefix($this->prefixes[$i], $this->prefixes[$i]); [$child->prefixes[1], $child->staticPrefixes[1]] = $child->getCommonPrefix($prefix, $prefix); $child->items = [$this->items[$i], $route]; $this->staticPrefixes[$i] = $commonStaticPrefix; $this->prefixes[$i] = $commonPrefix; $this->items[$i] = $child; } return; } // No optimised case was found, in this case we simple add the route for possible // grouping when new routes are added. $this->staticPrefixes[] = $staticPrefix; $this->prefixes[] = $prefix; $this->items[] = $route; } /** * Linearizes back a set of nested routes into a collection. */ public function populateCollection(RouteCollection $routes): RouteCollection { foreach ($this->items as $route) { if ($route instanceof self) { $route->populateCollection($routes); } else { $routes->add(...$route); } } return $routes; } /** * Gets the full and static common prefixes between two route patterns. * * The static prefix stops at last at the first opening bracket. */ private function getCommonPrefix(string $prefix, string $anotherPrefix): array { $baseLength = \strlen($this->prefix); $end = min(\strlen($prefix), \strlen($anotherPrefix)); $staticLength = null; set_error_handler([__CLASS__, 'handleError']); for ($i = $baseLength; $i < $end && $prefix[$i] === $anotherPrefix[$i]; ++$i) { if ('(' === $prefix[$i]) { $staticLength = $staticLength ?? $i; for ($j = 1 + $i, $n = 1; $j < $end && 0 < $n; ++$j) { if ($prefix[$j] !== $anotherPrefix[$j]) { break 2; } if ('(' === $prefix[$j]) { ++$n; } elseif (')' === $prefix[$j]) { --$n; } elseif ('\\' === $prefix[$j] && (++$j === $end || $prefix[$j] !== $anotherPrefix[$j])) { --$j; break; } } if (0 < $n) { break; } if (('?' === ($prefix[$j] ?? '') || '?' === ($anotherPrefix[$j] ?? '')) && ($prefix[$j] ?? '') !== ($anotherPrefix[$j] ?? '')) { break; } $subPattern = substr($prefix, $i, $j - $i); if ($prefix !== $anotherPrefix && !preg_match('/^\(\[[^\]]++\]\+\+\)$/', $subPattern) && !preg_match('{(?<!'.$subPattern.')}', '')) { // sub-patterns of variable length are not considered as common prefixes because their greediness would break in-order matching break; } $i = $j - 1; } elseif ('\\' === $prefix[$i] && (++$i === $end || $prefix[$i] !== $anotherPrefix[$i])) { --$i; break; } } restore_error_handler(); if ($i < $end && 0b10 === (\ord($prefix[$i]) >> 6) && preg_match('//u', $prefix.' '.$anotherPrefix)) { do { // Prevent cutting in the middle of an UTF-8 characters --$i; } while (0b10 === (\ord($prefix[$i]) >> 6)); } return [substr($prefix, 0, $i), substr($prefix, 0, $staticLength ?? $i)]; }
Static methods
Summary of issues
• Tight Coupling
• Hidden dependencies
• Global state (if also using static variables)
Tight Coupling
Use of static methods always reduces flexibility by introducing tight coupling[1]. A static method tightly couples the calling code to the specific class the method exists in.
function totalAbs(double valuedouble value2) {
return
abs(value) + abs(value2);
}
Here, the method totalAbs has a dependency on the Math class and the .abs() method will always be called. Although for testing purposes this may not be a problem, the coupling reduces flexibility because the total method can only work with doubles/integers, as that's all the Math.abs() function can use. Although type coercion will allow the use of any primitive numeric type, these types have limitations. It's impossible to use another class such as BigInteger or a class for dealing with greater precision decimals or even alternative numbering systems such as Roman numerals.
The totalAbs function takes two doubles and converts them to their absolute values before adding them. This is inflexible because it only works with doubles. It's tied to doubles because that's what the Math.abs() static method requires. If, instead, using OOP an interface was created to handle any number that had this method:
interface Numeric {
public function
abs(): Numeric;
}
It would then be possible to rewrite the totalAbs method to work with any kind of number:
function totalAbs(Numeric valueNumeric value): Numeric {
return
value.abs() + value2.abs();
}
By removing the static method and using an instance method in its place the totalAbs method is now agnostic about the type of number it is dealing with. It could be called with any of the following (assuming they implement the Numeric interface)
totalAbs(new Integer(4), new Integer(-53));
totalAbs(new Double(34.4), new Integer(-2));
totalAbs(new BigInteger('123445454564765739878989343225778'), new Integer(2343));
totalAbs(new RomanNumeral('VII'), new RomanNumeral('CXV'));
Making the method reusable in a way that it wasn't when static methods were being used. By changing the static methods to instance methods, flexibility has been enhanced as the method can be used with any numeric type, not just numeric types that are supported by the Math.abs() method.
Broken encapsulation
Static methods also break encapsulation. Encapsulation is defined by Rogers[2] as:
the bundling of data with the methods that operate on that data
By passing the numeric value into the abs method, the data being operated on is being separated from the methods that operate on it, breaking encapsulation. Instead using num.abs() the data is encapsulated in the num instance and its type is not visible or relevant to the outside world. abs() will work on the data and work regardless of num's type, providing it implements the abs method.
This is a simple example, but applies to all static methods. Use of polymorphic instance methods that work on encapsulated data will always be more flexible than static method calls which can only ever deal with specific pre-defined types.
Further reading
Exceptions
The only exception to this rule is when a static method is used for object creation in place of the new keyword[3]. This is because the new keyword is already a static call. However, even here a non-static factory is often preferable for testing purposes[4][5].
References
1. Popov, N. (2014) Don't be STUPID: GRASP SOLID! [online]. Available from: https://nikic.github.io/2011/12/27/Dont-be-STUPID-GRASP-SOLID.html
2. Rogers, P. (2001) Encapsulation is not information hiding [online]. Available from: http://www.javaworld.com/article/2075271/core-java/encapsulation-is-not-information-hiding.html
3. Sonmez, J. (2010) Static Methods Will Shock You [online]. Available from: http://simpleprogrammer.com/2010/01/29/static-methods-will-shock-you/
4. Hevery, M. (2008) Static Methods are Death to Testability [online]. Available from: http://misko.hevery.com/2008/12/15/static-methods-are-death-to-testability/
5. Butler, T. (2013) Are Static Methods/Variables bad practice? [online]. Available from: https://r.je/static-methods-bad-practice.html
{ return str_contains($msg, 'Compilation failed: lookbehind assertion is not fixed length'); }}
|
{
"url": "https://insphpect.com/report/class/6123ea2893e21/Symfony%5CComponent%5CRouting%5CMatcher%5CDumper%5CStaticPrefixCollection",
"source_domain": "insphpect.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "77936",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UJVMDGYOXQWFTC2L3CXLTB6UF3BHRYRH",
"WARC-Concurrent-To": "<urn:uuid:bdfa9048-974e-459e-897b-9ef0bc226205>",
"WARC-Date": "2022-07-01T02:49:00Z",
"WARC-IP-Address": "51.89.132.147",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KYLEUD3ZJCQB4HJ2SBZUIST4PIX2437S",
"WARC-Record-ID": "<urn:uuid:8257f4ef-289d-4a22-8402-c722a3c0f482>",
"WARC-Target-URI": "https://insphpect.com/report/class/6123ea2893e21/Symfony%5CComponent%5CRouting%5CMatcher%5CDumper%5CStaticPrefixCollection",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:edff6efd-0d59-437d-ad56-1007f1d07687>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-203\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
10,
11,
156,
157,
304,
305,
369,
370,
386,
387,
412,
445,
446,
451,
452,
488,
489,
6979,
6980,
6995,
6996,
7014,
7015,
7034,
7058,
7108,
7109,
7124,
7125,
7301,
7302,
7304,
7351,
7363,
7389,
7391,
7392,
7973,
7974,
8303,
8304,
8325,
8346,
8362,
8364,
8365,
8455,
8456,
8514,
8526,
8554,
8556,
8557,
8803,
8804,
8806,
8850,
8851,
8896,
8897,
8979,
8980,
9040,
9041,
9328,
9329,
9350,
9351,
9434,
9435,
9499,
9500,
9891,
9892,
10132,
10133,
10149,
10150,
10161,
10162,
10424,
10425,
10436,
10437,
10582,
10767,
10916,
11081,
11219
],
"line_end_idx": [
10,
11,
156,
157,
304,
305,
369,
370,
386,
387,
412,
445,
446,
451,
452,
488,
489,
6979,
6980,
6995,
6996,
7014,
7015,
7034,
7058,
7108,
7109,
7124,
7125,
7301,
7302,
7304,
7351,
7363,
7389,
7391,
7392,
7973,
7974,
8303,
8304,
8325,
8346,
8362,
8364,
8365,
8455,
8456,
8514,
8526,
8554,
8556,
8557,
8803,
8804,
8806,
8850,
8851,
8896,
8897,
8979,
8980,
9040,
9041,
9328,
9329,
9350,
9351,
9434,
9435,
9499,
9500,
9891,
9892,
10132,
10133,
10149,
10150,
10161,
10162,
10424,
10425,
10436,
10437,
10582,
10767,
10916,
11081,
11219,
11314
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11314,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0.006363799795508385,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24297012388706207,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007908609695732594,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.41739895939826965,
"rps_doc_frac_unique_words": 0.4026086926460266,
"rps_doc_mean_word_length": 6.0591301918029785,
"rps_doc_num_sentences": 95,
"rps_doc_symbol_to_word_ratio": 0.0004393699928186834,
"rps_doc_unigram_entropy": 5.554137229919434,
"rps_doc_word_count": 1150,
"rps_doc_frac_chars_dupe_10grams": 0.024397239089012146,
"rps_doc_frac_chars_dupe_5grams": 0.06214122101664543,
"rps_doc_frac_chars_dupe_6grams": 0.04477611929178238,
"rps_doc_frac_chars_dupe_7grams": 0.04477611929178238,
"rps_doc_frac_chars_dupe_8grams": 0.04477611929178238,
"rps_doc_frac_chars_dupe_9grams": 0.036165330559015274,
"rps_doc_frac_chars_top_2gram": 0.01679104007780552,
"rps_doc_frac_chars_top_3gram": 0.00947187002748251,
"rps_doc_frac_chars_top_4gram": 0.008036740124225616,
"rps_doc_books_importance": -1013.2314453125,
"rps_doc_books_importance_length_correction": -1013.2314453125,
"rps_doc_openwebtext_importance": -513.794189453125,
"rps_doc_openwebtext_importance_length_correction": -513.794189453125,
"rps_doc_wikipedia_importance": -462.18646240234375,
"rps_doc_wikipedia_importance_length_correction": -462.18646240234375
},
"fasttext": {
"dclm": 0.890232264995575,
"english": 0.6290879845619202,
"fineweb_edu_approx": 2.6188082695007324,
"eai_general_math": 0.38259947299957275,
"eai_open_web_math": 0.16603481769561768,
"eai_web_code": 0.7798645496368408
}
}
|
{
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,170,597,470,005,245,000
|
8-Bit Software
The BBC and Master Computer Public Domain Library
Back to 8BS Or Back to Disassembly
Page Last Altered:
ADF9 TOP
Submitted by Steve Fewell
This routine is called when the 'TO'-Token is encountered in the program.
However, 'TO' itself is not handled by this routine, instead the 'FOR' routine will check that the
'TO'-Token occurs at the requested position, etc...
The BASIC Keyword 'TOP' does not have it's own token, as it consists of the 'TO' token followed by the letter 'P'.
Firstly, this routine checks whether the character after the 'TO'-Token is a 'P' or not.
If the character is not a 'P' then a 'No such variable error' is generated as the 'TO' BASIC Keyword
is only valid within a 'FOR' statement.
Otherwise, the keyword we have is 'TOP'.
So, increment the BASIC Text Pointer B offset to point to the character after the 'P'.
Set A to &12 (The LSB of the TOP address).
Set Y to &13 (The MSB of the TOP address).
Call routine &AE1A to set the IWA to the value of Y * 256 + A.
Description:
Disassembly for the TOP routine
ADF9 200 C8 INY
ADFA 177 025 B1 19 LDA (&19),Y
ADFC P 201 080 C9 50 CMP#&50
ADFE 208 140 D0 8C BNE -116 --> &AD8C No such variable error
AE00 230 027 E6 1B INC &1B
AE02 165 018 A5 12 LDA &12
AE04 164 019 A4 13 LDY &13
AE06 128 018 80 12 BRA 18 --> &AE1A Set IWA to 16-bit value
Back to 8BS
Or
|
{
"url": "http://www.8bs.com/basic/basic4-adf9.htm",
"source_domain": "www.8bs.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "4536",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RRHYPGOX7X4HOKC7OWZGRZZJWP2VTHIV",
"WARC-Concurrent-To": "<urn:uuid:2be1a34a-6266-476f-bf63-73588dc257cc>",
"WARC-Date": "2017-10-21T21:19:28Z",
"WARC-IP-Address": "217.151.102.21",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:B7QYMBN7VCFHQDDYLOQ65FZIS3I6RAKE",
"WARC-Record-ID": "<urn:uuid:83a27204-7e7a-4dae-9004-1d35465f29a2>",
"WARC-Target-URI": "http://www.8bs.com/basic/basic4-adf9.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4f753d10-56ac-46d2-bed4-d968d9855e2f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-157-174-116.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,
16,
17,
67,
68,
103,
104,
105,
124,
125,
134,
135,
161,
235,
334,
386,
501,
502,
591,
692,
732,
733,
774,
861,
904,
947,
1010,
1011,
1024,
1025,
1026,
1027,
1059,
1060,
1078,
1111,
1140,
1203,
1232,
1261,
1290,
1352,
1353,
1355,
1356,
1357,
1370,
1373
],
"line_end_idx": [
1,
16,
17,
67,
68,
103,
104,
105,
124,
125,
134,
135,
161,
235,
334,
386,
501,
502,
591,
692,
732,
733,
774,
861,
904,
947,
1010,
1011,
1024,
1025,
1026,
1027,
1059,
1060,
1078,
1111,
1140,
1203,
1232,
1261,
1290,
1352,
1353,
1355,
1356,
1357,
1370,
1373,
1374
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1374,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2620481848716736,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1957831233739853,
"rps_doc_frac_lines_end_with_ellipsis": 0.020408159121870995,
"rps_doc_frac_no_alph_words": 0.2981927692890167,
"rps_doc_frac_unique_words": 0.5642023086547852,
"rps_doc_mean_word_length": 3.867704391479492,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.006024099886417389,
"rps_doc_unigram_entropy": 4.5839762687683105,
"rps_doc_word_count": 257,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01810864917933941,
"rps_doc_frac_chars_top_3gram": 0.01810864917933941,
"rps_doc_frac_chars_top_4gram": 0.02213280089199543,
"rps_doc_books_importance": -162.05572509765625,
"rps_doc_books_importance_length_correction": -162.0542449951172,
"rps_doc_openwebtext_importance": -90.56355285644531,
"rps_doc_openwebtext_importance_length_correction": -90.56355285644531,
"rps_doc_wikipedia_importance": -77.83021545410156,
"rps_doc_wikipedia_importance_length_correction": -77.11949920654297
},
"fasttext": {
"dclm": 0.06581305712461472,
"english": 0.8084071278572083,
"fineweb_edu_approx": 2.091186046600342,
"eai_general_math": 0.0086898198351264,
"eai_open_web_math": 0.4777892827987671,
"eai_web_code": 0.003139439970254898
}
}
|
{
"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.162",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,221,917,565,533,682,000
|
A few spawned runs crash
Dear FLUKA team
I run FLUKA in a cluster utilizing a few hundred cores. In one particular run, I got a few crashes that I could not understand the reason for. Looking at one temporary directory, I can see the following files (I replaced the filename part of it with *).
drwxrwx---+ 2 sunil cels 16384 May 10 13:32 .
drwxrwx---+ 34 sunil cels 1048576 May 10 13:05 ..
-rw-rw----+ 1 sunil cels 46 May 9 21:39 *_171001.log
-rw-rw----+ 1 sunil cels 15873 May 9 21:39 *_171.inp
-rw-rw----+ 1 sunil cels 82 May 9 21:39 *_68001.err
-rw-rw----+ 1 sunil cels 622 May 9 21:39 *_68001.log
-rw-rw----+ 1 sunil cels 65534 May 9 21:39 *_68001.out
-rw-rw----+ 1 sunil cels 15873 May 9 21:39 *_68.inp
-rw-rw----+ 1 sunil cels 0 May 9 21:39 core
-rw-rw----+ 1 sunil cels 0 May 9 21:39 fort.1
lrwxrwxrwx 1 sunil cels 40 May 9 21:39 fort.11 ->*_68001.out
lrwxrwxrwx 1 sunil cels 40 May 9 21:39 fort.15 -> *_68001.err
-rw-rw----+ 1 sunil cels 42563 May 9 21:39 fort.16
lrwxrwxrwx 1 sunil cels 40 May 9 21:39 fort.2 -> *_171002
-rw-rw----+ 1 sunil cels 0 May 9 21:39 .timer.out
I see two input files (!) the 68th and 171th spawns and two log files pertaining to the these. They both have the same error message.
At line 31 of file main/flabrt.f (unit = 15)
Fortran runtime error: Cannot open file 'fort.15': Too many levels of symbolic links
Error termination. Backtrace:
#0 0x2b301beb23fa in data_transfer_init
at /blues/gpfs/software/centos7/spack-latest/var/spack/stage/gcc-9.2.0-pkmzcztqna4f2m7hxvqjrrrzpqyclnt3/gcc-9.2.0/libgfortran/io/transfer.c:2869
#1 0x54231f in flabrt_
at main/flabrt.f:31
#2 0x490276 in fl64rd_
at rnd/flrm64.f:210
#3 0x593b51 in rnread_
at rnd/rnread.f:26
#4 0x404711 in flukam_
at main/flukam.f:1565
#5 0x402f50 in fluka
at main/fluka.f:77
#6 0x402f50 in main
at /shared/src/usflmd.inc:15
The out file has this message at the end.
***** Next control card ***** RANDOMIZ 1.000 171.0 0.000 0.000 0.000 0.000
**** No Random file available !!!!!! ****
Abort called from FLRM64 reason NO RANDOM FILE Run stopped!
STOP NO RANDOM FILE
These happened with about 10 runs out of 180. I thought FLUKA writes to a temporary folder with _00 suffix in the name if there exists a folder with the name that it was about to write to, to prevent two input files ending up in the same temporary directory. Is that what was happening here, or is it something else?
Many thanks for all your help.
Sunil
I see that you submitted a run using the rfluka and a filename containing the star “*” character, which creates a link to a file pattern *_68001.err instead of a input_68001.err leading to a crash
There is no * in the input file name. Sorry for the confusion by introducing it, which was meant as a wildcard to show the long filename that I removed before posting here. Here is what is inside the temporary folder for another crash.
(base) [sunil@beboplogin2 fluka_31659]$ ls -al
total 741
drwxrwx---+ 2 sunil cels 16384 May 11 12:09 .
drwxrwx---+ 3 sunil cels 262144 May 11 19:35 ..
-rw-rw----+ 1 sunil cels 622 May 11 12:09 11V_Li_stand_plugged_176001.log
-rw-rw----+ 1 sunil cels 17688 May 11 12:09 11V_Li_stand_plugged_176.inp
-rw-rw----+ 1 sunil cels 622 May 11 12:09 11V_Li_stand_plugged_69001.log
-rw-rw----+ 1 sunil cels 74014 May 11 12:09 11V_Li_stand_plugged_69001.out
-rw-rw----+ 1 sunil cels 17688 May 11 12:09 11V_Li_stand_plugged_69.inp
-rw-rw----+ 1 sunil cels 0 May 11 12:09 core
lrwxrwxrwx 1 sunil cels 77 May 11 12:09 fort.1 -> /lcrc/project/RadPhyRP/ATLAS/nuCAR/11VnuCARIBU/ran11V_Li_stand_plugged_176001
lrwxrwxrwx 1 sunil cels 30 May 11 12:09 fort.11 -> 11V_Li_stand_plugged_69001.out
lrwxrwxrwx 1 sunil cels 30 May 11 12:09 fort.15 -> 11V_Li_stand_plugged_69001.err
-rw-rw----+ 1 sunil cels 48586 May 11 12:09 fort.16
lrwxrwxrwx 1 sunil cels 30 May 11 12:09 fort.2 -> ran11V_Li_stand_plugged_176002
-rw-rw----+ 1 sunil cels 0 May 11 12:09 .timer.out
(base) [sunil@beboplogin2 fluka_31659]$
This is also strange, I see 2 .inp and .log files inside without any .err. Normally rfluka should copy only the master input.
Could it be that due to many multiple runs you have some that run on the same temporary fluka_XXX folder?
Vasilis,
Yes, I agree, its strange and that is what is perplexing to me.
Could it be that due to many multiple runs you have some that run on the same temporary fluka_XXX folder?
It appears that is what is happening here unless the cluster/slurm is doing something. But isn’t that scenario supposed to not happen, because FLUKA renames a target folder with a suffix “_00” or something like that when there exists a folder with the intended folder number/name ? I have seen FLUKA doing that as well.
Normally it should check for _00, _01, … until it finds an non existing directory, and it should abord if there are 100dirs with the same name
The check is done in rfluka lines 232-249,
Ηowever there is no semaphore locking, so we might have a race condition
@sunil if what I suspect is the cause of your problem, one easy solution from your side would be to submit each run in a separated folder
|
{
"url": "https://fluka-forum.web.cern.ch/t/a-few-spawned-runs-crash/3162",
"source_domain": "fluka-forum.web.cern.ch",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "34775",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BM5LFPCSMTCEVPUNAELAUUNPMOLM4VAJ",
"WARC-Concurrent-To": "<urn:uuid:58a95190-f56b-4bce-8535-df83fef28d59>",
"WARC-Date": "2022-07-06T19:42:26Z",
"WARC-IP-Address": "137.138.76.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KC65FERF76EE2GBOKIGU5OBQB46GUI7N",
"WARC-Record-ID": "<urn:uuid:95d2d6fa-5d12-41ec-802f-90ca15b6ed4a>",
"WARC-Target-URI": "https://fluka-forum.web.cern.ch/t/a-few-spawned-runs-crash/3162",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:232218bd-7b42-4d8c-9028-2a3d7d3faec0>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-112\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,
25,
26,
42,
43,
297,
298,
347,
397,
457,
514,
573,
632,
691,
747,
799,
853,
922,
992,
1047,
1113,
1171,
1172,
1306,
1307,
1352,
1437,
1467,
1508,
1661,
1685,
1713,
1737,
1765,
1789,
1816,
1840,
1870,
1892,
1919,
1940,
1977,
1978,
2020,
2021,
2130,
2131,
2175,
2236,
2257,
2258,
2575,
2606,
2612,
2613,
2810,
2811,
3047,
3048,
3095,
3105,
3152,
3200,
3277,
3351,
3427,
3503,
3576,
3626,
3759,
3846,
3933,
3986,
4072,
4128,
4168,
4169,
4295,
4401,
4402,
4411,
4475,
4476,
4582,
4583,
4903,
4904,
5047,
5090,
5091,
5164,
5165
],
"line_end_idx": [
25,
26,
42,
43,
297,
298,
347,
397,
457,
514,
573,
632,
691,
747,
799,
853,
922,
992,
1047,
1113,
1171,
1172,
1306,
1307,
1352,
1437,
1467,
1508,
1661,
1685,
1713,
1737,
1765,
1789,
1816,
1840,
1870,
1892,
1919,
1940,
1977,
1978,
2020,
2021,
2130,
2131,
2175,
2236,
2257,
2258,
2575,
2606,
2612,
2613,
2810,
2811,
3047,
3048,
3095,
3105,
3152,
3200,
3277,
3351,
3427,
3503,
3576,
3626,
3759,
3846,
3933,
3986,
4072,
4128,
4168,
4169,
4295,
4401,
4402,
4411,
4475,
4476,
4582,
4583,
4903,
4904,
5047,
5090,
5091,
5164,
5165,
5302
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5302,
"ccnet_original_nlines": 91,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2281988561153412,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023634880781173706,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4009779989719391,
"rps_doc_frac_unique_words": 0.38195303082466125,
"rps_doc_mean_word_length": 4.656365871429443,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0.006519970018416643,
"rps_doc_unigram_entropy": 5.085358619689941,
"rps_doc_word_count": 809,
"rps_doc_frac_chars_dupe_10grams": 0.044597819447517395,
"rps_doc_frac_chars_dupe_5grams": 0.21024687588214874,
"rps_doc_frac_chars_dupe_6grams": 0.1990974247455597,
"rps_doc_frac_chars_dupe_7grams": 0.16724184155464172,
"rps_doc_frac_chars_dupe_8grams": 0.16724184155464172,
"rps_doc_frac_chars_dupe_9grams": 0.044597819447517395,
"rps_doc_frac_chars_top_2gram": 0.06928589940071106,
"rps_doc_frac_chars_top_3gram": 0.0663658082485199,
"rps_doc_frac_chars_top_4gram": 0.06689672917127609,
"rps_doc_books_importance": -518.035400390625,
"rps_doc_books_importance_length_correction": -518.035400390625,
"rps_doc_openwebtext_importance": -304.0448303222656,
"rps_doc_openwebtext_importance_length_correction": -304.0448303222656,
"rps_doc_wikipedia_importance": -318.17974853515625,
"rps_doc_wikipedia_importance_length_correction": -318.17974853515625
},
"fasttext": {
"dclm": 0.020221170037984848,
"english": 0.79084312915802,
"fineweb_edu_approx": 1.3730343580245972,
"eai_general_math": 0.6945593953132629,
"eai_open_web_math": 0.3230251669883728,
"eai_web_code": 0.5912718772888184
}
}
|
{
"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": "530.14",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Physics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,039,529,669,954,659,300
|
IoT and Hacking – Why Code Auditing is a Must?
Page Loader
IoT and Hacking – Why Code Auditing is a Must?
IoT and Hacking
Computing has taken over the world for almost over a century now. Computer systems have taken over critical tasks that were previously performed manually. But then new ways of exploiting these flaws were also invented by some. The more the computers got involved in performing our day to day tasks, risk associated with computing also grew. Major exploitations in computer systems started to surface in 1980s which were followed by major attacks like Stuxnet.
Latest Trends
In 2014, latest trends in technology appeared and one of the new concepts IoT (Internet of things) was introduced. IoT is a concept where most if not all the things that we use in our daily lives like cars, TVs, ACs, watches, fridges, washing machines etc are all ‘smart’ and connected. Instructions to these smart and connected devices can be given from another device like cellular phone which is connected to same network or over the internet. What IoT is doing is basically converting non-computing devices into computing devices. As these new small devices are not our main computing devices, people are not paying much attention towards their security. This leaves the connected devices vulnerable and easy to exploit. Let’s look at some of the main reasons of hacks associated with IoT devices.
Usability
IoT products are mass market products. Users can vary from tech experts to a layman. Due to this reason usability and setup process of such products has to very simple. This is a tradeoff that has to be made by vendors, to keep the usability simple otherwise security will be compromised. A simple example of usability verses security is setting up password for a new account. If a user is forced to setup a complex password it may put him off especially a non-technical user. So in order to keep the first impression of product being user friendly often basic security is compromised.
Insecure Interface
IoT products are small and are coming at a rapid pace since they range from bulbs to ACs to cars. Most of the products are small and therefore security is not considered an important issue. These small products are mostly controlled by web applications or mobile applications. These applications and web interfaces are weak in terms of security due to multiple factors. Some of the common issues found in them are:
• Users don’t get locked out of their accounts after a number of failed login attempts.
• They don’t offer protection against cross-site scripting attacks and SQL injections.
• Attackers simply need to trick a user behind the router and firewall to click a link.
• If the web interface is vulnerable, it will give the attacker access to web management interface.
• These products are mostly connected to home Wi-Fi to work, and these Wi-Fi connections are often weak in terms of security and hence are quite easy to be hacked.
IoT Products and Security
IoT products are small products. The manufacturer’s ultimate goal is to mass produce them and sell them to obtain profits. Security professionals are a rare commodity to come by. Security analysis is a time taking process and it also requires funds to be performed. This can be better understood by the example of a thermostat manufacturer. Let’s say a company is manufacturing thermostats for over 50 years. These thermostats were never connected and user hardly ever interacted with the thermostat. Now the same manufacturer has started producing connected thermostats and user can interact with it using the mobile application over the network which is most likely connected to internet as well. Now the same manufacturer has to look for ways to secure his products. Finding security professionals is also a difficult task.
Software Update
Millions of software have been made up until now and it won’t be wrong to say that all of them are buggy. Be it an OS or a small application they do have bugs in them. New software versions are released periodically; these new versions bring additional functionality along with bug fixes. Small vendors do not pay attention to the bugs that are left in existing products. There are various reasons for it. One is that most of them work on sell and forget policy. Once they manufacture a batch of product the only goal is to sell that batch and often quality is compromised in the process. Taking the stress of producing new models frequently, old products are forgotten very quickly and updates to old products are seldom provided.
Encryption
The connected devices are mostly transmitting data from IoT devices to the vendor’s server. This also includes sensitive user data, like fitness and health data and other similar data. These IoT devices are often found guilty of transmitting data to cloud in form of plain text. These devices at times implement faulty SSL due to which sensitive data like login credentials, tokens, and Wi-Fi passwords are exposed. When transmitting sensitive information from devices like smart phones to cloud, end-to-end encryption must be implemented. This is an important step which is not implemented and over looked many a times.
Faulty Hardware
Manufacturers developing IoT products are also under pressure to make them look good. Developing more and more sleek and better looking devices often force manufacturers to produce hardware that is buggy. Some manufacturers neglect hardware bugs. They can allow attackers to hard reboot the devices and their corresponding hotspots. Hackers can get in the middle and fool the mobile app looking to establish a connection. If the connection succeeds, the attacker can grab the username and password of the user’s Wi-Fi network.
Users
In all IoT devices and hacking stories there is a very important link that is often neglected in discussion. User can also be described as the weakest link in security. Users do not bother updating these IoT devices. Why bother updating a device when it is working (apparently) perfectly? Users often don’t bother changing default passwords for administrator consoles. All the efforts of manufacturers and developers can go in vain in a moment if user does not apply updates and patches.
Most IoT vulnerabilities are new to the cyber-security industry. So far, we’ve seen experiments and proofs of concept, but it’s just a matter of time until attackers start mining crypto-currencies via connected refrigerators or until smart TVs are locked by ransom ware. That’s why, going forward, security must be the top priority of every IoT application.
Subscribe to our newsletter and Get Our Latest Posts Instantly!
Sorry, Comments are closed!
Talk to Us
Subscribe to Us
Subscribe to our newsletter and Get Our Latest Posts Instantly!
|
{
"url": "https://www.kualitatem.com/blog/IoT-and-hacking-why-code-auditing-is-a-must",
"source_domain": "www.kualitatem.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "152700",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RDACM6IN6JRIEG7P4XA7LSQTTSJ2VRNQ",
"WARC-Concurrent-To": "<urn:uuid:315f3ae7-b78c-4582-a6b9-1595d0244851>",
"WARC-Date": "2023-02-07T18:50:09Z",
"WARC-IP-Address": "34.208.107.185",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WCO2XFS6GS7SCWJ65ZSYLH5MV4AX7CWC",
"WARC-Record-ID": "<urn:uuid:d04ea052-b624-4494-9d06-e83a51054efe>",
"WARC-Target-URI": "https://www.kualitatem.com/blog/IoT-and-hacking-why-code-auditing-is-a-must",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:720e954b-ff41-49de-b872-385cc3747f7d>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-16\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
47,
48,
60,
61,
108,
109,
125,
126,
586,
587,
601,
602,
1404,
1405,
1415,
1416,
2002,
2003,
2022,
2023,
2438,
2439,
2529,
2618,
2708,
2810,
2976,
2977,
3003,
3004,
3831,
3832,
3848,
3849,
4581,
4582,
4593,
4594,
5215,
5216,
5232,
5233,
5760,
5761,
5767,
5768,
6256,
6257,
6615,
6616,
6680,
6681,
6709,
6710,
6721,
6722,
6723,
6739,
6740
],
"line_end_idx": [
47,
48,
60,
61,
108,
109,
125,
126,
586,
587,
601,
602,
1404,
1405,
1415,
1416,
2002,
2003,
2022,
2023,
2438,
2439,
2529,
2618,
2708,
2810,
2976,
2977,
3003,
3004,
3831,
3832,
3848,
3849,
4581,
4582,
4593,
4594,
5215,
5216,
5232,
5233,
5760,
5761,
5767,
5768,
6256,
6257,
6615,
6616,
6680,
6681,
6709,
6710,
6721,
6722,
6723,
6739,
6740,
6803
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6803,
"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.4244094491004944,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003149610012769699,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10551180690526962,
"rps_doc_frac_unique_words": 0.4001782536506653,
"rps_doc_mean_word_length": 4.93137264251709,
"rps_doc_num_sentences": 72,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.45144510269165,
"rps_doc_word_count": 1122,
"rps_doc_frac_chars_dupe_10grams": 0.0321706086397171,
"rps_doc_frac_chars_dupe_5grams": 0.04879812151193619,
"rps_doc_frac_chars_dupe_6grams": 0.0321706086397171,
"rps_doc_frac_chars_dupe_7grams": 0.0321706086397171,
"rps_doc_frac_chars_dupe_8grams": 0.0321706086397171,
"rps_doc_frac_chars_dupe_9grams": 0.0321706086397171,
"rps_doc_frac_chars_top_2gram": 0.017892640084028244,
"rps_doc_frac_chars_top_3gram": 0.010121090337634087,
"rps_doc_frac_chars_top_4gram": 0.005060549825429916,
"rps_doc_books_importance": -540.4979248046875,
"rps_doc_books_importance_length_correction": -540.4979248046875,
"rps_doc_openwebtext_importance": -311.3189697265625,
"rps_doc_openwebtext_importance_length_correction": -311.3189697265625,
"rps_doc_wikipedia_importance": -218.7227783203125,
"rps_doc_wikipedia_importance_length_correction": -218.7227783203125
},
"fasttext": {
"dclm": 0.03669708967208862,
"english": 0.9635686278343201,
"fineweb_edu_approx": 2.672673225402832,
"eai_general_math": 0.08665890246629715,
"eai_open_web_math": 0.16291266679763794,
"eai_web_code": 0.032082319259643555
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "13",
"label": "News (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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,009,225,977,084,762,000
|
Speed up WebAPI on Microsoft Azure
By Ugo Lattanzi on Jan. 20th , 2015 in WebAPI | comments
Share On Google Share On Facebook Share On Twitter
One of my favorite features of ASP.NET WebAPI is the opportunity to run your code outside Internet Information Service (IIS). I don’t have anything against IIS, in fact my tough matches with this tweet:
But System.Web is really a problem and, in some cases, IIS pipeline is too complicated for a simple REST call.
we fix one bug and open seven new one (unnamed Microsoft employee on System.Web)
Another important thing I like is cloud computing and Microsoft Aure in this case. In fact, if you want to run your APIs outside IIS and you have to scale on Microsoft Azure, maybe this article could be helpful.
Azure offers different ways to host your APIs and scale them. The most common solutions are WebSites or Cloud Services.
Unfortunately we can’t use Azure WebSites because everything there runs on IIS (more info here) so, we have to use the Cloud Services but the question here is Web Role or Worker Role?
The main difference among Web Role and Worker Role is that the first one runs on IIS, the domain is configured on the webserver and the port 80 is opened by default; the second one is a process (.exe file to be clear) that runs on a “closed” environment.
To remain consistent with what is written above, we have to use the Worker Role instead of the Web Role so, let’s start to create it following the steps below:
Now that the Azure project and Workrole project are ready, It's important to open the port 80 on the worker role (remember that by default the worker role is a close environment).
Finally we have the environment ready, It’s time to install few WebAPI packages and write some code.
PM> Install-Package Microsoft.AspNet.WebApi.OwinSelfHost
Now add OWIN startup class
and finally configure WebAPI Routing and its OWIN Middleware
using System.Web.Http;
using DemoWorkerRole;
using Microsoft.Owin;
using Owin;
[assembly: OwinStartup(typeof (Startup))]
namespace DemoWorkerRole
{
public class Startup
{
public void Configuration(IAppBuilder app)
{
var config = new HttpConfiguration();
// Routing
config.Routes.MapHttpRoute(
"Default",
"api/{controller}/{id}",
new {id = RouteParameter.Optional});
//Configure WebAPI
app.UseWebApi(config);
}
}
}
and create a demo controller
using System.Web.Http;
namespace DemoWorkerRole.APIs
{
public class DemoController : ApiController
{
public string Get(string id)
{
return string.Format("The parameter value is {0}", id);
}
}
}
Till now nothing special, the app is ready and we have just to configure the worker role that is the WorkerRole.cs file created by Visual Studio.
What we have to do here, is to read the configuration from Azure (we have to map a custom domain for example) and start the web server.
To do that, first add the domain on the cloud service configuration following the steps below:
finally the worker role:
using System;
using System.Diagnostics;
using System.Net;
using System.Threading;
using System.Threading.Tasks;
using Microsoft.Owin.Hosting;
using Microsoft.WindowsAzure.ServiceRuntime;
namespace DemoWorkerRole
{
public class WorkerRole : RoleEntryPoint
{
private readonly CancellationTokenSource cancellationTokenSource = new CancellationTokenSource();
private readonly ManualResetEvent runCompleteEvent = new ManualResetEvent(false);
private IDisposable app;
public override void Run()
{
Trace.TraceInformation("WorkerRole is running");
try
{
RunAsync(cancellationTokenSource.Token).Wait();
}
finally
{
runCompleteEvent.Set();
}
}
public override bool OnStart()
{
// Set the maximum number of concurrent connections
ServicePointManager.DefaultConnectionLimit = 12;
string baseUri = String.Format("{0}://{1}:{2}", RoleEnvironment.GetConfigurationSettingValue("protocol"),
RoleEnvironment.GetConfigurationSettingValue("domain"),
RoleEnvironment.GetConfigurationSettingValue("port"));
Trace.TraceInformation(String.Format("Starting OWIN at {0}", baseUri), "Information");
try
{
app = WebApp.Start<Startup>(new StartOptions(url: baseUri));
}
catch (Exception e)
{
Trace.TraceError(e.ToString());
throw;
}
bool result = base.OnStart();
Trace.TraceInformation("WorkerRole has been started");
return result;
}
public override void OnStop()
{
Trace.TraceInformation("WorkerRole is stopping");
cancellationTokenSource.Cancel();
runCompleteEvent.WaitOne();
if (app != null)
{
app.Dispose();
}
base.OnStop();
Trace.TraceInformation("WorkerRole has stopped");
}
private async Task RunAsync(CancellationToken cancellationToken)
{
// TODO: Replace the following with your own logic.
while (!cancellationToken.IsCancellationRequested)
{
//Trace.TraceInformation("Working");
await Task.Delay(1000);
}
}
}
}
we are almost done, the last step is to configure the right execution context into the ServiceDefinistion.csdef
<?xml version="1.0" encoding="utf-8"?>
<ServiceDefinition name="imperugo.demo.azure.webapi" xmlns="http://schemas.microsoft.com/ServiceHosting/2008/10/ServiceDefinition" schemaVersion="2014-06.2.4">
<WorkerRole name="DemoWorkerRole" vmsize="Small">
<Runtime executionContext="elevated" />
<Imports>
<Import moduleName="Diagnostics" />
</Imports>
<Endpoints>
<InputEndpoint name="Http" protocol="http" port="80" localPort="80" />
</Endpoints>
<ConfigurationSettings>
<Setting name="protocol" />
<Setting name="domain" />
<Setting name="port" />
</ConfigurationSettings>
</WorkerRole>
</ServiceDefinition>
Here the important part is Runtime node. That part is really important because we are using the HttpListener to read the incoming message from the Web and that requires elevated privileges.
Now we are up & running using WebAPi hosted on a Cloud Service without using IIS.
The demo code is available here.
Have fun.
|
{
"url": "http://tostring.it/2015/01/20/speedup-webapi-on-microsoft-azure/",
"source_domain": "tostring.it",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "47165",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UXXQFNNDP7FS4XDWHRUVUZSBEZ7UWW2G",
"WARC-Concurrent-To": "<urn:uuid:89a2f542-846f-4f3b-ad1e-d298d1435784>",
"WARC-Date": "2018-08-17T21:28:30Z",
"WARC-IP-Address": "192.30.252.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YIIG5KEKVQKRALR6AIVQSGUOHDRLRBDC",
"WARC-Record-ID": "<urn:uuid:5ed91b3d-b9e6-4629-ad8d-fe84ab39a697>",
"WARC-Target-URI": "http://tostring.it/2015/01/20/speedup-webapi-on-microsoft-azure/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:084059b4-f1ad-4202-b544-59be9c813cd7>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-146-222-91.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
35,
36,
93,
94,
145,
146,
349,
350,
461,
462,
543,
544,
756,
757,
877,
878,
1062,
1063,
1318,
1319,
1479,
1480,
1660,
1661,
1762,
1763,
1820,
1821,
1848,
1849,
1910,
1911,
1934,
1956,
1978,
1990,
1991,
2033,
2034,
2059,
2061,
2086,
2092,
2143,
2153,
2203,
2204,
2227,
2267,
2294,
2335,
2388,
2389,
2420,
2455,
2465,
2471,
2473,
2474,
2503,
2504,
2527,
2528,
2558,
2560,
2608,
2614,
2651,
2661,
2729,
2739,
2745,
2747,
2748,
2894,
2895,
3031,
3032,
3127,
3128,
3153,
3154,
3168,
3194,
3212,
3236,
3266,
3296,
3341,
3342,
3367,
3369,
3414,
3420,
3526,
3616,
3617,
3650,
3651,
3686,
3696,
3757,
3758,
3774,
3788,
3852,
3866,
3886,
3900,
3940,
3954,
3964,
3965,
4004,
4014,
4078,
4139,
4140,
4258,
4330,
4401,
4402,
4501,
4502,
4518,
4532,
4609,
4623,
4655,
4669,
4717,
4740,
4754,
4755,
4797,
4798,
4865,
4866,
4893,
4903,
4904,
4942,
4952,
5014,
5015,
5061,
5101,
5102,
5131,
5145,
5176,
5190,
5191,
5218,
5219,
5281,
5291,
5292,
5365,
5375,
5439,
5502,
5516,
5569,
5609,
5623,
5633,
5639,
5641,
5642,
5754,
5755,
5794,
5954,
6008,
6056,
6074,
6122,
6141,
6161,
6244,
6265,
6297,
6337,
6375,
6411,
6444,
6462,
6483,
6484,
6674,
6675,
6757,
6758,
6791,
6792
],
"line_end_idx": [
35,
36,
93,
94,
145,
146,
349,
350,
461,
462,
543,
544,
756,
757,
877,
878,
1062,
1063,
1318,
1319,
1479,
1480,
1660,
1661,
1762,
1763,
1820,
1821,
1848,
1849,
1910,
1911,
1934,
1956,
1978,
1990,
1991,
2033,
2034,
2059,
2061,
2086,
2092,
2143,
2153,
2203,
2204,
2227,
2267,
2294,
2335,
2388,
2389,
2420,
2455,
2465,
2471,
2473,
2474,
2503,
2504,
2527,
2528,
2558,
2560,
2608,
2614,
2651,
2661,
2729,
2739,
2745,
2747,
2748,
2894,
2895,
3031,
3032,
3127,
3128,
3153,
3154,
3168,
3194,
3212,
3236,
3266,
3296,
3341,
3342,
3367,
3369,
3414,
3420,
3526,
3616,
3617,
3650,
3651,
3686,
3696,
3757,
3758,
3774,
3788,
3852,
3866,
3886,
3900,
3940,
3954,
3964,
3965,
4004,
4014,
4078,
4139,
4140,
4258,
4330,
4401,
4402,
4501,
4502,
4518,
4532,
4609,
4623,
4655,
4669,
4717,
4740,
4754,
4755,
4797,
4798,
4865,
4866,
4893,
4903,
4904,
4942,
4952,
5014,
5015,
5061,
5101,
5102,
5131,
5145,
5176,
5190,
5191,
5218,
5219,
5281,
5291,
5292,
5365,
5375,
5439,
5502,
5516,
5569,
5609,
5623,
5633,
5639,
5641,
5642,
5754,
5755,
5794,
5954,
6008,
6056,
6074,
6122,
6141,
6161,
6244,
6265,
6297,
6337,
6375,
6411,
6444,
6462,
6483,
6484,
6674,
6675,
6757,
6758,
6791,
6792,
6801
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6801,
"ccnet_original_nlines": 196,
"rps_doc_curly_bracket": 0.007645930163562298,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2456597238779068,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014756940305233002,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3168402910232544,
"rps_doc_frac_unique_words": 0.4855072498321533,
"rps_doc_mean_word_length": 6.582608699798584,
"rps_doc_num_sentences": 85,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.34421443939209,
"rps_doc_word_count": 690,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.006164690013974905,
"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.015411710366606712,
"rps_doc_frac_chars_top_3gram": 0.01431087963283062,
"rps_doc_frac_chars_top_4gram": 0.004843680188059807,
"rps_doc_books_importance": -511.127685546875,
"rps_doc_books_importance_length_correction": -511.127685546875,
"rps_doc_openwebtext_importance": -291.637939453125,
"rps_doc_openwebtext_importance_length_correction": -291.637939453125,
"rps_doc_wikipedia_importance": -161.8590850830078,
"rps_doc_wikipedia_importance_length_correction": -161.8590850830078
},
"fasttext": {
"dclm": 0.01988065056502819,
"english": 0.6885648965835571,
"fineweb_edu_approx": 2.42602276802063,
"eai_general_math": 0.568463921546936,
"eai_open_web_math": 0.13606196641921997,
"eai_web_code": 0.5429739356040955
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-968,747,226,469,177,100
|
Ask Different is a question and answer site for power users of Apple hardware and software. Join them; it only takes a minute:
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
I just came to a different country and suddenly I am having strange issues with my macbook air 2012's wifi. It seems to detect the wifi networks without issue but refuses to load any webpages or connect to dropbox, app store etc. I tried pinging some websites then I tried pinging 10.10.10.1 but i had no success. It works fine on all the other devices in the home and when I checked the dhcp client list on the router it listed the mac and its ip address. Does anybody have any ideas?
share|improve this question
Just out of interest, what country? – Buscar웃 May 15 '13 at 12:27
I had my MBA in USA + Germany + Spain...and it works fine so I am tempted to say it is not country but the ISP. – Buscar웃 May 15 '13 at 12:41
Just to be sure: You tried to connect do different wifis? Or do you have the issue only on one single wifi network? – cyphorious May 15 '13 at 13:27
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Browse other questions tagged or ask your own question.
|
{
"url": "http://apple.stackexchange.com/questions/91412/internet-connection-problem-wifi-working-fine-but-unable-to-ping-anything",
"source_domain": "apple.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "71424",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FQOF36H2KWNQVCG7NVYLX4U5GGCBOYPM",
"WARC-Concurrent-To": "<urn:uuid:615780c1-9a22-4c63-bb4f-2cf34af73b7d>",
"WARC-Date": "2016-07-23T11:15:44Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MYIINKUH55QQ6AKLFPTYV3BIOXAVOBR7",
"WARC-Record-ID": "<urn:uuid:ecade31c-7459-4c29-b0c6-0d776f90ad16>",
"WARC-Target-URI": "http://apple.stackexchange.com/questions/91412/internet-connection-problem-wifi-working-fine-but-unable-to-ping-anything",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6b6ecd7b-89a3-41c7-9b35-79cac0bd88d2>"
},
"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,
127,
128,
136,
157,
189,
213,
268,
269,
755,
756,
784,
789,
855,
860,
1002,
1007,
1156,
1157,
1169,
1170,
1172,
1180,
1181,
1259,
1260
],
"line_end_idx": [
127,
128,
136,
157,
189,
213,
268,
269,
755,
756,
784,
789,
855,
860,
1002,
1007,
1156,
1157,
1169,
1170,
1172,
1180,
1181,
1259,
1260,
1315
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1315,
"ccnet_original_nlines": 25,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3993174135684967,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03412969037890434,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20477816462516785,
"rps_doc_frac_unique_words": 0.5894308686256409,
"rps_doc_mean_word_length": 4.077235698699951,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.003412970108911395,
"rps_doc_unigram_entropy": 4.721374034881592,
"rps_doc_word_count": 246,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03788634017109871,
"rps_doc_frac_chars_dupe_6grams": 0.03788634017109871,
"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.02093718945980072,
"rps_doc_frac_chars_top_3gram": 0.02093718945980072,
"rps_doc_frac_chars_top_4gram": 0.02691924013197422,
"rps_doc_books_importance": -97.23551177978516,
"rps_doc_books_importance_length_correction": -97.23551177978516,
"rps_doc_openwebtext_importance": -56.49957275390625,
"rps_doc_openwebtext_importance_length_correction": -56.49957275390625,
"rps_doc_wikipedia_importance": -48.00410079956055,
"rps_doc_wikipedia_importance_length_correction": -48.00402069091797
},
"fasttext": {
"dclm": 0.3437487483024597,
"english": 0.9365068078041077,
"fineweb_edu_approx": 1.1336508989334106,
"eai_general_math": 0.0002505200100131333,
"eai_open_web_math": 0.06359505653381348,
"eai_web_code": 0
}
}
|
{
"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": "005.457",
"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": "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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,500,274,256,289,251,000
|
Ask Your Question
1
Unable to attach cinder volumes created from volume image or snapshot
asked 2015-07-20 11:01:52 -0600
DylanH gravatar image
updated 2015-07-20 12:57:10 -0600
Problem: We are not able to mount any cinder volumes which are not created new with out sourcing an image or source volume. If We do source a volume or image we are unable to attach them to an instance The cinder API seems to throw the following error.
2015-07-20 10:33:18.291 16325 ERROR oslo.messaging._drivers.common [req-42eb46b1-51f4-46d8-8fe0-52e1eb4b493e 54ec776d99044bd6be27ebbc53458107 63436ca0d2b24921b60a7ac984db555a - - -] Returning exception Bad or unexpected response from the storage volume backend API: Unable to fetch connection information from backend: md5() argument 1 must be string or buffer, not None to caller
2015-07-20 10:33:18.291 16325 ERROR oslo.messaging._drivers.common [req-42eb46b1-51f4-46d8-8fe0-52e1eb4b493e 54ec776d99044bd6be27ebbc53458107 63436ca0d2b24921b60a7ac984db555a - - -] ['Traceback (most recent call last):\n', ' File "/usr/lib/python2.7/site-packages/oslo/messaging/rpc/dispatcher.py", line 134, in _dispatch_and_reply\n incoming.message))\n', ' File "/usr/lib/python2.7/site-packages/oslo/messaging/rpc/dispatcher.py", line 177, in _dispatch\n return self._do_dispatch(endpoint, method, ctxt, args)\n', ' File "/usr/lib/python2.7/site-packages/oslo/messaging/rpc/dispatcher.py", line 123, in _do_dispatch\n result = getattr(endpoint, method)(ctxt, **new_args)\n', ' File "/usr/lib/python2.7/site-packages/osprofiler/profiler.py", line 105, in wrapper\n return f(*args, **kwargs)\n', ' File "/usr/lib/python2.7/site-packages/cinder/volume/manager.py", line 902, in initialize_connection\n raise exception.VolumeBackendAPIException(data=err_msg)\n', 'VolumeBackendAPIException: Bad or unexpected response from the storage volume backend API: Unable to fetch connection information from backend: md5() argument 1 must be string or buffer, not None\n']
Currently running Juno on RDO with a glusterfs backend. Unsure how to resolve this. This was working on icehouse.
Also wondering if this is related to the following.
https://bugs.launchpad.net/cinder/+bug/1441050 (https://bugs.launchpad.net/cinder/+bu...)
I am unable to upgrade to liberty at this moment. Which looks like this bug refers to. Any help would be great
Provider location does not seem to be being set with the gluster drive after a fork of volume from a volume copy or image copy.
MariaDB [cinder]> SELECT provider_location FROM volumes WHERE provider_location IS NULL;
+-------------------+
| provider_location |
+-------------------+
| NULL |
| NULL |
| NULL |
| NULL |
| NULL |
| NULL |
| NULL |
| NULL |
After updating the provider_location it then works. MariaDB [cinder]> SELECT provider_location FROM volumes;
+---------------------+
| provider_location |
+---------------------+
| gfs-primary:/cinder |
| gfs-primary:/cinder |
| gfs-primary:/cinder |
| gfs-primary:/cinder |
| gfs-primary:/cinder |
| gfs-primary:/cinder |
| gfs-primary:/cinder |
| gfs-primary:/cinder |
| gfs-primary:/cinder |
| gfs-primary:/cinder |
edit retag flag offensive close merge delete
2 answers
Sort by » oldest newest most voted
0
answered 2017-11-17 06:49:53 -0600
Deepa gravatar image
edit flag offensive delete link more
0
answered 2015-07-21 10:22:31 -0600
DylanH gravatar image
We resolved this internally. Had to update the gluster.py cinder driver for Juno. This was not returning the correct results to the cinder manager to update the provider_location.
Below is what needed to be changed in the gluster.py
@@ -170,7 +170,7 @@
@utils.synchronized('glusterfs', external=False)
def create_cloned_volume(self, volume, src_vref):
"""Creates a clone of the specified volume."""
- self._create_cloned_volume(volume, src_vref)
+ return self._create_cloned_volume(volume, src_vref)
@utils.synchronized('glusterfs', external=False)
def create_volume(self, volume):
@@ -188,7 +188,7 @@
@utils.synchronized('glusterfs', external=False)
def create_volume_from_snapshot(self, volume, snapshot):
- self._create_volume_from_snapshot(volume, snapshot)
+ return self._create_volume_from_snapshot(volume, snapshot)
def _copy_volume_from_snapshot(self, snapshot, volume, volume_size):
"""Copy data from snapshot to destination volume.
edit flag offensive delete link more
Your Answer
Please start posting anonymously - your entry will be published after you log in or create a new account.
Add Answer
Get to know Ask OpenStack
Resources for moderators
Question Tools
1 follower
Stats
Asked: 2015-07-20 11:01:52 -0600
Seen: 1,287 times
Last updated: Nov 17 '17
|
{
"url": "https://ask.openstack.org/en/question/78756/unable-to-attach-cinder-volumes-created-from-volume-image-or-snapshot/",
"source_domain": "ask.openstack.org",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "72119",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SLRK22B3L4QUD7OBJIBUNAWBBJGCRRH3",
"WARC-Concurrent-To": "<urn:uuid:3128d1b5-4d06-4bc9-b55b-5b51073d1178>",
"WARC-Date": "2020-02-22T19:15:52Z",
"WARC-IP-Address": "104.239.149.165",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:QSWRWNVJ2U3NPMUWG4BELIWFKUIR6YJZ",
"WARC-Record-ID": "<urn:uuid:34ea4439-782e-4689-b435-fd7027c6a209>",
"WARC-Target-URI": "https://ask.openstack.org/en/question/78756/unable-to-attach-cinder-volumes-created-from-volume-image-or-snapshot/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b4cf3984-d358-4881-b8b8-e5d17e7b5e9f>"
},
"warc_info": "isPartOf: CC-MAIN-2020-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-136.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,
18,
20,
21,
91,
92,
124,
125,
147,
148,
182,
183,
436,
437,
822,
823,
2006,
2007,
2121,
2122,
2174,
2175,
2265,
2266,
2377,
2378,
2506,
2507,
2596,
2618,
2640,
2662,
2684,
2706,
2728,
2750,
2772,
2794,
2816,
2838,
2839,
2948,
2949,
2973,
2997,
3021,
3045,
3069,
3093,
3117,
3141,
3165,
3189,
3213,
3237,
3261,
3306,
3307,
3317,
3318,
3353,
3355,
3356,
3391,
3392,
3413,
3450,
3452,
3453,
3488,
3489,
3511,
3512,
3692,
3693,
3746,
3747,
3767,
3820,
3874,
3929,
3983,
4044,
4045,
4098,
4135,
4155,
4156,
4209,
4270,
4331,
4399,
4400,
4473,
4531,
4568,
4569,
4581,
4582,
4688,
4689,
4700,
4701,
4727,
4728,
4753,
4754,
4769,
4770,
4781,
4782,
4788,
4789,
4822,
4823,
4841,
4842
],
"line_end_idx": [
18,
20,
21,
91,
92,
124,
125,
147,
148,
182,
183,
436,
437,
822,
823,
2006,
2007,
2121,
2122,
2174,
2175,
2265,
2266,
2377,
2378,
2506,
2507,
2596,
2618,
2640,
2662,
2684,
2706,
2728,
2750,
2772,
2794,
2816,
2838,
2839,
2948,
2949,
2973,
2997,
3021,
3045,
3069,
3093,
3117,
3141,
3165,
3189,
3213,
3237,
3261,
3306,
3307,
3317,
3318,
3353,
3355,
3356,
3391,
3392,
3413,
3450,
3452,
3453,
3488,
3489,
3511,
3512,
3692,
3693,
3746,
3747,
3767,
3820,
3874,
3929,
3983,
4044,
4045,
4098,
4135,
4155,
4156,
4209,
4270,
4331,
4399,
4400,
4473,
4531,
4568,
4569,
4581,
4582,
4688,
4689,
4700,
4701,
4727,
4728,
4753,
4754,
4769,
4770,
4781,
4782,
4788,
4789,
4822,
4823,
4841,
4842,
4866
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4866,
"ccnet_original_nlines": 116,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15542522072792053,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021505380049347878,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.42326492071151733,
"rps_doc_frac_unique_words": 0.49298596382141113,
"rps_doc_mean_word_length": 7.0220441818237305,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.0009775200160220265,
"rps_doc_unigram_entropy": 5.156570911407471,
"rps_doc_word_count": 499,
"rps_doc_frac_chars_dupe_10grams": 0.07591324299573898,
"rps_doc_frac_chars_dupe_5grams": 0.2614155411720276,
"rps_doc_frac_chars_dupe_6grams": 0.2614155411720276,
"rps_doc_frac_chars_dupe_7grams": 0.21746574342250824,
"rps_doc_frac_chars_dupe_8grams": 0.2083333283662796,
"rps_doc_frac_chars_dupe_9grams": 0.12157534062862396,
"rps_doc_frac_chars_top_2gram": 0.08219178020954132,
"rps_doc_frac_chars_top_3gram": 0.10958904027938843,
"rps_doc_frac_chars_top_4gram": 0.1278538852930069,
"rps_doc_books_importance": -518.7550048828125,
"rps_doc_books_importance_length_correction": -518.7550048828125,
"rps_doc_openwebtext_importance": -303.88922119140625,
"rps_doc_openwebtext_importance_length_correction": -303.88922119140625,
"rps_doc_wikipedia_importance": -219.35140991210938,
"rps_doc_wikipedia_importance_length_correction": -219.35140991210938
},
"fasttext": {
"dclm": 0.28436195850372314,
"english": 0.6599226593971252,
"fineweb_edu_approx": 1.2807854413986206,
"eai_general_math": 0.004634859971702099,
"eai_open_web_math": 0.05714983120560646,
"eai_web_code": 0.10208696126937866
}
}
|
{
"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": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,277,601,116,621,413,000
|
(**************************************************************************) (* *) (* Copyright (C) 2010-2011 *) (* François Bobot *) (* Jean-Christophe Filliâtre *) (* Claude Marché *) (* Andrei Paskevich *) (* *) (* This software is free software; you can redistribute it and/or *) (* modify it under the terms of the GNU Library General Public *) (* License version 2.1, with the special exception on linking *) (* described in file LICENSE. *) (* *) (* This software is distributed in the hope that it will be useful, *) (* but WITHOUT ANY WARRANTY; without even the implied warranty of *) (* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. *) (* *) (**************************************************************************) (* type lexing_loc = Lexing.position * Lexing.position *) open Lexing let current_offset = ref 0 let reloc p = { p with pos_cnum = p.pos_cnum + !current_offset } let set_file file lb = lb.Lexing.lex_curr_p <- { lb.Lexing.lex_curr_p with Lexing.pos_fname = file } let transfer_loc lb_from lb_to = lb_to.lex_start_p <- lb_from.lex_start_p; lb_to.lex_curr_p <- lb_from.lex_curr_p (*s Error locations. *) let finally ff f x = let y = try f x with e -> ff (); raise e in ff (); y open Format (*s Line number *) (* let report_line fmt l = fprintf fmt "%s:%d:" l.pos_fname l.pos_lnum *) type position = string * int * int * int let user_position fname lnum cnum1 cnum2 = (fname,lnum,cnum1,cnum2) let get loc = loc let dummy_position = ("",0,0,0) let join (f1,l1,b1,e1) (f2,_,b2,e2) = assert (f1 = f2); (f1,l1,b1,e1+e2-b2) let extract (b,e) = let f = b.pos_fname in let l = b.pos_lnum in let fc = b.pos_cnum - b.pos_bol in let lc = e.pos_cnum - b.pos_bol in (f,l,fc,lc) let compare = Pervasives.compare let equal = Pervasives.(=) let hash = Hashtbl.hash let gen_report_position fmt (f,l,b,e) = fprintf fmt "File \"%s\", line %d, characters %d-%d" f l b e let report_position fmt = fprintf fmt "%a:@\n" gen_report_position (* located exceptions *) exception Located of position * exn let try1 loc f x = try f x with Located _ as e -> raise e | e -> raise (Located (loc, e)) let try2 loc f x y = try f x y with Located _ as e -> raise e | e -> raise (Located (loc, e)) let try3 loc f x y z = try f x y z with Located _ as e -> raise e | e -> raise (Located (loc, e)) let try4 loc f x y z t = try f x y z t with Located _ as e -> raise e | e -> raise (Located (loc, e)) let error ?loc e = match loc with | None -> raise e | Some loc -> raise (Located (loc, e)) (* located messages *) exception Message of string let errorm ?loc f = let buf = Buffer.create 512 in let fmt = Format.formatter_of_buffer buf in Format.kfprintf (fun _ -> Format.pp_print_flush fmt (); let s = Buffer.contents buf in Buffer.clear buf; error ?loc (Message s)) fmt f let () = Exn_printer.register (fun fmt exn -> match exn with | Located (loc,e) -> fprintf fmt "%a%a" report_position loc Exn_printer.exn_printer e | Message s -> fprintf fmt "%s" s | _ -> raise exn)
|
{
"url": "https://gitlab.inria.fr/why3/why3/-/raw/7d681280124a69da5135eed6225f7d93b60e2d1f/src/util/loc.ml?inline=false",
"source_domain": "gitlab.inria.fr",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "4563",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3BEG6EGCDX6IPFVH2BSRU3UKIL3XEONP",
"WARC-Concurrent-To": "<urn:uuid:6fceefae-d9bb-41ba-aae4-6b64288518e0>",
"WARC-Date": "2022-07-07T04:15:16Z",
"WARC-IP-Address": "128.93.193.23",
"WARC-Identified-Payload-Type": "application/mathematica",
"WARC-Payload-Digest": "sha1:ZVKWCTMLJFL6XFVYXQCJVWJENHWGTL7I",
"WARC-Record-ID": "<urn:uuid:c7fb8b7b-77df-4d04-951c-bc917c78e11a>",
"WARC-Target-URI": "https://gitlab.inria.fr/why3/why3/-/raw/7d681280124a69da5135eed6225f7d93b60e2d1f/src/util/loc.ml?inline=false",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:209e489b-3aaa-4f89-bf67-665f9e9aab0b>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-153\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
2965
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2965,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.0013490699930116534,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2626538872718811,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016415869817137718,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.38303694128990173,
"rps_doc_frac_unique_words": 0.4411027729511261,
"rps_doc_mean_word_length": 4.694235801696777,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.555618762969971,
"rps_doc_word_count": 399,
"rps_doc_frac_chars_dupe_10grams": 0.08542445302009583,
"rps_doc_frac_chars_dupe_5grams": 0.10144153982400894,
"rps_doc_frac_chars_dupe_6grams": 0.08542445302009583,
"rps_doc_frac_chars_dupe_7grams": 0.08542445302009583,
"rps_doc_frac_chars_dupe_8grams": 0.08542445302009583,
"rps_doc_frac_chars_dupe_9grams": 0.08542445302009583,
"rps_doc_frac_chars_top_2gram": 0.010678060352802277,
"rps_doc_frac_chars_top_3gram": 0.009610249660909176,
"rps_doc_frac_chars_top_4gram": 0.04271223023533821,
"rps_doc_books_importance": -351.4905090332031,
"rps_doc_books_importance_length_correction": -351.4905090332031,
"rps_doc_openwebtext_importance": -181.45021057128906,
"rps_doc_openwebtext_importance_length_correction": -181.45021057128906,
"rps_doc_wikipedia_importance": -160.86721801757812,
"rps_doc_wikipedia_importance_length_correction": -160.86721801757812
},
"fasttext": {
"dclm": 0.3363851308822632,
"english": 0.6506284475326538,
"fineweb_edu_approx": 2.5259921550750732,
"eai_general_math": 0.9969169497489929,
"eai_open_web_math": 0.4154924154281616,
"eai_web_code": 0.8106147646903992
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,094,913,337,051,939,500
|
By Duleepa Wijayawardhana • May 14, 2010
Context Matters: Relationships in Social Media
The contexts of a relationship, whether it is online or offline, matter greatly. This might seem quite an obvious statement, but it's something to be aware of as you wander around the web and join communities, whether it be Facebook, Twitter or even our own Empire Avenue. The context in any relationship matters. Be wary of what that context implies when next you click "Add Friend" or indeed "Buy" on Empire Avenue!
A couple of weeks ago, as we were putting the final touches of moving Empire Avenue from out of the Closed Beta, we decided to switch from Facebook's RESTful API to the new Graph API. Kudos to the folks at Facebook; the Graph API is cleaner, better documented, and overall one of the easier I've personally had to implement. But the Graph API has a flaw, and it is not code based, but a human flaw. Facebook, the company, wants to change the very fundamentals of what it means to be social and what it means to have a relationship online.
Personally, regardless of Empire Avenue, I am not convinced that what Facebook is implying and trying to do is a good thing. In fact, quite the opposite, and it has ramifications for you, your privacy and more.
When you start a relationship with someone, the context in which you meet them matters. For example, I have many BioWare and MySQL friends from when I worked at those two companies. These friends were made in the context of those companies and the work we were doing at the time. There will always be that common context when we interact, no matter where or when. This isn't rocket science; it's just normal common sense. Basically, we call these "social circles."
Now, for the most part, these social circles don’t mix any way meaningful because one context is usually out of place with another.
Let's take this concept and apply it to web sites and social media sites. Ask the question of the context in which you join any particular service. I would hazard a guess that the context with which you join a site like Facebook permanently colours your perception of what that site offers you. For example, for me LinkedIn is a place to store my resume and connect with business associates. Facebook was initially introduced to me by my close friends in Newfoundland and Montreal, and it still revolves around connecting with friends. Twitter was introduced to me as a way to reach community for MySQL, and that's what it has remained.
This is very important. It means that I expect these services to embody elements which allow that context to function. The moment the context changes, the more likely that I will leave. It doesn't matter that I bring my status updates over from one to the other; it's who I reach, what my audience is and who I expect to talk to that matters. Simply put, each site has a social circle, network and a context for me. The relationship you have with each site will be different for you, but you will see the similarity.
Now, Facebook wants you to give up the context. All social relationships online must be equal. They want you to take the context in which you joined Facebook and make it the same on a multitude of services. This has advantages, but it comes at a price. If, for example, you join a site within the context of gambling, do you want your data to suddenly be available to your Parent Teacher Association web application? Not every context ought to be mixed.
Empire Avenue understands the context in which we want you to join and participate; we are very up front about it! We want you to join within the context of value – to you, your networks and your community. Find people and content that otherwise would not be available to you. We are creating "value relationships." Sure you can buy your friends, but we want you to reap the benefits of developing value relationships in a real and meaningful way.
For sure, Eaves (our virtual currency) are free, but they are limited! Think on the influence that people have and the value they may create for you by being active every day when you decide to buy virtual currency. In addition, we allow you to choose the contexts that you want to bring into Empire Avenue. Choose carefully; it could be worth real exchangeable capital for you, and certainly it will mean real social and reputation currency as well. We’re working on a number of other ways to encourage contextual interaction with others, and of course, to ensure that you’re being rewarded for your efforts within whichever social circles you contribute to.
Want an invite to Empire Avenue? Message us on Twitter and Facebook.
Disclaimer: Our owners, writers, and/or guest post authors may or may not have a vested interest in any of the above projects and businesses. None of the content on this blog is investment advice nor is it a replacement for advice from a certified financial planner.
Comments
|
{
"url": "https://play.empire.kred/blog/2010/05/14/context-matters-relationships-in-social-media",
"source_domain": "play.empire.kred",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "35786",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y5EL3JNWFTH6GZDMG6W7RSFHMFPIZKHI",
"WARC-Concurrent-To": "<urn:uuid:cca6fce0-cdfe-4915-be78-1dc6fc818f06>",
"WARC-Date": "2019-04-21T16:39:18Z",
"WARC-IP-Address": "104.17.129.180",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WN72I3OTYUERYTESHTR3PW4ZXHAZANTO",
"WARC-Record-ID": "<urn:uuid:53fb1627-a798-4a51-b10a-50ad42f09f8b>",
"WARC-Target-URI": "https://play.empire.kred/blog/2010/05/14/context-matters-relationships-in-social-media",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2b43338f-411c-4a9d-8741-58c21a0bee78>"
},
"warc_info": "isPartOf: CC-MAIN-2019-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-229-41-121.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,
41,
42,
89,
90,
508,
509,
1048,
1049,
1260,
1261,
1726,
1727,
1859,
1860,
2497,
2498,
3015,
3016,
3470,
3471,
3919,
3920,
4580,
4581,
4650,
4651,
4652,
4919,
4920
],
"line_end_idx": [
41,
42,
89,
90,
508,
509,
1048,
1049,
1260,
1261,
1726,
1727,
1859,
1860,
2497,
2498,
3015,
3016,
3470,
3471,
3919,
3920,
4580,
4581,
4650,
4651,
4652,
4919,
4920,
4928
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4928,
"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.4965174198150635,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014925369992852211,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12835821509361267,
"rps_doc_frac_unique_words": 0.40715110301971436,
"rps_doc_mean_word_length": 4.5247979164123535,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.2133331298828125,
"rps_doc_word_count": 867,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.022941630333662033,
"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.02803977020084858,
"rps_doc_frac_chars_top_3gram": 0.015294419601559639,
"rps_doc_frac_chars_top_4gram": 0.01733366958796978,
"rps_doc_books_importance": -394.6439514160156,
"rps_doc_books_importance_length_correction": -394.6439514160156,
"rps_doc_openwebtext_importance": -245.47128295898438,
"rps_doc_openwebtext_importance_length_correction": -245.47128295898438,
"rps_doc_wikipedia_importance": -205.09921264648438,
"rps_doc_wikipedia_importance_length_correction": -205.09921264648438
},
"fasttext": {
"dclm": 0.025716250762343407,
"english": 0.9673829078674316,
"fineweb_edu_approx": 1.2720489501953125,
"eai_general_math": 0.09983385354280472,
"eai_open_web_math": 0.13397717475891113,
"eai_web_code": 0.05653458833694458
}
}
|
{
"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": "302.3",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,167,407,169,929,407,000
|
Return to Level1Techs.com
A compilation of slightly totally insane GCC ricer flags
funny
#1
Quite a while ago, I went over the full GCC documentation of the --param settings, in an effort to try and find some magical setting to make a certain program go faster. I ended up with the ridiculous set you see below, recompiled the project and the speedup was a big fat zero percent.
Ricer settings indeed.
But at least in my case nothing broke, so here they are, mostly having a theme of letting the compiler use all the RAM and CPU time it wants.
Maybe there is some program out there, that would benefit from these, so if you are in a “why the hell not?” mood, you are welcome to try them.
–param max-crossjump-edges=100000 --param max-delay-slot-insn-search=100000 --param max-delay-slot-live-search=100000 --param max-gcse-memory=2000000000 --param max-pending-list-length=100000 --param max-modulo-backtrack-attempts=100000 --param large-function-growth=100000 --param inline-unit-growth=100000 --param ipcp-unit-growth=100000 --param large-stack-frame-growth=1000000 --param max-early-inliner-iterations=1000 --param max-hoist-depth=1000 --param max-tail-merge-comparisons=1000 --param max-tail-merge-iterations=1000 --param iv-consider-all-candidates-bound=1000000 --param iv-max-considered-uses=1000000 --param scev-max-expr-size=100000 --param scev-max-expr-complexity=100000 --param max-iterations-to-track=1000 --param max-cse-path-length=100000 --param max-cse-insns=1000000 --param max-reload-search-insns=100000 --param max-cselib-memory-locations=100000 --param max-sched-ready-insns=100000 --param max-sched-region-blocks=100000 --param max-pipeline-region-blocks=100000 --param max-sched-region-insns=100000 --param max-pipeline-region-insns=100000 --param selsched-max-lookahead=100000 --param selsched-max-sched-times=10000 --param selsched-insns-to-rename=1000 --param max-partial-antic-length=1000000000 --param sccvn-max-scc-size=10000000 --param sccvn-max-alias-queries-per-access=100000 --param ira-max-loops-num=10000 --param ira-max-conflict-table-size=10000 --param loop-invariant-max-bbs-in-loop=10000000 --param loop-max-datarefs-for-datadeps=100000 --param max-vartrack-size=100000 --param max-vartrack-expr-depth=100000 --param ipa-cp-value-list-size=10000 --param ipa-max-agg-items=10000 --param max-slsr-cand-scan=10000
#2
@AdminDev @Kat
Get in here. GCC stuff.
#3
You want execution/run time to go faster or you want compilation to go faster?
#4
The goal was generating the fastest possible executable, without any regard for compilation time.
#5
:joy:
using flags in GCC is like running around naked high on drugs in a minefield. The further you go from default, the less tested all of it is and the more subtle bugs you can expect to blow up in your face. Wouldn’t recommend lol
#6
Yeah, for regular usage I use something like this:
g++ -O3 -std=c++14 -march=<whatever> -flto -fno-exceptions -fno-rtti -fno-unwind-tables
Fairly standard, except the disablement of RTTI and exception handling.
#7
gcc -Wall -Wextra -Wshadow -pedantic -std=c11 is my default
I add -O2 when doing “release” builds
#8
Oh god… WHY?!
#9
why what?
#10
If you’re so desperate for performance consider writing some of your program in assembly :stuck_out_tongue:
#11
I heared that so many times from people who should know better, I get vietnam flashbacks when someone says that…
#12
Yeah, I looked up the inline ASM syntax for GCC once, recoiled in horror and nausea, and decided to never touch that. The AT&T style is garbage by itself, but nooo, they had to make it even worse.
#13
So much this.
You may get 1-2 percent if you’re lucky with ricer flags at the cost of throwing the well known behaviour of the code under “standard” settings out of the window.
The amount of time you spend fucking with ricer compiler flags will not net you anything.
Use the flags the developer put in their make file. They probably know what’s best for their code better than you do.
#14
No love for -Os ?
#15
-Os is usually far worse than O2/O3, disables way too many things, there might be a couple rare cases where it it is faster due to being able to fit the entire hot code into the caches (L1i and µop), but by and large it is just for highly memory/storage constrained situations, like AVRs and tiny ARM SoCs
#16
Oh snap! That will go right into my cringe comp CFLAGS and CXXFLAGS on make.conf!
|
{
"url": "https://forum.level1techs.com/t/a-compilation-of-slightly-totally-insane-gcc-ricer-flags/136618",
"source_domain": "forum.level1techs.com",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "25309",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:45Q74XNUCF7U36G4TEVDSO4YVHKYPDN7",
"WARC-Concurrent-To": "<urn:uuid:5b4962c4-94fd-4473-ac49-7ddb4d19836f>",
"WARC-Date": "2019-03-21T19:54:53Z",
"WARC-IP-Address": "104.25.104.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZDLS67M3VVQVQP2GBKEQ3Y2WFF6TQV6T",
"WARC-Record-ID": "<urn:uuid:f22700b3-a439-40a5-b850-2ff2e5448421>",
"WARC-Target-URI": "https://forum.level1techs.com/t/a-compilation-of-slightly-totally-insane-gcc-ricer-flags/136618",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:31ce9ee2-6398-49c9-ab05-c47d7e78510b>"
},
"warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-146-115-99.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,
26,
27,
84,
85,
91,
92,
95,
96,
383,
406,
548,
692,
693,
2354,
2355,
2356,
2359,
2360,
2375,
2376,
2400,
2401,
2402,
2405,
2406,
2485,
2486,
2487,
2490,
2491,
2589,
2590,
2591,
2594,
2595,
2601,
2602,
2830,
2831,
2832,
2835,
2836,
2887,
2975,
3047,
3048,
3049,
3052,
3053,
3113,
3114,
3152,
3153,
3154,
3157,
3158,
3172,
3173,
3174,
3177,
3178,
3188,
3189,
3190,
3194,
3195,
3303,
3304,
3305,
3309,
3310,
3423,
3424,
3425,
3429,
3430,
3627,
3628,
3629,
3633,
3634,
3648,
3649,
3812,
3813,
3903,
3904,
4022,
4023,
4024,
4028,
4029,
4047,
4048,
4049,
4053,
4054,
4360,
4361,
4362,
4366,
4367
],
"line_end_idx": [
26,
27,
84,
85,
91,
92,
95,
96,
383,
406,
548,
692,
693,
2354,
2355,
2356,
2359,
2360,
2375,
2376,
2400,
2401,
2402,
2405,
2406,
2485,
2486,
2487,
2490,
2491,
2589,
2590,
2591,
2594,
2595,
2601,
2602,
2830,
2831,
2832,
2835,
2836,
2887,
2975,
3047,
3048,
3049,
3052,
3053,
3113,
3114,
3152,
3153,
3154,
3157,
3158,
3172,
3173,
3174,
3177,
3178,
3188,
3189,
3190,
3194,
3195,
3303,
3304,
3305,
3309,
3310,
3423,
3424,
3425,
3429,
3430,
3627,
3628,
3629,
3633,
3634,
3648,
3649,
3812,
3813,
3903,
3904,
4022,
4023,
4024,
4028,
4029,
4047,
4048,
4049,
4053,
4054,
4360,
4361,
4362,
4366,
4367,
4448
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4448,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24569356441497803,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024478690698742867,
"rps_doc_frac_lines_end_with_ellipsis": 0.009708739817142487,
"rps_doc_frac_no_alph_words": 0.3563010096549988,
"rps_doc_frac_unique_words": 0.5879310369491577,
"rps_doc_mean_word_length": 5.936206817626953,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.01631912961602211,
"rps_doc_unigram_entropy": 5.336734294891357,
"rps_doc_word_count": 580,
"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.004356670193374157,
"rps_doc_frac_chars_top_3gram": 0.005808889865875244,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -546.8240966796875,
"rps_doc_books_importance_length_correction": -546.8240966796875,
"rps_doc_openwebtext_importance": -300.1784362792969,
"rps_doc_openwebtext_importance_length_correction": -300.1784362792969,
"rps_doc_wikipedia_importance": -213.75848388671875,
"rps_doc_wikipedia_importance_length_correction": -213.75848388671875
},
"fasttext": {
"dclm": 0.17705130577087402,
"english": 0.7720077037811279,
"fineweb_edu_approx": 1.3305320739746094,
"eai_general_math": 0.29730987548828125,
"eai_open_web_math": 0.24299412965774536,
"eai_web_code": 0.3246335983276367
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,710,645,885,195,160,800
|
00rrk2l.07xbm97.co - 00rrk2l | Dedicated or Not?
00rrk2l.07xbm97.co has multiple IP addresses, IP's like 52.4.89.177, 54.85.218.41, 54.236.189.177, 18.211.19.121.
The report you ran today at 10:21 PM on August 15, 2018 will have more information about these.
Learn more about what dedicated hosting and shared hosting is, and which one 00rrk2l.07xbm97.co might be using.
Advertisements
There is more than one IP address in existence for 00rrk2l.07xbm97.co we have found.
Please click on the 00rrk2l.07xbm97.co IP that you wish to view hosting estimation for.
What Is Dedicated Hosting?
Dedicated web hosting, sometimes called a dedicated host, managed host, or dedicated server, is storage space that resides on a web server with the sole intention of servicing a single website or technology. These types of servers are usually leased directly from a web host provider, and can even have the option of a dedicated server administrator to manage. Dedicated hosting also provides full control of the web server's abilities.
Learn more about Dedicated Hosting…
What Is Shared Hosting?
Shared web hosting, sometimes called a virtual host, multi-host, or self-serve web server, is storage space on a web server that multiple websites or technologies share with each other, including resources. These types of servers are usually provided by larger server farms and are sold at value pricing to manage websites that require minimal hardware or online resources. Shared hosting also has minimal abilities of server administration or changes.
Learn more about Shared Hosting…
Updated Queries
1. www.onebike.de
2. castrosupreme.net
3. www.washingtondcdermatology.com
4. klinik-reinerzau.de
5. stainedglassartcompany.com
6. www.picamo.de
|
{
"url": "http://00rrk2l.07xbm97.co.dedicatedornot.com/",
"source_domain": "00rrk2l.07xbm97.co.dedicatedornot.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "7406",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:E7OAHP3GEJETPHKR2T3KTQ75CPCOWS4L",
"WARC-Concurrent-To": "<urn:uuid:00e83c78-b756-4a5e-b2e1-718e5d7ee78b>",
"WARC-Date": "2018-08-15T20:21:24Z",
"WARC-IP-Address": "148.251.120.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:354HTSSGJIMXAYU3HUBNGWDSBQFK66XM",
"WARC-Record-ID": "<urn:uuid:14a9e95d-e395-4814-b1cd-f9c3979cf58d>",
"WARC-Target-URI": "http://00rrk2l.07xbm97.co.dedicatedornot.com/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b5cf657f-e0bd-4046-89a3-f164b98257fc>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-146-222-91.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
49,
50,
164,
165,
261,
262,
374,
375,
376,
391,
476,
564,
565,
592,
593,
1030,
1066,
1067,
1091,
1092,
1545,
1578,
1579,
1595,
1596,
1616,
1639,
1676,
1701,
1733
],
"line_end_idx": [
49,
50,
164,
165,
261,
262,
374,
375,
376,
391,
476,
564,
565,
592,
593,
1030,
1066,
1067,
1091,
1092,
1545,
1578,
1579,
1595,
1596,
1616,
1639,
1676,
1701,
1733,
1751
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1751,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2931506931781769,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013698630034923553,
"rps_doc_frac_lines_end_with_ellipsis": 0.06451612710952759,
"rps_doc_frac_no_alph_words": 0.28219178318977356,
"rps_doc_frac_unique_words": 0.5338645577430725,
"rps_doc_mean_word_length": 5.5816731452941895,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.0054794498719275,
"rps_doc_unigram_entropy": 4.610935688018799,
"rps_doc_word_count": 251,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07851535081863403,
"rps_doc_frac_chars_dupe_6grams": 0.041398998349905014,
"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.01927194930613041,
"rps_doc_frac_chars_top_3gram": 0.029978590086102486,
"rps_doc_frac_chars_top_4gram": 0.035688791424036026,
"rps_doc_books_importance": -131.63990783691406,
"rps_doc_books_importance_length_correction": -122.66636657714844,
"rps_doc_openwebtext_importance": -91.58975219726562,
"rps_doc_openwebtext_importance_length_correction": -91.58975219726562,
"rps_doc_wikipedia_importance": -107.69922637939453,
"rps_doc_wikipedia_importance_length_correction": -103.02609252929688
},
"fasttext": {
"dclm": 0.025278029963374138,
"english": 0.9069343209266663,
"fineweb_edu_approx": 2.9707229137420654,
"eai_general_math": 0.00876528024673462,
"eai_open_web_math": 0.17062145471572876,
"eai_web_code": 0.008572099730372429
}
}
|
{
"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.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,582,821,881,514,999,000
|
Understanding the different types of cloud services
What you never knew about cloud computing
Cloud computing is the biggest thing to hit the IT world since the World Wide Web. Concerns over its security, deployment and the use of virtualisation have made companies question whether it is right for them.
Here we look at three facts:
• The cloud can be very secure
• It's not always virtual
• You can use a mixture of vendors, both public and private, for maximum availability, scaling, load balancing and disaster recovery.
1. The cloud can be very secure
Of course it's not as simple as that. The Cloud is a very broad term used to describe a resilient, scalable system providing services for a business. It actually breaks down into four types: public, private, community and hybrid and the security levels vary.
i. Public cloud is usually a large shared environment, which is often free to use, but expandable for a premium, e.g. Dropbox, Soundcloud and Evernote. Your account can be secured with two-step verification (a password and secure code received in a text) and is often protected by SSL encryption.
However, the security is not usually sufficient to comply with industry standards, such as ISO27001.
ii. Private cloud is dedicated to, or operated by a single organisation. This is much more secure; can be hosted internally, or in a data centre; and can be managed in either instance by a third party.
When hosted within the office (and correctly firewalled) only staff can access this system. If hosted by a data centre, a dedicated connection to your office ensures maximum security against a breach. Access is also usually restricted to the data floor without prior authorisation and identification on entrance.
iii. Community cloud is a larger system, usually hosted by a data centre, which is shared between a group of companies with mutual interests and standards, e.g. healthcare or finance organisations. Users would connect to the system via a secure, encrypted Virtual Private Network (VPN) to prevent a security breach.
iv. Hybrid cloud is a mixture two or more of the above models, linked together for data and application portability, but remaining separate entities. An example of hybrid cloud would be running business applications and storing data within a private cloud, but holding non-mission critical archives or shared storage in a public cloud to cut costs.
2. Cloud isn't always virtual
Many people consider cloud as virtual servers hosted 'somewhere'. To an extent this is right as 'somewhere' denotes a group of geographically diverse data centres located around the UK, or across the planet, and linked together with superfast, secure connections. However, virtual servers are not always a good fit for applications where physical servers are more efficient.
For example, if you are running database software, such as Microsoft SQL Server or MySQL, they require a high amount of resource to run. In a virtual environment, this would often mean that busy database servers would require a dedicated hypervisor, and separate physical disks from the other virtual machines.
In this instance, physical servers are included in the infrastructure, but are not hosting virtual machines. Instead, these servers are dedicated to the task of hosting the database and providing all the physical resource required to run smoothly and efficiently.
Some virtualisation management packages such as OnApp can even manage physical servers in a group. For resilience, data on these physical servers would be replicated to other physical servers in diverse data centres to ensure maximum integrity across the Cloud platform.
3. You can mix vendors
You can use a mixture of vendors, both public and private, for maximum availability, scaling, load balancing and disaster recovery.
Although one vendor can offer multiple data centres and diverse network connections with multiple providers, you can add redundancy by using more than one vendor, or hosting an environment at your office, which replicates the one in the data centre.
There are many different possible configurations of cloud using single or multiple vendors and varying levels of security and cost. Deciding where your data needs to be and how securely it needs to be stored can help when designing your system and choosing suppliers.
Deciding how many vendors you wish to involve will then be based on your design as well as assessing the financial risk if you experience downtime.
Conclusion
There are many misconceptions in the industry putting people off moving to the cloud. Hopefully this article has helped bust some of those myths and given you more confidence in the technology.
• Jack Bedell-Pearce has over 12 years of commercial, operational and technical experience. He is responsible for the day-to-day running of 4D Data Centres, a cloud-based solutions provider for SMEs in the South East.
|
{
"url": "http://www.techradar.com/news/internet/cloud-services/understanding-the-different-types-of-cloud-services-1272922",
"source_domain": "www.techradar.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "114056",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AINWTSWZTRZQVZV2CQMVMYMUT4JSJ7HK",
"WARC-Concurrent-To": "<urn:uuid:a14ee106-83b0-4406-9e36-7e097f198a2a>",
"WARC-Date": "2017-03-27T10:57:48Z",
"WARC-IP-Address": "89.167.142.33",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QQHVEGWCQ3CJVTUBFC3ZIXRD4CSN6Z36",
"WARC-Record-ID": "<urn:uuid:95942bb2-489c-43dc-b822-08dcbdfaae5d>",
"WARC-Target-URI": "http://www.techradar.com/news/internet/cloud-services/understanding-the-different-types-of-cloud-services-1272922",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eb3ef6f6-d366-476e-b17d-decfaa24b092>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
52,
53,
95,
96,
307,
308,
337,
338,
371,
399,
535,
536,
568,
569,
828,
829,
1126,
1127,
1228,
1229,
1431,
1432,
1745,
1746,
2062,
2063,
2412,
2413,
2443,
2444,
2819,
2820,
3131,
3132,
3396,
3397,
3668,
3669,
3692,
3693,
3825,
3826,
4076,
4077,
4345,
4346,
4494,
4495,
4506,
4507,
4701,
4702
],
"line_end_idx": [
52,
53,
95,
96,
307,
308,
337,
338,
371,
399,
535,
536,
568,
569,
828,
829,
1126,
1127,
1228,
1229,
1431,
1432,
1745,
1746,
2062,
2063,
2412,
2413,
2443,
2444,
2819,
2820,
3131,
3132,
3396,
3397,
3668,
3669,
3692,
3693,
3825,
3826,
4076,
4077,
4345,
4346,
4494,
4495,
4506,
4507,
4701,
4702,
4921
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4921,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41484716534614563,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007641919888556004,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13427947461605072,
"rps_doc_frac_unique_words": 0.43291139602661133,
"rps_doc_mean_word_length": 5.041772365570068,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.280436038970947,
"rps_doc_word_count": 790,
"rps_doc_frac_chars_dupe_10grams": 0.05372834950685501,
"rps_doc_frac_chars_dupe_5grams": 0.07481797784566879,
"rps_doc_frac_chars_dupe_6grams": 0.06527742743492126,
"rps_doc_frac_chars_dupe_7grams": 0.05372834950685501,
"rps_doc_frac_chars_dupe_8grams": 0.05372834950685501,
"rps_doc_frac_chars_dupe_9grams": 0.05372834950685501,
"rps_doc_frac_chars_top_2gram": 0.01004268042743206,
"rps_doc_frac_chars_top_3gram": 0.006025610025972128,
"rps_doc_frac_chars_top_4gram": 0.00652774004265666,
"rps_doc_books_importance": -409.8907775878906,
"rps_doc_books_importance_length_correction": -409.8907775878906,
"rps_doc_openwebtext_importance": -293.83599853515625,
"rps_doc_openwebtext_importance_length_correction": -293.83599853515625,
"rps_doc_wikipedia_importance": -199.26089477539062,
"rps_doc_wikipedia_importance_length_correction": -199.26089477539062
},
"fasttext": {
"dclm": 0.264329731464386,
"english": 0.9446077346801758,
"fineweb_edu_approx": 2.4491844177246094,
"eai_general_math": 0.574872612953186,
"eai_open_web_math": 0.2530900239944458,
"eai_web_code": 0.24529355764389038
}
}
|
{
"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": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "13",
"label": "News (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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,267,501,484,164,820,000
|
/******************************************************************************* * Copyright (C) 2010, Linaro * Copyright (C) 2010, IBM Corporation * * This file is part of PowerDebug. * * All rights reserved. This program and the accompanying materials * are made available under the terms of the Eclipse Public License v1.0 * which accompanies this distribution, and is available at * http://www.eclipse.org/legal/epl-v10.html * * Contributors: * Amit Arora (IBM Corporation) * - initial API and implementation *******************************************************************************/ #include #include "powerdebug.h" int numregulators; int dump; int highlighted_row; int selectedwindow = -1; double ticktime = 10.0; /* in seconds */ char *win_names[TOTAL_FEATURE_WINS] = { "Regulators", "Clocks", "Sensors" }; int init_regulator_ds(void) { DIR *regdir; struct dirent *item; regdir = opendir("/sys/class/regulator"); if (!regdir) return(1); while((item = readdir(regdir))) { if (strncmp(item->d_name, "regulator", 9)) continue; numregulators++; } closedir(regdir); regulators_info = (struct regulator_info *)malloc(numregulators* sizeof(struct regulator_info)); if (!regulators_info) { fprintf(stderr, "init_regulator_ds: Not enough memory to " "read information for %d regulators!\n", numregulators); return(1); } return(0); } int read_and_print_sensor_info(int verbose) { DIR *dir, *subdir; int len, found = 0; char filename[PATH_MAX], devpath[PATH_MAX]; char device[PATH_MAX]; struct dirent *item, *subitem; sprintf(filename, "%s", "/sys/class/hwmon"); dir = opendir(filename); if (!dir) return errno; while ((item = readdir(dir))) { if (item->d_name[0] == '.') /* skip the hidden files */ continue; found = 1; sprintf(filename, "/sys/class/hwmon/%s", item->d_name); sprintf(devpath, "%s/device", filename); len = readlink(devpath, device, PATH_MAX - 1); if (len < 0) strcpy(devpath, filename); else device[len] = '\0'; subdir = opendir(devpath); printf("\nSensor Information for %s :\n", item->d_name); fflush(stdin); while ((subitem = readdir(subdir))) { if (subitem->d_name[0] == '.') /* skip hidden files */ continue; if(!strncmp(subitem->d_name, "in", 2)) get_sensor_info(devpath, subitem->d_name, "in", verbose); else if (!strncmp(subitem->d_name, "temp", 4)) get_sensor_info(devpath, subitem->d_name, "temp", verbose); else if (!strncmp(subitem->d_name, "fan", 4)) get_sensor_info(devpath, subitem->d_name, "fan", verbose); else if (!strncmp(subitem->d_name, "pwm", 4)) get_sensor_info(devpath, subitem->d_name, "pwm", verbose); } closedir(subdir); } closedir(dir); if(!found && verbose) { printf("Could not find sensor information!"); printf(" Looks like /sys/class/hwmon is empty.\n"); } return 0; } void read_info_from_dirent(struct dirent *ritem, char *str, int idx) { if (!strcmp(ritem->d_name, "name")) strcpy(regulators_info[idx].name, str); if (!strcmp(ritem->d_name, "state")) strcpy(regulators_info[idx].state, str); if (!strcmp(ritem->d_name, "status")) strcpy(regulators_info[idx].status, str); if (!strcmp(ritem->d_name, "type")) strcpy(regulators_info[idx].type, str); if (!strcmp(ritem->d_name, "opmode")) strcpy(regulators_info[idx].opmode, str); if (!strcmp(ritem->d_name, "microvolts")) regulators_info[idx].microvolts = atoi(str); if (!strcmp(ritem->d_name, "min_microvolts")) regulators_info[idx].min_microvolts = atoi(str); if (!strcmp(ritem->d_name, "max_microvolts")) regulators_info[idx].max_microvolts = atoi(str); if (!strcmp(ritem->d_name, "microamps")) regulators_info[idx].microamps = atoi(str); if (!strcmp(ritem->d_name, "min_microamps")) regulators_info[idx].min_microamps = atoi(str); if (!strcmp(ritem->d_name, "max_microamps")) regulators_info[idx].max_microamps = atoi(str); if (!strcmp(ritem->d_name, "requested_microamps")) regulators_info[idx].requested_microamps = atoi(str); if (!strcmp(ritem->d_name, "num_users")) regulators_info[idx].num_users = atoi(str); } int read_regulator_info(void) { FILE *file = NULL; DIR *regdir, *dir; int len, count = 0, ret = 0; char line[1024], filename[1024], *fptr; struct dirent *item, *ritem; regdir = opendir("/sys/class/regulator"); if (!regdir) return(1); while((item = readdir(regdir))) { if (strlen(item->d_name) < 3) continue; if (strncmp(item->d_name, "regulator", 9)) continue; len = sprintf(filename, "/sys/class/regulator/%s", item->d_name); dir = opendir(filename); if (!dir) continue; count++; if (count > numregulators) { ret = 1; goto exit; } strcpy(regulators_info[count-1].name, item->d_name); while((ritem = readdir(dir))) { if (strlen(ritem->d_name) < 3) continue; sprintf(filename + len, "/%s", ritem->d_name); file = fopen(filename, "r"); if (!file) continue; memset(line, 0, 1024); fptr = fgets(line, 1024, file); fclose(file); if (!fptr) continue; read_info_from_dirent(ritem, fptr, count - 1); } exit: closedir(dir); if (ret) break; } closedir(regdir); return ret; } int main(int argc, char **argv) { int c, i; int firsttime[TOTAL_FEATURE_WINS]; int enter_hit = 0, verbose = 0, findparent_ncurses = 0; int regulators = 0, sensors = 0, clocks = 0, findparent = 0; char clkarg[64], clkname_str[64]; for (i = 0; i < TOTAL_FEATURE_WINS; i++) firsttime[i] = 1; /* * Options: * -r, --regulator : regulator * -s, --sensor : sensors * -c, --clock : clocks * -p, --findparents : clockname whose parents have to be found * -t, --time : ticktime * -d, --dump : dump * -v, --verbose : verbose * -V, --version : version * -h, --help : help * no option / default : show usage! */ while (1) { int optindex = 0; static struct option long_options[] = { {"regulator", 0, 0, 'r'}, {"sensor", 0, 0, 's'}, {"clock", 0, 0, 'c'}, {"findparents", 1, 0, 'p'}, {"time", 1, 0, 't'}, {"dump", 0, 0, 'd'}, {"verbose", 0, 0, 'v'}, {"version", 0, 0, 'V'}, {"help", 0, 0, 'h'}, {0, 0, 0, 0} }; c = getopt_long(argc, argv, "rscp:t:dvVh", long_options, &optindex); if (c == -1) break; switch (c) { case 'r': regulators = 1; selectedwindow = REGULATOR; break; case 's': sensors = 1; selectedwindow = SENSOR; break; case 'c': clocks = 1; selectedwindow = CLOCK; break; case 'p': findparent = 1; strcpy(clkarg, optarg); break; case 't': ticktime = strtod(optarg, NULL); break; case 'd': dump = 1; break; case 'v': verbose = 1; break; case 'V': version(); break; case 'h': usage(argv); break; case '?': fprintf (stderr, "%s: Unknown option %c'.\n", argv[0], optopt); exit(1); default: usage(argv); break; } } if (!dump && (regulators || clocks || sensors)) { fprintf(stderr, "Option supported only in dump mode (-d)\n"); usage(argv); } if (findparent && (!clocks || !dump)) { fprintf(stderr, "-p option passed without -c and -d." " Exiting...\n"); usage(argv); } if (!dump) selectedwindow = REGULATOR; init_regulator_ds(); while(1) { int key = 0; struct timeval tval; fd_set readfds; if (!dump) { if(firsttime[0]) init_curses(); create_windows(); show_header(); } if (selectedwindow == REGULATOR) { read_regulator_info(); if (!dump) { create_selectedwindow(); show_regulator_info(verbose); } else print_regulator_info(verbose); } if (selectedwindow == CLOCK) { int ret = 0; if (firsttime[CLOCK]) { ret = init_clock_details(); if (!ret) firsttime[CLOCK] = 0; strcpy(clkname_str, ""); } if (!ret && !dump) { int hrow; create_selectedwindow(); if (!findparent_ncurses) { hrow = read_and_print_clock_info( verbose, highlighted_row, enter_hit); highlighted_row = hrow; enter_hit = 0; } else find_parents_for_clock(clkname_str, enter_hit); } if (!ret && dump) { if (findparent) read_and_dump_clock_info_one(clkarg); else read_and_dump_clock_info(verbose); } } if (selectedwindow == SENSOR) { if (!dump) { create_selectedwindow(); print_sensor_header(); } else read_and_print_sensor_info(verbose); } if (dump) break; FD_ZERO(&readfds); FD_SET(0, &readfds); tval.tv_sec = ticktime; tval.tv_usec = (ticktime - tval.tv_sec) * 1000000; key = select(1, &readfds, NULL, NULL, &tval); if (key) { char keychar; int keystroke = getch(); int oldselectedwin = selectedwindow; if (keystroke == EOF) exit(0); if (keystroke == KEY_RIGHT || keystroke == 9) selectedwindow++; if (keystroke == KEY_LEFT || keystroke == 353) selectedwindow--; if (selectedwindow >= TOTAL_FEATURE_WINS) selectedwindow = 0; if (selectedwindow < 0) selectedwindow = TOTAL_FEATURE_WINS - 1; if (selectedwindow == CLOCK) { if (keystroke == KEY_DOWN) highlighted_row++; if (keystroke == KEY_UP && highlighted_row > 0) highlighted_row--; if (keystroke == 47) findparent_ncurses = 1; if ((keystroke == 27 || oldselectedwin != selectedwindow) && findparent_ncurses) { findparent_ncurses = 0; clkname_str[0] = '\0'; } if (findparent_ncurses && keystroke != 13) { int len = strlen(clkname_str); char str[2]; if (keystroke == 263) { if (len > 0) len--; clkname_str[len] = '\0'; } else { if (strlen(clkname_str) || keystroke != '/') { str[0] = keystroke; str[1] = '\0'; if (len < 63) strcat(clkname_str, str); } } } } keychar = toupper(keystroke); //#define DEBUG #ifdef DEBUG killall_windows(1); fini_curses(); printf("key entered %d:%c\n", keystroke, keychar); exit(1); #endif if (keystroke == 13) enter_hit = 1; if (keychar == 'Q' && !findparent_ncurses) exit(0); if (keychar == 'R') ticktime = 3; } } exit(0); }
|
{
"url": "https://git-ie.linaro.org/people/dlezcano/powerdebug.git/plain/powerdebug.c?h=debian&id=83ae6cbe2dc075e16bba51b0f8d641bad97b8fd3",
"source_domain": "git-ie.linaro.org",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "11036",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HM7YEBGJ3UTXOPUGJAJWLKLUGKXQIDHE",
"WARC-Concurrent-To": "<urn:uuid:a6165361-eb06-4b91-987a-8fb9755b775e>",
"WARC-Date": "2022-01-18T14:45:21Z",
"WARC-IP-Address": "99.81.133.34",
"WARC-Identified-Payload-Type": "text/x-csrc",
"WARC-Payload-Digest": "sha1:RAC3TOGM5HF3JYFPZ2A6RWOXPLKSISS4",
"WARC-Record-ID": "<urn:uuid:a97de90f-fc21-4e11-bfa7-8b1e54c87f79>",
"WARC-Target-URI": "https://git-ie.linaro.org/people/dlezcano/powerdebug.git/plain/powerdebug.c?h=debian&id=83ae6cbe2dc075e16bba51b0f8d641bad97b8fd3",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d732d58f-cefb-47c8-825b-ce8a58759790>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-105\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": [
9142
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9142,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.010282210074365139,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08213820308446884,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019991310313344002,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5684484839439392,
"rps_doc_frac_unique_words": 0.3734249770641327,
"rps_doc_mean_word_length": 6.890034198760986,
"rps_doc_num_sentences": 77,
"rps_doc_symbol_to_word_ratio": 0.0026075600180774927,
"rps_doc_unigram_entropy": 5.109750270843506,
"rps_doc_word_count": 873,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03458021953701973,
"rps_doc_frac_chars_dupe_6grams": 0.022942639887332916,
"rps_doc_frac_chars_dupe_7grams": 0.022942639887332916,
"rps_doc_frac_chars_dupe_8grams": 0.022942639887332916,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03890274092555046,
"rps_doc_frac_chars_top_3gram": 0.02909393049776554,
"rps_doc_frac_chars_top_4gram": 0.015960099175572395,
"rps_doc_books_importance": -1100.781982421875,
"rps_doc_books_importance_length_correction": -1100.781982421875,
"rps_doc_openwebtext_importance": -665.260986328125,
"rps_doc_openwebtext_importance_length_correction": -665.260986328125,
"rps_doc_wikipedia_importance": -489.2444152832031,
"rps_doc_wikipedia_importance_length_correction": -489.2444152832031
},
"fasttext": {
"dclm": 0.9830709099769592,
"english": 0.3039962351322174,
"fineweb_edu_approx": 3.2328741550445557,
"eai_general_math": 0.5232255458831787,
"eai_open_web_math": 0.18278485536575317,
"eai_web_code": 0.5351401567459106
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,266,302,837,964,591,000
|
models.blackout_period module
class models.blackout_period.BlackoutPeriod(id=None, day=None, end_time=None, start_time=None)[source]
Bases: object
Implementation of the ‘BlackoutPeriod’ model.
Specifies a time range in a single day when new Job Runs of Protection Jobs cannot be started. For example, a Protection Job with a daily schedule could define a blackout period for Sunday.
Attributes:
id (string): Specified the Id for a snapshot copy policy. This is
generated when the policy is created.
day (DayBlackoutPeriodEnum): Blackout Day. Specifies a day in the
week when no new Job Runs should be started such as ‘kSunday’. If not set, the time range applies to all days. Specifies a day in a week such as ‘kSunday’, ‘kMonday’, etc.
end_time (TimeOfDay): Specifies the end time of the blackout time
range.
start_time (TimeOfDay): Specifies the start time of the blackout time
range.
classmethod from_dictionary(dictionary)[source]
Creates an instance of this model from a dictionary
Args:
dictionary (dictionary): A dictionary representation of the object as obtained from the deserialization of the server’s response. The keys MUST match property names in the API description.
Returns:
object: An instance of this structure class.
|
{
"url": "https://cohesity.github.io/management-sdk-python/models.blackout_period.html",
"source_domain": "cohesity.github.io",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "577713",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5T7DYCIW36VXR2F6KKRG4O2HW4FJH7B2",
"WARC-Concurrent-To": "<urn:uuid:b3eb799e-13c9-4845-bc75-2d0bbc7d9a3f>",
"WARC-Date": "2022-11-27T02:38:39Z",
"WARC-IP-Address": "185.199.110.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FTMEG4H6QGVXNJQG4PWQEVICTWDFD2CB",
"WARC-Record-ID": "<urn:uuid:0e394767-ea18-460f-80e7-ec40e2e932f9>",
"WARC-Target-URI": "https://cohesity.github.io/management-sdk-python/models.blackout_period.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c25cbf4f-c5db-4180-b838-81f08f337ba9>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-70\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,
30,
31,
134,
135,
149,
150,
196,
197,
387,
388,
400,
466,
467,
505,
506,
572,
573,
745,
746,
812,
813,
820,
821,
891,
892,
899,
900,
948,
949,
1001,
1002,
1008,
1009,
1198,
1199,
1208,
1209
],
"line_end_idx": [
30,
31,
134,
135,
149,
150,
196,
197,
387,
388,
400,
466,
467,
505,
506,
572,
573,
745,
746,
812,
813,
820,
821,
891,
892,
899,
900,
948,
949,
1001,
1002,
1008,
1009,
1198,
1199,
1208,
1209,
1253
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1253,
"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.27346938848495483,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01224489975720644,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22448979318141937,
"rps_doc_frac_unique_words": 0.5280898809432983,
"rps_doc_mean_word_length": 5.589887619018555,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.2136549949646,
"rps_doc_word_count": 178,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05226131156086922,
"rps_doc_frac_chars_dupe_6grams": 0.05226131156086922,
"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.02512563019990921,
"rps_doc_frac_chars_top_3gram": 0.02010050043463707,
"rps_doc_frac_chars_top_4gram": 0.030150750651955605,
"rps_doc_books_importance": -103.21432495117188,
"rps_doc_books_importance_length_correction": -103.21432495117188,
"rps_doc_openwebtext_importance": -69.38011932373047,
"rps_doc_openwebtext_importance_length_correction": -69.38011932373047,
"rps_doc_wikipedia_importance": -43.66938400268555,
"rps_doc_wikipedia_importance_length_correction": -43.66938400268555
},
"fasttext": {
"dclm": 0.01814126968383789,
"english": 0.7776980400085449,
"fineweb_edu_approx": 1.8143765926361084,
"eai_general_math": 0.34320569038391113,
"eai_open_web_math": 0.06370121240615845,
"eai_web_code": 0.9455729722976685
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,299,830,585,247,654,000
|
Results are out! Find what you need...fast. Get quick advice or join the chat
x
Unlock these great extras with your FREE membership
• One-on-one advice about results day and Clearing
• Free access to our personal statement wizard
• Customise TSR to suit how you want to use it
Gcse question help please
Announcements Posted on
Find your uni forum to get talking to other applicants, existing students and your future course-mates 27-07-2015
Win top prizes in our mega results day giveaway... 24-07-2015
1. Offline
ReputationRep:
The question is that:
Radius of sphere is 3cm
radius of cone is 3cm
TOTAL surface area of cone is equal to the surface area of the sphere workout the length of the slanted height.
The book answer is 12, but i get 12 and 9
my answer for 12 is (but this does not include the radius)
pi*r*l=4*pi*r^2
3*pi*l=36*pi
l=12
for 9 i use the total surface are of the cone meaning that i also incluse the circle at the bottom as it say total s.a.
But when i use the total i get 9 when i use the curved suface i get 12 is this an error in the book or am i just missin something.
Thanks.........
2. Offline
ReputationRep:
Did they say anywhere that it was an open cone? If it was a closed cone you would include the circle at the base
Reply
Submit reply
Register
Thanks for posting! You just need to create an account in order to submit the post
1. this can't be left blank
that username has been taken, please choose another Forgotten your password?
2. this can't be left blank
this email is already registered. Forgotten your password?
3. this can't be left blank
6 characters or longer with both numbers and letters is safer
4. this can't be left empty
your full birthday is required
1. By joining you agree to our Ts and Cs, privacy policy and site rules
2. Slide to join now Processing…
Updated: February 29, 2012
TSR Support Team
We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.
Poll
Would you consider Clearing if you missed your offer?
Results and Clearing
Results are coming...
No sweat. Here's all you need to make sure you're ready
new on tsr
What's your life ambition?
Graduating, travelling, owning a business?
Study resources
x
Think you'll be in clearing or adjustment?
Hear direct from unis that want to talk to you
Get email alerts for university course places that match your subjects and grades. Just let us know what you're studying.
Quick reply
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.
|
{
"url": "http://www.thestudentroom.co.uk/showthread.php?p=36569403",
"source_domain": "www.thestudentroom.co.uk",
"snapshot_id": "crawl=CC-MAIN-2015-32",
"warc_metadata": {
"Content-Length": "232973",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6I6OIINN7NCWIPQCCDVNXLJE66L27UMM",
"WARC-Concurrent-To": "<urn:uuid:cad9561b-a7ee-46e1-844c-49f76d13fb68>",
"WARC-Date": "2015-08-01T01:38:59Z",
"WARC-IP-Address": "162.159.253.30",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LDBY63TLUOQYTQV2QUDFERVE4K6VF4YW",
"WARC-Record-ID": "<urn:uuid:d9366b69-b372-414c-ad69-4bef6d09ae6a>",
"WARC-Target-URI": "http://www.thestudentroom.co.uk/showthread.php?p=36569403",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9af96ace-0abe-4e41-8dca-306e305ab863>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-191-2.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-32\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,
78,
80,
81,
133,
134,
187,
236,
285,
286,
312,
313,
337,
451,
513,
526,
527,
546,
572,
573,
601,
627,
628,
744,
745,
791,
792,
855,
856,
876,
893,
902,
903,
1027,
1028,
1163,
1164,
1184,
1197,
1198,
1217,
1334,
1335,
1341,
1342,
1355,
1356,
1365,
1366,
1449,
1479,
1560,
1590,
1653,
1683,
1684,
1750,
1751,
1781,
1816,
1890,
1891,
1926,
1927,
1954,
1971,
1972,
2142,
2143,
2148,
2202,
2223,
2224,
2246,
2247,
2303,
2304,
2315,
2316,
2343,
2344,
2387,
2388,
2404,
2406,
2407,
2450,
2451,
2498,
2499,
2621,
2622,
2634
],
"line_end_idx": [
78,
80,
81,
133,
134,
187,
236,
285,
286,
312,
313,
337,
451,
513,
526,
527,
546,
572,
573,
601,
627,
628,
744,
745,
791,
792,
855,
856,
876,
893,
902,
903,
1027,
1028,
1163,
1164,
1184,
1197,
1198,
1217,
1334,
1335,
1341,
1342,
1355,
1356,
1365,
1366,
1449,
1479,
1560,
1590,
1653,
1683,
1684,
1750,
1751,
1781,
1816,
1890,
1891,
1926,
1927,
1954,
1971,
1972,
2142,
2143,
2148,
2202,
2223,
2224,
2246,
2247,
2303,
2304,
2315,
2316,
2343,
2344,
2387,
2388,
2404,
2406,
2407,
2450,
2451,
2498,
2499,
2621,
2622,
2634,
2761
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2761,
"ccnet_original_nlines": 92,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41278067231178284,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006908460054546595,
"rps_doc_frac_lines_end_with_ellipsis": 0.032258059829473495,
"rps_doc_frac_no_alph_words": 0.18825560808181763,
"rps_doc_frac_unique_words": 0.5337552428245544,
"rps_doc_mean_word_length": 4.360759258270264,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.012089810334146023,
"rps_doc_unigram_entropy": 5.187757968902588,
"rps_doc_word_count": 474,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.027576200664043427,
"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.015481369569897652,
"rps_doc_frac_chars_top_3gram": 0.019351720809936523,
"rps_doc_frac_chars_top_4gram": 0.027092399075627327,
"rps_doc_books_importance": -246.14662170410156,
"rps_doc_books_importance_length_correction": -246.14662170410156,
"rps_doc_openwebtext_importance": -149.1139678955078,
"rps_doc_openwebtext_importance_length_correction": -149.1139678955078,
"rps_doc_wikipedia_importance": -81.82225036621094,
"rps_doc_wikipedia_importance_length_correction": -81.82225036621094
},
"fasttext": {
"dclm": 0.0326649509370327,
"english": 0.9388096928596497,
"fineweb_edu_approx": 0.8735402822494507,
"eai_general_math": 0.020132120698690414,
"eai_open_web_math": 0.11415553092956543,
"eai_web_code": 0.0009830599883571267
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "378.15",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,153,780,612,648,325,000
|
Domain names serve to identify Internet resources, such as computers, networks, and services, with a text-based label that is easier to memorize than the numerical addresses used in the Internet protocols. A domain name may represent entire collections of such resources or individual instances. Individual Internet host computers use domain names as host identifiers, also called hostnames. The term hostname is also used for the leaf labels in the domain name system, usually without further subordinate domain name space. Hostnames appear as a component in Uniform Resource Locators (URLs) for Internet resources such as web sites (e.g., en.wikipedia.org).
Alexandra Leslie’s interest in website administration was sparked in her teens, priming her for a fast-paced career in managing, building, and contributing to online brands, including HostingAdvice, Forbes, and the blogs of prominent hosting providers. She brings to the table firsthand experience in reviewing web hosts, perfecting website design, optimizing content, and walking site owners through the steps that add up to a successful online presence. Today, she combines her extensive writing experience with technical understanding to unpack some of the most complex topics that daunt novice website owners, as well as the subjects that excite veteran technologists within the HostingAdvice readership.
What about the time you clicked on that PayPal link that wasn't really a PayPal link? "Phishing" is a term applied to either websites or emails that pretend to be something they're not in hopes of getting a user to click on something they should have ignored. This tactis is done in hopes of then getting users to provide confidential information they would have otherwise kept to themselves, typically like passwords, financial information, or other personal data. While there are security measure that fight this, the mechanics behind phishing are, unfortunately, also consistently becoming more sophisticated. Even some dedicated antivirus and business-class hosted endpoint protection suites are having trouble keeping up.
Email isn't going away any time soon. Despite a rise in adoption of collaboration-based communication platforms such as Microsoft Teams or Slack, 86 percent of professionals prefer to use email for business purposes. How companies host, store, and distribute their email—that's the area that has undergone a massive transformation. Businesses are veering away from costly onsite email servers running products such as Microsoft Small Business Server and looking instead to the cloud with hosted email solutions. Businesses of all sizes have realized the wisdom of going with a scalable and secure hosted Software-as-a-Service (SaaS) solution with guaranteed uptime that breaks down pricing into flexible, per-user charges.
Most companies will prefer a third-party solution since not only will these be more capable, they'll also be supported more effectively by related back-end apps, such as mobile device management (MDM) platforms and mobile-oriented endpoint protection solutions. You'll also have an easier time pushing a third-party platform out to registered client devices, though some hosted email providers can help with this step.
HostingAdvice.com is a free online resource that offers valuable content and comparison services to users. To keep this resource 100% free for users, we receive advertising compensation from the hosts listed on this page. Along with key review factors, this compensation may impact how and where hosts appear on the page (including, for example, the order in which they appear). HostingAdvice.com does not include listings for all web hosts.
There are hosting providers that offer services ideal for a wide range of websites like ecommerce and personal sites that are packed with all the resources and features needed to build your own site online all with in one account, they provide domain names, drag and drop site builders, templates and themes and a large variety of plugins and components to help making your website a reality.
An important function of domain names is to provide easily recognizable and memorizable names to numerically addressed Internet resources. This abstraction allows any resource to be moved to a different physical location in the address topology of the network, globally or locally in an intranet. Such a move usually requires changing the IP address of a resource and the corresponding translation of this IP address to and from its domain name.
Critics often claim abuse of administrative power over domain names. Particularly noteworthy was the VeriSign Site Finder system which redirected all unregistered .com and .net domains to a VeriSign webpage. For example, at a public meeting with VeriSign to air technical concerns about SiteFinder,[25] numerous people, active in the IETF and other technical bodies, explained how they were surprised by VeriSign's changing the fundamental behavior of a major component of Internet infrastructure, not having obtained the customary consensus. SiteFinder, at first, assumed every Internet query was for a website, and it monetized queries for incorrect domain names, taking the user to VeriSign's search site. Unfortunately, other applications, such as many implementations of email, treat a lack of response to a domain name query as an indication that the domain does not exist, and that the message can be treated as undeliverable. The original VeriSign implementation broke this assumption for mail, because it would always resolve an erroneous domain name to that of SiteFinder. While VeriSign later changed SiteFinder's behaviour with regard to email, there was still widespread protest about VeriSign's action being more in its financial interest than in the interest of the Internet infrastructure component for which VeriSign was the steward.
A survey conducted (see graphic above; click to enlarge) by email marketing software provider and consulting service ReachMail Media Services of over 1,000 respondents found that varying percentages of different worker generations attempted to adhere to "inbox zero," while other generations actually preferred using their inboxes as personal information managers.
This is where an email host like SiteGround can be a winning deal for individuals. SiteGround will give you a free domain name, where you get unlimited email hosting that’s compatible with most all major email and webmail clients (RoundCube, Outlook, SquirrelMail, etc.). Your email is secured with integrated anti-SPAM protection, and you can easily manage your account via cPanel, the web’s leading control panel for hosting.
Over the course of website building, you’ll learn how to design and create attractive websites with the help of basics like typography, color theory, branding etc. Treehouse also makes you acquainted with common languages like HTML and CSS, which are used to code all modes websites. If you’ve never build a website before and you want to become a web designer, this is a great place to start with its 503-minute HTML course.
Critics often claim abuse of administrative power over domain names. Particularly noteworthy was the VeriSign Site Finder system which redirected all unregistered .com and .net domains to a VeriSign webpage. For example, at a public meeting with VeriSign to air technical concerns about SiteFinder,[25] numerous people, active in the IETF and other technical bodies, explained how they were surprised by VeriSign's changing the fundamental behavior of a major component of Internet infrastructure, not having obtained the customary consensus. SiteFinder, at first, assumed every Internet query was for a website, and it monetized queries for incorrect domain names, taking the user to VeriSign's search site. Unfortunately, other applications, such as many implementations of email, treat a lack of response to a domain name query as an indication that the domain does not exist, and that the message can be treated as undeliverable. The original VeriSign implementation broke this assumption for mail, because it would always resolve an erroneous domain name to that of SiteFinder. While VeriSign later changed SiteFinder's behaviour with regard to email, there was still widespread protest about VeriSign's action being more in its financial interest than in the interest of the Internet infrastructure component for which VeriSign was the steward.
Over the course of website building, you’ll learn how to design and create attractive websites with the help of basics like typography, color theory, branding etc. Treehouse also makes you acquainted with common languages like HTML and CSS, which are used to code all modes websites. If you’ve never build a website before and you want to become a web designer, this is a great place to start with its 503-minute HTML course.
A domain name consists of one or more labels, each of which is formed from the set of ASCII letters, digits, and hyphens (a-z, A-Z, 0-9, -), but not starting or ending with a hyphen. The labels are case-insensitive; for example, 'label' is equivalent to 'Label' or 'LABEL'. In the textual representation of a domain name, the labels are separated by a full stop (period).
For any business user or organization today, the decision to use email is a no-brainer. Business simply can't be done in many cases without it. But that doesn't mean you can interchange email platforms or service providers at will. Digging into the capabilities of these services reveals a great deal of additional feature scaffolding that surrounds almost every email implementation by necessity.
The hierarchy of domains descends from the right to the left label in the name; each label to the left specifies a subdivision, or subdomain of the domain to the right. For example: the label example specifies a node example.com as a subdomain of the com domain, and www is a label to create www.example.com, a subdomain of example.com. Each label may contain from 1 to 63 octets. The empty label is reserved for the root node and when fully qualified is expressed as the empty label terminated by a dot. The full domain name may not exceed a total length of 253 ASCII characters in its textual representation.[6] Thus, when using a single character per label, the limit is 127 levels: 127 characters plus 126 dots have a total length of 253. In practice, some domain registries may have shorter limits.
An example here is the rapidly growing trend of "inbox zero." It's actually known by a variety of names, but it refers to the practice of keeping your email inbox count at zero stored emails. Essentially, it's dealing with every email as it comes in and then deleting or archiving each one so that your inbox is always empty. This boils down to a fundamental shift in how users are utilizing their email inboxes.
×
|
{
"url": "https://vvywmyweb.us/docker-web-hosting-web-hosting-companies-for-sale.html",
"source_domain": "vvywmyweb.us",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "17687",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IV3UYEDPNCGTSXNFC454PLBZ6XMTLTCN",
"WARC-Concurrent-To": "<urn:uuid:207ba899-ee7c-4c6e-b83e-a037e01d6e3d>",
"WARC-Date": "2020-05-29T15:47:06Z",
"WARC-IP-Address": "104.24.96.20",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GWIJXQ6SS6JFLCHOTHCHQJRG2PSPIOI2",
"WARC-Record-ID": "<urn:uuid:5cc1d424-9148-4d01-be61-e2c9e6e3deaa>",
"WARC-Target-URI": "https://vvywmyweb.us/docker-web-hosting-web-hosting-companies-for-sale.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:77c3a33d-6af2-4c44-b9fa-ca7015c80a54>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-52.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
1,
661,
662,
663,
1372,
2099,
2822,
3241,
3683,
4076,
4522,
4523,
5874,
6240,
6241,
6669,
7095,
8446,
8872,
9244,
9642,
9643,
10447,
10448,
10449,
10862
],
"line_end_idx": [
1,
661,
662,
663,
1372,
2099,
2822,
3241,
3683,
4076,
4522,
4523,
5874,
6240,
6241,
6669,
7095,
8446,
8872,
9244,
9642,
9643,
10447,
10448,
10449,
10862,
10863
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10863,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4193069338798523,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009900989942252636,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14059406518936157,
"rps_doc_frac_unique_words": 0.37441039085388184,
"rps_doc_mean_word_length": 5.239976406097412,
"rps_doc_num_sentences": 84,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.731706619262695,
"rps_doc_word_count": 1696,
"rps_doc_frac_chars_dupe_10grams": 0.3292449712753296,
"rps_doc_frac_chars_dupe_5grams": 0.3330707848072052,
"rps_doc_frac_chars_dupe_6grams": 0.3292449712753296,
"rps_doc_frac_chars_dupe_7grams": 0.3292449712753296,
"rps_doc_frac_chars_dupe_8grams": 0.3292449712753296,
"rps_doc_frac_chars_dupe_9grams": 0.3292449712753296,
"rps_doc_frac_chars_top_2gram": 0.013502869755029678,
"rps_doc_frac_chars_top_3gram": 0.006188820116221905,
"rps_doc_frac_chars_top_4gram": 0.005176099948585033,
"rps_doc_books_importance": -793.1759643554688,
"rps_doc_books_importance_length_correction": -793.1759643554688,
"rps_doc_openwebtext_importance": -531.6134643554688,
"rps_doc_openwebtext_importance_length_correction": -531.6134643554688,
"rps_doc_wikipedia_importance": -404.91693115234375,
"rps_doc_wikipedia_importance_length_correction": -404.91693115234375
},
"fasttext": {
"dclm": 0.09982150793075562,
"english": 0.9412298798561096,
"fineweb_edu_approx": 2.3815360069274902,
"eai_general_math": 0.1716017723083496,
"eai_open_web_math": 0.10524415969848633,
"eai_web_code": 0.35043662786483765
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,225,521,568,152,818,000
|
Market does not decide if an OS is good
There seems to be a trend with people claiming stuff like, "WP sucks no one is buying it". I'm not sure I understand this mentality. Market/sales don't decide if an OS is good, YOU DO! If market made my decisions I wouldn't dual boot Linux and I definitely wouldn't like Pearl Jam as much as I do (after all Justin Bieber sells more). Where did this come from? Growing up, technology and computer stuff was always kind of a fringe hobby. People really took a lot of pride in that. These days, it's the opposite, if it doesn't sell, it sucks. Who cares, if YOU enjoy what YOU are using isn't that all that matters? My only concern is that Nokia/WP sells enough for them to continue making Windows Phones, because I like them and want to continue purchasing them...
|
{
"url": "http://www.theverge.com/2013/5/11/4321626/market-does-not-decide-if-an-os-is-good",
"source_domain": "www.theverge.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "96196",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:575TO7G2GXEU3UKU2QX6KVO6ZI4V2VCG",
"WARC-Concurrent-To": "<urn:uuid:e201f739-b66e-41ac-bb4a-6e148a37ce96>",
"WARC-Date": "2013-12-05T01:55:20Z",
"WARC-IP-Address": "69.25.121.112",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LIWVJ6WLZNHJXYRFELHBZKXZTDT2SN65",
"WARC-Record-ID": "<urn:uuid:8732b8d4-b7a0-4342-ba34-316a14fc9301>",
"WARC-Target-URI": "http://www.theverge.com/2013/5/11/4321626/market-does-not-decide-if-an-os-is-good",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:288d1dde-e3f4-4d5b-8571-15d36a533b8c>"
},
"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,
40,
41
],
"line_end_idx": [
40,
41,
804
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 804,
"ccnet_original_nlines": 2,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4331550896167755,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07486630976200104,
"rps_doc_frac_lines_end_with_ellipsis": 0.3333333432674408,
"rps_doc_frac_no_alph_words": 0.15508021414279938,
"rps_doc_frac_unique_words": 0.6912751793861389,
"rps_doc_mean_word_length": 4.174496650695801,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.005347589962184429,
"rps_doc_unigram_entropy": 4.499188423156738,
"rps_doc_word_count": 149,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.057877808809280396,
"rps_doc_frac_chars_dupe_6grams": 0.057877808809280396,
"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.025723470374941826,
"rps_doc_frac_chars_top_3gram": 0.03215434029698372,
"rps_doc_frac_chars_top_4gram": 0.03858520835638046,
"rps_doc_books_importance": -79.51294708251953,
"rps_doc_books_importance_length_correction": -79.51294708251953,
"rps_doc_openwebtext_importance": -50.79753875732422,
"rps_doc_openwebtext_importance_length_correction": -50.79454803466797,
"rps_doc_wikipedia_importance": -43.98222732543945,
"rps_doc_wikipedia_importance_length_correction": -43.98222732543945
},
"fasttext": {
"dclm": 0.9840924739837646,
"english": 0.9850695133209229,
"fineweb_edu_approx": 0.9450478553771973,
"eai_general_math": 0.2835041880607605,
"eai_open_web_math": 0.25369834899902344,
"eai_web_code": 0.01469356007874012
}
}
|
{
"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": "338.02",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,998,996,045,747,292,400
|
add share buttonsSoftshare button powered by web designing, website development company in India
Have you got a notion regarding what network support is about? This specific article endeavors to offer you a simple idea of what is network support, and also the idea of network service. You can also check-out BC Networks for network support.
What's a Network system?
This system might be described as a set of nodes connected, which can be made to interact with one another. Broadly because of network cables of aluminum, fiber optics, radio waves, and other mediums of media. Generally, there are 3 kinds of networks, viz.
What's Network Topology?
The number of nodes that are connected exists in a specific design pattern called network topology. The physical infrastructure of the system might be described as the physical network topology.
Image Source- Google
Along with the logical infrastructure, there are basically seven types of network topology.
What's Ethernet Network?
Ethernet is possibly the most widely used system in the realm of networking. Within an Ethernet Network, the conventional media version's physical layer entails a particular number of wiring and signaling criteria.
Also, the lower portion of the data link layer entails a set of medium access control processes.
Network Support – A Summary
Network Support presents immediate solutions to all types of issues associated with media and its peripherals, via remote PC support. Also, you'll discover yourself in an extremely advantageous position in case you avail of assistance from a remote PC service.
|
{
"url": "https://azulhistorico.com/basic-networking-aspects-and-network-support/",
"source_domain": "azulhistorico.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "40095",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U47XQAHAB2NZJLVBN4MXZMNLLMQMRDMD",
"WARC-Concurrent-To": "<urn:uuid:96e8a59a-35d0-4c4a-9bc5-652e652e9ca2>",
"WARC-Date": "2022-08-13T02:16:30Z",
"WARC-IP-Address": "97.74.84.118",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:64WJYWY6QZPTLB3JSQ5E5AR75DFE4JEV",
"WARC-Record-ID": "<urn:uuid:f3516155-d358-4789-a84e-dccef5eed78a>",
"WARC-Target-URI": "https://azulhistorico.com/basic-networking-aspects-and-network-support/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8449d41e-1022-47be-8fcf-74b276c8b1d5>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-115\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
97,
98,
342,
343,
369,
370,
628,
629,
655,
656,
877,
878,
895,
896,
991,
992,
1085,
1086,
1111,
1112,
1328,
1329,
1426,
1427,
1455,
1456,
1718,
1719
],
"line_end_idx": [
97,
98,
342,
343,
369,
370,
628,
629,
655,
656,
877,
878,
895,
896,
991,
992,
1085,
1086,
1111,
1112,
1328,
1329,
1426,
1427,
1455,
1456,
1718,
1719,
1720
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1720,
"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.3595890402793884,
"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.1335616409778595,
"rps_doc_frac_unique_words": 0.5582329034805298,
"rps_doc_mean_word_length": 5.204819202423096,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.577112674713135,
"rps_doc_word_count": 249,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.037037041038274765,
"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.05401235073804855,
"rps_doc_frac_chars_top_3gram": 0.020061729475855827,
"rps_doc_frac_chars_top_4gram": 0.03395061939954758,
"rps_doc_books_importance": -154.21466064453125,
"rps_doc_books_importance_length_correction": -143.18568420410156,
"rps_doc_openwebtext_importance": -76.29328918457031,
"rps_doc_openwebtext_importance_length_correction": -76.29328918457031,
"rps_doc_wikipedia_importance": -64.52745056152344,
"rps_doc_wikipedia_importance_length_correction": -56.91448974609375
},
"fasttext": {
"dclm": 0.04138338938355446,
"english": 0.86385577917099,
"fineweb_edu_approx": 2.418903350830078,
"eai_general_math": 0.00035310001112520695,
"eai_open_web_math": 0.3762894868850708,
"eai_web_code": 1.000005841255188
}
}
|
{
"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": "658.402",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"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": "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": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,157,190,199,886,036,000
|
1. jamezbb8110's Avatar
Hey everyone, I need some advice!
I will be getting a new bb in the next month and am leaning toward the 8900. I have never had a bb data plan before, and I have some questions and am soliciting your experienced thoughts.
I am looking at adding an unlimited data plan for about $36 (with AT&T), and my company gives me a $100/month cell phone allowance.
• Does this include texting? GPS? Or is it just email and web?
• What is the difference between the "Personal BB" & "Enterprise BB" data plans?
• What else do I need to know?
Thanks!
08-04-09 11:07 PM
2. Artemis68's Avatar
The plan you're looking to add...is that the Enterprise BB plan? Because the Personal BB plan is only 29.99/month. That's your other option.
1) It includes GPS, email, and web...the GPS is not locked so you can use it with any program that you'd like. Texting is not included. That is 20 dollars more for unlimited.
2) Personal BB (BIS) is what most people use...you can get email from regular old email accounts..like hotmail, gmail, etc and most work accounts. If your work has a BES or a Blackberry Enterprise server, you'll need the BES plan to get access to your work email. For more information, I'd contact your IT guy right away. BES costs more than BIS and so if you don't need it, I wouldn't get it.
3) On AT&T, tethering is NOT included in the standard BB data plan.
I hope this helps.
08-04-09 11:13 PM
3. jamezbb8110's Avatar
3) On AT&T, tethering is NOT included in the standard BB data plan.
Can you elaborate? What is "tethering"? Is this for connecting my laptop to the web via my bb?
If that's the case, I don't think I'll need it as I have a Verizon aircard.
08-04-09 11:20 PM
4. Artemis68's Avatar
Can you elaborate? What is "tethering"? Is this for connecting my laptop to the web via my bb?
If that's the case, I don't think I'll need it as I have a Verizon aircard.
Sure! Tethering is when you hook up your BB to your computer to get internet, so yep, you're right.
You have an Aircard so you're fine then. You don't need tethering. I bet you get better speeds on the Aircard anyway.
08-04-09 11:23 PM
LINK TO POST COPIED TO CLIPBOARD
|
{
"url": "https://forums.crackberry.com/blackberry-curve-series-f52/new-blackberry-data-usage-t-286613/",
"source_domain": "forums.crackberry.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "66381",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KTN7AZAZSUSCJYQJYCRLSVXKTSBXKVR5",
"WARC-Concurrent-To": "<urn:uuid:c385ce99-0d14-415a-b08e-0d1ea6b610af>",
"WARC-Date": "2022-01-26T04:45:38Z",
"WARC-IP-Address": "104.18.17.51",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:XOU67BJU7KQY5U4ORVQDJ2FXAMJ2VG2E",
"WARC-Record-ID": "<urn:uuid:0a786472-cab0-4679-bf7d-c79812a3b999>",
"WARC-Target-URI": "https://forums.crackberry.com/blackberry-curve-series-f52/new-blackberry-data-usage-t-286613/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8368f162-f6df-40ef-ba26-7fc98f95b299>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-141\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,
26,
64,
65,
257,
258,
394,
395,
462,
547,
582,
583,
584,
596,
618,
642,
787,
788,
967,
968,
1366,
1367,
1439,
1440,
1463,
1485,
1511,
1583,
1682,
1762,
1784,
1808,
1907,
1987,
2091,
2092,
2214,
2236
],
"line_end_idx": [
26,
64,
65,
257,
258,
394,
395,
462,
547,
582,
583,
584,
596,
618,
642,
787,
788,
967,
968,
1366,
1367,
1439,
1440,
1463,
1485,
1511,
1583,
1682,
1762,
1784,
1808,
1907,
1987,
2091,
2092,
2214,
2236,
2268
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2268,
"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.365107923746109,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0917266234755516,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2715827226638794,
"rps_doc_frac_unique_words": 0.4350000023841858,
"rps_doc_mean_word_length": 4.085000038146973,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.005395680200308561,
"rps_doc_unigram_entropy": 4.783975124359131,
"rps_doc_word_count": 400,
"rps_doc_frac_chars_dupe_10grams": 0.21787026524543762,
"rps_doc_frac_chars_dupe_5grams": 0.21787026524543762,
"rps_doc_frac_chars_dupe_6grams": 0.21787026524543762,
"rps_doc_frac_chars_dupe_7grams": 0.21787026524543762,
"rps_doc_frac_chars_dupe_8grams": 0.21787026524543762,
"rps_doc_frac_chars_dupe_9grams": 0.21787026524543762,
"rps_doc_frac_chars_top_2gram": 0.03365973010659218,
"rps_doc_frac_chars_top_3gram": 0.018359849229454994,
"rps_doc_frac_chars_top_4gram": 0.018359849229454994,
"rps_doc_books_importance": -312.747314453125,
"rps_doc_books_importance_length_correction": -312.747314453125,
"rps_doc_openwebtext_importance": -177.67611694335938,
"rps_doc_openwebtext_importance_length_correction": -177.67611694335938,
"rps_doc_wikipedia_importance": -122.51744079589844,
"rps_doc_wikipedia_importance_length_correction": -122.51744079589844
},
"fasttext": {
"dclm": 0.7416872382164001,
"english": 0.9541808366775513,
"fineweb_edu_approx": 0.9354549646377563,
"eai_general_math": 0.11917322874069214,
"eai_open_web_math": 0.1832755208015442,
"eai_web_code": 0.0030779798980802298
}
}
|
{
"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": "652.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Business communication, Typewriting, Copying processes, and Word processing"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,769,546,745,081,645,000
|
Mushroom Emoji Icon Mushroom Emoji
Unicode U+1F344, introduced by Unicode version V6.0 in 2010
The 'mushroom' emoji is a special symbol that can be used on smartphones, tablets, and computers. Your device needs to support this particular emoji in order for you to be able to use it, otherwise the emoji may not appear.
On many devices, you can use the shortcode :mushroom: to add the mushroom emoji to your messages.
Different devices may have different versions of the mushroom emoji. The chart on this page shows how this emoji is displayed on Android, iOS, and other platforms.
Keywords (click to find more): mushroom, nature, plant
🍄
Copy this emoji
To use 'mushroom' on social media like Twitter, Facebook, or Instagram, you can copy the emoji character on the left. This is a special character, not an image, so it can be used anywhere.
Click To Tweet This Emoji: 🍄
How does the Mushroom emoji look across different devices?
🍄
Browser
Mushroom Emoji (Android Version)
Android (Old)
Mushroom Emoji (Google Hangouts / Android Version)
Android (New)
Mushroom Emoji (Apple/iOS Version)
Apple iOS
Mushroom Emoji (Twitter Version)
Twitter
Mushroom Emoji (Symbola Version)
Symbola
Geeky Emoji Details (For Web & App Developers)
unicode version unicode hex html hex entity html decimal entity hex entity test shortcode
V6.0 U+1F344 🍄 🍄 🍄 :mushroom:
introduction year codepoint (Unicode) codepoint (DoCoMo) codepoint (KDDI) codepoint (Softbank) codepoint (Google)
2010 127812 N/A U+EB37 N/A U+FE04B
Why does this emoji show up as a blank box () or an X?
Not all emojis are supported by every device. If you are trying to view an emoji your device doesn't support, you will see a blank white box or similar symbol () to represent a character your device doesn't understand.
How can I use this emoji on my social media accounts?
Facebook, Twitter, Instagram, and most other social networks have built-in support for standard emojis that can be accessed through a menu. You can also copy and paste the text version of the mushroom emoji (🍄) into your social media posts. Keep in mind that not everyone sho sees your post may have support for these emojis, and Twitter and Facebook limit the emojis you can use in your name and description.
Tweet This Emoji 🍄
EmojiBase EmojiMaster Game
Put your cognition and reaction times to the test by identifying as many emoji as you can within the time limit. Can you reach Gold Level?
Play EmojiMaster Now!
emoji similar to 'mushroom'
Grinning Cat Face With Smiling Eyes
National Park
Hot Pepper
Tulip
Remember: Different devices have different versions of the same emojis!
|
{
"url": "https://www.emojibase.com/emoji/1f344/mushroom",
"source_domain": "www.emojibase.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "15044",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5TRMZLIUYARD5NOCKXM54JRGINGIOVLH",
"WARC-Concurrent-To": "<urn:uuid:e2385edc-b7dc-4787-a3a4-c5f81939fa1c>",
"WARC-Date": "2019-01-19T13:38:15Z",
"WARC-IP-Address": "104.28.27.71",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VPKMIBD3Y3ZFEQQIB2M36DOM5WGJ7QSO",
"WARC-Record-ID": "<urn:uuid:1c06c34a-f4ef-4e99-800a-3a199fad2d45>",
"WARC-Target-URI": "https://www.emojibase.com/emoji/1f344/mushroom",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:70ad7111-ad69-43a5-a601-006441a1b1e5>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-145-104-113.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,
35,
36,
96,
97,
321,
322,
420,
421,
585,
586,
641,
642,
644,
645,
661,
662,
851,
852,
881,
882,
941,
942,
944,
945,
953,
954,
987,
988,
1002,
1003,
1054,
1055,
1069,
1070,
1105,
1106,
1116,
1117,
1150,
1151,
1159,
1160,
1193,
1194,
1202,
1203,
1250,
1251,
1341,
1387,
1501,
1536,
1592,
1812,
1866,
2276,
2295,
2296,
2323,
2324,
2463,
2464,
2486,
2514,
2550,
2551,
2565,
2566,
2577,
2583
],
"line_end_idx": [
35,
36,
96,
97,
321,
322,
420,
421,
585,
586,
641,
642,
644,
645,
661,
662,
851,
852,
881,
882,
941,
942,
944,
945,
953,
954,
987,
988,
1002,
1003,
1054,
1055,
1069,
1070,
1105,
1106,
1116,
1117,
1150,
1151,
1159,
1160,
1193,
1194,
1202,
1203,
1250,
1251,
1341,
1387,
1501,
1536,
1592,
1812,
1866,
2276,
2295,
2296,
2323,
2324,
2463,
2464,
2486,
2514,
2550,
2551,
2565,
2566,
2577,
2583,
2654
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2654,
"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.307407408952713,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03148147836327553,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20370370149612427,
"rps_doc_frac_unique_words": 0.43981480598449707,
"rps_doc_mean_word_length": 4.831018447875977,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.0037036999128758907,
"rps_doc_unigram_entropy": 4.809295177459717,
"rps_doc_word_count": 432,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0249161496758461,
"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.0747484415769577,
"rps_doc_frac_chars_top_3gram": 0.03833252936601639,
"rps_doc_frac_chars_top_4gram": 0.022041210904717445,
"rps_doc_books_importance": -204.93081665039062,
"rps_doc_books_importance_length_correction": -204.93081665039062,
"rps_doc_openwebtext_importance": -121.46051025390625,
"rps_doc_openwebtext_importance_length_correction": -121.46051025390625,
"rps_doc_wikipedia_importance": -78.47633361816406,
"rps_doc_wikipedia_importance_length_correction": -78.47633361816406
},
"fasttext": {
"dclm": 0.1095728874206543,
"english": 0.8198081851005554,
"fineweb_edu_approx": 2.0870304107666016,
"eai_general_math": 0.027221139520406723,
"eai_open_web_math": 0.29209548234939575,
"eai_web_code": 0.008454440161585808
}
}
|
{
"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": "302.23",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"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": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,010,493,899,156,657,000
|
Time
36 minutes
Difficulty
Intermediate
CEU/CPE
1
Video Transcription
00:00
Hello, everybody. And welcome back, as you could see, were in the AWS management Consul. I'm gonna go ahead and head over to VP sees and when you're looking for network A C. L's on the settings, the change for your a c l's they will be sitting within the biggest e dashboard you could head under here on your security
00:19
goto network A seals.
00:20
And remember, I talked about how when he set up an account, you get a default TPC and you also get a default network A seal. Well, this is what I'm talking about. If I go over here to your VP, sees you're going to see I have my vpc and under default says yes,
00:39
wealthy
00:41
know where j. C. L is also associated with That is also says defaults. It says yes, there. And when I was talking about in the slides with the inbound and outbound rules, I was talking about this right here, all traffic, all particles, Allport ranges. All destinations are allowed on my m bound
01:00
and my heart pounds. I know that is just so that in reverse. But you know what I mean. It is allowed across the board And in order for you to change this, what you have to do is you have to change the rule number or you have to edit inbound rules, maybe admit and our rules. And what this rule number does is since your
01:21
rules by priority. So
01:23
the lower the number, the higher their priority. This one's obviously set 200. So just to simplify if I were to set a new rule to 99 I said, deny all protocols, denial port ranges and deny from everywhere and set tonight here, then
01:41
it would overrule this
01:44
ruling right here
01:46
on. You can edit that by adding a new rule saying, 99 I want all actually, let's do all traffic,
01:57
all traffic,
01:59
all protocols, everything
02:01
deny.
02:04
And as you can see a sense, it is the higher priority, and it's going to deny everything and overrule this one. If I were to, uh, let's say, edit the rule and assisting on traffic, I say I want to block sshh
02:21
and I want to block it from everywhere in the world's I can save it. And now what it's gonna do is this going to allow all traffic from everywhere except for estate. She just won't allow SS age from anywhere. You can change
02:36
the inbound and outbound rules right here. That's simply and every single easy to instance that's attached to this network. A CEO which these air things you change when you're you set into place. When you're setting up your VP sees and when you're deploying, you're easy to insist is you get to choose which ABC you want to stick him into, um, these security settings air going to control that
02:58
from the gecko, and and it's super simple. As you can see, I can change it for imbalance can change for outbound. And, uh, yeah, Amazon takes care of the rest of it for you. So hopefully that was helpful. Um, if you have any questions, feel free to reach out to me. All right, I'll talk to you later.
03:14
All right. I'll see in the next lecture
Up Next
AWS Infrastructure Security
Looking to learn more about the security infrastructure offerings with AWS? You’re in luck! AWS offers a multitude of tools that secure your network and systems and in this course, we will introduce you to them.
Instructed By
Instructor Profile Image
Nicolas Moy
Senior Cloud Security Engineer
Instructor
|
{
"url": "https://www.cybrary.it/video/network-acls-part-2/",
"source_domain": "www.cybrary.it",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "713622",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H4IRTOIH7UUEZWYHXBPGUDFJW7IUGJKV",
"WARC-Concurrent-To": "<urn:uuid:88d28d9a-a40f-48a3-92e3-699050ef169d>",
"WARC-Date": "2020-09-23T16:40:24Z",
"WARC-IP-Address": "52.85.144.92",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NNVV3QG2GS5GEY76CYVJCDCJJARJ6D36",
"WARC-Record-ID": "<urn:uuid:9c276e9e-64d0-4dc5-ae04-f43ff3ec9849>",
"WARC-Target-URI": "https://www.cybrary.it/video/network-acls-part-2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:44547dae-aa32-4280-9860-75a7eb751c1d>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-108.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,
5,
16,
27,
40,
48,
50,
51,
71,
72,
78,
396,
402,
424,
430,
690,
696,
704,
710,
1005,
1011,
1331,
1337,
1359,
1365,
1597,
1603,
1626,
1632,
1650,
1656,
1753,
1759,
1772,
1778,
1804,
1810,
1816,
1822,
2030,
2036,
2260,
2266,
2660,
2666,
2967,
2973,
3013,
3014,
3022,
3023,
3051,
3052,
3264,
3265,
3279,
3280,
3305,
3317,
3348
],
"line_end_idx": [
5,
16,
27,
40,
48,
50,
51,
71,
72,
78,
396,
402,
424,
430,
690,
696,
704,
710,
1005,
1011,
1331,
1337,
1359,
1365,
1597,
1603,
1626,
1632,
1650,
1656,
1753,
1759,
1772,
1778,
1804,
1810,
1816,
1822,
2030,
2036,
2260,
2266,
2660,
2666,
2967,
2973,
3013,
3014,
3022,
3023,
3051,
3052,
3264,
3265,
3279,
3280,
3305,
3317,
3348,
3358
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3358,
"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.45854270458221436,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05150754004716873,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20854270458221436,
"rps_doc_frac_unique_words": 0.43015873432159424,
"rps_doc_mean_word_length": 4.126984119415283,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.103973865509033,
"rps_doc_word_count": 630,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03384615108370781,
"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.007692310027778149,
"rps_doc_frac_chars_top_3gram": 0.010384620167315006,
"rps_doc_frac_chars_top_4gram": 0.009999999776482582,
"rps_doc_books_importance": -308.123779296875,
"rps_doc_books_importance_length_correction": -308.123779296875,
"rps_doc_openwebtext_importance": -166.3455047607422,
"rps_doc_openwebtext_importance_length_correction": -166.3455047607422,
"rps_doc_wikipedia_importance": -141.38734436035156,
"rps_doc_wikipedia_importance_length_correction": -141.38734436035156
},
"fasttext": {
"dclm": 0.020230470225214958,
"english": 0.9726436734199524,
"fineweb_edu_approx": 1.1957191228866577,
"eai_general_math": 0.29726165533065796,
"eai_open_web_math": 0.3528236150741577,
"eai_web_code": 0.2360730767250061
}
}
|
{
"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.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,251,715,117,992,852,700
|
Super User is a question and answer site for computer enthusiasts and power users. 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 am currently using Linux Mint 14 - Nadia as my Operating System.
The biggest inconvenience right now is not being able to open Libreoffice as a normal user or simply by just double clicking it. Every time I have to run it as root .
$sudo libreoffice3.6
Even to open a simple document, I have to open do it by the terminal itself
$sudo libreoffice3.6 document.doc
Here is the error messages I get if I try to open it without being root.
$ libreoffice3.6
[Java framework] Error in function createSettingsDocument (elements.cxx).
javaldx failed!
Warning: failed to read path from javaldx
terminate called after throwing an instance of 'com::sun::star::uno::RuntimeException'
Is there anyway to get around this? -------EDIT--------
Output of ls -l $(which libreoffice3.6)`
$ ls -l $(which libreoffice3.6)
lrwxrwxrwx 1 root root 35 Nov 28 15:23 /usr/bin/libreoffice3.6 -> /opt/libreoffice3.6/program/soffice
share|improve this question
1
As root user you run libreoffice. Why do you run libreoffice3.6 with your user instead? Could you add the output of ls -l $(which libreoffice) and ls -l $(which libreoffice3.6)? – jaume Mar 12 '13 at 7:34
@jaume , sorry about that , it was a typo it is ibreoffice3.6 with both normal and root user – Barath Bushan Mar 12 '13 at 7:38
@jaume , i have added output of ls -l $(which libreoffice3.6) – Barath Bushan Mar 12 '13 at 7:42
up vote 8 down vote accepted
Perhaps you have the same problem as this guy did.
Make sure your user owns ~/.config and everything in it.
This should do it:
sudo chown -R --reference="$HOME" ~/.config
It'll change everything in that directory to have the same owner and group as your home directory, which should have the proper values.
share|improve this answer
perfect answer , thank you !! – Barath Bushan Mar 13 '13 at 2:20
It looks like your username is not identified by linux to have enough privilege to run commands. A few things you should check like:
Make sure you are in sudo group with this command.
$ getent group sudo
It should show output as sudo:x:27:fayad
If you are not in it add the username with
$ sudo gpasswd -a <user> sudo
Crosscheck your /etc/sudoers by opening the file and confirming it has the following lines.
# Allow members of group sudo to execute any command
%sudo ALL=(ALL:ALL) ALL
share|improve this answer
after running getent group sudo , i got sudo:x:27:barath , which matches , what you posted. and even the /etc/sudoers file is exactly in place , as you have specified... – Barath Bushan Mar 12 '13 at 17:54
Okay, do you get the same results with other applications too? You could also try uninstalling Libreoffice using synaptic and doing a fresh install to see if its the same. – paintbox Mar 12 '13 at 18:39
1
the other answer fixed it ,thanks for your help !! – Barath Bushan Mar 13 '13 at 2:22
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://superuser.com/questions/564534/only-root-user-is-able-to-open-libreoffice",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "81948",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TNUTLNQOZXLF3PJP5YNPXBWQ7OEP5GGG",
"WARC-Concurrent-To": "<urn:uuid:dc85f52e-e6be-421c-86a6-d52a412443c0>",
"WARC-Date": "2016-02-09T06:03:13Z",
"WARC-IP-Address": "104.16.33.193",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MUJ6UVT3I4WZC3CF7QEXCALBFQETIO3T",
"WARC-Record-ID": "<urn:uuid:90141098-91f7-43d8-bcf4-c9d7632cf01f>",
"WARC-Target-URI": "http://superuser.com/questions/564534/only-root-user-is-able-to-open-libreoffice",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a05dce66-ee2a-47e3-b610-c1ba8510b58f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 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,
125,
126,
134,
155,
187,
211,
266,
267,
334,
335,
502,
503,
525,
526,
602,
603,
637,
638,
711,
712,
729,
803,
820,
862,
949,
950,
1006,
1007,
1048,
1049,
1081,
1183,
1211,
1215,
1420,
1425,
1553,
1558,
1655,
1684,
1685,
1736,
1737,
1794,
1795,
1814,
1815,
1859,
1860,
1996,
1997,
2023,
2028,
2093,
2094,
2227,
2228,
2279,
2280,
2300,
2301,
2342,
2343,
2386,
2387,
2417,
2418,
2510,
2511,
2564,
2565,
2589,
2590,
2616,
2621,
2827,
2832,
3035,
3039,
3125,
3126,
3138,
3139,
3141,
3149,
3150,
3228,
3229
],
"line_end_idx": [
125,
126,
134,
155,
187,
211,
266,
267,
334,
335,
502,
503,
525,
526,
602,
603,
637,
638,
711,
712,
729,
803,
820,
862,
949,
950,
1006,
1007,
1048,
1049,
1081,
1183,
1211,
1215,
1420,
1425,
1553,
1558,
1655,
1684,
1685,
1736,
1737,
1794,
1795,
1814,
1815,
1859,
1860,
1996,
1997,
2023,
2028,
2093,
2094,
2227,
2228,
2279,
2280,
2300,
2301,
2342,
2343,
2386,
2387,
2417,
2418,
2510,
2511,
2564,
2565,
2589,
2590,
2616,
2621,
2827,
2832,
3035,
3039,
3125,
3126,
3138,
3139,
3141,
3149,
3150,
3228,
3229,
3319
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3319,
"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.34630870819091797,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01744966022670269,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2832214832305908,
"rps_doc_frac_unique_words": 0.45703840255737305,
"rps_doc_mean_word_length": 4.564899444580078,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0.0026845599059015512,
"rps_doc_unigram_entropy": 5.0913920402526855,
"rps_doc_word_count": 547,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08249899744987488,
"rps_doc_frac_chars_dupe_6grams": 0.06728073954582214,
"rps_doc_frac_chars_dupe_7grams": 0.044052861630916595,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011213460005819798,
"rps_doc_frac_chars_top_3gram": 0.016019219532608986,
"rps_doc_frac_chars_top_4gram": 0.018021630123257637,
"rps_doc_books_importance": -317.91436767578125,
"rps_doc_books_importance_length_correction": -317.91436767578125,
"rps_doc_openwebtext_importance": -205.45106506347656,
"rps_doc_openwebtext_importance_length_correction": -205.45106506347656,
"rps_doc_wikipedia_importance": -182.9566650390625,
"rps_doc_wikipedia_importance_length_correction": -182.9566650390625
},
"fasttext": {
"dclm": 0.13380879163742065,
"english": 0.8763564825057983,
"fineweb_edu_approx": 1.5162194967269897,
"eai_general_math": 0.006707069929689169,
"eai_open_web_math": 0.10477268695831299,
"eai_web_code": 0.0002594600082375109
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,069,827,402,573,382,000
|
BinaryWriter
BinaryWriter
Provides methods to write typed information to a stream.
Remarks
The datatypes that are written to the stream are written in their binary form. The value are written as they are represented in memory. For example, as datatype of vbLong is written as 4 bytes, regardless of the actual value of the vbLong variable.
See Also
Project VBCorLib Overview | Constructors | BinaryReader
Implements:
IObject
Public:
Properties:
NameDescription
BaseStream (get)Returns the underlying stream this writer is writing to.
Methods:
NameDescription
CloseWriterCloses the writer, flushing any data.
EqualsReturns a boolean indicating if the value and this object instance are the same instance.
FlushTells the underlying stream to store its data to its repository.
GetHashCodeReturns a pseudo-unique number identifying this instance.
SeekPositionSets the underlying streams current position.
ToStringReturns a string representation of this object instance.
WriteCharWrites a character to the underlying stream.
WriteValueWrites the binary representation of a datatype to the underlying stream.
|
{
"url": "http://www.kellyethridge.com/vbcorlib/doc/BinaryWriter.html",
"source_domain": "www.kellyethridge.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "5364",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X5NXHOMZ3UWZR7NFU5OGB46T4CXGMNH5",
"WARC-Concurrent-To": "<urn:uuid:77c3d18d-bc8b-43e4-b755-d8666577264c>",
"WARC-Date": "2019-01-22T12:19:35Z",
"WARC-IP-Address": "199.188.200.94",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JI7A34BCBUDUP2LW6WX4PCLHDDSBEIRN",
"WARC-Record-ID": "<urn:uuid:da20712f-f4d5-4e6b-996b-5b8f3569b101>",
"WARC-Target-URI": "http://www.kellyethridge.com/vbcorlib/doc/BinaryWriter.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d9fb97c8-66a4-4419-84d4-ebc95abec5c9>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-159-152-254.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,
2,
15,
16,
29,
30,
31,
88,
89,
90,
98,
99,
348,
349,
358,
359,
415,
416,
428,
429,
438,
439,
447,
448,
460,
461,
477,
552,
553,
562,
563,
579,
630,
728,
800,
871,
931,
998,
1054
],
"line_end_idx": [
2,
15,
16,
29,
30,
31,
88,
89,
90,
98,
99,
348,
349,
358,
359,
415,
416,
428,
429,
438,
439,
447,
448,
460,
461,
477,
552,
553,
562,
563,
579,
630,
728,
800,
871,
931,
998,
1054,
1138
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1138,
"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.3483146131038666,
"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.14606742560863495,
"rps_doc_frac_unique_words": 0.5496688485145569,
"rps_doc_mean_word_length": 6.125827789306641,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.0869879722595215,
"rps_doc_word_count": 151,
"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.07027027010917664,
"rps_doc_frac_chars_top_3gram": 0.08216215670108795,
"rps_doc_frac_chars_top_4gram": 0.04540541023015976,
"rps_doc_books_importance": -87.4533920288086,
"rps_doc_books_importance_length_correction": -87.4533920288086,
"rps_doc_openwebtext_importance": -51.55411148071289,
"rps_doc_openwebtext_importance_length_correction": -47.12746047973633,
"rps_doc_wikipedia_importance": -46.701900482177734,
"rps_doc_wikipedia_importance_length_correction": -46.701900482177734
},
"fasttext": {
"dclm": 0.4367465376853943,
"english": 0.762719452381134,
"fineweb_edu_approx": 2.859081745147705,
"eai_general_math": 0.8284825682640076,
"eai_open_web_math": 0.21997064352035522,
"eai_web_code": 0.8897866010665894
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,827,897,584,805,165,600
|
Do motherboards with wifi come with an antenna? ( Explained)
Do motherboards with wifi come with an antenna?
A wifi antenna on a motherboard is an integral part of any computer for improved wifi connectivity, as it provides a stable wireless connection to the internet. Most WiFi adapters require an antenna that is attached directly or indirectly to the motherboard. The question most people shopping around for the best motherboard with better wifi ask is whether motherboards with wifi come with an antenna?
In general, motherboards with built-in wifi do not always come with an antenna. Instead, they rely upon the strength of the gateway router signal to connect with the computer using the built-in wifi chipset. A separate external antenna device like a wifi PCIe card can be used where it’s needed. However, most motherboards will connect to wifi or an internet signal effortlessly with an onboard wifi chipset without needing a wifi add-on antenna.
Motherboards often come with two distinct types of antennas: one inside the computer case and an external antenna for better reception. Most of the time, the built-in antenna is situated inside a computer case and requires a direct line of sight to a wireless router or other devices that broadcasts internet signal. The onboard antenna also uses cables included in its packaging with which you can easily attach to your motherboard.
In some cases, if the wifi chipset is located next to the CPU, you must attach a metal plate on top of it. This helps to protect it from overheating and dissipate heat faster through the plate.
In some video cards with wifi, there may be a separate antenna that comes with its own cable where a 3rd party can plug into an available port or slot provided on the motherboard.
Motherboard with or without wifi
Motherboards sold on the market today have either a wifi or no-wifi version with the only difference being in the price of the motherboard in which you can buy a cheaper “no wifi” motherboard.
The most important factor in deciding if an add-on antenna is necessary for better reception is the signal strength from your router or access point, even when it’s located directly above it.
However, if you are looking at the best motherboard for gaming , chances are built-in wifi is usually not available in its specifications list since most gamers prefer to have the latest hardware to play games with better frames per second (FPS). Many high-end motherboards can be connected to an ethernet cable for faster speeds compared to wifi connection.
Most of today’s laptops and computer motherboards come with wifi as a standard feature built-in, where some manufacturers such as Acer and Asus don’t even make laptop models without built-in wifi.
If you are looking to buy a new laptop without wifi, usually it will be less expensive than those with built-in wireless LAN. Still, if you are looking to play games, you can always purchase a separate video card with wifi instead.
Wifi antennas that come with most motherboards are great for home use or light internet browsing, but they are also very easy to install where they don’t require much effort and time. They typically perform at their best and provide better reception in homes and offices where wifi signal is relatively good.
However, as the demand for better internet connectivity and streaming video continues to grow, many people choose to buy a separate antenna that can be attached anywhere outside their house or office to receive a stronger and more stable wifi signal than built-in antennas. However, if you don’t need it for any reason, there is no reason to buy a separate antenna.
What does built-in WiFi do on a motherboard?
If you are not aware of what a built-in Wifi do on a motherboard, it’s a small chip that receives the internet signal and transmits it to your computer. This is an alternative to plugging in wires where it doesn’t require any additional effort or time to set up, which you can do by simply attaching your antenna cable directly into its slot on top of the motherboard.
Is built-in WiFi on the motherboard good
Built-in wifi on the motherboard is good for streaming videos and browsing the internet. However, if you are looking to play games, it will be better to have a separate video card with a wifi antenna instead. Wifi PCIe cards are often used so that you get maximum frames per second where most laptops have built-in cards without this feature.
Thus, motherboards with WiFi include an antenna cable which you can easily connect to your motherboard. In some cases, a metal plate may be necessary if the wifi chipset is below the CPU.
In some video cards with WiFi, there is a separate antenna that can be plugged into an available port or PCIe slot provided on the motherboard.
Most of today’s laptops and computer motherboards come with built-in wifi as a standard feature, where some manufacturers such as Acer and Asus don’t even make laptop models without built-in wifi.
If you are looking to buy a new laptop without wifi, usually it will be less expensive than those with built-in wireless LAN. Still, if you are looking to play games, you can always purchase a separate video card with wifi instead.
Built-in wifi on the motherboard is usually sufficient for streaming videos and light web browsing, but it’s not recommended if you are looking to play games. It will be better to have a separate video card with built-in wifi instead since most laptops do not come with this feature.
Should I get a motherboard with or without WiFi?
If you are not looking to play games, it will be better to get a motherboard with built-in wifi. If you are looking to play games, you should purchase a separate video card with an antenna instead since most laptops do not come with this feature.
What is the difference between WiFi cards and antennas?
WiFi antennas are usually used for gaming whereas wifi cards are for streaming videos. They both work the same way, but antennas are often designed to be more powerful than cards where they can send and receive signals at longer distances, while cards tend to be more compact and may only have a range of 100 feet.
Can I attach an external antenna to my built-in wifi on the motherboard?
You should not attach an antenna to your motherboard’s built-in wifi since it will cause poor reception. You can always purchase a separate video card with wifi instead, even though laptop models only come with built-in cards.
Do motherboards need antennas?
Motherboards do not require antennas since they are already equipped with them as standard features. You can always purchase a separate video card with an antenna for better reception and performance if you are looking to play games.
Built-in wifi motherboard vs Pcie wifi card
There are subtle differences between the motherboard with built-in wifi vs a PCI WiFi card.
Motherboards with onboard wireless or “built-in” are usually included as part of the PC’s hardware whereas external cards plug into an available slot on your PC such as your PCIe x1, x4, x16, etc. slots.
External wireless cards require an open slot on your PC to plug in whereas built-in wireless cards are already pre-installed within the motherboard. There is no need to install an additional card for this feature.
Antennas are also included with both types of wireless cards, where it’s usually attached directly onto the card itself.
Built-in WiFi vs separate PCI-E card
Another difference between built-in wifi on the motherboard vs a PCI WiFi card is that cards usually come with removable antennas while motherboards do not.
Motherboard cards are usually installed in slots on your PC, whereas an external PC wireless card will be plugged into an available slot of your computer. The majority of quality motherboards manufactured by known gaming computer brands like ASUS, Gigabyte, MSI, etc. are already equipped with built-in wireless LAN to save cost and space without the need for additional cards or antennas.
Deciding between a motherboard with or without WiFi?
If you are not looking to play games, it will be better to get a motherboard with built-in wifi. If you are looking to play games, you should purchase a separate video card with an antenna instead since most laptops do not come with this feature.
Conclusion.
Overall, motherboards without built-in wifi will not include antennas as part of the hardware. You can always purchase a separate video card with an antenna for better reception if needed. Otherwise, the built-in wifi on the motherboard will be more than enough to stream videos or browse the internet.
Recent Posts
|
{
"url": "https://techaholist.com/do-motherboards-with-wifi-come-with-an-antenna/",
"source_domain": "techaholist.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "67514",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DMNUBTGRL7XWVSC3IKX6LLESJBHAGUPC",
"WARC-Concurrent-To": "<urn:uuid:bbadf30f-7bd4-4a0b-9ce9-1e5b77856432>",
"WARC-Date": "2022-10-02T21:47:23Z",
"WARC-IP-Address": "104.21.13.158",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XYZNX6MJP35H5CBEFYMKTFLSNKAA4JW2",
"WARC-Record-ID": "<urn:uuid:7720ad29-21db-4964-97e7-e31cbd58a9fa>",
"WARC-Target-URI": "https://techaholist.com/do-motherboards-with-wifi-come-with-an-antenna/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5b3326b8-4905-4f3e-995e-c2b22e40f38c>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-142\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,
61,
62,
63,
111,
112,
514,
515,
962,
963,
1397,
1398,
1592,
1593,
1773,
1774,
1807,
1808,
2001,
2002,
2194,
2195,
2554,
2555,
2752,
2753,
2985,
2986,
3295,
3296,
3662,
3663,
3708,
3709,
4078,
4079,
4120,
4121,
4464,
4465,
4653,
4654,
4798,
4799,
4996,
4997,
5229,
5230,
5514,
5515,
5564,
5565,
5812,
5813,
5869,
5870,
6185,
6186,
6259,
6260,
6487,
6488,
6519,
6520,
6754,
6755,
6799,
6800,
6892,
6893,
7097,
7098,
7312,
7313,
7434,
7435,
7472,
7473,
7630,
7631,
8021,
8022,
8075,
8076,
8323,
8324,
8336,
8337,
8640,
8641
],
"line_end_idx": [
61,
62,
63,
111,
112,
514,
515,
962,
963,
1397,
1398,
1592,
1593,
1773,
1774,
1807,
1808,
2001,
2002,
2194,
2195,
2554,
2555,
2752,
2753,
2985,
2986,
3295,
3296,
3662,
3663,
3708,
3709,
4078,
4079,
4120,
4121,
4464,
4465,
4653,
4654,
4798,
4799,
4996,
4997,
5229,
5230,
5514,
5515,
5564,
5565,
5812,
5813,
5869,
5870,
6185,
6186,
6259,
6260,
6487,
6488,
6519,
6520,
6754,
6755,
6799,
6800,
6892,
6893,
7097,
7098,
7312,
7313,
7434,
7435,
7472,
7473,
7630,
7631,
8021,
8022,
8075,
8076,
8323,
8324,
8336,
8337,
8640,
8641,
8653
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8653,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.48461538553237915,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012426040135324001,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10591716319322586,
"rps_doc_frac_unique_words": 0.23493151366710663,
"rps_doc_mean_word_length": 4.784931659698486,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.0596232414245605,
"rps_doc_word_count": 1460,
"rps_doc_frac_chars_dupe_10grams": 0.19410249590873718,
"rps_doc_frac_chars_dupe_5grams": 0.3296593129634857,
"rps_doc_frac_chars_dupe_6grams": 0.26839393377304077,
"rps_doc_frac_chars_dupe_7grams": 0.2371886670589447,
"rps_doc_frac_chars_dupe_8grams": 0.21986831724643707,
"rps_doc_frac_chars_dupe_9grams": 0.20870311558246613,
"rps_doc_frac_chars_top_2gram": 0.034640710800886154,
"rps_doc_frac_chars_top_3gram": 0.014886920340359211,
"rps_doc_frac_chars_top_4gram": 0.021471509709954262,
"rps_doc_books_importance": -716.0469360351562,
"rps_doc_books_importance_length_correction": -716.0469360351562,
"rps_doc_openwebtext_importance": -431.97393798828125,
"rps_doc_openwebtext_importance_length_correction": -431.97393798828125,
"rps_doc_wikipedia_importance": -332.9347839355469,
"rps_doc_wikipedia_importance_length_correction": -332.9347839355469
},
"fasttext": {
"dclm": 0.4407360553741455,
"english": 0.9534174203872681,
"fineweb_edu_approx": 1.658476710319519,
"eai_general_math": 0.05432235822081566,
"eai_open_web_math": 0.05578136071562767,
"eai_web_code": 0.014893829822540283
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.66",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "9",
"label": "FAQ"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,102,775,413,152,543,400
|
Windows 10: Microsoft Store Game Saves
Discus and support Microsoft Store Game Saves in Windows 10 Gaming to solve the problem; I mostly play 'The Tribez', and 'Trade Island'. I was having many problems with games not updating, and apps not installing with the Microsoft... Discussion in 'Windows 10 Gaming' started by FalseZen, Feb 21, 2021 at 4:17 AM.
1. FalseZen Win User
Microsoft Store Game Saves
I mostly play 'The Tribez', and 'Trade Island'.
I was having many problems with games not updating, and apps not installing with the Microsoft Store. The dreaded 0x80073D05 error had overtaken almost all my apps.
So I decided to start over fresh by restoring my Windows 10 PC, and just let it uninstall all of my apps. I already have everything important backed up on my external 6tb Seagate Expansion drive.
Before doing this I looked in "C:\Users\mypcname\Saved Games" to back up this data too, but it was empty. I figured it must save games through the cloud, since neither game had any options to link to Facebook or Google Play.
It didn't take long to do this. I was back to re-installing my Windows 10 Microsoft Store games in about two hours. This time every thing installed perfectly, and the dreaded 0x80073D05 error was history.
However, when I went to play both 'The Tribez' and 'Trade Island', it wasn't long before I realized that an option to restore from the cloud was never going to be given! NOOOO!!!
I really wish I had taken then time to write down my support I.D. Of course I had no way of knowing it would ever be needed. I would like to know how I can restore my game saves! I have spent actual money on 'The Tribez', and I would like to continue playing both of them. I have already tried contacting Game Insights. After posting once for each, I was informed that my limit had been reached. It seems that two is the maximum limit for support requests, and they have yet to get back to me. I first contacted them on Friday. Tried again to contact them on Saturday yesterday, no joy. So, now I'm asking here.
Can someone please help me?!?
:)
2. Microsoft Jigsaw Save File problem!
Hi WalGlynn,
Having a server interruption while playing is one of the possible reasons why your Microsoft Jigsaw save file has become corrupted. To help you resolve this concern, I recommend that you perform the troubleshooting steps below:
Step 1: Run the troubleshooter for Windows apps using the link below. This can help remove problems with an app from Microsoft Store.
Click here
Step 2: Delete Temporary files. This will help delete temporary files that have been stored on your computer.
1. Click Start and click Settings.
2. Select System.
3. Select Storage.
4. Select This PC.
5. Click Temporary files.
6. Choose Temporary files.
7. Click Remove files.
Step 3: Reset the game from the Settings menu.
1. Click Start and click Settings.
2. Select System.
3. Select Apps and features.
4. Find the game and click Advanced options.
5. Click Reset. You need to restart your computer to let the changes take effect.
If the issue persists, I suggest that you uninstall and reinstall the game. You may click the link below for the steps:
How to uninstall and reinstall a game on Windows 10
Kindly update us with the results.
3. Using games from the microsoft store
Based on the results you've obtained, this can be an issue with the Windows Store which affects the digital games you’ve downloaded from it. We suggest manually resetting the Windows Store cache. Here are the steps:
• Press the Windows + R keys to open the Run dialog box.
• Type WSReset.exe and click OK.
• The Store and a command prompt will now open with any message. The command prompt will automatically close after the Store's cache has been reset.
Once done with the reset, kindly click this
link
and follow the steps on how to check for updates for apps and games from Windows Store. Search if there are any updates available for the affected game.
Keep us updated with the progress.
Catherine Cus., Feb 21, 2021 at 4:20 AM
#3
4. Microsoft Store Game Saves
Install Microsoft Store Game In Specific Folder
Hi,
I understand that you want to organize your Windows 10 storage location. However, the feature you're looking for is currently not possible. We suggest sending feedback to Microsoft using Feedback Hub app. You can visit this
article to know more details about it.
Moreover, you could always choose a preferred location from the Store settings, or move installed content to a different drive. In case you have the OS installed on an SSD and have a dedicated drive for games, the feature will make it more convenient to
download games to a dedicated drive before initiating the download.
You can follow the steps below on how to install Windows Store apps on a separate drive:
1. Open Settings.
2. Click on System.
3. Click on Storage.
4. Under "Save locations," and on "New apps will save to," select the new drive location.
Once you completed the steps, new apps you download from the Windows Store will now install automatically in the new location.
If you need further assistance, don't hesitate to get back to us.
Michelle Vil, Feb 21, 2021 at 4:20 AM
#4
Thema:
Microsoft Store Game Saves
Loading...
1. Microsoft Store Game Saves - Similar Threads - Microsoft Store Game
2. Games on the microsoft store
in Microsoft Windows 10 Store
Games on the microsoft store: My brother wants to know if we can still share games when we buy them through the store, on windows 10, as you can on xbox; and play them at the same time. Like for instance Assassin's Creed Valhalla....
3. Microsoft Store, save game data problems.
in Microsoft Windows 10 Store
Microsoft Store, save game data problems.: Hi, can you help me with one problem in the game? I wanted to replace save game from other users on my The World of War Z on epic games platform i can easly transfer save progresion from other people, but it happened to me that I was going from scratch. I tried back up my...
4. Microsoft store and games
in Windows 10 Gaming
Microsoft store and games: Since the last update I cannot login to the Microsoft store or games. Is anyone else experiencing this? https://answers.microsoft.com/en-us/windows/forum/all/microsoft-store-and-games/67032b60-e943-4522-ba82-34c20505c10e
5. microsoft store-games
in Microsoft Windows 10 Store
microsoft store-games: Hello.I am newbe to games.I would ask you if i buy game from microsoft for pc should install any client like steam e.t.c?Also i buy games from microsoft store or is there any other official site?...
6. Microsoft store games
in Windows 10 Software and Apps
Microsoft store games: hello how do i make the microsoft app games windowed sized instead of full screen? please help https://answers.microsoft.com/en-us/windows/forum/all/microsoft-store-games/18de789b-3d94-44e4-bd23-3719ab312003
7. games on microsoft store
in Windows 10 Gaming
games on microsoft store: i bought a game before i bought the game pass and even when i had the game pass on computer it worked but then i reset my computer and now i cant download the game and i cant change the install location from my ssd to my hd...
8. How to restore instaled games and saves from Microsoft Store?!
in Windows 10 Gaming
How to restore instaled games and saves from Microsoft Store?!: I've lost all my saves and instaled games like Asphalt 8 and Forza Horizon 4 Ultimate. I don't knew how it happens. When I instaled again Asphalt 8 there is no my last save game began from the start with non progress. Please help! I paid before for Forza Horizon 4, and...
9. Savings Microsoft store games/xbox beta games to D drive
in Microsoft Windows 10 Store
Savings Microsoft store games/xbox beta games to D drive: I recently purchased a new PC around six months ago. it came with a SSD drive and large hard drive. I downloaded several games such as Forza 3 & 4 and Gears 4 & 5. i saved all these games on the D drive with no issues. Unfortunately last week my SSD failed and had to be...
10. Microsoft Store Games
in Windows 10 Gaming
Microsoft Store Games: I downloaded several pc games from my xbox game pass which I no longer have. I decided to uninstall them, and I did, but didn-t see any change on my drive memory capacity, which means, they were not removed at all. I can-t find them anymore on the microsoft store library...
|
{
"url": "https://www.windowsphoneinfo.com/threads/microsoft-store-game-saves.516568/",
"source_domain": "www.windowsphoneinfo.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "63948",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FP6YDVSBNNRA7ERHM72CBS6HJ5E2GDGS",
"WARC-Concurrent-To": "<urn:uuid:6f125364-6ac8-49ed-b803-77b7c59110c5>",
"WARC-Date": "2021-02-27T13:24:31Z",
"WARC-IP-Address": "50.30.38.234",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AVYUBWD66YFENRG3SBW5QDVCCXOOJWNG",
"WARC-Record-ID": "<urn:uuid:5f16617d-0884-4f3b-93ba-f174df481b6c>",
"WARC-Target-URI": "https://www.windowsphoneinfo.com/threads/microsoft-store-game-saves.516568/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:88be594a-4dca-4223-b0e9-68afce6c975c>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-227.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
39,
40,
355,
356,
379,
380,
411,
412,
413,
465,
466,
635,
636,
836,
837,
1066,
1067,
1276,
1277,
1460,
1461,
2077,
2078,
2112,
2113,
2120,
2126,
2127,
2168,
2169,
2186,
2187,
2419,
2420,
2558,
2559,
2574,
2575,
2689,
2690,
2729,
2751,
2774,
2797,
2827,
2858,
2885,
2886,
2937,
2938,
2977,
2999,
3032,
3081,
3167,
3168,
3292,
3293,
3349,
3350,
3389,
3395,
3437,
3438,
3658,
3659,
3720,
3757,
3910,
3958,
3967,
4124,
4125,
4164,
4170,
4214,
4221,
4253,
4254,
4306,
4307,
4315,
4316,
4544,
4587,
4588,
4846,
4918,
4919,
5012,
5013,
5035,
5059,
5084,
5178,
5179,
5310,
5311,
5381,
5387,
5429,
5436,
5443,
5444,
5471,
5472,
5483,
5556,
5557,
5591,
5592,
5626,
5864,
5911,
5912,
5946,
6269,
6300,
6301,
6326,
6578,
6605,
6606,
6640,
6866,
6893,
6894,
6930,
7165,
7195,
7196,
7221,
7478,
7546,
7547,
7572,
7913,
7975,
7976,
8010,
8346,
8374,
8375,
8400
],
"line_end_idx": [
39,
40,
355,
356,
379,
380,
411,
412,
413,
465,
466,
635,
636,
836,
837,
1066,
1067,
1276,
1277,
1460,
1461,
2077,
2078,
2112,
2113,
2120,
2126,
2127,
2168,
2169,
2186,
2187,
2419,
2420,
2558,
2559,
2574,
2575,
2689,
2690,
2729,
2751,
2774,
2797,
2827,
2858,
2885,
2886,
2937,
2938,
2977,
2999,
3032,
3081,
3167,
3168,
3292,
3293,
3349,
3350,
3389,
3395,
3437,
3438,
3658,
3659,
3720,
3757,
3910,
3958,
3967,
4124,
4125,
4164,
4170,
4214,
4221,
4253,
4254,
4306,
4307,
4315,
4316,
4544,
4587,
4588,
4846,
4918,
4919,
5012,
5013,
5035,
5059,
5084,
5178,
5179,
5310,
5311,
5381,
5387,
5429,
5436,
5443,
5444,
5471,
5472,
5483,
5556,
5557,
5591,
5592,
5626,
5864,
5911,
5912,
5946,
6269,
6300,
6301,
6326,
6578,
6605,
6606,
6640,
6866,
6893,
6894,
6930,
7165,
7195,
7196,
7221,
7478,
7546,
7547,
7572,
7913,
7975,
7976,
8010,
8346,
8374,
8375,
8400,
8701
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8701,
"ccnet_original_nlines": 144,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35300731658935547,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.034851040691137314,
"rps_doc_frac_lines_end_with_ellipsis": 0.05517240986227989,
"rps_doc_frac_no_alph_words": 0.19842608273029327,
"rps_doc_frac_unique_words": 0.3143254518508911,
"rps_doc_mean_word_length": 4.550069332122803,
"rps_doc_num_sentences": 139,
"rps_doc_symbol_to_word_ratio": 0.00618324987590313,
"rps_doc_unigram_entropy": 5.33467960357666,
"rps_doc_word_count": 1438,
"rps_doc_frac_chars_dupe_10grams": 0.06419073790311813,
"rps_doc_frac_chars_dupe_5grams": 0.15023688971996307,
"rps_doc_frac_chars_dupe_6grams": 0.12792296707630157,
"rps_doc_frac_chars_dupe_7grams": 0.0895613580942154,
"rps_doc_frac_chars_dupe_8grams": 0.07855723798274994,
"rps_doc_frac_chars_dupe_9grams": 0.07855723798274994,
"rps_doc_frac_chars_top_2gram": 0.0663304328918457,
"rps_doc_frac_chars_top_3gram": 0.022008249536156654,
"rps_doc_frac_chars_top_4gram": 0.021091239526867867,
"rps_doc_books_importance": -900.8274536132812,
"rps_doc_books_importance_length_correction": -900.8274536132812,
"rps_doc_openwebtext_importance": -507.5223693847656,
"rps_doc_openwebtext_importance_length_correction": -507.5223693847656,
"rps_doc_wikipedia_importance": -360.3376159667969,
"rps_doc_wikipedia_importance_length_correction": -360.3376159667969
},
"fasttext": {
"dclm": 0.03808366879820824,
"english": 0.9275402426719666,
"fineweb_edu_approx": 1.0876550674438477,
"eai_general_math": 0.011595009826123714,
"eai_open_web_math": 0.04026662930846214,
"eai_web_code": 0.0050888098776340485
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-761,564,303,113,567,900
|
Skip to main content
API User Guide
HTTP Status Codes and Error Handling
The platform APIs use HTTP status codes to convey the results of a client request. There are the following standard status code categories, though not all are currently in use on the platform:
• 1xx: Informational—Communicates transfer protocol-level information.
• 2xx: Success—The client’s request was accepted successfully. For example:
• a successful PUT (update) request for a data class on the platform will return a 200 code, and the response will show the contents of the updated object.
• a successful POST (create) will return a 201 code, and the response will show the contents of the created object.
• 3xx: Redirection—The client must take additional action in order to complete the request.
• 4xx: Client Error—This type of error status code indicates a client error. For example, an unsuccessful request on the platform may return a 400 status code: "Bad Request due to an invalid format or because the requested name is already in use".
• 5xx: Server Error—This type of error status code indicates a server error.
If an API call is not successful, for example if the server is unable to generate a 200 OK or 201 CREATED response, then the server will return the appropriate standard error code in a set format.
In Swagger, click the arrow symbol on any endpoint to see example status codes in the Responses section.
You can also view every status code in use in the schema. To open the schema, click /api/v1/api-docs just below the title on the Swagger page.
|
{
"url": "https://docs.privitar.com/provisioning/110/MDP-API/en/http-status-codes-and-error-handling.html",
"source_domain": "docs.privitar.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "24688",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GRVAHBBG3ME4C3K2HGVN2SDI5W2V3X36",
"WARC-Concurrent-To": "<urn:uuid:06366a10-b5b6-4a00-bf70-38d4ad24853a>",
"WARC-Date": "2023-04-02T08:44:23Z",
"WARC-IP-Address": "18.160.18.46",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:GVHFAOYMBBXKTVHG3A7T6NPJ4XEDEAPZ",
"WARC-Record-ID": "<urn:uuid:8d91f028-08fc-44bf-b64b-67bbd925c6f8>",
"WARC-Target-URI": "https://docs.privitar.com/provisioning/110/MDP-API/en/http-status-codes-and-error-handling.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e8e6fa41-2ca3-4e21-ae70-201a7450cc3c>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-134\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
22,
37,
38,
75,
76,
269,
270,
343,
344,
422,
423,
583,
584,
704,
705,
799,
800,
1050,
1051,
1130,
1131,
1328,
1329,
1434,
1435
],
"line_end_idx": [
21,
22,
37,
38,
75,
76,
269,
270,
343,
344,
422,
423,
583,
584,
704,
705,
799,
800,
1050,
1051,
1130,
1131,
1328,
1329,
1434,
1435,
1577
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1577,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3459119498729706,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025157229974865913,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17924527823925018,
"rps_doc_frac_unique_words": 0.46768060326576233,
"rps_doc_mean_word_length": 4.730038166046143,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.402563095092773,
"rps_doc_word_count": 263,
"rps_doc_frac_chars_dupe_10grams": 0.06752412021160126,
"rps_doc_frac_chars_dupe_5grams": 0.1334405094385147,
"rps_doc_frac_chars_dupe_6grams": 0.1334405094385147,
"rps_doc_frac_chars_dupe_7grams": 0.1334405094385147,
"rps_doc_frac_chars_dupe_8grams": 0.1334405094385147,
"rps_doc_frac_chars_dupe_9grams": 0.06752412021160126,
"rps_doc_frac_chars_top_2gram": 0.04019292816519737,
"rps_doc_frac_chars_top_3gram": 0.031350478529930115,
"rps_doc_frac_chars_top_4gram": 0.028938909992575645,
"rps_doc_books_importance": -118.15396881103516,
"rps_doc_books_importance_length_correction": -105.03819274902344,
"rps_doc_openwebtext_importance": -79.37796783447266,
"rps_doc_openwebtext_importance_length_correction": -79.37796783447266,
"rps_doc_wikipedia_importance": -57.901634216308594,
"rps_doc_wikipedia_importance_length_correction": -44.08226013183594
},
"fasttext": {
"dclm": 0.02135390043258667,
"english": 0.7630181908607483,
"fineweb_edu_approx": 1.7107205390930176,
"eai_general_math": 0.19764304161071777,
"eai_open_web_math": 0.07447957992553711,
"eai_web_code": 0.6016947031021118
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
816,894,016,266,527,100
|
Skip to content
Permalink
Branch: master
Find file Copy path
Find file Copy path
Fetching contributors…
Cannot retrieve contributors at this time
41 lines (32 sloc) 1.63 KB
####################################
# Originally adapted from https://gist.github.com/konklone/6532544
#
# See some related discussion and detail there.
####################################
# Prefer certain ciphersuites, to enforce Forward Secrecy and avoid known vulnerabilities.
#
# Forces forward secrecy in all browsers and clients that can use TLS,
# but with a small exception (DES-CBC3-SHA) for IE8/XP users.
#
# Reference client: https://www.ssllabs.com/ssltest/analyze.html
ssl_prefer_server_ciphers on;
ssl_ciphers 'kEECDH+ECDSA+AES128 kEECDH+ECDSA+AES256 kEECDH+AES128 kEECDH+AES256 kEDH+AES128 kEDH+AES256 DES-CBC3-SHA +SHA !aNULL !eNULL !LOW !MD5 !EXP !DSS !PSK !SRP !kECDH !CAMELLIA !RC4 !SEED';
# Cut out the old, broken, insecure SSLv2 and SSLv3 entirely.
ssl_protocols TLSv1.2 TLSv1.1 TLSv1;
# Turn on session resumption, using a 10 min cache shared across nginx processes,
# as recommended by http://nginx.org/en/docs/http/configuring_https_servers.html
ssl_session_cache shared:SSL:10m;
ssl_session_timeout 10m;
# Buffer size of 1400 bytes fits in one MTU.
ssl_buffer_size 1400;
# SPDY header compression (0 for none, 9 for slow/heavy compression). Preferred is 6.
#
# BUT: header compression is flawed and vulnerable in SPDY versions 1 - 3.
# Disable with 0, until using a version of nginx with SPDY 4.
spdy_headers_comp 0;
# Now let's really get fancy, and pre-generate a 2048 bit random parameter
# for DH elliptic curves. If not created and specified, default is only 1024 bits.
#
# Generated by OpenSSL with the following command:
# openssl dhparam -outform pem -out dhparam2048.pem 2048
ssl_dhparam /etc/nginx/ssl/dhparam2048.pem;
You can’t perform that action at this time.
|
{
"url": "https://github.com/fisma-ready/nginx/blob/master/ssl/ssl.rules",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "75027",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LBQHSQEPVJGXLIFBFFC6H3U2LZSGJDIM",
"WARC-Concurrent-To": "<urn:uuid:14088840-6e15-4130-a2e1-3be26414851b>",
"WARC-Date": "2019-06-16T09:43:12Z",
"WARC-IP-Address": "192.30.253.112",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PVHANOC6BDA3BJ5WMEOB6PIXT6EY4WBA",
"WARC-Record-ID": "<urn:uuid:58e5fef1-9d91-4f9d-9b35-f11a351349fb>",
"WARC-Target-URI": "https://github.com/fisma-ready/nginx/blob/master/ssl/ssl.rules",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:41cdf25c-693a-48cd-b04b-d3748a865b17>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-81-161-154.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
26,
41,
61,
81,
104,
146,
173,
210,
277,
279,
327,
364,
455,
457,
528,
590,
592,
657,
687,
884,
946,
983,
1065,
1146,
1180,
1205,
1250,
1272,
1358,
1360,
1435,
1497,
1518,
1593,
1676,
1678,
1729,
1786,
1830
],
"line_end_idx": [
16,
26,
41,
61,
81,
104,
146,
173,
210,
277,
279,
327,
364,
455,
457,
528,
590,
592,
657,
687,
884,
946,
983,
1065,
1146,
1180,
1205,
1250,
1272,
1358,
1360,
1435,
1497,
1518,
1593,
1676,
1678,
1729,
1786,
1830,
1873
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1873,
"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.18316832184791565,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08663365989923477,
"rps_doc_frac_lines_end_with_ellipsis": 0.024390239268541336,
"rps_doc_frac_no_alph_words": 0.3663366436958313,
"rps_doc_frac_unique_words": 0.7887930870056152,
"rps_doc_mean_word_length": 6.025862216949463,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.23514850437641144,
"rps_doc_unigram_entropy": 5.101879119873047,
"rps_doc_word_count": 232,
"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.011444919742643833,
"rps_doc_frac_chars_top_3gram": 0.017167380079627037,
"rps_doc_frac_chars_top_4gram": 0.022889839485287666,
"rps_doc_books_importance": -173.61708068847656,
"rps_doc_books_importance_length_correction": -173.60433959960938,
"rps_doc_openwebtext_importance": -92.76046752929688,
"rps_doc_openwebtext_importance_length_correction": -92.76046752929688,
"rps_doc_wikipedia_importance": -91.20072937011719,
"rps_doc_wikipedia_importance_length_correction": -91.20072174072266
},
"fasttext": {
"dclm": 0.343039870262146,
"english": 0.6887123584747314,
"fineweb_edu_approx": 1.273500919342041,
"eai_general_math": 0.8838859796524048,
"eai_open_web_math": 0.20211642980575562,
"eai_web_code": 0.06840932369232178
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"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": "6",
"label": "Indeterminate"
},
"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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,212,904,028,119,303,700
|
1
I am trying to run a multiprocessing on a zonal statistic in pure Python. I am new on it. I have to apply a zonal statistic with a shapefile with more than 6 million features on a taster of 6 GBs (dimension X: 639760 Y: 452420 ). I am implemented a multiprocessing starting from this script this script (from @Perrygeo!!) but the process run forever; after two weeks it haven't finished yet.
The process was reading the entire shapefile and the entire raster and after this processing using the code.
So I would like to implement this process:
• reading the shapefile piece by piece from a PostGIS database. I am not able to read a shapefile piece by piece with geopandas or fiona.
• applying the zonal statistic only on the part intersecting the raster, a very big raster (6.3 GB also with LZW compression). I am assuming the processing will be done only on the intersection area.
• printing the final output on the database
Can I use asyncio to implement a concurrency to speed the process and applying at the same time a multiprocessing on the zonal statistic itself? I need to write a fast code...
• Why can't you do it inn fiona or geopandas. Which zonal statistics, intersecting what raster (very big is not very helpful). What is the input? There are lots of ways to use concurrency depending on the algorithm, input, etc, but your question as it stands is a bit unclear. – John Powell Feb 18 '19 at 11:13
• you are right. I will try to write my question better – Glori P. Feb 18 '19 at 11:18
• Are you planning on loading the the raster to Postgis also? If you load it with tiling, raster2pgsql -t, then vector/raster lookups with us a spatial index and can be very fast. If you are not, then I assume you are opening the raster using something like rasterio in Python? – John Powell Feb 18 '19 at 13:09
• Yes I am planning to use rasterio. If I use raster2pgsql -t can I read the raster with python ? postgis on zonal statistic is realy slow. – Glori P. Feb 18 '19 at 13:15
• Yes, you can still read the raster from Postgis, but, if you are using raster2pgsql then there would be no point. My guess is that the reason you are saying that zonal statistics is really slow in Postgis is that you have not tiled your raster. Why can you not read a shapefile bit by bit in Python, btw? As I see it, you could do this either completely in Python or completely in Postgis, it, is the combination that seems to be causing confusion/speed problems. – John Powell Feb 18 '19 at 13:49
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Browse other questions tagged or ask your own question.
|
{
"url": "https://gis.stackexchange.com/questions/312608/asyncio-with-multiprocessing",
"source_domain": "gis.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "144114",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SEQQN4WCKVXSZHYQ5BN55S3NEKEDLTJW",
"WARC-Concurrent-To": "<urn:uuid:617f4e1e-4f8b-4f8d-88bd-34eccb8d168c>",
"WARC-Date": "2020-10-30T14:11:58Z",
"WARC-IP-Address": "151.101.65.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QGUVAEIACYT5C5KFCXVNLOVDFCHX2BYO",
"WARC-Record-ID": "<urn:uuid:de47403b-4236-43e3-b60f-d4fb41706150>",
"WARC-Target-URI": "https://gis.stackexchange.com/questions/312608/asyncio-with-multiprocessing",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bc709154-c395-4282-8914-73262812ff53>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-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,
2,
3,
395,
396,
505,
506,
549,
550,
690,
892,
938,
939,
1115,
1116,
1429,
1518,
1832,
2005,
2507,
2508,
2520,
2521,
2621,
2622
],
"line_end_idx": [
2,
3,
395,
396,
505,
506,
549,
550,
690,
892,
938,
939,
1115,
1116,
1429,
1518,
1832,
2005,
2507,
2508,
2520,
2521,
2621,
2622,
2677
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2677,
"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.4117647111415863,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036332178860902786,
"rps_doc_frac_lines_end_with_ellipsis": 0.03999999910593033,
"rps_doc_frac_no_alph_words": 0.19723182916641235,
"rps_doc_frac_unique_words": 0.4068825840950012,
"rps_doc_mean_word_length": 4.204453468322754,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.001730100018903613,
"rps_doc_unigram_entropy": 4.888119697570801,
"rps_doc_word_count": 494,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04429465904831886,
"rps_doc_frac_chars_dupe_6grams": 0.04429465904831886,
"rps_doc_frac_chars_dupe_7grams": 0.04429465904831886,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008666349574923515,
"rps_doc_frac_chars_top_3gram": 0.016851229593157768,
"rps_doc_frac_chars_top_4gram": 0.02166585996747017,
"rps_doc_books_importance": -212.4105987548828,
"rps_doc_books_importance_length_correction": -212.4105987548828,
"rps_doc_openwebtext_importance": -133.00851440429688,
"rps_doc_openwebtext_importance_length_correction": -133.00851440429688,
"rps_doc_wikipedia_importance": -117.8691635131836,
"rps_doc_wikipedia_importance_length_correction": -117.8691635131836
},
"fasttext": {
"dclm": 0.13937616348266602,
"english": 0.920112669467926,
"fineweb_edu_approx": 1.4392106533050537,
"eai_general_math": 0.2763747572898865,
"eai_open_web_math": 0.24995750188827515,
"eai_web_code": 0.017335470765829086
}
}
|
{
"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": "550",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Geology and Earth sciences",
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,867,456,503,290,869,200
|
Installing applications on Windows 10 is normally a straightforward process, thanks to the operating system’s wealth of applications and compatibility over the past 30 years. For the most part, they work. For example, we’ve sầu already covered how to install classic desktop applications & universal apps, such as those available through the Windows Store.
Bạn đang xem: Search results
It Started with Windows 8
But the Windows 10 phầm mềm story is still going through a significant transition, which initially started with Windows 8. Universal apps are the future of Windows 10, but classic apps will be with us for some time. And those classic apps sometimes have classic problems. For instance, installing desktop apps can be problematic due to components such as the Visual C++ Redistributable. This article finds out what it is and how to get it installed, so your ứng dụng will work on Windows 10.
How to lớn Resolve Problems Installing the Visual C++ Redistributable
The Visual C++ Redistributable is a DLL (Dynamic Link Library) file required by programs or games built using Microsoft’s Visual Studio software development environment. When a program requires a DLL or some other supporting tệp tin khổng lồ run, this is called a dependency. The MSVCR.DLL stands for:
MS – MicrosoftV – VisualC – C++R – Redistributable.
Browsing your Apps and Features Setting or Programs and Features Control Panel, you might see multiple versions of the redistributable installed. A particular phầm mềm installed might be utilizing one of them, so removing any version can cause an application lớn malfunction. Some apps might even require updated versions of the Visual C++ Redistributable such as 2010 SP1 or 2012 Update 4.
*
*
If not, you can tải về the version required by the application. In addition, the program will indicate the version of the file required if an error pops up during or when executing the ứng dụng. Users should also be aware that some programs might require either the 32 or 64-bit architecture.
Below are liên kết to tải về the appropriate redistributable for the version you might be attempting to install:
Further MSVCR Troubleshooting
Sometimes you might need to uninstall an existing version of the Visual C++ Redistributable khổng lồ resolve sầu problems affecting it. If installing the correct Visual C++ Redistributable does not resolve sầu problems installing or repairing a program, it likely means that one of the DLL files might be corrupt. Re-registering the DLL files might be able to lớn resolve the problem.
Press Windows key + X then cliông xã Comm& Prompt (Admin) or Windows PowerShell (Admin). At the command prompt or PowerShell window, type the commands below, then hit enter after each. Exit the commvà prompt, then restart your computer lớn see if the problem is resolved.
regsvr32 ntdll.dll /s
regsvr32 msdxm.ocx /s
regsvr32 dxmasf.dll /s
regsvr32 wmp.dll /s
regsvr32 wmpdxm.dll /s
Summing Up
Encountering problems with the Visual C++ Redistributable is rare, but it’s also a sign of the legacy issues still attached to lớn Windows. The Universal App mã sản phẩm minimizes the need for such components because of the new packaged-based deployment used. However, for big apps lượt thích AutoCAD, QuickBooks, Adobe Creative Suite, & iTunes, this component will always be a part of your apps’ fundamental architecture. Hopefully, this article will help you overcome any obstacles if you vày encounter them.
Xem thêm: Khắc Phục Lỗi Máy Tính Không Vào Được Mạng Internet, Cách Khắc Phục
Have sầu you had to fix issues with Visual C++ Redistributable Packages for Visual Studio? Tell us about it in the comments.
|
{
"url": "https://lasideas.org/microsoft-visual-c-redistributable-2010/",
"source_domain": "lasideas.org",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "12460",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IGBIWCDCWMZ34PTTC3PWIIBZ4LGXLUEY",
"WARC-Concurrent-To": "<urn:uuid:0204e2d2-4cf7-4540-bb92-e49800b287a3>",
"WARC-Date": "2022-01-24T00:23:01Z",
"WARC-IP-Address": "104.21.91.96",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FQS34SKBULG7WHDO7WIACD33KJCMVKJV",
"WARC-Record-ID": "<urn:uuid:8bb3c794-4691-43a9-88be-f07b605e3b20>",
"WARC-Target-URI": "https://lasideas.org/microsoft-visual-c-redistributable-2010/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:77854797-60d1-43b1-96e3-b696eb4be92c>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-24\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
357,
358,
387,
388,
389,
415,
416,
909,
910,
980,
981,
1283,
1284,
1336,
1337,
1729,
1730,
1732,
1734,
1735,
2028,
2029,
2142,
2143,
2173,
2174,
2559,
2560,
2832,
2833,
2855,
2856,
2878,
2879,
2902,
2903,
2923,
2924,
2947,
2948,
2959,
2960,
3471,
3472,
3550,
3551
],
"line_end_idx": [
357,
358,
387,
388,
389,
415,
416,
909,
910,
980,
981,
1283,
1284,
1336,
1337,
1729,
1730,
1732,
1734,
1735,
2028,
2029,
2142,
2143,
2173,
2174,
2559,
2560,
2832,
2833,
2855,
2856,
2878,
2879,
2902,
2903,
2923,
2924,
2947,
2948,
2959,
2960,
3471,
3472,
3550,
3551,
3675
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3675,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3479490876197815,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029702970758080482,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16265912353992462,
"rps_doc_frac_unique_words": 0.48986485600471497,
"rps_doc_mean_word_length": 5.125,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.245764255523682,
"rps_doc_word_count": 592,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.047462098300457,
"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.018457479774951935,
"rps_doc_frac_chars_top_3gram": 0.058009229600429535,
"rps_doc_frac_chars_top_4gram": 0.0494396798312664,
"rps_doc_books_importance": -346.97320556640625,
"rps_doc_books_importance_length_correction": -346.97320556640625,
"rps_doc_openwebtext_importance": -206.46945190429688,
"rps_doc_openwebtext_importance_length_correction": -206.46945190429688,
"rps_doc_wikipedia_importance": -150.26394653320312,
"rps_doc_wikipedia_importance_length_correction": -150.26394653320312
},
"fasttext": {
"dclm": 0.11096019297838211,
"english": 0.8555425405502319,
"fineweb_edu_approx": 2.6247613430023193,
"eai_general_math": 0.4598955512046814,
"eai_open_web_math": 0.2568853497505188,
"eai_web_code": 0.2626376748085022
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.457",
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,075,349,048,877,118,700
|
What is Frontend development and various technologies for Frontend development?
When we visit shops, what is the first thing that we see? We see the products & goods that are placed on the shelves and stores that bear a price tag. We get to see how attractive and complete the goods and products are. Seeing this we are often tempted to buy the goods and products that are available. The same logic and concept are applied to the front end. So basically what is the front end technology? The front end is nothing but the technology or application work that is used to design the Graphical user interface or GUI that sits between the user and the back end.
So let us describe a bit in detail what role the front end plays from a development point of view.
When we shop online, we see the various elements and entities of the website that we visit, such as the shopping cart, the product images, its description, the price, the various buttons and hyperlinks, etc. Whatever we see on the page that we shop or are tempted to by consists or comprises the front end aspects of the website.
So this front end connects the back end or admin part of the website. A website’s back end is the core business logic and inner working of how the website operates as well as any databases and other components that go into building the website. This is the backend. Both the front end as well as the backend function in full coordination and cooperation with each other.
In this article, we will discuss the various front end technologies that are available for developers and programmers alike and what role these individual components play in the development of apps and websites.
There is a lot to learn about front end development in general. As it forms the core visual logic that connects the website's visual aspect to the backend aspects.
So what are the various front end technologies or components development that is available in the market of the IT development industry, you might ask? Well, we are here to cover all of these technologies.
So let's start.
The main technologies that are available to programmers and developers are AngularJS, ReactJS, VueJS and NodeJS. These form the basic technical applications or formal frameworks that comprise or make up the front end development spectrum.
Let’s discuss in detail what these technologies are.
Angular JS:
AngularJS is a product of Google, the search engine behemoth or Giant. This technology is used to develop single page applications or web applications that help with the processing of websites and the UI of different webpages. It can easily handle different types of processing for example, e-commerce page actions and the GUI or the graphical user interface that works for it. AngularJS is apt and capable of processing and handling the GUI aspects that go into building these applications and websites. It works alongside in full coordination with other different technologies such as JavaScript, HTML and CSS to become and provide the full front end experience for the user. AngularJS has a lot of different applications or implementations that work in the field of web development for example creating single page applications and graphical user interfaces. If you are looking to hire angular developers then you can employ developers at a reliable or reasonable as well as at an affordable cost.
ReactJS
ReactJS is a product of the social media giant Facebook. A team of engineers had invented this front end technology to drive or power the main Graphical User Interface aspect of the social media platform. It was made open source and the public for any programmer and developer. They can use it to function and implement as well as use it in their applications and websites. It is also known as the full fledged javascript front-end framework that powers or drives the core operations of different kind of web applications. ReactJS is also used for various single page applications designing and User interface creation tasks. Get reactjs developers at the most affordable and within budget cost depending on requirements.
VueJS
VueJS is the front end framework that was developed firstly and mostly by Evan You. This framework was invented 6 years ago and the sole purpose of this framework was to facilitate the development of single page applications and graphical user interfaces. It is a javascript framework that is mainly used to develop the user interfaces of the web, as it easily complies with the web standards. VueJS has been elegantly designed from the ground up or from scratch to create different GUI based components that goes into designing and developing of the web. Hire VueJS developers to develop your applications.
NodeJS
NodeJS is a server side technology that focuses on providing and managing servers. This technology is used to develop intuitive and large scale applications and serve as a platform for server based applications. It provides a high performance environment for developing web applications and web interfaces. It works on open source technologies and is easily scalable and is capable of handling and meets high traffic demands and standards. NodeJS scales well with designing and creation of different applications that need to have the highest performance and responsiveness for applications. Hire NodeJS developers for implementing effective as well as efficient solutions using NodeJS for web applications.
Conclusion:
We have discussed the various web based front end technologies that are available to us for developing front end applications and their implementations.
|
{
"url": "https://ajaykumbhar-31775.medium.com/what-is-frontend-development-and-various-technologies-for-frontend-development-3bbbfaa044a2",
"source_domain": "ajaykumbhar-31775.medium.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "113479",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7FEL3IRJ4DCILGFSFW3TD24THNS772SK",
"WARC-Concurrent-To": "<urn:uuid:877ab4ae-b0ed-41ec-8feb-81166c3bebfa>",
"WARC-Date": "2022-01-20T11:24:32Z",
"WARC-IP-Address": "162.159.153.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:V5TAA6U7EWSOHVSXOVC6BU5TT7ZBYELL",
"WARC-Record-ID": "<urn:uuid:bb31ff83-4b41-42fe-81b9-d3bc1256fdca>",
"WARC-Target-URI": "https://ajaykumbhar-31775.medium.com/what-is-frontend-development-and-various-technologies-for-frontend-development-3bbbfaa044a2",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a5685ca1-e91d-49b1-ae1e-35d496714408>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-104\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
80,
81,
657,
658,
757,
758,
1088,
1089,
1460,
1461,
1673,
1674,
1838,
1839,
2045,
2046,
2062,
2063,
2302,
2303,
2356,
2357,
2369,
2370,
3371,
3372,
3380,
3381,
4103,
4104,
4110,
4111,
4719,
4720,
4727,
4728,
5436,
5437,
5449,
5450
],
"line_end_idx": [
80,
81,
657,
658,
757,
758,
1088,
1089,
1460,
1461,
1673,
1674,
1838,
1839,
2045,
2046,
2062,
2063,
2302,
2303,
2356,
2357,
2369,
2370,
3371,
3372,
3380,
3381,
4103,
4104,
4110,
4111,
4719,
4720,
4727,
4728,
5436,
5437,
5449,
5450,
5602
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5602,
"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.4477611780166626,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010945269837975502,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.07661692053079605,
"rps_doc_frac_unique_words": 0.33152762055397034,
"rps_doc_mean_word_length": 4.9674973487854,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.9756269454956055,
"rps_doc_word_count": 923,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06499455124139786,
"rps_doc_frac_chars_dupe_6grams": 0.04929117113351822,
"rps_doc_frac_chars_dupe_7grams": 0.020937839522957802,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02791712060570717,
"rps_doc_frac_chars_top_3gram": 0.019193019717931747,
"rps_doc_frac_chars_top_4gram": 0.018320610746741295,
"rps_doc_books_importance": -498.873291015625,
"rps_doc_books_importance_length_correction": -498.873291015625,
"rps_doc_openwebtext_importance": -285.2807922363281,
"rps_doc_openwebtext_importance_length_correction": -285.2807922363281,
"rps_doc_wikipedia_importance": -218.3380126953125,
"rps_doc_wikipedia_importance_length_correction": -218.3380126953125
},
"fasttext": {
"dclm": 0.07321543246507645,
"english": 0.9490366578102112,
"fineweb_edu_approx": 2.591628313064575,
"eai_general_math": 0.35245776176452637,
"eai_open_web_math": 0.08019102364778519,
"eai_web_code": 0.6706721186637878
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,178,217,045,026,465,000
|
View on
MetaCPAN
Alfred Reibenschuh > PDF-API2-0.73 > PDF::API2::Basic::TTF::Font
Download:
PDF-API2-0.73.tar.gz
Dependencies
Annotate this POD
CPAN RT
New 12
Open 12
Stalled 1
View/Report Bugs
Module Version: 0.32 Source
NAME ^
PDF::API2::Basic::TTF::Font - Memory representation of a font
SYNOPSIS ^
Here is the regression test (you provide your own font). Run it once and then again on the output of the first run. There should be no differences between the outputs of the two runs.
$f = PDF::API2::Basic::TTF::Font->open($ARGV[0]);
# force a read of all the tables
$f->tables_do(sub { $_[0]->read; });
# force read of all glyphs (use read_dat to use lots of memory!)
# $f->{'loca'}->glyphs_do(sub { $_[0]->read; });
$f->{'loca'}->glyphs_do(sub { $_[0]->read_dat; });
# NB. no need to $g->update since $f->{'glyf'}->out will do it for us
$f->out($ARGV[1]);
$f->release; # clear up memory forcefully!
DESCRIPTION ^
A Truetype font consists of a header containing a directory of tables which constitute the rest of the file. This class holds that header and directory and also creates objects of the appropriate type for each table within the font. Note that it does not read each table into memory, but creates a short reference which can be read using the form:
$f->{$tablename}->read;
Classes are included that support many of the different TrueType tables. For those for which no special code exists, the table type table is used, which defaults to PDF::API2::Basic::TTF::Table. The current tables which are supported are:
table PDF::API2::Basic::TTF::Table - for unknown tables
GDEF PDF::API2::Basic::TTF::GDEF
GPOS PDF::API2::Basic::TTF::GPOS
GSUB PDF::API2::Basic::TTF::GSUB
LTSH PDF::API2::Basic::TTF::LTSH
OS/2 PDF::API2::Basic::TTF::OS_2
PCLT PDF::API2::Basic::TTF::PCLT
bsln PDF::API2::Basic::TTF::Bsln
cmap PDF::API2::Basic::TTF::Cmap - see also PDF::API2::Basic::TTF::OldCmap
cvt PDF::API2::Basic::TTF::Cvt_
fdsc PDF::API2::Basic::TTF::Fdsc
feat PDF::API2::Basic::TTF::Feat
fmtx PDF::API2::Basic::TTF::Fmtx
fpgm PDF::API2::Basic::TTF::Fpgm
glyf PDF::API2::Basic::TTF::Glyf - see also PDF::API2::Basic::TTF::Glyph
hdmx PDF::API2::Basic::TTF::Hdmx
head PDF::API2::Basic::TTF::Head
hhea PDF::API2::Basic::TTF::Hhea
hmtx PDF::API2::Basic::TTF::Hmtx
kern PDF::API2::Basic::TTF::Kern - see alternative PDF::API2::Basic::TTF::AATKern
loca PDF::API2::Basic::TTF::Loca
maxp PDF::API2::Basic::TTF::Maxp
mort PDF::API2::Basic::TTF::Mort - see also PDF::API2::Basic::TTF::OldMort
name PDF::API2::Basic::TTF::Name
post PDF::API2::Basic::TTF::Post
prep PDF::API2::Basic::TTF::Prep
prop PDF::API2::Basic::TTF::Prop
vhea PDF::API2::Basic::TTF::Vhea
vmtx PDF::API2::Basic::TTF::Vmtx
Links are:
PDF::API2::Basic::TTF::Table PDF::API2::Basic::TTF::GDEF PDF::API2::Basic::TTF::GPOS PDF::API2::Basic::TTF::GSUB PDF::API2::Basic::TTF::LTSH PDF::API2::Basic::TTF::OS_2 PDF::API2::Basic::TTF::PCLT PDF::API2::Basic::TTF::Bsln PDF::API2::Basic::TTF::Cmap PDF::API2::Basic::TTF::Cvt_ PDF::API2::Basic::TTF::Fdsc PDF::API2::Basic::TTF::Feat PDF::API2::Basic::TTF::Fmtx PDF::API2::Basic::TTF::Fpgm PDF::API2::Basic::TTF::Glyf PDF::API2::Basic::TTF::Hdmx PDF::API2::Basic::TTF::Head PDF::API2::Basic::TTF::Hhea PDF::API2::Basic::TTF::Hmtx PDF::API2::Basic::TTF::Kern PDF::API2::Basic::TTF::Loca PDF::API2::Basic::TTF::Maxp PDF::API2::Basic::TTF::Mort PDF::API2::Basic::TTF::Name PDF::API2::Basic::TTF::Post PDF::API2::Basic::TTF::Prep PDF::API2::Basic::TTF::Prop PDF::API2::Basic::TTF::Vhea PDF::API2::Basic::TTF::Vmtx PDF::API2::Basic::TTF::OldCmap PDF::API2::Basic::TTF::Glyph PDF::API2::Basic::TTF::AATKern PDF::API2::Basic::TTF::OldMort
INSTANCE VARIABLES ^
Instance variables begin with a space (and have lengths greater than the 4 characters which make up table names).
nocsum
This is used during output to disable the creation of the file checksum in the head table. For example, during DSIG table creation, this flag will be set to ensure that the file checksum is left at zero.
fname (R)
Contains the filename of the font which this object was read from.
INFILE (P)
The file handle which reflects the source file for this font.
OFFSET (P)
Contains the offset from the beginning of the read file of this particular font directory, thus providing support for TrueType Collections.
METHODS ^
PDF::API2::Basic::TTF::Font->AddTable($tablename, $class)
Adds the given class to be used when representing the given table name. It also 'requires' the class for you.
PDF::API2::Basic::TTF::Font->Init
For those people who like making fonts without reading them. This subroutine will require all the table code for the various table types for you. Not needed if using PDF::API2::Basic::TTF::Font::read before using a table.
PDF::API2::Basic::TTF::Font->new(%props)
Creates a new font object and initialises with the given properties. This is primarily for use when a TTF is embedded somewhere. Notice that the properties are automatically preceded by a space when inserted into the object. This is in order that fields do not clash with tables.
PDF::API2::Basic::TTF::Font->open($fname)
Reads the header and directory for the given font file and creates appropriate objects for each table in the font.
$f->read
Reads a Truetype font directory starting from the current location in the file. This has been separated from the open function to allow support for embedded TTFs for example in TTCs. Also reads the head and maxp tables immediately.
$f->out($fname [, @tablelist])
Writes a TTF file consisting of the tables in tablelist. The list is checked to ensure that only tables that exist are output. (This means that you can't have non table information stored in the font object with key length of exactly 4)
In many cases the user simply wants to output all the tables in alphabetical order. This can be done by not including a @tablelist, in which case the subroutine will output all the defined tables in the font in alphabetical order.
Returns $f on success and undef on failure, including warnings.
All output files must include the head table.
$f->out_xml($filename [, @tables])
Outputs the font in XML format
$f->XML_start($context, $tag, %attrs)
Handles start messages from the XML parser. Of particular interest to us are <font> and <table>.
$f->update
Sends update to all the tables in the font and then resets all the isDirty flags on each table. The data structure in now consistent as a font (we hope).
$f->dirty
Dirties all the tables in the font
$f->tables_do(&func)
Calls &func for each table in the font. Calls the table in alphabetical sort order as per the order in the directory:
&func($table, $name);
$f->release
Releases ALL of the memory used by the TTF font and all of its component objects. After calling this method, do NOT expect to have anything left in the PDF::API2::Basic::TTF::Font object.
NOTE, that it is important that you call this method on any PDF::API2::Basic::TTF::Font object when you wish to destruct it and free up its memory. Internally, we track things in a structure that can result in circular references, and without calling 'release()' these will not properly get cleaned up by Perl. Once you've called this method, though, don't expect to be able to do anything else with the PDF::API2::Basic::TTF::Font object; it'll have no internal state whatsoever.
Developer note: As part of the brute-force cleanup done here, this method will throw a warning message whenever unexpected key values are found within the PDF::API2::Basic::TTF::Font object. This is done to help ensure that any unexpected and unfreed values are brought to your attention so that you can bug us to keep the module updated properly; otherwise the potential for memory leaks due to dangling circular references will exist.
BUGS ^
Bugs abound aplenty I am sure. There is a lot of code here and plenty of scope. The parts of the code which haven't been implemented yet are:
Post
Version 4 format types are not supported yet.
Cmap
Format type 2 (MBCS) has not been implemented yet and therefore may cause somewhat spurious results for this table type.
Kern
Only type 0 & type 2 tables are supported (type 1 & type 3 yet to come).
TTC
The current PDF::API2::Basic::TTF::Font::out method does not support the writing of TrueType Collections.
In addition there are weaknesses or features of this module library
Apart from these, I try to keep the code in a state of "no known bugs", which given the amount of testing this code has had, is not a guarantee of high quality, yet.
For more details see the appropriate class files.
AUTHOR ^
Martin Hosken Martin_Hosken@sil.org
Copyright Martin Hosken 1998.
No warranty or expression of effectiveness, least of all regarding anyone's safety, is implied in this software or documentation.
Licensing
The Perl TTF module is licensed under the Perl Artistic License.
syntax highlighting:
|
{
"url": "http://search.cpan.org/~areibens/PDF-API2-0.73/lib/PDF/API2/Basic/TTF/Font.pm",
"source_domain": "search.cpan.org",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "28287",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:736P7IGHI6J35EKFYK4ILFTA44A55NXI",
"WARC-Concurrent-To": "<urn:uuid:4727fa8b-797e-484c-8dcb-5173bc405ac3>",
"WARC-Date": "2018-01-21T18:52:40Z",
"WARC-IP-Address": "207.171.7.49",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AMVCYQITJZS7UEMXKX7XOUV3ESGYYXJE",
"WARC-Record-ID": "<urn:uuid:4becbc4f-5460-416f-b486-83f1a6342919>",
"WARC-Target-URI": "http://search.cpan.org/~areibens/PDF-API2-0.73/lib/PDF/API2/Basic/TTF/Font.pm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db30c7b4-1d4f-4ea1-a5f6-c81222b7f827>"
},
"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,
8,
17,
82,
83,
93,
114,
115,
128,
129,
147,
148,
156,
157,
165,
174,
185,
202,
234,
235,
242,
243,
305,
306,
317,
318,
502,
503,
557,
558,
595,
636,
637,
706,
759,
814,
888,
889,
912,
970,
971,
985,
986,
1334,
1335,
1363,
1364,
1603,
1604,
1675,
1719,
1763,
1807,
1851,
1895,
1939,
1983,
2075,
2119,
2163,
2207,
2251,
2295,
2385,
2429,
2473,
2517,
2561,
2660,
2704,
2748,
2840,
2884,
2928,
2972,
3016,
3060,
3104,
3105,
3116,
3117,
4052,
4053,
4074,
4075,
4189,
4190,
4197,
4198,
4402,
4403,
4413,
4414,
4481,
4482,
4493,
4494,
4556,
4557,
4568,
4569,
4709,
4710,
4720,
4721,
4779,
4780,
4890,
4891,
4925,
4926,
5148,
5149,
5190,
5191,
5471,
5472,
5514,
5515,
5630,
5631,
5640,
5641,
5873,
5874,
5905,
5906,
6143,
6144,
6375,
6376,
6440,
6441,
6487,
6488,
6523,
6524,
6555,
6556,
6594,
6595,
6692,
6693,
6704,
6705,
6859,
6860,
6870,
6871,
6906,
6907,
6928,
6929,
7047,
7048,
7074,
7075,
7087,
7088,
7276,
7277,
7758,
7759,
8196,
8197,
8204,
8205,
8347,
8348,
8353,
8354,
8400,
8401,
8406,
8407,
8528,
8529,
8534,
8535,
8608,
8609,
8613,
8614,
8720,
8721,
8789,
8790,
8956,
8957,
9007,
9008,
9017,
9018,
9054,
9055,
9085,
9086,
9216,
9217,
9227,
9228,
9293,
9294
],
"line_end_idx": [
8,
17,
82,
83,
93,
114,
115,
128,
129,
147,
148,
156,
157,
165,
174,
185,
202,
234,
235,
242,
243,
305,
306,
317,
318,
502,
503,
557,
558,
595,
636,
637,
706,
759,
814,
888,
889,
912,
970,
971,
985,
986,
1334,
1335,
1363,
1364,
1603,
1604,
1675,
1719,
1763,
1807,
1851,
1895,
1939,
1983,
2075,
2119,
2163,
2207,
2251,
2295,
2385,
2429,
2473,
2517,
2561,
2660,
2704,
2748,
2840,
2884,
2928,
2972,
3016,
3060,
3104,
3105,
3116,
3117,
4052,
4053,
4074,
4075,
4189,
4190,
4197,
4198,
4402,
4403,
4413,
4414,
4481,
4482,
4493,
4494,
4556,
4557,
4568,
4569,
4709,
4710,
4720,
4721,
4779,
4780,
4890,
4891,
4925,
4926,
5148,
5149,
5190,
5191,
5471,
5472,
5514,
5515,
5630,
5631,
5640,
5641,
5873,
5874,
5905,
5906,
6143,
6144,
6375,
6376,
6440,
6441,
6487,
6488,
6523,
6524,
6555,
6556,
6594,
6595,
6692,
6693,
6704,
6705,
6859,
6860,
6870,
6871,
6906,
6907,
6928,
6929,
7047,
7048,
7074,
7075,
7087,
7088,
7276,
7277,
7758,
7759,
8196,
8197,
8204,
8205,
8347,
8348,
8353,
8354,
8400,
8401,
8406,
8407,
8528,
8529,
8534,
8535,
8608,
8609,
8613,
8614,
8720,
8721,
8789,
8790,
8956,
8957,
9007,
9008,
9017,
9018,
9054,
9055,
9085,
9086,
9216,
9217,
9227,
9228,
9293,
9294,
9314
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9314,
"ccnet_original_nlines": 202,
"rps_doc_curly_bracket": 0.0015031100483611226,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2532956600189209,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.13935969769954681,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28625234961509705,
"rps_doc_frac_unique_words": 0.41904762387275696,
"rps_doc_mean_word_length": 5.74805212020874,
"rps_doc_num_sentences": 65,
"rps_doc_symbol_to_word_ratio": 0.0023540500551462173,
"rps_doc_unigram_entropy": 5.523111820220947,
"rps_doc_word_count": 1155,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.012652509845793247,
"rps_doc_frac_chars_dupe_6grams": 0.012652509845793247,
"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.009037509560585022,
"rps_doc_frac_chars_top_3gram": 0.00813375972211361,
"rps_doc_frac_chars_top_4gram": 0.006326249800622463,
"rps_doc_books_importance": -804.596923828125,
"rps_doc_books_importance_length_correction": -804.596923828125,
"rps_doc_openwebtext_importance": -471.7890625,
"rps_doc_openwebtext_importance_length_correction": -471.7890625,
"rps_doc_wikipedia_importance": -436.42535400390625,
"rps_doc_wikipedia_importance_length_correction": -436.42535400390625
},
"fasttext": {
"dclm": 0.12568676471710205,
"english": 0.7556516528129578,
"fineweb_edu_approx": 2.4116971492767334,
"eai_general_math": 0.7905094027519226,
"eai_open_web_math": 0.43062061071395874,
"eai_web_code": 0.6616474390029907
}
}
|
{
"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": "686.228",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Handicraft and Occupations",
"level_3": "Bookbinding and Printing"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,542,796,916,512,245,000
|
GCC Code Coverage Report
Directory: ../ Exec Total Coverage
File: /home/iojs/build/workspace/node-test-commit-linux-coverage-daily/nodes/benchmark/out/../src/node_main_instance.cc Lines: 91 92 98.9 %
Date: 2019-09-24 22:36:24 Branches: 37 50 74.0 %
Line Branch Exec Source
1
#include "node_main_instance.h"
2
#include "node_internals.h"
3
#include "node_options-inl.h"
4
#include "node_v8_platform-inl.h"
5
#include "util-inl.h"
6
7
namespace node {
8
9
using v8::Context;
10
using v8::HandleScope;
11
using v8::Isolate;
12
using v8::Local;
13
using v8::Locker;
14
using v8::SealHandleScope;
15
16
1
NodeMainInstance::NodeMainInstance(Isolate* isolate,
17
uv_loop_t* event_loop,
18
MultiIsolatePlatform* platform,
19
const std::vector<std::string>& args,
20
const std::vector<std::string>& exec_args)
21
: args_(args),
22
exec_args_(exec_args),
23
array_buffer_allocator_(nullptr),
24
isolate_(isolate),
25
platform_(platform),
26
isolate_data_(nullptr),
27
owns_isolate_(false),
28
1
deserialize_mode_(false) {
29
1
isolate_data_.reset(new IsolateData(isolate_, event_loop, platform, nullptr));
30
1
SetIsolateUpForNode(isolate_, IsolateSettingCategories::kMisc);
31
1
}
32
33
1
std::unique_ptr<NodeMainInstance> NodeMainInstance::Create(
34
Isolate* isolate,
35
uv_loop_t* event_loop,
36
MultiIsolatePlatform* platform,
37
const std::vector<std::string>& args,
38
const std::vector<std::string>& exec_args) {
39
return std::unique_ptr<NodeMainInstance>(
40
1
new NodeMainInstance(isolate, event_loop, platform, args, exec_args));
41
}
42
43
4898
NodeMainInstance::NodeMainInstance(
44
Isolate::CreateParams* params,
45
uv_loop_t* event_loop,
46
MultiIsolatePlatform* platform,
47
const std::vector<std::string>& args,
48
const std::vector<std::string>& exec_args,
49
const std::vector<size_t>* per_isolate_data_indexes)
50
: args_(args),
51
exec_args_(exec_args),
52
array_buffer_allocator_(ArrayBufferAllocator::Create()),
53
isolate_(nullptr),
54
platform_(platform),
55
isolate_data_(nullptr),
56
4898
owns_isolate_(true) {
57
4898
params->array_buffer_allocator = array_buffer_allocator_.get();
58
4898
isolate_ = Isolate::Allocate();
59
4898
CHECK_NOT_NULL(isolate_);
60
// Register the isolate on the platform before the isolate gets initialized,
61
// so that the isolate can access the platform during initialization.
62
4898
platform->RegisterIsolate(isolate_, event_loop);
63
4898
SetIsolateCreateParamsForNode(params);
64
4898
Isolate::Initialize(isolate_, *params);
65
66
4898
deserialize_mode_ = per_isolate_data_indexes != nullptr;
67
// If the indexes are not nullptr, we are not deserializing
68
4898
CHECK_IMPLIES(deserialize_mode_, params->external_references != nullptr);
69
isolate_data_.reset(new IsolateData(isolate_,
70
event_loop,
71
platform,
72
4898
array_buffer_allocator_.get(),
73
4898
per_isolate_data_indexes));
74
4898
SetIsolateUpForNode(isolate_, IsolateSettingCategories::kMisc);
75
4898
if (!deserialize_mode_) {
76
// If in deserialize mode, delay until after the deserialization is
77
// complete.
78
1
SetIsolateUpForNode(isolate_, IsolateSettingCategories::kErrorHandlers);
79
}
80
4898
}
81
82
1
void NodeMainInstance::Dispose() {
83
1
CHECK(!owns_isolate_);
84
1
platform_->DrainTasks(isolate_);
85
1
}
86
87
8984
NodeMainInstance::~NodeMainInstance() {
88
4492
if (!owns_isolate_) {
89
1
return;
90
}
91
4491
isolate_->Dispose();
92
4491
platform_->UnregisterIsolate(isolate_);
93
4491
}
94
95
4898
int NodeMainInstance::Run() {
96
4898
Locker locker(isolate_);
97
9389
Isolate::Scope isolate_scope(isolate_);
98
9389
HandleScope handle_scope(isolate_);
99
100
4898
int exit_code = 0;
101
9389
std::unique_ptr<Environment> env = CreateMainEnvironment(&exit_code);
102
103
4898
CHECK_NOT_NULL(env);
104
4898
Context::Scope context_scope(env->context());
105
106
4898
if (exit_code == 0) {
107
{
108
4897
AsyncCallbackScope callback_scope(env.get());
109
4897
env->async_hooks()->push_async_ids(1, 0);
110
4897
LoadEnvironment(env.get());
111
4642
env->async_hooks()->pop_async_id(1);
112
}
113
114
4641
env->set_trace_sync_io(env->options()->trace_sync_io);
115
116
{
117
4641
SealHandleScope seal(isolate_);
118
bool more;
119
env->performance_state()->Mark(
120
4641
node::performance::NODE_PERFORMANCE_MILESTONE_LOOP_START);
121
4509
do {
122
4655
uv_run(env->event_loop(), UV_RUN_DEFAULT);
123
124
4510
per_process::v8_platform.DrainVMTasks(isolate_);
125
126
4510
more = uv_loop_alive(env->event_loop());
127
4510
if (more && !env->is_stopping()) continue;
128
129
4510
env->RunBeforeExitCallbacks();
130
131
4510
if (!uv_loop_alive(env->event_loop())) {
132
4510
EmitBeforeExit(env.get());
133
}
134
135
// Emit `beforeExit` if the loop became alive either after emitting
136
// event, or after running some callbacks.
137
4509
more = uv_loop_alive(env->event_loop());
138
4509
} while (more == true && !env->is_stopping());
139
env->performance_state()->Mark(
140
4495
node::performance::NODE_PERFORMANCE_MILESTONE_LOOP_EXIT);
141
}
142
143
4495
env->set_trace_sync_io(false);
144
4495
exit_code = EmitExit(env.get());
145
4490
WaitForInspectorDisconnect(env.get());
146
}
147
148
4491
env->set_can_call_into_js(false);
149
4491
env->stop_sub_worker_contexts();
150
4491
ResetStdio();
151
4491
env->RunCleanup();
152
4491
RunAtExit(env.get());
153
154
4491
per_process::v8_platform.DrainVMTasks(isolate_);
155
4491
per_process::v8_platform.CancelVMTasks(isolate_);
156
157
#if defined(LEAK_SANITIZER)
158
__lsan_do_leak_check();
159
#endif
160
161
8982
return exit_code;
162
}
163
164
// TODO(joyeecheung): align this with the CreateEnvironment exposed in node.h
165
// and the environment creation routine in workers somehow.
166
4898
std::unique_ptr<Environment> NodeMainInstance::CreateMainEnvironment(
167
int* exit_code) {
168
4898
*exit_code = 0; // Reset the exit code to 0
169
170
4898
HandleScope handle_scope(isolate_);
171
172
// TODO(addaleax): This should load a real per-Isolate option, currently
173
// this is still effectively per-process.
174
4898
if (isolate_data_->options()->track_heap_objects) {
175
1
isolate_->GetHeapProfiler()->StartTrackingHeapObjects(true);
176
}
177
178
Local<Context> context;
179
4898
if (deserialize_mode_) {
180
context =
181
9794
Context::FromSnapshot(isolate_, kNodeContextIndex).ToLocalChecked();
182
4897
InitializeContextRuntime(context);
183
4897
SetIsolateUpForNode(isolate_, IsolateSettingCategories::kErrorHandlers);
184
} else {
185
1
context = NewContext(isolate_);
186
}
187
188
4898
CHECK(!context.IsEmpty());
189
Context::Scope context_scope(context);
190
191
std::unique_ptr<Environment> env = std::make_unique<Environment>(
192
4898
isolate_data_.get(),
193
context,
194
args_,
195
exec_args_,
196
static_cast<Environment::Flags>(Environment::kIsMainThread |
197
Environment::kOwnsProcessState |
198
9796
Environment::kOwnsInspector));
199
4898
env->InitializeLibuv(per_process::v8_is_profiling);
200
4898
env->InitializeDiagnostics();
201
202
// TODO(joyeecheung): when we snapshot the bootstrapped context,
203
// the inspector and diagnostics setup should after after deserialization.
204
#if HAVE_INSPECTOR && NODE_USE_V8_PLATFORM
205
4898
*exit_code = env->InitializeInspector(nullptr);
206
#endif
207
4898
if (*exit_code != 0) {
208
1
return env;
209
}
210
211
9794
if (env->RunBootstrapping().IsEmpty()) {
212
*exit_code = 1;
213
}
214
215
9795
return env;
216
}
217
218
} // namespace node
|
{
"url": "https://coverage.nodejs.org/coverage-b2634238d8d50e38/cxxcoverage._home_iojs_build_workspace_node-test-commit-linux-coverage-daily_nodes_benchmark_out_.._src_node_main_instance.cc.html",
"source_domain": "coverage.nodejs.org",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "70929",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JBVVZHKDIEQEWD3PI3DTUPA6YZH3YVBY",
"WARC-Concurrent-To": "<urn:uuid:fd1ed8b8-e78f-4e11-975f-5ed4541c219f>",
"WARC-Date": "2019-12-13T14:13:52Z",
"WARC-IP-Address": "104.20.22.46",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:26MAWCNPYMWE2R7TDH2MAWLSVGY2QAGZ",
"WARC-Record-ID": "<urn:uuid:69b25d3e-ea7e-4f8c-9a3f-0e350d20cf23>",
"WARC-Target-URI": "https://coverage.nodejs.org/coverage-b2634238d8d50e38/cxxcoverage._home_iojs_build_workspace_node-test-commit-linux-coverage-daily_nodes_benchmark_out_.._src_node_main_instance.cc.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9acb0266-1353-4387-90be-2097f616deae>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-133.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,
60,
200,
249,
250,
274,
276,
308,
310,
338,
340,
370,
372,
406,
408,
430,
432,
434,
451,
453,
455,
474,
477,
500,
503,
522,
525,
542,
545,
563,
566,
593,
596,
599,
601,
654,
657,
715,
718,
785,
788,
861,
864,
942,
945,
964,
967,
996,
999,
1039,
1042,
1067,
1070,
1097,
1100,
1130,
1133,
1161,
1164,
1166,
1199,
1202,
1204,
1285,
1288,
1290,
1356,
1359,
1361,
1363,
1366,
1369,
1371,
1431,
1434,
1456,
1459,
1486,
1489,
1525,
1528,
1570,
1573,
1622,
1625,
1669,
1672,
1674,
1751,
1754,
1756,
1759,
1762,
1767,
1803,
1806,
1841,
1844,
1871,
1874,
1910,
1913,
1955,
1958,
2005,
2008,
2065,
2068,
2087,
2090,
2119,
2122,
2185,
2188,
2213,
2216,
2243,
2246,
2276,
2279,
2284,
2312,
2315,
2320,
2386,
2389,
2394,
2428,
2431,
2436,
2464,
2467,
2546,
2549,
2621,
2624,
2629,
2680,
2683,
2688,
2729,
2732,
2737,
2779,
2782,
2785,
2790,
2849,
2852,
2914,
2917,
2918,
2923,
2999,
3002,
3050,
3053,
3103,
3106,
3154,
3157,
3162,
3231,
3234,
3239,
3305,
3308,
3313,
3379,
3382,
3387,
3415,
3418,
3490,
3493,
3510,
3513,
3515,
3592,
3595,
3599,
3602,
3607,
3609,
3612,
3615,
3617,
3652,
3655,
3657,
3682,
3685,
3687,
3722,
3725,
3727,
3729,
3732,
3735,
3736,
3737,
3742,
3782,
3785,
3790,
3814,
3817,
3819,
3831,
3834,
3838,
3841,
3846,
3869,
3872,
3877,
3919,
3922,
3927,
3929,
3932,
3935,
3940,
3970,
3973,
3978,
4005,
4008,
4013,
4055,
4058,
4063,
4101,
4104,
4108,
4113,
4134,
4138,
4143,
4215,
4219,
4223,
4228,
4251,
4255,
4260,
4308,
4312,
4316,
4321,
4345,
4349,
4355,
4359,
4364,
4416,
4420,
4425,
4473,
4477,
4482,
4516,
4520,
4525,
4568,
4572,
4578,
4582,
4586,
4591,
4650,
4654,
4658,
4664,
4668,
4673,
4711,
4715,
4732,
4736,
4774,
4778,
4783,
4852,
4856,
4861,
4872,
4876,
4881,
4932,
4936,
4940,
4945,
5002,
5006,
5010,
5015,
5064,
5068,
5069,
5074,
5125,
5129,
5133,
5138,
5177,
5181,
5185,
5190,
5239,
5243,
5248,
5285,
5289,
5299,
5303,
5307,
5383,
5387,
5438,
5442,
5447,
5496,
5500,
5501,
5506,
5559,
5563,
5601,
5605,
5610,
5678,
5682,
5688,
5692,
5696,
5701,
5736,
5740,
5745,
5782,
5786,
5791,
5834,
5838,
5842,
5846,
5850,
5855,
5891,
5895,
5900,
5935,
5939,
5944,
5960,
5964,
5969,
5990,
5994,
5999,
6023,
6027,
6031,
6036,
6087,
6091,
6096,
6148,
6152,
6156,
6184,
6188,
6214,
6218,
6225,
6229,
6233,
6238,
6258,
6262,
6264,
6268,
6272,
6350,
6354,
6414,
6418,
6423,
6493,
6497,
6519,
6523,
6528,
6575,
6579,
6583,
6588,
6626,
6630,
6634,
6709,
6713,
6757,
6761,
6766,
6820,
6824,
6826,
6891,
6895,
6899,
6903,
6907,
6933,
6937,
6942,
6969,
6973,
6987,
6991,
6996,
7073,
7077,
7082,
7121,
7125,
7130,
7207,
7211,
7222,
7226,
7228,
7264,
7268,
7272,
7276,
7280,
7285,
7314,
7318,
7359,
7363,
7367,
7435,
7439,
7444,
7471,
7475,
7490,
7494,
7507,
7511,
7529,
7533,
7600,
7604,
7675,
7679,
7684,
7753,
7757,
7762,
7816,
7820,
7825,
7857,
7861,
7865,
7932,
7936,
8013,
8017,
8060,
8064,
8069,
8119,
8123,
8130,
8134,
8139,
8164,
8168,
8170,
8186,
8190,
8194,
8198,
8202,
8207,
8250,
8254,
8274,
8278,
8282,
8286,
8290,
8295,
8309,
8313,
8315,
8319,
8323
],
"line_end_idx": [
25,
60,
200,
249,
250,
274,
276,
308,
310,
338,
340,
370,
372,
406,
408,
430,
432,
434,
451,
453,
455,
474,
477,
500,
503,
522,
525,
542,
545,
563,
566,
593,
596,
599,
601,
654,
657,
715,
718,
785,
788,
861,
864,
942,
945,
964,
967,
996,
999,
1039,
1042,
1067,
1070,
1097,
1100,
1130,
1133,
1161,
1164,
1166,
1199,
1202,
1204,
1285,
1288,
1290,
1356,
1359,
1361,
1363,
1366,
1369,
1371,
1431,
1434,
1456,
1459,
1486,
1489,
1525,
1528,
1570,
1573,
1622,
1625,
1669,
1672,
1674,
1751,
1754,
1756,
1759,
1762,
1767,
1803,
1806,
1841,
1844,
1871,
1874,
1910,
1913,
1955,
1958,
2005,
2008,
2065,
2068,
2087,
2090,
2119,
2122,
2185,
2188,
2213,
2216,
2243,
2246,
2276,
2279,
2284,
2312,
2315,
2320,
2386,
2389,
2394,
2428,
2431,
2436,
2464,
2467,
2546,
2549,
2621,
2624,
2629,
2680,
2683,
2688,
2729,
2732,
2737,
2779,
2782,
2785,
2790,
2849,
2852,
2914,
2917,
2918,
2923,
2999,
3002,
3050,
3053,
3103,
3106,
3154,
3157,
3162,
3231,
3234,
3239,
3305,
3308,
3313,
3379,
3382,
3387,
3415,
3418,
3490,
3493,
3510,
3513,
3515,
3592,
3595,
3599,
3602,
3607,
3609,
3612,
3615,
3617,
3652,
3655,
3657,
3682,
3685,
3687,
3722,
3725,
3727,
3729,
3732,
3735,
3736,
3737,
3742,
3782,
3785,
3790,
3814,
3817,
3819,
3831,
3834,
3838,
3841,
3846,
3869,
3872,
3877,
3919,
3922,
3927,
3929,
3932,
3935,
3940,
3970,
3973,
3978,
4005,
4008,
4013,
4055,
4058,
4063,
4101,
4104,
4108,
4113,
4134,
4138,
4143,
4215,
4219,
4223,
4228,
4251,
4255,
4260,
4308,
4312,
4316,
4321,
4345,
4349,
4355,
4359,
4364,
4416,
4420,
4425,
4473,
4477,
4482,
4516,
4520,
4525,
4568,
4572,
4578,
4582,
4586,
4591,
4650,
4654,
4658,
4664,
4668,
4673,
4711,
4715,
4732,
4736,
4774,
4778,
4783,
4852,
4856,
4861,
4872,
4876,
4881,
4932,
4936,
4940,
4945,
5002,
5006,
5010,
5015,
5064,
5068,
5069,
5074,
5125,
5129,
5133,
5138,
5177,
5181,
5185,
5190,
5239,
5243,
5248,
5285,
5289,
5299,
5303,
5307,
5383,
5387,
5438,
5442,
5447,
5496,
5500,
5501,
5506,
5559,
5563,
5601,
5605,
5610,
5678,
5682,
5688,
5692,
5696,
5701,
5736,
5740,
5745,
5782,
5786,
5791,
5834,
5838,
5842,
5846,
5850,
5855,
5891,
5895,
5900,
5935,
5939,
5944,
5960,
5964,
5969,
5990,
5994,
5999,
6023,
6027,
6031,
6036,
6087,
6091,
6096,
6148,
6152,
6156,
6184,
6188,
6214,
6218,
6225,
6229,
6233,
6238,
6258,
6262,
6264,
6268,
6272,
6350,
6354,
6414,
6418,
6423,
6493,
6497,
6519,
6523,
6528,
6575,
6579,
6583,
6588,
6626,
6630,
6634,
6709,
6713,
6757,
6761,
6766,
6820,
6824,
6826,
6891,
6895,
6899,
6903,
6907,
6933,
6937,
6942,
6969,
6973,
6987,
6991,
6996,
7073,
7077,
7082,
7121,
7125,
7130,
7207,
7211,
7222,
7226,
7228,
7264,
7268,
7272,
7276,
7280,
7285,
7314,
7318,
7359,
7363,
7367,
7435,
7439,
7444,
7471,
7475,
7490,
7494,
7507,
7511,
7529,
7533,
7600,
7604,
7675,
7679,
7684,
7753,
7757,
7762,
7816,
7820,
7825,
7857,
7861,
7865,
7932,
7936,
8013,
8017,
8060,
8064,
8069,
8119,
8123,
8130,
8134,
8139,
8164,
8168,
8170,
8186,
8190,
8194,
8198,
8202,
8207,
8250,
8254,
8274,
8278,
8282,
8286,
8290,
8295,
8309,
8313,
8315,
8319,
8323,
8343
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8343,
"ccnet_original_nlines": 503,
"rps_doc_curly_bracket": 0.004794440232217312,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06796769797801971,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01009420957416296,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5921937823295593,
"rps_doc_frac_unique_words": 0.6629055142402649,
"rps_doc_mean_word_length": 7.856135368347168,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0.006056529935449362,
"rps_doc_unigram_entropy": 5.7857513427734375,
"rps_doc_word_count": 709,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.024775579571723938,
"rps_doc_frac_chars_top_3gram": 0.014542190358042717,
"rps_doc_frac_chars_top_4gram": 0.005386000033468008,
"rps_doc_books_importance": -647.7694091796875,
"rps_doc_books_importance_length_correction": -647.7694091796875,
"rps_doc_openwebtext_importance": -414.4725036621094,
"rps_doc_openwebtext_importance_length_correction": -414.4725036621094,
"rps_doc_wikipedia_importance": -254.68028259277344,
"rps_doc_wikipedia_importance_length_correction": -254.68028259277344
},
"fasttext": {
"dclm": 0.743003785610199,
"english": 0.2338908165693283,
"fineweb_edu_approx": 2.0652520656585693,
"eai_general_math": 0.655222475528717,
"eai_open_web_math": 0.3196178078651428,
"eai_web_code": 0.5565935969352722
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,919,273,160,679,341,000
|
from which API level there have been support for W3C Geolocation API?
by geow » Thu, 19 May 2011 21:57:12 GMT
Sponsored Links
Hi everybody, do you know from which API level there have been support
for W3C Geolocation API in Android web app using WebView class?
Thanks,
G
--
Other Threads
1. Using Google Gears inside a web view
Hi, I am trying to use a Google Gears enabled site in Android's
WebView, but it fails, saying Gears is not installed.
For example, my test application sets up a WebView and loadUrls:
http://code.google.com/apis/gears/samples/hello_world_geolocation.html
and I see a "Gears is not installed" message.
The WebSettings on the WebView has JavaScript and Plugins enabled.
WebView.getPluginList is empty.
import java.util.List;
import android.app.Activity;
import android.graphics.Path;
import android.graphics.drawable.GradientDrawable.Orientation;
import android.os.Bundle;
import android.webkit.Plugin;
import android.webkit.PluginList;
import android.webkit.WebChromeClient;
import android.webkit.WebSettings;
import android.webkit.WebView;
import android.webkit.WebViewClient;
import android.widget.Button;
import android.widget.LinearLayout;
public class HelloAndroid extends Activity {
/** Called when the activity is first created. */
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
WebView webView = new WebView(this);
WebSettings settings = webView.getSettings();
settings.setJavaScriptEnabled(true);
settings.setPluginsEnabled(true);
webView.refreshPlugins(true);
PluginList pluginList = webView.getPluginList();
List list = pluginList.getList();
for(int i = 0; i < list.size(); i++)
{
Plugin plugin = (Plugin)list.get(i);
}
webView.loadUrl("http://code.google.com/apis/gears/samples/
hello_world_geolocation.html");
LinearLayout layout = new LinearLayout(this);
layout.setOrientation(LinearLayout.VERTICAL);
Button button = new Button(this);
layout.addView(button);
layout.addView(webView);
setContentView(layout);
}
}
--~--~---------~--~----~------------~-------~--~----~
2. Runtime exception with JSONObject.put() ???
Hi,
When I call:
JSONObject j= new JSONObject();
j.put("mykey", "hello");
I get a runtime exception which has a message of:
"Stub!"
This worked fine in the beta version before the final release. Are we
not supposed to be using this, or ..?
Thanks
--~--~---------~--~----~------------~-------~--~----~
3. AndroidHttpClient gone so now what
4. problems installing the sample NotePad application from the web
5. Android application stopped unexpected ly
6. NotePad sample app fails to install over the web
7. Anyone mind testing quickly?
|
{
"url": "http://androiddiscuss.com/1-android-discuss/89046.html",
"source_domain": "androiddiscuss.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "6418",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DB45WWDV2O6AEVQB4ZI7BYY6CS35ZW3O",
"WARC-Concurrent-To": "<urn:uuid:9e6f40cb-3647-468a-b851-d369237ae08d>",
"WARC-Date": "2017-12-14T22:56:02Z",
"WARC-IP-Address": "173.208.188.166",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:KUO4WBPTZUHFCJW7XHZAWWGD6ZBDC2HG",
"WARC-Record-ID": "<urn:uuid:037b5968-4d11-425d-a9f5-2812641f3bb2>",
"WARC-Target-URI": "http://androiddiscuss.com/1-android-discuss/89046.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5de8ac4b-9bb4-4b2c-8a46-2842c96b9f79>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-111-184-87.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
70,
71,
111,
112,
113,
129,
201,
265,
273,
275,
276,
280,
281,
282,
283,
297,
298,
338,
339,
403,
457,
458,
523,
594,
595,
641,
642,
709,
741,
742,
743,
766,
767,
796,
826,
889,
915,
945,
979,
1018,
1053,
1084,
1121,
1151,
1187,
1188,
1233,
1287,
1301,
1355,
1399,
1444,
1506,
1559,
1609,
1655,
1720,
1770,
1823,
1841,
1902,
1920,
1996,
2028,
2029,
2091,
2153,
2203,
2243,
2284,
2316,
2322,
2324,
2325,
2379,
2380,
2427,
2428,
2432,
2433,
2446,
2447,
2483,
2512,
2513,
2563,
2564,
2576,
2577,
2647,
2685,
2686,
2693,
2747,
2748,
2786,
2787,
2854,
2855,
2900,
2901,
2953,
2954
],
"line_end_idx": [
70,
71,
111,
112,
113,
129,
201,
265,
273,
275,
276,
280,
281,
282,
283,
297,
298,
338,
339,
403,
457,
458,
523,
594,
595,
641,
642,
709,
741,
742,
743,
766,
767,
796,
826,
889,
915,
945,
979,
1018,
1053,
1084,
1121,
1151,
1187,
1188,
1233,
1287,
1301,
1355,
1399,
1444,
1506,
1559,
1609,
1655,
1720,
1770,
1823,
1841,
1902,
1920,
1996,
2028,
2029,
2091,
2153,
2203,
2243,
2284,
2316,
2322,
2324,
2325,
2379,
2380,
2427,
2428,
2432,
2433,
2446,
2447,
2483,
2512,
2513,
2563,
2564,
2576,
2577,
2647,
2685,
2686,
2693,
2747,
2748,
2786,
2787,
2854,
2855,
2900,
2901,
2953,
2954,
2985
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2985,
"ccnet_original_nlines": 103,
"rps_doc_curly_bracket": 0.0020100499968975782,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18029740452766418,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024163570255041122,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3531598448753357,
"rps_doc_frac_unique_words": 0.6382978558540344,
"rps_doc_mean_word_length": 7.106382846832275,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.967623233795166,
"rps_doc_word_count": 282,
"rps_doc_frac_chars_dupe_10grams": 0.056886229664087296,
"rps_doc_frac_chars_dupe_5grams": 0.056886229664087296,
"rps_doc_frac_chars_dupe_6grams": 0.056886229664087296,
"rps_doc_frac_chars_dupe_7grams": 0.056886229664087296,
"rps_doc_frac_chars_dupe_8grams": 0.056886229664087296,
"rps_doc_frac_chars_dupe_9grams": 0.056886229664087296,
"rps_doc_frac_chars_top_2gram": 0.008982039988040924,
"rps_doc_frac_chars_top_3gram": 0.011976050212979317,
"rps_doc_frac_chars_top_4gram": 0.016966069117188454,
"rps_doc_books_importance": -257.2345886230469,
"rps_doc_books_importance_length_correction": -257.2345886230469,
"rps_doc_openwebtext_importance": -146.84043884277344,
"rps_doc_openwebtext_importance_length_correction": -146.84043884277344,
"rps_doc_wikipedia_importance": -101.83844757080078,
"rps_doc_wikipedia_importance_length_correction": -101.83844757080078
},
"fasttext": {
"dclm": 0.15022313594818115,
"english": 0.4380181133747101,
"fineweb_edu_approx": 1.692847490310669,
"eai_general_math": 0.4483354091644287,
"eai_open_web_math": 0.05306220054626465,
"eai_web_code": 0.3363693356513977
}
}
|
{
"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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,819,417,042,698,242,300
|
Oracle Licensing and the Advanced Compression Option
Share on linkedin
Share on twitter
Share on facebook
Jeff Stonacek, Principal Architect
Unfortunately, many of our clients are surprised to find they are in fact using database features like Advance Compression. Features like this are easy to enable and the Oracle software does little to warn you that they have been enabled. In part 1 of this series, my colleague Jim Hannan wrote an overview of Oracle licensing gotchas. In this installment, I will provide a little more detail about the Advanced Compression option and its impact on Oracle Licensing.
Data Pump
When most people think about the Advanced Compression option they usually think about compressing table data. While that is one element, there are many other compression features, as part of the Oracle stack, which also require licensing the Advanced Compression option. Data Pump is one of those options. Since Oracle version 11.1.x, Data Pump has included the option to use compression. The question is, does using compression with Data Pump require licensing the Advanced Compression option? As with most things related to Oracle licensing, the answer is not simple. In general, compressing metadata does not require licensing the Advanced Compression option, whereas compressing data does. See MOS note 1149615.1 for clarification as well as the Oracle licensing guides.
Here is an example:
select utlname, COMPRESSCNT
from ku_utluse
where utlname = 'Oracle Utility Datapump (Export)';
UTLNAME COMPRESSCNT
-------------------------------------------------- -----------
Oracle Utility Datapump (Export) 0
expdp "userid='/as sysdba'" directory=DP dumpfile=soe.dmp schemas=soe compression=all
UTLNAME COMPRESSCNT
-------------------------------------------------- -----------
Oracle Utility Datapump (Export) 1
expdp "userid='/as sysdba'" directory=DP dumpfile=soe_mo.dmp schemas=soe
compression=metadata_only
UTLNAME COMPRESSCNT
-------------------------------------------------- -----------
Oracle Utility Datapump (Export) 1
This behavior follows the advice of MOS note 1149615.1, where data compression triggers the option usage for Advanced Compression, and metadata compression does not.
However, as I mentioned, with most things related to Oracle licensing, the answer is not simple. According to MOS note 1993134.1, there is a bug in Oracle version 12.1.0.1 where doing metadata compression, either explicitly or by default, will increment the Advanced Compression usage counter. So be aware of this issue. Oracle has reportedly fixed this issue in version 12.1.0.2, but who know how many shops inadvertently paid for Advanced Compression because of this bug.
RMAN
Since the introduction of RMAN in 8.x, Oracle has stated that RMAN uses compression for backups. Until 10g, this really meant that RMAN filtered out unused blocks and only wrote blocks with data to the backup set. According to MOS note 563427.1, Oracle refers to this as either Null or Unused Block compression, depending on the version.
In 10g Oracle introduced Binary Compression into RMAN by using the “as compressed backup set” syntax. Binary compression uses a compression algorithm to write the data thereby reducing the size of the backup set even further.
So, does using compression with RMAN require licensing the Advanced Compression option? As with most things related to Oracle licensing, the answer is not simple. I feel like there is a theme here…
If you are not using Binary Compression with the “as compressed backup set” syntax, then Advanced Compression is not required. If you are using the “as compressed backup set” syntax with the default compression algorithm, then Advanced Compression is not required.
As you have probably guessed, I wouldn’t be expounding on this topic if there weren’t a gotcha. As of 11g, Oracle introduced additional compression algorithms for RMAN binary compression. The default algorithm, and the only one available in 10g, is bzip2. As of 11g, Oracle introduced the zlib algorithms that enhance compression and reduce CPU utilization. If you are using one of the zlib compression algorithms with RMAN, then you need to license Advanced Compression.
Note: To turn on the zlib compression algorithm in RMAN, use the following SET command:
RMAN> set compression algorithm 'MEDIUM';
The values can be LOW, MEDIUM or HIGH.
Conclusion
There are several Advanced Compression options available in 11g that were not covered in detail in this post, and many new Advanced Compression options in 12c. For example, Table and BLOB compression is more straightforward and is difficult to implement without doing so intentionally. However, many clients we work with are unaware of the licensing ramifications when using the Data Pump and RMAN compression options. This post is an attempt to clear the air and provide some additional information to help with license compliance issues related to Advanced Compression.
Table of Contents
Related Posts
|
{
"url": "https://houseofbrick.com/blog/oracle-licensing-and-the-advanced-compression-option/",
"source_domain": "houseofbrick.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "165663",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H2S7MNWAVUKYAD7GHO4LVV3ZFPHLF5HU",
"WARC-Concurrent-To": "<urn:uuid:20917c4b-2df5-4772-a18a-c64aac34cae5>",
"WARC-Date": "2022-12-01T01:05:26Z",
"WARC-IP-Address": "104.198.205.101",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:U5OUDZZE2IFB4TNECKK5S6KYHZHSA54O",
"WARC-Record-ID": "<urn:uuid:f15e4b1d-77ba-4a54-a5df-d12dbd3306fa>",
"WARC-Target-URI": "https://houseofbrick.com/blog/oracle-licensing-and-the-advanced-compression-option/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4509bc15-634f-404b-bf54-9c99c804a2a9>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-127\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
53,
54,
72,
89,
107,
108,
143,
144,
612,
613,
623,
624,
1399,
1400,
1420,
1421,
1449,
1464,
1516,
1517,
1580,
1643,
1707,
1708,
1794,
1795,
1858,
1921,
1984,
1985,
2059,
2085,
2087,
2150,
2213,
2276,
2277,
2279,
2280,
2446,
2447,
2921,
2922,
2927,
2928,
3266,
3267,
3493,
3494,
3692,
3693,
3958,
3959,
4431,
4432,
4520,
4521,
4563,
4564,
4566,
4567,
4606,
4607,
4618,
4619,
5191,
5192,
5210,
5211
],
"line_end_idx": [
53,
54,
72,
89,
107,
108,
143,
144,
612,
613,
623,
624,
1399,
1400,
1420,
1421,
1449,
1464,
1516,
1517,
1580,
1643,
1707,
1708,
1794,
1795,
1858,
1921,
1984,
1985,
2059,
2085,
2087,
2150,
2213,
2276,
2277,
2279,
2280,
2446,
2447,
2921,
2922,
2927,
2928,
3266,
3267,
3493,
3494,
3692,
3693,
3958,
3959,
4431,
4432,
4520,
4521,
4563,
4564,
4566,
4567,
4606,
4607,
4618,
4619,
5191,
5192,
5210,
5211,
5224
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5224,
"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.34559643268585205,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03901895135641098,
"rps_doc_frac_lines_end_with_ellipsis": 0.014285709708929062,
"rps_doc_frac_no_alph_words": 0.1783723533153534,
"rps_doc_frac_unique_words": 0.35879945755004883,
"rps_doc_mean_word_length": 5.345156669616699,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.001114830025471747,
"rps_doc_unigram_entropy": 4.988986968994141,
"rps_doc_word_count": 733,
"rps_doc_frac_chars_dupe_10grams": 0.06789177656173706,
"rps_doc_frac_chars_dupe_5grams": 0.19933639466762543,
"rps_doc_frac_chars_dupe_6grams": 0.17075037956237793,
"rps_doc_frac_chars_dupe_7grams": 0.11026033759117126,
"rps_doc_frac_chars_dupe_8grams": 0.06789177656173706,
"rps_doc_frac_chars_dupe_9grams": 0.06789177656173706,
"rps_doc_frac_chars_top_2gram": 0.07759060710668564,
"rps_doc_frac_chars_top_3gram": 0.04492088034749031,
"rps_doc_frac_chars_top_4gram": 0.050025518983602524,
"rps_doc_books_importance": -458.4392395019531,
"rps_doc_books_importance_length_correction": -458.4392395019531,
"rps_doc_openwebtext_importance": -260.51153564453125,
"rps_doc_openwebtext_importance_length_correction": -260.51153564453125,
"rps_doc_wikipedia_importance": -179.1140594482422,
"rps_doc_wikipedia_importance_length_correction": -179.1140594482422
},
"fasttext": {
"dclm": 0.049971941858530045,
"english": 0.855361819267273,
"fineweb_edu_approx": 2.0523014068603516,
"eai_general_math": 0.581549346446991,
"eai_open_web_math": 0.5072216391563416,
"eai_web_code": 0.19032812118530273
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,253,822,400,045,231,600
|
Comment réparer un écran noir sur iPhone
Logiciel Xiaobai 2021-12-02 23: 35 lire 359 vues
iPhone Il y a peu de boutons, ce qui est idéal pour maximiser la taille de l'écran, mais peut causer des problèmes lorsque l'écran devient noir et ne s'allume pas.Un écran tactile qui ne répond pas transformera votre smartphone à 900 $ en une brique coûteuse.
Heureusement, il existe plusieurs façons de réparer iPhone Presque tous les problèmes "d'écran noir de la mort" s'y trouvent.Selon le problème, vous devrez peut-être simplement laisser votre iPhone seul pendant un moment ou le brancher sur votre ordinateur.
Que faire si votre iPhone est bloqué sur un écran noir, et quelques conseils pour éviter de futurs écrans noirs.
CommentRéparer l'écran noir sur iPhone
rechargez votre iPhone
Cela semble évident, mais avant de paniquer, prenez un moment pour vérifier si la batterie de votre iPhone est morte.Lorsque vous essayez d'interagir avec un iPhone non chargé, une icône de batterie vide clignote généralement.Mais si la batterie est complètement déchargée, l'écran peut devenir complètement vide.
Si possible, utilisez un câble de données pour charger votre iPhone.
Branchez votre iPhone sur un chargeur en état de marche et laissez-le reposer pendant au moins une heure.Si vous revenez et que vous ne pouvez toujours pas allumer, vous pouvez passer à l'étape suivante.
CommentEmpêcher l'iPhone d'avoir un écran noir
L'expérience d'un écran noir qui ne répond pas peut être effrayante, surtout si votre iPhone joue un rôle important dans votre travail ou votre vie sociale.Donc, une fois que vous avez réparé l'écran noir, prenez des mesures pour vous assurer qu'il ne réapparaît pas.
Désinstaller l'application problématique
Si vous commencez à avoir un écran noir après avoir installé une application, les deux peuvent être connectés.
Désinstallez toutes les applications que vous avez récemment téléchargées et continuez à utiliser votre téléphone.Si l'écran noir cesse de se produire, vous savez ce qui en est la cause.
Gardez l'iPhone à température normale
Bien que coûteux, l'iPhone est un appareil délicat qui doit être manipulé avec précaution.Évidemment, cela signifie que vous ne devriez pas le jeter ou le tremper dans du miel.Mais cela signifie également que vous devez suivre sa température.
trop chaudUn iPhone trop froid s'éteindra et affichera un écran noir - au pire, votre batterie pourrait être définitivement court-circuitée.Cela peut être un gros problème si vous essayez d'exécuter plusieurs applications hautes performances en même temps ou si vous conservez votre iPhone dans un étui épais qui absorbe la chaleur.
Apple recommande de stocker l'iPhone dans une zone avec une plage de température de -4º à 113º F (ou -20º et 45º C).
Dans certains cas, votre iPhone peut geler et afficher un message d'avertissement vous demandant de le laisser refroidir.Si vous voyez cela, déplacez-vous dans un endroit frais et laissez votre iPhone seul pendant un moment.
Si votre iPhone surchauffe, il se verrouille jusqu'à ce qu'il refroidisse.
Réinitialisation d'usine de votre iPhone
Si vous avez toujours un écran noir après avoir désinstallé des applications récentes, il se peut qu'il y ait un problème avec votre version d'iOS.Vous pouvez mettre votre iPhone en mode de récupération comme nous l'avons décrit précédemment, ou vous pouvez effectuer une réinitialisation d'usine.
La réinitialisation d'usine de votre iPhone effacera toutes ses données et restaurera le téléphone dans l'état dans lequel vous l'avez acheté.C'est un moyen extrême mais très utile de résoudre les problèmes majeurs.
Pour réinitialiser votre iPhone aux paramètres d'usine, ouvrez l'application Paramètres et appuyez surGénéral",puis clique"Réinitialiser l'iPhone".Sur l'écran qui apparaît, sélectionnezEffacer tout le contenu et les paramètres.
Adresse de cet article :https://www.kkgcn.com/93.html
Copyright:L'article ne représente que le point de vue de l'auteur, le droit d'auteur appartient à l'auteur original, bienvenue pour partager cet article, veuillez conserver la source pour la réimpression !
发表 评论
Emoji
|
{
"url": "https://fr.kkgcn.com/93.html",
"source_domain": "fr.kkgcn.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "93100",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4OPZ3DTINWCIQ2OD7AECTTXUEZ6G6UXA",
"WARC-Concurrent-To": "<urn:uuid:29f95162-a67a-4165-a03b-a6721ff23338>",
"WARC-Date": "2022-12-01T12:32:24Z",
"WARC-IP-Address": "217.182.147.96",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UGPV7FIOZB7GFDFML5QHJLOCBMLNL3DU",
"WARC-Record-ID": "<urn:uuid:09cdde27-1545-4523-b246-193ecd223177>",
"WARC-Target-URI": "https://fr.kkgcn.com/93.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:beddbf18-36b0-4a8d-a0bf-e3d4419983da>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-125\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,
41,
42,
93,
94,
354,
355,
613,
614,
727,
728,
767,
768,
791,
792,
1106,
1107,
1261,
1262,
1466,
1467,
1514,
1515,
1783,
1784,
1825,
1826,
1937,
1938,
2125,
2126,
2164,
2165,
2408,
2409,
2742,
2743,
2860,
2861,
3086,
3087,
3269,
3270,
3311,
3312,
3610,
3611,
3827,
3828,
4056,
4057,
4059,
4060,
4114,
4320,
4321,
4327,
4328,
4329
],
"line_end_idx": [
41,
42,
93,
94,
354,
355,
613,
614,
727,
728,
767,
768,
791,
792,
1106,
1107,
1261,
1262,
1466,
1467,
1514,
1515,
1783,
1784,
1825,
1826,
1937,
1938,
2125,
2126,
2164,
2165,
2408,
2409,
2742,
2743,
2860,
2861,
3086,
3087,
3269,
3270,
3311,
3312,
3610,
3611,
3827,
3828,
4056,
4057,
4059,
4060,
4114,
4320,
4321,
4327,
4328,
4329,
4334
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4334,
"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.10159119218587875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006119950208812952,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18115055561065674,
"rps_doc_frac_unique_words": 0.4975845515727997,
"rps_doc_mean_word_length": 5.6086955070495605,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.1985931396484375,
"rps_doc_word_count": 621,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05110536888241768,
"rps_doc_frac_chars_dupe_6grams": 0.017226530238986015,
"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.04737294837832451,
"rps_doc_frac_chars_top_3gram": 0.02067182958126068,
"rps_doc_frac_chars_top_4gram": 0.008613260462880135,
"rps_doc_books_importance": -372.1880798339844,
"rps_doc_books_importance_length_correction": -372.1880798339844,
"rps_doc_openwebtext_importance": -186.59133911132812,
"rps_doc_openwebtext_importance_length_correction": -186.59133911132812,
"rps_doc_wikipedia_importance": -122.7721939086914,
"rps_doc_wikipedia_importance_length_correction": -122.7721939086914
},
"fasttext": {
"dclm": 0.8847450613975525,
"english": 0.0003849199856631458,
"fineweb_edu_approx": 1.5790388584136963,
"eai_general_math": -0.000009420000424142927,
"eai_open_web_math": 0.3959971070289612,
"eai_web_code": 0.9997500777244568
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,516,027,521,092,516,000
|
Security optimize
Should the U.S. draft cybersecurity experts?
The United States has a shortage of workers skilled in IT security. Thus, we are unable to protect critical infrastructure from terrorist threats. FUD or real? What is the solution?
Throughout history, men and women have answered the call. Is this yet again one of those times?
Secretary of Defense Robert Gates issued a directive in June of 2009, creating U.S. Cyber Command (USCYBERCOM). The military unit was assigned the following mission:
"USCYBERCOM plans, coordinates, integrates, synchronizes, and conducts activities to: direct the operations and defense of specified Department of Defense information networks. And when directed, conduct full-spectrum military cyberspace operations in order to enable actions in all domains, ensure US/Allied freedom of action in cyberspace and deny the same to our adversaries."
Getting past the military-speak, USCYBERCOM is responsible for defending the digital assets of the United States. USCYBERCOM was to be fully operational by October 1, 2010.
IOC was delayed
In military parlance, Initial Operational Capacity (IOC) was finally achieved on May 21, 2010. As with any complex endeavor, there are bound to be delays. But, one of the reasons put forth as to why, was not expected.
According to Stars and Stripes, in September of 2010, General Keith Alexander, Commander of USCYBERCOM, told Congress the command staff was in place, but he was having trouble filling many of the remaining positions:
"This is going to take time for us to generate the force,"
General Alexander also said:
"If you were to ask me, what is the biggest challenge that we currently face? It's generating the people that we need to do this mission."
Another example Secretary Janet Napolitano, Department of Homeland Security (DHS) has been dealing with a similar problem since 2009. To a point where the DHS initiated a recruiting campaign:
"The new hiring authority, which results from a collaborative effort between DHS, the Office of Personnel Management and the Office of Management and Budget, allows the Department to staff up to 1,000 positions over three years across all DHS components to fulfill critical cybersecurity roles."
It seems these positions are not filled either.
It is hard to deny the need for cybersecurity workers in the public sector. It seems the private sector is also looking for a significant number of cybersecurity professionals. With the competition for skilled people and national security at stake, what is the answer?
Possible solution
I recently listened to a NPR podcast explaining how Estonia exemplifies a country able to defend itself against cyberattacks. Following the cyberattacks in 2007, Estonia created the Cyber Defense League, a group of computer and networking specialists willing to volunteer their service as a cohesive military unit tasked to protect Estonia's electronic infrastructure.
In the podcast, Estonia's Defense Minister, Jaak Aaviksoo mentioned that having a command like the Cyber Defense League is so important, the government may institute a draft to make sure the appropriate experts are available:
"We are thinking of introducing this conscript service, a cyberservice."
Minister Aaviksoo continues:
"This is an idea that we've been playing around [with]. We don't have the mechanism or laws in place, but it might be one option."
Closer to home
If that seems far away, I found similar ideas being presented by people here in the United States. In this Government Information Security Blog post, Erik Laykin suggests the following:
"I propose the creation of a National Cyber Corps, a true public-private partnership with responsibility and authority to safeguard America's key information infrastructure.
The National Cyber Corps would be an elite, dedicated, civilian body of our country's best and brightest IT professionals. It would be a nimble group with a mandate to operate across all government departments and address a variety of needs."
Mr. Laykin offers more detail:
As envisioned, the National Cyber Corps would be a specific, centralized organization with access to and authority over all civilian departments within the government, but it would also coordinate and collaborate with the military.
In both part one and part two of his blog post, Mr. Laykin refers to the U.S. Coast Guard as an existing organization with traits similar to those required by the National Cyber Corps:
"Just as the specialty service patrols, protects and defends our coastal waters and tributaries, the National Cyber Corps would monitor, maintain, and mend our public and private cybersecurity. In many respects, fiber optics that transmit information in the 21st century are no different than the Mississippi tributaries that transported goods in the 19th century."
Not wanting to add ambiguity, but if the U.S. Coast Guard is to be an example, it should be known that in time of war, the U.S. Coast Guard's mission statement directs the service to come under the authority of the U.S. Navy.
Need your help
I'm trying to get a handle on this, but, it's bigger than one person. So, I need your help. Should countries, including the United States follow Estonia's lead? Then, the obvious question: Is it important enough to consider conscription?
About
Information is my field...Writing is my passion...Coupling the two is my mission.
276 comments
richard.artes
richard.artes
Maybe they should recruit from overseas! I've heard there are a lot of underpaid, overqualified people in 3rd worls countries like India!
AnsuGisalas
AnsuGisalas
to China... save everybody a lot of trouble :p :p :p
Michael Kassner
Michael Kassner
http://www.military.com/news/article/senators-say-military-cyber-ops-not-disclosed.html The following quote caught my attention: "The Senate Armed Services Committee voiced concerns that cyber activities were not included in the quarterly report on clandestine activities. But Vickers, in his answer, suggested that such emerging high-tech operations are not specifically listed in the law -- a further indication that cyber oversight is still a murky work in progress for the Obama administration."
seanferd
seanferd
What is interesting is how the "reasoning" is eaten whole most of the time.
Orodreth
Orodreth
IMHO, the word "draft" in your article kind of pushed the Cyber Security Agency discussion in the wrong direction. As Chief Mullen states the military (and intelligence) had taken cyber security steps. A CSA needs to be created under DHS and it would need the authority to propose, regulate and enforce security standards on critical public/private infrastructure. For instance, physically and virtually isolating nuclear reactor plants and computer control systems, US energy grid (and plants) computer and control systems, water supply systems, chemical plant computer systems, FAA computer, electrical and control systems, telecommunications lines and control systems, sensitive research sites, damn stock market system, etc. Under DHS with DOJ to enforce.
Michael Kassner
Michael Kassner
There is a lack of qualified people. Because of that, one option being looked at is some form of draft. I gave Estonia as an example.
apotheon
apotheon
When I was assigned to my battalion's ammo squad for a while, I discovered something interesting: that was the one of the squads in the entire battalion most densely packed with intelligence (of the human, and not military, variety). It took smart people who could withstand a lot of stress without screwing up their jobs to do the work of that squad. One little mistake, and 36 pounds of C-4 explosive compound goes missing. We also got treated better than, say, the (non-hazardous materials) transportation squads, or the line infantry squads. Somewhere along the way, they had figured out that it's a bad idea to hand smart people the keys to the kingdom and abuse them. Drafting intelligent people and putting them in a similarly sensitive, high stress position that relies on that intelligence -- drafting them -- would be one of the stupidest things military leadership could do. If "dangerously disgruntled" is a two on a satisfaction scale of one to ten, you'd have to do a lot of work to get them within five points of "dangerously disgruntled" after drafting them, because they'd probably start at a negative ten. In short, the cardinal rule in avoiding shooting yourself in the crotch as military leadership is to not draft highly intelligent people for sensitive positions that could cause a lot of damage. In short, I really really agree with your first sentence, AnsuGisalas. I also agree with the rest, but just felt like sharing.
AnsuGisalas
AnsuGisalas
A draft as is, will just put a lot of disgruntled techs in close contact with sensitive information. We all know that's not a good thing. Giving people a good-as-gold work training and -experience, in exchange for a specific period of voluntary service - is a great idea. If people are there to build a reputation (well, a CV, really) - they're all the less inclined to jeopardize that incentive by performing in ways that reflect poorly upon their competence and trustworthiness. But they still need to be given the tools necessary to cut through the petty bureaucracy that they will encounter.
cartmit
cartmit
Each person has the inalienable property right in their own person: conscription is simply a fancy word for slavery. No matter how noble-sounding the rationalization.
CharlieSpencer
CharlieSpencer
You mean, "Might makes right"? Try telling my natural cat that the natural bluebirds in my yard have inalienable rights to their persons.
apotheon
apotheon
"Natural Law" is a formal term of moral philosophy, used that way in this case (though whether it's used loosely that way would depend on the writer's intent).
apotheon
apotheon
In my experience, it is human nature to use reason only when absolutely required by immediate concerns of survival -- and even then it is usually overruled by other factors in human nature, such as the propensity to piss oneself and get in the way. It takes something of an effort of will to actually apply reason. While reason is definitely a capacity of humans, I do not think its use is particularly a part of human nature. Its abuse on the other hand -- that's another matter.
AnsuGisalas
AnsuGisalas
That'd be why he's in such a huff all of the time... In a way it's similar to what Descartes was trying; a ramp made out of pure reason to connect the existence of humans with the necessity of what human culture was then. It's egocentric, for starters...
santeewelding
santeewelding
"Reason" is another name for human nature, meaning that those "binding rules of moral behavior" are deduced by wringing its own neck. Fat chance.
apotheon
apotheon
I'm not huge on the "natural law" approach, especially when it's the "proprietary right" version of "natural law". My preferred approach is a logical progression from basic principles (i.e., cogito ergo sum) to a founding principle of ethics (i.e., aggression is unethical; the Non-Aggression Principle). Still, the result is the same: conscription is a fancy word for slavery.
AnsuGisalas
AnsuGisalas
How do you apply cogito? I never get beyond the premise... Of course, I have no interest in a proof of the existence of God, and proof that this God is benevolent ;)
apotheon
apotheon
When I hand-wave, I am perfectly willing to admit it.
AnsuGisalas
AnsuGisalas
always getting stuck with the Daemon, leading me to "the world is unfalsifiable". Thanks for the recipe. Hand-waving is what we do, but it takes guts to reveal it.
apotheon
apotheon
I think. I am. Solipsism is unproductive, so . . . You are, and others are. Interaction raises the question of ethics. Is there right and wrong? Well -- if not, it doesn't matter, but if so, we should do something about that. Metaphysical morality is unprovable, but undisprovable. Let each live according to his or her metaphysical morality flavor of choice. Let each live according to his or her . . . choice. The one constant from that: do not interfere with others' choices for themselves. Thus: do not initiate force against others. Voila -- the non-aggression principle. Of course, there's an ungodly (har har) amount of hand-waving in that version. When I write up the version that doesn't include all that handwaving, it'll probably be a $40 book available from Barnes & Noble.
tmcclure
tmcclure
The government will just politicise it and f*ck it all up.
rick_bauer
rick_bauer
Michael: My organization is thoughtfully engaged at the highest levels of our nation's cyber defense infrastructure (DoD, DHS, other agencies) working the issue. It's not as dire as you might think. We have a plan to create a pipeline in our K-12 and 2- and 4-year schools to address this critical need. Please send e-mail to rbauer@comptia.org and we can talk at length about it. thanks, rick bauer
d.miliano
d.miliano
I was hoping that Mr. Obama would be a 21st century president rather that the 19th century types we seem to like to elect. Think what our "smart" weapons would be worth if hacking destroyed or disabled the GPS network. An enemy could plant a virus/worm and suddenly our electrical grid could be compromised. Likewise, our telecommunications network could be interrupted. I was against the draft in the 1970s - especially when I was being pursued by my local selective service board! But you don't have to draft talent to harden our systems. We build tanks, jets, ships, etc., using the talent in our industry. The same could be done for cyber security - we just need to find the will. I hope we don't have to have a cyber 9/11 before "get it." Great topic! Thanks
apotheon
apotheon
A Blackberry doesn't equate to technologically forward thinking. Obama is a Chicago politician -- no more, and no less.
MC68000
MC68000
IMHO cyber-space is just another part of our world and is just as vulnerable to lawlessness as any part. That being said, I know I'm stating the obvious when I point out that there have to be goodguys to keep the badguys in check. What becomes ludicrous then, is the idea that a country, or other entity, can "conscript" the "good" guys. Conscription, by it's very definition, breeds discontent. And aren't the bad guys mostly just malcontents, already unhappy with their lot in life? Sounds akin to the "fox guarding the henhouse" to me. Do we need a protective presence, yes, but people of this level of intellect need to be proven men and women of high moral character and good repute. Otherwise you're just wasting your time. You can't watch everyone all the time which is what you'd have to do in a conscription scenario.
Michael Kassner
Michael Kassner
About malcontented bad guys. It seems that the new version of bad guys are interested in making easy money and the Internet facilitates that. For all intents, it is another business, just not legal.
apotheon
apotheon
Do you want to add a new "badguy" class -- one that, from many perspectives, wouldn't be so bad after all -- that acts in opposition to government because government is engaging in systematic institution of forced labor?
apotheon
apotheon
If nothing else, the "bad guys" are discontented with the rules. Terrorist "bad guys" are malcontents, too.
Michael Kassner
Michael Kassner
I was wondering if the bad guys were discontent or not. The few on the "dark side" I know are well adjusted and drive a better car than I do. Edit: Spelling
jkameleon
jkameleon
Volunteers, that is. They could defend Americans not only from the outside threats, but also from the DHS by spotting the spying that should not occur, and data that should not be gathered. It's the cyber version of the 2nd amendment, if you will. The right of the people to keep and bear information.
elbastevenson
elbastevenson
I put in my 4 during Nam and have over 20 years in IT and heavy Security and real time energy management. If the white house is willing to pay me enough to put food on the table for my family and a roof over their heads. Then sign me up.
seanferd
seanferd
Every little thing is a "cyberattack" to these people. It's just another game of security theater to grow government, the military, and find new ways to be the enemies of human and civil rights, and privacy. It's a scam. The military has already completely failed to do the job of an intelligence, police, and assassination organization. It is mission creep. These things are not the job of the military, whether the military thinks so or not, and whether the CINC/POTUS and Congress think so or not. Sometimes the military has stupid missions thrust upon it, and sometimes it actively seeks out missions to enlarge itself (as if this were needed). When the military can protect its own IT infrastructure and networks, well, then good for the military. If there ever were some sort of "cyberwar", these are the last people who should be dealing with it. OMG! I can't reach Facebook!
apotheon
apotheon
I think you're on to something!
seanferd
seanferd
to real sysadmins and security folks. Failing that, I'd rather see 4chan in charge of it than the gov or mil. Very distributed, even though they are only motivated by lulz and whatever they find annoying or unjust at the moment.
juaniotoo
juaniotoo
I'm beginning to find out that quite a few of so called security experts-hackers, IT experts and so on have been meth users, or "tweakers". I personally know of 3 of them that I've met going through my college courses at my local school. I know how to identify them too by way of their hyper-vigilant actions while on a high. Maybe they're all so high and go so fast they're not worth anything to anybody, and certainly not the US Government.
eryk81
eryk81
I have never liked the idea of someone telling me what I have to do; then again, if I had to, I'd rather not get shot at. However, it would be a great way to train eager computer and information security professionals. That knowledge could then be taken into the private sector where it is needed as well. If it was to start today, it would be a great way to get American's working and keep them working for years to come. It would also help bridge the knowledge and experience gap in the IT field created by all the outsourcing and H1B's.
apotheon
apotheon
There are a lot of good comments in this discussion about the reasons that drafting "cybersecurity" experts would be a really bad idea -- for the effectiveness of conscript personnel, because qualified people are being ignored, because the real problem is training for military personnel, and so on. There's one more reason that I didn't notice anyone else mentioning, though: I volunteered. I fell out of airplanes and carried a rifle for the US Army. I did this of my own free will. I'll be damned if I'll endorse the government turning my voluntary service into support of a system that enslaves people. Screw that.
CharlieSpencer
CharlieSpencer
I won't say it equates to slavery, but neither result in effective workers. All you get are uninterested people who will only do the bare minimum, and will have to be watched like cornered rats in order to get even that little. And who can blame them?
apotheon
apotheon
What differentiates it from slavery?
apotheon
apotheon
Ethics rarely have an impact on legislation largely because legislators rarely have any ethics to speak of. Ethics damned well should have an impact on legislation, though.
CharlieSpencer
CharlieSpencer
Sure, I can agree to that, as long as we acknowledge that ethics rarely have any impact on legislation.
apotheon
apotheon
Do we agree it's also an unethical tool for acquiring "employees"?
CharlieSpencer
CharlieSpencer
Call it what you want; we agree it's a poor tool for successfully acquiring interested, motivated employees.
apotheon
apotheon
You speak of custom, and not of the basic state of forced labor and dictatorial command over the lives of the enslaved. > Slavery rarely has any built-in mechanism for escaping its confines. 1. Rarely is not the same as never. 2. As Neon pointed out, there are historical precedents for slaves "buying" their freedom, as well as for limited periods of enslavement. Would a slaver be any less a slaver if he offered his slaves the option to leave after four years -- with the caveat that he may "stop-loss" them if he felt the need? > Drafted military service is usually for a pre-defined, limited period of time. That's called a "period of indenture" in the slavery business -- except that in the vast majority of cases, indentured servants were at least indentured by signing a contract of their own free will, rather than being scooped up against their will and forced into service. See my above question about offering slaves the option to leave after four years, assuming there's no "stop-loss" in effect. > Draftees get pay and benefits. Slaves don't get either. Food. Housing. Clothes. Slaves were paid; just in what amounted to barter, rather than coin. Some slaves even got an allowance -- particularly house slaves. Would someone be any less a slave if the slaver offered his slaves a monetary allowance, but otherwise treated slavery exactly the same as everyone else? > Some draftees find they enjoy military service and opt to make it a career. Many freed slaves in the United States south elected to remain at the plantations where they were previously enslaved, as employees. Is anyone any less a slave if, later, the former slave (having been freed) chooses to stick around? Ultimately, slavery and conscription are pretty much identical in the ways that matter: 1. You are forced into the relationship, against your will. 2. You have no recourse for release unless and until the managing organization chooses to release you. 3. You get paid, in whatever form, only at the managing organization's discretion. 4. Fleeing service is a punishable offense. 5. You are forced into the relationship, against your will. Really, that's the key point, and deserves repeating. That's what makes it "slavery". All the rest would, in some respects at least, be excusable if not for this one fact. I dealt with items 2, 3, and 4 while I was in the military, and did not consider my rights to be violated by them, because I signed on the dotted line of my own free will. If it was not of my own free will, though, I might well have shot someone to free myself of enslavement. Conscripts are slaves. The nominally temporary state of that condition does not make it any less what it is.
Neon Samurai
Neon Samurai
Slaves tended to get the minimum of housing and food. It's not a life the majority would choose but it is not without it's benefits. From the master's perspective they are an owned resource; there is economic incentive to maintain them. If you starve your slaves and leave them out int he elements they die and you have to buy more. You also have to expend more resources controlling them or suffer a revolt. Depending on the culture, slaves also had a chance of earning their freedom. This seems to be more a Roman thing rather than a recent example. I'd say draftees and slaves are both very much kept people and, depending on culture of enslavement, both draftees and slaves have a promise of freedom which they may or may not ever attain. "Fight for me and I'll feed you, house you, equip you and pay you some money. You'll be freed after your tour unless we still need conscripts." isn't a whole lot different from "Fight for me and I'll feed you, house you, equip you, give you some of the winnings. You may even win your freedom at the Colosseum."
CharlieSpencer
CharlieSpencer
Slavery rarely has any built-in mechanism for escaping its confines. Drafted military service is usually for a pre-defined, limited period of time. Draftees get pay and benefits. Slaves don't get either. Some draftees find they enjoy military service and opt to make it a career. I'm sure there must have been a few slaves over the centuries who preferred not having to accept any responsibility for themselves, but I'll bet it's a much smaller percentage than those of 'career' draftees. But I'll grant you one similarity: Canada welcomed those fleeing from either.
AnsuGisalas
AnsuGisalas
If the draft is for a homeland defence force ONLY (no international operations, that's for career soldiers who signed up), then many people will have a motivation to at least be good enough to not get killed within a day when the ........ come. The people who will not take the draft have to do civilian service for that time, which is not a big deal, and some even get paid for what they do in that time - even though they shouldn't theoretically. It's not the draconian system of the past.
apotheon
apotheon
You appear to have the professional political facility for using the truth to peddle the most heinous dishonesties.
AnsuGisalas
AnsuGisalas
"volunteering" means not suffering the punishment... De facto punishment : coming of age, but not enlisting -> lose the privileges of adulthood. Having the punishment occur at the point where those privileges would have been otherwise awarded doesn't mean that they're not taken away, does it?
apotheon
apotheon
As I recall it, there was respect for the fortitude of spirit that drives a man to act in defense of his culture and family in a just war -- thus, the voluntary act of placing oneself in harm's way for a good cause. I don't think that the simple fact of being a target for enemy soldiers against one's will really qualifies one for Lazarus Long's high regard.
AnsuGisalas
AnsuGisalas
We don't really blame them for the war, do we? I don't know if the English are specifically angry with Argentinians anymore, but since I see little sign of that, I'd imagine it's cooled off quite a lot already. With Germany, it's "the other stuff"... And as hard as it is to forgive others (or easy, depending on one's saintliness), it's much much harder to forgive oneself (regardless of saintliness). But yeah, they'll get over themselves eventually. Let's just hope they don't go into denial... again.
JCitizen
JCitizen
but the forgiveness needs to happen some time. My dad was shot at by Germans and he shot back, but he never hated his enemy.
seanferd
seanferd
seem to find that going to War makes a proper man. But perhaps there is something on the gripping hand, or yet more on a couple of tentacles.
JCitizen
JCitizen
to hear how it is done in other countries. My German cousin served, but my other German male relative didn't, I forgot to ask them if it was a lotto or not. (the last I saw of them) He looked embarrassed to admit serving, and I told him he can be proud of serving his country!
AnsuGisalas
AnsuGisalas
Of course... they did have an IQ-test, and they may have decided, based on that, to not give me the opportunity to draw lots. I have no visual handicaps, nor do I have foot trouble, and I told them as much. The draft supervision board informed of their decision, and the only military member started to say "You can of course enlist..." but faltered when I turned my attention to him. Which is not very conducive to recruiting... I have no idea what really happened.
AnsuGisalas
AnsuGisalas
I went in there with the attitude of taking what may come. As it were, they decided that, nah. Apparently the doctors involved in the process didn't want me to go into service, at least I've had no kind of trouble with flat feet or visual acuity before or after that... ;)
santeewelding
santeewelding
You are back. I am less interested in how you cast all about you, than how you cast your own self. That way, it's harder to refudiate.
AnsuGisalas
AnsuGisalas
merely recounting how the system was supposed to work. It used to be so that there was a punishment aspect to it, but that's fading. The military has looked in the mirror and realized that they're better off not wasting energy on trying to force reluctant draftees, and that stance has rubbed off on the officials charged with handling the refusees. I must admit that I'm not entirely certain how it works as I haven't been throught the draft refusal process ;) EDIT: I did some research; the government pays an allowance for the duration of the civilian service; In Denmark it's something like 40$ per working day. There's a seperate addition for housing expenses. Getting additional pay fromt the place of service isn't allowed, but as I said, it happens.
apotheon
apotheon
You must be thinking of the voluntary service from the novel Starship Troopers, where a reward of honorable service was political enfranchisement -- which is not the same thing as conscription, universal or otherwise, in any way. It's voluntary; it just comes with a reward of sorts.
apotheon
apotheon
Why shouldn't people get paid for their work? Does the fact they're being forced to do it against their wills somehow make them less deserving of some small compensation for their time?
bboyd
bboyd
I admire the Swiss and Israeli programs for the even hand they use for conscription. I'm not sure the negative view of the draft is warranted. I'll give that it is less effective but when used at real need historic precedent shows benefit to the nation. Of course a political police action like the Vietnam war or the Russians war in Afghanistan are not real need. Neither in my mind is the current internet "Threat".
AnsuGisalas
AnsuGisalas
Finland has a universal military service requirement (for males, females of the species may serve, but don't have to). Denmark, having a population as big as Finland's, but an area to be defended much much smaller, has a draft. Lottery and all. But because it's coupled with the option to joing emergency services or do other civilian duties, it doesn't feel very terrible. I had a classmate who wasn't very bright. He inadvertently forgot to show up for draft. Then he panicked and [i]went underground[/i]... authorities meanwhile were going "ho-hum". Silly kid. When he finally broke down and [i]turned himself in[/i] they were going "WTF? What the hell do we care? Go draw a number - we're busy deciding out the grounds on which to disqualify your ass!"
CharlieSpencer
CharlieSpencer
A draft is inherently unfair. It's a lottery; if your number comes up, you're screwed; if it doesn't, you win. I have no objections to a mandatory period of service required of ALL individuals, as some countries mandate for high school graduates. I have no objections to offering a variety of options, such as military service, Peace Corps (or other international civilian service equivalent), cybersecurity duty, a revival of the old Civilian Conservation Corps or other 'green' service, etc. Indeed, I support such programs and wish the US had one. I think they give citizens a common shared experience we in the US lack, and might help instill a sense of pride and civic responsibility. One cannot help but have an interest when one has participated.
yawningdogge
yawningdogge
Where are you getting slavery from? I think it's wide of the mark to say that conscription and slavery are the same thing.
Spitfire_Sysop
Spitfire_Sysop
Can you describe the difference between court ordered work and slavery? (by court ordered, I mean that you will be jailed for dodging the draft) Forced work? Military labor camps? Arbeit Macht Frei? I understand the argument that this is a matter of national security but are we declaring a state of emergency? Have we declared war?
apotheon
apotheon
If the populace is so opposed to the war that nobody's willing to volunteer, maybe it's a war you shouldn't be fighting.
|
{
"url": "http://www.techrepublic.com/blog/it-security/should-the-us-draft-cybersecurity-experts/",
"source_domain": "www.techrepublic.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "190036",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SMZAXCAOJDYZO3FAGEKJ6RX3CLTKDCP2",
"WARC-Concurrent-To": "<urn:uuid:b631026a-91c3-467c-aa76-ce0ef147b95e>",
"WARC-Date": "2014-03-13T16:49:43Z",
"WARC-IP-Address": "23.0.160.43",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:PGSZLEWD7IRCAJQ24X277KKPWK4MB5A5",
"WARC-Record-ID": "<urn:uuid:889ab982-383a-4f3e-b8ec-4aeb701a61c8>",
"WARC-Target-URI": "http://www.techrepublic.com/blog/it-security/should-the-us-draft-cybersecurity-experts/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7d10abf5-79d7-41ed-b24c-29b99aac253e>"
},
"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,
18,
19,
64,
65,
247,
248,
344,
345,
511,
512,
892,
893,
1066,
1067,
1083,
1084,
1302,
1303,
1520,
1521,
1580,
1581,
1610,
1611,
1750,
1751,
1943,
1944,
2240,
2241,
2289,
2290,
2559,
2560,
2578,
2579,
2948,
2949,
3175,
3176,
3249,
3250,
3279,
3280,
3411,
3412,
3427,
3428,
3614,
3615,
3789,
3790,
4033,
4034,
4065,
4066,
4298,
4299,
4484,
4485,
4851,
4852,
5078,
5079,
5094,
5095,
5333,
5334,
5340,
5341,
5423,
5424,
5437,
5451,
5465,
5466,
5604,
5605,
5617,
5629,
5630,
5683,
5684,
5700,
5716,
5717,
6217,
6218,
6227,
6236,
6237,
6313,
6314,
6323,
6332,
6333,
7093,
7094,
7110,
7126,
7127,
7261,
7262,
7271,
7280,
7281,
8727,
8728,
8740,
8752,
8753,
9349,
9350,
9358,
9366,
9367,
9534,
9535,
9550,
9565,
9566,
9704,
9705,
9714,
9723,
9724,
9884,
9885,
9894,
9903,
9904,
10385,
10386,
10398,
10410,
10411,
10666,
10667,
10681,
10695,
10696,
10842,
10843,
10852,
10861,
10862,
11240,
11241,
11253,
11265,
11266,
11432,
11433,
11442,
11451,
11452,
11506,
11507,
11519,
11531,
11532,
11696,
11697,
11706,
11715,
11716,
12502,
12503,
12512,
12521,
12522,
12581,
12582,
12593,
12604,
12605,
13005,
13006,
13016,
13026,
13027,
13791,
13792,
13801,
13810,
13811,
13931,
13932,
13940,
13948,
13949,
14776,
14777,
14793,
14809,
14810,
15009,
15010,
15019,
15028,
15029,
15250,
15251,
15260,
15269,
15270,
15378,
15379,
15395,
15411,
15412,
15569,
15570,
15580,
15590,
15591,
15893,
15894,
15908,
15922,
15923,
16161,
16162,
16171,
16180,
16181,
17064,
17065,
17074,
17083,
17084,
17116,
17117,
17126,
17135,
17136,
17365,
17366,
17376,
17386,
17387,
17830,
17831,
17838,
17845,
17846,
18386,
18387,
18396,
18405,
18406,
19025,
19026,
19041,
19056,
19057,
19309,
19310,
19319,
19328,
19329,
19366,
19367,
19376,
19385,
19386,
19559,
19560,
19575,
19590,
19591,
19695,
19696,
19705,
19714,
19715,
19782,
19783,
19798,
19813,
19814,
19923,
19924,
19933,
19942,
19943,
22629,
22630,
22643,
22656,
22657,
23712,
23713,
23728,
23743,
23744,
24311,
24312,
24324,
24336,
24337,
24829,
24830,
24839,
24848,
24849,
24965,
24966,
24978,
24990,
24991,
25285,
25286,
25295,
25304,
25305,
25665,
25666,
25678,
25690,
25691,
26196,
26197,
26206,
26215,
26216,
26341,
26342,
26351,
26360,
26361,
26503,
26504,
26513,
26522,
26523,
26800,
26801,
26813,
26825,
26826,
27293,
27294,
27306,
27318,
27319,
27592,
27593,
27607,
27621,
27622,
27757,
27758,
27770,
27782,
27783,
28541,
28542,
28551,
28560,
28561,
28845,
28846,
28855,
28864,
28865,
29051,
29052,
29058,
29064,
29065,
29483,
29484,
29496,
29508,
29509,
30266,
30267,
30282,
30297,
30298,
31052,
31053,
31066,
31079,
31080,
31203,
31204,
31219,
31234,
31235,
31568,
31569,
31578,
31587,
31588
],
"line_end_idx": [
18,
19,
64,
65,
247,
248,
344,
345,
511,
512,
892,
893,
1066,
1067,
1083,
1084,
1302,
1303,
1520,
1521,
1580,
1581,
1610,
1611,
1750,
1751,
1943,
1944,
2240,
2241,
2289,
2290,
2559,
2560,
2578,
2579,
2948,
2949,
3175,
3176,
3249,
3250,
3279,
3280,
3411,
3412,
3427,
3428,
3614,
3615,
3789,
3790,
4033,
4034,
4065,
4066,
4298,
4299,
4484,
4485,
4851,
4852,
5078,
5079,
5094,
5095,
5333,
5334,
5340,
5341,
5423,
5424,
5437,
5451,
5465,
5466,
5604,
5605,
5617,
5629,
5630,
5683,
5684,
5700,
5716,
5717,
6217,
6218,
6227,
6236,
6237,
6313,
6314,
6323,
6332,
6333,
7093,
7094,
7110,
7126,
7127,
7261,
7262,
7271,
7280,
7281,
8727,
8728,
8740,
8752,
8753,
9349,
9350,
9358,
9366,
9367,
9534,
9535,
9550,
9565,
9566,
9704,
9705,
9714,
9723,
9724,
9884,
9885,
9894,
9903,
9904,
10385,
10386,
10398,
10410,
10411,
10666,
10667,
10681,
10695,
10696,
10842,
10843,
10852,
10861,
10862,
11240,
11241,
11253,
11265,
11266,
11432,
11433,
11442,
11451,
11452,
11506,
11507,
11519,
11531,
11532,
11696,
11697,
11706,
11715,
11716,
12502,
12503,
12512,
12521,
12522,
12581,
12582,
12593,
12604,
12605,
13005,
13006,
13016,
13026,
13027,
13791,
13792,
13801,
13810,
13811,
13931,
13932,
13940,
13948,
13949,
14776,
14777,
14793,
14809,
14810,
15009,
15010,
15019,
15028,
15029,
15250,
15251,
15260,
15269,
15270,
15378,
15379,
15395,
15411,
15412,
15569,
15570,
15580,
15590,
15591,
15893,
15894,
15908,
15922,
15923,
16161,
16162,
16171,
16180,
16181,
17064,
17065,
17074,
17083,
17084,
17116,
17117,
17126,
17135,
17136,
17365,
17366,
17376,
17386,
17387,
17830,
17831,
17838,
17845,
17846,
18386,
18387,
18396,
18405,
18406,
19025,
19026,
19041,
19056,
19057,
19309,
19310,
19319,
19328,
19329,
19366,
19367,
19376,
19385,
19386,
19559,
19560,
19575,
19590,
19591,
19695,
19696,
19705,
19714,
19715,
19782,
19783,
19798,
19813,
19814,
19923,
19924,
19933,
19942,
19943,
22629,
22630,
22643,
22656,
22657,
23712,
23713,
23728,
23743,
23744,
24311,
24312,
24324,
24336,
24337,
24829,
24830,
24839,
24848,
24849,
24965,
24966,
24978,
24990,
24991,
25285,
25286,
25295,
25304,
25305,
25665,
25666,
25678,
25690,
25691,
26196,
26197,
26206,
26215,
26216,
26341,
26342,
26351,
26360,
26361,
26503,
26504,
26513,
26522,
26523,
26800,
26801,
26813,
26825,
26826,
27293,
27294,
27306,
27318,
27319,
27592,
27593,
27607,
27621,
27622,
27757,
27758,
27770,
27782,
27783,
28541,
28542,
28551,
28560,
28561,
28845,
28846,
28855,
28864,
28865,
29051,
29052,
29058,
29064,
29065,
29483,
29484,
29496,
29508,
29509,
30266,
30267,
30282,
30297,
30298,
31052,
31053,
31066,
31079,
31080,
31203,
31204,
31219,
31234,
31235,
31568,
31569,
31578,
31587,
31588,
31708
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 31708,
"ccnet_original_nlines": 396,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4376942217350006,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02439402975142002,
"rps_doc_frac_lines_end_with_ellipsis": 0.0025188899599015713,
"rps_doc_frac_no_alph_words": 0.15926040709018707,
"rps_doc_frac_unique_words": 0.29355698823928833,
"rps_doc_mean_word_length": 4.796988010406494,
"rps_doc_num_sentences": 356,
"rps_doc_symbol_to_word_ratio": 0.0024860200937837362,
"rps_doc_unigram_entropy": 6.195278167724609,
"rps_doc_word_count": 5246,
"rps_doc_frac_chars_dupe_10grams": 0.0175640806555748,
"rps_doc_frac_chars_dupe_5grams": 0.043989669531583786,
"rps_doc_frac_chars_dupe_6grams": 0.03377706930041313,
"rps_doc_frac_chars_dupe_7grams": 0.03155175969004631,
"rps_doc_frac_chars_dupe_8grams": 0.029962249100208282,
"rps_doc_frac_chars_dupe_9grams": 0.024716870859265327,
"rps_doc_frac_chars_top_2gram": 0.0045698401518166065,
"rps_doc_frac_chars_top_3gram": 0.0016689799958840013,
"rps_doc_frac_chars_top_4gram": 0.0033379700034856796,
"rps_doc_books_importance": -2282.5546875,
"rps_doc_books_importance_length_correction": -2282.5546875,
"rps_doc_openwebtext_importance": -1492.0284423828125,
"rps_doc_openwebtext_importance_length_correction": -1492.0284423828125,
"rps_doc_wikipedia_importance": -1046.4893798828125,
"rps_doc_wikipedia_importance_length_correction": -1046.4893798828125
},
"fasttext": {
"dclm": 0.5571467876434326,
"english": 0.9692692160606384,
"fineweb_edu_approx": 1.7713631391525269,
"eai_general_math": 0.3203811049461365,
"eai_open_web_math": 0.3295378088951111,
"eai_web_code": 0.05297559127211571
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "358.4",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Weapons, Armor, Air power, and Military engineers"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "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": "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": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,022,599,927,843,622,400
|
I'll be travelling and I hope to back up my laptop in case it gets stolen. I wonder if I can make my backup a bootable USB flash drive, that way I could just have my system as-is on stick and use it on any computer.
Is this possible? What are the limitations? (only 64-bit systems? No way to keep it up to date?, etc...)
Update: Thanks so much for the thoughtful responses! At this point, I'm wondering how I should go about keeping my system backed up to a bootable external drive.
• 1
Because no answer addresses this: Beside size and speed, there are no hard limitations. 32/64bit work both, and keeping it up to date is no problem. Make some partitions, transfer the files with rsync and restore grub, that´s all. Only possible problem: Flash drives wear out after some time. A cheap one could get unusable within the expected lifetime if you use it much. – deviantfan Jan 11 '15 at 6:45
• @deviantfan that one must be extremely cheap. USB 2.0 is way too slow to make the flash wear out in any interesting time. – Ruslan Jan 11 '15 at 16:18
• @Ruslan I agree, but production "errors" happen... at least knowing about the possibilty won´t hurt. – deviantfan Jan 11 '15 at 17:30
• +1 deviantfan. I tried installing Mint to a usb drive (not a super-cheap no-name one either, a Lexar) and it just couldn't do it, crashed a few times, corrupted filesystem, very very slow, terrible. Not sure if it was some combination of usb ports & devices, it didn't wear out the drive (no errors afterwareds) but when using the usb drive normally it was & still is flawless. I would recommend using a usb drive to run live iso's from, along with a copy of your $HOME and a few .deb programs you need, that's practically your whole system ready to run "live" but effectively read-only – Xen2050 Jan 12 '15 at 14:55
up vote 7 down vote accepted
I've been doing this for years. I'm writing now from a PC which does not even contain an internal hard drive. I don't even carry a laptop, just this high performance USB flash media.
I will now outline the two components you need to buy if you want decent performance. Most flash drives are too slow for most people, and they can also become unstable due to overuse of the type they get running operating systems and particularly swapspace.
I use this USB3 to mSATA SSD flash media adapter, priced here at US$19.
And inside it, I use an mSATA SSD drive originally made for today's tablet and netbook computers. Though I manage to get by on just 64 GB myself, you may choose to buy something with greater capacity. Last I checked, the capacity of these drives was up to around 1 TB. I remember when the largest available was just 32 GB.
If you would like something still more rugged, I can recommend this similar USB3-mSATA adapter which is made from a solid section of extruded aluminum. It is almost exactly the same price. Whereas the model I previously recommended is only 2/3 the thickness, it would probably cave if stepped on. This one might tolerate a car driving over it.
To the best of my knowledge, nobody has made a waterproof model yet, but it's only a matter of time. The strange thing is that as obvious as these appear as portable operating system environments, apparently all references to these regard their use entirely for portable data.
One last detail. It is my practice to keep a 128 GB common slow flash drive in one of the more regularly used computers and have the portable drive automatically back up critical data to it when it is used there. The automatic backup software I'm using is that which is included with Ubuntu and it encrypts its backups. This way whether I lose the boot drive, or my home is robbed, the odds of actually losing all my current personal data are incredibly low.
• 1
PS: Perhaps I should have mentioned that my operating system cloner of choice is actually clonezilla run either from flash media or a cdrom. I am very familiar with dd and for a very long time I used it just because it meant less stuff to carry, but it has risks. In the end I find clonezilla less stressful. – gyropyge Jan 11 '15 at 9:07
• Re-reading your post now. Yes, if your clone is 64 bit then that will limit your travel options. My portable is 32 bit for this reason. I like flexibility. Also post pae (?) versions are less limited by the 32 bit condition so I'm not missing out on as much. when using a host of different computers, you have no control over how much ram they have, and as 32 but ubuntu is more ram efficient, that works better for me. – gyropyge Jan 11 '15 at 9:12
• 1
Oh, and for some reason you asked, "No way to keep it up to date?" I have no idea why you would assume or ask that. Updating an external drive is exactly like updating an internal drive. If you have internet connectivity, you just update. You just treat it as though it is your own drive... because it is. – gyropyge Jan 11 '15 at 10:36
This should be possible; your flash drive just needs to have enough memory for the OS and whatever files you'll be using. The limitations are based on the flash drive and/or the computer you run it (but most likely the read/write speed of the flash drive will have a larger impact on speed).
The stick is used as memory similar to any other harddrive in a laptop or desktop computer. You could probably boot from one flash drive with Ubuntu flashed onto it and select your other flash drive as the destination hard disk drive for the OS.
I'm no expert in this, but it should be do-able, just slow.
• 1
This isn't really an answer here. Yes, it answers the base question of "is it possible", but it does not offer any solution as to HOW it is possible. – user323419 Jan 11 '15 at 5:06
• 1
OP didn't ask how... maybe he already knows. Question answered +1 – Xen2050 Jan 11 '15 at 5:52
• You'd probably want to have syslinux on the flash drive, but maybe have it load GRUB, instead of a kernel directly? Once you have a setup that loads a kernel + initrd, with root=LABEL, and that the kernel can find the root FS with that label, GNU/Linux should Just Work. – Peter Cordes Jan 11 '15 at 7:40
• I have seen big slowdowns in write-speed to USB sticks with Linux, though. Like maybe if they queue too much data to the device, it actually slows down? Because I found that rsync --bwlimit could sustain faster speeds if I hand-tuned it to a speed just below what I was getting before it bogged down. (use dstat or whatever to monitor IO speeds.) If this happens on the root / home filesystem, it might be pretty nasty to use when doing something write-intensive. – Peter Cordes Jan 11 '15 at 7:43
Yes, this is completely possible. First and foremost, you will need at least 2 USB ports available, or 1 USB port and 1 CD-Drive.
You start by booting into a Live-CD version of Ubuntu with your hard-drive where it is and the target device plugged into USB. Mount your internal drive and target USB to any paths you like.
Open up a terminal and enter the following commands:
tar cp --xattrs /path/to/internal | tar x /path/to/target/usb
You can also look into doing this through a live installation and a utility called CloneZilla, but I am unsure of exactly how to use CloneZilla. The above method is what I used to copy my 128GB hard-drive's installation of Ubuntu to a 64GB flash drive.
• You know, you can use the toram boot option when booting live, then you don't need to keep the iso cd/dvd/usb connected (if you have enough ram, >1.5GB or so – Xen2050 Jan 11 '15 at 5:57
• Huh, /dev/sda is actually where you have your internal drive mounted, right? Not the device file. Ditto for /dev/sdc. You don't need to boot from USB to do this. You could just do it while your Ubuntu desktop is up and running from the hard drive you're going to use as the source for the copy. I'd use rsync -aHAXx to do the copy, as that preserves hardlinks. I forget if tar does or not. rsync -x limits to one filesystem, so you don't copy /proc, /sys, and all that crap from your running system. Booting from a live cd/usb is a workaround for --one-file-system. – Peter Cordes Jan 11 '15 at 7:36
• IDK if modern Ubuntu has anything in any of the directories that are shadowed when udev is mounted on /dev, for example. Probably not, since initrd and pivot_root is completely standard now, so a populated /dev existing for the boot scripts isn't needed. – Peter Cordes Jan 11 '15 at 7:38
• Right @PeterCordes , I didn't look too close earlier, but pipeing tar to tar, with raw devices, no even a partition, just to copy... somethin' wrong there – Xen2050 Jan 11 '15 at 7:49
• The first tar command will run as typed, but it will output a tar file that just has one block-device special file. (not the contents, just the device-file.) In extract mode, tar's arguments are the list of files to extract from the archive. – Peter Cordes Jan 11 '15 at 7:52
I'm adding ANOTHER ANSWER to answer your OTHER QUESTION, which you added to your first question after I offered my original answer, chosen above:
you wrote:
Update: Thanks so much for the thoughtful responses! At this point, I'm wondering how I should go about keeping my system backed up to a bootable external drive.
What you are asking can be answered different ways depending on what you are trying to do. I can think of four possible ways, I will explain in outline format below:
1) Synchronize data-only across two bootable drives:
This seems to be what you want to do, but I believe you will run into a problem which will impede data security. I will explain.
It seems to me that you seek to SYNCHRONIZE data files between two (or more) bootable operating systems. Though I've never actually done this, I know that it is only a google-search away, and very likely explained on this site. However for that to work, you'd almost have to turn encryption off, or rather, never turn encryption on. In my opinion, if you are going to have portable bootable external drive, they should always have data encryption turned on, so unless you discover a drive synchronize that can also accept password data, or unless you decide to travel without data encryption, this is not a viable solution.
2) Clone again the internal or external drive in its entirety to another drive:
Use the "Clonezilla" utility, mentioned in the very last paragraph of my original answer, to clone the original internal drive to another external drive to make two such external bootable drives to keep track of.
3) Use the backup utility included with Ubuntu with your external bootable drive:
This is what I do. I boot (nearly) ALL MY COMPUTERS to a single external drive which travels with me, and when I am home, the 128gb slow usb flash drive, which remains plugged in my home computer, makes incremental backups of changed files on the traveling boot drive.
In your case, I would recommend that in the interest of data security, that you physically remove your internal hard drive and leave it at home. It will frustrate the heck out of anyone who steals your laptop, in fact if they get to try it before they steal it, they might even decide it is broken and leave it alone. If the thought of having only one bootable external drive frightens you, bring two and mark the spare clearly as such so it is never used unless the first one is lost or destroyed. As long as you create the backup drive on the first external drive before cloning it to make a second external drive the incremental backup drive will continue to work with the spare bootable drive.
4) Use the backup utility included with Ubuntu in the traditional method:
Use the backup utility to backup just the data from the internal drive to an ENCRYPTED data-only external drive. You can configure it to make "incremental" backups of any changed files on your internal hard drive to the external, non bootable, SSD.
• I see now that my original answer has lost its chosen status in favor of this one, even though this is not the answer to the original question. I would proposed that the second question should have been posted as a separate question with a pointer to this question, and I could have posted my second answer to the new question. – gyropyge Jan 17 '15 at 21:42
• That probably makes the most sense. – Costa Jan 17 '15 at 21:45
• You are incredibly thorough, sir. Thanks so much! – Costa Jan 17 '15 at 21:45
• 1
I've been building and repairing PCs since the late 1980s. I've built several pcs which entirely depended on external scsi hard drives, external parallel port hard drives, and in recent years, entirely on USB external SSD drives such as I've described in these answers. At first these SSD booted computers contained hard drives which in some cases contained windows, but I began to physically disable those drives out of fear for boot sector viruses. In recent years I've been building driveless desktops at cost (no profit) for my valued friends, and may I add, they are "selling" like hotcakes. – gyropyge Jan 18 '15 at 0:30
• 1
@Costa, it is becoming common, at least among my friends. I've made over 40 clones of a particularly well equipped "mubuntstick" intended for small scale distribution personal friends. You can read a little more about it on my bio page. There is not yet a web page about the project, but you might be able to persuade me to send you a pdf file of the user manual complete with hotlinked index. There is a separate document on each stick which explains how to boot it. A printed is included. When you consider that bootable pen drives are hardly new, and nearly all of my friends have one... – gyropyge Jan 18 '15 at 23:48
Yes you can copy a full Ubuntu OS (with Programs, customizations and all ) from your Desktop or Laptop Hard drive to an external USB Flash Drive or external Hard drive. I just did it for Ubuntu 14.04 LTS to an external Hard drive (but equally applicable to USB Flash drive as well) Required software / hardware:
1 Destination External Hard Drive / Destination USB Flash Drive to have the cloned OS
1 Source OS (Ubuntu or any other OS that needs to be cloned)
1 USB Drive (with at least with as much capacity (256 MB - 1 GB) as a clonezilla live USB requires)
1 computer / laptop having Windows which can run Live Linux USB creator
Steps:
1. Download Clonezilla from http://clonezilla.org/downloads/download.php?branch=stable (download the ISO)
2. Download Live Linux USB Creator (Lili) from http://www.linuxliveusb.com/en/download
3. Create a bootable Clonezilla (Live Clonezilla) on USB by running Live Linux USB Creator.
4. Configure your Source desktop / laptop to boot from a USB drive
5. Insert both, the destination external hard drive or destination USB Flash drive in 1 USB Slot and the Clonezilla Live USB drive in other slot and boot.
6. Clonezilla will take some time to read partition info When the Clonezilla UI appears, select default menu entries.
7. [With Caution] select Source Partition info and Destination partition info It may be noted that Clonezilla would require space on destination USB Flash drive or external hard disk which is equivalent of the source Hard disk and it will erase all data from the destination USB Flash drive / external hard drive.
8. Once all is selected, Clonezilla will create a live OS on the destination drive / flash drive
9. Test the cloned OS by removing Clonezilla Live USB drive and booting from the Live OS which has been cloned onto the destination External drive / USB Flash drive.
Enjoy !
Your Answer
By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://askubuntu.com/questions/572363/can-i-copy-my-ubuntu-os-off-my-hard-drive-to-a-usb-stick-and-boot-from-that-stic",
"source_domain": "askubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2018-39",
"warc_metadata": {
"Content-Length": "175860",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6WLBY3WKJDIE7QELHHBOZX6XB46CX3P5",
"WARC-Concurrent-To": "<urn:uuid:f7a02da6-3965-4726-958a-e539a19eec68>",
"WARC-Date": "2018-09-19T01:50:46Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RWX6YJ6PDNISMRKXETYEQVZTFNZGOSUU",
"WARC-Record-ID": "<urn:uuid:68423134-e0cb-43e5-89ba-850bf838afef>",
"WARC-Target-URI": "https://askubuntu.com/questions/572363/can-i-copy-my-ubuntu-os-off-my-hard-drive-to-a-usb-stick-and-boot-from-that-stic",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:319e4e4d-0441-4e30-b3ee-772e3eb4a466>"
},
"warc_info": "isPartOf: CC-MAIN-2018-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2018\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-101-251-106.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,
216,
217,
322,
323,
485,
486,
492,
901,
1056,
1194,
1815,
1844,
1845,
2028,
2029,
2287,
2288,
2360,
2361,
2684,
2685,
3029,
3030,
3307,
3308,
3767,
3768,
3774,
4117,
4571,
4577,
4918,
4919,
5211,
5212,
5458,
5459,
5519,
5520,
5526,
5712,
5718,
5817,
6126,
6628,
6629,
6759,
6760,
6951,
6952,
7005,
7006,
7068,
7069,
7322,
7323,
7514,
8118,
8411,
8599,
8879,
8880,
9026,
9027,
9038,
9039,
9201,
9202,
9368,
9369,
9422,
9423,
9552,
9553,
10177,
10178,
10258,
10259,
10472,
10473,
10555,
10556,
10825,
10826,
11524,
11525,
11599,
11600,
11849,
11850,
12213,
12281,
12363,
12369,
13000,
13006,
13632,
13633,
13945,
13946,
14032,
14033,
14094,
14095,
14195,
14196,
14268,
14269,
14276,
14277,
14385,
14386,
14475,
14476,
14570,
14571,
14640,
14641,
14798,
14799,
14919,
14920,
15236,
15237,
15336,
15337,
15505,
15506,
15514,
15515,
15527,
15528,
15530,
15531,
15735,
15736
],
"line_end_idx": [
216,
217,
322,
323,
485,
486,
492,
901,
1056,
1194,
1815,
1844,
1845,
2028,
2029,
2287,
2288,
2360,
2361,
2684,
2685,
3029,
3030,
3307,
3308,
3767,
3768,
3774,
4117,
4571,
4577,
4918,
4919,
5211,
5212,
5458,
5459,
5519,
5520,
5526,
5712,
5718,
5817,
6126,
6628,
6629,
6759,
6760,
6951,
6952,
7005,
7006,
7068,
7069,
7322,
7323,
7514,
8118,
8411,
8599,
8879,
8880,
9026,
9027,
9038,
9039,
9201,
9202,
9368,
9369,
9422,
9423,
9552,
9553,
10177,
10178,
10258,
10259,
10472,
10473,
10555,
10556,
10825,
10826,
11524,
11525,
11599,
11600,
11849,
11850,
12213,
12281,
12363,
12369,
13000,
13006,
13632,
13633,
13945,
13946,
14032,
14033,
14094,
14095,
14195,
14196,
14268,
14269,
14276,
14277,
14385,
14386,
14475,
14476,
14570,
14571,
14640,
14641,
14798,
14799,
14919,
14920,
15236,
15237,
15336,
15337,
15505,
15506,
15514,
15515,
15527,
15528,
15530,
15531,
15735,
15736,
15826
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 15826,
"ccnet_original_nlines": 136,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41013026237487793,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04196815937757492,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19797395169734955,
"rps_doc_frac_unique_words": 0.28747794032096863,
"rps_doc_mean_word_length": 4.336860656738281,
"rps_doc_num_sentences": 156,
"rps_doc_symbol_to_word_ratio": 0.0017366099637001753,
"rps_doc_unigram_entropy": 5.790095329284668,
"rps_doc_word_count": 2835,
"rps_doc_frac_chars_dupe_10grams": 0.020984139293432236,
"rps_doc_frac_chars_dupe_5grams": 0.061325740069150925,
"rps_doc_frac_chars_dupe_6grams": 0.061325740069150925,
"rps_doc_frac_chars_dupe_7grams": 0.04221228137612343,
"rps_doc_frac_chars_dupe_8grams": 0.027653520926833153,
"rps_doc_frac_chars_dupe_9grams": 0.020984139293432236,
"rps_doc_frac_chars_top_2gram": 0.006832050159573555,
"rps_doc_frac_chars_top_3gram": 0.008540060371160507,
"rps_doc_frac_chars_top_4gram": 0.010980069637298584,
"rps_doc_books_importance": -1430.6475830078125,
"rps_doc_books_importance_length_correction": -1430.6475830078125,
"rps_doc_openwebtext_importance": -932.5514526367188,
"rps_doc_openwebtext_importance_length_correction": -932.5514526367188,
"rps_doc_wikipedia_importance": -564.040283203125,
"rps_doc_wikipedia_importance_length_correction": -564.040283203125
},
"fasttext": {
"dclm": 0.0506630502641201,
"english": 0.9448613524436951,
"fineweb_edu_approx": 1.2696881294250488,
"eai_general_math": 0.504728376865387,
"eai_open_web_math": 0.29288697242736816,
"eai_web_code": 0.14193344116210938
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,298,169,180,868,135,000
|
Create Flex Application with FlashDevelop
I’ve been having a lot of fun programming Flex and ActionScript applications since I have discovered FlashDevelop. In this article, I will go through the motions to create a simple Flex demo application based on the primordial Hello, World. To get started, download and install FlashDevelop. Once you have FlashDevelop installed and configured with the latest release of the Flex SDK you are all set to create Flex applications.
FlashDevelop is a very good IDE for ActionScript and Flex applications. It is simple to use and familiar if you have used visual Studio. It might be lacking a few features like design view mode, but it does come with really smart code assist out of the box.
To get started create a new Flex 3 Project by clicking New Project from the Project menu.
For our Hello Flex example we are going to add a text field where you can enter your name. Once you enter your name, you press a Generate Greetings button to output a personalized greetings in a label. To help us visualize the task at hand, here is a screenshot of the sample Flex application…
Hello, Flex
To layout out the text field, button, horizontal rule, and label components involved I will use the Grid container. Here is the MXML markup to create the above GUI.
<?xml version="1.0"?>
<mx:Application xmlns:mx="http://www.adobe.com/2006/mxml">
<mx:Grid>
<mx:GridRow >
<mx:GridItem>
<mx:Label text="Name"/>
</mx:GridItem>
<mx:GridItem>
<mx:TextInput id="inputName"/>
</mx:GridItem>
</mx:GridRow>
<mx:GridRow>
<mx:GridItem colSpan="2">
<mx:Button label="Generate Greetings"/>
</mx:GridItem>
</mx:GridRow>
<mx:GridRow>
<mx:GridItem colSpan="2">
<mx:HRule width="200" />
</mx:GridItem>
</mx:GridRow>
<mx:GridRow>
<mx:GridItem colSpan="2">
<mx:Label id="labelGreeting" />
</mx:GridItem>
</mx:GridRow>
</mx:Grid>
</mx:Application>
The above MXML code will generate the GUI but at this point there will be no action taken when the Generate Greetings button is clicked. We first need to create a function that will execute when the button is pressed. Add the following ActionScript snippet right below the Application tag.
<mx:Script>
<![CDATA[
public function generateGreetings():void {
labelGreeting.text = "Hello, " + inputName.text + "!";
}
]]>
</mx:Script>
Notice that label identified as labelGreetings and the text input identified as inputName are referenced in the ActionScript code. Next, to get everything working we need to add the click event listner to the button. Modify the button to the following.
<mx:Button label="Generate Greetings" click="generateGreetings()" />
Hit F5 to build the project and execute, or open in your favorite browser, the index.html file under the bin.
Technorati Tags: , , , ,
2 Responses to “Create Flex Application with FlashDevelop”
• Mark DeLoura Says:
Thanks for this! Want to let you know I had to pull the Script block to just before the to get this to compile though. Then it works great, thanks!
• Firos Says:
Thank buddy
It was helped me for a fresh start with Flex. I hope we can also write the script part in another file and include in the mxml.
Leave a Reply
|
{
"url": "http://juixe.com/techknow/index.php/2008/10/30/create-flex-application-with-flashdevelop/",
"source_domain": "juixe.com",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "30872",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZHHOOFIG3SM7TQ4TQBR47D35SQPLFR2O",
"WARC-Concurrent-To": "<urn:uuid:08453760-c8e0-4de2-b30e-752f4305ab58>",
"WARC-Date": "2020-05-31T19:14:56Z",
"WARC-IP-Address": "208.113.174.61",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:B4FWBHIBASTMNNRQPEEEVCJH4R4FYDX4",
"WARC-Record-ID": "<urn:uuid:43d016d0-eb34-4364-a628-4e84207bfacd>",
"WARC-Target-URI": "http://juixe.com/techknow/index.php/2008/10/30/create-flex-application-with-flashdevelop/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1579a797-86b5-4c88-bc7e-3486333efd39>"
},
"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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-5.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,
42,
43,
472,
473,
731,
732,
822,
823,
1117,
1118,
1130,
1131,
1296,
1297,
1319,
1378,
1390,
1408,
1428,
1460,
1481,
1501,
1540,
1561,
1579,
1596,
1628,
1676,
1697,
1715,
1732,
1764,
1797,
1818,
1836,
1853,
1885,
1925,
1946,
1964,
1977,
1995,
1996,
2286,
2287,
2299,
2311,
2358,
2419,
2425,
2431,
2444,
2445,
2698,
2699,
2768,
2769,
2879,
2880,
2905,
2906,
2907,
2966,
2967,
2990,
2991,
3143,
3144,
3160,
3161,
3177,
3309,
3310
],
"line_end_idx": [
42,
43,
472,
473,
731,
732,
822,
823,
1117,
1118,
1130,
1131,
1296,
1297,
1319,
1378,
1390,
1408,
1428,
1460,
1481,
1501,
1540,
1561,
1579,
1596,
1628,
1676,
1697,
1715,
1732,
1764,
1797,
1818,
1836,
1853,
1885,
1925,
1946,
1964,
1977,
1995,
1996,
2286,
2287,
2299,
2311,
2358,
2419,
2425,
2431,
2444,
2445,
2698,
2699,
2768,
2769,
2879,
2880,
2905,
2906,
2907,
2966,
2967,
2990,
2991,
3143,
3144,
3160,
3161,
3177,
3309,
3310,
3323
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3323,
"ccnet_original_nlines": 73,
"rps_doc_curly_bracket": 0.0006018700078129768,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2867332398891449,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019971469417214394,
"rps_doc_frac_lines_end_with_ellipsis": 0.01351351011544466,
"rps_doc_frac_no_alph_words": 0.2724679112434387,
"rps_doc_frac_unique_words": 0.5032119750976562,
"rps_doc_mean_word_length": 5.186295509338379,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.001426529954187572,
"rps_doc_unigram_entropy": 4.997198581695557,
"rps_doc_word_count": 467,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05697770044207573,
"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.013212219811975956,
"rps_doc_frac_chars_top_3gram": 0.034682080149650574,
"rps_doc_frac_chars_top_4gram": 0.04706854000687599,
"rps_doc_books_importance": -313.4192810058594,
"rps_doc_books_importance_length_correction": -313.4192810058594,
"rps_doc_openwebtext_importance": -194.60061645507812,
"rps_doc_openwebtext_importance_length_correction": -194.60061645507812,
"rps_doc_wikipedia_importance": -167.79840087890625,
"rps_doc_wikipedia_importance_length_correction": -167.79840087890625
},
"fasttext": {
"dclm": 0.0725630521774292,
"english": 0.8098624348640442,
"fineweb_edu_approx": 1.529293417930603,
"eai_general_math": 0.35472655296325684,
"eai_open_web_math": 0.23211711645126343,
"eai_web_code": 0.03057331033051014
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,280,667,169,811,237,000
|
8.3. Use built-in functional interfaces including Predicate, Consumer, Function, and Supplier
[Note]
Develop code that uses the Function interface
A java.util.function.Function is a Java 8 functional interface whose sole purpose is to return any result by working on a single input argument. It accepts an argument of type T and returns a result of type R, by applying specified logic on the input via the apply method. The interface definition shown here:
package java.util.function;
@FunctionalInterface
public interface Function<T extends Object, R extends Object> {
public R apply(T t);
...
}
A Function interface is used in cases when you want to encapsulate some code into a method which accepts some value as an input parameter and then returns another value after performing required operations on the input. The input parameter type and the return type of the method can either be same or different:
Function<String, Boolean> f = s -> new Boolean(s);
System.out.println(f.apply("TRUE"));
System.out.println(f.apply("true"));
System.out.println(f.apply("Java8"));
System.out.println(f.apply(null));
Output:
true
true
false
false
Develop code that uses the Consumer interface
The java.util.function.Consumer<T> interface defines an abstract method named accept that takes an object of generic type T and returns no result (void):
package java.util.function;
@FunctionalInterface
public interface Consumer<T extends Object> {
public void accept(T t);
...
}
You might use this interface when you need to access an object of type T and perform some operations on it. For example, you can use it to create a method processList, which takes a list of objects and applies an operation on each element of that list. In the following listing you use this processList method combined with a lambda to print all the elements of the list:
public class ConsumerDemo<T extends Object> {
public void processList(List<T> list, Consumer<T> cons) {
for(T s : list) {
cons.accept(s);
}
}
public static void main(String[] args) {
List<String> l = Arrays.asList(new String[] {"Java", "8", "is", "great", "!"});
Consumer<String> c = s -> System.out.print(String.format("%s ", s));
new ConsumerDemo<String>().processList(l, c);
}
}
output is:
Java 8 is great !
Develop code that uses the Supplier interface
The java.util.function.Supplier<T> is a functional interface in Java 8, with one abstract method named T get() that returns an instance of T. In other words, this is a factory that keeps on giving without expecting anything as input.
package java.util.function;
@FunctionalInterface
public interface Supplier<T extends Object> {
public T get();
}
In the most basic form a Supplier will return an instance. For example, we could implement Supplier<Book> to return an instance of Book, like so:
public class Book {
String title;
String author;
public Book(String t, String a) {
title = t;
author = a;
}
public String toString() {
return title + " by " + author;
}
}
...
...
Supplier<Book> s1 = () -> new Book("Upgrade to Java 8 Guide", "Mikalai Zaikin");
Supplier<Book> s2 = () -> { return new Book("Upgrade to Java 11 Guide", "Mikalai Zaikin"); };
System.out.println(s1.get());
System.out.println(s2.get());
output:
Upgrade to Java 8 Guide by Mikalai Zaikin
Upgrade to Java 11 Guide by Mikalai Zaikin
Alternatively, we could use a constructor reference (T::new) instead of the traditional (new T()) syntax to instantiate an instance. A constructor reference is much like a method reference, except it is a reference to a constructor instead of a method. We can use a constructor reference anywhere a lambda expression does nothing more than instantiate an instance. The only limitation with Supplier that constructor must take no arguments. For example:
public class Book {
String title;
String author;
public Book() {
title = "Default title";
author = "Default author";
}
public String toString() {
return title + " by " + author;
}
}
...
...
Supplier<Book> s1 = Book::new;
System.out.println(s1.get());
output:
Default title by Default author
Develop code that uses the UnaryOperator interface
The java.util.function.UnaryOperator is a Java 8 functional interface that extends java.util.function.Function:
package java.util.function;
@FunctionalInterface
public interface UnaryOperator<T extends Object> extends Function<T, T> {
...
}
The UnaryOperator is used to work on a single operand and it returns the same type as an operand. UnaryOperator can be used as lambda expression to pass as an argument. While defining UnaryOperator, we need to define T apply(T t) method inherited from java.util.function.Function.
UnaryOperator<String> uo = s -> s + " is great !";
System.out.print(uo.apply("Java 11"));
output:
Java 11 is great !
Develop code that uses the Predicate interface
The java.util.function.Predicate<T> interface defines an abstract method named test(T t) that accepts an object of generic type T and returns a boolean primitive.
package java.util.function;
@FunctionalInterface
public interface Predicate<T extends Object> {
public boolean test(T t);
...
}
You might want to use this interface when you need to represent a boolean expression that uses an object of type T. For example, you can define a lambda that accepts String objects, as shown in the following listing:
Predicate<String> longString = s -> s.length() > 5;
// Will print true
System.out.print(longString.test("Hi there !"));
Predicates may also be passed into functions:
Predicate<String> longString = s -> s.length() > 5;
validateString("Hello again !", longString);
...
...
void validateString(String s, Predicate<String> p) {
if (p.test(s)) {
System.out.print("Test passed !");
}
}
Professional hosting Exam 1Z0-817: Upgrade OCP Java 6, 7 & 8 to Java SE 11 Developer Quiz Exam 1Z0-810: Upgrade to Java SE 8 Programmer Quiz
|
{
"url": "http://javaboot45.7rw.ru/ocpjd11-upgrade-guide/ch08s03.html",
"source_domain": "javaboot45.7rw.ru",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "13719",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BRTZ4RZPFBRZAMP3RHLK4VO5SDW2DL43",
"WARC-Concurrent-To": "<urn:uuid:ceabae27-a813-49e3-a6ac-5a31d1808183>",
"WARC-Date": "2019-11-15T18:15:22Z",
"WARC-IP-Address": "74.119.192.160",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RHU6GFOYM4ZEXYR4ORAPNTZPSCEPHG2T",
"WARC-Record-ID": "<urn:uuid:eff9dddb-1e24-4f1a-8bd4-b05e5be7f095>",
"WARC-Target-URI": "http://javaboot45.7rw.ru/ocpjd11-upgrade-guide/ch08s03.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e24259f-3adc-42f8-8def-a65ce7c7891f>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-211.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,
95,
96,
103,
104,
150,
151,
461,
462,
463,
491,
492,
513,
577,
578,
603,
604,
612,
613,
615,
616,
622,
623,
935,
936,
937,
988,
989,
1026,
1063,
1101,
1136,
1137,
1143,
1144,
1152,
1153,
1158,
1163,
1169,
1175,
1181,
1182,
1228,
1229,
1383,
1384,
1385,
1413,
1414,
1435,
1481,
1482,
1511,
1512,
1520,
1522,
1523,
1529,
1530,
1902,
1903,
1904,
1950,
1951,
2013,
2039,
2067,
2077,
2083,
2084,
2129,
2217,
2294,
2348,
2354,
2356,
2357,
2363,
2364,
2375,
2376,
2394,
2400,
2401,
2447,
2448,
2682,
2683,
2684,
2712,
2713,
2734,
2780,
2781,
2801,
2802,
2804,
2810,
2811,
2957,
2958,
2959,
2979,
2997,
3016,
3017,
3055,
3074,
3094,
3100,
3101,
3132,
3172,
3178,
3180,
3181,
3185,
3189,
3270,
3364,
3365,
3395,
3425,
3426,
3432,
3433,
3441,
3442,
3484,
3527,
3533,
3534,
3987,
3988,
3989,
4009,
4027,
4046,
4047,
4067,
4100,
4135,
4141,
4142,
4173,
4213,
4219,
4221,
4225,
4229,
4260,
4290,
4291,
4297,
4298,
4306,
4307,
4339,
4345,
4346,
4397,
4398,
4510,
4511,
4512,
4540,
4541,
4562,
4636,
4637,
4645,
4646,
4648,
4649,
4655,
4656,
4937,
4938,
4939,
4990,
5029,
5030,
5036,
5037,
5045,
5046,
5065,
5071,
5072,
5119,
5120,
5283,
5284,
5285,
5313,
5314,
5335,
5382,
5383,
5413,
5414,
5422,
5423,
5425,
5426,
5432,
5433,
5650,
5651,
5652,
5704,
5705,
5724,
5773,
5774,
5780,
5781,
5827,
5828,
5829,
5881,
5926,
5930,
5934,
5987,
6008,
6051,
6057,
6059,
6060,
6066,
6067
],
"line_end_idx": [
95,
96,
103,
104,
150,
151,
461,
462,
463,
491,
492,
513,
577,
578,
603,
604,
612,
613,
615,
616,
622,
623,
935,
936,
937,
988,
989,
1026,
1063,
1101,
1136,
1137,
1143,
1144,
1152,
1153,
1158,
1163,
1169,
1175,
1181,
1182,
1228,
1229,
1383,
1384,
1385,
1413,
1414,
1435,
1481,
1482,
1511,
1512,
1520,
1522,
1523,
1529,
1530,
1902,
1903,
1904,
1950,
1951,
2013,
2039,
2067,
2077,
2083,
2084,
2129,
2217,
2294,
2348,
2354,
2356,
2357,
2363,
2364,
2375,
2376,
2394,
2400,
2401,
2447,
2448,
2682,
2683,
2684,
2712,
2713,
2734,
2780,
2781,
2801,
2802,
2804,
2810,
2811,
2957,
2958,
2959,
2979,
2997,
3016,
3017,
3055,
3074,
3094,
3100,
3101,
3132,
3172,
3178,
3180,
3181,
3185,
3189,
3270,
3364,
3365,
3395,
3425,
3426,
3432,
3433,
3441,
3442,
3484,
3527,
3533,
3534,
3987,
3988,
3989,
4009,
4027,
4046,
4047,
4067,
4100,
4135,
4141,
4142,
4173,
4213,
4219,
4221,
4225,
4229,
4260,
4290,
4291,
4297,
4298,
4306,
4307,
4339,
4345,
4346,
4397,
4398,
4510,
4511,
4512,
4540,
4541,
4562,
4636,
4637,
4645,
4646,
4648,
4649,
4655,
4656,
4937,
4938,
4939,
4990,
5029,
5030,
5036,
5037,
5045,
5046,
5065,
5071,
5072,
5119,
5120,
5283,
5284,
5285,
5313,
5314,
5335,
5382,
5383,
5413,
5414,
5422,
5423,
5425,
5426,
5432,
5433,
5650,
5651,
5652,
5704,
5705,
5724,
5773,
5774,
5780,
5781,
5827,
5828,
5829,
5881,
5926,
5930,
5934,
5987,
6008,
6051,
6057,
6059,
6060,
6066,
6067,
6219
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6219,
"ccnet_original_nlines": 232,
"rps_doc_curly_bracket": 0.006110310088843107,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24884793162345886,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.032258059829473495,
"rps_doc_frac_lines_end_with_ellipsis": 0.04291845113039017,
"rps_doc_frac_no_alph_words": 0.31336405873298645,
"rps_doc_frac_unique_words": 0.3329065442085266,
"rps_doc_mean_word_length": 5.660691261291504,
"rps_doc_num_sentences": 103,
"rps_doc_symbol_to_word_ratio": 0.007680490147322416,
"rps_doc_unigram_entropy": 5.060299396514893,
"rps_doc_word_count": 781,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.21895499527454376,
"rps_doc_frac_chars_dupe_6grams": 0.11354897171258926,
"rps_doc_frac_chars_dupe_7grams": 0.08459624648094177,
"rps_doc_frac_chars_dupe_8grams": 0.0583578385412693,
"rps_doc_frac_chars_dupe_9grams": 0.023976480588316917,
"rps_doc_frac_chars_top_2gram": 0.007916759699583054,
"rps_doc_frac_chars_top_3gram": 0.016964489594101906,
"rps_doc_frac_chars_top_4gram": 0.02148834988474846,
"rps_doc_books_importance": -490.8064270019531,
"rps_doc_books_importance_length_correction": -490.8064270019531,
"rps_doc_openwebtext_importance": -240.5127410888672,
"rps_doc_openwebtext_importance_length_correction": -240.5127410888672,
"rps_doc_wikipedia_importance": -198.38363647460938,
"rps_doc_wikipedia_importance_length_correction": -198.38363647460938
},
"fasttext": {
"dclm": 0.5999559164047241,
"english": 0.6909548044204712,
"fineweb_edu_approx": 2.9109115600585938,
"eai_general_math": 0.84818035364151,
"eai_open_web_math": 0.05018753185868263,
"eai_web_code": 0.9736500382423401
}
}
|
{
"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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,905,999,902,238,725,000
|
Evernote. Your New Favorite App.
When was the last time you fell in love with an application? Yes, you read that right. Think of all the apps you have on your smartphone. Which app do you use on a consistent basis? I touch Evernote daily to keep track of all things business and personal in one place.
EvernoteWhat makes Evernote so special?
The application is free to download for the desktop, tablets, and smartphones. There is a paid version that is $4.99 a month for $45 a year. I have been on the free version for over a year. The application runs off its own server so there is not a biased toward Android or Apple. It syncs to all your devices that have the app, which keeps everyone updated at once.
Think of all the mental and actual notes you take throughout your day. Where do they go? Do you keep track of them? Set reminders to tackle assignments or followups?
The features of Evernote make life simple.
Evernote has “Notebooks” to take notes in. You can make a notebook for pretty much e-v-e-r-y-t-h-i-n-g. I have a notebook for each of my clients, personal business notes, blog ideas, fitness ideas, food prep meals and recipes, and so much more! Each note can include text, images, documents in PDF or word .doc formats to keep it all organized. The beautiful thing each note can be e-mailed within seconds.
How does this help people besides me?
Evernote has a Evernote Business version for in-depth collaboration for a paid account. One of my clients requests a mileage report from me every month. I create a note that includes a spreadsheet in my clients “notebook”. I update it and can e-mail it to my client to view the document, which is good. Or I can “share” or “publish” the same note with my client and we can work on it together, which is great. Working on the same note allows us to provide instant feedback to one another in one spot instead of filtering through e-mail. Brilliant.
Evernote Collaboration
Evernote Collaboration
Anything else?
There is a ton more paid features Evernote offers in the Evernote Market. The other free apps Everynote has syncs with the main Evernote app keeping all your extensions together in one place. What other free apps? Evernote Hello helps you organize who you meet and their business card. Evernote Skitch helps you sketch on documents and send them to whomever needs it. Evernote Food is a collection of foodie pictures we all know we take and want to remember later. And I recently downloaded Evernote Web Clipper and Evernote Clearly for the desktop. I am excited to start using these tools.
Download the green app that looks like an elephant and tell me what you think. Honestly! Tell me if you hate it or love it.
What is an app you love and why?
If you LIKE my business page on Facebook, you will see a common thing happening on Fridays I call a “Friday Focus”. The topic varies by what you suggest or what comes to mind. My goal is to help YOU, the reader, to take away something valuable than you may not have considered before. If you want to contribute to an upcoming Friday Focus, please leave me a comment and we can make it happen.
Advertisements
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 )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Connecting to %s
|
{
"url": "https://rachalhasthefloor.wordpress.com/2014/10/17/evernote-your-new-favorite-app/",
"source_domain": "rachalhasthefloor.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "80526",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CVUI3YIN6CETD5HJPYMFKKSYX2BMXRMP",
"WARC-Concurrent-To": "<urn:uuid:3e19d459-3f61-409b-879c-a7ebe01f64c6>",
"WARC-Date": "2017-06-22T16:34:42Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5JHGS36UA3UNQ3UEYRU5UJAHBOZZ6LLZ",
"WARC-Record-ID": "<urn:uuid:7ed2b1ff-ad93-4223-96b0-0684e28ebe1f>",
"WARC-Target-URI": "https://rachalhasthefloor.wordpress.com/2014/10/17/evernote-your-new-favorite-app/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2cbff173-c493-4690-9146-dccca75c47bf>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-166-47-236.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,
33,
34,
303,
304,
344,
345,
711,
712,
878,
879,
922,
923,
1330,
1331,
1369,
1370,
1918,
1919,
1942,
1943,
1966,
1967,
1982,
1983,
2574,
2575,
2699,
2700,
2734,
2735,
3128,
3129,
3144,
3145,
3159,
3160,
3215,
3216,
3235,
3236,
3308,
3309,
3325,
3326,
3392,
3393,
3408,
3409,
3476,
3477,
3491,
3492,
3558,
3559
],
"line_end_idx": [
33,
34,
303,
304,
344,
345,
711,
712,
878,
879,
922,
923,
1330,
1331,
1369,
1370,
1918,
1919,
1942,
1943,
1966,
1967,
1982,
1983,
2574,
2575,
2699,
2700,
2734,
2735,
3128,
3129,
3144,
3145,
3159,
3160,
3215,
3216,
3235,
3236,
3308,
3309,
3325,
3326,
3392,
3393,
3408,
3409,
3476,
3477,
3491,
3492,
3558,
3559,
3575
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3575,
"ccnet_original_nlines": 54,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.434087872505188,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015978699550032616,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14780293405056,
"rps_doc_frac_unique_words": 0.45454543828964233,
"rps_doc_mean_word_length": 4.486443519592285,
"rps_doc_num_sentences": 57,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.152512073516846,
"rps_doc_word_count": 627,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0391041599214077,
"rps_doc_frac_chars_dupe_6grams": 0.021329540759325027,
"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.00853182002902031,
"rps_doc_frac_chars_top_3gram": 0.02275151014328003,
"rps_doc_frac_chars_top_4gram": 0.029861360788345337,
"rps_doc_books_importance": -231.3827362060547,
"rps_doc_books_importance_length_correction": -231.3827362060547,
"rps_doc_openwebtext_importance": -173.9381866455078,
"rps_doc_openwebtext_importance_length_correction": -173.9381866455078,
"rps_doc_wikipedia_importance": -109.49200439453125,
"rps_doc_wikipedia_importance_length_correction": -109.49200439453125
},
"fasttext": {
"dclm": 0.0433804988861084,
"english": 0.9272257685661316,
"fineweb_edu_approx": 1.3415776491165161,
"eai_general_math": 0.00003647999983513728,
"eai_open_web_math": 0.021645670756697655,
"eai_web_code": -0.000006199999916134402
}
}
|
{
"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": "658.401",
"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": "6",
"label": "Promotional/Advertisement"
},
"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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
587,436,293,975,229,700
|
Step 1: Create a Virtual Product
In this step, you create an Alexa Connect Kit (ACK) virtual product in the ACK developer console. You can have only one virtual product, and you can't delete virtual products. If you would like to work with multiple virtual products simultaneously, create an additional Amazon developer account.
For more details about virtual products, see Understand Virtual Products.
Prerequisites
To access the ACK developer console, you must register for an Amazon developer account.
Create a new virtual product
To create a new virtual product
1. Sign-in to the ACK developer console.
2. Click Products.
3. Click Create Product.
4. Enter your Product name.
5. In Description, enter the appropriate information for your product.
Include your brand name, model name, product name, and model of device. For example, Amazon Smart Plug V2. This information is displayed in the Alexa app.
6. Enter your Manufacturer name.
7. For Display Category, select the appropriate product you're developing.
To complete this tutorial end-to-end exactly as-is, select LIGHT.
8. For Region support, select the region you're releasing your product in – Region 1 (BR, CA, MX, US), Region 2 (DE, ES, FR, IN, IT, UK), or Region 3 (AU, JP).
You can also add another supported region after you create your virtual product.
9. For Do you intend to distribute this product commercially, select the appropriate choice for your product.
10. For Is this a children's product or is otherwise directed to children younger than 13 years old?, select the appropriate choice for your product.
11. Click Create Product.
While your product is creates, a banner appears on the products page. To determine if your virtual product is ready for use, manually refresh the page.
When your virtual product is ready, a Success message appears in the banner.
Was this page helpful?
Last updated: Nov 27, 2023
|
{
"url": "https://www.developer.amazon.com/de-DE/docs/alexa/ack/create-virtual-product.html",
"source_domain": "www.developer.amazon.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "89486",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Q2MLYM4EDNLHLOANOKCLGPUOIUW4D5BE",
"WARC-Concurrent-To": "<urn:uuid:97b0f51b-505d-4aff-9fc8-50ca13b20a8a>",
"WARC-Date": "2024-04-12T18:39:38Z",
"WARC-IP-Address": "44.215.136.95",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Q5UIDYX2G5JEXGRAYFFBDK7WQLHRILVF",
"WARC-Record-ID": "<urn:uuid:5390f23d-a3e6-423e-b09a-0d15a60b44e3>",
"WARC-Target-URI": "https://www.developer.amazon.com/de-DE/docs/alexa/ack/create-virtual-product.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a9fd8f82-8ba2-4df1-a77d-a3baa02fbea0>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-116\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,
33,
34,
35,
331,
332,
406,
407,
421,
422,
510,
511,
540,
541,
573,
574,
617,
638,
639,
666,
696,
769,
770,
929,
930,
965,
1042,
1043,
1113,
1114,
1276,
1277,
1362,
1363,
1475,
1627,
1655,
1656,
1808,
1809,
1886,
1887,
1888,
1911,
1912
],
"line_end_idx": [
33,
34,
35,
331,
332,
406,
407,
421,
422,
510,
511,
540,
541,
573,
574,
617,
638,
639,
666,
696,
769,
770,
929,
930,
965,
1042,
1043,
1113,
1114,
1276,
1277,
1362,
1363,
1475,
1627,
1655,
1656,
1808,
1809,
1886,
1887,
1888,
1911,
1912,
1938
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1938,
"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.280303031206131,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04545455053448677,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2525252401828766,
"rps_doc_frac_unique_words": 0.47231268882751465,
"rps_doc_mean_word_length": 4.863192081451416,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.5168914794921875,
"rps_doc_word_count": 307,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1527126580476761,
"rps_doc_frac_chars_dupe_6grams": 0.05358339101076126,
"rps_doc_frac_chars_dupe_7grams": 0.05358339101076126,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.07501673698425293,
"rps_doc_frac_chars_top_3gram": 0.03014066070318222,
"rps_doc_frac_chars_top_4gram": 0.044206298887729645,
"rps_doc_books_importance": -185.6591796875,
"rps_doc_books_importance_length_correction": -185.6591796875,
"rps_doc_openwebtext_importance": -97.56634521484375,
"rps_doc_openwebtext_importance_length_correction": -97.56634521484375,
"rps_doc_wikipedia_importance": -52.132022857666016,
"rps_doc_wikipedia_importance_length_correction": -52.132022857666016
},
"fasttext": {
"dclm": 0.14089477062225342,
"english": 0.8551802635192871,
"fineweb_edu_approx": 1.056577205657959,
"eai_general_math": 0.005222320090979338,
"eai_open_web_math": 0.02939217910170555,
"eai_web_code": 0.025965450331568718
}
}
|
{
"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": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,991,592,550,049,587,000
|
preg_place非字母，保留单个空格
本教程将介绍preg_place非字母，保留单个空格的处理方法，这篇教程是从别的地方看到的，然后加了一些国外程序员的疑问与解答，希望能对你有所帮助，好了，下面开始学习吧。
preg_place非字母，保留单个空格 教程 第1张
问题描述
正如标题所示，我正在尝试替换所有非字母字符，并将所有双(或更多)空格替换为单个空格。我就是绕不开空格的东西。
到目前为止我的preg_replace行：
$result = trim( preg_replace( '/s+/', '', strip_tags( $data->parent_label ) ) );
这是我想出来的：
/**
* Removes all non alpha chars from a menu item label
* Replaces double and more spaces into a single whitespace
*
* @since 0.1
* @param (string) $item
* @return (string) $item
*/
public function cleanup_item( $item )
{
// Regex patterns for preg_replace()
$search = [
'@<script[^>]*?>.*?</script>@si', // Strip out javascript
'@<style[^>]*?>.*?</style>@siU', // Strip style tags properly
'@<[/!]*?[^<>]*?>@si', // Strip out HTML tags
'@<![sS]*?–[
]*>@', // Strip multi-line comments including CDATA
'/s{2,}/',
'/(s){2,}/',
];
$pattern = [
'#[^a-zA-Z ]#', // Non alpha characters
'/s+/', // More than one whitespace
];
$replace = [
'',
' ',
];
$item = preg_replace( $search, '', html_entity_decode( $item ) );
$item = trim( preg_replace( $pattern, $replace, strip_tags( $item ) ) );
return $item;
}
可能最后的strip_tags()不是必需的。只是为了确保它在那里。
推荐答案
$patterns = array (
'/W+/', // match any non-alpha-numeric character sequence, except underscores
'/d+/', // match any number of decimal digits
'/_+/', // match any number of underscores
'/s+/' // match any number of white spaces
);
$replaces = array (
'', // remove
'', // remove
'', // remove
' ' // leave only 1 space
);
$result = trim(preg_replace($patterns, $replaces, strip_tags( $data->parent_label ) ) );
.应该做您想做的一切
好了关于preg_place非字母，保留单个空格的教程就到这里就结束了，希望趣模板源码网找到的这篇技术文章能帮助到大家，更多技术教程可以在站内搜索。
|
{
"url": "https://www.qumuban.com/57918.html",
"source_domain": "www.qumuban.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "76897",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M4JK5Q26EWWIYSDFEBNSQDA54QDAKEHD",
"WARC-Concurrent-To": "<urn:uuid:2b87ad8c-169d-45bc-a99d-f810135d6277>",
"WARC-Date": "2023-02-02T09:26:08Z",
"WARC-IP-Address": "39.98.53.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:O5WVLUGFOOX4MNUTTQPXH4UEIIFWTWAJ",
"WARC-Record-ID": "<urn:uuid:3331d3c6-c501-4d63-be56-8143f82ee01c>",
"WARC-Target-URI": "https://www.qumuban.com/57918.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c6e1c6e6-9b53-4287-a942-daa40c80722a>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-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,
21,
22,
108,
109,
137,
138,
143,
144,
199,
200,
222,
223,
304,
305,
306,
315,
316,
320,
374,
434,
438,
452,
477,
503,
507,
545,
547,
585,
598,
659,
725,
773,
790,
842,
855,
870,
874,
888,
930,
969,
973,
987,
993,
1000,
1004,
1071,
1145,
1146,
1161,
1163,
1164,
1199,
1200,
1205,
1206,
1226,
1306,
1354,
1400,
1446,
1449,
1450,
1470,
1486,
1502,
1518,
1546,
1549,
1550,
1639,
1640,
1651,
1652
],
"line_end_idx": [
21,
22,
108,
109,
137,
138,
143,
144,
199,
200,
222,
223,
304,
305,
306,
315,
316,
320,
374,
434,
438,
452,
477,
503,
507,
545,
547,
585,
598,
659,
725,
773,
790,
842,
855,
870,
874,
888,
930,
969,
973,
987,
993,
1000,
1004,
1071,
1145,
1146,
1161,
1163,
1164,
1199,
1200,
1205,
1206,
1226,
1306,
1354,
1400,
1446,
1449,
1450,
1470,
1486,
1502,
1518,
1546,
1549,
1550,
1639,
1640,
1651,
1652,
1726
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1726,
"ccnet_original_nlines": 73,
"rps_doc_curly_bracket": 0.003476249985396862,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08611111342906952,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01111111044883728,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5861111283302307,
"rps_doc_frac_unique_words": 0.634482741355896,
"rps_doc_mean_word_length": 7.648275852203369,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0.005555559881031513,
"rps_doc_unigram_entropy": 4.350230693817139,
"rps_doc_word_count": 145,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.028854820877313614,
"rps_doc_frac_chars_top_3gram": 0.037871960550546646,
"rps_doc_frac_chars_top_4gram": 0.04328224062919617,
"rps_doc_books_importance": -149.87252807617188,
"rps_doc_books_importance_length_correction": -139.1981201171875,
"rps_doc_openwebtext_importance": -106.40242004394531,
"rps_doc_openwebtext_importance_length_correction": -106.40242004394531,
"rps_doc_wikipedia_importance": -83.25060272216797,
"rps_doc_wikipedia_importance_length_correction": -76.16473388671875
},
"fasttext": {
"dclm": 0.5306016206741333,
"english": 0.07155854254961014,
"fineweb_edu_approx": 1.0507824420928955,
"eai_general_math": 0.4009702801704407,
"eai_open_web_math": 0.08823441714048386,
"eai_web_code": 0.9082184433937073
}
}
|
{
"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": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
519,980,434,478,603,300
|
Securing Higher Grades Costing Your Pocket? Book Your Assignment at The Lowest Price Now!
Declaring and Manipulating Data into Arrays
Arrays
Lab 9.1 Declaring and Manipulating Data into Arrays
Question
Answer
(Circle the correct answer)
1. How many components are contained in the following array declarations?
double values [14];
a. 14
b. 15
2. Write a for loop that sums the numbers in an array with 5 components.
int sum = 0
for( int i=0; i<5; i++)
sum+=array[i];
3. An array _________________.
a. is a simple data type
b. is a structured data type
4. Simple data types are building blocks for arrays.
yes
5. An array index starts at 1.
no
6. In C++, array is a reserved word.
no
7. The following code allows the size of an array to be determined at execution:
int n;
cout << “Enter the size of the array: “;
cin >> n;
int array[n];
yes
Declaring and Manipulating Data into Arrays
Lab 9.2 Checking Index Bounds and Initializing Arrays
Question
Answer
(Circle the correct answer)
1. How many components are contained in the following array declarations?
double values [14];
a. 14
b. 15
1. The following statements assign 5 to the last value in the array.
int array [10];
array [10] = 5;
No,
Array[9]=5;
1. Given:
int array[5] = { 1, 2, 3};
What are the values of each array component?
{1,2,3,0,0}
4. The following code initializes each component to 0:
int array[3];
array[3] = {0};
No
5. The following code initializes each component to 0:
int array[3] = {0};
yes
6. The following code correctly initializes each component to 0:
int array[3];
for (int count = 0; count <= 3; count++)
array[count] = 0;
It does initializes each component too but because the array maximum index is 2
7. The following code initializes each component to 0:
int array[3];
for (int count = 1; count <= 3; count++)
array[count] = 0;
No, _IndexOutOf BoundException
Lab 9.3 Passing Arrays as Parameters to Functions
Question
Answer
(Circle the correct answer)
1. Given the prototype:
void function(int array[5]);
The formal parameter is an array of 5 elements.
T
1. When passing an array to a function, the size of the array is automatically passed.
F
3. Given the declaration:
int array[5];
and the prototype:
void function(int []);
Which code calls a function with array as the argument?
a. function (array);
b. function (array[]);
c. function (array[5]);
4. Which prototype for a function reads in an integer array and returns the array to the calling function?
a. int function();
b. int[] function();
c. void function(int array[]);
d. void function(int &array[]);
Want latest solution of this assignment
Submit Your Assignment Here
AssignmentHippo Features
On Time Delivery
Our motto is deliver assignment on Time. Our Expert writers deliver quality assignments to the students.
Plagiarism Free Work
Get reliable and unique assignments by using our 100% plagiarism-free.
24 X 7 Live Help
Get connected 24*7 with our Live Chat support executives to receive instant solutions for your assignment.
Services For All Subjects
Get Help with all the subjects like: Programming, Accounting, Finance, Engineering, Law and Marketing.
Best Price Guarantee
Get premium service at a pocket-friendly rate at AssignmentHippo
FREE RESOURCES
• Assignment Writing Guide
• Essay Writing Guide
• Dissertation Writing Guide
• Research Paper Writing Guide
FREE SAMPLE FILE
• Accounts
• Computer Science
• Economics
• Engineering
Client Review
I was struggling so hard to complete my marketing assignment on brand development when I decided to finally reach to the experts of this portal. They certainly deliver perfect consistency and the desired format. The content prepared by the experts of this platform was simply amazing. I definitely owe my grades to them.
Tap to Chat
Get instant assignment help
|
{
"url": "https://assignmenthippo.com/sample-assignment/declaring-and-manipulating-data-into-arrays",
"source_domain": "assignmenthippo.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "30570",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AUIHD7KNM2BTF7SWP3F3WIFZ2OP4YQSO",
"WARC-Concurrent-To": "<urn:uuid:93082176-6445-4f7a-95a6-078291a84fe3>",
"WARC-Date": "2021-08-02T13:38:07Z",
"WARC-IP-Address": "107.180.50.162",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PCWHWORKEWUE53JJBCSF3BDMJXFZULYC",
"WARC-Record-ID": "<urn:uuid:d64e5be6-256a-4e3b-aab8-86ceab5b2c3d>",
"WARC-Target-URI": "https://assignmenthippo.com/sample-assignment/declaring-and-manipulating-data-into-arrays",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a6772be9-9d86-497c-b04c-d7f8e7df32f8>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-104.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,
90,
91,
92,
93,
94,
95,
96,
97,
141,
142,
149,
150,
202,
203,
212,
213,
220,
248,
249,
323,
324,
344,
345,
351,
352,
358,
359,
432,
433,
445,
446,
470,
471,
486,
487,
518,
519,
544,
545,
574,
575,
628,
629,
633,
634,
665,
666,
669,
670,
707,
708,
711,
712,
793,
794,
801,
802,
843,
844,
854,
855,
869,
870,
874,
875,
919,
920,
974,
975,
984,
985,
992,
1020,
1021,
1095,
1096,
1116,
1117,
1123,
1124,
1130,
1131,
1202,
1203,
1219,
1220,
1236,
1237,
1241,
1242,
1254,
1255,
1267,
1268,
1295,
1296,
1341,
1342,
1354,
1355,
1410,
1411,
1425,
1426,
1442,
1443,
1446,
1447,
1502,
1503,
1523,
1524,
1528,
1529,
1594,
1595,
1609,
1610,
1651,
1652,
1670,
1671,
1751,
1752,
1807,
1808,
1822,
1823,
1864,
1865,
1883,
1884,
1915,
1916,
1966,
1967,
1976,
1977,
1984,
2012,
2013,
2037,
2038,
2067,
2068,
2116,
2117,
2119,
2120,
2209,
2210,
2212,
2213,
2239,
2240,
2254,
2255,
2274,
2275,
2298,
2299,
2355,
2356,
2377,
2378,
2401,
2402,
2426,
2427,
2534,
2535,
2554,
2555,
2576,
2577,
2608,
2609,
2641,
2642,
2682,
2683,
2711,
2712,
2737,
2738,
2755,
2756,
2861,
2862,
2883,
2884,
2955,
2956,
2973,
2974,
3081,
3082,
3108,
3109,
3212,
3213,
3234,
3235,
3300,
3301,
3316,
3317,
3346,
3370,
3401,
3434,
3435,
3452,
3453,
3466,
3487,
3501,
3517,
3518,
3532,
3533,
3854,
3855,
3867
],
"line_end_idx": [
90,
91,
92,
93,
94,
95,
96,
97,
141,
142,
149,
150,
202,
203,
212,
213,
220,
248,
249,
323,
324,
344,
345,
351,
352,
358,
359,
432,
433,
445,
446,
470,
471,
486,
487,
518,
519,
544,
545,
574,
575,
628,
629,
633,
634,
665,
666,
669,
670,
707,
708,
711,
712,
793,
794,
801,
802,
843,
844,
854,
855,
869,
870,
874,
875,
919,
920,
974,
975,
984,
985,
992,
1020,
1021,
1095,
1096,
1116,
1117,
1123,
1124,
1130,
1131,
1202,
1203,
1219,
1220,
1236,
1237,
1241,
1242,
1254,
1255,
1267,
1268,
1295,
1296,
1341,
1342,
1354,
1355,
1410,
1411,
1425,
1426,
1442,
1443,
1446,
1447,
1502,
1503,
1523,
1524,
1528,
1529,
1594,
1595,
1609,
1610,
1651,
1652,
1670,
1671,
1751,
1752,
1807,
1808,
1822,
1823,
1864,
1865,
1883,
1884,
1915,
1916,
1966,
1967,
1976,
1977,
1984,
2012,
2013,
2037,
2038,
2067,
2068,
2116,
2117,
2119,
2120,
2209,
2210,
2212,
2213,
2239,
2240,
2254,
2255,
2274,
2275,
2298,
2299,
2355,
2356,
2377,
2378,
2401,
2402,
2426,
2427,
2534,
2535,
2554,
2555,
2576,
2577,
2608,
2609,
2641,
2642,
2682,
2683,
2711,
2712,
2737,
2738,
2755,
2756,
2861,
2862,
2883,
2884,
2955,
2956,
2973,
2974,
3081,
3082,
3108,
3109,
3212,
3213,
3234,
3235,
3300,
3301,
3316,
3317,
3346,
3370,
3401,
3434,
3435,
3452,
3453,
3466,
3487,
3501,
3517,
3518,
3532,
3533,
3854,
3855,
3867,
3894
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3894,
"ccnet_original_nlines": 224,
"rps_doc_curly_bracket": 0.002054440090432763,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21954162418842316,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014475270174443722,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.33172497153282166,
"rps_doc_frac_unique_words": 0.40460526943206787,
"rps_doc_mean_word_length": 4.745065689086914,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.020750522613525,
"rps_doc_word_count": 608,
"rps_doc_frac_chars_dupe_10grams": 0.1594454050064087,
"rps_doc_frac_chars_dupe_5grams": 0.23674176633358002,
"rps_doc_frac_chars_dupe_6grams": 0.20970536768436432,
"rps_doc_frac_chars_dupe_7grams": 0.17227035760879517,
"rps_doc_frac_chars_dupe_8grams": 0.1594454050064087,
"rps_doc_frac_chars_dupe_9grams": 0.1594454050064087,
"rps_doc_frac_chars_top_2gram": 0.03327555954456329,
"rps_doc_frac_chars_top_3gram": 0.027729639783501625,
"rps_doc_frac_chars_top_4gram": 0.0360485315322876,
"rps_doc_books_importance": -404.02496337890625,
"rps_doc_books_importance_length_correction": -404.02496337890625,
"rps_doc_openwebtext_importance": -289.20062255859375,
"rps_doc_openwebtext_importance_length_correction": -289.20062255859375,
"rps_doc_wikipedia_importance": -227.17208862304688,
"rps_doc_wikipedia_importance_length_correction": -227.17208862304688
},
"fasttext": {
"dclm": 0.07597625255584717,
"english": 0.7572259306907654,
"fineweb_edu_approx": 1.5456072092056274,
"eai_general_math": 0.3153361678123474,
"eai_open_web_math": 0.05684477090835571,
"eai_web_code": 0.01612531952559948
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,126,178,715,112,192,000
|
aaa-tacacs-show
Use this command to display the configuration parameters of the TACACS+ server.
Syntax aaa-tacacs-show
name name-string
Name of the TACACS+ service.
scope local|fabric
The scope to apply to the TACACS+ server.
server server-string
Name of the TACACS+ server.
port port-number
The port that connects to the server.
timeout timeout-number
The number of seconds for the server to time out a request. The default value is 10 seconds.
priority priority-number
The priority for the server.
authen|no-authen
Specifies if the server authenticates clients on the network.
authen-local|no-authen-local
Specifies if the server authentication overrides the local users.
authen-method pap|chap|ms-chap
The authentication method for clients. PAP, CHAP, and MS-CHAP are supported methods.
sess-acct|no-sess-acct
Specifies if the user uses session accounting. The TACACS+ server is notified when a user logs in or out of the network.
cmd-acct|no-cmd-acct
Specifies if the user uses command accounting. The TACACS+ server is notified when ever a user, including the network administrator, runs a non-show command.
acct-local|no-acct-local
Specify accounting for local users
sess-author|no-sess-author
Specifies if the user uses session authorization. The TACACS+ server configured for session authorization determines if a user can initiate a session on the network after logging in.
cmd-author|no-cmd-author
Specifies if the user uses command authorization. The TACACS+ server determines if a user can run certain commands on the network.
author-local|no-author-local
Specify authorization for local users.
timed-out yes|no
Specifies if the server has timed out.
error-start date/time:yyyy-mm-ddTHH:mm:ss
The time of first error.
num-errors num-errors-number
The number of errors.
errors-logged yes|no
Specifies if the errors are logged or not.
service service-string
Specify the service name used for TACACS+ requests sent from Netvisor to the TACACS+ server for commands run at the Neetvisor CLI, and the Java, C, and REST APIs. The default value is shell.
service-shell service-shell-string
Specify the service name used for TACACS+ requests sent from Netvisor to the TACACS+ server for commands run from a UNIX shell.
service-vtysh service-vtysh-string
Specify the service name used for TACACS+ requests sent from Netvisor to the TACACS+ server for commands run from vtysh.
Defaults None.
Access CLI
History
Version 1.2.1
Command introduced.
Version 2.6.0
The parameters acct-local, author-local, service, service-shell and service-vtysh added.
Usage Use this command to display information about a TACACS+ server
Examples To display the information about a TACACS+ server, use the following command:
CLI (network-admin@switch) > aaa-tacacs-show
name scope server port timeout priority authen authen-local authen-method sess-acct cmd-acct acct-local sess-author cmd-author author-local service service-shell service-vtysh
---- ----- ------- ---- ------- -------- ------ ------------ ------------- --------- -------- ---------- ----------- ---------- ------------ ------- ------------- -------------
tac local server1 49 10 1 on off chap on off off on off on shell unix-shell vtysh-shell
north
keyboard_arrow_up
keyboard_arrow_down
description
print
feedback
support
business
rss_feed
south
|
{
"url": "https://techdocassets.pluribusnetworks.com/netvisor/nv1_701CR/aaa-tacacs-show1.html",
"source_domain": "techdocassets.pluribusnetworks.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "35149",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YDERFVQVH4KH3JEIBRX4ILQ4QITYB7J5",
"WARC-Concurrent-To": "<urn:uuid:8931c132-1d8b-48a6-bed5-a602a953fe22>",
"WARC-Date": "2022-09-25T04:35:03Z",
"WARC-IP-Address": "164.92.89.40",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IOR6AB6DSRVNASAQEBMH654BRLEYFD3B",
"WARC-Record-ID": "<urn:uuid:559d18c8-7ed7-489e-8bb9-cc9f9712e301>",
"WARC-Target-URI": "https://techdocassets.pluribusnetworks.com/netvisor/nv1_701CR/aaa-tacacs-show1.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f33ce4d7-60ba-4e01-96ed-20f2d6b534ab>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-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,
16,
17,
97,
98,
123,
124,
141,
142,
171,
172,
191,
192,
234,
235,
256,
257,
285,
286,
303,
304,
342,
343,
366,
367,
460,
461,
486,
487,
517,
518,
535,
536,
598,
599,
628,
629,
695,
696,
727,
728,
813,
814,
837,
838,
959,
960,
981,
982,
1140,
1141,
1166,
1167,
1202,
1203,
1230,
1231,
1414,
1415,
1440,
1441,
1572,
1573,
1602,
1603,
1642,
1643,
1660,
1661,
1700,
1701,
1743,
1744,
1769,
1770,
1799,
1800,
1822,
1823,
1844,
1845,
1888,
1889,
1912,
1913,
2104,
2105,
2140,
2141,
2269,
2270,
2305,
2306,
2427,
2428,
2446,
2447,
2461,
2462,
2473,
2474,
2488,
2489,
2509,
2510,
2524,
2525,
2614,
2615,
2686,
2687,
2775,
2776,
2821,
2822,
2999,
3000,
3177,
3178,
3353,
3354,
3360,
3382,
3406,
3422,
3432,
3445,
3457,
3470,
3483
],
"line_end_idx": [
16,
17,
97,
98,
123,
124,
141,
142,
171,
172,
191,
192,
234,
235,
256,
257,
285,
286,
303,
304,
342,
343,
366,
367,
460,
461,
486,
487,
517,
518,
535,
536,
598,
599,
628,
629,
695,
696,
727,
728,
813,
814,
837,
838,
959,
960,
981,
982,
1140,
1141,
1166,
1167,
1202,
1203,
1230,
1231,
1414,
1415,
1440,
1441,
1572,
1573,
1602,
1603,
1642,
1643,
1660,
1661,
1700,
1701,
1743,
1744,
1769,
1770,
1799,
1800,
1822,
1823,
1844,
1845,
1888,
1889,
1912,
1913,
2104,
2105,
2140,
2141,
2269,
2270,
2305,
2306,
2427,
2428,
2446,
2447,
2461,
2462,
2473,
2474,
2488,
2489,
2509,
2510,
2524,
2525,
2614,
2615,
2686,
2687,
2775,
2776,
2821,
2822,
2999,
3000,
3177,
3178,
3353,
3354,
3360,
3382,
3406,
3422,
3432,
3445,
3457,
3470,
3483,
3492
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3492,
"ccnet_original_nlines": 129,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23623187839984894,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037681158632040024,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26376810669898987,
"rps_doc_frac_unique_words": 0.3887587785720825,
"rps_doc_mean_word_length": 5.925058364868164,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.538809299468994,
"rps_doc_word_count": 427,
"rps_doc_frac_chars_dupe_10grams": 0.10869564861059189,
"rps_doc_frac_chars_dupe_5grams": 0.24229249358177185,
"rps_doc_frac_chars_dupe_6grams": 0.18537549674510956,
"rps_doc_frac_chars_dupe_7grams": 0.13952569663524628,
"rps_doc_frac_chars_dupe_8grams": 0.10869564861059189,
"rps_doc_frac_chars_dupe_9grams": 0.10869564861059189,
"rps_doc_frac_chars_top_2gram": 0.05691700056195259,
"rps_doc_frac_chars_top_3gram": 0.05928853899240494,
"rps_doc_frac_chars_top_4gram": 0.026877470314502716,
"rps_doc_books_importance": -330.59503173828125,
"rps_doc_books_importance_length_correction": -330.59503173828125,
"rps_doc_openwebtext_importance": -180.85533142089844,
"rps_doc_openwebtext_importance_length_correction": -180.85533142089844,
"rps_doc_wikipedia_importance": -118.7659683227539,
"rps_doc_wikipedia_importance_length_correction": -118.7659683227539
},
"fasttext": {
"dclm": 0.029721800237894058,
"english": 0.5733954906463623,
"fineweb_edu_approx": 2.666118860244751,
"eai_general_math": 0.026894209906458855,
"eai_open_web_math": 0.19703125953674316,
"eai_web_code": 0.984647810459137
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,007,120,929,509,715,000
|
HTML JPG PDF XML APNG
Aspose.Imaging for Python
GIF
Use Python for CMX to GIF Images Conversion
Create Python Apps to Convert CMX to GIF Images and Photos via Server APIs
How to Convert CMX to GIF Images and Photos with Python
Image files conversion from one format to another is a common task encountered by every graphic designer. The efficiency and excellence in converting files not only impact the speed of completion but also play a crucial role in assessing the overall work quality. Concerning the images sources, they frequently necessitate transformation into alternative formats more suited for printing or online distribution. An image crafted in a graphic editor is likely to be in vector format. In such instances, for website publication, it must undergo rasterization and be saved in a raster format. You have the option to convert the image in an uncompressed format for superior quality or save it to a lossless compressed format to minimize the file size. For scenarios where file size reduction is obligatory, like in website applications, there’s the possibility of conversion to lossy compression formats. Specialized data compression algorithms for images can significantly diminish file size while upholding acceptable image quality, ensuring swift image loading. To convert images and photos from CMX to GIF, we will employ Aspose.Imaging for Python via .NET API which is a feature-rich, powerful and easy to use image manipulation and conversion API for Python platform. You may install it using the following command from your system command.
The system command line
>> pip install aspose-imaging-python-net
Steps to Convert CMX to GIF via Python
Developers can easily load & convert CMX files to GIF in just a few lines of code.
• load CMX file with Image.Load method;
• create & set the instance of required subclass of ImageOptionsBase (e.g. BmpOptions, PngOptions, etc.);
• call the Image.Save method;
• pass file path with GIF extension & object of ImageOptionsBase class.
System Requirements
Before running the conversion example code, make sure that you have the following prerequisites:
• Microsoft Windows / Linux with .NET Core Runtime.
• Python and PyPi package manager.
Free App to Convert CMX to GIF
• Select or drag and drop CMX image
• Choose format and click Convert button
• Click Download button to download GIF image
Check our live demos to convert CMX to GIF
Convert CMX to GIF - Python
CMX What is CMX File Format
Files with CMX extension are Corel Exchange image file format that is used as presentation by CorelSuite applications. It contains image data as vector graphics as well as metadata that describes the image. CMX files can be opened by CorelDraw, Corel Presentations, Paint Shop Pro and some versions of Adobe Illustrator.
Read More | CMX
GIF What is GIF File Format
A GIF or Graphical Interchange Format is a type of highly compressed image. Owned by Unisys, GIF uses the LZW compression algorithm that does not degrade the image quality. For each image GIF typically allow up to 8 bits per pixel and up to 256 colours are allowed across the image. In contrast to a JPEG image, which can display up to 16 million colours and fairly touches the limits of the human eye. Back when the internet emerged, GIFs remained the best choice because they required low bandwidth and compatible for the graphics that consume solid areas of colour. An animated GIF combines numerous images or frames into a single file and displays them in a sequence to generate an animated clip or a short video. The colour limitations are up to 256 for each frame and are likely to be the least suitable for reproducing other images and photographs with colour gradient.
Read More | GIF
Other Supported Conversions
Using Python, one can easily convert different formats including:
BMP (Bitmap Picture)
GIF (Graphical Interchange Format)
DICOM (Digital Imaging & Communications)
EMF (Enhanced Metafile Format)
JPG (Joint Photographic Experts Group)
JPEG (Joint Photographic Experts Group)
JP2 (JPEG 2000)
J2K (Wavelet Compressed Image)
JPEG2000 (JPEG 2000)
PNG (Portable Network Graphics)
APNG (Animated Portable Network Graphics)
PSD (Photoshop Document)
DXF (Drawing Interchange Format, or Drawing Exchange Format,)
SVG (Scalable Vector Graphics)
TIFF (Tagged Image Format)
WEBP (Raster Web Image)
WMF (Microsoft Windows Metafile)
PDF (Portable Document Format (PDF))
HTML (HTML5 Canvas)
EMZ (Windows Compressed Enhanced Metafile)
WMZ (Compressed Windows Media Player Skin)
TGA (Targa Graphic)
SVGZ (Compressed version of Scalable Vector Graphics (.SVG) file.)
CANVAS (HTML5 Canvas)
ICO (Windows icon)
|
{
"url": "https://products.aspose.com/imaging/python-net/conversion/cmx-to-gif/",
"source_domain": "products.aspose.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "35831",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YT3RNFUS4FEOFLTAOGXPTBTMOD3MVPIT",
"WARC-Concurrent-To": "<urn:uuid:66d7d7f9-b318-4f56-b903-9832a6d46a5f>",
"WARC-Date": "2024-05-23T19:35:08Z",
"WARC-IP-Address": "52.85.151.41",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D42YMDW5CABIRZLTHXJQSLOLXWEX4KRW",
"WARC-Record-ID": "<urn:uuid:cc9be1b5-9660-401a-8810-b4882980a3e5>",
"WARC-Target-URI": "https://products.aspose.com/imaging/python-net/conversion/cmx-to-gif/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:be67213d-890e-4799-8452-23462d8858a4>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-22\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,
22,
49,
53,
54,
98,
99,
174,
175,
231,
232,
1575,
1576,
1600,
1601,
1642,
1643,
1682,
1683,
1766,
1767,
1809,
1917,
1949,
2023,
2024,
2044,
2045,
2142,
2143,
2197,
2234,
2235,
2266,
2267,
2305,
2348,
2396,
2397,
2440,
2441,
2469,
2470,
2498,
2499,
2820,
2821,
2837,
2838,
2866,
2867,
3744,
3745,
3761,
3762,
3790,
3791,
3857,
3858,
3879,
3914,
3955,
3986,
4025,
4065,
4081,
4112,
4133,
4165,
4207,
4232,
4294,
4325,
4352,
4376,
4409,
4446,
4466,
4509,
4552,
4572,
4639,
4661
],
"line_end_idx": [
22,
49,
53,
54,
98,
99,
174,
175,
231,
232,
1575,
1576,
1600,
1601,
1642,
1643,
1682,
1683,
1766,
1767,
1809,
1917,
1949,
2023,
2024,
2044,
2045,
2142,
2143,
2197,
2234,
2235,
2266,
2267,
2305,
2348,
2396,
2397,
2440,
2441,
2469,
2470,
2498,
2499,
2820,
2821,
2837,
2838,
2866,
2867,
3744,
3745,
3761,
3762,
3790,
3791,
3857,
3858,
3879,
3914,
3955,
3986,
4025,
4065,
4081,
4112,
4133,
4165,
4207,
4232,
4294,
4325,
4352,
4376,
4409,
4446,
4466,
4509,
4552,
4572,
4639,
4661,
4679
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4679,
"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.2718893885612488,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08986175060272217,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1589861810207367,
"rps_doc_frac_unique_words": 0.4680272042751312,
"rps_doc_mean_word_length": 5.119728088378906,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.29930305480957,
"rps_doc_word_count": 735,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.030560720711946487,
"rps_doc_frac_chars_dupe_6grams": 0.01700771041214466,
"rps_doc_frac_chars_dupe_7grams": 0.01700771041214466,
"rps_doc_frac_chars_dupe_8grams": 0.01700771041214466,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011958540417253971,
"rps_doc_frac_chars_top_3gram": 0.01700771041214466,
"rps_doc_frac_chars_top_4gram": 0.02391709014773369,
"rps_doc_books_importance": -340.43133544921875,
"rps_doc_books_importance_length_correction": -340.43133544921875,
"rps_doc_openwebtext_importance": -197.71595764160156,
"rps_doc_openwebtext_importance_length_correction": -197.71595764160156,
"rps_doc_wikipedia_importance": -149.24940490722656,
"rps_doc_wikipedia_importance_length_correction": -149.24940490722656
},
"fasttext": {
"dclm": 0.031458500772714615,
"english": 0.8254064321517944,
"fineweb_edu_approx": 2.566002368927002,
"eai_general_math": 0.05502814054489136,
"eai_open_web_math": 0.15878826379776,
"eai_web_code": 0.061936378479003906
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "686.22",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Handicraft and Occupations",
"level_3": "Bookbinding and Printing"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,191,204,906,975,226,400
|
[Webkit-unassigned] [Bug 173117] Delete content of a single cell table should not delete the whole table
bugzilla-daemon at webkit.org bugzilla-daemon at webkit.org
Fri Jun 30 06:58:13 PDT 2017
https://bugs.webkit.org/show_bug.cgi?id=173117
--- Comment #4 from Javier Fernandez <jfernandez at igalia.com> ---
(In reply to Ryosuke Niwa from comment #3)
> Oh, just selecting & deleting the first cell ends up deleting the entire
> table. This is clearly a bug. There's no way this is the right UX.
However, this bug seems to contradict what bug #24238 claim needs to be fixed. Could you please clarify what should be the expected behavior ? It seems that both Firefox and IE decide to do nothing and keep the table structure, even when the row, and the whole table actually, is empty.
--
You are receiving this mail because:
You are the assignee for the bug.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.webkit.org/pipermail/webkit-unassigned/attachments/20170630/1d5c4e40/attachment.html>
More information about the webkit-unassigned mailing list
|
{
"url": "https://lists.webkit.org/pipermail/webkit-unassigned/2017-June/780439.html",
"source_domain": "lists.webkit.org",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "4771",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5CV3GCXUZSNILK5KLKZQEP5SOQ5B5OFU",
"WARC-Concurrent-To": "<urn:uuid:e5de8be1-cbe5-47e4-8f34-4fd2c9c9c6fa>",
"WARC-Date": "2019-09-15T08:22:34Z",
"WARC-IP-Address": "17.151.62.20",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZZZZ3H4ABW2AE4QW7JAUMH4B5KE77CWI",
"WARC-Record-ID": "<urn:uuid:94000d22-28f9-48ec-b2a7-b9f814545053>",
"WARC-Target-URI": "https://lists.webkit.org/pipermail/webkit-unassigned/2017-June/780439.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:20161aaa-a664-44a6-b8d7-937e7f282486>"
},
"warc_info": "isPartOf: CC-MAIN-2019-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-23.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,
105,
106,
166,
195,
196,
197,
244,
245,
313,
356,
431,
500,
501,
788,
789,
793,
830,
864,
904,
939,
1044,
1045,
1046
],
"line_end_idx": [
105,
106,
166,
195,
196,
197,
244,
245,
313,
356,
431,
500,
501,
788,
789,
793,
830,
864,
904,
939,
1044,
1045,
1046,
1103
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1103,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2880658507347107,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020576130598783493,
"rps_doc_frac_lines_end_with_ellipsis": 0.0416666716337204,
"rps_doc_frac_no_alph_words": 0.3086419701576233,
"rps_doc_frac_unique_words": 0.6887417435646057,
"rps_doc_mean_word_length": 5.516556262969971,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.016460910439491272,
"rps_doc_unigram_entropy": 4.437549114227295,
"rps_doc_word_count": 151,
"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.019207680597901344,
"rps_doc_frac_chars_top_3gram": 0.03121248073875904,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -109.6739501953125,
"rps_doc_books_importance_length_correction": -109.6739501953125,
"rps_doc_openwebtext_importance": -58.385169982910156,
"rps_doc_openwebtext_importance_length_correction": -49.85957717895508,
"rps_doc_wikipedia_importance": -55.8160514831543,
"rps_doc_wikipedia_importance_length_correction": -55.8160514831543
},
"fasttext": {
"dclm": 0.06417304277420044,
"english": 0.8273057341575623,
"fineweb_edu_approx": 0.8184758424758911,
"eai_general_math": 0.06957591325044632,
"eai_open_web_math": 0.6094728112220764,
"eai_web_code": 0.0001853099965956062
}
}
|
{
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,981,297,195,001,724,000
|
Alternate Representation of Function
1. Hi all,
the function that I'm posting about is a piecewise function defined as follows:
$$
\Delta(x) = \left\{
\begin{array}{ll}
1 & \quad x = 0 \\
0 & \quad x \neq 0
\end{array}
\right.
$$
I decided to call it capital delta because of its similarity to the Dirac delta function. What I'm looking for is another way to represent this function such that it's a single line expression like a limit or a convergent series or something.
My first attempt at this was to represent it as a Fourier cosine series but I'm not sure that I did this 100% correctly. What I did was consider symmetry on the interval ##[-a, a]## where ##a>0## and consider that ##\Delta(x)=0## at ##x= \pm a##. I used this to find the frequencies of the cosines used in the series. Then, I used Fourier's trick to solve for the coefficient. After all was said and done, I ended up with a series that did not clearly converge to 0 for all ##x \neq 0##. It's been a while since I did a Fourier series so I wasn't too confident in my answer anyways. I'd be interested to see if someone else can make this work.
For another attempt, I realized the similarity to the Gaussian bell curve. So I defined the function as:
$$
\Delta(x)=\lim_{\alpha \to \infty}e^{-\alpha x^2}
$$
For ##|x|>0## this limit converges to zero, for ##x=0##, this limit converges to 1. This next step might be useless, but I'll include it anyways. The next thing I did was represent the function inside the limit as a taylor series. Again, I'm not sure of the convergence of this Taylor series (though I assume it converges everywhere) and I'm not sure how the outer limit interferes with the series or where it converges.
$$
\Delta(x)=\lim_{\alpha \to \infty}\sum_{n=0}^{\infty}\frac{(-\alpha x^2)^n}{n!}=\lim_{\alpha \to \infty}\sum_{n=0}^{\infty}(-1)^n\frac{\alpha^nx^{2n}}{n!}
$$
Anyways, the above attempt is the best I could really get at finding a 'single line representation' of ##\Delta##. Like I mentioned though, I'm not sure if the last attempt (with the series) even converges. Any comments about this problem or my methods or whatever are appreciated. Or if you have another attempt I would love to see it.
P.S.
Lastly I just wanna mention that this seems eerily familiar to the Dirac delta function so it would indicate that you might want to consider generalized functions when dealing with it. I'm very new to generalized functions but from the bit that I do know I can say this:
The ##\Delta## function defined above, when multiplied with another function (i.e. ##\Delta(x)f(x)##) is equal to ##f(x)## at zero and 0 everywhere else. Assuming that ##f## is finite at zero, we can say that ##\int_{-\infty}^{\infty}\Delta(x)f(x)dx=0## right? But isn't there an infinite number of functions similar to ##\Delta## which integrate to zero when multiplied by another function? So does this mean the definition of ##\Delta## as a generalized function is not unique?
2. jcsd
3. disregardthat
disregardthat 1,817
Science Advisor
A distribution is a uniquely defined functional, but if it is induced by a measurable function f, then f is not unique as such. For example, if f induces a distrubution D by [itex]D(g) = \int^{\infty}_{-\infty} fgdx[/itex], then [itex]f+1_A[/itex] induces the same distrubution where [itex]1_A[/itex] is the unit function on a null set A.
The distribution induced by your function [itex]\Delta[/itex] is the null-distrubution. Any function which is zero almost everywhere induces the null-distrubution, including the dirac-[itex]\delta[/itex] function. In particular, the dirac-delta distribution (which takes any measurable function to its value in 0) is not induced by the dirac-delta function (which is zero everywhere but in the point 0, where it is [itex]\infty[/itex]).
As to your attempt to find alternative definitions of [itex]\Delta[/itex], your equation is perfectly fine as the taylor series represents [itex]e^{-\alpha x^2}[/itex] everywhere.
4. jbunniii
jbunniii 3,378
Science Advisor
Homework Helper
Gold Member
You won't be able to make this work. The integral defining the Fourier coefficients cannot distinguish your function from the zero function since they only differ at one point. If calculate the coefficients correctly, they will all be zero, so the Fourier series will converge to the zero function, not to your function.
Know someone interested in this topic? Share this thead via email, Google+, Twitter, or Facebook
Have something to add?
0
Draft saved Draft deleted
|
{
"url": "https://www.physicsforums.com/threads/alternate-representation-of-function.765084/",
"source_domain": "www.physicsforums.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "57192",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:24B765Z3WDYM5NLWJ3IMPW37XDTOQEEX",
"WARC-Concurrent-To": "<urn:uuid:39e66a7d-e486-404e-a246-1f9b06673bc8>",
"WARC-Date": "2015-12-01T00:30:33Z",
"WARC-IP-Address": "74.86.200.109",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:Z4CKWY2BOSSGDRFRJDIULU5ZPNSA4N63",
"WARC-Record-ID": "<urn:uuid:c6b31aa9-716d-46a5-944e-61cf6f5b122f>",
"WARC-Target-URI": "https://www.physicsforums.com/threads/alternate-representation-of-function.765084/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3a18b48b-962f-47e9-a498-d0c04253e643>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-132-137.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for Nov 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
37,
38,
51,
52,
136,
143,
167,
189,
212,
235,
251,
263,
270,
271,
518,
519,
1167,
1168,
1277,
1284,
1338,
1345,
1770,
1777,
1936,
1943,
1944,
2285,
2286,
2295,
2570,
2571,
3055,
3061,
3071,
3090,
3091,
3115,
3135,
3136,
3479,
3480,
3921,
3922,
4106,
4112,
4126,
4127,
4146,
4166,
4186,
4202,
4203,
4528,
4534,
4631,
4632,
4655,
4656,
4658
],
"line_end_idx": [
37,
38,
51,
52,
136,
143,
167,
189,
212,
235,
251,
263,
270,
271,
518,
519,
1167,
1168,
1277,
1284,
1338,
1345,
1770,
1777,
1936,
1943,
1944,
2285,
2286,
2295,
2570,
2571,
3055,
3061,
3071,
3090,
3091,
3115,
3135,
3136,
3479,
3480,
3921,
3922,
4106,
4112,
4126,
4127,
4146,
4166,
4186,
4202,
4203,
4528,
4534,
4631,
4632,
4655,
4656,
4658,
4683
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4683,
"ccnet_original_nlines": 60,
"rps_doc_curly_bracket": 0.009182149544358253,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3897196352481842,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.032710280269384384,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27196261286735535,
"rps_doc_frac_unique_words": 0.4002808928489685,
"rps_doc_mean_word_length": 4.764044761657715,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.05607476830482483,
"rps_doc_unigram_entropy": 5.085301399230957,
"rps_doc_word_count": 712,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.028301889076828957,
"rps_doc_frac_chars_dupe_6grams": 0.014740570448338985,
"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.005896230228245258,
"rps_doc_frac_chars_top_3gram": 0.010613209567964077,
"rps_doc_frac_chars_top_4gram": 0.008844340220093727,
"rps_doc_books_importance": -436.9610290527344,
"rps_doc_books_importance_length_correction": -436.9610290527344,
"rps_doc_openwebtext_importance": -281.4481506347656,
"rps_doc_openwebtext_importance_length_correction": -281.4481506347656,
"rps_doc_wikipedia_importance": -243.0823974609375,
"rps_doc_wikipedia_importance_length_correction": -243.0823974609375
},
"fasttext": {
"dclm": 0.36323344707489014,
"english": 0.9025981426239014,
"fineweb_edu_approx": 1.2722915410995483,
"eai_general_math": 0.9995405673980713,
"eai_open_web_math": 0.9680616855621338,
"eai_web_code": 0.9420210123062134
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "515.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
},
"secondary": {
"code": "515.243",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
}
},
"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": "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": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,977,011,271,561,156,000
|
API Docs
Density API
The Density API hosts real-time and historical people count data for your Density-enabled spaces.
The Density API is built upon REST, returns JSON responses, and supports cross-origin resource sharing. Standard HTTP verbs are used to perform CRUD operations, and the API returns standard HTTP response codes to indicate errors. API versioning is implemented via namespaces. Token authentication is used to authenticate every API request.
Base URL
https://api.density.io/v2
Authentication
All API endpoints are authenticated using your API token, found in the dashboard.
Your token must be included in the Authorization HTTP header, prefixed by the string literal "Bearer" with a single space separating the two strings. Any API call made without the proper Authorization header will return a 403 error.
HTTP Authorization Header
Authorization: Bearer YOUR_API_TOKEN
Errors
Density endpoints use standard HTTP error codes. The response includes any additional information about the error.
Error Codes
400 Bad Request
The request sent to the API is invalid. Additional information will be returned in the response body.
403 Forbidden
The client is not allowed to perform this request. Can be caused by a missing or invalid API token.
404 Not Found
The requested resource does not exist.
409 Conflict
The request conflicts with another request.
429 Too Many Requests
The user has sent many requests in a given amount of time (see rate limit)
Rate Limit
Density API services are rate limited to prevent unintentional abuse of our service and ensure a reliable experience for all our developers and integrations. The API is limited to 3,600 requests per hour, per token, evaluated hourly.
Pagination
Density endpoints that return multiple results will be paginated to 200 items by default.
For these endpoints the root of the response object will contain the total number of results, the next and previous page URLs, and an array with the current page of results. If all results fit onto a single page, the next and previous page URLs will be null.
Query String Parameters
page
integer
default: 1
If included, the endpoint will return a particular page of data.
page_size
integer
default: 200
If included, the endpoint will return pages of this size. The maximum page size is 1000.
Example Request
$ curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/spaces/?page=4&page_size=15
Paginated Response
{
"total": 89,
"next": "https://api.density.io/v2/spaces/?page=5&page_size=15",
"previous": "https://api.density.io/v2/spaces/?page=3&page_size=15",
"results": [
…
]
}
CSV Export
The Density API can return data in CSV format for convenience. To request CSV, set the Accept header to the value text/csv.
In CSV format, nested fields will be flattened, with the nested field names in order separated by a dot character (.).
CSV responses are not paged, all results will be returned. Large responses may take longer to prepare, and no more than 31 days of traffic data can be queried at a time.
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
-H "Accept: text/csv" \
https://api.density.io/v2\
/spaces/spc_452554024357462439/events/\
?start_time=2017-09-19T08:00:00.000Z\
&end_time=2017-09-20T08:00:00.000Z
CSV Response
direction,doorway_id,id,sensor_serial_number,timestamp
1,drw_452554070478029236,evt_463842287353331919,Z444944692392493397,2017-09-19T12:23:45.405Z
-1,drw_452554070478029236,evt_463533857086374803,Z444944692392493397,2017-09-19T12:38:03.575Z
...
Timestamps
All timestamps sent to the API must be formatted as strings according to the ISO 8601 standard for UTC timestamps. The API will return all timestamps in the same UTC format.
Most programming platforms have built-in utilities to convert between local time and UTC.
ISO 8601 UTC Timestamp
2016-05-23T10:00:00.000Z
Counts and Events
The Density API provides real-time and historical people count for logical spaces. A "space" can be a room, a floor, a building, or a campus. Each space has a unique id for querying its data.
People count is represented by two concepts: counts and events. A "count" is the number of people in a space at a particular time. An "event" is an entrance or exit to or from a space at a particular time.
Space "counts" are sampled at regular intervals, and analytics for each interval are included in the API response. See Space Counts for details.
List Spaces
Each space includes a list of doorways linked to the space, the current_count of people in the space, the total capacity of the space, a daily_reset time, the space type (see list in Spaces section), and an optional parent space's ID. There are also optional address fields to be used to locate campuses and buildings.
The ancestry field returns an array of parent spaces. First element = closest, last = furthest.
There is validation on space types and parent associations. For example, you can have a floor that has a building as parent, but not the other way around.
To query foot traffic data for a space, use an id returned by this endpoint with the other two endpoints in this section. To manage the spaces and doorways in your environment with the Density API, see these sections: Spaces, Doorways, and Links.
GET /spaces/
Query String Parameters
doorway_id
If included, return only spaces associated with this doorway.
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/spaces/
Example Response
{
"total": 2,
"next": null,
"previous": null,
"results": [
{
"id": "spc_575377614718369795",
"name": "Headquarters",
"notes": "Company HQ",
"meta": {
"optional_meta_data": "abc123"
},
"description": "Company HQ",
"parent_id": null,
"space_type": "building",
"function": null,
"time_zone": "America/New_York",
"daily_reset": null,
"current_count": 3,
"capacity": 65,
"target_capacity": null,
"safe_capacity": null,
"safe_threshold_mode": null,
"safe_threshold_value": null,
"max_dwell_minutes": null,
"doorways": [],
"tags": [],
"address": "123 First St, Ankh-Morpork, DW 90210-1219",
"latitude": null,
"longitude": null,
"counting_mode": "doorways",
"component_spaces": [],
"floor_level": null,
"space_mappings": [],
"time_segments": [],
"time_segment_groups": [],
"size_area": null,
"size_area_unit": null,
"annual_rent": null,
"annual_rent_currency": "USD",
"assigned_teams": [],
"sensors_total": 1,
"image_url": null,
"created_at": "2019-09-24T01:07:32.253Z",
"updated_at": "2020-08-06T22:03:05.349Z",
"description": "",
"inherits_time_segments": false
},
{
"id": "spc_575377614718369795",
"name": "Main Office",
"notes": "",
"description": "",
"parent_id": "spc_575377614718369795",
"ancestry": [
{
"id": "spc_575377614718369795",
"name": "Headquarters"
}
],
"space_type": "space",
"function": "office",
"time_zone": "America/New_York",
"daily_reset": null,
"current_count": 30,
"capacity": 80,
"target_capacity": null,
"safe_capacity": null,
"safe_threshold_mode": null,
"safe_threshold_value": null,
"max_dwell_minutes": null,
"doorways": [],
"tags": [],
"address": null,
"latitude": null,
"longitude": null,
"counting_mode": "doorways",
"component_spaces": [],
"floor_level": null,
"space_mappings": [],
"time_segments": [],
"time_segment_groups": [],
"size_area": null,
"size_area_unit": null,
"annual_rent": null,
"annual_rent_currency": "USD",
"assigned_teams": [],
"sensors_total": 1,
"image_url": null,
"created_at": "2019-09-24T01:07:32.253Z",
"updated_at": "2020-08-06T22:03:05.349Z",
"description": "",
"inherits_time_segments": false
}
]
}
Space Counts
List counts for a space over a period of time, sampled at regular intervals. Each sample contains a timestamp and the count at that time. Each sample also includes an interval object with start and end times, and a nested analytics object containing the min count, max count, total events, total entrances, total exits, utilization, target utilization, entry_rate (per minute) and exit_rate (per minute) for the interval. In each interval, utilization and target_utilization are calculated based on the max count for that interval. utilization is calculated by max / capacity, and target_utilization by max count / target_capacity.
The response also contains a metrics object with aggregate metrics for each type of event (entrances, exits, count and max).
Counts can optionally be filtered by one or more time segment or time segment group.
GET /spaces/:space_id/counts/
Query String Parameters
* start_time
required | string
Sample counts starting at this timestamp. Must be formatted as an ISO 8601 UTC timestamp.
* end_time
required | string
Sample counts until just before this timestamp. Must be formatted as an ISO 8601 UTC timestamp.
interval
interval
default: 1h
If present, sample counts at this interval. Must be a non-zero, positive integer followed by s (seconds), m (minutes), h (hours), d (days), or w (weeks)
order
ASC or DESC
default: ASC
Order the count samples in ascending or descending chronological order.
time_segments
can be included multiple times
A time segment ID associated with this space to filter count results by.
time_segment_groups
can be included multiple times
A time segment group ID associated with this space to filter count results by.
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/spaces/spc_452554024357462439/counts/\
?start_time=2017-09-19T15:00:00Z\
&end_time=2017-09-19T17:00:00Z\
&time_segments=tsm_579017521479286820\
&time_segments=tsm_578329221793841160
Example Response
{
"total": 2,
"next": null,
"previous": null,
"metrics": {
"entrances": {
"total": 40,
"average": 1.5,
"peak": {
"value": 6,
"timestamp": "2020-08-30T20:00:00.000Z"
}
},
"exits": {
"total": 38,
"average": 1.5,
"peak": {
"value": 6,
"timestamp": "2020-08-30T20:00:00.000Z"
}
},
"count": {
"average": 1.1,
"min": {
"value": 0,
"timestamp": "2020-08-31T08:00:00.000Z"
},
"max": {
"value": 3,
"timestamp": "2020-08-31T15:00:00.000Z"
}
},
"target_utilization": {
"average": null,
"min": null,
"max": null,
"durations": {
"0": "0:00:00",
"40": "0:00:00",
"80": "0:00:00",
"100": "0:00:00"
}
}
},
"results": [
{
"timestamp": "2020-08-30T15:00:00.000Z",
"count": 0,
"interval": {
"start": "2020-08-30T15:00:00.000Z",
"end": "2020-08-30T15:59:59.999Z",
"analytics": {
"min": 0,
"max": 1,
"events": 4,
"entrances": 2,
"exits": 2,
"utilization": null,
"target_utilization": null,
"entry_rate": 0.0,
"exit_rate": 0.0
}
}
},
{
"timestamp": "2020-08-30T16:00:00.000Z",
"count": 0,
"interval": {
"start": "2020-08-30T16:00:00.000Z",
"end": "2020-08-30T16:59:59.999Z",
"analytics": {
"min": 0,
"max": 1,
"events": 10,
"entrances": 5,
"exits": 5,
"utilization": null,
"target_utilization": null,
"entry_rate": 0.1,
"exit_rate": 0.1
}
}
}
]
}
Space Events
List individual entrances and exits into or out of a space over a period of time. Each event contains a timestamp and direction (1 for entrance, -1 for exit).
GET /spaces/:space_id/events/
Query String Parameters
* start_time
required | string
Query traffic starting at this time. Must be formatted as an ISO 8601 UTC timestamp.
end_time
string
default: now
Query traffic until this time. Must be formatted as an ISO 8601 UTC timestamp.
doorway_id
string
Query only traffic through this doorway.
direction
1 or -1
Query only traffic matching this direction.
order
ASC or DESC
default: ASC
Order the traffic events in ascending or descending chronological order.
time_segments
can be included multiple times
A time segment ID associated with this space to filter event results by.
time_segment_groups
can be included multiple times
A time segment group ID associated with this space to filter event results by.
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/spaces/spc_452554024357462439/events/\
?start_time=2017-09-19T15:00:00Z\
&end_time=2017-09-19T17:00:00Z
Example Response
{
"total": 138,
"next": null,
"previous": null,
"results": [
{
"id": "evt_459087893936210613",
"sensor_serial_number": "Z457234837531526031",
"doorway_id": "drw_452554070478029236",
"timestamp": "2016-09-19T15:32:10.409Z",
"direction": -1
},
{
"id": "evt_459087875221226161",
"sensor_serial_number": "Z457234837531526031",
"doorway_id": "drw_452554070478029236",
"timestamp": "2016-09-19T15:32:19.148Z",
"direction": 1
},
...
]
}
Use Cases
This section describes common use cases and the API calls used to query the appropriate data.
Count Samples
Sample the count every five minutes for 24 hours. The count field in each result is the number of people who were in the space at the corresponding timestamp.
Use this call to find out how your space is used throughout one day.
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/spaces/spc_452554024357462439/counts/\
?start_time=2017-09-19T08:00:00Z\
&end_time=2017-09-20T08:00:00Z\
&interval=5m\
&page_size=288
Example Response
{
"total": 288,
"next": null,
"previous": null,
"metrics": {
"entrances": {
"total": 31,
"average": 0.1,
"peak": {
"value": 3,
"timestamp": "2019-09-19T20:10:00.000Z"
}
},
"exits": {
"total": 30,
"average": 0.1,
"peak": {
"value": 3,
"timestamp": "2019-09-19T16:50:00.000Z"
}
},
"count": {
"average": 0.7,
"min": {
"value": 0,
"timestamp": "2019-09-19T15:00:00.000Z"
},
"max": {
"value": 2,
"timestamp": "2019-09-19T18:20:00.000Z"
}
},
"target_utilization": {
"average": null,
"min": null,
"max": null,
"durations": {
"0": "0:00:00",
"40": "0:00:00",
"80": "0:00:00",
"100": "0:00:00"
}
}
},
"results": [
{
"timestamp": "2019-09-19T08:00:00.000Z",
"count": 0,
"interval": {
"start": "2019-09-19T08:00:00.000Z",
"end": "2019-09-19T08:04:59.999Z",
"analytics": {
"min": 0,
"max": 0,
"events": 0,
"entrances": 0,
"exits": 0,
"utilization": null,
"target_utilization": null,
"entry_rate": 0.0,
"exit_rate": 0.0
}
}
},
....
]
}
Total Entrances
Get the total number of entrances into a space every day for one week. Each result's interval object has a nested analytics object with data for that interval, including the total number of entrances.
Use this call to find out how many people are visiting your space on different days of the week.
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/spaces/spc_452554024357462439/counts/\
?start_time=2017-09-17T08:00:00Z\
&end_time=2017-09-24T08:00:00Z\
&interval=1d\
&page_size=7
Example Response
{
"total": 7,
"next": null,
"previous": null,
"metrics": {
"entrances": {
"total": 54,
"average": 7.7,
"peak": {
"value": 31,
"timestamp": "2017-09-22T08:00:00.000Z"
}
},
"exits": {
"total": 55,
"average": 7.9,
"peak": {
"value": 30,
"timestamp": "2017-09-22T08:00:00.000Z"
}
},
"count": {
"average": 0.6,
"min": {
"value": 0,
"timestamp": "2017-09-22T08:00:00.000Z"
},
"max": {
"value": 2,
"timestamp": "2017-09-22T08:00:00.000Z"
}
},
"target_utilization": {
"average": null,
"min": null,
"max": null,
"durations": {
"0": "0:00:00",
"40": "0:00:00",
"80": "0:00:00",
"100": "0:00:00"
}
}
},
"results": [
{
"timestamp": "2017-09-17T08:00:00.000Z",
"count": 0,
"interval": {
"start": "2017-09-17T08:00:00.000Z",
"end": "2017-09-18T07:59:59.999Z",
"analytics": {
"min": 0,
"max": 43,
"events": 468,
"entrances": 234,
"exits": 234
}
}
},
...
]
}
Individual Exits
List individual exits from a space over a 24-hour period. Each result has a timestamp and a direction (which in this example will always be -1).
Use this call to find out exactly when people are leaving your space.
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/spaces/spc_452554024357462439/events/\
?start_time=2017-09-19T08:00:00Z\
&end_time=2017-09-20T08:00:00Z\
&direction=-1\
&page_size=1000
Example Response
{
"total": 234,
"next": null,
"previous": null,
"results": [
{
"id": "evt_459087848717419179",
"sensor_serial_number": "Z457234837531526031",
"doorway_id": "drw_452554070478029236",
"timestamp": "2016-09-19T08:03:19.148Z",
"direction": -1
},
...
]
}
Sensor Events
The Density API also provides a low-level stream of "sensor events". These events are not necessarily one-to-one with traffic events at any space, because sensors can be mounted on either side of a doorway.
This endpoint should only be used for testing configured sensors and environments.
List Sensor Events
List low-level "sensor events" for a sensor and a period of time. Each sensor event contains a timestamp and a trajectory relative to the sensor. The trajectory is not necessarily equal to any direction relative to a space (i.e. an entrance or exit).
This call should only be used for testing sensor performance.
GET /sensors/:serial_number/events/
Query String Parameters
* start_time
required | string
The earliest timestamp to include. Should be formatted as an ISO 8601 UTC timestamp.
end_time
string
default: now
The latest timestamp to include. Should be formatted as an ISO 8601 UTC timestamp.
trajectory
1 or -1
Query only sensor events matching this trajectory (relative to the sensor). If the sensor is mounted on the inside of your space, 1 means an entry and -1 means an exit.
order
ASC or DESC
default: ASC
Order the sensor events in ascending or descending chronological order.
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/sensors/Z444944692392493397/events/\
?start_time=2017-09-19T15:00:00Z
&end_time=2017-09-19T15:01:00Z
Example Response
{
"total": 2,
"next": null,
"previous": null,
"results": [
{
"id": "evt_459087875221226161",
"doorway_id": "drw_452554070478029236",
"sensor_serial_number": "Z444944692392493397",
"timestamp": "2017-09-19T15:00:10.436Z",
"trajectory": 1
},
{
"id": "evt_459087822347829922",
"doorway_id": "drw_452554070478029236",
"sensor_serial_number": "Z444944692392493397",
"timestamp": "2017-09-19T15:00:19.003Z",
"trajectory": -1
}
]
}
Simulate Event
Simulate a low-level sensor event. Real sensors will automatically create their own events.
This call should only be used for testing sensor and doorway placement.
POST /sensors/:serial_number/events/
Request Body
* trajectory
required | 1 or -1
The trajectory of the traffic event, relative to the sensor. If the sensor is mounted on the inside of your space, 1 means an entry and -1 means an exit.
timestamp
string
default: now
The time the event was detected. Must be formatted as an ISO 8601 UTC timestamp.
Example Request
curl -X POST \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"timestamp": "2016-09-19T15:45:00.000Z",
"trajectory": 1
}' \
https://api.density.io/v2\
/sensors/Z444944692392493397/events/
Example Response
This endpoint will return an HTTP response with a status code of 202 Accepted and an empty body on success.
Resets
The count at each space may be reset to 0 daily, so that drift (counting error) doesn't accumulate over time, ensuring long-term accuracy.
To reset the current count or to view historical resets at a space, use the /spaces/:space_id/resets/ endpoint. In production, you can configure the daily_reset property on a space to automatically reset its count at that (UTC) time every day.
List Resets
List resets for a space and a period of time. Each reset contains a timestamp and the new count.
GET /spaces/:space_id/resets/
Query String Parameters
* start_time
required | string
The earliest timestamp to include. Should be formatted as an ISO 8601 UTC timestamp.
end_time
string
default: now
The latest timestamp to include. Should be formatted as an ISO 8601 UTC timestamp.
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/spaces/spc_452554024357462439/resets/\
?start_time=2017-09-19&end_time=2017-09-20
Example Response
{
"total": 1,
"next": null,
"previous": null,
"results": [
{
"id": "rst_458961873618862211",
"space_id": "spc_452554024357462439",
"timestamp": "2016-09-19T08:00:00",
"count": 0,
"pre_reset_count": 1
}
]
}
Reset Count
Reset the count for a space. The count parameter can be used to reset the count to a number other than 0.
POST /spaces/:space_id/resets/
Request Body
count
integer
default: 0
Reset the count to this value.
timestamp
string
default: now
The time of the reset. Should be formatted as an ISO 8601 UTC timestamp.
Spaces
The Density API can also be used to create and link spaces and doorways. Most integrations will not need to use these endpoints, as interactive tools to do so will be provided.
A space can be located within, adjacent to, or overlapping another space. For example, the interior of a conference room can be a space. The interior of the entire building can be a space as well. As long as you can put a name to an indoor region with foot traffic, it can be a space.
Possible values for space_type:
• space (default)
• floor
• building
• campus
Possible values for function:
• amenities_space
• break_room
• cafe
• collaboration
• conference_room
• dining_area
• event_space
• focus_quiet
• gym
• kitchen
• lab
• library
• lounge
• meeting_room
• office
• phone_booth
• place_of_worship
• reception
• restroom
• retail
• theater
• wellness_room
A space hierarchy is created by the (optional) parent field. These connections are validated so that campuses contain buildings, floors are within buildings, and so on.
A few rules on our space hierarchy:
• The hierarchy is Campus > Building > Floor > Space.
• A building can be stand-alone or belong to a campus.
• A space can belong to a campus, building, floor, or another space.
• A space can only have one child space.
Spaces can be further organized with tags.
A safety threshold can be defined for each space, to make use of Density's Safe features and Safe Display, through the safe_threshold_value field. There are 3 safe threshold modes, defined by the safe_threshold_mode field:
• SAFE_CAPACITY: The space is considered unsafe when the number of people in it exceeds the number defined in the space's safe_capacity field
• UTILIZATION_PERC_TARGET: The space is considered unsafe when the number of people in it is more than a proportion of the target_capacity. The proportion is defined in the safe_threshold_value field. For example, if the target_capacity is 10, and safe_threshold_value is 0.6, the space is considered unsafe when there are more than 6 people.
• UTILIZATION_PERC_LEGAL: The space is considered unsafe when the number of people in it is more than a proportion of the legal_capacity. The proportion is defined in the safe_threshold_value field.
Density spaces connected to other rooms and spaces through integrations will have the connected reflected in the space_mappings field.
Should you need to store certain metadata to correlate Density spaces with your own internal spaces, you can use the freeform meta field to save a json structure.
Get Space
Get detailed information about a space. Includes the current count, the daily reset time, the list of doorways linked to this space, space type, and address information, and its parent in the space hierarchy.
The ancestry field returns an array of parent spaces. First element = closest, last = furthest.
GET /spaces/:space_id/
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/spaces/spc_452554024357462439/
Example Response
{
"id": "spc_452554024357462439",
"name": "Conference Rm A",
"notes": "The conf room",
"meta": {
"optional_meta_data": "abc123"
},
"description": "The conf room",
"parent_id": "spc_352554024357462131",
"ancestry": [
{
"id": "spc_352554024357462131",
"name": "Floor A"
},
{
"id": "spc_552573639257462532",
"name": "Building 123"
}
],
"space_type": "space",
"function": "conference_room",
"capacity": 50,
"target_capacity": null,
"safe_capacity": null,
"safe_threshold_mode": null,
"safe_threshold_value": null,
"max_dwell_minutes": null,
"time_zone": "America/New_York",
"daily_reset": "13:00",
"current_count": 5,
"doorways": [
{
"id": "drw_452554070478029236",
"name": "Front Door",
"link_id": "lnk_835699047305052422",
"sensor_placement": 1
}
],
"tags": [
"tech_garden"
],
"address": "1516 1st St Suite 902, New York, NY 10001",
"latitude": null,
"longitude": null,
"counting_mode": "doorways",
"component_spaces": [],
"floor_level": null,
"space_mappings": [],
"time_segments": [
{
"id": "tsm_578329221793841160",
"name": "Main Lunchtime",
"start": "11:00:00",
"end": "12:00:00",
"days": [
"Monday",
"Tuesday",
"Wednesday",
"Thursday",
"Friday"
]
}
],
"time_segment_groups": [
{
"id": "tsg_578329608869380107",
"name": "All Lunches"
}
],
"size_area": null,
"size_area_unit": null,
"annual_rent": null,
"annual_rent_currency": "USD",
"assigned_teams": [],
"sensors_total": 1,
"image_url": null,
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z",
"inherits_time_segments": false
}
Create Space
Add a space to your environment. To link doorways to this space, use the POST /links endpoint after creating the space with this endpoint.
POST /spaces/
Request Body
* name
required | string
The name of the space.
notes
string
Notes about the space.
meta
json
Free-form JSON metadata to store on the space.
time_zone
string
The timezone of the space in tzdata format.
capacity
integer
The maximum number of people that can legally occupy the space.
target_capacity
integer
The target maximum number of people occupying the space.
safe_capacity
integer
If safe_threshold_mode is set to SAFE_CAPACITY, this is the maximum number of people that can occupy the space for it to be deemed safe.
safe_threshold_mode
string
How the safe threshold is calculated. Can be SAFE_CAPACITY, UTILIZATION_PERC_LEGAl orUTILIZATION_PERC_TARGET.
safe_threshold_value
float
The proportion of the legal capacity or target capacity (depending on safe_threshold_mode), above which the space is deemed in unsafe.
daily_reset
string
A 24-hour time in the local time zone. The space's count will automatically reset to 0 at this time every day. The default daily reset time is 04:00.
space_type
string
The space type: space (default), floor, building, or campus.
function
string
The function of the space: (amenities_space, break_room, cafe, collaboration, conference_room, dining_area, event_space, focus_quiet, gym, kitchen, lab, library, lounge, meeting_room, office, phone_booth, place_of_worship, reception, restroom, retail, theater, wellness_room)
parent_id
string
The ID of the parent space if in a hierarchy.
address
string
Street address of the space.
annual_rent
float
Only allowed in spaces whose space_type is building. The rent of the building.
annual_rent_currency
string
The currency for the annual_rent number. The default is USD.
size_area
float
The area of the space.
size_area_unit
string
The unit for the size_area number. The default is square_feet.
latitude
float
Latitude for precision mapping.
longitude
float
Longitude for precision mapping.
Example Request
curl -X POST \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"name": "Kitchen",
"notes": "Office Kitchen",
"daily_reset": "14:00"
}' \
https://api.density.io/v2/spaces/
Example Response
{
"id": "spc_458687913710846960",
"name": "Kitchen",
"notes": "",
"meta": null,
"space_type": "space",
"function": null,
"time_zone": "America/New_York",
"daily_reset": "04:00",
"current_count": 0,
"capacity": null,
"target_capacity": null,
"safe_capacity": null,
"safe_threshold_mode": null,
"safe_threshold_value": null,
"max_dwell_minutes": null,
"parent_id": null,
"ancestry": [],
"address": null,
"latitude": null,
"longitude": null,
"counting_mode": "doorways",
"component_spaces": [],
"floor_level": null,
"space_mappings": [],
"doorways": [],
"tags": [],
"time_segments": [],
"time_segment_groups": [],
"size_area": null,
"size_area_unit": null,
"annual_rent": null,
"annual_rent_currency": "USD",
"assigned_teams": [],
"sensors_total": 0,
"image_url": null,
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z",
"description": "",
"inherits_time_segments": false
}
Update Space
Update a space.
PUT /spaces/:space_id/
Request Body
name
string
The name of the space.
notes
string
Notes about the space.
meta
json
Free-form JSON metadata to store on the space.
time_zone
string
The timezone of the space in tzdata format.
capacity
integer
The maximum number of people that can legally occupy the space.
target_capacity
integer
The target maximum number of people occupying the space.
safe_capacity
integer
If safe_threshold_mode is set to SAFE_CAPACITY, this is the maximum number of people that can occupy the space for it to be deemed safe.
safe_threshold_mode
string
How the safe threshold is calculated. Can be SAFE_CAPACITY, UTILIZATION_PERC_LEGAl orUTILIZATION_PERC_TARGET.
safe_threshold_value
float
The proportion of the legal capacity or target capacity (depending on safe_threshold_mode), above which the space is deemed in unsafe.
daily_reset
string
A 24-hour time in the local time zone. The space's count will automatically reset to 0 at this time every day. The default daily reset time is 04:00.
space_type
string
The space type: space (default), floor, building, or campus.
function
string
The function of the space: (amenities_space, break_room, cafe, collaboration, conference_room, dining_area, event_space, focus_quiet, gym, kitchen, lab, library, lounge, meeting_room, office, phone_booth, place_of_worship, reception, restroom, retail, theater, wellness_room)
parent_id
string
The ID of the parent space if in a hierarchy.
address
string
Street address of the space.
annual_rent
float
Only allowed in spaces whose space_type is building. The rent of the building.
annual_rent_currency
string
The currency for the annual_rent number. The default is USD.
size_area
float
The area of the space.
size_area_unit
string
The unit for the size_area number. The default is square_feet.
latitude
float
Latitude for precision mapping.
longitude
float
Longitude for precision mapping.
Example Request
curl -X PUT \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"name": "Big Kitchen",
"daily_reset": "13:00",
"capacity": 20
}' \
https://api.density.io/v2\
/spaces/spc_458687913710846960/
Example Response
{
"id": "spc_458687913710846960",
"name": "Big Kitchen",
"notes": "The Larger Office Kitchen",
"meta": {
"optional_meta_data": "abc123"
},
"description": "The Larger Office Kitchen",
"space_type": "building",
"function": "lab",
"time_zone": "America/Los_Angeles",
"daily_reset": "13:00",
"current_count": 0,
"capacity": 100,
"target_capacity": 50,
"safe_capacity": 20,
"safe_threshold_mode": "SAFE_CAPACITY",
"safe_threshold_value": 0.8,
"max_dwell_minutes": 100,
"parent_id": null,
"ancestry": [],
"address": null,
"latitude": null,
"longitude": null,
"counting_mode": "doorways",
"component_spaces": [],
"floor_level": null,
"space_mappings": [],
"doorways": [],
"tags": [],
"time_segments": [],
"time_segment_groups": [],
"size_area": null,
"size_area_unit": "square_feet",
"annual_rent": 1000000.99,
"annual_rent_currency": "USD",
"assigned_teams": [],
"sensors_total": 0,
"image_url": null,
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z",
"inherits_time_segments": false
}
Delete Space
Delete a space from your environment. If the request is successful, a 204 No Content response will be returned.
Warning: Deleting a space will destroy all historical counts for that space.
DELETE /spaces/:space_id/
Request Body
* name
required | string
The current name of the space. Must be an exact match.
Example Request
curl -X DELETE \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"name": "Kitchen (Updated)"
}' \
https://api.density.io/v2\
/spaces/spc_458687913710846960/
Tag Space
Tag a space.
POST /spaces/:space_id/tags/
Request Body
* tag_name
required | string
The tag name. Alphanumeric characters, underscore or minus sign only.
Example Request
curl -X POST \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"tag_name": "tech_garden"
}' \
https://api.density.io/v2/spaces/spc_452554024357462439/tags/
Example Response
{
"tag_name": "tech_garden"
}
Untag Space
Untag a space.
DELETE /spaces/:space_id/tags/:tag_name/
Example Request
curl -X DELETE \
-H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/spaces/spc_452554024357462439/tags/tech_garden/
Assign Team to Space
Assign a team to a space.
POST /spaces/:space_id/assigned_teams/
Request Body
* team_name
required | string
The team name.
Example Request
curl -X POST \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"team_name": "HR"
}' \
https://api.density.io/v2/spaces/spc_452554024357462439/assigned_teams/
Example Response
{
"id": "ast_839584474655096000",
"team_name": "HR"
}
Remove Team from Space
Remove a team from a space.
DELETE /spaces/:space_id/assigned_teams/:assigned_team_id/
Example Request
curl -X DELETE \
-H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/spaces/spc_452554024357462439/assigned_teams/ast_839584474655096000/
Doorways
Each space has one or more doorways associated with it. Each doorway is an entrance or exit where a Density sensor can be mounted to detect traffic events. A doorway can be associated with more than one space, if an interior doorway separates two spaces or if two spaces overlap.
Active doorways must have a sensor attached - this is done by setting the sensor_serial_number value on the doorway. Every active doorway has exactly one sensor attached to it.
Doorways can be organized with tags (see below).
List Doorways
List all doorways for an account.
GET /doorways/
Query String Parameters
space_id
If included, return only doorways associated with this space.
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/doorways/
Example Response
{
"count": 2,
"next": null,
"previous": null,
"results": [
{
"id": "drw_437303389773103967",
"sensor_serial_number": "Z458467949888405826",
"name": "Conference Room Door",
"spaces": [
{
"id": "spc_546324050188690000",
"name": "SF Office",
"link_id": "lnk_814175826722420000",
"sensor_placement": 1
}
],
"tags": [
"tech_garden"
],
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z"
},
{
"id": "drw_452554070478029236",
"sensor_serial_number": "Z457234837531526031",
"name": "Office Door",
"tags": [
"tech_garden"
],
"spaces": [
{
"id": "spc_546324050188690001",
"name": "NYC Office",
"link_id": "lnk_81417582672240001",
"sensor_placement": 1
}
],
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z"
}
],
}
Create Doorway
Add a new doorway to your environment.
POST /doorways/
Request Body
* name
required | string
A unique name for the doorway.
description
string
A description for the doorway.
sensor_serial_number
string
The serial_number of the sensor attached to this doorway, if any.
Example Request
curl -X POST \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"name": "Kitchen Door",
"description": "The doorway to the Kitchen"
}' \
https://api.density.io/v2/doorways/
Example Response
{
"id": "drw_458687903724209131",
"sensor_serial_number": null,
"name": "Kitchen Door",
"description": "The doorway to the Kitchen",
"spaces": [],
"tags": [],
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z",
"multipoint": false
}
Get Doorway
Detailed information about a doorway. The spaces array is a summary of the spaces associated with this doorway. Each association in this array also has a sensor_placement used to configure complex environments. The sensor_placement will be 1 if the sensor is mounted on the inside of the space, and -1 if it is mounted on the outside. Note that a sensor should never be mounted outdoors.
GET /doorways/:doorway_id/
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/doorways/drw_437303389773103967/
Example Response
{
"id": "drw_437303389773103967",
"sensor_serial_number": "Z458467949888405826",
"name": "Conference Room Door",
"description": "The doorway to the Conference Room (inside the Office)",
"spaces": [
{
"id": "spc_439805443284402880",
"name": "Conference Room",
"sensor_placement": 1
}
],
"tags": [
"tech_garden"
],
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z",
"multipoint": false
}
Update Doorway
Update a doorway.
PUT /doorways/:doorway_id/
Request Body
name
string
A unique name for the doorway.
description
string
A description for the doorway.
sensor_serial_number
string
The serial_number of the sensor attached to this doorway, if any.
Example Request
curl -X PUT \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"name": "Conference Room Door (Updated)"
}' \
https://api.density.io/v2\
/doorways/drw_437303389773103967/
Example Response
{
"id": "drw_437303389773103967",
"sensor_serial_number": "Z458467949888405826",
"name": "Conference Room Door (Updated)",
"description": "The doorway to the Conference Room (inside the Office)",
"spaces": [
{
"id": "spc_439805443284402880",
"name": "Conference Room",
"sensor_placement": 1
}
],
"tags": [
"tech_garden"
],
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z",
"multipoint": false
}
Delete Doorway
Delete a doorway from your environment.
DELETE /doorways/:doorway_id/
Example Request
curl -X DELETE \
-H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/doorways/drw_458687903724209131/
Tag Doorway
Tag a doorway.
POST /doorways/:doorway_id/tags/
Request Body
* tag_name
required | string
The tag name. Alphanumeric characters, underscore or minus sign only.
Example Request
curl -X POST \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"tag_name": "tech_garden"
}' \
https://api.density.io/v2\
/doorways/drw_437303389773103967/tags/
Example Response
{
"tag_name": "tech_garden"
}
Untag Doorway
Untag a doorway.
DELETE /doorways/:doorway_id/tags/:tag_name/
Example Request
curl -X DELETE \
-H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/doorways/drw_437303389773103967/tags/tech_garden/
Tags
A tag is a text slug (alphanumeric, dash, or underscore only) that can be added to any space or doorway. Tags provide an easy mechanism for filtering and organizing spaces and doorways.
To tag or untag a space or doorway, use the endpoints in the space and doorway sections above.
List Tags
Index of all tags for an account.
GET /tags/
Example Request
$ curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/tags/
Example Response
{
"total": 1,
"next": null,
"previous": null,
"results": [
{
"name": "tech_garden"
},
{
"name": "real_estate"
}
]
}
Get Tag
List all spaces and doorways for a single tag. Note that additional details must be queried for each individual item.
GET /tags/:tag_name/
Example Request
$ curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/tags/tech_garden/
Example Response
{
"name": "tech_garden",
"spaces": [
{
"id": "spc_439805443284402880",
"name": "Conference Room",
"current_count": 3
},
{
"id": "spc_452554024357462439",
"name": "Office",
"current_count": 7
},
{
"id": "spc_458687913710846960",
"name": "Kitchen (Updated)",
"current_count": 1
}
],
"doorways": [
{
"id": "drw_437303389773103967",
"name": "Conference Room Door (Updated)"
},
{
"id": "drw_452554070478029236",
"name": "Office Door"
},
{
"id": "drw_458687903724209131",
"name": "Kitchen Door"
}
]
}
Time Segments
A time segment is a named timeframe that occurs between set start and stop times on the selected days of the week. Time segments can be linked to one or more spaces. Time segments are inherited: if a parent space is linked to a time segment, all of its children spaces are also linked to that time segment.
The start and end times will be converted to each space's timezone when being used to filter events and counts.
List Time Segments
Returns all time segments that exist for your account.
GET /time_segments/
Example Request
$ curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/time_segments/
Example Response
{
"total": 2,
"next": null,
"previous": null,
"results": [
{
"id": "tsm_579017521479286820",
"label": "Early Lunch",
"start": "11:00:00",
"end": "12:00:00",
"spaces": [
{
"space_id": "spc_578330564667375651",
"name": "Downstairs Kitchen"
}
],
"days": [
"Monday",
"Wednesday",
"Friday"
]
},
{
"id": "tsm_578329221793841160",
"label": "Late Lunch",
"start": "12:00:00",
"end": "13:00:00",
"spaces": [
{
"space_id": "spc_578329003530649603",
"name": "Main Cafe"
}
],
"days": [
"Monday",
"Tuesday",
"Wednesday",
"Thursday",
"Friday"
]
}
]
}
Get Time Segment
Detail information about a time segment.
GET /time_segments/
Example Request
$ curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/time_segments/tsm_579017521479286820
Example Response
{
"id": "tsm_579017521479286820",
"label": "Early Lunch",
"start": "11:00:00",
"end": "12:00:00",
"spaces": [
{
"space_id": "spc_578330564667375651",
"name": "Downstairs Kitchen"
}
],
"days": [
"Monday",
"Wednesday",
"Friday"
]
}
Create Time Segment
Add a new time segment to your organization. Returns the resulting time segment object with its assigned ID.
POST /time_segments/:time_segment_id
Request Body
* label
required | string
The name of the time segment.
* start
required | string
A 24-hour time in the local time zone. This is the time of day the segment starts.
* end
required | string
A 24-hour time in the local time zone. This is the time of day the segment ends.
* days
required | array
Days of the week that the time segment is "on". Must be capitalized.
* spaces
required | array
List of existing space IDs to connect with this time segment.
Example Request
curl --request POST \
-H 'authorization: Bearer YOUR_API_TOKEN' \
-H 'content-type: application/json' \
-d '{
"label": "Early Lunch",
"start": "11:00:00",
"end": "12:00:00",
"days": [
"Monday",
"Wednesday",
"Friday"
],
"spaces": [
"spc_578330564667375651"
]
}' \
http://api.density.io/v2/time_segments/
Example Response
{
"id": "tsm_579017521479286820",
"label": "Early Lunch",
"start": "11:00:00",
"end": "12:00:00",
"spaces": [
{
"space_id": "spc_578330564667375651",
"name": "Downstairs Kitchen"
}
],
"days": [
"Monday",
"Wednesday",
"Friday"
]
}
Update Time Segment
Update an existing time segment.
PUT /time_segments/:time_segment_id/
Request Body
label
string
The name of the time segment.
start
string
A 24-hour time in the local time zone. This is the time of day the segment starts.
end
string
A 24-hour time in the local time zone. This is the time of day the segment ends.
days
array
Days of the week that the time segment is "on". Must be capitalized.
spaces
array
List of existing space IDs to connect with this time segment.
Example Request
curl -X PUT \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"label": "Early Lunch on Weekends",
"days": [
"Sunday",
"Saturday"
]
}' \
https://api.density.io/v2\
/time_segments/tsm_579017521479286820/
Example Response
{
"id": "tsm_579017521479286820",
"label": "Early Lunch on Weekends",
"start": "11:00:00",
"end": "12:00:00",
"spaces": [
{
"space_id": "spc_578330564667375651",
"name": "Downstairs Kitchen"
}
],
"days": [
"Sunday",
"Saturday"
]
}
Delete Time Segment
Delete a time segment.
Warning: This action cannot be undone
DELETE /time_segments/:time_segment_id/
Example Request
curl -X DELETE \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/time_segments/tsm_579017521479286820/
Sensors
A Density sensor is the physical hardware module that is mounted above a doorway. Each active doorway must have a sensor associated with it. Density sensors will be automatically updated with their current status.
List Sensors
List sensors in your environment.
GET /sensors/
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/sensors/
Example Response
{
"total": 2,
"next": null,
"previous": null,
"results": [
{
"uuid": "50d76b5a-98a2-4d73-8032-b772dc469bf3",
"organization_id": "org_241255233743740000",
"serial_number": "Z458914847325684272",
"doorway_id": "drw_458687903724209131",
"doorway_name": "Conference Room Door",
"sensor_type": "s5",
"status": "online",
"last_heartbeat": "2016-09-19T15:45:00",
"current_disposition": "LIVE",
"network_addresses": [
{
"if": "wlan0",
"family": "ipv4",
"mac": "88:3f:4a:00:00:01",
"address": "192.168.1.7"
}
],
"firmware_version": "6966-35a94c6-shiny-tracking-engine-s5_1g-internal",
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z"
},
{
"uuid": "50d76b5a-98a2-4d73-8032-b772dc469bf3",
"organization_id": "org_241255233743740000",
"serial_number": "A0DJZ003",
"doorway_id": "drw_458687903724209131",
"doorway_name": "Kitchen Door",
"sensor_type": "s5",
"status": "online",
"last_heartbeat": "2016-09-19T15:45:00",
"current_disposition": "LIVE",
"network_addresses": [
{
"if": "wlan0",
"family": "ipv4",
"mac": "88:3f:4a:00:00:00",
"address": "192.168.1.2"
}
],
"firmware_version": "6966-35a94c6-shiny-tracking-engine-s5_1g-internal",
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z"
}
]
}
Get Sensor
View the current status of a sensor.
GET /sensors/:serial_number/
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/sensors/Z458914847325684272/
Example Response
{
"uuid": "50d76b5a-98a2-4d73-8032-b772dc469bf3",
"organization_id": "org_241255233743740000",
"doorway_id": "drw_458687903724209131",
"doorway_name": "Kitchen Door",
"sensor_type": "s5",
"status": "online",
"last_heartbeat": "2016-09-19T15:45:00",
"current_disposition": "LIVE",
"network_addresses": [
{
"if": "wlan0",
"family": "ipv4",
"mac": "88:3f:4a:00:00:00",
"address": "192.168.1.2"
}
],
"firmware_version": "6966-35a94c6-shiny-tracking-engine-s5_1g-internal",
"created_at": "2018-09-01T17:45:13.356Z",
"updated_at": "2018-09-01T17:45:13.356Z"
}
Webhooks
A webhook subscription allows you to receive a callback to a specified endpoint on your own server. Density webhooks will be triggered after every event we receive from any of your sensors (called a count event).
If a sensor is tied to multiple spaces, you will receive an event for each space.
List Webhooks
List webhooks in your environment.
GET /webhooks/
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/webhooks/
Example Response
{
"total": 1,
"next": null,
"previous": null,
"results": [
{
"id": "whk_579139973911937061",
"name": null,
"description": null,
"endpoint": "https://example.com/some-action/",
"version": "v2",
"headers": {},
"enabled": true,
"type": "counts"
}
]
}
Create Webhook
Add a new webhook to your environment.
POST /webhooks/
Request Body
* endpoint
required | string
The URL to which Density will send event data.
headers
array
An object containing header/value pairs used when POSTing.
name
string
The name of this webhook.
description
string
The description of this webhook.
Example Request
curl -X POST \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"endpoint": "https://your-website.com/webhook_action/",
"headers": {
"Authorization": "Bearer xyzzy"
}
}' \
https://api.density.io/v2/webhooks/
Example Response
{
"id": "whk_579141278554390567",
"name": null,
"description": null,
"endpoint": "https://your-website.com/webhook_action/",
"version": "v2",
"headers": {
"Authorization": "Bearer xyzzy"
}
}
Get Webhook
Detailed information about a webhook.
GET /webhooks/:webhook_id/
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/webhooks/whk_579141278554390567/
Example Response
{
"id": "whk_579141278554390567",
"name": null,
"description": null,
"endpoint": "https://your-website.com/webhook_action/",
"version": "v2",
"headers": {
"Authorization": "Bearer xyzzy"
},
"enabled": true,
"type": "counts"
}
Update Webhook
Update a webhook.
PUT /webhooks/:webhook_id/
Request Body
endpoint
string
The URL to which Density will send event data.
headers
array
An object containing header/value pairs.
name
string
The name of this webhook.
description
string
The description of this webhook.
Example Request
curl -X PUT \
-H "Content-Type: application/json" \
-H "Authorization: Bearer YOUR_API_TOKEN" \
-d '{
"endpoint": "https://some-website.com/other_endpoint"
}' \
https://api.density.io/v2\
/webhooks/whk_579141278554390567/
Example Response
{
"id": "whk_579141278554390567",
"name": null,
"description": null,
"endpoint": "https://your-website.com/other_endpoint/",
"version": "v2",
"headers": {
"Authorization": "Bearer xyzzy"
},
"enabled": true,
"type": "counts"
}
}
Delete Webhook
Delete a webhook from your environment.
DELETE /webhooks/:webhook_id/
Example Request
curl -X DELETE \
-H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2\
/webhooks/whk_458914869530329656/
Webhook Payload (Count)
When a count event is POSTed to your webhook, the JSON data will resemble the space and sensor events in previous sections. It will have additional information: the current count for the associated space and the ID of the space itself. The direction field will be 1 for entrance, -1 for exit.
If any additional headers are configured for the webhook, they will be included with the POST request.
Example of Webhook Data Received
A single event occurring at a doorway connected to two spaces
{
"timestamp": "2018-09-19T01:02:03.001Z",
"space_id": "spc_439805443284402880",
"doorway_id": "drw_437303389773103967",
"organization_id": "org_123",
"organization_name": "Density",
"direction": 1,
"count": 32
}
{
"timestamp": "2018-09-19T01:02:03.001Z",
"space_id": "spc_439805443284402881",
"doorway_id": "drw_437303389773103967",
"organization_id": "org_123",
"organization_name": "Density",
"direction": -1,
"count": 104
}
Websockets
Using Density for a real-time use-case is easy with websockets. Websockets allow you to open a secure connection to our server and stream count data and events (entrances and exits) in real-time to your application.
This approach is the preferred method versus polling the API every few seconds.
Connecting to our websocket server is a two-step process.
1. Obtain a secure Websocket URL from our API
2. Connect to the Websocket stream from your client
Connecting
Create a new websocket connection. The ttl indicates how long the new socket URL is valid. In this case, the socket connection must be opened in the next 5 minutes (300 seconds).
POST /sockets
Example Request
curl -X POST -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/sockets
Example Response
{
"url":"wss://sockets.density.io:8443/v2/?code=skc_fQhnu2a",
"ttl":300
}
Streaming Websockets
There are a number of open-source clients that manage websocket connections. Here are some that we recommend:
Websocket events are in the following JSON format:
Example Response
{
"payload": {
"count": 0,
"direction": -1,
"event_id": "evt_643916192641188838",
"space_id": "spc_578610575982985330",
"timestamp": "2019-03-18T20:53:03.647Z",
"type": "count"
},
"request_id": "5245250ce4a447e18f513b1863c80ea0",
"version": "v2"
}
Open Area [Developer Preview]
Using Density’s Open Area API, you can understand how people use any open space covered by an Open Area sensor. You can now send API requests to check occupancy status for your Areas.
List Area Occupancy Statuses
List the occupancy statuses of areas in a floorplan. When presence is true, that means a space is currently occupied. When false that space is un-occupied. Status changes may experience a short delay when updating in the API.
GET /floorplans/:floorplan_id/areas/status
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/floorplans/pln_123456791013/areas/status
Example Response
{
"timestamp": "2021-07-14T17:46:08.679092+00:00",
"areas": [
{
"area_id": "are_810556563837651411",
"presence": true
}
]
}
Get Area Occupancy Status
Get the status of a single area. When presence is true, that means a space is currently occupied. When false that space is un-occupied. Status changes may experience a short delay when updating in the API.
GET /floorplans/:floorplan_id/areas/:area_id/status
Example Request
curl -H "Authorization: Bearer YOUR_API_TOKEN" \
https://api.density.io/v2/floorplans/pln_123456791013/areas/are_810556563837651411/status/
Example Response
{
"timestamp": "2021-08-10T14:21:32.763370+00:00",
"presence": true,
}
|
{
"url": "https://docs.density.io/v2/",
"source_domain": "docs.density.io",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "245660",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XOPDT5WZ62DNLIDURLHGDNTHG4CKA7MZ",
"WARC-Concurrent-To": "<urn:uuid:c5b98669-3591-4a7b-af6d-1994452bcf08>",
"WARC-Date": "2022-09-26T02:28:49Z",
"WARC-IP-Address": "18.165.98.70",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BIO5CXIS7KUCVJO5Y4GI3L4RQVFF66WS",
"WARC-Record-ID": "<urn:uuid:fb41d2a0-9336-4204-80c1-87b165dd8ef7>",
"WARC-Target-URI": "https://docs.density.io/v2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6631ff63-cc56-4084-aba3-c8dbe8d352d3>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-62\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
9,
10,
22,
23,
121,
122,
462,
463,
472,
473,
499,
500,
515,
516,
598,
599,
832,
833,
859,
860,
897,
898,
905,
906,
1021,
1022,
1034,
1035,
1051,
1052,
1154,
1155,
1169,
1170,
1270,
1271,
1285,
1286,
1325,
1326,
1339,
1340,
1384,
1385,
1407,
1408,
1483,
1484,
1495,
1496,
1730,
1731,
1742,
1743,
1833,
1834,
2093,
2094,
2118,
2119,
2124,
2132,
2143,
2144,
2209,
2210,
2220,
2228,
2241,
2242,
2331,
2332,
2348,
2349,
2400,
2456,
2457,
2476,
2477,
2479,
2494,
2561,
2632,
2647,
2653,
2657,
2659,
2660,
2671,
2672,
2796,
2797,
2916,
2917,
3087,
3088,
3104,
3105,
3154,
3178,
3205,
3245,
3283,
3318,
3319,
3332,
3333,
3388,
3481,
3575,
3579,
3580,
3591,
3592,
3766,
3767,
3857,
3858,
3881,
3882,
3907,
3908,
3926,
3927,
4119,
4120,
4326,
4327,
4472,
4473,
4485,
4486,
4805,
4806,
4902,
4903,
5058,
5059,
5306,
5307,
5320,
5321,
5345,
5346,
5357,
5358,
5420,
5421,
5437,
5438,
5487,
5521,
5522,
5539,
5540,
5542,
5556,
5572,
5592,
5607,
5613,
5651,
5681,
5710,
5726,
5765,
5774,
5809,
5834,
5866,
5890,
5929,
5956,
5982,
6004,
6035,
6064,
6099,
6135,
6168,
6190,
6208,
6270,
6294,
6319,
6354,
6384,
6411,
6439,
6466,
6499,
6524,
6554,
6581,
6618,
6646,
6672,
6697,
6745,
6793,
6818,
6856,
6863,
6869,
6907,
6936,
6955,
6980,
7025,
7045,
7055,
7097,
7130,
7140,
7149,
7178,
7206,
7245,
7272,
7299,
7321,
7352,
7381,
7416,
7452,
7485,
7507,
7525,
7548,
7572,
7597,
7632,
7662,
7689,
7717,
7744,
7777,
7802,
7832,
7859,
7896,
7924,
7950,
7975,
8023,
8071,
8096,
8134,
8140,
8144,
8146,
8147,
8160,
8161,
8793,
8794,
8919,
8920,
9005,
9006,
9036,
9037,
9061,
9062,
9075,
9093,
9094,
9184,
9185,
9196,
9214,
9215,
9311,
9312,
9321,
9330,
9342,
9343,
9496,
9497,
9503,
9515,
9528,
9529,
9601,
9602,
9616,
9647,
9648,
9721,
9722,
9742,
9773,
9774,
9853,
9854,
9870,
9871,
9920,
9947,
9987,
10021,
10053,
10092,
10130,
10131,
10148,
10149,
10151,
10165,
10181,
10201,
10216,
10235,
10254,
10276,
10292,
10312,
10360,
10368,
10375,
10390,
10409,
10431,
10447,
10467,
10515,
10523,
10530,
10545,
10567,
10582,
10602,
10650,
10659,
10674,
10694,
10742,
10750,
10757,
10785,
10808,
10827,
10846,
10867,
10891,
10916,
10941,
10966,
10974,
10980,
10985,
11000,
11006,
11053,
11071,
11091,
11136,
11179,
11202,
11222,
11242,
11265,
11291,
11313,
11344,
11382,
11411,
11438,
11448,
11456,
11463,
11469,
11516,
11534,
11554,
11599,
11642,
11665,
11685,
11705,
11729,
11755,
11777,
11808,
11846,
11875,
11902,
11912,
11920,
11926,
11930,
11932,
11933,
11946,
11947,
12106,
12107,
12137,
12138,
12162,
12163,
12176,
12194,
12195,
12280,
12281,
12290,
12297,
12310,
12311,
12390,
12391,
12402,
12409,
12410,
12451,
12452,
12462,
12470,
12471,
12515,
12516,
12522,
12534,
12547,
12548,
12621,
12622,
12636,
12667,
12668,
12741,
12742,
12762,
12793,
12794,
12873,
12874,
12890,
12891,
12940,
12967,
13007,
13041,
13072,
13073,
13090,
13091,
13093,
13109,
13125,
13145,
13160,
13166,
13204,
13257,
13303,
13350,
13372,
13379,
13385,
13423,
13476,
13522,
13569,
13590,
13597,
13605,
13609,
13611,
13612,
13622,
13623,
13717,
13718,
13732,
13733,
13892,
13893,
13962,
13963,
13979,
13980,
14029,
14056,
14096,
14130,
14162,
14176,
14191,
14192,
14209,
14210,
14212,
14228,
14244,
14264,
14279,
14298,
14317,
14339,
14355,
14375,
14423,
14431,
14438,
14453,
14472,
14494,
14510,
14530,
14578,
14586,
14593,
14608,
14630,
14645,
14665,
14713,
14722,
14737,
14757,
14805,
14813,
14820,
14848,
14871,
14890,
14909,
14930,
14954,
14979,
15004,
15029,
15037,
15043,
15048,
15063,
15069,
15116,
15134,
15154,
15199,
15242,
15265,
15285,
15305,
15328,
15354,
15376,
15407,
15445,
15474,
15501,
15511,
15519,
15526,
15533,
15537,
15539,
15540,
15556,
15557,
15758,
15759,
15856,
15857,
15873,
15874,
15923,
15950,
15990,
16024,
16056,
16070,
16083,
16084,
16101,
16102,
16104,
16118,
16134,
16154,
16169,
16188,
16207,
16229,
16245,
16266,
16314,
16322,
16329,
16344,
16363,
16385,
16401,
16422,
16470,
16478,
16485,
16500,
16522,
16537,
16557,
16605,
16614,
16629,
16649,
16697,
16705,
16712,
16740,
16763,
16782,
16801,
16822,
16846,
16871,
16896,
16921,
16929,
16935,
16940,
16955,
16961,
17008,
17026,
17046,
17091,
17134,
17157,
17177,
17198,
17223,
17251,
17274,
17284,
17292,
17299,
17307,
17311,
17313,
17314,
17331,
17332,
17477,
17478,
17548,
17549,
17565,
17566,
17615,
17642,
17682,
17716,
17748,
17763,
17779,
17780,
17797,
17798,
17800,
17816,
17832,
17852,
17867,
17873,
17911,
17964,
18010,
18057,
18079,
18086,
18094,
18098,
18100,
18101,
18115,
18116,
18323,
18324,
18407,
18408,
18427,
18428,
18679,
18680,
18742,
18743,
18779,
18780,
18804,
18805,
18818,
18836,
18837,
18922,
18923,
18932,
18939,
18952,
18953,
19036,
19037,
19048,
19056,
19057,
19226,
19227,
19233,
19245,
19258,
19259,
19331,
19332,
19348,
19349,
19398,
19425,
19463,
19496,
19527,
19528,
19545,
19546,
19548,
19562,
19578,
19598,
19613,
19619,
19657,
19703,
19756,
19803,
19825,
19832,
19838,
19876,
19922,
19975,
20022,
20045,
20051,
20055,
20057,
20058,
20073,
20074,
20166,
20167,
20239,
20240,
20277,
20278,
20291,
20292,
20305,
20324,
20325,
20479,
20480,
20490,
20497,
20510,
20511,
20592,
20593,
20609,
20610,
20625,
20663,
20707,
20713,
20758,
20778,
20783,
20810,
20847,
20848,
20865,
20866,
20974,
20975,
20982,
20983,
21122,
21123,
21367,
21368,
21380,
21381,
21478,
21479,
21509,
21510,
21534,
21535,
21548,
21566,
21567,
21652,
21653,
21662,
21669,
21682,
21683,
21766,
21767,
21783,
21784,
21833,
21860,
21900,
21943,
21944,
21961,
21962,
21964,
21978,
21994,
22014,
22029,
22035,
22073,
22117,
22159,
22177,
22204,
22210,
22214,
22216,
22217,
22229,
22230,
22336,
22337,
22368,
22369,
22382,
22383,
22389,
22397,
22408,
22409,
22440,
22441,
22451,
22458,
22471,
22472,
22545,
22546,
22553,
22554,
22731,
22732,
23017,
23018,
23050,
23051,
23071,
23081,
23094,
23105,
23106,
23136,
23137,
23157,
23172,
23181,
23199,
23219,
23235,
23251,
23267,
23275,
23287,
23295,
23307,
23318,
23335,
23346,
23362,
23383,
23397,
23410,
23421,
23433,
23451,
23452,
23621,
23622,
23658,
23659,
23715,
23772,
23843,
23886,
23887,
23930,
23931,
24154,
24155,
24299,
24644,
24845,
24846,
24981,
24982,
25145,
25146,
25156,
25157,
25366,
25367,
25463,
25464,
25487,
25488,
25504,
25505,
25554,
25581,
25613,
25614,
25631,
25632,
25634,
25668,
25697,
25725,
25737,
25772,
25777,
25811,
25852,
25868,
25874,
25912,
25936,
25943,
25949,
25987,
26016,
26022,
26027,
26052,
26085,
26103,
26130,
26155,
26186,
26218,
26247,
26282,
26308,
26330,
26346,
26352,
26390,
26418,
26461,
26489,
26495,
26500,
26512,
26530,
26535,
26593,
26613,
26634,
26665,
26691,
26714,
26738,
26759,
26765,
26803,
26835,
26862,
26887,
26903,
26921,
26940,
26961,
26981,
26998,
27006,
27012,
27017,
27044,
27050,
27088,
27116,
27122,
27127,
27148,
27174,
27197,
27230,
27254,
27276,
27297,
27341,
27385,
27419,
27421,
27422,
27435,
27436,
27575,
27576,
27590,
27591,
27604,
27605,
27612,
27630,
27631,
27654,
27655,
27661,
27668,
27669,
27692,
27693,
27698,
27703,
27704,
27751,
27752,
27762,
27769,
27770,
27814,
27815,
27824,
27832,
27833,
27897,
27898,
27914,
27922,
27923,
27980,
27981,
27995,
28003,
28004,
28141,
28142,
28162,
28169,
28170,
28280,
28281,
28302,
28308,
28309,
28444,
28445,
28457,
28464,
28465,
28615,
28616,
28627,
28634,
28635,
28696,
28697,
28706,
28713,
28714,
28990,
28991,
29001,
29008,
29009,
29055,
29056,
29064,
29071,
29072,
29101,
29102,
29114,
29120,
29121,
29200,
29201,
29222,
29229,
29230,
29291,
29292,
29302,
29308,
29309,
29332,
29333,
29348,
29355,
29356,
29419,
29420,
29429,
29435,
29436,
29468,
29469,
29479,
29485,
29486,
29519,
29520,
29536,
29537,
29552,
29590,
29634,
29640,
29663,
29694,
29721,
29726,
29760,
29761,
29778,
29779,
29781,
29815,
29836,
29851,
29867,
29892,
29912,
29947,
29973,
29995,
30015,
30042,
30067,
30098,
30130,
30159,
30180,
30198,
30217,
30237,
30258,
30289,
30315,
30338,
30362,
30380,
30394,
30417,
30446,
30467,
30493,
30516,
30549,
30573,
30595,
30616,
30660,
30704,
30725,
30759,
30761,
30762,
30775,
30776,
30792,
30793,
30816,
30817,
30830,
30831,
30836,
30843,
30844,
30867,
30868,
30874,
30881,
30882,
30905,
30906,
30911,
30916,
30917,
30964,
30965,
30975,
30982,
30983,
31027,
31028,
31037,
31045,
31046,
31110,
31111,
31127,
31135,
31136,
31193,
31194,
31208,
31216,
31217,
31354,
31355,
31375,
31382,
31383,
31493,
31494,
31515,
31521,
31522,
31657,
31658,
31670,
31677,
31678,
31828,
31829,
31840,
31847,
31848,
31909,
31910,
31919,
31926,
31927,
32203,
32204,
32214,
32221,
32222,
32268,
32269,
32277,
32284,
32285,
32314,
32315,
32327,
32333,
32334,
32413,
32414,
32435,
32442,
32443,
32504,
32505,
32515,
32521,
32522,
32545,
32546,
32561,
32568,
32569,
32632,
32633,
32642,
32648,
32649,
32681,
32682,
32692,
32698,
32699,
32732,
32733,
32749,
32750,
32764,
32802,
32846,
32852,
32879,
32907,
32926,
32931,
32958,
32990,
32991,
33008,
33009,
33011,
33045,
33070,
33110,
33122,
33157,
33162,
33208,
33236,
33257,
33295,
33321,
33343,
33362,
33387,
33410,
33452,
33483,
33511,
33532,
33550,
33569,
33589,
33610,
33641,
33667,
33690,
33714,
33732,
33746,
33769,
33798,
33819,
33854,
33883,
33916,
33940,
33962,
33983,
34027,
34071,
34105,
34107,
34108,
34121,
34122,
34234,
34235,
34312,
34313,
34339,
34340,
34353,
34354,
34361,
34379,
34380,
34435,
34436,
34452,
34453,
34470,
34508,
34552,
34558,
34590,
34595,
34622,
34654,
34655,
34665,
34666,
34679,
34680,
34709,
34710,
34723,
34724,
34735,
34753,
34754,
34824,
34825,
34841,
34842,
34857,
34895,
34939,
34945,
34975,
34980,
35042,
35043,
35060,
35061,
35063,
35091,
35093,
35094,
35106,
35107,
35122,
35123,
35164,
35165,
35181,
35182,
35199,
35243,
35270,
35319,
35320,
35341,
35342,
35368,
35369,
35408,
35409,
35422,
35423,
35435,
35453,
35454,
35469,
35470,
35486,
35487,
35502,
35540,
35584,
35590,
35612,
35617,
35689,
35690,
35707,
35708,
35710,
35744,
35764,
35766,
35767,
35790,
35791,
35819,
35820,
35879,
35880,
35896,
35897,
35914,
35958,
35985,
36055,
36056,
36065,
36066,
36346,
36347,
36524,
36525,
36574,
36575,
36589,
36590,
36624,
36625,
36640,
36641,
36665,
36666,
36675,
36676,
36738,
36739,
36755,
36756,
36805,
36841,
36842,
36859,
36860,
36862,
36876,
36892,
36912,
36927,
36933,
36971,
37024,
37062,
37080,
37090,
37132,
37163,
37210,
37242,
37252,
37261,
37277,
37299,
37308,
37356,
37403,
37410,
37416,
37454,
37507,
37536,
37552,
37574,
37583,
37601,
37611,
37653,
37685,
37731,
37763,
37773,
37782,
37830,
37877,
37883,
37888,
37890,
37891,
37906,
37907,
37946,
37947,
37963,
37964,
37977,
37978,
37985,
38003,
38004,
38035,
38036,
38048,
38055,
38056,
38087,
38088,
38109,
38116,
38117,
38183,
38184,
38200,
38201,
38216,
38254,
38298,
38304,
38332,
38380,
38385,
38421,
38422,
38439,
38440,
38442,
38476,
38508,
38534,
38581,
38597,
38611,
38655,
38699,
38721,
38723,
38724,
38736,
38737,
39125,
39126,
39153,
39154,
39170,
39171,
39220,
39247,
39281,
39282,
39299,
39300,
39302,
39336,
39385,
39419,
39494,
39508,
39514,
39552,
39585,
39613,
39619,
39624,
39636,
39654,
39659,
39703,
39747,
39769,
39771,
39772,
39787,
39788,
39806,
39807,
39834,
39835,
39848,
39849,
39854,
39861,
39862,
39893,
39894,
39906,
39913,
39914,
39945,
39946,
39967,
39974,
39975,
40041,
40042,
40058,
40059,
40073,
40111,
40155,
40161,
40206,
40211,
40238,
40272,
40273,
40290,
40291,
40293,
40327,
40376,
40420,
40495,
40509,
40515,
40553,
40586,
40614,
40620,
40625,
40637,
40655,
40660,
40704,
40748,
40770,
40772,
40773,
40788,
40789,
40829,
40830,
40860,
40861,
40877,
40878,
40895,
40939,
40966,
41000,
41001,
41013,
41014,
41029,
41030,
41063,
41064,
41077,
41078,
41089,
41107,
41108,
41178,
41179,
41195,
41196,
41211,
41249,
41293,
41299,
41329,
41334,
41361,
41400,
41401,
41418,
41419,
41421,
41449,
41451,
41452,
41466,
41467,
41484,
41485,
41530,
41531,
41547,
41548,
41565,
41609,
41636,
41687,
41688,
41693,
41694,
41880,
41881,
41976,
41977,
41987,
41988,
42022,
42023,
42034,
42035,
42051,
42052,
42104,
42138,
42139,
42156,
42157,
42159,
42173,
42189,
42209,
42224,
42230,
42258,
42265,
42271,
42299,
42305,
42309,
42311,
42312,
42320,
42321,
42439,
42440,
42461,
42462,
42478,
42479,
42530,
42576,
42577,
42594,
42595,
42597,
42622,
42636,
42642,
42680,
42713,
42738,
42745,
42751,
42789,
42813,
42838,
42845,
42851,
42889,
42924,
42949,
42955,
42960,
42976,
42982,
43020,
43067,
43074,
43080,
43118,
43146,
43153,
43159,
43197,
43226,
43232,
43236,
43238,
43239,
43253,
43254,
43561,
43562,
43674,
43675,
43694,
43695,
43750,
43751,
43771,
43772,
43788,
43789,
43840,
43883,
43884,
43901,
43902,
43904,
43920,
43938,
43960,
43977,
43987,
44031,
44067,
44100,
44131,
44155,
44173,
44231,
44280,
44298,
44313,
44335,
44361,
44390,
44415,
44429,
44440,
44450,
44494,
44529,
44562,
44593,
44617,
44635,
44693,
44733,
44751,
44766,
44788,
44814,
44841,
44870,
44898,
44923,
44937,
44947,
44953,
44955,
44956,
44973,
44974,
45015,
45016,
45036,
45037,
45053,
45054,
45105,
45170,
45171,
45188,
45189,
45191,
45192,
45224,
45248,
45269,
45288,
45300,
45306,
45352,
45389,
45395,
45398,
45408,
45422,
45439,
45452,
45466,
45468,
45469,
45489,
45490,
45599,
45600,
45637,
45638,
45651,
45652,
45660,
45678,
45679,
45709,
45710,
45718,
45736,
45737,
45820,
45821,
45827,
45845,
45846,
45927,
45928,
45935,
45952,
45953,
46022,
46023,
46032,
46049,
46050,
46112,
46113,
46129,
46130,
46152,
46198,
46238,
46246,
46272,
46295,
46316,
46328,
46342,
46359,
46372,
46377,
46391,
46420,
46424,
46429,
46469,
46470,
46487,
46488,
46490,
46524,
46550,
46573,
46594,
46608,
46614,
46658,
46693,
46699,
46704,
46716,
46730,
46747,
46760,
46764,
46766,
46767,
46787,
46788,
46821,
46822,
46859,
46860,
46873,
46874,
46880,
46887,
46888,
46918,
46919,
46925,
46932,
46933,
47016,
47017,
47021,
47028,
47029,
47110,
47111,
47116,
47122,
47123,
47192,
47193,
47200,
47206,
47207,
47269,
47270,
47286,
47287,
47301,
47339,
47383,
47389,
47427,
47439,
47453,
47468,
47472,
47477,
47504,
47543,
47544,
47561,
47562,
47564,
47598,
47636,
47659,
47680,
47694,
47700,
47744,
47779,
47785,
47790,
47802,
47816,
47831,
47835,
47837,
47838,
47858,
47859,
47882,
47883,
47921,
47922,
47962,
47963,
47979,
47980,
47997,
48035,
48079,
48106,
48145,
48146,
48154,
48155,
48369,
48370,
48383,
48384,
48418,
48419,
48433,
48434,
48450,
48451,
48500,
48535,
48536,
48553,
48554,
48556,
48570,
48586,
48606,
48621,
48627,
48681,
48732,
48778,
48824,
48870,
48897,
48923,
48970,
49007,
49036,
49048,
49077,
49109,
49151,
49190,
49202,
49211,
49290,
49338,
49385,
49392,
49398,
49452,
49503,
49538,
49584,
49622,
49649,
49675,
49722,
49759,
49788,
49800,
49829,
49861,
49903,
49942,
49954,
49963,
50042,
50090,
50137,
50143,
50147,
50149,
50150,
50161,
50162,
50199,
50200,
50229,
50230,
50246,
50247,
50296,
50323,
50353,
50354,
50371,
50372,
50374,
50424,
50471,
50513,
50547,
50570,
50592,
50635,
50668,
50693,
50701,
50726,
50754,
50792,
50827,
50835,
50840,
50915,
50959,
51002,
51004,
51005,
51014,
51015,
51228,
51229,
51311,
51312,
51326,
51327,
51362,
51363,
51378,
51379,
51395,
51396,
51445,
51481,
51482,
51499,
51500,
51502,
51518,
51536,
51558,
51575,
51585,
51629,
51655,
51688,
51748,
51777,
51804,
51833,
51862,
51872,
51878,
51880,
51881,
51896,
51897,
51936,
51937,
51953,
51954,
51967,
51968,
51979,
51997,
51998,
52045,
52046,
52054,
52060,
52061,
52120,
52121,
52126,
52133,
52134,
52160,
52161,
52173,
52180,
52181,
52214,
52215,
52231,
52232,
52247,
52285,
52329,
52335,
52395,
52412,
52452,
52458,
52463,
52499,
52500,
52517,
52518,
52520,
52556,
52574,
52599,
52659,
52680,
52697,
52737,
52743,
52745,
52746,
52758,
52759,
52797,
52798,
52825,
52826,
52842,
52843,
52892,
52919,
52953,
52954,
52971,
52972,
52974,
53010,
53028,
53053,
53113,
53134,
53151,
53191,
53198,
53219,
53240,
53242,
53243,
53258,
53259,
53277,
53278,
53305,
53306,
53319,
53320,
53329,
53336,
53337,
53384,
53385,
53393,
53399,
53400,
53441,
53442,
53447,
53454,
53455,
53481,
53482,
53494,
53501,
53502,
53535,
53536,
53552,
53553,
53567,
53605,
53649,
53655,
53713,
53718,
53745,
53779,
53780,
53797,
53798,
53800,
53836,
53854,
53879,
53939,
53960,
53977,
54017,
54024,
54045,
54066,
54068,
54070,
54071,
54086,
54087,
54127,
54128,
54158,
54159,
54175,
54176,
54193,
54237,
54264,
54298,
54299,
54323,
54324,
54617,
54618,
54721,
54722,
54755,
54756,
54818,
54819,
54821,
54864,
54904,
54946,
54978,
55012,
55030,
55044,
55046,
55048,
55091,
55131,
55173,
55205,
55239,
55258,
55273,
55275,
55276,
55287,
55288,
55504,
55505,
55585,
55586,
55644,
55645,
55693,
55747,
55748,
55759,
55760,
55939,
55940,
55954,
55955,
55971,
55972,
56029,
56063,
56064,
56081,
56082,
56085,
56149,
56163,
56165,
56166,
56187,
56188,
56298,
56299,
56350,
56351,
56368,
56369,
56371,
56386,
56402,
56423,
56465,
56507,
56552,
56572,
56577,
56629,
56647,
56649,
56650,
56680,
56681,
56865,
56866,
56895,
56896,
57122,
57123,
57166,
57167,
57183,
57184,
57233,
57300,
57301,
57318,
57319,
57321,
57374,
57389,
57399,
57448,
57477,
57487,
57493,
57495,
57496,
57522,
57523,
57729,
57730,
57782,
57783,
57799,
57800,
57849,
57940,
57941,
57958,
57959,
57961,
58014,
58036
],
"line_end_idx": [
9,
10,
22,
23,
121,
122,
462,
463,
472,
473,
499,
500,
515,
516,
598,
599,
832,
833,
859,
860,
897,
898,
905,
906,
1021,
1022,
1034,
1035,
1051,
1052,
1154,
1155,
1169,
1170,
1270,
1271,
1285,
1286,
1325,
1326,
1339,
1340,
1384,
1385,
1407,
1408,
1483,
1484,
1495,
1496,
1730,
1731,
1742,
1743,
1833,
1834,
2093,
2094,
2118,
2119,
2124,
2132,
2143,
2144,
2209,
2210,
2220,
2228,
2241,
2242,
2331,
2332,
2348,
2349,
2400,
2456,
2457,
2476,
2477,
2479,
2494,
2561,
2632,
2647,
2653,
2657,
2659,
2660,
2671,
2672,
2796,
2797,
2916,
2917,
3087,
3088,
3104,
3105,
3154,
3178,
3205,
3245,
3283,
3318,
3319,
3332,
3333,
3388,
3481,
3575,
3579,
3580,
3591,
3592,
3766,
3767,
3857,
3858,
3881,
3882,
3907,
3908,
3926,
3927,
4119,
4120,
4326,
4327,
4472,
4473,
4485,
4486,
4805,
4806,
4902,
4903,
5058,
5059,
5306,
5307,
5320,
5321,
5345,
5346,
5357,
5358,
5420,
5421,
5437,
5438,
5487,
5521,
5522,
5539,
5540,
5542,
5556,
5572,
5592,
5607,
5613,
5651,
5681,
5710,
5726,
5765,
5774,
5809,
5834,
5866,
5890,
5929,
5956,
5982,
6004,
6035,
6064,
6099,
6135,
6168,
6190,
6208,
6270,
6294,
6319,
6354,
6384,
6411,
6439,
6466,
6499,
6524,
6554,
6581,
6618,
6646,
6672,
6697,
6745,
6793,
6818,
6856,
6863,
6869,
6907,
6936,
6955,
6980,
7025,
7045,
7055,
7097,
7130,
7140,
7149,
7178,
7206,
7245,
7272,
7299,
7321,
7352,
7381,
7416,
7452,
7485,
7507,
7525,
7548,
7572,
7597,
7632,
7662,
7689,
7717,
7744,
7777,
7802,
7832,
7859,
7896,
7924,
7950,
7975,
8023,
8071,
8096,
8134,
8140,
8144,
8146,
8147,
8160,
8161,
8793,
8794,
8919,
8920,
9005,
9006,
9036,
9037,
9061,
9062,
9075,
9093,
9094,
9184,
9185,
9196,
9214,
9215,
9311,
9312,
9321,
9330,
9342,
9343,
9496,
9497,
9503,
9515,
9528,
9529,
9601,
9602,
9616,
9647,
9648,
9721,
9722,
9742,
9773,
9774,
9853,
9854,
9870,
9871,
9920,
9947,
9987,
10021,
10053,
10092,
10130,
10131,
10148,
10149,
10151,
10165,
10181,
10201,
10216,
10235,
10254,
10276,
10292,
10312,
10360,
10368,
10375,
10390,
10409,
10431,
10447,
10467,
10515,
10523,
10530,
10545,
10567,
10582,
10602,
10650,
10659,
10674,
10694,
10742,
10750,
10757,
10785,
10808,
10827,
10846,
10867,
10891,
10916,
10941,
10966,
10974,
10980,
10985,
11000,
11006,
11053,
11071,
11091,
11136,
11179,
11202,
11222,
11242,
11265,
11291,
11313,
11344,
11382,
11411,
11438,
11448,
11456,
11463,
11469,
11516,
11534,
11554,
11599,
11642,
11665,
11685,
11705,
11729,
11755,
11777,
11808,
11846,
11875,
11902,
11912,
11920,
11926,
11930,
11932,
11933,
11946,
11947,
12106,
12107,
12137,
12138,
12162,
12163,
12176,
12194,
12195,
12280,
12281,
12290,
12297,
12310,
12311,
12390,
12391,
12402,
12409,
12410,
12451,
12452,
12462,
12470,
12471,
12515,
12516,
12522,
12534,
12547,
12548,
12621,
12622,
12636,
12667,
12668,
12741,
12742,
12762,
12793,
12794,
12873,
12874,
12890,
12891,
12940,
12967,
13007,
13041,
13072,
13073,
13090,
13091,
13093,
13109,
13125,
13145,
13160,
13166,
13204,
13257,
13303,
13350,
13372,
13379,
13385,
13423,
13476,
13522,
13569,
13590,
13597,
13605,
13609,
13611,
13612,
13622,
13623,
13717,
13718,
13732,
13733,
13892,
13893,
13962,
13963,
13979,
13980,
14029,
14056,
14096,
14130,
14162,
14176,
14191,
14192,
14209,
14210,
14212,
14228,
14244,
14264,
14279,
14298,
14317,
14339,
14355,
14375,
14423,
14431,
14438,
14453,
14472,
14494,
14510,
14530,
14578,
14586,
14593,
14608,
14630,
14645,
14665,
14713,
14722,
14737,
14757,
14805,
14813,
14820,
14848,
14871,
14890,
14909,
14930,
14954,
14979,
15004,
15029,
15037,
15043,
15048,
15063,
15069,
15116,
15134,
15154,
15199,
15242,
15265,
15285,
15305,
15328,
15354,
15376,
15407,
15445,
15474,
15501,
15511,
15519,
15526,
15533,
15537,
15539,
15540,
15556,
15557,
15758,
15759,
15856,
15857,
15873,
15874,
15923,
15950,
15990,
16024,
16056,
16070,
16083,
16084,
16101,
16102,
16104,
16118,
16134,
16154,
16169,
16188,
16207,
16229,
16245,
16266,
16314,
16322,
16329,
16344,
16363,
16385,
16401,
16422,
16470,
16478,
16485,
16500,
16522,
16537,
16557,
16605,
16614,
16629,
16649,
16697,
16705,
16712,
16740,
16763,
16782,
16801,
16822,
16846,
16871,
16896,
16921,
16929,
16935,
16940,
16955,
16961,
17008,
17026,
17046,
17091,
17134,
17157,
17177,
17198,
17223,
17251,
17274,
17284,
17292,
17299,
17307,
17311,
17313,
17314,
17331,
17332,
17477,
17478,
17548,
17549,
17565,
17566,
17615,
17642,
17682,
17716,
17748,
17763,
17779,
17780,
17797,
17798,
17800,
17816,
17832,
17852,
17867,
17873,
17911,
17964,
18010,
18057,
18079,
18086,
18094,
18098,
18100,
18101,
18115,
18116,
18323,
18324,
18407,
18408,
18427,
18428,
18679,
18680,
18742,
18743,
18779,
18780,
18804,
18805,
18818,
18836,
18837,
18922,
18923,
18932,
18939,
18952,
18953,
19036,
19037,
19048,
19056,
19057,
19226,
19227,
19233,
19245,
19258,
19259,
19331,
19332,
19348,
19349,
19398,
19425,
19463,
19496,
19527,
19528,
19545,
19546,
19548,
19562,
19578,
19598,
19613,
19619,
19657,
19703,
19756,
19803,
19825,
19832,
19838,
19876,
19922,
19975,
20022,
20045,
20051,
20055,
20057,
20058,
20073,
20074,
20166,
20167,
20239,
20240,
20277,
20278,
20291,
20292,
20305,
20324,
20325,
20479,
20480,
20490,
20497,
20510,
20511,
20592,
20593,
20609,
20610,
20625,
20663,
20707,
20713,
20758,
20778,
20783,
20810,
20847,
20848,
20865,
20866,
20974,
20975,
20982,
20983,
21122,
21123,
21367,
21368,
21380,
21381,
21478,
21479,
21509,
21510,
21534,
21535,
21548,
21566,
21567,
21652,
21653,
21662,
21669,
21682,
21683,
21766,
21767,
21783,
21784,
21833,
21860,
21900,
21943,
21944,
21961,
21962,
21964,
21978,
21994,
22014,
22029,
22035,
22073,
22117,
22159,
22177,
22204,
22210,
22214,
22216,
22217,
22229,
22230,
22336,
22337,
22368,
22369,
22382,
22383,
22389,
22397,
22408,
22409,
22440,
22441,
22451,
22458,
22471,
22472,
22545,
22546,
22553,
22554,
22731,
22732,
23017,
23018,
23050,
23051,
23071,
23081,
23094,
23105,
23106,
23136,
23137,
23157,
23172,
23181,
23199,
23219,
23235,
23251,
23267,
23275,
23287,
23295,
23307,
23318,
23335,
23346,
23362,
23383,
23397,
23410,
23421,
23433,
23451,
23452,
23621,
23622,
23658,
23659,
23715,
23772,
23843,
23886,
23887,
23930,
23931,
24154,
24155,
24299,
24644,
24845,
24846,
24981,
24982,
25145,
25146,
25156,
25157,
25366,
25367,
25463,
25464,
25487,
25488,
25504,
25505,
25554,
25581,
25613,
25614,
25631,
25632,
25634,
25668,
25697,
25725,
25737,
25772,
25777,
25811,
25852,
25868,
25874,
25912,
25936,
25943,
25949,
25987,
26016,
26022,
26027,
26052,
26085,
26103,
26130,
26155,
26186,
26218,
26247,
26282,
26308,
26330,
26346,
26352,
26390,
26418,
26461,
26489,
26495,
26500,
26512,
26530,
26535,
26593,
26613,
26634,
26665,
26691,
26714,
26738,
26759,
26765,
26803,
26835,
26862,
26887,
26903,
26921,
26940,
26961,
26981,
26998,
27006,
27012,
27017,
27044,
27050,
27088,
27116,
27122,
27127,
27148,
27174,
27197,
27230,
27254,
27276,
27297,
27341,
27385,
27419,
27421,
27422,
27435,
27436,
27575,
27576,
27590,
27591,
27604,
27605,
27612,
27630,
27631,
27654,
27655,
27661,
27668,
27669,
27692,
27693,
27698,
27703,
27704,
27751,
27752,
27762,
27769,
27770,
27814,
27815,
27824,
27832,
27833,
27897,
27898,
27914,
27922,
27923,
27980,
27981,
27995,
28003,
28004,
28141,
28142,
28162,
28169,
28170,
28280,
28281,
28302,
28308,
28309,
28444,
28445,
28457,
28464,
28465,
28615,
28616,
28627,
28634,
28635,
28696,
28697,
28706,
28713,
28714,
28990,
28991,
29001,
29008,
29009,
29055,
29056,
29064,
29071,
29072,
29101,
29102,
29114,
29120,
29121,
29200,
29201,
29222,
29229,
29230,
29291,
29292,
29302,
29308,
29309,
29332,
29333,
29348,
29355,
29356,
29419,
29420,
29429,
29435,
29436,
29468,
29469,
29479,
29485,
29486,
29519,
29520,
29536,
29537,
29552,
29590,
29634,
29640,
29663,
29694,
29721,
29726,
29760,
29761,
29778,
29779,
29781,
29815,
29836,
29851,
29867,
29892,
29912,
29947,
29973,
29995,
30015,
30042,
30067,
30098,
30130,
30159,
30180,
30198,
30217,
30237,
30258,
30289,
30315,
30338,
30362,
30380,
30394,
30417,
30446,
30467,
30493,
30516,
30549,
30573,
30595,
30616,
30660,
30704,
30725,
30759,
30761,
30762,
30775,
30776,
30792,
30793,
30816,
30817,
30830,
30831,
30836,
30843,
30844,
30867,
30868,
30874,
30881,
30882,
30905,
30906,
30911,
30916,
30917,
30964,
30965,
30975,
30982,
30983,
31027,
31028,
31037,
31045,
31046,
31110,
31111,
31127,
31135,
31136,
31193,
31194,
31208,
31216,
31217,
31354,
31355,
31375,
31382,
31383,
31493,
31494,
31515,
31521,
31522,
31657,
31658,
31670,
31677,
31678,
31828,
31829,
31840,
31847,
31848,
31909,
31910,
31919,
31926,
31927,
32203,
32204,
32214,
32221,
32222,
32268,
32269,
32277,
32284,
32285,
32314,
32315,
32327,
32333,
32334,
32413,
32414,
32435,
32442,
32443,
32504,
32505,
32515,
32521,
32522,
32545,
32546,
32561,
32568,
32569,
32632,
32633,
32642,
32648,
32649,
32681,
32682,
32692,
32698,
32699,
32732,
32733,
32749,
32750,
32764,
32802,
32846,
32852,
32879,
32907,
32926,
32931,
32958,
32990,
32991,
33008,
33009,
33011,
33045,
33070,
33110,
33122,
33157,
33162,
33208,
33236,
33257,
33295,
33321,
33343,
33362,
33387,
33410,
33452,
33483,
33511,
33532,
33550,
33569,
33589,
33610,
33641,
33667,
33690,
33714,
33732,
33746,
33769,
33798,
33819,
33854,
33883,
33916,
33940,
33962,
33983,
34027,
34071,
34105,
34107,
34108,
34121,
34122,
34234,
34235,
34312,
34313,
34339,
34340,
34353,
34354,
34361,
34379,
34380,
34435,
34436,
34452,
34453,
34470,
34508,
34552,
34558,
34590,
34595,
34622,
34654,
34655,
34665,
34666,
34679,
34680,
34709,
34710,
34723,
34724,
34735,
34753,
34754,
34824,
34825,
34841,
34842,
34857,
34895,
34939,
34945,
34975,
34980,
35042,
35043,
35060,
35061,
35063,
35091,
35093,
35094,
35106,
35107,
35122,
35123,
35164,
35165,
35181,
35182,
35199,
35243,
35270,
35319,
35320,
35341,
35342,
35368,
35369,
35408,
35409,
35422,
35423,
35435,
35453,
35454,
35469,
35470,
35486,
35487,
35502,
35540,
35584,
35590,
35612,
35617,
35689,
35690,
35707,
35708,
35710,
35744,
35764,
35766,
35767,
35790,
35791,
35819,
35820,
35879,
35880,
35896,
35897,
35914,
35958,
35985,
36055,
36056,
36065,
36066,
36346,
36347,
36524,
36525,
36574,
36575,
36589,
36590,
36624,
36625,
36640,
36641,
36665,
36666,
36675,
36676,
36738,
36739,
36755,
36756,
36805,
36841,
36842,
36859,
36860,
36862,
36876,
36892,
36912,
36927,
36933,
36971,
37024,
37062,
37080,
37090,
37132,
37163,
37210,
37242,
37252,
37261,
37277,
37299,
37308,
37356,
37403,
37410,
37416,
37454,
37507,
37536,
37552,
37574,
37583,
37601,
37611,
37653,
37685,
37731,
37763,
37773,
37782,
37830,
37877,
37883,
37888,
37890,
37891,
37906,
37907,
37946,
37947,
37963,
37964,
37977,
37978,
37985,
38003,
38004,
38035,
38036,
38048,
38055,
38056,
38087,
38088,
38109,
38116,
38117,
38183,
38184,
38200,
38201,
38216,
38254,
38298,
38304,
38332,
38380,
38385,
38421,
38422,
38439,
38440,
38442,
38476,
38508,
38534,
38581,
38597,
38611,
38655,
38699,
38721,
38723,
38724,
38736,
38737,
39125,
39126,
39153,
39154,
39170,
39171,
39220,
39247,
39281,
39282,
39299,
39300,
39302,
39336,
39385,
39419,
39494,
39508,
39514,
39552,
39585,
39613,
39619,
39624,
39636,
39654,
39659,
39703,
39747,
39769,
39771,
39772,
39787,
39788,
39806,
39807,
39834,
39835,
39848,
39849,
39854,
39861,
39862,
39893,
39894,
39906,
39913,
39914,
39945,
39946,
39967,
39974,
39975,
40041,
40042,
40058,
40059,
40073,
40111,
40155,
40161,
40206,
40211,
40238,
40272,
40273,
40290,
40291,
40293,
40327,
40376,
40420,
40495,
40509,
40515,
40553,
40586,
40614,
40620,
40625,
40637,
40655,
40660,
40704,
40748,
40770,
40772,
40773,
40788,
40789,
40829,
40830,
40860,
40861,
40877,
40878,
40895,
40939,
40966,
41000,
41001,
41013,
41014,
41029,
41030,
41063,
41064,
41077,
41078,
41089,
41107,
41108,
41178,
41179,
41195,
41196,
41211,
41249,
41293,
41299,
41329,
41334,
41361,
41400,
41401,
41418,
41419,
41421,
41449,
41451,
41452,
41466,
41467,
41484,
41485,
41530,
41531,
41547,
41548,
41565,
41609,
41636,
41687,
41688,
41693,
41694,
41880,
41881,
41976,
41977,
41987,
41988,
42022,
42023,
42034,
42035,
42051,
42052,
42104,
42138,
42139,
42156,
42157,
42159,
42173,
42189,
42209,
42224,
42230,
42258,
42265,
42271,
42299,
42305,
42309,
42311,
42312,
42320,
42321,
42439,
42440,
42461,
42462,
42478,
42479,
42530,
42576,
42577,
42594,
42595,
42597,
42622,
42636,
42642,
42680,
42713,
42738,
42745,
42751,
42789,
42813,
42838,
42845,
42851,
42889,
42924,
42949,
42955,
42960,
42976,
42982,
43020,
43067,
43074,
43080,
43118,
43146,
43153,
43159,
43197,
43226,
43232,
43236,
43238,
43239,
43253,
43254,
43561,
43562,
43674,
43675,
43694,
43695,
43750,
43751,
43771,
43772,
43788,
43789,
43840,
43883,
43884,
43901,
43902,
43904,
43920,
43938,
43960,
43977,
43987,
44031,
44067,
44100,
44131,
44155,
44173,
44231,
44280,
44298,
44313,
44335,
44361,
44390,
44415,
44429,
44440,
44450,
44494,
44529,
44562,
44593,
44617,
44635,
44693,
44733,
44751,
44766,
44788,
44814,
44841,
44870,
44898,
44923,
44937,
44947,
44953,
44955,
44956,
44973,
44974,
45015,
45016,
45036,
45037,
45053,
45054,
45105,
45170,
45171,
45188,
45189,
45191,
45192,
45224,
45248,
45269,
45288,
45300,
45306,
45352,
45389,
45395,
45398,
45408,
45422,
45439,
45452,
45466,
45468,
45469,
45489,
45490,
45599,
45600,
45637,
45638,
45651,
45652,
45660,
45678,
45679,
45709,
45710,
45718,
45736,
45737,
45820,
45821,
45827,
45845,
45846,
45927,
45928,
45935,
45952,
45953,
46022,
46023,
46032,
46049,
46050,
46112,
46113,
46129,
46130,
46152,
46198,
46238,
46246,
46272,
46295,
46316,
46328,
46342,
46359,
46372,
46377,
46391,
46420,
46424,
46429,
46469,
46470,
46487,
46488,
46490,
46524,
46550,
46573,
46594,
46608,
46614,
46658,
46693,
46699,
46704,
46716,
46730,
46747,
46760,
46764,
46766,
46767,
46787,
46788,
46821,
46822,
46859,
46860,
46873,
46874,
46880,
46887,
46888,
46918,
46919,
46925,
46932,
46933,
47016,
47017,
47021,
47028,
47029,
47110,
47111,
47116,
47122,
47123,
47192,
47193,
47200,
47206,
47207,
47269,
47270,
47286,
47287,
47301,
47339,
47383,
47389,
47427,
47439,
47453,
47468,
47472,
47477,
47504,
47543,
47544,
47561,
47562,
47564,
47598,
47636,
47659,
47680,
47694,
47700,
47744,
47779,
47785,
47790,
47802,
47816,
47831,
47835,
47837,
47838,
47858,
47859,
47882,
47883,
47921,
47922,
47962,
47963,
47979,
47980,
47997,
48035,
48079,
48106,
48145,
48146,
48154,
48155,
48369,
48370,
48383,
48384,
48418,
48419,
48433,
48434,
48450,
48451,
48500,
48535,
48536,
48553,
48554,
48556,
48570,
48586,
48606,
48621,
48627,
48681,
48732,
48778,
48824,
48870,
48897,
48923,
48970,
49007,
49036,
49048,
49077,
49109,
49151,
49190,
49202,
49211,
49290,
49338,
49385,
49392,
49398,
49452,
49503,
49538,
49584,
49622,
49649,
49675,
49722,
49759,
49788,
49800,
49829,
49861,
49903,
49942,
49954,
49963,
50042,
50090,
50137,
50143,
50147,
50149,
50150,
50161,
50162,
50199,
50200,
50229,
50230,
50246,
50247,
50296,
50323,
50353,
50354,
50371,
50372,
50374,
50424,
50471,
50513,
50547,
50570,
50592,
50635,
50668,
50693,
50701,
50726,
50754,
50792,
50827,
50835,
50840,
50915,
50959,
51002,
51004,
51005,
51014,
51015,
51228,
51229,
51311,
51312,
51326,
51327,
51362,
51363,
51378,
51379,
51395,
51396,
51445,
51481,
51482,
51499,
51500,
51502,
51518,
51536,
51558,
51575,
51585,
51629,
51655,
51688,
51748,
51777,
51804,
51833,
51862,
51872,
51878,
51880,
51881,
51896,
51897,
51936,
51937,
51953,
51954,
51967,
51968,
51979,
51997,
51998,
52045,
52046,
52054,
52060,
52061,
52120,
52121,
52126,
52133,
52134,
52160,
52161,
52173,
52180,
52181,
52214,
52215,
52231,
52232,
52247,
52285,
52329,
52335,
52395,
52412,
52452,
52458,
52463,
52499,
52500,
52517,
52518,
52520,
52556,
52574,
52599,
52659,
52680,
52697,
52737,
52743,
52745,
52746,
52758,
52759,
52797,
52798,
52825,
52826,
52842,
52843,
52892,
52919,
52953,
52954,
52971,
52972,
52974,
53010,
53028,
53053,
53113,
53134,
53151,
53191,
53198,
53219,
53240,
53242,
53243,
53258,
53259,
53277,
53278,
53305,
53306,
53319,
53320,
53329,
53336,
53337,
53384,
53385,
53393,
53399,
53400,
53441,
53442,
53447,
53454,
53455,
53481,
53482,
53494,
53501,
53502,
53535,
53536,
53552,
53553,
53567,
53605,
53649,
53655,
53713,
53718,
53745,
53779,
53780,
53797,
53798,
53800,
53836,
53854,
53879,
53939,
53960,
53977,
54017,
54024,
54045,
54066,
54068,
54070,
54071,
54086,
54087,
54127,
54128,
54158,
54159,
54175,
54176,
54193,
54237,
54264,
54298,
54299,
54323,
54324,
54617,
54618,
54721,
54722,
54755,
54756,
54818,
54819,
54821,
54864,
54904,
54946,
54978,
55012,
55030,
55044,
55046,
55048,
55091,
55131,
55173,
55205,
55239,
55258,
55273,
55275,
55276,
55287,
55288,
55504,
55505,
55585,
55586,
55644,
55645,
55693,
55747,
55748,
55759,
55760,
55939,
55940,
55954,
55955,
55971,
55972,
56029,
56063,
56064,
56081,
56082,
56085,
56149,
56163,
56165,
56166,
56187,
56188,
56298,
56299,
56350,
56351,
56368,
56369,
56371,
56386,
56402,
56423,
56465,
56507,
56552,
56572,
56577,
56629,
56647,
56649,
56650,
56680,
56681,
56865,
56866,
56895,
56896,
57122,
57123,
57166,
57167,
57183,
57184,
57233,
57300,
57301,
57318,
57319,
57321,
57374,
57389,
57399,
57448,
57477,
57487,
57493,
57495,
57496,
57522,
57523,
57729,
57730,
57782,
57783,
57799,
57800,
57849,
57940,
57941,
57958,
57959,
57961,
58014,
58036,
58037
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 58037,
"ccnet_original_nlines": 2462,
"rps_doc_curly_bracket": 0.004945119842886925,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.140180766582489,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04198849946260452,
"rps_doc_frac_lines_end_with_ellipsis": 0.0024360499810427427,
"rps_doc_frac_no_alph_words": 0.4671323001384735,
"rps_doc_frac_unique_words": 0.16365396976470947,
"rps_doc_mean_word_length": 6.248870372772217,
"rps_doc_num_sentences": 527,
"rps_doc_symbol_to_word_ratio": 0.0004930199938826263,
"rps_doc_unigram_entropy": 5.877560615539551,
"rps_doc_word_count": 6196,
"rps_doc_frac_chars_dupe_10grams": 0.33209359645843506,
"rps_doc_frac_chars_dupe_5grams": 0.48153313994407654,
"rps_doc_frac_chars_dupe_6grams": 0.43793582916259766,
"rps_doc_frac_chars_dupe_7grams": 0.4106616973876953,
"rps_doc_frac_chars_dupe_8grams": 0.38721007108688354,
"rps_doc_frac_chars_dupe_9grams": 0.3587478697299957,
"rps_doc_frac_chars_top_2gram": 0.023554939776659012,
"rps_doc_frac_chars_top_3gram": 0.035229090601205826,
"rps_doc_frac_chars_top_4gram": 0.03553903102874756,
"rps_doc_books_importance": -6090.474609375,
"rps_doc_books_importance_length_correction": -6090.474609375,
"rps_doc_openwebtext_importance": -3535.221923828125,
"rps_doc_openwebtext_importance_length_correction": -3535.221923828125,
"rps_doc_wikipedia_importance": -2127.0595703125,
"rps_doc_wikipedia_importance_length_correction": -2127.0595703125
},
"fasttext": {
"dclm": 0.39590394496917725,
"english": 0.6992618441581726,
"fineweb_edu_approx": 2.0819950103759766,
"eai_general_math": 0.11372107267379761,
"eai_open_web_math": 0.0893714427947998,
"eai_web_code": 0.8950411677360535
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,615,127,431,851,544,600
|
Having problems with your Acer AOA150-1690 Aspire Notebook ?
My netbook won't booting,power ligth on but power ligth remain on
Answers :
Hi,
There are approx 6 reasons why this might happen:
\015\012
\015\012
1. The backlight has gone (Find a dark place and shine a torch into the screen and see if you can see an image in the background, if you see an image then the backlight has gone) - Needs a new backlight (Engineer to remove and fit) or have a new panel fitted.
2. \015\012
3. The panel has died - Need a new panel
4. \015\012
5. A cable has worked itself loose or is broken
6. \015\012
7. The inverter has gone - Need new inverter
8. \015\012
9. Long shot, the bios has got corrupted - Engineer could re-flash the bios
10. \015\012
11. Long shot, Mainboard onboard graphics has gone - Need new mainboard
My personal opinion is that the backlight or inverter has gone - Either way it needs to be opened up to repair it, consult a service centre and get a quote or repair it yourself if your up for it.
Thanks
Repair Help & Product Troubleshooting for Acer AOA150-1690 Aspire Notebook
Tips for a great answer:
- Provide details, support with references or personal experience .
- If you need clarification, ask it in the comment box .
- It's 100% free, no registration required.
Suggested Questions/Answers :
My netbook won't booting,power ligth on but power ligth remain on
Hi,There are approx 6 reasons why this might happen:\015\012\015\012The backlight has gone (Find a dark place and shine a torch into the screen and see if you can see an image in the background, if you see ... Acer AOA150-1690 Aspire Notebook
The bios update failed on my 4g asus eeepc
What you need to do is to get the manual for the motherboard os you can reset the BIOS. On the other hand, you may not be able to preform that. This model is like a netbook and try this, remove the battery and the power cord. give it 15min. put the ... ASUS Eee 4G Notebook
Acer A0D150,no boot up,power light coming on and a blank screen.
... Acer Aspire One D150-1587 Netbook
My ACER netbook turns on but the screen remains
After switching off the aa1, when trying to turn it on again, it just shows blinking leds and the fan is turning. But the screen remains black.If your aa1 does like this probably its BIOS has been damaged...Luckily the Acer Aspire O ... Acer Aspire One Netbook 8.9" Notebook
[[ACER WONT TURN ON]]
You might of fried the whole motherboard when it sparked. Check if there is a fuse. Bridge the gap, and it should turn on. If not PULL THE PLUG.its something else that went wrong.If you don't, it smells really bad. Ive learn't from experience... ... Acer TravelMate 2300 Notebook
Compaq V5000 Laptop wont recongnise / charge battery anymore
I have a problem with a V5000 ( can you point to me which is the Charging IC) ??? works fine but no charging ... HP Compaq Presario V5000Z Notebook
My netbook wont let turn on power icon.
... Acer Aspire One Netbook 8.9" Notebook
Coputer wont charge even when pluged in
This is a commom problem.\015\012Problem with power socket on the laptop, it may caused by a dry solder joint and needs to be resoldered or the power socket may be faulty and needs to be replaced. Either way to fix this, it requires the laptop ... Dell Inspiron E1705 Notebook
Toshiba A75 Wont Boot up
It sounds like you may not have made a good connection to the motherboard from the screen when you put everything back together. When you press the power button does the screen come on and then go off or does it not come on at all ? ... Toshiba Satellite A75-S226 Notebook
Power led remains lit at all times with battery or power plugged in. Fans turn on when powered on but no system response. Was able to get system to power on by compressing laptop above and below DVD with a lot of force. The computer would remain on. System will not respond at all. Appears to be a mechanical problem?
Ok you have laptop. Look for a key called "Fn" it should be around the ctrl or alt key on your keyboard. Try pressing that. After trying to turn it on and it wont. press the Fn key. The last time you were able to use the laptop how did you shut it do ... Gateway M675 Notebook
Acer Aspire 4720Z Battery works till about 32% and then it gives a low battery warning of 5% before shutting down. It wont restart unless its plugged in. The battery shows 5% charge remaining. Where has the last 30% charge gone?
Hi,Laptop battery notification is not accurate but approximate. The remaining battery usage is calculated approximately and then notified to the user. If your battery's life is more than a year, then the calculation goes on decreasing. It canno ... Acer Aspire 4720 Notebook
Wont start - Acer Aspire One Netbook 8.9" Notebook
Hi there, please explain what's you face. Also you can follow the steps.\015\0121. plug on the the power cable. Is there green light are on in adepter? Is not then your power cable damaged.\015\0122. if you r battery fully charged then tu ... Acer Aspire One Netbook 8.9" Notebook
I bought an Asus Eee 1201HAB running windows XP for my daughter this month at Christmas from Best Buy. 2 days ago the screen went black...or unreadably dark. At the right angle in bright light I can still read the screen but it is difficult. I tried 'reverting' it back to the first of the week with no success of changing the screen condition. When I reboot the computer either with battery only or with AC power cord plugged in, it remains the same. I have run Avast virus guard and Advanced
Hi,It sounds very much like there is a problem with the LCD inverter. The inverter powers the backlight of the LCD panel making it light up so you can see it.With the netbook being brand new i recommend that you take the netbo ... Acer Aspire 5610 Notebook
Acer 5630 wont turn on
Have you performed any hardware changes recently? ... Acer Aspire 5630 Notebook
Toshiba a105, wont power up, clicking sound
I seem to have the same problem. I have an a105-4134. Ive had since June of 2006 and ive kept it clean and have replaced several components throughout its life.I was working on it few days ago until it just shut off. Confused, I press the ... Toshiba Satellite A105 Notebook
My acer one serious remains black when switched on
Try this repair, the BIOS most likely needs to be reflashed. You will need a flash drive and the BIOS files from Acer support downloads. Takes about 10 minutes for this repair.\015\012\015\012Acer One Black Screen of Death Repair…. ... Acer Aspire One A150-1006 Notebook
Flashing power button but wont turn on
... HP Mini 1000 Notebook
Acer netbook wont turn on
You must be facing any of these four issues:1) power issue2) No POST3) NO Boot4) No videoPower issue - the system does not turn on at all. In this case check the ... Acer Aspire One AOA150-1570 Notebook PC
Spilled water on it, now it wont turn on
Removed battery first. You should disassemble it to clean and wipe it dry. From bottom to top. Under its keyboard. Don't power it on until you are sure no water remains. ... Toshiba Satellite A135 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
Computer wont turn on with video card
Hi, the problem may lie in the temperatures of the card and power supply. If the system exceeds a certain temperature the system will shut down, this is easily achievable if you are over clocking your cards or CPU. You might find that installing extr ... Gateway DX4200-UB001A Desktop Computer
My Toshiba L30 101 wont power up!!
Solution is :-\015\012Please flip the notebook upside down , remove the battery , remove the ac adapter , then press and hold the power button for 30 seconds , then put the battery back , ac adapter back . try to power on the notebook it will w ... PC Laptops
I have a acer one i tried the bios reset but my kid push the power button in the middle of the reset and now its not power at all , help.....
Hi there!Try by removing the battery! Now press the power button without AC adapter connected to discharge remaining current inside. Wait 2-3 minutes.Connect the AC power only & hold power for 20 seconds for a reset. Test.Insert ... Acer Aspire One PC Notebook
Acer Aspire 5600 wont turn on.
Ther is only one thing that you have not tried I think. Try to remove the CMOS battery from the motherboard for about 15 minutes and reconnect it. It's a small lithium battery.\015\012\015\012 ... E-Machines T1360 PC Desktop
Acer won't turn on ,no battery being used only ac power
Is the LED (light emitting diode) in your AC power cord lit? If it is, then there's something wrong with your laptop's motherboard not accepting the AC power. But if it is NOT lit, then your AC power cord or battery charger is defective. You should a ... E-Machines eMachines Desktop PC
• 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.5590 seconds
|
{
"url": "http://www.electronic-servicing.com/acer_aoa150_1690_aspire_notebook/q1801827-netbook_booting_power_ligth",
"source_domain": "www.electronic-servicing.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "26209",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PDQ5WARE6XAFXE6ZL5MTFOLXE5NWWYRQ",
"WARC-Concurrent-To": "<urn:uuid:1a97f765-5bb2-4b72-b7e1-b771c8c43d7b>",
"WARC-Date": "2016-10-24T15:55:09Z",
"WARC-IP-Address": "104.27.178.222",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5NBAUAMU4QFDKL4LSMA3EDDBT5NISXPK",
"WARC-Record-ID": "<urn:uuid:b83afbc0-68b7-4c23-bd3b-83aad11d04a1>",
"WARC-Target-URI": "http://www.electronic-servicing.com/acer_aoa150_1690_aspire_notebook/q1801827-netbook_booting_power_ligth",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c6398495-e96e-4052-8fcd-c26346e7979f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
1,
62,
63,
129,
130,
131,
141,
142,
146,
147,
197,
198,
207,
220,
482,
496,
539,
553,
603,
617,
664,
678,
756,
771,
845,
1042,
1043,
1050,
1125,
1126,
1151,
1152,
1220,
1277,
1321,
1322,
1352,
1353,
1419,
1420,
1421,
1664,
1665,
1708,
1709,
1710,
1984,
1985,
2050,
2051,
2052,
2090,
2091,
2139,
2140,
2141,
2416,
2417,
2439,
2440,
2441,
2721,
2722,
2783,
2784,
2785,
2933,
2934,
2974,
2975,
2976,
3018,
3019,
3059,
3060,
3061,
3338,
3339,
3364,
3365,
3366,
3639,
3640,
3958,
3959,
3960,
4237,
4238,
4467,
4468,
4469,
4744,
4745,
4796,
4797,
4798,
5079,
5080,
5574,
5575,
5576,
5833,
5834,
5857,
5858,
5859,
5939,
5940,
5984,
5985,
5986,
6261,
6262,
6313,
6314,
6315,
6586,
6587,
6626,
6627,
6628,
6654,
6655,
6681,
6682,
6683,
6889,
6890,
6931,
6932,
6933,
7139,
7140,
7178,
7179,
7180,
7462,
7463,
7501,
7502,
7503,
7797,
7798,
7833,
7834,
7835,
8095,
8096,
8238,
8239,
8240,
8501,
8502,
8533,
8534,
8535,
8760,
8761,
8817,
8818,
8819,
9106,
9181,
9207,
9243,
9365
],
"line_end_idx": [
1,
62,
63,
129,
130,
131,
141,
142,
146,
147,
197,
198,
207,
220,
482,
496,
539,
553,
603,
617,
664,
678,
756,
771,
845,
1042,
1043,
1050,
1125,
1126,
1151,
1152,
1220,
1277,
1321,
1322,
1352,
1353,
1419,
1420,
1421,
1664,
1665,
1708,
1709,
1710,
1984,
1985,
2050,
2051,
2052,
2090,
2091,
2139,
2140,
2141,
2416,
2417,
2439,
2440,
2441,
2721,
2722,
2783,
2784,
2785,
2933,
2934,
2974,
2975,
2976,
3018,
3019,
3059,
3060,
3061,
3338,
3339,
3364,
3365,
3366,
3639,
3640,
3958,
3959,
3960,
4237,
4238,
4467,
4468,
4469,
4744,
4745,
4796,
4797,
4798,
5079,
5080,
5574,
5575,
5576,
5833,
5834,
5857,
5858,
5859,
5939,
5940,
5984,
5985,
5986,
6261,
6262,
6313,
6314,
6315,
6586,
6587,
6626,
6627,
6628,
6654,
6655,
6681,
6682,
6683,
6889,
6890,
6931,
6932,
6933,
7139,
7140,
7178,
7179,
7180,
7462,
7463,
7501,
7502,
7503,
7797,
7798,
7833,
7834,
7835,
8095,
8096,
8238,
8239,
8240,
8501,
8502,
8533,
8534,
8535,
8760,
8761,
8817,
8818,
8819,
9106,
9181,
9207,
9243,
9365,
9390
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9390,
"ccnet_original_nlines": 166,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36495256423950195,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.039940088987350464,
"rps_doc_frac_lines_end_with_ellipsis": 0.005988019984215498,
"rps_doc_frac_no_alph_words": 0.19171242415905,
"rps_doc_frac_unique_words": 0.3532307744026184,
"rps_doc_mean_word_length": 4.4375386238098145,
"rps_doc_num_sentences": 135,
"rps_doc_symbol_to_word_ratio": 0.014977529644966125,
"rps_doc_unigram_entropy": 5.541876792907715,
"rps_doc_word_count": 1625,
"rps_doc_frac_chars_dupe_10grams": 0.04354457929730415,
"rps_doc_frac_chars_dupe_5grams": 0.07793649286031723,
"rps_doc_frac_chars_dupe_6grams": 0.06822908669710159,
"rps_doc_frac_chars_dupe_7grams": 0.051587849855422974,
"rps_doc_frac_chars_dupe_8grams": 0.04354457929730415,
"rps_doc_frac_chars_dupe_9grams": 0.04354457929730415,
"rps_doc_frac_chars_top_2gram": 0.019414780661463737,
"rps_doc_frac_chars_top_3gram": 0.014422410167753696,
"rps_doc_frac_chars_top_4gram": 0.011094160377979279,
"rps_doc_books_importance": -857.2373046875,
"rps_doc_books_importance_length_correction": -857.2373046875,
"rps_doc_openwebtext_importance": -449.8543395996094,
"rps_doc_openwebtext_importance_length_correction": -449.8543395996094,
"rps_doc_wikipedia_importance": -304.74774169921875,
"rps_doc_wikipedia_importance_length_correction": -304.74774169921875
},
"fasttext": {
"dclm": 0.023981869220733643,
"english": 0.8976098895072937,
"fineweb_edu_approx": 1.3400192260742188,
"eai_general_math": 0.045270029455423355,
"eai_open_web_math": 0.17629051208496094,
"eai_web_code": 0.05624837055802345
}
}
|
{
"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.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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "2",
"label": "Text Extraction Errors"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,780,564,084,789,812,700
|
Take the 2-minute tour ×
Mathematica Stack Exchange is a question and answer site for users of Mathematica. It's 100% free, no registration required.
I have a fairly simple $3\times3$ complex matrix, $$ M=\left( \begin{array}{ccc} \frac{7}{2}-\frac{i}{2} & -1+i & \frac{1}{2}+\frac{5 i}{2} \\ -1+i & 5+i & -1+i \\ \frac{1}{2}+\frac{5 i}{2} & -1+i & \frac{7}{2}-\frac{i}{2} \\ \end{array} \right) $$ Solving for the eigenvalues and eigenvectors:
mat = {{7/2 - I/2, -1 + I, 1/2 + 5 I/2}, {-1 + I,
5 + I, -1 + I}, {1/2 + 5 I/2, -1 + I, 7/2 - I/2}};
{vals, vecs} = Eigensystem[mat]
gives (Mathematica 9.0.1)
\begin{array}{ccc} 6 & 3+3 i & 3-3 i \\ \{1,-2,1\} & \left\{\frac{17}{13}+\frac{6 i}{13},0,1\right\} & \{-1,0,1\} \\ \end{array}
But that 2nd eigenvector is not right; it should be $(1,1,1)$. Is there a bug, or am I being incredibly obtuse?
share|improve this question
is this what you want: M = {{7/2 - I/2, -1 + I, 1/2 + 5 I/2}, {-1 + I, 5 + I, -1 + I}, {1/2 + 5 I/2, -1 + I, 7/2 - I/2}} – gilonik Aug 13 '13 at 3:50
2
Pretty shocking, this one. Are you going to report it to Wolfram? http://www.wolfram.com/support/contact/email/?topic=Feedback – Jens Aug 13 '13 at 6:03
1
Yup, this is clearly a bug as can be confirmed with the following: M.Transpose[{Eigenvectors[M][[2]]}] == Eigenvalues[M][[2]] Transpose[{Eigenvectors[M][[2]]}]. Which gives False indicating that this is not a true eigenvalue equation. Indeed replacing this eigenvector with {1,1,1} satisfies the equation. – RunnyKine Aug 13 '13 at 6:12
3
I've pasted the matrix to WolframAlpha. It also gives the wrong answer. – luyuwuli Aug 13 '13 at 6:30
2
Thanks for the confirmation. It's nice to know I'm not crazy. I've reported it to Wolfram. – gilonik Aug 13 '13 at 6:58
show 2 more comments
1 Answer
This appears to be a genuine bug with exact arithmetic in Eigensystem. Here is a comparison to the same calculation with real numbers, for which I use the matrix mat//N:
mat = {{7/2 - I/2, -1 + I, 1/2 + 5 I/2}, {-1 + I,
5 + I, -1 + I}, {1/2 + 5 I/2, -1 + I, 7/2 - I/2}};
{vals, vecs} = Eigensystem[mat]
(*
==> {{6, 3 + 3 I,
3 - 3 I}, {{1, -2, 1}, {17/13 + (6 I)/13, 0, 1}, {-1, 0, 1}}}
*)
{numericvals, numericvecs} = Eigensystem[mat // N] // Chop
(*
==> {{6., 3. - 3. I,
3. + 3. I}, {{-0.408248, 0.816497, -0.408248}, {-0.707107, 0,
0.707107}, {0.57735, 0.57735, 0.57735}}}
*)
The results are not equivalent, and I can test which of them gives correct eigenvalues as follows:
Table[Chop[mat.vecs[[i]] - vals[[i]] vecs[[i]]], {i, 3}]
(*
==> {{0, 0, 0}, {36/13 - (24 I)/13, -(36/13) + (24 I)/13, 0}, {0,
0, 0}}
*)
Table[
Chop[N[mat].numericvecs[[i]] -
numericvals[[i]] numericvecs[[i]]], {i, 3}]
(* ==> {{0, 0, 0}, {0, 0, 0}, {0, 0, 0}} *)
Clearly, the floating-point result is correct and the exact arithmetic result (using mat without N) is incorrect.
This then also indicates how to work around this bug: use only numerical matrices with N[...].
share|improve this answer
It's good to know that the numerical result is correct. I'm saved. – xslittlegrass Mar 13 at 3:54
@xslittlegrass Sadly, the "future version" that was supposed to fix this bug hasn't materialized yet... – Jens Mar 13 at 4:04
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://mathematica.stackexchange.com/questions/30333/eigenvector-bug",
"source_domain": "mathematica.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "74211",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2EVHIKUVTXFSNDGB63ISG2K5AV5TCB3A",
"WARC-Concurrent-To": "<urn:uuid:206f7ab9-609b-42e8-b862-ff881d7b7648>",
"WARC-Date": "2014-04-25T06:56:49Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:X4WBRNWAG3VCKCOGXN5D6VRNIXVWX7VC",
"WARC-Record-ID": "<urn:uuid:7ecd8cdb-5dfe-4085-b123-c47bc7873f15>",
"WARC-Target-URI": "http://mathematica.stackexchange.com/questions/30333/eigenvector-bug",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a9032d9f-b24b-4ec5-834e-61d024ce57d8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-4-33.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-15\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for April 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
150,
151,
446,
447,
498,
554,
586,
587,
613,
614,
743,
744,
856,
857,
885,
890,
1041,
1045,
1199,
1203,
1541,
1545,
1648,
1652,
1773,
1794,
1795,
1804,
1805,
1975,
1976,
2027,
2082,
2083,
2115,
2116,
2119,
2138,
2202,
2205,
2206,
2265,
2266,
2269,
2291,
2356,
2400,
2403,
2404,
2503,
2504,
2561,
2562,
2565,
2631,
2641,
2644,
2645,
2652,
2685,
2732,
2733,
2777,
2778,
2892,
2893,
2988,
2989,
3015,
3020,
3119,
3124,
3251,
3263,
3264,
3276,
3277,
3279,
3287,
3288,
3366,
3367
],
"line_end_idx": [
25,
150,
151,
446,
447,
498,
554,
586,
587,
613,
614,
743,
744,
856,
857,
885,
890,
1041,
1045,
1199,
1203,
1541,
1545,
1648,
1652,
1773,
1794,
1795,
1804,
1805,
1975,
1976,
2027,
2082,
2083,
2115,
2116,
2119,
2138,
2202,
2205,
2206,
2265,
2266,
2269,
2291,
2356,
2400,
2403,
2404,
2503,
2504,
2561,
2562,
2565,
2631,
2641,
2644,
2645,
2652,
2685,
2732,
2733,
2777,
2778,
2892,
2893,
2988,
2989,
3015,
3020,
3119,
3124,
3251,
3263,
3264,
3276,
3277,
3279,
3287,
3288,
3366,
3367,
3457
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3457,
"ccnet_original_nlines": 83,
"rps_doc_curly_bracket": 0.03991900011897087,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1591320037841797,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04792042821645737,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.594936728477478,
"rps_doc_frac_unique_words": 0.4360465109348297,
"rps_doc_mean_word_length": 4.228682041168213,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.0018083200557157397,
"rps_doc_unigram_entropy": 4.903608322143555,
"rps_doc_word_count": 516,
"rps_doc_frac_chars_dupe_10grams": 0.061411548405885696,
"rps_doc_frac_chars_dupe_5grams": 0.09074243903160095,
"rps_doc_frac_chars_dupe_6grams": 0.08753436803817749,
"rps_doc_frac_chars_dupe_7grams": 0.07195234298706055,
"rps_doc_frac_chars_dupe_8grams": 0.06553620845079422,
"rps_doc_frac_chars_dupe_9grams": 0.061411548405885696,
"rps_doc_frac_chars_top_2gram": 0.011915669776499271,
"rps_doc_frac_chars_top_3gram": 0.013748849742114544,
"rps_doc_frac_chars_top_4gram": 0.012832259759306908,
"rps_doc_books_importance": -426.9493408203125,
"rps_doc_books_importance_length_correction": -426.9493408203125,
"rps_doc_openwebtext_importance": -294.21734619140625,
"rps_doc_openwebtext_importance_length_correction": -294.21734619140625,
"rps_doc_wikipedia_importance": -203.06097412109375,
"rps_doc_wikipedia_importance_length_correction": -203.06097412109375
},
"fasttext": {
"dclm": 0.6243781447410583,
"english": 0.7368958592414856,
"fineweb_edu_approx": 0.8349021673202515,
"eai_general_math": 0.16588979959487915,
"eai_open_web_math": 0.5702592730522156,
"eai_web_code": 0.0008181299781426787
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,570,013,160,641,448,000
|
How to Fix the Inaccessible Boot Device Error on Windows 10
Inaccessible Boot Device Error on Windows 10
Looking for ways to fix the Inaccessible Boot Device error on Windows 10?
One of the most convenient features Windows offers its users is to update the system automatically. This is a huge benefit, especially when a new version of OS is released. However, it often leads to the Inaccessible Boot Device error, turning your excitement into despair in a matter of seconds.
This is one of the most common Windows 10 errors and is depicted by a “Blue Screen of Death” or BSOD error with a stop code 0x0000007b. The issue reportedly occurs after a Windows startup and implies that Windows has failed to access the system partition. Consequently, your computer will require a restart.
The Inaccessible Boot Device error on Windows 10 is usually caused by corrupted drivers, overclocked CPUs, malware attacks, and frequently occurs in computers that use an SSD. What’s even worse is that if you don’t fix it immediately, it will cause a slew of additional problems in your system.
So, without further delay, let’s take a look at a few fixes!
1. Run the BSOD Troubleshooter.
The first step you should perform when encountering the BSOD error is to run a system troubleshooter. To do so, follow the steps below:
1. To start, go to Settings and go to Update & Security.
Windows Settings Update & Security
1. In the next window, click on Troubleshoot located at the left pane.
2. Now, select Blue Screen on the right pane and click on Run the troubleshooter.
BSOD Troubleshooter
1. Then, follow the on-screen instructions to complete the process.
If this wasn’t effective, go through numerous other fixes mentioned below.
2. Delete Packages You Recently Installed.
If you’ve set your computer to install packages automatically, you won’t get any notifications. Sometimes, these packages may result in the Inaccessible Boot Device error on Windows 10.
Fortunately, you have the authority to remove these packages one by one if you suspect them to be the culprit. Keep in mind that this method will restart your computer. So if you have any important work ongoing, save it before you continue.
Here’s what you need to do:
1. First, open the Settings app on your computer and go to Update & Security.
2. From the left pane of the window, click on Recovery.
3. Then, click on the Restart Now button under Advanced Startup.
Advanced Startup Windows 10
1. After that, a blue screen will appear. Go to Troubleshoot, select Advanced Options, and click on Command Prompt.
Inaccessible Boot Device Error on Windows 10
1. Doing so will restart your computer, and it will boot into Command Prompt. When the window appears, type the following command and hit Enter. This will show you which drive has your installed Windows.
dir c
1. After that, run the following command. If your Windows is installed in the D drive, replace “C” with “D” in the following command. Now, your computer screen will display a list of all updated packages of Windows.
Dism /Image:C:\ /Get-Packages
1. Identify the most recent installed package from the list by checking the install date. Note down its name and run the following command. Remember to replace the [name of package] with the actual name of the package you wish to remove.
dism.exe /image:d:\ /remove-package /packagename:[name of package]
1. After that, close the Command Prompt and restart your PC.
Hopefully, this will resolve the Inaccessible Boot Device error on Windows 10. If it doesn’t, continue reading.
3. Update the Drivers.
Although drivers assist Windows to access hardware functions accurately, outdated drivers can easily cause various errors in your system. So, if you happen to face the Inaccessible Boot Device error on Windows 10, it is highly recommended to upgrade the drivers instantly.
This BSOD error is usually the result of a fault in IDE ATA/SATA controller driver. To fix this issue, you can either visit the official website of your hardware manufacturer and download the latest drivers or follow the steps below:
1. To get started, you’ll need to boot your PC into Safe Mode. to do this, keep pressing the F8 key when your computer starts until the Advanced Boot Options screen appears.
2. Next, choose the Safe Mode with Networking option and hit Enter.
Inaccessible Boot Device Error on Windows 10
1. Once your computer turns on, press the Windows key + X simultaneously and click on Device Manager from the pop-up list.
2. Now, right-click on each driver and select the Update driver option. Remember to do this for Graphics, Network, and Audio drivers.
Update drivers Windows 10
1. Then, a new window will open. You should click on Search automatically for updated driver software. Your PC will take over from here and install if there is an update available.
Inaccessible Boot Device Error on Windows 10
1. Once done, restart your PC to apply the changes correctly.
4. Enable AHCI Mode in BIOS.
The primary role of the Advanced Host Controller Interface or AHCI is to allow software to communicate with Serial ATA devices. Most motherboards have this feature enabled by default. However, if you’re not too sure or have turned it off earlier, you might want to reconsider your decision.
Occasionally, this type of BSOD error is fixed by booting into BIOS and turning on AHCI Mode Value. The method to enter the BIOS menu and its functions vary with each manufacturer.
Below are the steps you’ll need to follow:
1. Most commonly, you are required to press the Delete, Esc, or the F2 key.
2. Then, go to the Advanced Options menu.
3. Once there, look for the Set AHCI Mode option.
4. Lastly, change its value to Enabled.
AHCI Mode in BIOS
5. Fix Corrupted Hard Drive Files.
If any of your hardware files are outdated, corrupted, or even configured inaccurately, it will lead to the Inaccessible Boot Device error on Windows 10. Fortunately, fixing them is pretty straightforward and doesn’t demand any expert’s help.
Here’s all you need to do:
1. Begin by launching the Command Prompt as administrator. You can do this by pressing the Windows key. Then, type cmd in the box and click on the Run as administrator option.
Inaccessible Boot Device Error on Windows 10
1. When the Command Prompt opens, type the following command and press the Enter key from your keyboard:
chkdsk /f /r
1. After that, type Y and hit Enter again. This will get your PC to restart.
If you failed to access Windows due to the Inaccessible Boot Device error, you can easily launch the Command Prompt from the Advanced Boot Menu.
6. Scan for Malware.
Undoubtedly, the Inaccessible Boot Device error can occur due to malware attacks on your system. Therefore, Therefore, you must regularly run a malware scan using the Windows Defender Antivirus program.
Here’s how to do it:
1. Firstly, press the Windows key + i to open Settings.
2. Then, click on Update & Security.
3. From there, go to Windows Security from the left pane of the window.
4. Now, look for Virus & threat protection and click on it. After that, follow the on-screen instructions.
Inaccessible Boot Device Error on Windows 10
7. Check for Any Loose Cables.
One simple fix you may try is to check your PC for any loose cables. However, it is only recommended if you are familiar with your computer’s hardware. To follow this method, unplug your PC from a power source and open the PC cabinet.
Then, ensure that all the connections are secure. You can even reconnect the wires for assurance. Also, clear the internal components from dust accumulation, particularly the connecting ports.
8. Restore Your System.
For a safer option, you can restore your computer to a restore point. Simply follow the steps mentioned below:
1. To begin, open Create a Restore Point and click on the System Restore button.
Create a Restore Point Windows 10
1. In the next window, click on Next.
2. Now, select the restore points and click on Scan for affected programs. Then, click on Next
Inaccessible Boot Device Error on Windows 10
1. Lastly, click on Finish.
You can then restart your PC like you normally do and check if the error has gone.
9. Reset Your PC.
If all the above-explained solutions fail to be effective, your last option is to reset your PC. This will delete all your settings and saved data, your PC will also eliminate the Inaccessible Boot Device error. But if you have important files, be sure to create a backup before following this method.
This brings us to the end of our guide on how to fix the Inaccessible Boot Device error on Windows 10. We hope that at least one of the methods proved helpful for you. We’ll be happy to hear about your experience in the comment section below.
If this guide helped you, please share it. 🙂
Leave a Reply
Your email address will not be published. Required fields are marked *
Related Posts
|
{
"url": "https://www.saintlad.com/inaccessible-boot-device-error-windows-10/",
"source_domain": "www.saintlad.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "268871",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NIIQR3JDKMJJAN5R2B55PVDQJD3XF6AD",
"WARC-Concurrent-To": "<urn:uuid:5dbd219d-401d-4119-8293-7da9c5d44ddd>",
"WARC-Date": "2023-03-27T02:06:09Z",
"WARC-IP-Address": "172.67.205.43",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:W5KIEHGCVIFLIVVOPQSVLRXASTF6JIFG",
"WARC-Record-ID": "<urn:uuid:dc453a52-377a-4fb3-a832-d53f7fe05d0b>",
"WARC-Target-URI": "https://www.saintlad.com/inaccessible-boot-device-error-windows-10/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d3a5401d-0107-48d0-85fc-8249ecbca601>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-134\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
60,
61,
106,
107,
181,
182,
479,
480,
788,
789,
1085,
1086,
1147,
1148,
1180,
1181,
1317,
1318,
1377,
1412,
1485,
1569,
1589,
1659,
1660,
1735,
1736,
1779,
1780,
1966,
1967,
2208,
2209,
2237,
2238,
2318,
2376,
2443,
2471,
2589,
2634,
2840,
2846,
3064,
3094,
3334,
3401,
3464,
3465,
3577,
3578,
3601,
3602,
3876,
3877,
4111,
4112,
4288,
4358,
4403,
4528,
4664,
4690,
4874,
4919,
4983,
4984,
5013,
5014,
5305,
5306,
5488,
5489,
5532,
5533,
5611,
5655,
5707,
5749,
5767,
5768,
5769,
5804,
5805,
6048,
6049,
6076,
6077,
6255,
6300,
6407,
6420,
6499,
6500,
6645,
6646,
6667,
6668,
6871,
6872,
6893,
6894,
6952,
6991,
7065,
7174,
7219,
7220,
7221,
7252,
7253,
7488,
7489,
7682,
7683,
7707,
7708,
7819,
7820,
7903,
7937,
7977,
8074,
8119,
8149,
8150,
8233,
8234,
8252,
8253,
8555,
8556,
8800,
8801,
8846,
8847,
8861,
8862,
8933,
8934
],
"line_end_idx": [
60,
61,
106,
107,
181,
182,
479,
480,
788,
789,
1085,
1086,
1147,
1148,
1180,
1181,
1317,
1318,
1377,
1412,
1485,
1569,
1589,
1659,
1660,
1735,
1736,
1779,
1780,
1966,
1967,
2208,
2209,
2237,
2238,
2318,
2376,
2443,
2471,
2589,
2634,
2840,
2846,
3064,
3094,
3334,
3401,
3464,
3465,
3577,
3578,
3601,
3602,
3876,
3877,
4111,
4112,
4288,
4358,
4403,
4528,
4664,
4690,
4874,
4919,
4983,
4984,
5013,
5014,
5305,
5306,
5488,
5489,
5532,
5533,
5611,
5655,
5707,
5749,
5767,
5768,
5769,
5804,
5805,
6048,
6049,
6076,
6077,
6255,
6300,
6407,
6420,
6499,
6500,
6645,
6646,
6667,
6668,
6871,
6872,
6893,
6894,
6952,
6991,
7065,
7174,
7219,
7220,
7221,
7252,
7253,
7488,
7489,
7682,
7683,
7707,
7708,
7819,
7820,
7903,
7937,
7977,
8074,
8119,
8149,
8150,
8233,
8234,
8252,
8253,
8555,
8556,
8800,
8801,
8846,
8847,
8861,
8862,
8933,
8934,
8947
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8947,
"ccnet_original_nlines": 140,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3554708659648895,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022319000214338303,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19488295912742615,
"rps_doc_frac_unique_words": 0.31018519401550293,
"rps_doc_mean_word_length": 4.650132179260254,
"rps_doc_num_sentences": 148,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.322276592254639,
"rps_doc_word_count": 1512,
"rps_doc_frac_chars_dupe_10grams": 0.020480729639530182,
"rps_doc_frac_chars_dupe_5grams": 0.14734746515750885,
"rps_doc_frac_chars_dupe_6grams": 0.12203101068735123,
"rps_doc_frac_chars_dupe_7grams": 0.10638599842786789,
"rps_doc_frac_chars_dupe_8grams": 0.08163846284151077,
"rps_doc_frac_chars_dupe_9grams": 0.04750391095876694,
"rps_doc_frac_chars_top_2gram": 0.04323709011077881,
"rps_doc_frac_chars_top_3gram": 0.05945099890232086,
"rps_doc_frac_chars_top_4gram": 0.07296258956193924,
"rps_doc_books_importance": -1116.1490478515625,
"rps_doc_books_importance_length_correction": -1116.1490478515625,
"rps_doc_openwebtext_importance": -422.7004699707031,
"rps_doc_openwebtext_importance_length_correction": -422.7004699707031,
"rps_doc_wikipedia_importance": -130.93576049804688,
"rps_doc_wikipedia_importance_length_correction": -130.93576049804688
},
"fasttext": {
"dclm": 0.11170989274978638,
"english": 0.862432062625885,
"fineweb_edu_approx": 2.068040370941162,
"eai_general_math": 0.1759132742881775,
"eai_open_web_math": 0.18108105659484863,
"eai_web_code": 0.028585080057382584
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,320,839,706,591,115,300
|
Jump to content
crowdx42
Members
• Content Count
242
• Joined
• Last visited
Community Reputation
0 Neutral
About crowdx42
• Rank
Advanced Member
Converted
• Gender
Undisclosed
Recent Profile Visitors
The recent visitors block is disabled and is not being shown to other users.
1. Are you talking about blanks or does it not come with any disk caddies?
2. So what I was considering getting was the parts linked below. Is there any way to get the noise level lower on these Shelves? From what I understand a lot of the noise comes from the PSU's? https://networkoutlet.com/products/ds4243-netapp-ds4243-24-bay-sas-sata-4u-disk-shelf-2xiom3-2xac-ps-rm-kit?variant=30323046088784 https://networkoutlet.com/products/x6558-r6-c-netapp-cable-sas-qsfp-qsfp-cu-2m-c-r6?variant=30323076694096 https://networkoutlet.com/products/x2065a-r6-c-netapp-host-bus-adapter-sas-4-port-copper-3-6-gb-qsfp-pcie-c?variant=30323074531408
3. So based on what I am reading, I could get a NetApp disk shelf, remove it's noisy controller, put in a standard PSU and an adapter card for SAS internal to external and the use and external cable and a HBA card in the main server and that would allow me to use the drives in the NetAop disk shelf. Only caveat would be that the diskshelf would have to be manually powered up seperate to the main server but being 24/7 server and shelf this would only be an issue if the server and shelf powered down unexpectedly. Would I be correct in this scenario that the disks in the shelf would also spin 25/7 and not allow for spinning down?
4. Sorry I am using current 6.7.2. I will try the RC version and see if that helps.
5. Hi all, so I have been having an issue with my UNRAID server where, when I am watching Kodi on our TV and UNRAID starts moving files on the server that Kodi starts to buffer and makes the show unwatchable. I first thought it was a CPU issue and so I upgraded memory and cpu to an i7 Kabylake with 32gig of memory. The cache drive is a 1tb Samsung EVO SSD and the SAS Cards are Flashed to IT Mode Dell PERC H310 Adapters. None of the upgrades helped. Is there any way to lower the prioritization of copying files from the SSD to the array so that Kodi would get priority? I tried cpu pinning but that did not work. My dockers are Deluge and NZBGet that are moving files, their docker images are on the SSD. Any thoughts? I
6. So I watched his videos and read some of the Blog. It seems the most expensive piece of the puzzle is the SAS card with external connections. I looked at the one he used on eBay and it was $400 upwards. Are there any other cards that would work with UNRAID but are cheaper?
7. Thanks for the reply, one last question, what was the reason for changing the controllers? Was it purely bandwidth, or is there a reliability issue with the original NetApp controller? Also, my setup is in our spare bedroom, is there any hacks to make these units quieter? Patrick
8. Cool, I will take a look at it. Thanks
9. Hi, so I am thinking of getting the same disk shelf, do you happen to have a link to the actual setup that worked for you? Am I correct in reading that only a single cable is needed between the controller card and the disk shelf? Thanks in advance. Patrick
10. Hi all, I want to add a disk shelf to my UNRAID server. Can anyone recommend a budget friendly solution? I need the disk shelf and also a SAS card to connect the shelf to. I currently have two Dell PowerEdge H310 flashed cards in the system. I did see the NETAPP DS4243 24-BAY for $150 which seems a good deal on NetworkOutlet.com, I presume this is not a new item? It is not clear on their site. With that Disk Shelf, what card would work to allow it to connect to UNRAID? I have never used a Disk Shelf before but it seems the best solution to add additional storage to my current Norco 24 bay server which is full. Thoughts? Thanks in advance Patrick
11. So I have my specs shown below. M/B: ASRock - Z97 Extreme4 CPU: Intel® Core™ i5-4590 CPU @ 3.30GHz HVM: Enabled IOMMU: Enabled Cache: 256 kB, 1024 kB, 6144 kB Memory: 16 GB (max. installable capacity 32 GB)
12. Hi all, i have been using Unraid for several years, I have two servers, one which serves as a backup to the main server. The main server which runs 24/7 has 20 drives and has a Corsair 1100 watt PSU (I think). I have been considering purchasing a Synology 8 bay NAS as a replacement to the main server (which even though I have 20 drives at 92tb, it is at 52% used). The synology would run Sonarr and back up weekly to the current main server. Would I see tangible savings on power consumption with the Synology? I live in California, so power is expensive :) . Thoughts? Patrick McC
13. How have you guys found Seagate drives? I have not had the best of luck with older drives from Seagate. Are the newer models a lot better?
14. I got 2 of these external WD - easystore® 8TB External USB 3.0 Hard Drive - Black, one was a white label and the other was a Red. I already had two whites from early this year. Both drives locally here were $149.99, real great price at the time.
15. Thanks for the replies, so if this is correct then I could set my drives to not spin down as a test to see if that cures the problem. If this solves the issue, is there any app out there that I can schedule the drive to spin down at night/early morning and so they would never interfere when we are streaming tv shows?
|
{
"url": "https://forums.unraid.net/profile/61808-crowdx42/",
"source_domain": "forums.unraid.net",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "110312",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZEVIBWFPOH6Y5V2DM6YCVK7ITPCFHACM",
"WARC-Concurrent-To": "<urn:uuid:90edb089-ccbc-46e2-b3b5-4e3c62d2ca33>",
"WARC-Date": "2019-11-21T09:05:00Z",
"WARC-IP-Address": "52.89.61.6",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K7I4N5M3KSZKAPPI6BGQGXFDPHA6IVV7",
"WARC-Record-ID": "<urn:uuid:f70d3aab-c793-4c74-b5cf-8503416b757b>",
"WARC-Target-URI": "https://forums.unraid.net/profile/61808-crowdx42/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b837734c-fa9e-4621-9e24-b7c52415414d>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-187.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,
17,
26,
27,
35,
53,
54,
62,
73,
74,
91,
92,
113,
114,
124,
125,
140,
141,
150,
170,
171,
181,
182,
193,
209,
210,
234,
235,
312,
313,
390,
954,
1591,
1677,
2404,
2683,
2969,
3013,
3275,
3935,
4148,
4738,
4883,
5135
],
"line_end_idx": [
16,
17,
26,
27,
35,
53,
54,
62,
73,
74,
91,
92,
113,
114,
124,
125,
140,
141,
150,
170,
171,
181,
182,
193,
209,
210,
234,
235,
312,
313,
390,
954,
1591,
1677,
2404,
2683,
2969,
3013,
3275,
3935,
4148,
4738,
4883,
5135,
5459
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5459,
"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.3787510097026825,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.061638280749320984,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20519058406352997,
"rps_doc_frac_unique_words": 0.42072537541389465,
"rps_doc_mean_word_length": 4.377202033996582,
"rps_doc_num_sentences": 82,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.362607479095459,
"rps_doc_word_count": 965,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.007102270144969225,
"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.01704544946551323,
"rps_doc_frac_chars_top_3gram": 0.015388259664177895,
"rps_doc_frac_chars_top_4gram": 0.010653410106897354,
"rps_doc_books_importance": -615.0311889648438,
"rps_doc_books_importance_length_correction": -615.0311889648438,
"rps_doc_openwebtext_importance": -318.8924255371094,
"rps_doc_openwebtext_importance_length_correction": -318.8924255371094,
"rps_doc_wikipedia_importance": -212.30307006835938,
"rps_doc_wikipedia_importance_length_correction": -212.30307006835938
},
"fasttext": {
"dclm": 0.0835498571395874,
"english": 0.9527224898338318,
"fineweb_edu_approx": 1.1048567295074463,
"eai_general_math": 0.3497350811958313,
"eai_open_web_math": 0.21382427215576172,
"eai_web_code": 0.12316769361495972
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,855,502,195,037,954,000
|
login home contents what's new discussion bug reports help links subscribe changes refresh edit
http://www.faqs.org/docs/Linux-mini/Linuxdoc-Reference.html
http://tldp.org/HOWTO/Howtos-with-LinuxDoc-5.html
LinuxDoc is a lot easier to learn than DocBook. But most of what you learn about LinuxDoc would also be useful for DocBook. So if you eventually decide to go for DocBook, most of the effort spent on learning LinuxDoc will not be wasted.
Subject: Be Bold !!
( 15 subscribers )
Please rate this page:
|
{
"url": "http://fricas-wiki.math.uni.wroc.pl/LinuxDoc",
"source_domain": "fricas-wiki.math.uni.wroc.pl",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "17878",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LJUB5ML2THBLMM35ZXBPDASM4IEOUJNI",
"WARC-Concurrent-To": "<urn:uuid:05734527-1464-4175-96a3-bd18480c3d56>",
"WARC-Date": "2022-06-28T06:03:07Z",
"WARC-IP-Address": "156.17.86.4",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:TAHQAV5IIEH6QSRQQDASQOTENYAHYERY",
"WARC-Record-ID": "<urn:uuid:e0a369f6-c6fb-418a-bdb4-b64b44e14474>",
"WARC-Target-URI": "http://fricas-wiki.math.uni.wroc.pl/LinuxDoc",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5cfafed5-6827-4856-8e3d-4825c46f4aa6>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-34\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,
110,
111,
171,
172,
222,
223,
460,
461,
462,
463,
464,
488,
511
],
"line_end_idx": [
110,
111,
171,
172,
222,
223,
460,
461,
462,
463,
464,
488,
511,
533
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 533,
"ccnet_original_nlines": 13,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28947368264198303,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008771929889917374,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25438594818115234,
"rps_doc_frac_unique_words": 0.8260869383811951,
"rps_doc_mean_word_length": 5.811594009399414,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.970261812210083,
"rps_doc_word_count": 69,
"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.029925189912319183,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -40.60080337524414,
"rps_doc_books_importance_length_correction": -53.398643493652344,
"rps_doc_openwebtext_importance": -18.88969612121582,
"rps_doc_openwebtext_importance_length_correction": -31.68753433227539,
"rps_doc_wikipedia_importance": -7.467575550079346,
"rps_doc_wikipedia_importance_length_correction": -20.26541519165039
},
"fasttext": {
"dclm": 0.02041959948837757,
"english": 0.663051187992096,
"fineweb_edu_approx": 2.3039138317108154,
"eai_general_math": 0.008676350116729736,
"eai_open_web_math": 0.6242318749427795,
"eai_web_code": -0.000007990000085555948
}
}
|
{
"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": "025.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "Library science",
"level_3": "Library administration"
}
}
},
"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": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,502,983,630,335,731,000
|
dcsimg
Helium and Disk Drives
Did anyone see this opinion piece on the Federal Helium Reserve and the helium shortfall?
This got me thinking about WD's plans for making helium-filled drives. I, of course, do not want hydrogen fill disk drives or a disaster like the Hindenburg in a computer room.
I have been hearing about the impending issues with helium. There needs to be only a small amount of helium in each disk drive, but with the thousands of drives being shipped, I am sure this adds up to a significant amount of the gas.This makes me ask the question, what were they thinking?
WD needs to provide a lot more information about how this is all going to work. This is not the first case nor the last case where a vendor has said something that on the surface makes sense, but after learning a few other things leads to lots of questions about how things will really work together. The issues with helium shortfall and the price increases have been well known for a long time. I have seen many reports on this, but why hasn't the IT media asked WD how this all will work? It is a fair question and there could easily be a reasonable explanation.
The IT new media needs to start asking hard questions of vendors, not just reporting on what they say. This is just one example. I am not a reporter, so maybe I do not know the rules of engagement when talking with vendors. But in-depth reporting would provide everyone more valuable information.
Labels: disk drives,WD,helium
posted by: Henry Newman
Henry Newman, InfoStor Blogger
by Henry Newman
InfoStor Blogger
Henry Newman is CEO and CTO of Instrumental Inc. and has worked in HPC and large storage environments for 29 years. The outspoken Mr. Newman initially went to school to become a diplomat, but was firmly told during his first year that he might be better suited for a career that didn't require diplomatic skills. Diplomacy's loss was HPC's gain.
Previous Posts
Archives
|
{
"url": "http://www.infostor.com/index/blogs_new/Henry-Newman-Blog/blogs/infostor/Henry-Newman-Blog/post987_162680810.html",
"source_domain": "www.infostor.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "70025",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FIRVLWWJQNJUXCRXLSOUKCNIOTBHO6QR",
"WARC-Concurrent-To": "<urn:uuid:6a691bb0-f576-4404-954a-608d7db29e05>",
"WARC-Date": "2021-01-28T09:17:08Z",
"WARC-IP-Address": "70.42.23.155",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2YZ7FCNQTEVEXBUOYHGRVPSYQWBJWE7Y",
"WARC-Record-ID": "<urn:uuid:8fc0d911-fc2c-4352-bfc9-74ecc0aa9e88>",
"WARC-Target-URI": "http://www.infostor.com/index/blogs_new/Henry-Newman-Blog/blogs/infostor/Henry-Newman-Blog/post987_162680810.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3d9044cd-dffb-446e-839a-913363b93735>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-59.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
7,
8,
31,
32,
122,
123,
300,
301,
592,
593,
1158,
1159,
1456,
1457,
1487,
1488,
1512,
1513,
1544,
1560,
1577,
1578,
1924,
1925,
1940,
1941
],
"line_end_idx": [
7,
8,
31,
32,
122,
123,
300,
301,
592,
593,
1158,
1159,
1456,
1457,
1487,
1488,
1512,
1513,
1544,
1560,
1577,
1578,
1924,
1925,
1940,
1941,
1949
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1949,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.47088608145713806,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.040506329387426376,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10886076092720032,
"rps_doc_frac_unique_words": 0.565597653388977,
"rps_doc_mean_word_length": 4.52769660949707,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.950068950653076,
"rps_doc_word_count": 343,
"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.028332259505987167,
"rps_doc_frac_chars_top_3gram": 0.02060527913272381,
"rps_doc_frac_chars_top_4gram": 0.03348357975482941,
"rps_doc_books_importance": -144.7394561767578,
"rps_doc_books_importance_length_correction": -144.7394561767578,
"rps_doc_openwebtext_importance": -108.62486267089844,
"rps_doc_openwebtext_importance_length_correction": -108.62486267089844,
"rps_doc_wikipedia_importance": -74.36756896972656,
"rps_doc_wikipedia_importance_length_correction": -74.36756896972656
},
"fasttext": {
"dclm": 0.2987537384033203,
"english": 0.9775030612945557,
"fineweb_edu_approx": 1.8165507316589355,
"eai_general_math": 0.37934762239456177,
"eai_open_web_math": 0.3297237753868103,
"eai_web_code": 0.043802738189697266
}
}
|
{
"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": "546.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Chemistry",
"level_3": "Chemistry, Inorganic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "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": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,750,901,223,895,341,000
|
help-guix
[Top][All Lists]
Advanced
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Why Mozilla Firefox is nonfree? (was: Vanilla Firefox recipe?)
From: Adonay Felipe Nogueira
Subject: Re: Why Mozilla Firefox is nonfree? (was: Vanilla Firefox recipe?)
Date: Wed, 27 May 2020 14:31:31 -0300 (GMT-03:00)
As far as I know not even Chromium is free/libre, see
https://directory.fsf.org/wiki/Chromium . Also I would recommend all to ask the
FSF about the freedom issues with Firefox. -- * Ativista do software livre *
https://libreplanet.org/wiki/User:Adfeno * Membro dos grupos avaliadores de *
Software (Free Software Directory) * Distribuições de sistemas (FreedSoftware)
* Sites (Free JavaScript Action Team) * Não sou advogado e não fomento os não
livres * Sempre veja o spam/lixo eletrônico do teu e-mail * Ou coloque todos os
recebidos na caixa de entrada * Sempre assino e-mails com OpenPGP * Chave
pública: vide endereço anterior * Qualquer outro pode ser fraude * Se não tens
OpenPGP, ignore o anexo "signature.asc" * Ao enviar anexos * Docs., planilhas e
apresentações: use OpenDocument * Outros tipos: vide endereço anterior * Use
protocolos de comunicação federadas * Vide endereço anterior * Mensagens
secretas somente via * XMPP com OMEMO * E-mail criptografado e assinado com
OpenPGP Wed May 27 02:16:47 GMT-03:00 2020 Dmitry Alexandrov <address@hidden>:
Christopher Lemmer Webber wrote: > I'm not sure it's really accurate to
categorize asking for a vanilla copy of firefox, which might not comply with
the FSDG, as nonfree software. The primary issue with Firefox that makes it
qualify as "nonfree" is that the add-ons tool brings you to something that
might guide a user towards nonfree software right? Nope. Firefox, as
distributed by Mozilla, is simply not a free software. Just reread the
agreement with Mozilla [0] you are supposed to abide. You are _not_ free even
to redistribute _exact_ copies of it, let aside distributing modified ones: |
You may distribute unaltered copies of Mozilla Firefox and other Mozilla
software from Mozilla.org without express permission from Mozilla as long as
you comply with the following rules: | | — You may not charge for the software.
That means: | · Distribution may not be subject to any fee. | · Distribution
may not be tied to purchasing a product or service. There are many other points
there, that alone enough to render it nonfree. My favourite one: | — When
distributing you must distribute the most recent version of Firefox and other
Mozilla software. [0]
https://www.mozilla.org/en-US/foundation/trademarks/distribution-policy/ > Thus
I think this isn't exactly correct framing, since firefox itself isn't nonfree?
As you see, it is. You could build something very similar to Firefox from
sources, of course, but it would not be Mozilla Firefox. No much difference
from Google Chrome in that regard. But there is one difference, that is to
credit of Google and that I would not underestimate — the free counterpart of
their browser has a canonical name — Chromium. While Mozillaʼs browser is
anonymous and, unless are fine with adverting nonfree software, cannot be
referred in any concise way; hence the whole zoo of rebrands: Icecat,
Iceweasel, Fennec (F-Droid), Abrowser (Trisquel)...
reply via email to
[Prev in Thread] Current Thread [Next in Thread]
|
{
"url": "https://lists.gnu.org/archive/html/help-guix/2020-05/msg00222.html",
"source_domain": "lists.gnu.org",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "9634",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IHHIQRYMCOSQHGNLY6FBBK4IEW6UDR3E",
"WARC-Concurrent-To": "<urn:uuid:6f51c53b-d7b2-4693-b6a0-506baf0b2782>",
"WARC-Date": "2024-07-24T19:40:07Z",
"WARC-IP-Address": "209.51.188.17",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7L5PX5BZQXNKKLTSVIEEC3WQA53E36L6",
"WARC-Record-ID": "<urn:uuid:55c1392f-6708-4971-ac85-78eaf5c056d9>",
"WARC-Target-URI": "https://lists.gnu.org/archive/html/help-guix/2020-05/msg00222.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f2443029-bdea-4fb3-9e99-62ea07bfaa9d>"
},
"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 (info@commoncrawl.org)\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,
10,
27,
36,
37,
112,
113,
180,
181,
182,
211,
287,
337,
338,
393,
474,
552,
631,
711,
790,
871,
946,
1026,
1107,
1185,
1259,
1336,
1416,
1489,
1567,
1644,
1720,
1790,
1862,
1941,
2020,
2094,
2172,
2253,
2331,
2412,
2487,
2566,
2589,
2670,
2751,
2826,
2903,
2979,
3058,
3133,
3208,
3279,
3331,
3332,
3333,
3352,
3353
],
"line_end_idx": [
10,
27,
36,
37,
112,
113,
180,
181,
182,
211,
287,
337,
338,
393,
474,
552,
631,
711,
790,
871,
946,
1026,
1107,
1185,
1259,
1336,
1416,
1489,
1567,
1644,
1720,
1790,
1862,
1941,
2020,
2094,
2172,
2253,
2331,
2412,
2487,
2566,
2589,
2670,
2751,
2826,
2903,
2979,
3058,
3133,
3208,
3279,
3331,
3332,
3333,
3352,
3353,
3401
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3401,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26713287830352783,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0195804201066494,
"rps_doc_frac_lines_end_with_ellipsis": 0.017241379246115685,
"rps_doc_frac_no_alph_words": 0.26853147149086,
"rps_doc_frac_unique_words": 0.5742971897125244,
"rps_doc_mean_word_length": 5.315260887145996,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.0013986000558361411,
"rps_doc_unigram_entropy": 5.315971851348877,
"rps_doc_word_count": 498,
"rps_doc_frac_chars_dupe_10grams": 0.03853419050574303,
"rps_doc_frac_chars_dupe_5grams": 0.07706838101148605,
"rps_doc_frac_chars_dupe_6grams": 0.03853419050574303,
"rps_doc_frac_chars_dupe_7grams": 0.03853419050574303,
"rps_doc_frac_chars_dupe_8grams": 0.03853419050574303,
"rps_doc_frac_chars_dupe_9grams": 0.03853419050574303,
"rps_doc_frac_chars_top_2gram": 0.021156029775738716,
"rps_doc_frac_chars_top_3gram": 0.023800529539585114,
"rps_doc_frac_chars_top_4gram": 0.014355869963765144,
"rps_doc_books_importance": -297.24688720703125,
"rps_doc_books_importance_length_correction": -297.24688720703125,
"rps_doc_openwebtext_importance": -155.8497772216797,
"rps_doc_openwebtext_importance_length_correction": -155.8497772216797,
"rps_doc_wikipedia_importance": -146.56178283691406,
"rps_doc_wikipedia_importance_length_correction": -146.56178283691406
},
"fasttext": {
"dclm": 0.11591113358736038,
"english": 0.803313136100769,
"fineweb_edu_approx": 1.667041301727295,
"eai_general_math": 0.0398709811270237,
"eai_open_web_math": 0.3679274916648865,
"eai_web_code": 0.07706981897354126
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "344.730285",
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,023,461,442,164,862,000
|
For questions about functions $f$ defined on an interval $[a,b]$ such that there exists a constant $M>0$, such that if $a=x_0
learn more… | top users | synonyms
3
votes
1answer
2k views
Bounded variation, difference of two increasing functions
Prove that if $f$ is of bounded variation in $[a,b]$, it is the difference of two positive, monotonic increasing functions; and the difference of two bounded monotonic increasing functions is a ...
4
votes
5answers
3k views
Bounded functions have bounded derivatives.
Can the graph of a bounded function ever have an unbounded derivative? I want to know if $f$ has bounded variation then its derivative is bounded. The converse is obvious. I think the answer is "yes". ...
4
votes
1answer
885 views
Is the total variation function uniform continuous or continuous?
I have been doing some excercises on total variation when the following questions came up to my mind: (1) Let $f$ be continuous on the interval $[0,1]$ and be of bounded variation. Is it true that ...
8
votes
1answer
451 views
Two definitions of “Bounded Variation Function”
As far as I know, a function $f$ defined on an interval $[a, b]$ is said to be of bounded variation if $$\tag{1}V_a^b(f)=\sup\left\{\sum_{P} \lvert f(x_{j+1})-f(x_j)\rvert \ :\ P\ \text{partition of ...
6
votes
3answers
2k views
If a function $f(x)$ is Riemann integrable on $[a,b]$, is $f(x)$ bounded on $[a,b]$?
Most statements regarding Riemann integrals (at least the ones that I have encountered) begin with the statement "for $f(x)$ bounded on $[a,b]$." I am wondering if Riemann integrability implies ...
6
votes
1answer
1k views
Prove the normed space of bounded variation functions is complete
Let $\Vert f \Vert = |f(0)| + \mathrm{Var}f$ for all $f \in BV([0,1])$; we are given that it is a norm. Show that $BV([0,1])$ is a complete normed space with this norm. I have shown that any ...
3
votes
1answer
85 views
The question regrading to density argument in analysis.
I know the density argument in $L^p$ space, in Sobolev spaces, and even in BV are really sweet in many many cases. However, some times author just work on nice functions and comment by "the rest can ...
3
votes
1answer
265 views
Functions of bounded variation on all $\mathbb{R}$
Consider $F:\mathbb{R}\rightarrow\mathbb{R}$ such that $\sup_{a,b}T_F (a,b)<\infty$ where $T_F (a,b)$ is the total variation of $F$ on the interval $[a,b]$. Then we have i) ...
12
votes
5answers
2k views
Question about Riemann integral and total variation
Let $g$ be Riemann integrable on $[a,b]$, $f(x)=\int_a^x g(t)dt $ for $x \in[a,b]$. Can I show that the total variation of $f$ is equal to $\int_a^b |g(x)| dx $?
8
votes
1answer
219 views
Question on Riemann sums
Question is : What I have read in Riemann sum definition is something like $$\sum_{i=1}^n f(y) .|x_i-x_{i-1}|$$ So, at first sight i am afraid this is not even related to Riemann integration of ...
5
votes
1answer
864 views
proving $f$ is absolutely continuous on $[0,1]$
I don't seem to find version of this problem in the site, but I am sure this is pretty standard type of question. $f$ be of bounded variation on $[0,1]$, and $f$ is absolutely continuous (AC) on ...
4
votes
1answer
119 views
Unbounded variation but differentiable everywhere
A function with bounded variation is differentiable almost everywhere. There are also functions with unbounded variation that are differentiable almost everywhere (e.g. take ...
4
votes
0answers
1k views
Integral of the derivative of a function of bounded variation
Let $f\colon [a,b] \to \mathbb R$ be of bounded variation. Must it be the case that $|\int_a ^b f' (x) |\leq |TV(f)|$, where $TV(f)$ is the total variation of $f$ over $[a,b]$? If so, how can one ...
3
votes
1answer
145 views
Math Analysis - Problem dealing with bounded variation
Let $f\colon[0,1] \rightarrow \mathbb R$ (all real numbers) be defined by $\displaystyle f(x) = x \sin \left(\frac{\pi}{2x}\right)$ if $0 \lt x \le 1$ and $f(x) = 0$ if $x=0$. Determine ...
2
votes
1answer
198 views
About functions of bounded variation
I got the following the following idea in one of the articles that I'm reading. It goes this way. Let $X$ be a Hausdorff topological vector space and let $\mathcal{D}$ be the family of all divisions ...
1
vote
1answer
70 views
A question on a function of bounded semivariation
Let $(X,\tau)$ be a Hausdorff locally convex TVS and let $P(X)$ be a family of continuous seminorms on $X$ that generates the topology $\tau$. I got the following definition from one of the articles ...
0
votes
1answer
25 views
A problem that involves a supremum
We let $[a,b]\subset \mathbb{R}$ and $f:[a,b]\to \mathbb{R}$. How do we prove that $$\sup \left|\sum_{i=1}^n a_i[f(x_i)-f(x_{i-1})]\right|=\sup\sum_{i=1}^n|f(x_i)-f(x_{i-1})|$$ where $a_i\in [-1,1]$ ...
0
votes
1answer
114 views
Can I make a BV function right-continuous this way?
Math people: This question is related to how can you "fix" one of the definitions of a BV function of one variable? . Suppose $f \in BV([0,1])$. I really have two-three questions. The ...
0
votes
1answer
108 views
how can you “fix” one of the definitions of a BV function of one variable?
Math people: My question is similar to that in Two definitions of "Bounded Variation Function" . If you look at that question, you will notice that people treat definitions (1) and (2) ...
|
{
"url": "http://math.stackexchange.com/questions/tagged/bounded-variation?sort=faq&pagesize=15",
"source_domain": "math.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "93259",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UEYZ5DOQNUY4FTSI2I2VLBTO4PVCWJCM",
"WARC-Concurrent-To": "<urn:uuid:c28a3e73-aa82-4a19-a5cf-377dc8226bf7>",
"WARC-Date": "2015-01-27T21:17:28Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5WLSGU636BEQ76U3SIWAYQP5UYMVYL7B",
"WARC-Record-ID": "<urn:uuid:080d0553-c8b0-4fff-998f-289aa7b8122f>",
"WARC-Target-URI": "http://math.stackexchange.com/questions/tagged/bounded-variation?sort=faq&pagesize=15",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e89f4309-5a9b-4703-955c-a31cdcc6bcb1>"
},
"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,
126,
127,
162,
163,
165,
171,
179,
188,
189,
247,
248,
446,
448,
454,
463,
472,
473,
517,
518,
723,
725,
731,
739,
749,
750,
816,
817,
1018,
1020,
1026,
1034,
1044,
1045,
1093,
1094,
1297,
1299,
1305,
1314,
1323,
1324,
1409,
1410,
1608,
1610,
1616,
1624,
1633,
1634,
1700,
1701,
1896,
1898,
1904,
1912,
1921,
1922,
1978,
1979,
2182,
2184,
2190,
2198,
2208,
2209,
2260,
2261,
2438,
2441,
2447,
2456,
2465,
2466,
2518,
2519,
2681,
2683,
2689,
2697,
2707,
2708,
2733,
2734,
2932,
2934,
2940,
2948,
2958,
2959,
3007,
3008,
3207,
3209,
3215,
3223,
3233,
3234,
3284,
3285,
3463,
3465,
3471,
3480,
3489,
3490,
3552,
3553,
3753,
3755,
3761,
3769,
3779,
3780,
3835,
3836,
4026,
4028,
4034,
4042,
4052,
4053,
4090,
4091,
4294,
4296,
4301,
4309,
4318,
4319,
4369,
4370,
4573,
4575,
4581,
4589,
4598,
4599,
4634,
4635,
4838,
4840,
4846,
4854,
4864,
4865,
4917,
4918,
5106,
5108,
5114,
5122,
5132,
5133,
5208,
5209
],
"line_end_idx": [
126,
127,
162,
163,
165,
171,
179,
188,
189,
247,
248,
446,
448,
454,
463,
472,
473,
517,
518,
723,
725,
731,
739,
749,
750,
816,
817,
1018,
1020,
1026,
1034,
1044,
1045,
1093,
1094,
1297,
1299,
1305,
1314,
1323,
1324,
1409,
1410,
1608,
1610,
1616,
1624,
1633,
1634,
1700,
1701,
1896,
1898,
1904,
1912,
1921,
1922,
1978,
1979,
2182,
2184,
2190,
2198,
2208,
2209,
2260,
2261,
2438,
2441,
2447,
2456,
2465,
2466,
2518,
2519,
2681,
2683,
2689,
2697,
2707,
2708,
2733,
2734,
2932,
2934,
2940,
2948,
2958,
2959,
3007,
3008,
3207,
3209,
3215,
3223,
3233,
3234,
3284,
3285,
3463,
3465,
3471,
3480,
3489,
3490,
3552,
3553,
3753,
3755,
3761,
3769,
3779,
3780,
3835,
3836,
4026,
4028,
4034,
4042,
4052,
4053,
4090,
4091,
4294,
4296,
4301,
4309,
4318,
4319,
4369,
4370,
4573,
4575,
4581,
4589,
4598,
4599,
4634,
4635,
4838,
4840,
4846,
4854,
4864,
4865,
4917,
4918,
5106,
5108,
5114,
5122,
5132,
5133,
5208,
5209,
5397
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5397,
"ccnet_original_nlines": 155,
"rps_doc_curly_bracket": 0.00741151999682188,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33480826020240784,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03834807872772217,
"rps_doc_frac_lines_end_with_ellipsis": 0.11538462340831757,
"rps_doc_frac_no_alph_words": 0.32374632358551025,
"rps_doc_frac_unique_words": 0.35232558846473694,
"rps_doc_mean_word_length": 4.544186115264893,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0.014011800289154053,
"rps_doc_unigram_entropy": 5.050329208374023,
"rps_doc_word_count": 860,
"rps_doc_frac_chars_dupe_10grams": 0.02302967943251133,
"rps_doc_frac_chars_dupe_5grams": 0.04964175820350647,
"rps_doc_frac_chars_dupe_6grams": 0.034288641065359116,
"rps_doc_frac_chars_dupe_7grams": 0.02302967943251133,
"rps_doc_frac_chars_dupe_8grams": 0.02302967943251133,
"rps_doc_frac_chars_dupe_9grams": 0.02302967943251133,
"rps_doc_frac_chars_top_2gram": 0.04298873990774155,
"rps_doc_frac_chars_top_3gram": 0.046059370040893555,
"rps_doc_frac_chars_top_4gram": 0.02047082968056202,
"rps_doc_books_importance": -736.13427734375,
"rps_doc_books_importance_length_correction": -736.13427734375,
"rps_doc_openwebtext_importance": -411.7404479980469,
"rps_doc_openwebtext_importance_length_correction": -411.7404479980469,
"rps_doc_wikipedia_importance": -224.74838256835938,
"rps_doc_wikipedia_importance_length_correction": -224.74838256835938
},
"fasttext": {
"dclm": 0.07003921270370483,
"english": 0.883931040763855,
"fineweb_edu_approx": 1.4248085021972656,
"eai_general_math": 0.9672044515609741,
"eai_open_web_math": 0.9071921706199646,
"eai_web_code": 0.0028077398892492056
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "515.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
},
"secondary": {
"code": "515",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,705,678,085,541,744,000
|
Sign up ×
Game Development Stack Exchange is a question and answer site for professional and independent game developers. It's 100% free, no registration required.
For instance, in Half-Life 2 you have Civil Protection, Combine Soldier and Combine Elite. Each class has a weapon. Is there a shift away from this at all, where the NPCs are matched with the player in the sense that the weapon they choose to use is based upon their advantage, while still maintaining some sense of competitiveness? Is there a reason this became the norm? Does it have to do with all the variables and complications that can arise from doing that?
share|improve this question
1 Answer 1
up vote 15 down vote accepted
There are two reasons I can see immediately, both to do with simplicity: it's simpler to program the AI, and it's simpler for the player to understand. Now for certain games it may be an advantage if enemy characters can switch weapons for the situation (for starters, it's more realistic) but for most games it can be a significant problem if the player gets confused about what tactics to expect and counter. Players like being able to think "oh there's one of the grenade dudes, I better watch out for grenades."
As for complication in AI, there's just plain less thinking for the enemy to do if it doesn't have to consider which weapon to use. Consider your own thought process when deciding which weapon to use; now try to model that thought process as a set of instructions. You'll be considering damage per shot with how accurate the shots are, weighing effectiveness against different sorts of targets, and balancing all those factors against how much ammo you have. Pretty complicated huh?
share|improve this answer
6
It would be quite funny to see the AI screw up though and use a Rocket Launcher in a confined space... – Nate Apr 13 '11 at 14:25
1
It'd be funny to see a player do that as well, but somehow they always come out fine, not even tinnitus :P – dcousens Apr 13 '11 at 15:29
3
@jhocking spot-on I'd say. Most players don't want truly want intelligent behavior in NPCs, they want the satisfaction of having them figured out. It's truly an art to strike the right balance between NPCs that are braindead, cheaters with robotic precision, or plain unpredictable randomness. – Hackworth Sep 13 '11 at 21:40
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://gamedev.stackexchange.com/questions/11058/why-has-it-become-commonplace-for-npcs-to-have-one-weapon-per-class-instead-of-v/11062",
"source_domain": "gamedev.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "72082",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SUFQEUE6GJO2ZVT4NGVJZXIZ7OYLNMER",
"WARC-Concurrent-To": "<urn:uuid:d18f1135-5fd7-4a97-9ca0-cc589f2f0065>",
"WARC-Date": "2015-10-09T08:54:57Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:EURVXDVIAQDQM4URVR5DE4Y3GKTO2G3V",
"WARC-Record-ID": "<urn:uuid:e245475b-a8c4-44a5-a41b-dcf8c46a669f>",
"WARC-Target-URI": "http://gamedev.stackexchange.com/questions/11058/why-has-it-become-commonplace-for-npcs-to-have-one-weapon-per-class-instead-of-v/11062",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:68dad8a4-bc00-40a8-a6db-a486e1d5ad13>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-137-6-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
10,
164,
165,
630,
631,
659,
660,
671,
672,
702,
703,
1219,
1220,
1703,
1704,
1730,
1734,
1865,
1869,
2008,
2012,
2339,
2340,
2352,
2353,
2355,
2363,
2364,
2442,
2443
],
"line_end_idx": [
10,
164,
165,
630,
631,
659,
660,
671,
672,
702,
703,
1219,
1220,
1703,
1704,
1730,
1734,
1865,
1869,
2008,
2012,
2339,
2340,
2352,
2353,
2355,
2363,
2364,
2442,
2443,
2533
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2533,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4669187068939209,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013232509605586529,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17769375443458557,
"rps_doc_frac_unique_words": 0.5671981573104858,
"rps_doc_mean_word_length": 4.5558085441589355,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.0018903600284829736,
"rps_doc_unigram_entropy": 5.188331604003906,
"rps_doc_word_count": 439,
"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.013500000350177288,
"rps_doc_frac_chars_top_3gram": 0.008999999612569809,
"rps_doc_frac_chars_top_4gram": 0.01600000075995922,
"rps_doc_books_importance": -290.955810546875,
"rps_doc_books_importance_length_correction": -290.955810546875,
"rps_doc_openwebtext_importance": -137.0216522216797,
"rps_doc_openwebtext_importance_length_correction": -137.0216522216797,
"rps_doc_wikipedia_importance": -117.37128448486328,
"rps_doc_wikipedia_importance_length_correction": -117.37128448486328
},
"fasttext": {
"dclm": 0.762006938457489,
"english": 0.9603798985481262,
"fineweb_edu_approx": 1.1262165307998657,
"eai_general_math": 0.0011336799943819642,
"eai_open_web_math": 0.17434251308441162,
"eai_web_code": 0.00007093000021995977
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "-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": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,709,308,561,676,370,000
|
Title:
Computer system and method for communicating data between computers
United States Patent 9479461
Abstract:
In a computer on the transmission side, an NW driver, which is recognized, by the OS, as an NIC driver, stores data to be transmitted and a destination SPA into a memory, and outputs a transaction layer packet (TLP), which has been generated by a first computer, to a PCIe switch. A first NIC logic of the PCIe switch of the PCIe switch corresponding to the first computer on the transmission side adds a system port address (SPA) to the TLP transferred from the first computer, and transfers the data of the TLP to a port associated with a second NIC logic and having an address indicated by the SPA (destination SPA). The second NIC logic having received the data writes the receive data into a memory of a second computer, on the reception side, which is connected to another PCIe switch where the second NIC logic exists.
Inventors:
Eguchi, Shuhei (Tokyo, JP)
Yamagata, Ryo (Tokyo, JP)
Murakami, Yoshiki (Tokyo, JP)
Application Number:
14/360022
Publication Date:
10/25/2016
Filing Date:
03/16/2012
Assignee:
Hitachi, Ltd. (Tokyo, JP)
Primary Class:
1/1
International Classes:
H04L12/28; G06F13/40; H04L12/935
Field of Search:
370/400-419, 710/306-314
View Patent Images:
Foreign References:
JP2008181389A2008-08-07NODE-CONTROLLING DEVICE AND INFORMATION-PROCESSING DEVICE
JP2010079816A2010-04-08METHOD FOR SHARING PCI DEVICE
JP2010273135A2010-12-02COMMUNICATION SYSTEM, REPEATER, TRANSMITTER AND PATH FAILURE DETECTION METHOD
JP2011097497A2011-05-12DATA TRANSFER DEVICE
JP2011107858A2011-06-02COMPUTER SYSTEM WHEREIN A PLURALITY OF COMPUTERS ARE COMMUNICABLY CONNECTED TO A PLURALITY OF INPUT/OUTPUT DEVICES HAVING DIFFERENT KINDS OF COMMUNICATION INTERFACES
JP5399570B22014-01-29計算機システム、それに使用されるスイッチ及びパケット転送制御方法
Primary Examiner:
Zaidi, Iqbal
Attorney, Agent or Firm:
Volpe and Koenig, P.C.
Claims:
The invention claimed is:
1. A computer system comprising: a plurality of computers, each computer having at least a processor and associated memory, executing programs under an operating system (OS), and, a first Peripheral Component Interconnect express (PCIe) switch, which is connected to each of the plurality of computers, to communicate packets between the computers through the first PCIe switch, the first PCIe switch including: an external port to which the computer is connected; an internal port to which a second PCIe switch is connected; and a first network interface card (NIC) logic to be recognized as an endpoint by the computer, wherein a unique system port address (SPA) associated with the destination bus number is allocated to the external port and the first NIC logic, wherein a first computer on the transmission side includes a first NW driver to be recognized as a driver of the NIC by the OS, wherein the first NW driver stores data to be transmitted and a destination SPA into a memory, and outputs a transaction layer packet (TLP) generated by the first computer to the second PCIe switch, wherein in the first PCIe switch, the first NIC logic adds the unique SPA to the TLP transferred from the first computer, and transfers data read from the memory to a second NIC logic having the destination SPA indicated by the unique SPA, and wherein the second NIC logic receives the data, and writes the received data into a memory of a second computer on the reception side that is connected to the second PCIe switch where the second NIC logic exists, wherein the first NIC logic issues a read TLP to divide and obtain data of the packet stored in the memory of the first computer, and transmits in sequence the obtained data to the second NIC logic, wherein the second NIC logic transmits the received data to the second computer connected to the second PCIe switch in the order of reception, wherein the memory of the second computer includes: a plurality of first reception buffers for each network packet, where the first NW driver can write and read data; and a second reception buffer that can store data of every network packet, wherein the second computer writes the received data into one or more of the plurality of first reception buffers or the second reception buffer in the order of reception, and wherein the first NW driver reconstructs the data stored in the one or more first reception buffers or the second reception buffer into a network packet in the order of arrival time, wherein the first NW driver of the first computer generates information of the destination SPA added to the TLP to indicate a destination to which the packet is transferred, a frame length indicating the frame length of the packet, a length of each chunk which is the unit into which the packet information is divided, and a list of the addresses of the chunks, wherein the memory of the first computer stores the generated information of the destination SPA, the packet frame length, the length of each of the chunks, and the list of the addresses of the chunks, wherein in the first PCIe switch, the each port and the NIC logic have a register range for storing the range of the destination SPA of TLP that can pass through the external port from the inside of the first PCIe switch to the outside, and wherein the first NIC logic of the first PCIe switch reads each of the chunks stored in the memory, performs routing using the unique SPA by referring to the range register within the network of the PCIe switch, and transmits the each chunk to the second NIC logic corresponding to the second computer determined from the list of the addresses of the chunks.
2. The computer system according to claim 1, wherein the first NIC logic of the first PCIe switch accumulates the length of the plurality of chunks read from the memory, and wherein when the accumulated value is the same as the entire length of the frame of the packet to be transmitted which is stored in advance in the memory, the first NIC logic determines that all the chunks to be transmitted have been read.
3. The computer system according to claim 1, wherein the first NIC logic of the first PCIe switch on the transmission side replaces the header of the TLP of the data of the chunk read from the memory of the first computer with a TLP header addressed to the reception-side TLP, and transmits the TLP to the unique SPA of the second NIC logic corresponding to the second computer.
4. The computer system according to claim 1, wherein the second NIC logic of the second PCIe switch on the reception side stores the received frame into the second reception buffer, while replacing the data of a plurality of received chunks with a write request addressed to the address of the second reception buffer, to transmit the TLP, and wherein in response to the interruption of the second NIC logic, a second NW driver of the second computer rearranges the data stored in the second reception buffer in the order of address to restore the packet.
5. A computer system comprising: a plurality of computers that may include a virtual computer having processors to execute programs under an operating system (OS), and, one or more Peripheral Component Interconnect express (PCIe) switches based on the PCI Express standard, a first PCIe switch being connected to each of the plurality of computers through a PCIe link, the PCIe switches being connected to each other through the PCIe link, to communicate packets between the computers through the PCIe switches, wherein each of the PCIe switches includes a network interface card (NIC) logic to be recognized as an endpoint by the computer, wherein a port of the first PCIe switch connected to the computer includes a conversion table where an endpoint Virtual Hierarchy (EVH), which is a number allocated, without duplication, to a computer with which a first NIC logic communicates, can be subtracted from the destination bus number, wherein EVH obtained by referring to the conversion table is added to a transaction layer packet (TLP) that is input to the first PCIe switch from the computer, wherein, for one or more of the plurality of computers, a memory of the computer includes an NW driver to be recognized as a driver of NIC by the OS, wherein the NW driver writes transmission data and a destination SPA into the memory, wherein the first NIC logic corresponding to a first computer on the transmission side reads the data and the destination SPA that are written in the memory by the NW driver, wherein the first NIC logic transmits the data read from the memory to a second NIC logic having the destination SPA, and wherein the second NIC logic receives the data and writes the received data into a memory of a second computer on the reception side, which is connected to a second PCIe switch where the second NIC logic exists.
6. The computer system according to claim 5, wherein the first NIC logic includes a conversion table where Sub address (SUBA), which is the number allocated to the plurality of computers or virtual computers connected to the first PCIe switch without duplication, can be subtracted from the sum of the EVH and a part of the field existing in the TLP from the beginning, and wherein according to the TLP input to the first NIC logic, the computer to output the TLP is determined.
7. The computer system according to claim 6, wherein the first NIC logic includes a table for managing VLAN (Virtual LAN) to which each SUBA belongs, and a table for managing which port of the first PCIe switch is connected to the second PCIe switch having a SUBA to which each VLAN belongs, and wherein when a broadcast packet is input, the first NIC logic refers to the table to copy only the TLP for the SUBA belonging to the same VLAN, and transmits the copy to transfer the broadcast packet only to the computer belonging to the same VLAN.
8. The computer system according to claim 6, wherein the first NIC logic includes a table for managing the smallest one of the SUBAs that are allocated to the same computer, wherein when the TLP is input to the first NIC logic, the first NIC logic determines that there is no SUBA recorded in the table between (the EVH+1) and (the EVH+the field), and wherein the first NIC logic detects that the same computer is going to transmit the network packet to the SUBA that is not allocated to the same computer.
9. A data transmission method in a computer system comprising a plurality of computers having processors executing programs under an operating system (OS), and a first Peripheral Component Interconnect express (PCIe) switch based on the PCI Express standard, which is connected to each of the plurality of computers, the first PCIe switch being connected to the computer through an external port and also connected to a second PCIe switch through an internal port, to communicate packets between the computers through the first PCIe switch, wherein a unique system port address (SPA) of the first PCIe switch, which is associated with a destination bus number, is allocated to a first virtual network interface card (NIC) logic to be recognized as an endpoint by one or more of the plurality of computers, and to the external port, wherein in a first computer on the transmission side, a first NW driver, which is recognized as a driver of the first (NIC) by the OS of the first computer, stores data to be transmitted as well as the destination SPA into a memory while outputting a transaction layer packet (TLP) generated in the first computer to the first PCIe switch, wherein the first NIC logic of the first PCIe switch corresponding to the first computer on the transmission side, adds the unique SPA to the TLP transferred from the first computer, and transfers the data read from the memory to second NIC logic having the destination SPA indicated by the unique SPA, and wherein the second NIC logic receives the data and writes the received data into a memory of a second computer on the reception side connected to the a second PCIe switch where the second NIC logic exists, wherein the first NIC logic issues a read TLP to divide and obtain data of the packet stored in the memory of the first computer, and transmits in sequence the obtained data to the second NIC logic, wherein the second NIC logic transmits the received data to the second computer connected to the second PCIe switch in the order of reception, wherein the memory of the second computer includes: a plurality of first reception buffers for each network packet, where the first NW driver can write and read data; and a second reception buffer that can store data of every network packet, wherein the second computer writes the received data into one or more of the first reception buffers or the second reception buffer in the order of reception, and wherein the first NW driver reconstructs the data stored in the one or more first reception buffers or the second reception buffer into a network packet in the order of arrival time.
10. The data transmission method according to claim 9, wherein the first NW driver of the first computer generates information of a destination SPA added to the TLP to indicate a destination to which the packet is transferred, a frame length indicating the frame length of the packet, a length of each chunk which is the unit into which the packet information is divided, and a list of the addresses of the chunks, wherein the memory of the first computer stores the generated information of the destination SPA, the packet frame length, the length of each of the chunks, and the list of the addresses of the chunks, wherein in the first PCIe switch, the each port and the first NIC logic have a register range for storing the range of the destination SPA of TLP that can pass through the external port from the inside of the first PCIe switch to the outside, and wherein the first NIC logic of the first PCIe switch reads each of the chunks stored in the memory, performs routing using the unique SPA by referring to the range register within the network of the first PCIe switch, and transmits the each chunk to the second NIC logic corresponding to the second computer determined from the list of the addresses of the chunks.
11. The data transmission method according to claim 10, wherein the first NIC logic of the first PCIe switch accumulates the length of the plurality of chunks read from the memory, and wherein when the accumulated value is the same as the entire length of the frame of the packet to be transmitted which is stored in advance in the memory, the first NIC logic determines that all the chunks to be transmitted have been read.
12. The data transmission method according to claim 10, wherein the first NIC logic of the first PCIe switch on the transmission side replaces the header of the TLP of the data of the chunk read from the memory of the first computer with a TLP header addressed to the reception-side TLP, and transmits the TLP to the unique SPA of the second NIC logic corresponding to the second computer.
13. The data transmission method according to claim 10, wherein the second NIC logic of the second PCIe switch on the reception side stores the received frame into the second reception buffer, while replacing the data of a plurality of received chunks with a write request addressed to the address of the second reception buffer, to transmit the TLP, and wherein in response to the interruption of the first NIC logic, a second NW driver of the second computer rearranges the data stored in the second reception buffer in the order of address to restore the packet.
Description:
TECHNICAL FIELD
The present invention relates to a computer system and method for communicating data between computers, and more particularly, to data communication between servers connected by use of switches based on the PCI Express standard (that is hereinafter referred to as PCIe switches).
BACKGROUND ART
Ethernet (registered trademark) is mainly used as a communication method between servers in a data center. In general, the amount of data communicated between servers in a data center is large, and there is a problem of increasing the cost of the installation of facilities such as network switches, cables, and Ethernet cards for communication via Ethernet.
Further, a PCIe switch is used as a communication tool between a high-speed server and a device connected to the server. For example, Patent Literature 1 discloses a computer system where multiple computers and multiple input/output devices are connected by a PCIe switch. Patent Literature 2 discloses a technology for sharing an I/O device by allocating multiple virtual functions (VF) of a PCI device to multiple blades by use of a PCIe switch. Further, Patent Literature 3 discloses a technology for detecting a path error in a communication system where servers are connected by a layer 2 switch.
CITATION LIST
Patent Literature
PTL 1: Japanese Unexamined Patent Application Publication No. 2011-107858
PTL 2: Japanese Unexamined Patent Application Publication No. 2010-79816
PTL 3: Japanese Unexamined Patent Application Publication No. 2010-273135
SUMMARY OF INVENTION
Technical Problem
The PCIe switch is a common technology for connecting a server and a device connected to a slot in a chassis. Recently, there has been proposed communication between servers by use of the PCIe switch. However, the software for the communication between servers running on the server is developed with the assumption that the communication between servers is performed via Ethernet. Thus, there is a problem that the existing software for server communication may not be used if Ethernet is simply replaced by the PCIe switch.
An objective of the present invention is to achieve data communication between computers by use of a PCIe switch without using any conventionally used network device of Ethernet.
Solution to Problem
Preferably, the present invention is a computer system including multiple computers for executing programs under an OS, and a switch (referred to as a PCIe switch) based on the PCI Express, which is connected to each of the computers. The computer system communicates packets between the computers through the PCIe switches. The PCIe switch includes an external port to which the computer is connected, an internal port to which another PCIe switch is connected, and a network interface card (NIC) logic to be recognized as an endpoint by the computer. A unique system port address (SPA) associated with the destination bus number is allocated to the external port and the NIC logic. A first computer on the transmission side includes an NW driver to be recognized as a driver of a network interface card (NIC) by the OS. The NW driver stores data to be transmitted and the destination SPA into a memory. At the same time, the NW driver outputs a transaction layer packet (TLP) generated by the first computer to the PCIe switch. In the PCIe switch, a first NIC logic adds the SPA to the TLP transferred from the first computer, and transfers data read from the memory to another NIC logic (second NIC logic) having the destination (destination SPA) indicated by the SPA. The second NIC logic receives the data, and writes the received data into the memory of a second computer on the reception side that is connected to the other PCIe switch where the second NIC logic exists.
Further, preferably, the present invention is a computer system including multiple computers that may have a virtual computer, to execute programs under an OS, and a switch (referred to as a PCIe switch) based on the PCI Express standard, which is connected to each of the multiple computers through a PCIe link. The PCIe switches are connected to each other through the PCIe link. The computer system communicates packets between the computers through the PCIe switches. A port of the PCIe switch connected to the computer includes a conversion table where an endpoint VH (EVH), which is a number allocated, without duplication, to a computer with which one NIC logic communicates, can be subtracted from the destination bus number. The EVH obtained by referring to the conversion table is added to a transaction layer packet (TLP) that is input to the PCIe switch from the computer. Each of the PCIe switches includes an NIC logic to be recognized as an endpoint by the computer. A memory of the computer includes an NW driver to be recognized as a driver of the NIC by the OS. The NW driver writes transmission data and a destination SPA into the memory. A first NIC logic corresponding to a first computer on the transmission side reads the data and the destination SPA that are written in the memory by the NW driver. The first NIC logic transmits the data read from the memory to another NIC logic (second NIC logic) having the destination SPA. The second NIC logic receives the data and writes the received data into a memory of a second computer on the reception side, which is connected to the PCIe switch where the second NIC logic exists.
Further, the present invention is a method for communicating data between computers that is performed in the computer system described above.
Advantageous Effects of Invention
According to the present invention, it is possible to achieve communication between severs by use of PCIe switches. Thus, the need for the use of network devices of Ethernet in the conventional computer system where servers are connected via Ethernet can be eliminated. Further, when the communication between servers is achieved by use of PCIe switches, data communication is possible between servers by the existing software for the communication between servers using Ethernet.
BRIEF DESCRIPTION OF DRAWINGS
FIG. 1 is an overall block diagram of a computer system according to an example (Example 1).
FIG. 2 is a view of the details of an NIC logic 130 according to Example 1.
FIG. 3 is a view of a data structure of a memory of a server according to Example 1.
FIG. 4 is a view showing a detailed configuration of a TX descriptor according to Example 1.
FIG. 5 is a flow chart of the operation of transmitting a network packet in a transmission-side server according to Example 1.
FIG. 6 is a flow chart of the process of the NIC logic in a transmission-side PCIe switch according to Example 1.
FIG. 7 is a flow chart of the process of the NIC logic of a reception-side PCIe switch according to Example 1.
FIG. 8 is a flow chart of the process of receiving a network packet in a reception server according to Example 1.
FIG. 9 is an overall block diagram of a computer system according to Example 2.
FIG. 10 is a schematic block diagram of the computer system to illustrate Example 2.
FIG. 11 is views of an example of a TLP that is transmitted and received between NIC logics according to Example 2.
FIG. 12 is a view of an example of the structure of a Bus#-SPA conversion table according to Example 2.
FIG. 13 is a flow chart of the process when the NIC logic checks the access right according to Example 2.
FIG. 14 is a view of the structure of a sub address allocation map according to Example 2.
FIG. 15 is a view of the generation of the sub address allocation map according to Example 2.
FIG. 16 is a view of the structure of a VLAN map according to Example 2.
FIG. 17 is a view of the structure of a broadcast routing table according to Example 2.
FIG. 18 is a flow chart of the process in the broadcast of the NIC logic in the transmission-side server according to Example 2.
FIG. 19 is a flow chart of the process in the broadcast of the PCIe switch/virtual NIC in the reception-side server according to Example 2.
DESCRIPTION OF EMBODIMENTS
Hereinafter, examples of the present invention will be described with reference to the accompanying drawings.
EXAMPLE 1
FIG. 1 is an overall block diagram of a computer system according to an example of the present invention. A computer system 100 includes: multiple servers 101 each including a CPU 110, a memory 111, and a chip set 112 to execute programs under an OS (operating system); multiple switches (PCIe switches) 103 based on the PCIe standard, which are connected to each of the servers 101 through a PCIe link 102; and an I/O device (hereinafter, referred to as a PCIe device) 104 based on the PCIe standard, which is connected to the PCIe switch 103.
The PCIe switch 103 includes a port for connecting the server, the PCIe device, and another PCIe switch. The port has two types: a port 120 (which is referred to as an external port) connected to the server 101 and the PCIe device 104 through the PCIe link; and a port 121 (which is referred to as an internal port) connected to another PCIe switch through the PCIe link. A system port address (SPA) 105 is allocated to the external port 120. The SPA is the unique identification information (for example, numbers) statistically allocated to all external ports in the system. Further, the external port 120 has a Bus#-SPA conversion table 301. The SPA is not allocated to the internal port which does not have a Bus#-SPA conversion table.
The PCIe switch 103 includes an NIC logic (network interface card) 130 to be recognized as an endpoint by the server, which can transmit and receive TLP with the server 101. Similarly to the external port 120, the SPA 105 is allocated to the NIC logic 130, which is stored in a range resister 300 that indicates the range of SPA. Here, the reason why it is referred to as NIC logic is that this logic makes the servers 101 behave as if an Ethernet network existed by using the PCIe network to achieve communication between servers. In other words, the logic is to achieve the Ethernet network. Note that in terms of the functional aspects, it may also be referred to as PCIe switch NIC logic.
The range register 300 can show the range of SPA by storing two SPAs. The range of SPA set in the range register is the destination SPA of a TLP (transaction layer packet) that can pass through the external port 120 from the inside of the PCIe switch to the outside. Note that the TLP can pass through from the outside of the switch to the inside regardless of the setting of the range register. The range of SPA allocated to the port, which is included in a subset of the topology of the PCIe connected to the port, is set to the range register 300.
The SPA corresponding to the destination bus number is registered in the Bus#-SPA conversion table 301. Both the external port 120 and the internal port 121 have the range register 300 indicating the range of the SPA. The range of the SPA is set to the range register 300 so that the SPA of the external port existing beyond the bus connected to the port is included.
In the initial setting of the SPA 105, the range register 300, and the Bus#-SPA conversion table 301, their contents are generated by a management system (not shown) such as a management terminal connected to the computer system 100, based on the setting information the management system has from the beginning. For example, several types of setting information can be prepared according to the topology so as to select which information should be used from the setting information types. Further, it is also possible that the management system automatically detects the topology periodically to automatically generate the conversion table and SPA setting information. The present invention is not limited to any of the above methods.
The destination SPA is added to the TLP as a label. In the network of the PCIe switches 103, the routing is performed by using the SPA 105 instead of the destination bus number. More specifically, the routing is performed by repeating the transfer of the SPA added to the TLP as the label to the port within the range of the SPA set in the range register. The SPA label is removed when the TLP is output from the external port.
Here, a software whose I/F between the OS (Operating System) (not shown) of the server 101 and the driver is adapted to the NIC driver, and that is recognized as an NIC driver by the OS (hereinafter referred to as an NW (Net Work) driver 513) is prepared in the memory 111 (see FIG. 3). By using the NW driver 513 (namely, the function realized by executing the software by the CPU 110), the server 101 can communicate with the NIC logic 130, thus allowing communication between servers. In this way, the software developed with the assumption that the conventional Ethernet is present can be used without any change.
FIG. 2 shows the details of the NIC logic. The NIC logic 130 transmits and receives data by dividing the Ethernet network packet into data of TLP which is the transfer unit of PCIe. The TLP can be transmitted and received between the NIC logics in different PCIe switches or between the NIC logic and the server 101.
The NIC logic 130 has the range register 300, to which the SPA 105 is allocated similar to the external port 120. Further, the NIC logic 130 includes a TX descriptor get pointer 400, a transmission TLP header replacement part 401, a TX command pool 402, a reception TLP header replacement part 410, and an RX key table 411.
The TX descriptor get pointer 400 indicates which value of the TX descriptor (described below) present on the memory 111 of the server 101 is to be transferred next. The transmission TLP header replacement part 401 is the part for replacing the header of the TLP including the data of the network packet received from the server 101, in order to transfer the data to the NIC logic present in another PCIe switch. The TX command Pool 402 temporarily the TX descriptor transmitted from the server in the NIC logic 130. The reception TLP header replacement part 410 is the part for replacing the header of the TLP received from the other NIC logic with the header addressed to the destination server. The RX key table 411 is a list of addresses on the memory of normal reception buffers (described below) on the memory of the server, indicating whether each normal reception buffer is in use or not.
FIG. 3 shows the data structure in the memory of the server involved in network packet communication. The memory 111 of the server 103 includes a copy 500 of the TX descriptor get pointer 400, TX descriptor put pointer 501, TX descriptor table 502, normal reception buffer 510, overflow reception buffer 511, and chunk 512.
The TX descriptor table 502 is a table for storing information of network packets to be transmitted, in which one entry is used for each network packet. Each entry is referred to as a TX descriptor. The copy 500 of the TX descriptor get pointer indicates which value of the TX descriptor is to be transferred next to the NCI logic 130. When a request for transmitting the next network packet is made, the TX descriptor put pointer 501 indicates where the information of the particular network packet should be recorded in the TX descriptor table 502. The TX descriptor table 502 has a ring-like shape. When the end of the TX descriptor table 502 is pointed, the TX descriptor get pointer 400 and the TX descriptor put pointer 501 will then return to the beginning.
When the TLP including the network packet information is received from the NIC logic 130, the normal reception buffer 510 temporarily stores the received information. Multiple normal reception buffers 501 exist with the assumption that multiple network packet information items arrive. The overflow reception buffer 511 is prepared for a case where received data is stored in all the normal reception buffers 510 and the normal reception buffers 510 would overflow. Unlike the normal reception buffer 510, the overflow reception buffer 511 may store information of different network packets at the same time. The information of one network packet is separately present on the memory. Each division unit is referred to as a chunk 512.
FIG. 4 shows the detailed configuration of the TX descriptor. The TX descriptor table 502 includes the following information: a dest SPA 521 indicating the destination of the network packet, a frame length 522 indicating the frame length of the network packet, and a list 523 of the chunk length and address for each chunk. The frame length 522 indicates the total value of all the chunk lengths. These information items are stored in the TX descriptor when the NW driver 513 receives a network packet transfer request from the CPU 110.
Next, the network packets transmission/reception operation between the servers 101 in the computer system 100 will be described with reference to FIGS. 5 to 8. Hereinafter, the transmission/reception process operation according to the present example will be described in terms of four aspects respectively: the process of a network packet in the transmission-side server (mainly, by the NW driver); the process in the NIC logic 130 within the transmission-side PCIe switch; the process in the NIC logic 130 within the reception-side PCIe switch; and the process in the reception-side server (mainly, by the NW driver).
<Process of the Transmission-Side Server>
FIG. 5 shows the transmission process of a network packet in the transmission-side server. The CPU 110 of the transmission-side server requests the NW driver 513 to transmit a network packet (S1000). Then, the NW driver 513 generates information of the TX descriptor, namely, the destination (dest) SPA, the frame length, the chunk length, and the address (S1001).
Next, the NW driver 513 checks if the TX descriptor table 502 has an empty space (S1002). In this step, the NW driver 513 compares the TX descriptor put pointer 501 to the copy 500 of the TX descriptor get pointer, and as a result, if the TX descriptor put pointer 501 is not the same as the value (which is, for example, (the copy 500 of the TX descriptor get pointer)−1), the NW driver 513 determines that the TX descriptor table 502 has an empty space. If the TX descriptor table 502 does not have any empty space, the NW driver 513 waits until there is an empty space. If the TX descriptor table 502 has an empty space, the NW driver 513 proceeds to S1003.
In S1003, the NW driver 513 stores the TX descriptor in the position of the TX descriptor table that corresponds to the address indicated by the TX descriptor put pointer 501 (S1003). Then, the NW driver 513 increments the TX descriptor put pointer by one (S1004).
<Process of the NIC Logic within the Transmission-Side PCIe Switch>
FIG. 6 shows the process of the NIC logic 130 within the transmission-side PCIe switch.
First, the NIC logic 130 checks if the TX descriptor table 502 has an entry (S1100). If the TX descriptor table 502 does not have any entry, the NIC logic 130 repeats the process of S1100. On the other hand, if the TX descriptor table 502 has an entry, the NIC logic 130 proceeds to S1101 (S1100).
In S1101, the NIC logic 130 checks if the TX command pool 402 has an empty space (namely, the NIC logic 130 checks if there is an empty space where the TX descriptor transferred from the server should be temporarily stored). As a result of the check, if there is no empty space, the NIC logic 130 repeats the process of S1101 until an empty space occurs. Then, as a result of the check, if there is an empty space, the NIC logic 130 proceeds to S1102. In S1102, the NIC logic 130 issues a memory read (MRd) request to the server 101, obtains the address of the TX descriptor by the calculation from the TX descriptor get pointer 400, and reads the TX descriptor with a memory read at the calculated address. When MRd request completion is returned to the NIC logic and the read operation is completed, the NIC logic 130 proceeds to S1103.
In S1103, the NIC logic 130 increments the TX descriptor get pointer 400 by one to release the entry of the TX descriptor table 502 from which the TX descriptor was read. Then, the NIC logic 130 writes the read TX descriptor into the TX command pool 402 (S1104). The address and length of each chunk are recorded in the read TX descriptor, and based on this information the NIC logic 130 issues an MRd request to the server to read the chunk (S1105).
The read chunk is transmitted to the NIC logic of the PCIe switch of the reception-side server (S1106). The data of the read chunk is returned from the server in the form of a completion TLP. Then, the transmission TLP header replacement part 401 replaces the header of the received TLP with the TLP header addressed to the reception-side TLP. The information of the SPA of the NIC logic of the reception-side server is recorded in the TX descriptor, so that the TLP is transmitted to the particular SPA (dest SPA 521).
Then, the NIC logic 130 determines whether it is the last TLP (S1107). In this step, the NIC logic 130 compares the accumulated length of all chunks for which read requests (MRD requests) has been made, to the frame length 522 included in the TLP descriptor. If the two lengths are the same, the NIC logic 130 determines that the reading of all chunks is completed and proceeds to S1108. On the other hand, if the two lengths are not the same, the NIC logic 130 determines that the chunks are not all read and returns to S1105.
In S1108, the reading of the chunk is completed and the information of the TX descriptor will not be necessary, so that the NIC logic 130 releases the entry of the TX command pool 402 (S1108). Then, the NIC 130 generates a transmission end interruption to notify the transmission-side server of the end of the network packet transmission (S1109).
<Process of the NIC Logic within the Reception-Side PCIe Switch>
FIG. 7 shows the process of the NIC logic on the reception side. When the TLP of the chunk data arrives at the NIC logic 130 of the PCIe switch 103 connected to the reception-side server 101 (S1200), the NIC logic 130 checks if the frame to which the received chunk belongs hits the RX key table 411 (S1201). Hitting the RX key table 411 means that the normal reception buffer is reserved for the particular frame in the memory 111 of the server 101. As a result of the check, if the frame hits the RX key table 411, the NIC logic 130 proceeds to S1205. On the other hand, if the frame does not fit the RX key table 411, the NIC logic 130 proceeds to S1202.
In S1202, the NIC logic 130 checks if the RX key table 411 has an empty space. As a result of the check, if there is no empty space, the NIC logic 130 proceeds to 1206. In other words, if the normal reception buffer or the RX key table 411 is not reserved for the received frame, the reception TLP header replacement part 410 replaces the data of the received chunk with the memory write (MWr) request addressed to the address of the overflow reception buffer, and transmits the TLP of the memory write request (S1206).
On the other hand, as a result of the check in S1202, if there is an empty space, the NIC logic 130 proceeds to S1203 to check the presence of the normal reception buffer 510 that can be used (S1203). As a result of the check, if the normal reception buffer that can be used is present, the NIC logic 130 performs the process of S1206. On the other hand, if the normal reception buffer that can be used is not present, the NIC logic 130 proceeds to S1204. In other words, since it has been checked that there is an empty space in the RX key table 411 and the normal reception buffer 510, the NIC logic 130 reserves the normal reception buffer and the RX key table for the received frame to write the information necessary for the reserved RX key table (S1204).
In S1205, the reception TLP header replacement part 410 replaces the data of the received chunk with the MWr request addressed to the address of the normal reception buffer, and transmits the TLP of the MWr request (S1205). The information of the normal reception buffer reserved for the particular frame to transmit the TLP is written in the RX key table 411.
Then, the NIC logic 130 checks if the received TLP is the last chunk (S1207). The chunks that the reception-side NIC logic receives do not necessarily arrive in the order of address. Thus, whether all chunks have been received is determined by checking if the accumulation of the length of received chunks is the same as the frame length. As a result of this determination, if the received TLP is not the last chunk, the NIC logic 130 proceeds to S1210 and ends the reception process.
On the other hand, if the received TLP is the last chunk, the NIC logic 130 proceeds to S1208. In other words, since all the chunks belonging to the particular frame have been received, the NIC logic 130 releases the RX key table 411 and the normal reception buffer 510 that are reserved for the particular frame (S1208). Then, the NIC logic 130 generates an interruption to notify the server that the reception of chunks has been completed (S1209), and ends the reception process (S1210). When the reception process of the particular TLP is ended, the NIC logic 130 waits until the next TLP arrives.
<Process of the Reception-Side Server>
FIG. 8 shows the reception process in the reception-side server.
When the interruption from the NIC logic 130 of the reception-side server is received (S1300), all the data of the frame has already arrived at the reception buffer 510. The received data is arranged in the order of arrival time on the memory 111. Thus, the NW driver rearranges the data on the reception buffer in the order of address to restore the network packet (S1301). After rearranging the data, the NW driver passes the network packet to the CPU 110 (S1302). The above is the procedure for transferring the network packet from the transmission-side server to the reception-side server.
EXAMPLE 2
The present example shows an example where multiple servers are connected to a single PCIe switch with multiple VLANs (Virtual LANs) present in a computer system.
FIG. 9 is an overall block diagram of a computer system. In a computer system 100 shown in FIG. 9, the same reference numerals as those shown in FIG. 1 of Example 1 have the same components and functions. The description of these components will be omitted to avoid redundancy. In FIG. 9, the difference from the configuration in FIG. 1 is that multiple servers 101 are connected to a single PCIe switch 103, and that the NIC logic 130 includes a SUB_ALCMAP (Sub Address Allocation Map) 302, a VLAN_MAP 303, a broadcast routing table 304, and an INUA 305. The NUA is a unique number in the system that is allocated to each NIC logic to identify each NIC logic from others. In addition, the field of the Bus#-SPA conversion table 301 is extended.
FIG. 10 is a schematic block diagram of the computer system to illustrate the present example. When multiple servers 101 are connected to a single PCIe switch 103 and multiple virtual machines (VMs) are present in each server, the NIC logic 130 must pretend as if one virtual NIC virtually exists for each server and each virtual machine, although only one NIC logic 130 exists in the PCIe switch 103. This false NIC is referred to as a virtual NIC 107. In FIG. 9, the additional components of the NIC logic are necessary to achieve virtual NIC. Further, numbers starting from 0 uniquely assigned to each virtual NIC in each of the NIC logics are referred to as sub addresses (SUBA).
FIG. 11 shows a TLP for unicast and a TLP for broadcast, respectively, which are transmitted and received between NIC logics. (a) shows a unicast TLP 200 and (b) shows a broadcast TLP 201. Reference numeral 210 denotes a broadcast bit, where “1” is recorded for the broadcast TLP and “0” is recorded for the unicast TLP. In a VLAN# field 211, VLAN# to which the server outputting the TLP belongs is described. In a destSUBA field 212, a SUBA corresponding to the server which is the destination of the TLP is recorded. In a destSPA field 213, the SPA of the NIC logic which is the destination of the unicast TLP is recorded. In a srcNUA field, the NUA of the NIC logic which is the output source of the broadcast TLP is recorded. In the case of the broadcast TLP, the destSPA field is not necessary because the TLP is delivered to all the SUBAs that belong to the same VLAN.
FIG. 12 shows an example of the structure of the Bus#-SPA conversion table 301 according to the present example. When multiple servers are connected to a single PCIe switch or when multiple virtual machines are running on a certain server, one NIC must virtually exist for each of the servers and virtual machines. Further, in the case where multiple VLAN exist or a broadcast packet is transferred, the broadcast packet should be transferred only to the server belonging to the same VLAN, and the broadcast packet should not be transferred to the server belonging to a different VLAN.
Thus, it is necessary to provide, on the NIC logic side, means for identifying the server or virtual machine from which the receive TLP is transmitted. Thus, the Bus#-SPA conversion table 301 is extended to provide an endpoint virtual hierarchy (EVH) field 312, in addition to the BUS# field 310 and the SPA field 311 that are already present in the Bus#-SPA conversion table 301. The EVH 312 is the number uniquely assigned to each of the servers with which one NIC logic communicates. However, the same number may be assigned to servers that communicate with different NIC logics.
When the TLP is input to the external port from the server, the EVH is added together with the SPA. The value of the EVH field is determined in advance so that the EVH to be added matches the SUBA of the virtual NIC used by the server. When the TLP arrives at the NIC logic, the NIC logic checks the EVH to identify the server from which the TLP is output.
Although the identification of servers is possible by means of the EVH 312, the identification of multiple virtual machines running on the server may not be possible. It is because the virtual machine from which the TLP is output may not be identified by the external port where the EVH is added to the input TLP. It is possible to use BDF#, which is the field existing in the TLP from the beginning, in order to distinguish the virtual machine from others. A part of the BDF# is not actually used for the routing. A portion of this part is used to identify each of the virtual machines. This part is referred to as a virtual machine identifier.
It is assumed that the virtual machine identifier is used for the initial setting starting from 0. If (virtual machine EVH+virtual machine identifier) is allocated to match the SUBA that is allocated to each virtual machine of each server, it is possible to identify the server or virtual machine from which the TLP is output when the NIC logic receives the particular TLP. (Hereinafter, the value of ALCMAP with the field of SUBA written in the position X is referred to as SUBA_ALCAMP[X]).
When the server outputs a TLP having an invalid virtual machine identifier due to a bug or malicious user, the NIC logic may misidentify the server as the source of the TLP. Note that the EVH is added on the switch side and not on the server side, so that there is no chance the server will pretend. The SUB_ALCMAP (Sub Address Allocation Map) 302 (see FIG. 14) is necessary to prevent the NIC logic from misidentifying the server as the source.
FIG. 14 shows the structure of the SUBA_ALCAMP 302. Further, FIG. 15 is a view showing the formation of the structure. In the SUBA_ALCMAP 302, SUB address (SUBA) is recorded in a SUBA field 320. In an ALCMP field 321, “1” is recorded if the SUBA is the smallest of the SUBA allocated to a certain server, otherwise “0” is recorded. For example, if three virtual machines are running on a server #3, three SUB addresses of SUB addresses 4 to 6 are allocated to the server #3. Then, the smallest SUBA of the three SUBAs is “4”, so that “1” is recorded in the fourth position of the ALCMP field, and “0” is recorded in the fifth and sixth positions of the ALCMP field.
The virtual machine identifier is used starting from 0. Thus, the range of the SUBA allocated to one server is from (SUBA for which “1” is recorded in SUBA_ALCMAP) to (SUBA−1 for which “1” is recorded in the next SUBA_ALCMAP). By using this property, it is possible to prevent the NIC logic from misidentifying the server as the source of the TLP.
FIG. 13 is a flow chart of the process of checking the access right by the NIC logic. When the TLP arrives at the NIC logic 130 (S1500), the NIC logic 130 calculates a SUBA (S1501). In other words, the NIC logic 130 checks if the virtual machine identifier is “0”. If the virtual machine identifier is “0”, the NIC logic 130 is going to access the smallest of the SUBAs allocated to the server that outputs the TLP. At least one SUBA is allocated to each server, and the NIC logic 130 can access the particular SURA. Thus, the NIC logic 130 proceeds to S1504, or otherwise, proceeds to S1503.
In S1503, the NIC logic 130 checks if the virtual machine identifiers are all “0” in the range from SUBA_ALCMP[EVH+1] to SUBA_ALCMP[SUBA]. If all the virtual machine identifiers are not “0”, the SUBA is larger than the SUBA allocated to the server. Thus, the access to the particular SUBA is not possible. Then, the NIC logic 130 proceeds to S1505. If all the virtual machine identifiers are “0”, the access to the particular SUBA is possible. Then, the NIC logic 130 proceeds to S1504.
Next, the method of broadcasting on Ethernet will be described.
FIG. 16 shows VLAN_MAP 303. The VLAN_MAP 303 is a list showing the VLAM to which each SUBA belongs. The SUBA field 331 is set for the VLAN field 303, where “1” is recorded in the part of SUBA belonging to VLAN. A SUBA is uniquely allocated to each server or virtual machine. Thus, the VLAN_MAP 303 shows which server or virtual machine belongs to which VLAN.
FIG. 17 shows a broadcast routing table 304. The broadcast routing table 304 shows the port to which a broadcast TLP is transferred according to the NIC logic which is the source of the TLP. An NUA field 340 is a field where the NUA of the source NIC logic of the broadcast TLP is recorded. In a port# field 341, when a TLP from an NUA is input, “1” is recorded in the part of the port of the PCIe switch to which the TLP should be transferred, and “0” is recorded in the part of the port of the switch to which the TLP should not be transferred.
Next, the process of transferring broadcast packets between servers will be described.
<Transmission Process>
The process in the transmission-side server is the same as the process shown in FIG. 5.
FIG. 18 shows the process of the NIC logic of the transmission-side server. In S1600, the NIC logic performs the same process as in S1100 to S1105 in FIG. 6. The NIC logic obtains the information of a chunk on the memory of the server, based on the information of the TX descriptor.
In S1601, the NIC logic generates a TLP for broadcast with the content of the chunk as the payload, based on the information of the TX descriptor. In S1602, the NIC logic refers to the entry of [own NUA] of the Broadcast_Routing_Table 304. The TLP should be transferred to the port with “1” recorded in the port# field 341, so that the NIC logic transfers the TLP generated in S1601 to the corresponding port. Note that if “1” is not recorded in any part of the port# field 341, the NIC logic does not transfer the TLP.
Then, in S1603, the NIC logic refers to the VLAN_Map 303 and transfers the TLP generated in S1601 to every SUBA belonging to the VLAN to which the broadcast packet belongs. In S1604, the SUBA receiving the TLP performs the same process as the process shown in FIG. 7 to receive the TLP. Further, in S1605, the NIC logic performs the same process as in S1107 to S1109 shown in FIG. 6 to obtain the remaining chunks or end the transmission process.
<Reception/Transfer Process>
FIG. 19 shows the process of the NIC logic in the reception-side server.
When the PCIe switch 101 of the reception-side server receives a broadcast TLP (S1700), the PCIe switch transfers the broadcast TLP to the NIC logic 130 within the switch (S1701). If the TLP is for unicast, the PCIe switch 101 checks the destination SPA and transfers the unicast TLP. However, if the TLP is for broadcast, the PCIe switch 101 unconditionally transfers the broadcast TLP to the NIC logic 130 within the PCIe switch.
In S1702, the NIC logic 130 refers to the entry of [srcNUA] of the broadcast routing table 304. Here, the srcNUA means that the TLP should be transferred to the port with “1” recorded as the NUA of the source NIC logic of the broadcast TLP. Thus, the NIC logic 130 transfers the input TLP to each port.
Then, in S1703, the NIC logic 130 refers to the VLAN_Map 303 and transfers the input TLP to every SUBA belonging to the VLAN to which the broadcast packet belongs. Each SUBA receiving the TLP performs the same process as the process shown in FIG. 7 to receive the TLP (S1704).
REFERENCE SIGNS LIST
100 . . . Computer system
101 . . . Server
102 . . . PCIe link
103 . . . PCIe switch
104 . . . PCIe device
105 . . . System port address (SPA)
110 . . . CPU
111 . . . Memory
112 . . . Chip set
120 . . . External port
121 . . . Internal port
130 . . . NIC logic
200 . . . Unicast TLP
202 . . . Broadcast TLP
210 . . . Broadcast bit
211 . . . VLAN# field
212 . . . destSUBA field
213 . . . destNUA field
214 . . . srcNUA field
300 . . . SPA range register
301 . . . Bus#-SPA conversion table
302 . . . Sub Address Allocation Map
303 . . . VLAN Map
304 . . . Broadcast Routing Table
400 . . . TX Descriptor Get Pointer
401 . . . Transmission TLP header replacement part
402 . . . TX Command Pool
410 . . . Reception TLP header replacement part
411 . . . RX Key Table
500 . . . Copy of TX Descriptor Get Pointer
501 . . . TX Descriptor Put Pointer
502 . . . TX Descriptor Table
510 . . . Normal reception buffer
511 . . . Overflow reception buffer
512 . . . Chunk
513 . . . NW driver
521 . . . DestSPA field
522 . . . Frame Length field
523 . . . Chunk information field
|
{
"url": "http://www.freepatentsonline.com/9479461.html",
"source_domain": "www.freepatentsonline.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "82587",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SDYRUCTFHJOX7CAZQQ3IGNGG2G3RWSJ5",
"WARC-Concurrent-To": "<urn:uuid:87e5b839-705c-4526-a593-65c2b22f4cb7>",
"WARC-Date": "2018-08-15T10:52:03Z",
"WARC-IP-Address": "144.202.252.20",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:D7CMGIIEYH33HPAWDGNVCJDB4HMIMXHA",
"WARC-Record-ID": "<urn:uuid:b36353a3-1b69-49fd-98b4-4aaf20a5c671>",
"WARC-Target-URI": "http://www.freepatentsonline.com/9479461.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d1843bb-65f5-432b-b0b0-eee46798c4c8>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-178-124-6.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,
75,
104,
105,
106,
116,
942,
943,
944,
945,
956,
983,
1009,
1039,
1059,
1069,
1087,
1098,
1111,
1122,
1132,
1158,
1173,
1177,
1200,
1233,
1250,
1275,
1295,
1296,
1297,
1298,
1318,
1399,
1452,
1553,
1597,
1786,
1840,
1858,
1871,
1896,
1919,
1927,
1953,
1954,
5612,
5613,
6027,
6028,
6407,
6408,
6964,
6965,
8807,
8808,
9287,
9288,
9833,
9834,
10341,
10342,
12957,
12958,
14187,
14188,
14613,
14614,
15004,
15005,
15571,
15572,
15585,
15586,
15602,
15603,
15883,
15884,
15899,
15900,
16259,
16260,
16862,
16863,
16877,
16878,
16896,
16897,
16971,
16972,
17045,
17046,
17120,
17121,
17142,
17143,
17161,
17162,
17688,
17689,
17868,
17869,
17889,
17890,
19368,
19369,
21019,
21020,
21162,
21163,
21197,
21198,
21679,
21680,
21710,
21711,
21804,
21805,
21881,
21882,
21967,
21968,
22061,
22062,
22189,
22190,
22304,
22305,
22416,
22417,
22531,
22532,
22612,
22613,
22698,
22699,
22815,
22816,
22920,
22921,
23027,
23028,
23119,
23120,
23214,
23215,
23288,
23289,
23377,
23378,
23507,
23508,
23648,
23649,
23676,
23677,
23787,
23788,
23798,
23799,
24344,
24345,
25084,
25085,
25778,
25779,
26330,
26331,
26699,
26700,
27436,
27437,
27865,
27866,
28484,
28485,
28802,
28803,
29127,
29128,
30025,
30026,
30350,
30351,
31116,
31117,
31851,
31852,
32389,
32390,
33010,
33011,
33053,
33054,
33419,
33420,
34081,
34082,
34347,
34348,
34416,
34417,
34505,
34506,
34804,
34805,
35644,
35645,
36096,
36097,
36617,
36618,
37146,
37147,
37494,
37495,
37560,
37561,
38219,
38220,
38740,
38741,
39502,
39503,
39864,
39865,
40350,
40351,
40952,
40953,
40992,
40993,
41058,
41059,
41653,
41654,
41664,
41665,
41828,
41829,
42575,
42576,
43260,
43261,
44136,
44137,
44723,
44724,
45307,
45308,
45665,
45666,
46312,
46313,
46805,
46806,
47252,
47253,
47919,
47920,
48268,
48269,
48862,
48863,
49350,
49351,
49415,
49416,
49775,
49776,
50323,
50324,
50411,
50412,
50435,
50436,
50524,
50525,
50808,
50809,
51329,
51330,
51777,
51778,
51807,
51808,
51881,
51882,
52314,
52315,
52618,
52619,
52896,
52897,
52918,
52919,
52945,
52946,
52963,
52964,
52984,
52985,
53007,
53008,
53030,
53031,
53067,
53068,
53082,
53083,
53100,
53101,
53120,
53121,
53145,
53146,
53170,
53171,
53191,
53192,
53214,
53215,
53239,
53240,
53264,
53265,
53287,
53288,
53313,
53314,
53338,
53339,
53362,
53363,
53392,
53393,
53429,
53430,
53467,
53468,
53487,
53488,
53522,
53523,
53559,
53560,
53611,
53612,
53638,
53639,
53687,
53688,
53711,
53712,
53756,
53757,
53793,
53794,
53824,
53825,
53859,
53860,
53896,
53897,
53913,
53914,
53934,
53935,
53959,
53960,
53989,
53990
],
"line_end_idx": [
7,
75,
104,
105,
106,
116,
942,
943,
944,
945,
956,
983,
1009,
1039,
1059,
1069,
1087,
1098,
1111,
1122,
1132,
1158,
1173,
1177,
1200,
1233,
1250,
1275,
1295,
1296,
1297,
1298,
1318,
1399,
1452,
1553,
1597,
1786,
1840,
1858,
1871,
1896,
1919,
1927,
1953,
1954,
5612,
5613,
6027,
6028,
6407,
6408,
6964,
6965,
8807,
8808,
9287,
9288,
9833,
9834,
10341,
10342,
12957,
12958,
14187,
14188,
14613,
14614,
15004,
15005,
15571,
15572,
15585,
15586,
15602,
15603,
15883,
15884,
15899,
15900,
16259,
16260,
16862,
16863,
16877,
16878,
16896,
16897,
16971,
16972,
17045,
17046,
17120,
17121,
17142,
17143,
17161,
17162,
17688,
17689,
17868,
17869,
17889,
17890,
19368,
19369,
21019,
21020,
21162,
21163,
21197,
21198,
21679,
21680,
21710,
21711,
21804,
21805,
21881,
21882,
21967,
21968,
22061,
22062,
22189,
22190,
22304,
22305,
22416,
22417,
22531,
22532,
22612,
22613,
22698,
22699,
22815,
22816,
22920,
22921,
23027,
23028,
23119,
23120,
23214,
23215,
23288,
23289,
23377,
23378,
23507,
23508,
23648,
23649,
23676,
23677,
23787,
23788,
23798,
23799,
24344,
24345,
25084,
25085,
25778,
25779,
26330,
26331,
26699,
26700,
27436,
27437,
27865,
27866,
28484,
28485,
28802,
28803,
29127,
29128,
30025,
30026,
30350,
30351,
31116,
31117,
31851,
31852,
32389,
32390,
33010,
33011,
33053,
33054,
33419,
33420,
34081,
34082,
34347,
34348,
34416,
34417,
34505,
34506,
34804,
34805,
35644,
35645,
36096,
36097,
36617,
36618,
37146,
37147,
37494,
37495,
37560,
37561,
38219,
38220,
38740,
38741,
39502,
39503,
39864,
39865,
40350,
40351,
40952,
40953,
40992,
40993,
41058,
41059,
41653,
41654,
41664,
41665,
41828,
41829,
42575,
42576,
43260,
43261,
44136,
44137,
44723,
44724,
45307,
45308,
45665,
45666,
46312,
46313,
46805,
46806,
47252,
47253,
47919,
47920,
48268,
48269,
48862,
48863,
49350,
49351,
49415,
49416,
49775,
49776,
50323,
50324,
50411,
50412,
50435,
50436,
50524,
50525,
50808,
50809,
51329,
51330,
51777,
51778,
51807,
51808,
51881,
51882,
52314,
52315,
52618,
52619,
52896,
52897,
52918,
52919,
52945,
52946,
52963,
52964,
52984,
52985,
53007,
53008,
53030,
53031,
53067,
53068,
53082,
53083,
53100,
53101,
53120,
53121,
53145,
53146,
53170,
53171,
53191,
53192,
53214,
53215,
53239,
53240,
53264,
53265,
53287,
53288,
53313,
53314,
53338,
53339,
53362,
53363,
53392,
53393,
53429,
53430,
53467,
53468,
53487,
53488,
53522,
53523,
53559,
53560,
53611,
53612,
53638,
53639,
53687,
53688,
53711,
53712,
53756,
53757,
53793,
53794,
53824,
53825,
53859,
53860,
53896,
53897,
53913,
53914,
53934,
53935,
53959,
53960,
53989,
53990,
54023
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 54023,
"ccnet_original_nlines": 372,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40029874444007874,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08177745342254639,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16187453269958496,
"rps_doc_frac_unique_words": 0.08625481277704239,
"rps_doc_mean_word_length": 4.60378360748291,
"rps_doc_num_sentences": 396,
"rps_doc_symbol_to_word_ratio": 0.001960420049726963,
"rps_doc_unigram_entropy": 5.078921794891357,
"rps_doc_word_count": 9356,
"rps_doc_frac_chars_dupe_10grams": 0.29415178298950195,
"rps_doc_frac_chars_dupe_5grams": 0.5757667422294617,
"rps_doc_frac_chars_dupe_6grams": 0.488148033618927,
"rps_doc_frac_chars_dupe_7grams": 0.40456900000572205,
"rps_doc_frac_chars_dupe_8grams": 0.36322057247161865,
"rps_doc_frac_chars_dupe_9grams": 0.326933354139328,
"rps_doc_frac_chars_top_2gram": 0.029136579483747482,
"rps_doc_frac_chars_top_3gram": 0.024771900847554207,
"rps_doc_frac_chars_top_4gram": 0.019501779228448868,
"rps_doc_books_importance": -4866.03955078125,
"rps_doc_books_importance_length_correction": -4866.03955078125,
"rps_doc_openwebtext_importance": -3199.9228515625,
"rps_doc_openwebtext_importance_length_correction": -3199.9228515625,
"rps_doc_wikipedia_importance": -2215.25634765625,
"rps_doc_wikipedia_importance_length_correction": -2215.25634765625
},
"fasttext": {
"dclm": 0.5113043785095215,
"english": 0.8993456959724426,
"fineweb_edu_approx": 3.0241353511810303,
"eai_general_math": 0.783480703830719,
"eai_open_web_math": 0.23244768381118774,
"eai_web_code": 0.46461570262908936
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.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": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "11",
"label": "Legal/Regulatory"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,456,918,417,240,694,000
|
PDA
View Full Version : A Troubled Notebook Buyer...
oweneck
2005-03-21, 00:28
I got my first powerbook a couple of years ago now and made the switch and became a very big apple fan from there on, but a few months had to let mine go and since I have been stuck leeching off of friends and landlords computers, and am wanting to get back and buy a new notebook but not sure which.
I have a small backpack that id like to carry it in amongst other things (damage isnt a concern here) and am thinking only a 12" will do, though could put it in something else and get a 15" (because im not sure how much the understandable 1024x768 screen resolution restrictions on the 12" models work out, especially when I deal with a lot of photos and webgraphics through adobe photoshop, though I have worked happilly on lower resolutions before), my biggest concern however is price (it always is) ive got a budget of $1500 USD (although I live in Canada) so unless im able to find a 15" powerbook for around the price, thats out of the question... but im unsure whether to buy iBook or PowerBook, external hardware quality which is best, both acceptable?... screen quality also? id happily get the 12" powerbook... but I dunno im just very very confused on which to get, pb range has just been updated and seems more sensible to choose, but if so I guess my last and biggest question would be where would people recommend buying from for the cheapest? and preferably within Canada? I have seen http://shop.vendio.com/discountlaptop/item/757547282/index.html but unsure whether the ones they would sell would actually be the latest models, and whether it would be worth it anyway as their website looks rather sketchy, but any advice on anything (its a large area, sorry very confused I guess on choices) would be greatfully appreciative.
Thank you.
flail
2005-03-21, 00:49
Hey welcome to the forums!
Regarding the decisions on getting an iBook or PB, check out existing threads here (http://forums.applenova.com/showthread.php?t=4544&highlight=trackpad) and here (http://forums.applenova.com/showthread.php?t=4957&highlight=ibook) .
Personally, I use Photoshop for a lot for photo work for publications and web graphics and I am fine with the resolution on my 12" PB. The size is just perfect and I am constantly impressed with its performance. I would actually rather have it opposed to the 15" even if money were no object.
:eek: Wow, that price on the site is lower than the edu discount! That's the current model too. On the other hand, you get free shipping with the Apple store, and I would feel better about ordering from there anyway.
ast3r3x
2005-03-21, 06:15
You still might want to try and upgrade the RAM then if your going to be working in photoshop a lot.
FFL
2005-03-21, 21:45
http://store.apple.com/1-800-MY-APPLE/WebObjects/AppleStore?family=Sale
Refurbished SuperDrive 12" PowerBook on sale for $300 off.
|
{
"url": "http://forums.applenova.com/archive/index.php/t-5135.html",
"source_domain": "forums.applenova.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "5111",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GDZ2TT5P5O776X474JJSI4FWXIXGLLTC",
"WARC-Concurrent-To": "<urn:uuid:2c35db4b-d109-4080-a868-babc567be6d0>",
"WARC-Date": "2013-06-19T05:49:22Z",
"WARC-IP-Address": "67.18.208.164",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QITDTLTSUPVTAS5YZ2TIITSELHQVN2OU",
"WARC-Record-ID": "<urn:uuid:40f79f6e-9a4c-47c5-b931-aa75ce4f3ae4>",
"WARC-Target-URI": "http://forums.applenova.com/archive/index.php/t-5135.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3055c05d-521a-4823-ba37-900eeb5594b9>"
},
"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,
55,
56,
57,
65,
83,
384,
385,
1829,
1830,
1841,
1842,
1848,
1866,
1893,
2126,
2127,
2420,
2421,
2638,
2639,
2647,
2665,
2766,
2767,
2771,
2789,
2861,
2862
],
"line_end_idx": [
1,
5,
6,
55,
56,
57,
65,
83,
384,
385,
1829,
1830,
1841,
1842,
1848,
1866,
1893,
2126,
2127,
2420,
2421,
2638,
2639,
2647,
2665,
2766,
2767,
2771,
2789,
2861,
2862,
2920
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2920,
"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.42283952236175537,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037037041038274765,
"rps_doc_frac_lines_end_with_ellipsis": 0.03125,
"rps_doc_frac_no_alph_words": 0.23765431344509125,
"rps_doc_frac_unique_words": 0.5469728708267212,
"rps_doc_mean_word_length": 4.782880783081055,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.006172840017825365,
"rps_doc_unigram_entropy": 5.155544757843018,
"rps_doc_word_count": 479,
"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.008729809895157814,
"rps_doc_frac_chars_top_3gram": 0.005237889941781759,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -286.1062927246094,
"rps_doc_books_importance_length_correction": -286.1062927246094,
"rps_doc_openwebtext_importance": -153.51522827148438,
"rps_doc_openwebtext_importance_length_correction": -153.51522827148438,
"rps_doc_wikipedia_importance": -118.61575317382812,
"rps_doc_wikipedia_importance_length_correction": -118.61575317382812
},
"fasttext": {
"dclm": 0.025131110101938248,
"english": 0.9507229328155518,
"fineweb_edu_approx": 0.7571853995323181,
"eai_general_math": 0.14239168167114258,
"eai_open_web_math": 0.12359768152236938,
"eai_web_code": 0.04374777898192406
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,312,086,003,789,902,000
|
编程爱好者之家
javascript 同步异步讲解
2018-08-10 162
avaScript语言的一大特点就是单线程，也就是说，同一个时间只能做一件事。那么，为什么JavaScript不能有多个线程呢？这样能提高效率啊。
JavaScript的单线程，与它的用途有关。作为浏览器脚本语言，JavaScript的主要用途是与用户互动，以及操作DOM。这决定了它只能是单线程，否则会带来很复杂的同步问题。比如，假定JavaScript同时有两个线程，一个线程在某个DOM节点上添加内容，另一个线程删除了这个节点，这时浏览器应该以哪个线程为准？
所以，为了避免复杂性，从一诞生，JavaScript就是单线程，这已经成了这门语言的核心特征，将来也不会改变。
为了利用多核CPU的计算能力，HTML5提出Web Worker标准，允许JavaScript脚本创建多个线程，但是子线程完全受主线程控制，且不得操作DOM。所以，这个新标准并没有改变JavaScript单线程的本质。
其实同步和异步，无论如何，做事情的时候都是只有一条流水线（单线程），同步和异步的差别就在于这条流水线上各个流程的执行顺序不同。
最基础的异步是setTimeout和setInterval函数，很常见，但是很少人有人知道其实这就是异步，因为它们可以控制js的执行顺序。我们也可以简单地理解为：可以改变程序正常执行顺序的操作就可以看成是异步操作。
<script type="text/javascript">
console.log( "1" );
setTimeout(function() {
console.log( "2" )
}, 0 );
setTimeout(function() {
console.log( "3" )
}, 0 );
setTimeout(function() {
console.log( "4" )
}, 0 );
console.log( "5" );
</script>
clipboard.png
尽管我们设置了setTimeout（function，time）中的等待时间为0，结果其中的function还是后执行。
火狐浏览器的api文档有这样一句话：Because even though setTimeout was called with a delay of zero, it's placed on a queue and scheduled to run at the next opportunity, not immediately. Currently executing code must complete before functions on the queue are executed, the resulting execution order may not be as expected.
意思就是：尽管setTimeout的time延迟时间为0，其中的function也会被放入一个队列中，等待下一个机会执行，当前的代码（指不需要加入队列中的程序）必须在该队列的程序完成之前完成，因此结果可能不与预期结果相同。
这里说到了一个“队列”（即任务队列），该队列放的是什么呢，放的就是setTimeout中的function，这些function依次加入该队列，即该队列中所有function中的程序将会在该队列以外的所有代码执行完毕之后再以此执行，这是为什么呢？因为在执行程序的时候，浏览器会默认setTimeout以及ajax请求这一类的方法都是耗时程序（尽管可能不耗时），将其加入一个队列中，该队列是一个存储耗时程序的队列，在所有不耗时程序执行过后，再来依次执行该队列中的程序。
又回到了最初的起点——javascript是单线程。单线程就意味着，所有任务需要排队，前一个任务结束，才会执行后一个任务。如果前一个任务耗时很长，后一个任务就不得不一直等着。于是就有一个概念——任务队列。如果排队是因为计算量大，CPU忙不过来，倒也算了，但是很多时候CPU是闲着的，因为IO设备（输入输出设备）很慢（比如Ajax操作从网络读取数据），不得不等着结果出来，再往下执行。于是JavaScript语言的设计者意识到，这时主线程完全可以不管IO设备，挂起处于等待中的任务，先运行排在后面的任务。等到IO设备返回了结果，再回过头，把挂起的任务继续执行下去。
于是，所有任务可以分成两种，一种是同步任务（synchronous），另一种是异步任务（asynchronous）。同步任务指的是，在主线程上排队执行的任务，只有前一个任务执行完毕，才能执行后一个任务；异步任务指的是，不进入主线程、而进入"任务队列"（task queue）的任务，只有等主线程任务执行完毕，"任务队列"开始通知主线程，请求执行任务，该任务才会进入主线程执行。
具体来说，异步运行机制如下：
（1）所有同步任务都在主线程上执行，形成一个执行栈（execution context stack）。
（2）主线程之外，还存在一个"任务队列"（task queue）。只要异步任务有了运行结果，就在"任务队列"之中放置一个事件。
（3）一旦"执行栈"中的所有同步任务执行完毕，系统就会读取"任务队列"，看看里面有哪些事件。那些对应的异步任务，于是结束等待状态，进入执行栈，开始执行。
（4）主线程不断重复上面的第三步。
只要主线程空了，就会去读取"任务队列"，这就是JavaScript的运行机制。这个过程会不断重复。
"任务队列"是一个事件的队列（也可以理解成消息的队列），IO设备完成一项任务，就在"任务队列"中添加一个事件，表示相关的异步任务可以进入"执行栈"了。主线程读取"任务队列"，就是读取里面有哪些事件。
"任务队列"中的事件，除了IO设备的事件以外，还包括一些用户产生的事件（比如鼠标点击、页面滚动等等），比如$(selectot).click(function)，这些都是相对耗时的操作。只要指定过这些事件的回调函数，这些事件发生时就会进入"任务队列"，等待主线程读取。
所谓"回调函数"（callback），就是那些会被主线程挂起来的代码，前面说的点击事件$(selectot).click(function)中的function就是一个回调函数。异步任务必须指定回调函数，当主线程开始执行异步任务，就是执行对应的回调函数。例如ajax的success，complete，error也都指定了各自的回调函数，这些函数就会加入“任务队列”中，等待执行。
同类文章
您的赞赏是对小编最大的支持！
|
{
"url": "https://www.codelovers.cn/article/20180810090132.html",
"source_domain": "www.codelovers.cn",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "31528",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4YGNPJ4QK5AP762RLC436YTAPHHQZ7H6",
"WARC-Concurrent-To": "<urn:uuid:be350d84-c8f1-4e3a-b0bb-cf14176b4fb8>",
"WARC-Date": "2021-07-26T16:04:52Z",
"WARC-IP-Address": "47.104.156.28",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LNK756CTDDUJ33XKKYRJ3VEQHRGTKXVP",
"WARC-Record-ID": "<urn:uuid:b86daab8-48d5-4a25-be03-9ae77f5a95f5>",
"WARC-Target-URI": "https://www.codelovers.cn/article/20180810090132.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c2a657f0-ae41-4c0c-bdc0-64c33653fd12>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-218.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
27,
28,
43,
44,
118,
119,
278,
279,
337,
338,
450,
451,
517,
518,
626,
660,
690,
724,
757,
775,
809,
842,
860,
894,
927,
945,
975,
985,
986,
1000,
1001,
1064,
1065,
1372,
1373,
1487,
1488,
1724,
1725,
2009,
2010,
2201,
2202,
2219,
2220,
2274,
2275,
2341,
2342,
2421,
2422,
2442,
2443,
2495,
2496,
2598,
2599,
2736,
2737,
2930,
2931,
2932,
2933,
2938,
2939
],
"line_end_idx": [
8,
9,
27,
28,
43,
44,
118,
119,
278,
279,
337,
338,
450,
451,
517,
518,
626,
660,
690,
724,
757,
775,
809,
842,
860,
894,
927,
945,
975,
985,
986,
1000,
1001,
1064,
1065,
1372,
1373,
1487,
1488,
1724,
1725,
2009,
2010,
2201,
2202,
2219,
2220,
2274,
2275,
2341,
2342,
2421,
2422,
2442,
2443,
2495,
2496,
2598,
2599,
2736,
2737,
2930,
2931,
2932,
2933,
2938,
2939,
2953
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2953,
"ccnet_original_nlines": 67,
"rps_doc_curly_bracket": 0.002031829906627536,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05063290894031525,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01989150047302246,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7649186253547668,
"rps_doc_frac_unique_words": 0.8484848737716675,
"rps_doc_mean_word_length": 25.696969985961914,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.34394645690918,
"rps_doc_word_count": 99,
"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.033018868416547775,
"rps_doc_frac_chars_top_3gram": 0.02279873937368393,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -291.558349609375,
"rps_doc_books_importance_length_correction": -291.558349609375,
"rps_doc_openwebtext_importance": -173.0443572998047,
"rps_doc_openwebtext_importance_length_correction": -173.0443572998047,
"rps_doc_wikipedia_importance": -104.45978546142578,
"rps_doc_wikipedia_importance_length_correction": -104.45978546142578
},
"fasttext": {
"dclm": 0.07754843682050705,
"english": 0.004796979948878288,
"fineweb_edu_approx": 1.434518575668335,
"eai_general_math": 0.32770979404449463,
"eai_open_web_math": 0.17946720123291016,
"eai_web_code": 0.22691136598587036
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,681,246,956,956,245,000
|
Menu
Question Index
...
What will be the output of the following program?
class WhileExample
{
public static void main(String s[])
{
int n = 0;
int sum = 0;
while( n <= 6 )
{
sum += n++;
}
System.out.println("sum = " + sum);
}
}
sum = 21
sum = 28
Goes into infinite loop
n = 0
n = 1
n = 2
n = 3
n = 4
n = 5
n = 6
sum = 21
Doubts
Problems
Topic: while Loop In Java
Read this topic
Take test on this topic
0
Wrong
Score more than 2 points
© meritcampus 2019
All Rights Reserved.
Open In App
|
{
"url": "https://java.meritcampus.com/core-java-questions/Calculate-sum-of-numbers-using-while",
"source_domain": "java.meritcampus.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "202626",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OIWBF2DVMTFLZLCP4U6C5277B4KSITDM",
"WARC-Concurrent-To": "<urn:uuid:43ef1846-7695-46ff-95b6-b5049181de9e>",
"WARC-Date": "2020-12-03T11:34:58Z",
"WARC-IP-Address": "138.197.232.42",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Y574GCTMPPFZF2R5JLL654WF6X6B7AUF",
"WARC-Record-ID": "<urn:uuid:55e487a1-4fba-4ac3-84e6-40179b251e7a>",
"WARC-Target-URI": "https://java.meritcampus.com/core-java-questions/Calculate-sum-of-numbers-using-while",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ae6ada6e-324e-41cf-9d28-1cdf05113104>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-29.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,
5,
20,
24,
25,
75,
76,
95,
97,
137,
143,
162,
163,
184,
185,
209,
219,
243,
253,
254,
298,
304,
306,
307,
308,
317,
326,
350,
356,
362,
368,
374,
380,
386,
392,
401,
402,
409,
410,
419,
420,
446,
447,
463,
487,
488,
490,
496,
521,
522,
541,
542,
563,
564
],
"line_end_idx": [
5,
20,
24,
25,
75,
76,
95,
97,
137,
143,
162,
163,
184,
185,
209,
219,
243,
253,
254,
298,
304,
306,
307,
308,
317,
326,
350,
356,
362,
368,
374,
380,
386,
392,
401,
402,
409,
410,
419,
420,
446,
447,
463,
487,
488,
490,
496,
521,
522,
541,
542,
563,
564,
575
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 575,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0.010434780269861221,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20155039429664612,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0.018518520519137383,
"rps_doc_frac_no_alph_words": 0.42635658383369446,
"rps_doc_frac_unique_words": 0.6781609058380127,
"rps_doc_mean_word_length": 3.781609296798706,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.007751939818263054,
"rps_doc_unigram_entropy": 3.8326430320739746,
"rps_doc_word_count": 87,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012158050201833248,
"rps_doc_frac_chars_top_3gram": 0.0303951408714056,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -46.69548797607422,
"rps_doc_books_importance_length_correction": -61.01988983154297,
"rps_doc_openwebtext_importance": -26.17829704284668,
"rps_doc_openwebtext_importance_length_correction": -40.5026969909668,
"rps_doc_wikipedia_importance": -16.485692977905273,
"rps_doc_wikipedia_importance_length_correction": -30.810094833374023
},
"fasttext": {
"dclm": 0.9086270928382874,
"english": 0.5964184999465942,
"fineweb_edu_approx": 3.514341354370117,
"eai_general_math": 0.8834661841392517,
"eai_open_web_math": 0.03946816921234131,
"eai_web_code": 0.00032603999716229737
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,653,229,020,651,311,000
|
skip to navigation
skip to content
ckanext-s3filestore 0.0.3
Host resource files using Amazon Web Service's S3 storage
ckanext-s3filestore
Use Amazon S3 as a filestore for resources.
Requirements
Requires CKAN 2.5+
Installation
To install ckanext-s3filestore:
1. Activate your CKAN virtual environment, for example:
. /usr/lib/ckan/default/bin/activate
2. Install the ckanext-s3filestore Python package into your virtual environment:
pip install ckanext-s3filestore
3. Add s3filestore to the ckan.plugins setting in your CKAN config file (by default the config file is located at /etc/ckan/default/production.ini).
4. Restart CKAN. For example if you’ve deployed CKAN with Apache on Ubuntu:
sudo service apache2 reload
Config Settings
Required:
ckanext.s3filestore.aws_access_key_id = Your-AWS-Access-Key-ID
ckanext.s3filestore.aws_secret_access_key = Your-AWS-Secret-Access-Key
ckanext.s3filestore.aws_bucket_name = a-bucket-to-store-your-stuff
Optional:
# An optional path to prepend to keys
ckanext.s3filestore.aws_storage_path = my-site-name
# An optional setting to fallback to filesystem for downloads
ckanext.s3filestore.filesystem_download_fallback = true
# The ckan storage path option must also be set correctly for the fallback to work
ckan.storage_path = path/to/storage/directory
Development Installation
To install ckanext-s3filestore for development, activate your CKAN virtualenv and do:
git clone https://github.com/okfn/ckanext-s3filestore.git
cd ckanext-s3filestore
python setup.py develop
pip install -r dev-requirements.txt
pip install -r requirements.txt
Running the Tests
To run the tests, do:
nosetests --ckan --nologcapture --with-pylons=test.ini
To run the tests and produce a coverage report, first make sure you have coverage installed in your virtualenv (pip install coverage) then run:
nosetests --ckan --nologcapture --with-pylons=test.ini --with-coverage --cover-package=ckanext.s3filestore --cover-inclusive --cover-erase --cover-tests
Registering ckanext-s3filestore on PyPI
ckanext-s3filestore should be available on PyPI as https://pypi.python.org/pypi/ckanext-s3filestore. If that link doesn’t work, then you can register the project on PyPI for the first time by following these steps:
1. Create a source distribution of the project:
python setup.py sdist
2. Register the project:
python setup.py register
3. Upload the source distribution to PyPI:
python setup.py sdist upload
4. Tag the first release of the project on GitHub with the version number from the setup.py file. For example if the version number in setup.py is 0.0.1 then do:
git tag 0.0.1
git push --tags
Releasing a New Version of ckanext-s3filestore
ckanext-s3filestore is available on PyPI as https://pypi.python.org/pypi/ckanext-s3filestore. To publish a new version to PyPI follow these steps:
1. Update the version number in the setup.py file. See PEP 440 for how to choose version numbers.
2. Create a source distribution of the new version:
python setup.py sdist
3. Upload the source distribution to PyPI:
python setup.py sdist upload
4. Tag the new release of the project on GitHub with the version number from the setup.py file. For example if the version number in setup.py is 0.0.2 then do:
git tag 0.0.2
git push --tags
File Type Py Version Uploaded on Size
ckanext-s3filestore-0.0.3.tar.gz (md5) Source 2016-02-18 10KB
|
{
"url": "https://pypi.python.org/pypi/ckanext-s3filestore/",
"source_domain": "pypi.python.org",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "20527",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V4BOU755WRFZ5SMH64ZI5J2BYF4PLYPG",
"WARC-Concurrent-To": "<urn:uuid:9e6bef38-dccc-4b4c-94da-7b7ccba1834c>",
"WARC-Date": "2017-12-12T12:26:53Z",
"WARC-IP-Address": "151.101.32.223",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:PVZ7IUFYDQE4P2K4ND3FGQHWCVHIR4I6",
"WARC-Record-ID": "<urn:uuid:2a2d0866-6d05-4bc6-ac47-c142bc7ff3ac>",
"WARC-Target-URI": "https://pypi.python.org/pypi/ckanext-s3filestore/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6ff1cce6-498e-4a6e-a970-79fd372966f7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-79-236-242.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
19,
35,
36,
62,
63,
121,
122,
142,
143,
187,
188,
201,
202,
221,
222,
235,
236,
268,
269,
327,
328,
369,
374,
457,
458,
494,
499,
650,
651,
729,
730,
762,
767,
768,
784,
785,
795,
796,
859,
930,
997,
998,
1008,
1009,
1047,
1099,
1100,
1162,
1218,
1301,
1347,
1348,
1373,
1374,
1460,
1461,
1519,
1542,
1566,
1602,
1634,
1635,
1653,
1654,
1676,
1677,
1732,
1733,
1877,
1878,
2031,
2032,
2072,
2073,
2288,
2289,
2339,
2340,
2366,
2371,
2398,
2399,
2428,
2433,
2478,
2479,
2512,
2517,
2681,
2682,
2700,
2720,
2725,
2726,
2773,
2774,
2921,
2922,
3022,
3023,
3077,
3078,
3104,
3109,
3154,
3155,
3188,
3193,
3355,
3356,
3374,
3394,
3399,
3401,
3439
],
"line_end_idx": [
19,
35,
36,
62,
63,
121,
122,
142,
143,
187,
188,
201,
202,
221,
222,
235,
236,
268,
269,
327,
328,
369,
374,
457,
458,
494,
499,
650,
651,
729,
730,
762,
767,
768,
784,
785,
795,
796,
859,
930,
997,
998,
1008,
1009,
1047,
1099,
1100,
1162,
1218,
1301,
1347,
1348,
1373,
1374,
1460,
1461,
1519,
1542,
1566,
1602,
1634,
1635,
1653,
1654,
1676,
1677,
1732,
1733,
1877,
1878,
2031,
2032,
2072,
2073,
2288,
2289,
2339,
2340,
2366,
2371,
2398,
2399,
2428,
2433,
2478,
2479,
2512,
2517,
2681,
2682,
2700,
2720,
2725,
2726,
2773,
2774,
2921,
2922,
3022,
3023,
3077,
3078,
3104,
3109,
3154,
3155,
3188,
3193,
3355,
3356,
3374,
3394,
3399,
3401,
3439,
3500
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3500,
"ccnet_original_nlines": 115,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19972826540470123,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01766303926706314,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3125,
"rps_doc_frac_unique_words": 0.42352941632270813,
"rps_doc_mean_word_length": 6.296470642089844,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0.004076090175658464,
"rps_doc_unigram_entropy": 4.7734375,
"rps_doc_word_count": 425,
"rps_doc_frac_chars_dupe_10grams": 0.1263079196214676,
"rps_doc_frac_chars_dupe_5grams": 0.19133034348487854,
"rps_doc_frac_chars_dupe_6grams": 0.14872944355010986,
"rps_doc_frac_chars_dupe_7grams": 0.1263079196214676,
"rps_doc_frac_chars_dupe_8grams": 0.1263079196214676,
"rps_doc_frac_chars_dupe_9grams": 0.1263079196214676,
"rps_doc_frac_chars_top_2gram": 0.029147980734705925,
"rps_doc_frac_chars_top_3gram": 0.029895370826125145,
"rps_doc_frac_chars_top_4gram": 0.020179370418190956,
"rps_doc_books_importance": -442.11083984375,
"rps_doc_books_importance_length_correction": -442.11083984375,
"rps_doc_openwebtext_importance": -240.81622314453125,
"rps_doc_openwebtext_importance_length_correction": -240.81622314453125,
"rps_doc_wikipedia_importance": -200.00006103515625,
"rps_doc_wikipedia_importance_length_correction": -200.00006103515625
},
"fasttext": {
"dclm": 0.20387738943099976,
"english": 0.6200549006462097,
"fineweb_edu_approx": 1.6887612342834473,
"eai_general_math": 0.3324519991874695,
"eai_open_web_math": 0.05151795968413353,
"eai_web_code": 0.28046494722366333
}
}
|
{
"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.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,023,839,499,208,678,700
|
PHP 8.1.0 RC 4 available for testing
The IntlGregorianCalendar class
(PHP 5 >= 5.5.0, PHP 7, PHP 8)
Introdução
Sinopse da classe
class IntlGregorianCalendar extends IntlCalendar {
/* Constantes herdadas */
const int IntlCalendar::FIELD_ERA = 0;
const int IntlCalendar::FIELD_HOUR = 10;
/* Métodos */
public __construct(IntlTimeZone $tz = ?, string $locale = ?)
public getGregorianChange(): float|false
public isLeapYear(int $year): bool
public setGregorianChange(float $date): bool
/* Métodos herdados */
public IntlCalendar::add(int $field, int $value): bool
public IntlCalendar::after(IntlCalendar $other): bool
public IntlCalendar::before(IntlCalendar $other): bool
public IntlCalendar::clear(?int $field = null): bool
public static IntlCalendar::createInstance(IntlTimeZone|DateTimeZone|string|null $timezone = null, ?string $locale = null): ?IntlCalendar
public IntlCalendar::equals(IntlCalendar $other): bool
public IntlCalendar::fieldDifference(float $timestamp, int $field): int|false
public static IntlCalendar::fromDateTime(DateTime|string $datetime, ?string $locale = null): ?IntlCalendar
public IntlCalendar::get(int $field): int|false
public IntlCalendar::getActualMaximum(int $field): int|false
public IntlCalendar::getActualMinimum(int $field): int|false
public static IntlCalendar::getAvailableLocales(): array
public IntlCalendar::getDayOfWeekType(int $dayOfWeek): int|false
public IntlCalendar::getErrorCode(): int|false
public IntlCalendar::getErrorMessage(): string|false
public IntlCalendar::getGreatestMinimum(int $field): int|false
public static IntlCalendar::getKeywordValuesForLocale(string $keyword, string $locale, bool $onlyCommon): IntlIterator|false
public IntlCalendar::getLeastMaximum(int $field): int|false
public IntlCalendar::getLocale(int $type): string|false
public IntlCalendar::getMaximum(int $field): int|false
public IntlCalendar::getMinimum(int $field): int|false
public static IntlCalendar::getNow(): float
public IntlCalendar::getTime(): float|false
public IntlCalendar::getType(): string
public IntlCalendar::getWeekendTransition(int $dayOfWeek): int|false
public IntlCalendar::isSet(int $field): bool
public IntlCalendar::isWeekend(?float $timestamp = null): bool
public IntlCalendar::roll(int $field, int|bool $value): bool
public IntlCalendar::set(int $field, int $value): bool
public IntlCalendar::set(
int $year,
int $month,
int $dayOfMonth = NULL,
int $hour = NULL,
int $minute = NULL,
int $second = NULL
): bool
public IntlCalendar::setFirstDayOfWeek(int $dayOfWeek): bool
public IntlCalendar::setLenient(bool $lenient): bool
public IntlCalendar::setRepeatedWallTimeOption(int $option): bool
public IntlCalendar::setSkippedWallTimeOption(int $option): bool
public IntlCalendar::setTime(float $timestamp): bool
public IntlCalendar::setTimeZone(IntlTimeZone|DateTimeZone|string|null $timezone): bool
}
Índice
add a note add a note
User Contributed Notes 1 note
up
1
Julian Sawicki
11 months ago
I was using `IntlGregorianCalendar` because it offered a nice way to get the week number of the year as an integer. This differs from `DateTime`; `DateTime` gives you the week number of the year as an string.
<?php
$dateTime
= new DateTime('21-09-2020 09:00:00');
echo
$dateTime->format("W"); // string '39'
$intlCalendar = IntlCalendar::fromDateTime ('21-09-2020 09:00:00');
echo
$intlCalendar->get(IntlCalendar::FIELD_WEEK_OF_YEAR); // integer 39
To Top
|
{
"url": "https://www.php.net/manual/pt_BR/class.intlgregoriancalendar.php",
"source_domain": "www.php.net",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "60556",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CXFBKYXPXGCMWNVQXBQK2FBI3EKIF3EL",
"WARC-Concurrent-To": "<urn:uuid:617299d0-fe90-4ed6-88bc-ce694a8679d8>",
"WARC-Date": "2021-10-19T22:17:13Z",
"WARC-IP-Address": "185.85.0.29",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:HUFJGINVNW5CQVDEXL5DPJLCYTWU6546",
"WARC-Record-ID": "<urn:uuid:56eb0764-0547-4129-80af-e6e73c4c0d51>",
"WARC-Target-URI": "https://www.php.net/manual/pt_BR/class.intlgregoriancalendar.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5ef92021-5cf1-4bb2-8b71-995d154dd985>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-75\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,
37,
38,
70,
71,
102,
103,
114,
115,
133,
134,
185,
211,
250,
291,
305,
366,
407,
442,
487,
510,
565,
619,
674,
727,
865,
920,
998,
1105,
1153,
1214,
1275,
1332,
1397,
1444,
1497,
1560,
1685,
1745,
1801,
1856,
1911,
1955,
1999,
2038,
2107,
2152,
2215,
2276,
2331,
2357,
2372,
2388,
2416,
2438,
2462,
2485,
2493,
2554,
2607,
2673,
2738,
2791,
2879,
2881,
2882,
2889,
2890,
2912,
2913,
2943,
2944,
2947,
2949,
2964,
2978,
3187,
3188,
3194,
3195,
3205,
3244,
3249,
3288,
3289,
3357,
3362,
3430
],
"line_end_idx": [
37,
38,
70,
71,
102,
103,
114,
115,
133,
134,
185,
211,
250,
291,
305,
366,
407,
442,
487,
510,
565,
619,
674,
727,
865,
920,
998,
1105,
1153,
1214,
1275,
1332,
1397,
1444,
1497,
1560,
1685,
1745,
1801,
1856,
1911,
1955,
1999,
2038,
2107,
2152,
2215,
2276,
2331,
2357,
2372,
2388,
2416,
2438,
2462,
2485,
2493,
2554,
2607,
2673,
2738,
2791,
2879,
2881,
2882,
2889,
2890,
2912,
2913,
2943,
2944,
2947,
2949,
2964,
2978,
3187,
3188,
3194,
3195,
3205,
3244,
3249,
3288,
3289,
3357,
3362,
3430,
3436
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3436,
"ccnet_original_nlines": 87,
"rps_doc_curly_bracket": 0.0005820699734613299,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05491328984498978,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020231209695339203,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.43352600932121277,
"rps_doc_frac_unique_words": 0.48051947355270386,
"rps_doc_mean_word_length": 8.694805145263672,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.3705973625183105,
"rps_doc_word_count": 308,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06198655813932419,
"rps_doc_frac_chars_dupe_6grams": 0.019417479634284973,
"rps_doc_frac_chars_dupe_7grams": 0.019417479634284973,
"rps_doc_frac_chars_dupe_8grams": 0.019417479634284973,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05974607914686203,
"rps_doc_frac_chars_top_3gram": 0.056758780032396317,
"rps_doc_frac_chars_top_4gram": 0.03734130039811134,
"rps_doc_books_importance": -248.97413635253906,
"rps_doc_books_importance_length_correction": -248.97413635253906,
"rps_doc_openwebtext_importance": -165.3424530029297,
"rps_doc_openwebtext_importance_length_correction": -165.3424530029297,
"rps_doc_wikipedia_importance": -134.67178344726562,
"rps_doc_wikipedia_importance_length_correction": -134.67178344726562
},
"fasttext": {
"dclm": 0.09340494871139526,
"english": 0.3907065689563751,
"fineweb_edu_approx": 3.2401254177093506,
"eai_general_math": 0.05868827924132347,
"eai_open_web_math": 0.0006960600148886442,
"eai_web_code": 0.4717409014701843
}
}
|
{
"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": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,258,833,475,067,442,400
|
#!/bin/bash function allOSRealPath() { if isOSWindows then path="" case $1 in .* ) path="$PWD/${1#./}" ;; /* ) path="$1" ;; * ) path="/$1" ;; esac echo "/$path" | sed -e 's/\\/\//g' -e 's/://' -e 's/./\U&/3' else case $1 in /* ) echo "$1"; exit;; * ) echo "$PWD/${1#./}"; exit;; esac fi } function isOSWindows() { if [ $OSTYPE == "msys" ] then return 0 else return 1 fi } function usage { echo "usage: codebuild_build.sh [-i image_name] [-a artifact_output_directory] [options]" echo "Required:" echo " -i Used to specify the customer build container image." echo " -a Used to specify an artifact output directory." echo "Options:" echo " -l IMAGE Used to override the default local agent image." echo " -r Used to specify a report output directory." echo " -s Used to specify source information. Defaults to the current working directory for primary source." echo " * First (-s) is for primary source" echo " * Use additional (-s) in : format for secondary source" echo " * For sourceIdentifier, use a value that is fewer than 128 characters and contains only alphanumeric characters and underscores" echo " -c Use the AWS configuration and credentials from your local host. This includes ~/.aws and any AWS_* environment variables." echo " -p Used to specify the AWS CLI Profile." echo " -b FILE Used to specify a buildspec override file. Defaults to buildspec.yml in the source directory." echo " -m Used to mount the source directory to the customer build container directly." echo " -d Used to run the build container in docker privileged mode." echo " -e FILE Used to specify a file containing environment variables." echo " (-e) File format expectations:" echo " * Each line is in VAR=VAL format" echo " * Lines beginning with # are processed as comments and ignored" echo " * Blank lines are ignored" echo " * File can be of type .env or .txt" echo " * There is no special handling of quotation marks, meaning they will be part of the VAL" exit 1 } image_flag=false artifact_flag=false awsconfig_flag=false mount_src_dir_flag=false docker_privileged_mode_flag=false while getopts "cmdi:a:r:s:b:e:l:p:h" opt; do case $opt in i ) image_flag=true; image_name=$OPTARG;; a ) artifact_flag=true; artifact_dir=$OPTARG;; r ) report_dir=$OPTARG;; b ) buildspec=$OPTARG;; c ) awsconfig_flag=true;; m ) mount_src_dir_flag=true;; d ) docker_privileged_mode_flag=true;; s ) source_dirs+=("$OPTARG");; e ) environment_variable_file=$OPTARG;; l ) local_agent_image=$OPTARG;; p ) aws_profile=$OPTARG;; h ) usage; exit;; \? ) echo "Unknown option: -$OPTARG" >&2; exit 1;; : ) echo "Missing option argument for -$OPTARG" >&2; exit 1;; * ) echo "Invalid option: -$OPTARG" >&2; exit 1;; esac done if ! $image_flag then echo "The image name flag (-i) must be included for a build to run" >&2 fi if ! $artifact_flag then echo "The artifact directory (-a) must be included for a build to run" >&2 fi if ! $image_flag || ! $artifact_flag then exit 1 fi docker_command="docker run -it " if isOSWindows then docker_command+="-v //var/run/docker.sock:/var/run/docker.sock -e " else docker_command+="-v /var/run/docker.sock:/var/run/docker.sock -e " fi docker_command+="\"IMAGE_NAME=$image_name\" -e \ \"ARTIFACTS=$(allOSRealPath "$artifact_dir")\"" if [ -n "$report_dir" ] then docker_command+=" -e \"REPORTS=$(allOSRealPath "$report_dir")\"" fi if [ -z "$source_dirs" ] then docker_command+=" -e \"SOURCE=$(allOSRealPath "$PWD")\"" else for index in "${!source_dirs[@]}"; do if [ $index -eq 0 ] then docker_command+=" -e \"SOURCE=$(allOSRealPath "${source_dirs[$index]}")\"" else identifier=${source_dirs[$index]%%:*} src_dir=$(allOSRealPath "${source_dirs[$index]#*:}") docker_command+=" -e \"SECONDARY_SOURCE_$index=$identifier:$src_dir\"" fi done fi if [ -n "$buildspec" ] then docker_command+=" -e \"BUILDSPEC=$(allOSRealPath "$buildspec")\"" fi if [ -n "$environment_variable_file" ] then environment_variable_file_path=$(allOSRealPath "$environment_variable_file") environment_variable_file_dir=$(dirname "$environment_variable_file_path") environment_variable_file_basename=$(basename "$environment_variable_file") docker_command+=" -v \"$environment_variable_file_dir:/LocalBuild/envFile/\" -e \"ENV_VAR_FILE=$environment_variable_file_basename\"" fi if [ -n "$local_agent_image" ] then docker_command+=" -e \"LOCAL_AGENT_IMAGE_NAME=$local_agent_image\"" fi if $awsconfig_flag then if [ -d "$HOME/.aws" ] then configuration_file_path=$(allOSRealPath "$HOME/.aws") docker_command+=" -e \"AWS_CONFIGURATION=$configuration_file_path\"" else docker_command+=" -e \"AWS_CONFIGURATION=NONE\"" fi if [ -n "$aws_profile" ] then docker_command+=" -e \"AWS_PROFILE=$aws_profile\"" fi docker_command+="$(env | grep ^AWS_ | while read -r line; do echo " -e \"$line\""; done )" fi if $mount_src_dir_flag then docker_command+=" -e \"MOUNT_SOURCE_DIRECTORY=TRUE\"" fi if $docker_privileged_mode_flag then docker_command+=" -e \"DOCKER_PRIVILEGED_MODE=TRUE\"" fi if isOSWindows then docker_command+=" -e \"INITIATOR=$USERNAME\"" else docker_command+=" -e \"INITIATOR=$USER\"" fi if [ -n "$local_agent_image" ] then docker_command+=" $local_agent_image" else docker_command+=" amazon/aws-codebuild-local:latest" fi # Note we do not expose the AWS_SECRET_ACCESS_KEY or the AWS_SESSION_TOKEN exposed_command=$docker_command secure_variables=( "AWS_SECRET_ACCESS_KEY=" "AWS_SESSION_TOKEN=") for variable in "${secure_variables[@]}" do exposed_command="$(echo $exposed_command | sed "s/\($variable\)[^ ]*/\1********\"/")" done echo "Build Command:" echo "" echo $exposed_command echo "" eval $docker_command
|
{
"url": "https://raw.githubusercontent.com/aws/aws-codebuild-docker-images/master/local_builds/codebuild_build.sh",
"source_domain": "raw.githubusercontent.com",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "7381",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GM7OMWLRDOCJACDXW7GV7FGTWDFGLWR2",
"WARC-Concurrent-To": "<urn:uuid:bfb967c9-e5c4-4acb-af5a-17278f9085bd>",
"WARC-Date": "2021-05-11T07:46:16Z",
"WARC-IP-Address": "185.199.111.133",
"WARC-Identified-Payload-Type": "application/x-sh",
"WARC-Payload-Digest": "sha1:D5SSXOSBVBEFBPRGFPT5VPWI2HY5CCKG",
"WARC-Record-ID": "<urn:uuid:4e262988-03e0-4eec-aacf-fde10846c94f>",
"WARC-Target-URI": "https://raw.githubusercontent.com/aws/aws-codebuild-docker-images/master/local_builds/codebuild_build.sh",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b882d470-0589-445d-b6b8-05930e23d9c3>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-25.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
],
"line_end_idx": [
5576
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5576,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.003586800070479512,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19982993602752686,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04591837152838707,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.43027210235595703,
"rps_doc_frac_unique_words": 0.39966556429862976,
"rps_doc_mean_word_length": 6.505016803741455,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.005102039780467749,
"rps_doc_unigram_entropy": 4.889386177062988,
"rps_doc_word_count": 598,
"rps_doc_frac_chars_dupe_10grams": 0.016966579481959343,
"rps_doc_frac_chars_dupe_5grams": 0.05964009836316109,
"rps_doc_frac_chars_dupe_6grams": 0.03598972037434578,
"rps_doc_frac_chars_dupe_7grams": 0.016966579481959343,
"rps_doc_frac_chars_dupe_8grams": 0.016966579481959343,
"rps_doc_frac_chars_dupe_9grams": 0.016966579481959343,
"rps_doc_frac_chars_top_2gram": 0.046786628663539886,
"rps_doc_frac_chars_top_3gram": 0.04164524003863335,
"rps_doc_frac_chars_top_4gram": 0.010796920396387577,
"rps_doc_books_importance": -552.3424072265625,
"rps_doc_books_importance_length_correction": -552.3424072265625,
"rps_doc_openwebtext_importance": -304.8099670410156,
"rps_doc_openwebtext_importance_length_correction": -304.8099670410156,
"rps_doc_wikipedia_importance": -368.1277160644531,
"rps_doc_wikipedia_importance_length_correction": -368.1277160644531
},
"fasttext": {
"dclm": 0.07979077100753784,
"english": 0.45298635959625244,
"fineweb_edu_approx": 2.14579701423645,
"eai_general_math": 0.07874947786331177,
"eai_open_web_math": 0.19097834825515747,
"eai_web_code": 0.8780204057693481
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|