id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
3,770,514,194,495,445,500 |
How to add your knowledge
Undoing and Redoing Operations
Table of contents
No headers
Use the Undo and Redo buttons to undo or redo operations performed in both the Batch schematic and individual modules.
You can only undo operations that affect the final result. For example, a slider edit, or node parenting can be undone, but not a view change or schematic pan.
|
{
"url": "http://wikihelp.autodesk.com/Flame_Premium/enu/2013/Help/02_Flame_Premium_Timeline_--_Smoke/1183-Procedur1183/1212-Batch_Pr1212/1223-Undoing_1223",
"source_domain": "wikihelp.autodesk.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "49003",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:66E2BD5ZWZOT7PRKSHXM7MK33DKAF24M",
"WARC-Concurrent-To": "<urn:uuid:9654edfd-8ccb-46db-9eaa-6da649188763>",
"WARC-Date": "2013-05-24T05:18:22Z",
"WARC-IP-Address": "50.18.115.146",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7KBYACW54Z6QUAF62CXOHIVB62WHBXS4",
"WARC-Record-ID": "<urn:uuid:e9b42276-1558-4f1c-b0c0-be1c5642429c>",
"WARC-Target-URI": "http://wikihelp.autodesk.com/Flame_Premium/enu/2013/Help/02_Flame_Premium_Timeline_--_Smoke/1183-Procedur1183/1212-Batch_Pr1212/1223-Undoing_1223",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fa04ccea-5a88-4006-bfd4-46aa002e73cc>"
},
"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,
26,
27,
58,
59,
81,
96,
97,
220,
221
],
"line_end_idx": [
26,
27,
58,
59,
81,
96,
97,
220,
221,
384
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 384,
"ccnet_original_nlines": 9,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36231884360313416,
"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.08695652335882187,
"rps_doc_frac_unique_words": 0.761904776096344,
"rps_doc_mean_word_length": 4.698412895202637,
"rps_doc_num_sentences": 3,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.7715370655059814,
"rps_doc_word_count": 63,
"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": -31.802074432373047,
"rps_doc_books_importance_length_correction": -31.802074432373047,
"rps_doc_openwebtext_importance": -15.448076248168945,
"rps_doc_openwebtext_importance_length_correction": -15.448076248168945,
"rps_doc_wikipedia_importance": -8.925191879272461,
"rps_doc_wikipedia_importance_length_correction": -8.925191879272461
},
"fasttext": {
"dclm": 0.044069889932870865,
"english": 0.8594614267349243,
"fineweb_edu_approx": 2.0206410884857178,
"eai_general_math": 0.5594984889030457,
"eai_open_web_math": 0.12651985883712769,
"eai_web_code": 0.5420324206352234
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "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,408,099,892,660,050,000 |
Build HBase-Connected Web Apps in Servoy
Ready to get started?
Download for a free trial:
Download Now
Learn more:
HBase JDBC Driver
Rapidly create and deploy powerful Java applications that integrate with Apache HBase columnar databases.
Use Servoy Developer to easily connect to HBase data and build web apps with connectivity to live HBase data.
Servoy is a rapid application development and deployment platform. When paired with the CData JDBC Driver for HBase, users can build HBase-connected apps that work with live HBase data. This article describes how to connect to HBase from Servoy and build a simple web app to display and search HBase data.
With built-in optimized data processing, the CData JDBC Driver offers unmatched performance for interacting with live HBase data. When you issue complex SQL queries to HBase, the driver pushes supported SQL operations, like filters and aggregations, directly to HBase and utilizes the embedded SQL engine to process unsupported operations client-side (often SQL functions and JOIN operations). Its built-in dynamic metadata querying lets you work with HBase data using native data types.
Connect to HBase in Servoy Developer
To build HBase-connected apps, you need to first create a data provider in Servoy Developer using the CData JDBC Driver for HBase.
1. Install the JDBC Driver.
2. Copy the JDBC Driver JAR file. (cdata.jdbc.apachehbase.jar) to the /application_server/drivers/ directory in the installation directory for Servoy.
3. Open Servoy Developer.
4. In the Solution Explorer, right-click Database Server (under Resources) and choose "Connect to existing database" -> "empty."
1. Name the server.
2. Click to show the advanced server settings.
• Set the URL, for example: jdbc:apachehbase:Server=127.0.0.1;Port=8080;
Built-In Connection String Designer
For assistance in constructing the JDBC URL, use the connection string designer built into the HBase JDBC Driver. Either double-click the JAR file or execute the jar file from the command-line.
java -jar cdata.jdbc.apachehbase.jar
Fill in the connection properties and copy the connection string to the clipboard.
Set the Port and Server to connect to Apache HBase.
• Select the Driver class you just copied, for example, cdata.jdbc.apachehbase.ApacheHBaseDriver
Build a HBase-Connected Web App
Once you have configured the connection to HBase in the Servoy Developer resources, you are ready to build apps with access to live HBase data.
Create a New Solution
1. In the Server Explorer, right-click "All solutions" and select "Create new solution."
2. Name the solution.
3. Select the checkbox to include the "search" module.
4. Click "Finish."
Create a New Form
Right-click "Forms" and select "Create new form."
1. Name the form.
2. Select a Datasource.
3. Set the type (e.g., Simple) and click "Finish."
Add a Data Grid to the Form
1. Drag a Data Grid component (from Servoy NG-Grids) onto the form.
2. Drag a column component onto the Data Grid and set the "dataprovider" property for each column component to a column from the HBase "table" (e.g., CustomerName from the Customers table).
Continue adding columns as desired.
Add Searching to the App
Note that the "svySearch" extension is required to add search functionality (included by default when you create a new solution). If you did not add the extension when you created the solution or you are modifying an existing solution, you can add the search module by right-clicking Modules (in the solution) and selecting "Add Module." Select "svySearch" and click "OK."
1. Drag a Text Field component onto the Form.
2. Right-click the Form and select "Open in Script Editor."
3. Create a new variable (JavaScript) to hold the search value:
var searchText = '';
4. Back on the Form, in the Text Field properties:
1. Set the "dataprovider" property to the Form variable you just created.
2. Double-click to add a method for the onAction event.
3. Click to create the method in "Form," name the method (e.g., onEnter), and click "Create private."
4. Click "OK & Show."
5. Add the following JavaScript to the JavaScript file to use the Servoy framework to implement searching bound data based on the text in the Text Field:
var search = scopes.svySearch.createSimpleSearch(foundset).setSearchText(searchText);
search.setSearchAllColumns();
search.loadRecords(foundset);
Save and Launch the App
Save the form and JavaScript file, then click Run -> Launch NGClient to start the web app.
Download a free, 30-day trial of the CData JDBC Driver for HBase and start building HBase-connected apps with Servoy. Reach out to our Support Team if you have any questions.
|
{
"url": "https://www.cdata.com/kb/tech/hbase-jdbc-servoy.rst",
"source_domain": "www.cdata.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "139225",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4SPBSHDRX3HUKXUAVLLSNASOV72BBZPP",
"WARC-Concurrent-To": "<urn:uuid:cfee749b-ffdc-4c7c-8878-b6e89fb4fb52>",
"WARC-Date": "2021-10-25T10:05:10Z",
"WARC-IP-Address": "40.121.212.19",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:I2HMETFDGSSGACRVX6637B5QLJA4OQZE",
"WARC-Record-ID": "<urn:uuid:dde8d33e-9426-478e-abc3-9006e763c73d>",
"WARC-Target-URI": "https://www.cdata.com/kb/tech/hbase-jdbc-servoy.rst",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:33396df2-2840-47c7-85b1-46374e1099c9>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-231\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
44,
45,
67,
68,
95,
96,
109,
110,
122,
123,
141,
142,
248,
249,
250,
251,
361,
362,
668,
669,
1157,
1158,
1195,
1196,
1327,
1328,
1358,
1511,
1539,
1670,
1694,
1745,
1824,
1825,
1869,
1870,
2072,
2073,
2118,
2119,
2210,
2211,
2271,
2272,
2375,
2376,
2408,
2409,
2553,
2554,
2576,
2577,
2668,
2692,
2749,
2770,
2771,
2789,
2790,
2840,
2841,
2861,
2887,
2940,
2941,
2969,
2970,
3040,
3232,
3233,
3273,
3274,
3299,
3300,
3673,
3674,
3722,
3784,
3850,
3875,
3880,
3933,
4011,
4071,
4177,
4203,
4359,
4449,
4483,
4517,
4522,
4523,
4547,
4548,
4639,
4640
],
"line_end_idx": [
2,
3,
44,
45,
67,
68,
95,
96,
109,
110,
122,
123,
141,
142,
248,
249,
250,
251,
361,
362,
668,
669,
1157,
1158,
1195,
1196,
1327,
1328,
1358,
1511,
1539,
1670,
1694,
1745,
1824,
1825,
1869,
1870,
2072,
2073,
2118,
2119,
2210,
2211,
2271,
2272,
2375,
2376,
2408,
2409,
2553,
2554,
2576,
2577,
2668,
2692,
2749,
2770,
2771,
2789,
2790,
2840,
2841,
2861,
2887,
2940,
2941,
2969,
2970,
3040,
3232,
3233,
3273,
3274,
3299,
3300,
3673,
3674,
3722,
3784,
3850,
3875,
3880,
3933,
4011,
4071,
4177,
4203,
4359,
4449,
4483,
4517,
4522,
4523,
4547,
4548,
4639,
4640,
4814
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4814,
"ccnet_original_nlines": 98,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2608247399330139,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021649479866027832,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24226804077625275,
"rps_doc_frac_unique_words": 0.35048678517341614,
"rps_doc_mean_word_length": 5.115437984466553,
"rps_doc_num_sentences": 92,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.856595993041992,
"rps_doc_word_count": 719,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.021207179874181747,
"rps_doc_frac_chars_dupe_6grams": 0.021207179874181747,
"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.021750949323177338,
"rps_doc_frac_chars_top_3gram": 0.014138120226562023,
"rps_doc_frac_chars_top_4gram": 0.01957586035132408,
"rps_doc_books_importance": -462.8798522949219,
"rps_doc_books_importance_length_correction": -462.8798522949219,
"rps_doc_openwebtext_importance": -255.4841766357422,
"rps_doc_openwebtext_importance_length_correction": -255.4841766357422,
"rps_doc_wikipedia_importance": -179.38067626953125,
"rps_doc_wikipedia_importance_length_correction": -179.38067626953125
},
"fasttext": {
"dclm": 0.4314424991607666,
"english": 0.7658097743988037,
"fineweb_edu_approx": 1.5521998405456543,
"eai_general_math": 0.07795447111129761,
"eai_open_web_math": 0.08619058132171631,
"eai_web_code": 0.22796285152435303
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,354,568,223,942,419,000 |
The 'help me choose hardware to run PA' megathread
Discussion in 'Support!' started by cwarner7264, August 7, 2014.
1. orangerinapay
orangerinapay Active Member
Messages:
102
Likes Received:
61
A mid tier PC, so that's like 400-500$
2. cdrkf
cdrkf Post Master General
Messages:
5,721
Likes Received:
4,793
Are you US based then? I can look on sites for over there to give you $ prices. I'm in UK myself so I tend to deal more in £ however £400 - £500 is quite a bit more than your looking at I think :p
3. orangerinapay
orangerinapay Active Member
Messages:
102
Likes Received:
61
Yes I am US based
4. cdrkf
cdrkf Post Master General
Messages:
5,721
Likes Received:
4,793
Here is an example of a new system in that price range in USD...
http://pcpartpicker.com/p/hW4LjX
Note that is *without buying the OS* but is all brand new kit. The FX6300 is a reasonable cpu that can be easily over-clocked.
Edit: Also you can get a more powerful graphics card overall by going AMD R7 range (e.g. an R7 260X or 265) however I haven't done that as for PA specifically Nvidia tends to be better for this game (I run PA on an AMD card and it does work btw, it just tends to be a bit faster on the equivalent Nvidia card due to better OpenGL drivers for Nvidia).
Edit: Here is a similar build based on the latest Intel platform:
http://pcpartpicker.com/p/wh3YwP
The processor on this (core i3) is a dual core with Hyper-threading (means Windows will see it as 4 cores) which should be fine for most games. Imo the FX is probably a better chip overall and will over clock better. The advantage to the Intel build is you can upgrade the processor to the much faster Core i5 or Core i7 at a later date, whereas with the FX there isn't anything much better than that for gaming from AMD. It really depends if you are planning the change the system much in the future really.
Last edited: December 9, 2014
5. orangerinapay
orangerinapay Active Member
Messages:
102
Likes Received:
61
Thanks a lot man!
I'll probably get the i3 one since it is cheaper, what would be the recommended graphics for this? (Medium, low, high?)
6. cdrkf
cdrkf Post Master General
Messages:
5,721
Likes Received:
4,793
That depends allot on what screen you have. Assuming it's full HD (1920 x 1080 pixels) then your looking at playing well at medium settings (high would be ok early game and on small maps but it will probably start to struggle as things escalate). If you have an older screen with a lower resolution then higher settings are probably possible as it will put less load on the GPU.
orangerinapay likes this.
7. zweistein000
zweistein000 Post Master General
Messages:
1,362
Likes Received:
727
So seeing that this is where my hunt for new PC began I feel obliged to thank you. At the end I'll be getting:
Intel Core™ i7 4790K "Unlocked"
Kingston PC3-12800 "HyperX blu" KIT 16384MB 1600 MHz DDR III
Kingston SSDnow V300 240GB SATA III (6Gb/s)
Gigabyte NVIDIA GeForce GTX 970 4GB
Corsair CX750
Gigabyte GA-Z97X-Gaming 3
Zalman Z3-Plus Midi-Tower
EDIT: UPDATED
The downside is that I bought a new case and Graphics card with one supplier and the rest with another one, I basically went for he lowest prices and that has come back to bite me. My GTX 970 and my case are sitting at home collecting dust while I wont be getting the other parts until next year. :( And by that time I'll have school and diploma to think about. Well I guess the endless mines of UCGO Icarus server will keep me company.
This is the wurst.
Last edited: December 23, 2014
cwarner7264 and cdrkf like this.
8. cdrkf
cdrkf Post Master General
Messages:
5,721
Likes Received:
4,793
So frustrating having to wait! Still with a spec like that it will be worth it :) That should handle everything at full settings for some time to come.
zweistein000 likes this.
9. cwarner7264
cwarner7264 Moderator Alumni
Messages:
4,460
Likes Received:
5,390
You're going to be on a similar set-up to me:
http://uk.pcpartpicker.com/user/cwarner7264/saved/p2D7YJ
Similar situation, I'm waiting on a couple of parts that haven't arrived. I'm gonna take photos of the build process this time because my last one was very poorly documented.
zweistein000 likes this.
10. zweistein000
zweistein000 Post Master General
Messages:
1,362
Likes Received:
727
Yea pretty similar. I basically got more cash than I though I would initially. I had to cut the extra parts that would allow me to overclock since that saved me almost 300 euros, though. Still seeing that my last venture into OC land left me with my initial PSU, CPU and MOBO fused together (yes this is hoe I got my core 2 duo and basically my current setup) I'm not that bothered.
11. bengeocth
bengeocth Post Master General
Messages:
1,285
Likes Received:
657
I have no idea what to upgrade. Here's my dxdiag.
I'm not looking for what to get specifically, I jut want to know if anything (besides video driver) needs improvement
Attached Files:
12. cwarner7264
cwarner7264 Moderator Alumni
Messages:
4,460
Likes Received:
5,390
This is worrying. You should probably invest in a CPU :D
13. bengeocth
bengeocth Post Master General
Messages:
1,285
Likes Received:
657
Hey. I don't tell you how to run your life. *pedals scooter that is processor*
14. cwarner7264
cwarner7264 Moderator Alumni
Messages:
4,460
Likes Received:
5,390
The only other thing I can see on there is that you've 8GB of RAM which should run the game fine - 16GB would allow you to run it better. If you've anything less than a quad core processor that will likely be your bottleneck.
15. bengeocth
bengeocth Post Master General
Messages:
1,285
Likes Received:
657
no but seriously why is that happening
16. zweistein000
zweistein000 Post Master General
Messages:
1,362
Likes Received:
727
So after being almost 3 weeks overdue, my new PC is finally arriving this Thursday.
[IMG]
cwarner7264 likes this.
17. cdrkf
cdrkf Post Master General
Messages:
5,721
Likes Received:
4,793
I'm not sure, I gather your cpu is an amd A8 Apu based on the graphics card...? Maybe the database for dx hasn't been updated with the correct model number?
If you want to check the cpu, try getting 'cpu z' as that should be able to give you info on pretty much any cpu out there.
18. jaggaaff
jaggaaff New Member
Messages:
20
Likes Received:
8
I have one of the crappiest All-in-ones i can get(even school laptops have better specs)
System Model: Lenovo C205
Operating System: Windows 7 Home Premium 64-bit
Memory: 8GB RAM
Processor: AMD E-350 running at 1.6GHz
Graphics: AMD Radeon HD 6310
Monitor Size: 1366 x 768
You can have my DxDiag aswell
Attached Files:
19. cdrkf
cdrkf Post Master General
Messages:
5,721
Likes Received:
4,793
Yeah I'm not sure that's going to cope with PA. The main issues are the very weak gfx card and the slow dual core processor.
You really need an AMD A8 APU (and not the low power one either as it has no gfx capability) with a 384 core GPU part in it to play PA ok. That's a good minimum to start from, the A10's are even better (again not counting the A10 'micro').
Edit alternatively any laptop with an Intel Core i3 (standard variant rather than the low power 'u' version) with HD3000 or better GPU should be ok for minimum settings (with at least 8gb of ram).
20. jaggaaff
jaggaaff New Member
Messages:
20
Likes Received:
8
It runs PA fine enough that i can actually play.
Also i've run big ZE(Zombie Escape) Maps on both CS:S and CS:GO with 40 players finely.
cdrkf likes this.
Share This Page
|
{
"url": "https://forums.planetaryannihilation.com/threads/the-help-me-choose-hardware-to-run-pa-megathread.62707/page-7",
"source_domain": "forums.planetaryannihilation.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "177592",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UUMBMVRHEOJZAOG74ZNIGVEZY4RZ2XEL",
"WARC-Concurrent-To": "<urn:uuid:56120211-ca56-4f71-aa5e-be7105b3ceed>",
"WARC-Date": "2020-07-09T07:31:48Z",
"WARC-IP-Address": "52.24.187.187",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:64QKWMVXD2BS43TGNTIEDWXHHAKW3LH3",
"WARC-Record-ID": "<urn:uuid:76f75106-07de-4786-bb65-1ceec42b8732>",
"WARC-Target-URI": "https://forums.planetaryannihilation.com/threads/the-help-me-choose-hardware-to-run-pa-megathread.62707/page-7",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:08f24b02-4260-42c0-98ec-966bbf287ac5>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-116.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,
51,
52,
117,
118,
137,
138,
170,
171,
185,
193,
213,
220,
263,
274,
275,
305,
306,
320,
330,
350,
360,
561,
580,
581,
613,
614,
628,
636,
656,
663,
685,
696,
697,
727,
728,
742,
752,
772,
782,
851,
852,
889,
890,
1021,
1022,
1377,
1378,
1448,
1449,
1486,
1487,
2000,
2034,
2053,
2054,
2086,
2087,
2101,
2109,
2129,
2136,
2158,
2159,
2283,
2294,
2295,
2325,
2326,
2340,
2350,
2370,
2380,
2763,
2793,
2811,
2812,
2849,
2850,
2864,
2874,
2894,
2902,
3017,
3018,
3054,
3119,
3167,
3207,
3225,
3255,
3285,
3286,
3304,
3305,
3746,
3747,
3770,
3805,
3842,
3853,
3854,
3884,
3885,
3899,
3909,
3929,
3939,
4095,
4124,
4141,
4142,
4175,
4176,
4190,
4200,
4220,
4230,
4280,
4281,
4342,
4343,
4522,
4551,
4570,
4571,
4608,
4609,
4623,
4633,
4653,
4661,
5048,
5064,
5065,
5099,
5100,
5114,
5124,
5144,
5152,
5206,
5207,
5329,
5330,
5350,
5351,
5369,
5370,
5403,
5404,
5418,
5428,
5448,
5458,
5519,
5535,
5536,
5570,
5571,
5585,
5595,
5615,
5623,
5706,
5724,
5725,
5758,
5759,
5773,
5783,
5803,
5813,
6043,
6059,
6060,
6094,
6095,
6109,
6119,
6139,
6147,
6190,
6209,
6210,
6247,
6248,
6262,
6272,
6292,
6300,
6388,
6389,
6400,
6428,
6440,
6441,
6471,
6472,
6486,
6496,
6516,
6526,
6687,
6688,
6816,
6831,
6832,
6856,
6857,
6871,
6878,
6898,
6904,
6997,
6998,
7028,
7080,
7100,
7143,
7176,
7205,
7206,
7240,
7241,
7261,
7262,
7274,
7275,
7305,
7306,
7320,
7330,
7350,
7360,
7489,
7490,
7734,
7735,
7936,
7951,
7952,
7976,
7977,
7991,
7998,
8018,
8024,
8077,
8078,
8170,
8192,
8193
],
"line_end_idx": [
51,
52,
117,
118,
137,
138,
170,
171,
185,
193,
213,
220,
263,
274,
275,
305,
306,
320,
330,
350,
360,
561,
580,
581,
613,
614,
628,
636,
656,
663,
685,
696,
697,
727,
728,
742,
752,
772,
782,
851,
852,
889,
890,
1021,
1022,
1377,
1378,
1448,
1449,
1486,
1487,
2000,
2034,
2053,
2054,
2086,
2087,
2101,
2109,
2129,
2136,
2158,
2159,
2283,
2294,
2295,
2325,
2326,
2340,
2350,
2370,
2380,
2763,
2793,
2811,
2812,
2849,
2850,
2864,
2874,
2894,
2902,
3017,
3018,
3054,
3119,
3167,
3207,
3225,
3255,
3285,
3286,
3304,
3305,
3746,
3747,
3770,
3805,
3842,
3853,
3854,
3884,
3885,
3899,
3909,
3929,
3939,
4095,
4124,
4141,
4142,
4175,
4176,
4190,
4200,
4220,
4230,
4280,
4281,
4342,
4343,
4522,
4551,
4570,
4571,
4608,
4609,
4623,
4633,
4653,
4661,
5048,
5064,
5065,
5099,
5100,
5114,
5124,
5144,
5152,
5206,
5207,
5329,
5330,
5350,
5351,
5369,
5370,
5403,
5404,
5418,
5428,
5448,
5458,
5519,
5535,
5536,
5570,
5571,
5585,
5595,
5615,
5623,
5706,
5724,
5725,
5758,
5759,
5773,
5783,
5803,
5813,
6043,
6059,
6060,
6094,
6095,
6109,
6119,
6139,
6147,
6190,
6209,
6210,
6247,
6248,
6262,
6272,
6292,
6300,
6388,
6389,
6400,
6428,
6440,
6441,
6471,
6472,
6486,
6496,
6516,
6526,
6687,
6688,
6816,
6831,
6832,
6856,
6857,
6871,
6878,
6898,
6904,
6997,
6998,
7028,
7080,
7100,
7143,
7176,
7205,
7206,
7240,
7241,
7261,
7262,
7274,
7275,
7305,
7306,
7320,
7330,
7350,
7360,
7489,
7490,
7734,
7735,
7936,
7951,
7952,
7976,
7977,
7991,
7998,
8018,
8024,
8077,
8078,
8170,
8192,
8193,
8208
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8208,
"ccnet_original_nlines": 252,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33930703997612,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0657108724117279,
"rps_doc_frac_lines_end_with_ellipsis": 0.003952569793909788,
"rps_doc_frac_no_alph_words": 0.2425328642129898,
"rps_doc_frac_unique_words": 0.4000000059604645,
"rps_doc_mean_word_length": 4.493076801300049,
"rps_doc_num_sentences": 84,
"rps_doc_symbol_to_word_ratio": 0.0011947399470955133,
"rps_doc_unigram_entropy": 5.676095962524414,
"rps_doc_word_count": 1300,
"rps_doc_frac_chars_dupe_10grams": 0.12600581347942352,
"rps_doc_frac_chars_dupe_5grams": 0.20955316722393036,
"rps_doc_frac_chars_dupe_6grams": 0.20955316722393036,
"rps_doc_frac_chars_dupe_7grams": 0.20955316722393036,
"rps_doc_frac_chars_dupe_8grams": 0.20955316722393036,
"rps_doc_frac_chars_dupe_9grams": 0.20955316722393036,
"rps_doc_frac_chars_top_2gram": 0.04451293125748634,
"rps_doc_frac_chars_top_3gram": 0.03492553159594536,
"rps_doc_frac_chars_top_4gram": 0.051361069083213806,
"rps_doc_books_importance": -806.5133056640625,
"rps_doc_books_importance_length_correction": -806.5133056640625,
"rps_doc_openwebtext_importance": -384.9999084472656,
"rps_doc_openwebtext_importance_length_correction": -384.9999084472656,
"rps_doc_wikipedia_importance": -258.69183349609375,
"rps_doc_wikipedia_importance_length_correction": -258.69183349609375
},
"fasttext": {
"dclm": 0.051000889390707016,
"english": 0.9436912536621094,
"fineweb_edu_approx": 0.9563621878623962,
"eai_general_math": 0.014509379863739014,
"eai_open_web_math": 0.2373679280281067,
"eai_web_code": 0.001389089971780777
}
}
|
{
"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": "794.81",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,167,752,509,273,519,000 |
Operator [][]?
Discussion in 'C++' started by Michael DeWulf, Oct 16, 2006.
1. I am trying to make a 2D matrix class. The data in the matrix will be of
type int and so the underlying data structure will be a 2D array (int **
matrix). To make the data easy to modify, I would like to be able to
modify this private array in the class with the operator [][]. I know
that the operator[] can be overloaded. However, is there away to overload
[][]?
Thanks,
Michael
Michael DeWulf, Oct 16, 2006
#1
1. Advertising
2. * Michael DeWulf:
> I am trying to make a 2D matrix class. The data in the matrix will be of
> type int and so the underlying data structure will be a 2D array (int **
> matrix). To make the data easy to modify, I would like to be able to
> modify this private array in the class with the operator [][]. I know
> that the operator[] can be overloaded. However, is there away to overload
> [][]?
Not directly, but it can be done by letting operator[] return a proxy
object, or letting it return a pointer or a reference to something
indexable.
However, the proxy idea generally means reduced performance, and the
pointer and reference ideas expose the implementation so it can't be
changed (and a pointer to a raw array is very unsafe).
For more about the latter point, and how you should be doing this
(namely, using operator()), see the FAQ item titled "Why shouldn't my
Matrix class's interface look like an array-of-array?", currently at
<url:
http://www.parashift.com/c++-faq-lite/operator-overloading.html#faq-13.11>.
Btw., it's always a good idea to look in the FAQ before posting.
And do consider using a std::vector as the representation, rather than a
raw pointer to dynamically allocated array.
It's more safe and yields less code and more clear code.
Hth.,
- Alf
--
A: Because it messes up the order in which people normally read text.
Q: Why is it such a bad thing?
A: Top-posting.
Q: What is the most annoying thing on usenet and in e-mail?
Alf P. Steinbach, Oct 16, 2006
#2
1. Advertising
3. Michael DeWulf
Kai-Uwe Bux Guest
Alf P. Steinbach wrote:
> * Michael DeWulf:
>> I am trying to make a 2D matrix class.
To the OP: don't---use one of those that are around.
>> The data in the matrix will be of
>> type int and so the underlying data structure will be a 2D array (int **
>> matrix). To make the data easy to modify, I would like to be able to
>> modify this private array in the class with the operator [][]. I know
>> that the operator[] can be overloaded. However, is there away to
>> overload
>> [][]?
>
> Not directly, but it can be done by letting operator[] return a proxy
> object, or letting it return a pointer or a reference to something
> indexable.
>
> However, the proxy idea generally means reduced performance,
Do you have actual data to back up that theory? I just whipped up the
following quickly:
#include <vector>
#include <algorithm>
class Matrix {
typedef std::vector<double> array;
public:
typedef array::size_type size_type;
private:
array the_data;
size_type num_rows;
size_type num_cols;
struct EntryProxy;
struct ConstEntryProxy;
friend class EntryProxy;
friend class ConstEntryProxy;
struct EntryProxy {
Matrix & ref;
size_type row;
EntryProxy ( Matrix & m, size_type r )
: ref ( m )
, row ( r )
{}
double & operator[] ( size_type col ) {
return ( ref.the_data[ row * ref.num_cols + col ] );
}
};
struct ConstEntryProxy {
Matrix const & ref;
size_type row;
ConstEntryProxy ( Matrix const & m, size_type r )
: ref ( m )
, row ( r )
{}
double const & operator[] ( size_type col ) const {
return ( ref.the_data[ row * ref.num_cols + col ] );
}
};
public:
Matrix ( size_type n_rows = 0, size_type n_cols = 0 )
: the_data ()
, num_rows ( n_rows )
, num_cols ( n_cols )
{
the_data.resize( num_rows * num_cols );
}
void swap ( Matrix & other ) {
std::swap( this->the_data, other.the_data );
std::swap( this->num_rows, other.num_rows );
std::swap( this->num_cols, other.num_cols );
}
double & operator() ( size_type row, size_type col ) {
return ( the_data[ row*num_cols + col ] );
}
double const & operator() ( size_type row, size_type col ) const {
return ( the_data[ row*num_cols + col ] );
}
EntryProxy operator[] ( size_type row ) {
return ( EntryProxy( *this, row ) );
}
ConstEntryProxy operator[] ( size_type row ) const {
return ( ConstEntryProxy( *this, row ) );
}
size_type rows ( void ) const {
return ( num_rows );
}
size_type cols ( void ) const {
return ( num_cols );
}
};
void multiply_no_proxy ( Matrix const & A,
Matrix const & B,
Matrix & result ) {
Matrix dummy ( A.rows(), B.cols() );
for ( Matrix::size_type r = 0; r < dummy.rows(); ++r ) {
for ( Matrix::size_type c = 0; c < dummy.cols(); ++c ) {
double inner_prod = 0;
for ( Matrix::size_type k = 0; k < A.cols(); ++k ) {
inner_prod += A(r,k)*B(k,c);
}
dummy( r, c ) = inner_prod;
}
}
result.swap( dummy );
}
void multiply_proxy ( Matrix const & A,
Matrix const & B,
Matrix & result ) {
Matrix dummy ( A.rows(), B.cols() );
for ( Matrix::size_type r = 0; r < dummy.rows(); ++r ) {
for ( Matrix::size_type c = 0; c < dummy.cols(); ++c ) {
double inner_prod = 0;
for ( Matrix::size_type k = 0; k < A.cols(); ++k ) {
inner_prod += A[r][k]*B[k][c];
}
dummy[r][c] = inner_prod;
}
}
result.swap( dummy );
}
#include <iostream>
int main ( void ) {
Matrix A ( 200, 3000 );
Matrix B ( 3000, 200 );
Matrix C;
#ifdef USE_PROXY
multiply_proxy( A, B, C );
std::cout << "used proxy " << C(2,2);
#else
multiply_no_proxy( A, B, C );
std::cout << "did not use proxy " << C(2,2);
#endif
std::cout << '\n';
}
I got:
news_group> cc++ -O3 -DUSE_PROXY alf_008.cc
news_group> time a.out
used proxy 0
real 0m2.374s
user 0m1.540s
sys 0m0.076s
news_group> time a.out
used proxy 0
real 0m3.151s
user 0m1.920s
sys 0m0.088s
news_group> time a.out
used proxy 0
real 0m3.137s
user 0m1.936s
sys 0m0.116s
news_group> time a.out
used proxy 0
real 0m2.723s
user 0m1.756s
sys 0m0.076s
news_group> cc++ -O3 alf_008.cc
news_group> time a.out
did not use proxy 0
real 0m2.343s
user 0m1.564s
sys 0m0.056s
news_group> time a.out
did not use proxy 0
real 0m2.474s
user 0m1.584s
sys 0m0.064s
news_group> time a.out
did not use proxy 0
real 0m2.924s
user 0m1.856s
sys 0m0.084s
news_group> time a.out
did not use proxy 0
real 0m3.166s
user 0m1.812s
sys 0m0.096s
Doesn't look like a significant difference to me. I wouldn't be surprised if
a compiler would generate identical code for both programs.
> and the
> pointer and reference ideas expose the implementation so it can't be
> changed (and a pointer to a raw array is very unsafe).
Agreed.
> For more about the latter point, and how you should be doing this
> (namely, using operator()), see the FAQ item titled "Why shouldn't my
> Matrix class's interface look like an array-of-array?", currently at
> <url:
>
http://www.parashift.com/c++-faq-lite/operator-overloading.html#faq-13.11>.
>
> Btw., it's always a good idea to look in the FAQ before posting.
This particular point of the FAQ is highly contested: The interface design
suggested by the FAQ may make sense from the point of view of the
implementer. However, libraries are to be designed from the point of view
of the user. In that case, you want to have proxies for rows and columns
anyway so that you could do, e.g., row-operations like so:
A.row(i) += some_scalar* A.row(j);
Of course, such proxies require some amount of magic. A good matrix
interface is not for the faint of heart.
> And do consider using a std::vector as the representation, rather than a
> raw pointer to dynamically allocated array.
>
> It's more safe and yields less code and more clear code.
I took the liberty to illustrate that in the code.
Best
Kai-Uwe Bux
Kai-Uwe Bux, Oct 16, 2006
#3
4. * Kai-Uwe Bux:
> Alf P. Steinbach wrote:
>>
>> However, the proxy idea generally means reduced performance,
>
> Do you have actual data to back up that theory?
Nope, just hearsay (although from competent folks), the expectation that
added code and longer call chains means reduced performence, and my own
experience /many/ years ago -- it was probably with Turbo C++...
> I just whipped up the following quickly:
[example showing no significant performance difference, snipped]
I stand (or actually, to be honest, sit) corrected -- thanks.
> news_group> cc++ -O3 -DUSE_PROXY alf_008.cc
I only have one program from you that I've tested, and you've already
reached number 8 on me! :-o)
Cheers,
- Alf
--
A: Because it messes up the order in which people normally read text.
Q: Why is it such a bad thing?
A: Top-posting.
Q: What is the most annoying thing on usenet and in e-mail?
Alf P. Steinbach, Oct 16, 2006
#4
5. Kai-Uwe Bux wrote:
> Alf P. Steinbach wrote:
....
>>
> http://www.parashift.com/c++-faq-lite/operator-overloading.html#faq-13.11>.
>> Btw., it's always a good idea to look in the FAQ before posting.
>
> This particular point of the FAQ is highly contested:...
Just want to add my $0.02 worth. I agree with you. I think we had this
discussion 6 months ago. Maybe it is time to get the FAQ changed.
G
Gianni Mariani, Oct 16, 2006
#5
6. Michael DeWulf
Noah Roberts Guest
Michael DeWulf wrote:
> I am trying to make a 2D matrix class. The data in the matrix will be of
> type int and so the underlying data structure will be a 2D array (int **
> matrix). To make the data easy to modify, I would like to be able to
> modify this private array in the class with the operator [][]. I know
> that the operator[] can be overloaded. However, is there away to overload
> [][]?
No, but [,] is "overloadable":
By Jack Saalweachter
struct MagicInt {
// operator overloads, constructors, etc, to make this class behave
// as an integer.
};
std::pair<MagicInt, MagicInt> operator , (const MagicInt &a, const
MagicInt& b) { return std::make_pair(a, b); }
class Array2d {
public:
value& operator[](const std::pair<MagicInt, MagicInt> &a) {
// use a.first and a.second to find the value...
}
};
int main() {
Array2d M(X, Y);
for (MagicInt a = 0; a < X; ++a)
for (MagicInt b = 0; b < Y; ++b)
M[a, b] = i + j;
}
Of course, overloading (,) works better and is a lot easier.
Noah Roberts, Oct 17, 2006
#6
7. Michael DeWulf
Earl Purple Guest
Gianni Mariani wrote:
> Kai-Uwe Bux wrote:
> > Alf P. Steinbach wrote:
> ...
> >>
> > http://www.parashift.com/c++-faq-lite/operator-overloading.html#faq-13.11>.
> >> Btw., it's always a good idea to look in the FAQ before posting.
> >
> > This particular point of the FAQ is highly contested:...
>
> Just want to add my $0.02 worth. I agree with you. I think we had this
> discussion 6 months ago. Maybe it is time to get the FAQ changed.
>
> G
My matrix template allows both notations. operator[] returns a row and
from the row you can also use operator[] to get an element. operator()
gets the element directly.
The row is of a buffer type that I use throughout my code that is
effectively a weak pointer and a size. It also has begin() and end()
methods that return pointers and can be used in algorithms. It has
several constructors including an implicit one from vector and it does
not take ownership of its pointer. There are two versions, one for
const and one for non-const and the const one has an implicit
constructor from the non-const one.
Earl Purple, Oct 17, 2006
#7
1. Advertising
Want to reply to this thread or ask your own question?
It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
1. Jakob Bieling
Q: operator void* or operator bool?
Jakob Bieling, Mar 5, 2004, in forum: C++
Replies:
2
Views:
587
Rob Williscroft
Mar 5, 2004
2. John Smith
Replies:
2
Views:
423
Ivan Vecerina
Oct 6, 2004
3. Alex Vinokur
Replies:
4
Views:
3,053
Peter Koch Larsen
Nov 26, 2004
4. Alex Vinokur
Replies:
3
Views:
5,030
Jeff Schwab
Mar 20, 2005
5. Tim Clacy
Replies:
15
Views:
2,689
Kanenas
May 30, 2005
Loading...
Share This Page
|
{
"url": "http://www.thecodingforums.com/threads/operator.457649/",
"source_domain": "www.thecodingforums.com",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "67429",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YLUNPV27VHIZH4KAR74RRL6WD43MHIZ4",
"WARC-Concurrent-To": "<urn:uuid:0e9f7e95-3063-4de3-ac64-50b6cf188391>",
"WARC-Date": "2014-09-21T12:58:16Z",
"WARC-IP-Address": "50.22.236.17",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:C5MYNJIDESGGTCBUDR5OVVHA2WCD7YA4",
"WARC-Record-ID": "<urn:uuid:92c14a91-1bf9-4d85-a50a-f0f61d969b70>",
"WARC-Target-URI": "http://www.thecodingforums.com/threads/operator.457649/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:607aae9d-a4bf-4b01-a225-b1ddc5b5a0fc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-234-18-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-41\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for September 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
15,
16,
77,
78,
156,
233,
306,
380,
458,
468,
469,
481,
493,
499,
532,
539,
558,
559,
582,
661,
740,
815,
891,
971,
983,
984,
985,
1059,
1130,
1145,
1146,
1219,
1292,
1351,
1352,
1422,
1496,
1569,
1579,
1659,
1660,
1729,
1730,
1807,
1855,
1856,
1917,
1918,
1928,
1929,
1939,
1940,
1947,
2021,
2056,
2076,
2140,
2146,
2181,
2188,
2207,
2208,
2228,
2229,
2251,
2252,
2280,
2281,
2305,
2351,
2352,
2353,
2410,
2411,
2452,
2532,
2608,
2685,
2757,
2773,
2786,
2787,
2793,
2869,
2942,
2959,
2965,
3032,
3033,
3034,
3108,
3131,
3132,
3154,
3179,
3180,
3199,
3200,
3239,
3240,
3252,
3253,
3293,
3294,
3307,
3308,
3328,
3352,
3376,
3377,
3400,
3428,
3457,
3491,
3492,
3516,
3517,
3535,
3554,
3555,
3598,
3614,
3630,
3637,
3638,
3682,
3739,
3745,
3746,
3753,
3754,
3783,
3784,
3808,
3827,
3828,
3882,
3898,
3914,
3921,
3922,
3978,
4035,
4041,
4042,
4049,
4050,
4051,
4052,
4064,
4065,
4123,
4141,
4167,
4193,
4199,
4243,
4249,
4250,
4285,
4334,
4383,
4432,
4438,
4439,
4498,
4545,
4551,
4552,
4623,
4670,
4676,
4677,
4723,
4764,
4770,
4771,
4828,
4874,
4880,
4881,
4917,
4942,
4948,
4949,
4985,
5010,
5016,
5017,
5024,
5025,
5026,
5073,
5095,
5119,
5160,
5221,
5282,
5309,
5366,
5399,
5405,
5437,
5443,
5449,
5475,
5481,
5482,
5526,
5548,
5572,
5613,
5674,
5735,
5762,
5819,
5854,
5860,
5890,
5896,
5902,
5928,
5934,
5935,
5959,
5960,
5984,
6012,
6040,
6054,
6075,
6106,
6148,
6158,
6192,
6241,
6252,
6275,
6281,
6282,
6293,
6294,
6342,
6369,
6386,
6387,
6405,
6423,
6440,
6467,
6484,
6485,
6503,
6521,
6538,
6565,
6582,
6583,
6601,
6619,
6636,
6663,
6680,
6681,
6699,
6717,
6734,
6735,
6771,
6798,
6822,
6823,
6841,
6859,
6876,
6903,
6927,
6928,
6946,
6964,
6981,
7008,
7032,
7033,
7051,
7069,
7086,
7113,
7137,
7138,
7156,
7174,
7191,
7192,
7193,
7274,
7338,
7339,
7340,
7354,
7429,
7490,
7491,
7492,
7504,
7505,
7506,
7578,
7654,
7729,
7741,
7747,
7748,
7828,
7834,
7905,
7906,
7907,
7986,
8056,
8134,
8211,
8274,
8275,
8314,
8315,
8387,
8432,
8433,
8434,
8513,
8563,
8569,
8632,
8633,
8634,
8689,
8690,
8691,
8700,
8701,
8717,
8723,
8753,
8760,
8780,
8810,
8817,
8885,
8886,
8892,
8946,
8947,
8948,
9025,
9101,
9170,
9171,
9172,
9219,
9220,
9221,
9290,
9291,
9357,
9358,
9359,
9409,
9410,
9411,
9485,
9518,
9519,
9531,
9532,
9542,
9543,
9550,
9624,
9659,
9679,
9743,
9749,
9784,
9791,
9815,
9845,
9846,
9855,
9862,
9863,
9945,
10017,
10018,
10024,
10087,
10088,
10089,
10164,
10234,
10235,
10241,
10247,
10280,
10287,
10307,
10308,
10331,
10332,
10358,
10437,
10516,
10591,
10667,
10747,
10759,
10760,
10761,
10796,
10797,
10822,
10823,
10845,
10917,
10939,
10940,
10947,
10948,
11019,
11069,
11070,
11090,
11102,
11166,
11219,
11225,
11226,
11233,
11234,
11251,
11272,
11273,
11310,
11347,
11368,
11369,
11375,
11376,
11441,
11447,
11478,
11485,
11505,
11506,
11528,
11529,
11555,
11580,
11612,
11613,
11623,
11632,
11633,
11717,
11791,
11792,
11800,
11865,
11866,
11872,
11949,
12021,
12027,
12035,
12036,
12037,
12112,
12187,
12218,
12219,
12289,
12362,
12433,
12508,
12579,
12645,
12685,
12691,
12721,
12728,
12747,
12748,
12803,
12804,
12962,
12978,
12997,
12998,
13038,
13039,
13085,
13098,
13104,
13115,
13123,
13143,
13159,
13175,
13188,
13194,
13205,
13213,
13231,
13247,
13265,
13278,
13284,
13295,
13305,
13327,
13344,
13362,
13375,
13381,
13392,
13402,
13418,
13435,
13450,
13463,
13470,
13481,
13491,
13503,
13520,
13531,
13532
],
"line_end_idx": [
15,
16,
77,
78,
156,
233,
306,
380,
458,
468,
469,
481,
493,
499,
532,
539,
558,
559,
582,
661,
740,
815,
891,
971,
983,
984,
985,
1059,
1130,
1145,
1146,
1219,
1292,
1351,
1352,
1422,
1496,
1569,
1579,
1659,
1660,
1729,
1730,
1807,
1855,
1856,
1917,
1918,
1928,
1929,
1939,
1940,
1947,
2021,
2056,
2076,
2140,
2146,
2181,
2188,
2207,
2208,
2228,
2229,
2251,
2252,
2280,
2281,
2305,
2351,
2352,
2353,
2410,
2411,
2452,
2532,
2608,
2685,
2757,
2773,
2786,
2787,
2793,
2869,
2942,
2959,
2965,
3032,
3033,
3034,
3108,
3131,
3132,
3154,
3179,
3180,
3199,
3200,
3239,
3240,
3252,
3253,
3293,
3294,
3307,
3308,
3328,
3352,
3376,
3377,
3400,
3428,
3457,
3491,
3492,
3516,
3517,
3535,
3554,
3555,
3598,
3614,
3630,
3637,
3638,
3682,
3739,
3745,
3746,
3753,
3754,
3783,
3784,
3808,
3827,
3828,
3882,
3898,
3914,
3921,
3922,
3978,
4035,
4041,
4042,
4049,
4050,
4051,
4052,
4064,
4065,
4123,
4141,
4167,
4193,
4199,
4243,
4249,
4250,
4285,
4334,
4383,
4432,
4438,
4439,
4498,
4545,
4551,
4552,
4623,
4670,
4676,
4677,
4723,
4764,
4770,
4771,
4828,
4874,
4880,
4881,
4917,
4942,
4948,
4949,
4985,
5010,
5016,
5017,
5024,
5025,
5026,
5073,
5095,
5119,
5160,
5221,
5282,
5309,
5366,
5399,
5405,
5437,
5443,
5449,
5475,
5481,
5482,
5526,
5548,
5572,
5613,
5674,
5735,
5762,
5819,
5854,
5860,
5890,
5896,
5902,
5928,
5934,
5935,
5959,
5960,
5984,
6012,
6040,
6054,
6075,
6106,
6148,
6158,
6192,
6241,
6252,
6275,
6281,
6282,
6293,
6294,
6342,
6369,
6386,
6387,
6405,
6423,
6440,
6467,
6484,
6485,
6503,
6521,
6538,
6565,
6582,
6583,
6601,
6619,
6636,
6663,
6680,
6681,
6699,
6717,
6734,
6735,
6771,
6798,
6822,
6823,
6841,
6859,
6876,
6903,
6927,
6928,
6946,
6964,
6981,
7008,
7032,
7033,
7051,
7069,
7086,
7113,
7137,
7138,
7156,
7174,
7191,
7192,
7193,
7274,
7338,
7339,
7340,
7354,
7429,
7490,
7491,
7492,
7504,
7505,
7506,
7578,
7654,
7729,
7741,
7747,
7748,
7828,
7834,
7905,
7906,
7907,
7986,
8056,
8134,
8211,
8274,
8275,
8314,
8315,
8387,
8432,
8433,
8434,
8513,
8563,
8569,
8632,
8633,
8634,
8689,
8690,
8691,
8700,
8701,
8717,
8723,
8753,
8760,
8780,
8810,
8817,
8885,
8886,
8892,
8946,
8947,
8948,
9025,
9101,
9170,
9171,
9172,
9219,
9220,
9221,
9290,
9291,
9357,
9358,
9359,
9409,
9410,
9411,
9485,
9518,
9519,
9531,
9532,
9542,
9543,
9550,
9624,
9659,
9679,
9743,
9749,
9784,
9791,
9815,
9845,
9846,
9855,
9862,
9863,
9945,
10017,
10018,
10024,
10087,
10088,
10089,
10164,
10234,
10235,
10241,
10247,
10280,
10287,
10307,
10308,
10331,
10332,
10358,
10437,
10516,
10591,
10667,
10747,
10759,
10760,
10761,
10796,
10797,
10822,
10823,
10845,
10917,
10939,
10940,
10947,
10948,
11019,
11069,
11070,
11090,
11102,
11166,
11219,
11225,
11226,
11233,
11234,
11251,
11272,
11273,
11310,
11347,
11368,
11369,
11375,
11376,
11441,
11447,
11478,
11485,
11505,
11506,
11528,
11529,
11555,
11580,
11612,
11613,
11623,
11632,
11633,
11717,
11791,
11792,
11800,
11865,
11866,
11872,
11949,
12021,
12027,
12035,
12036,
12037,
12112,
12187,
12218,
12219,
12289,
12362,
12433,
12508,
12579,
12645,
12685,
12691,
12721,
12728,
12747,
12748,
12803,
12804,
12962,
12978,
12997,
12998,
13038,
13039,
13085,
13098,
13104,
13115,
13123,
13143,
13159,
13175,
13188,
13194,
13205,
13213,
13231,
13247,
13265,
13278,
13284,
13295,
13305,
13327,
13344,
13362,
13375,
13381,
13392,
13402,
13418,
13435,
13450,
13463,
13470,
13481,
13491,
13503,
13520,
13531,
13532,
13547
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13547,
"ccnet_original_nlines": 537,
"rps_doc_curly_bracket": 0.004281389992684126,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2562711834907532,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03593219816684723,
"rps_doc_frac_lines_end_with_ellipsis": 0.013011150062084198,
"rps_doc_frac_no_alph_words": 0.3538983166217804,
"rps_doc_frac_unique_words": 0.2716253399848938,
"rps_doc_mean_word_length": 4.650137901306152,
"rps_doc_num_sentences": 195,
"rps_doc_symbol_to_word_ratio": 0.008135589770972729,
"rps_doc_unigram_entropy": 5.558144569396973,
"rps_doc_word_count": 1815,
"rps_doc_frac_chars_dupe_10grams": 0.45746445655822754,
"rps_doc_frac_chars_dupe_5grams": 0.5354265570640564,
"rps_doc_frac_chars_dupe_6grams": 0.5136255621910095,
"rps_doc_frac_chars_dupe_7grams": 0.5081753730773926,
"rps_doc_frac_chars_dupe_8grams": 0.4802132844924927,
"rps_doc_frac_chars_dupe_9grams": 0.4745260775089264,
"rps_doc_frac_chars_top_2gram": 0.007701420225203037,
"rps_doc_frac_chars_top_3gram": 0.01611373946070671,
"rps_doc_frac_chars_top_4gram": 0.00829384010285139,
"rps_doc_books_importance": -1435.6573486328125,
"rps_doc_books_importance_length_correction": -1435.6573486328125,
"rps_doc_openwebtext_importance": -888.9343872070312,
"rps_doc_openwebtext_importance_length_correction": -888.9343872070312,
"rps_doc_wikipedia_importance": -660.6863403320312,
"rps_doc_wikipedia_importance_length_correction": -660.6863403320312
},
"fasttext": {
"dclm": 0.028538169339299202,
"english": 0.7954570055007935,
"fineweb_edu_approx": 1.4589729309082031,
"eai_general_math": 0.8507785201072693,
"eai_open_web_math": 0.23462921380996704,
"eai_web_code": 0.27649837732315063
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,360,566,553,747,225,000 |
Comments and answers for "improve xmlkv performance" https://answers.splunk.com/answers/386535/improve-xmlkv-performance.html The latest comments and answers for the question "improve xmlkv performance" Answer by lguinn2 https://answers.splunk.com/answering/387291/view.html `xmlkv` tries to dynamically find all key-value pairs within the search results, so it can be quite slow. You are already extracting some fields with `rex` - you could extract additional fields in the same way. The more fields that exist in the xml, the longer `xmlkv` will run. So using `rex` to extract only the fields that you need can be faster. What do you plan to do *after* the `xmlkv` step? Thu, 31 Mar 2016 01:08:27 GMT lguinn2
|
{
"url": "https://answers.splunk.com/feed/386535/comments-and-answers.rss",
"source_domain": "answers.splunk.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "1903",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZJYSCUIRPTVQJZUHXISMFGHAXSKYHCV7",
"WARC-Concurrent-To": "<urn:uuid:8a70e59a-ec8c-408e-9ff4-c9df84471096>",
"WARC-Date": "2019-12-12T23:30:10Z",
"WARC-IP-Address": "54.204.12.32",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:55XIZUEGPYVIEBO3N7Z4QTXEOQDU7QX5",
"WARC-Record-ID": "<urn:uuid:99875325-1492-44ca-b9fe-1bd2594ba78e>",
"WARC-Target-URI": "https://answers.splunk.com/feed/386535/comments-and-answers.rss",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ba94dbf7-b97c-477c-b48e-31f37dc39575>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-17.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
],
"line_end_idx": [
711
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 711,
"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.3030303120613098,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006060610059648752,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.30909091234207153,
"rps_doc_frac_unique_words": 0.656862735748291,
"rps_doc_mean_word_length": 5.5,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.007297992706299,
"rps_doc_word_count": 102,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03921569138765335,
"rps_doc_frac_chars_top_3gram": 0.06417112052440643,
"rps_doc_frac_chars_top_4gram": 0.07486630976200104,
"rps_doc_books_importance": -54.47171401977539,
"rps_doc_books_importance_length_correction": -54.85688781738281,
"rps_doc_openwebtext_importance": -45.281646728515625,
"rps_doc_openwebtext_importance_length_correction": -45.66682052612305,
"rps_doc_wikipedia_importance": -33.445159912109375,
"rps_doc_wikipedia_importance_length_correction": -33.8303337097168
},
"fasttext": {
"dclm": 0.37520426511764526,
"english": 0.8615093231201172,
"fineweb_edu_approx": 1.1028730869293213,
"eai_general_math": 0.16751503944396973,
"eai_open_web_math": 0.19405090808868408,
"eai_web_code": 0.008640940301120281
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,801,655,068,588,027,000 |
Solved
Finding a way to track click throughs without losing http_referer
Posted on 2014-11-14
21
130 Views
Last Modified: 2015-01-16
At my travel site (see www.travelinbc.com/vancouver.cfm) the <a href> for many of the listings go to logit.cfm. (e.g. includes/logit.cfm?id=113&type=1&site=http://www.collegehostel.com/)
However, logit.cfm uses cflocation (in a cfc) which strips the http_referer value. This in turn does not allow the analytics program at the destination website to register the value.
What I'm looking for is a new way to register the click through as is done currently but also redirect the click through in a way that lets the receiving website see it.
The version of ColdFusion is 7.0 MX
From an SEO perspective, the cflocation code is not letting the other website see the click through. We want that, but we want the stats in our database.
One theory that I've heard is that we should be able to do this with javascript so that when an on click event occurs, the INSERT could be run without interfering with the http_referer.
logit.txt
cfc-func-cflocation.txt
0
Comment
Question by:quokkasys
• 7
• 5
• 3
• +3
21 Comments
LVL 61
Expert Comment
by:gheist
ID: 40459824
Most likely you need to include code of logit.cfm in a page (or plainly log referer in access logs?) to capture referer without adding extra burden on a customer browser.
BTW Coldfusion 7 is EOL for couple of years.
Macromedia ColdFusion 7.x.x 2/7/2005 2/7/2010 2/7/2012
If you read intro paragraph of this:
https://en.wikipedia.org/wiki/ColdFusion_Markup_Language
You might save some cent on upgrade.
0
Author Comment
by:quokkasys
ID: 40460299
Upgrading CF is not a viable option at this time. In addition, my assumption is that the entire logit.cfm code has to be replaced because cflocation regardless of version strips the http_referer.
0
LVL 61
Expert Comment
by:gheist
ID: 40460365
Referer: only arrives to main page reached, images and other page components are loaded from that page and have it as a referer. It should be possible to use standard access log to collect referers.
0
LVL 70
Expert Comment
by:Jason C. Levine
ID: 40471309
What I'm looking for is a new way to register the click through as is done currently but also redirect the click through in a way that lets the receiving website see it.
cflocation is not your friend here. Not sure if there is an answer that will work that allows you to continue using it. What you could do is a convoluted double redirect: Send the click to logit.cfm, then have logit send to a second script that does a simple javascript window.location or or <meta http-equiv="refresh" content="<2;url=http://go.somewhere.com>"> or other form of AJAX action to send the user on their way.
0
Author Comment
by:quokkasys
ID: 40471891
Yes. I am assuming cflocation has to go away. Is there any javascript that could fire off the cfm or cfc function while leaving the a href as normal?
E.g. Onclick event -> does INSERT INTO independently of the a href.
0
LVL 42
Accepted Solution
by:
Rob Jurd, EE MVE earned 500 total points
ID: 40472722
From purely the javascript side (my CF is VERY limited).
I'm going to use jQuery to simplify the javascript, you will need to include this tag in the head section of your site:
<script src="https://code.jquery.com/jquery-2.1.1.min.js"></script>
I'm going to assume you have a simple CF script that takes does the INSERT INTO when the link is clicked:
Demo here: http://jsbin.com/socoyu/1/edit?html,js,console,output
Also within <script> tags:
$(function() {
$('a').on('click', function(e) {
e.preventDefault();
var me = this;
$.ajax({
url:'update_db_cf_script.cfm',
data: {
name: 'value go here',
nextvar: 'something else'
},
method: 'POST',
success: function(data) {
// this is called after the script has completed and updated the database
console.log($(me).attr('href'));
//$(me) is the original link
}
})
});
});
Open in new window
0
Author Comment
by:quokkasys
ID: 40472942
To Rob:
IDEA: Let's go pure Javascript on this. Can an <a href> that looks like this:
<a href="http://www.seaviewbeachresort.com/" name="544" onClick="LogFunction();">Seaview Beach Resort</a>
have the LogFunction write "544,2014-11-30 09:09:59" to a clicklog.txt text file on the server? The 544 is the unique identifier and the current date and time.
This would eliminate Coldfusion calls completely and I could write a batch process interrogate the log file and load the data I need. That does is not required in real time.
At this point my javascript skills fall off the ledge. I worry about contention to the log file as lots of people could be calling the javascript function at the same time. Can you help?
0
LVL 42
Expert Comment
by:Rob Jurd, EE MVE
ID: 40473016
quokkasys,
Let's see how we go.
JavaScript runs on the client so consequently does not have access to your server. JavaScript will need to call (via ajax) a server side scripting language e.g. ColdFusion/php/asp/whatever and that script had to write the log file.
As you're using ColdFusion, create a simple script that takes a request parameter and writes it to a file. JavaScript passes the variable via ajax.
Does that make sense so far?
0
Author Comment
by:quokkasys
ID: 40475299
It makes sense, but where I run a-ground is with Coldfusion. I don't know how to run something server side without posting to a .cfm. This tends to interfere with the a href post to another page. Is there a way to execute a script without posting to a CFM? I can write the CF code, but how does javascript -> Ajax -> Coldfusion?
0
Find Ransomware Secrets With All-Source Analysis
Ransomware has become a major concern for organizations; its prevalence has grown due to past successes achieved by threat actors. While each ransomware variant is different, we’ve seen some common tactics and trends used among the authors of the malware.
LVL 42
Expert Comment
by:Rob Jurd, EE MVE
ID: 40475363
We will need to post to a .cfm but it will be done via ajax meaning the page doesn't reload, it does it in the background (asynchronous). Let's give that a try. I'd also suggest we use jQuery as it will make this process VERY simple (which is nothing but pure javascript http://www.experts-exchange.com/Programming/Languages/Scripting/JavaScript/A_12264-Javascript-Frameworks-what-are-they.html).
Please refer back to my comment above http:#a40472722 as I would only be repeating it again here. That code is javascript -> Ajax -> Coldfusion
0
LVL 61
Expert Comment
by:gheist
ID: 40475441
You can store entrance page in a session parameter or hash it into user cookie, then reuse it where needed.
0
LVL 52
Expert Comment
by:_agx_
ID: 40476261
(no points, I've gotta run ...)
I agree with Rob. You could easily adapt his example to send the information to a cfc. Then perform the db insert (or whatever you need) inside the cffunction. Here's an adaptation of Rob's example. It invokes a cfc method and writes the 2 parameters to a file. Obviously you can change the cffunction to do whatever you want.
JQuery:
<script src="https://code.jquery.com/jquery-2.1.1.min.js"></script>
<script type="text/javascript">
$(function() {
$('a').on('click', function(e) {
e.preventDefault();
var me = this;
$.ajax({
url:'/path/to/YourComponent.cfc?method=logClick',
data: {
// note - the parameter names should match the cfargument names
linkClicked: $(me).attr('href'),
someParam: $(me).attr('name')
},
method: 'POST',
success: function(data) {
alert('done');
// this is called after the script has completed and updated the database
console.log($(me).attr('href'));
//$(me) is the original link
},
error: function (content) {
alert(content.responseText);
}
})
});
});
</script>
<a href="http://blahblah.com name="544">Click to test</a>
Open in new window
/path/to/YourComponent.cfc
<cfcomponent>
<cffunction name="logClick" access="remote" returntype="void" output="false">
<cfargument name="linkClicked" type="string" required="true" />
<cfargument name="someParam" type="string" required="true" />
<!--- for demo purposes, just log the values to a file --->
<cfset local.text = now() &": linkClicked="& arguments.linkClicked &"&someParam="& arguments.someParam>
<cffile action="append" file="c:/temp/logClick.log" output="#local.text#" />
<!--- do database insert, etc... here ---->
</cffunction>
</cfcomponent>
Open in new window
0
LVL 42
Expert Comment
by:Rob Jurd, EE MVE
ID: 40476905
Thanks _agx_! :-) I wouldn't know where to begin with cf.
0
LVL 52
Expert Comment
by:_agx_
ID: 40478458
@RobJurd - You're welcome :)
0
Author Comment
by:quokkasys
ID: 40483523
I am going to work on testing a combination of these ideas over the weekend. I will report back with results. Thanks for your help.
0
LVL 42
Expert Comment
by:Rob Jurd, EE MVE
ID: 40483870
No problem. Any clarification you need, just ask.
0
LVL 58
Expert Comment
by:Gary
ID: 40521989
I've requested that this question be closed as follows:
Accepted answer: 500 points for Rob Jurd's comment #a40472722
for the following reason:
This question has been classified as abandoned and is closed as part of the Cleanup Program. See the recommendation for more details.
0
Author Comment
by:quokkasys
ID: 40521987
Please do not close this question as I have yet to test or implement the code suggestions due to Christmas and New Year's holidays and staff shortages. My target is Jan 10/15. Please advise.
0
Author Comment
by:quokkasys
ID: 40521990
Please take my previous note as an objection.
0
Featured Post
How to run any project with ease
Manage projects of all sizes how you want. Great for personal to-do lists, project milestones, team priorities and launch plans.
- Combine task lists, docs, spreadsheets, and chat in one
- View and edit from mobile/offline
- Cut down on emails
Join & Write a Comment
"In order to have an organized way for empathy mapping, we rely on a psychological model and trying to model it in a simple way, so we will split the board to three section for each persona and a scenario and try to see what those personas would Do,…
Although it can be difficult to imagine, someday your child will have a career of his or her own. He or she will likely start a family, buy a home and start having their own children. So, while being a kid is still extremely important, it’s also …
The purpose of this video is to demonstrate how to integrate Mailchimp with WordPress, by placing a Mailchimp signup form on a WordPress Page or Post. This will be demonstrated using a Windows 8 PC. Mailchimp will be used. Log into your Mailchi…
This tutorial will teach you the core code needed to finalize the addition of a watermark to your image. The viewer will use a small PHP class to learn and create a watermark.
747 members asked questions and received personalized solutions in the past 7 days.
Join the community of 500,000 technology professionals and ask your questions.
Join & Ask a Question
Need Help in Real-Time?
Connect with top rated Experts
12 Experts available now in Live!
Get 1:1 Help Now
|
{
"url": "https://www.experts-exchange.com/questions/28562581/Finding-a-way-to-track-click-throughs-without-losing-http-referer.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2016-50",
"warc_metadata": {
"Content-Length": "287959",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PIGUTPNYDDIZMVESUH5TNPINXJAWFRMW",
"WARC-Concurrent-To": "<urn:uuid:5423ee9e-ed81-40ae-b3e9-3c12ba714e0a>",
"WARC-Date": "2016-12-10T21:08:45Z",
"WARC-IP-Address": "104.20.70.216",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:P3ZYGP2AHFVK7LJ2X76AEZ3AMLH36J4Y",
"WARC-Record-ID": "<urn:uuid:684e4e5f-60b5-4d41-8210-9a7938a2c80d>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/28562581/Finding-a-way-to-track-click-throughs-without-losing-http-referer.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e2c1f728-6544-4543-b404-7e2627466a51>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-129-80.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-50\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for November 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
7,
8,
74,
75,
96,
99,
109,
135,
337,
338,
524,
525,
695,
696,
732,
733,
888,
889,
1075,
1085,
1109,
1111,
1119,
1141,
1147,
1153,
1159,
1166,
1178,
1180,
1187,
1188,
1203,
1204,
1214,
1227,
1398,
1443,
1530,
1567,
1624,
1661,
1663,
1665,
1666,
1681,
1682,
1695,
1708,
1905,
1907,
1909,
1916,
1917,
1932,
1933,
1943,
1956,
2155,
2157,
2159,
2166,
2167,
2182,
2183,
2202,
2215,
2385,
2386,
2810,
2812,
2814,
2815,
2830,
2831,
2844,
2857,
3007,
3008,
3076,
3078,
3080,
3087,
3088,
3106,
3107,
3111,
3152,
3165,
3222,
3223,
3343,
3411,
3412,
3518,
3519,
3584,
3585,
3612,
3613,
3628,
3662,
3684,
3701,
3712,
3746,
3757,
3784,
3814,
3820,
3839,
3868,
3946,
3993,
4026,
4031,
4036,
4041,
4045,
4046,
4065,
4066,
4068,
4070,
4071,
4086,
4087,
4100,
4113,
4121,
4122,
4202,
4203,
4309,
4310,
4471,
4472,
4647,
4648,
4837,
4839,
4841,
4848,
4849,
4864,
4865,
4885,
4898,
4909,
4910,
4931,
4932,
5166,
5314,
5343,
5345,
5347,
5348,
5363,
5364,
5377,
5390,
5723,
5725,
5774,
5775,
6031,
6032,
6034,
6041,
6042,
6057,
6058,
6078,
6091,
6490,
6491,
6636,
6638,
6640,
6647,
6648,
6663,
6664,
6674,
6687,
6795,
6797,
6799,
6806,
6807,
6822,
6823,
6832,
6845,
6877,
6878,
7207,
7208,
7216,
7284,
7316,
7331,
7365,
7387,
7404,
7415,
7468,
7479,
7576,
7613,
7647,
7653,
7672,
7701,
7720,
7798,
7845,
7878,
7884,
7915,
7954,
7965,
7970,
7975,
7979,
8031,
8032,
8090,
8091,
8110,
8111,
8112,
8139,
8140,
8154,
8233,
8299,
8363,
8366,
8428,
8534,
8613,
8614,
8660,
8675,
8690,
8691,
8710,
8711,
8713,
8715,
8722,
8723,
8738,
8739,
8759,
8772,
8830,
8832,
8834,
8841,
8842,
8857,
8858,
8867,
8880,
8909,
8911,
8913,
8914,
8929,
8930,
8943,
8956,
9090,
9092,
9094,
9101,
9102,
9117,
9118,
9138,
9151,
9201,
9203,
9205,
9212,
9213,
9228,
9229,
9237,
9250,
9306,
9307,
9369,
9370,
9396,
9397,
9531,
9533,
9535,
9536,
9551,
9552,
9565,
9578,
9771,
9773,
9775,
9776,
9791,
9792,
9805,
9818,
9864,
9866,
9867,
9881,
9882,
9915,
9916,
10045,
10103,
10139,
10160,
10161,
10184,
10185,
10436,
10684,
10930,
11106,
11107,
11191,
11192,
11271,
11272,
11294,
11295,
11319,
11320,
11351,
11352,
11386,
11387
],
"line_end_idx": [
7,
8,
74,
75,
96,
99,
109,
135,
337,
338,
524,
525,
695,
696,
732,
733,
888,
889,
1075,
1085,
1109,
1111,
1119,
1141,
1147,
1153,
1159,
1166,
1178,
1180,
1187,
1188,
1203,
1204,
1214,
1227,
1398,
1443,
1530,
1567,
1624,
1661,
1663,
1665,
1666,
1681,
1682,
1695,
1708,
1905,
1907,
1909,
1916,
1917,
1932,
1933,
1943,
1956,
2155,
2157,
2159,
2166,
2167,
2182,
2183,
2202,
2215,
2385,
2386,
2810,
2812,
2814,
2815,
2830,
2831,
2844,
2857,
3007,
3008,
3076,
3078,
3080,
3087,
3088,
3106,
3107,
3111,
3152,
3165,
3222,
3223,
3343,
3411,
3412,
3518,
3519,
3584,
3585,
3612,
3613,
3628,
3662,
3684,
3701,
3712,
3746,
3757,
3784,
3814,
3820,
3839,
3868,
3946,
3993,
4026,
4031,
4036,
4041,
4045,
4046,
4065,
4066,
4068,
4070,
4071,
4086,
4087,
4100,
4113,
4121,
4122,
4202,
4203,
4309,
4310,
4471,
4472,
4647,
4648,
4837,
4839,
4841,
4848,
4849,
4864,
4865,
4885,
4898,
4909,
4910,
4931,
4932,
5166,
5314,
5343,
5345,
5347,
5348,
5363,
5364,
5377,
5390,
5723,
5725,
5774,
5775,
6031,
6032,
6034,
6041,
6042,
6057,
6058,
6078,
6091,
6490,
6491,
6636,
6638,
6640,
6647,
6648,
6663,
6664,
6674,
6687,
6795,
6797,
6799,
6806,
6807,
6822,
6823,
6832,
6845,
6877,
6878,
7207,
7208,
7216,
7284,
7316,
7331,
7365,
7387,
7404,
7415,
7468,
7479,
7576,
7613,
7647,
7653,
7672,
7701,
7720,
7798,
7845,
7878,
7884,
7915,
7954,
7965,
7970,
7975,
7979,
8031,
8032,
8090,
8091,
8110,
8111,
8112,
8139,
8140,
8154,
8233,
8299,
8363,
8366,
8428,
8534,
8613,
8614,
8660,
8675,
8690,
8691,
8710,
8711,
8713,
8715,
8722,
8723,
8738,
8739,
8759,
8772,
8830,
8832,
8834,
8841,
8842,
8857,
8858,
8867,
8880,
8909,
8911,
8913,
8914,
8929,
8930,
8943,
8956,
9090,
9092,
9094,
9101,
9102,
9117,
9118,
9138,
9151,
9201,
9203,
9205,
9212,
9213,
9228,
9229,
9237,
9250,
9306,
9307,
9369,
9370,
9396,
9397,
9531,
9533,
9535,
9536,
9551,
9552,
9565,
9578,
9771,
9773,
9775,
9776,
9791,
9792,
9805,
9818,
9864,
9866,
9867,
9881,
9882,
9915,
9916,
10045,
10103,
10139,
10160,
10161,
10184,
10185,
10436,
10684,
10930,
11106,
11107,
11191,
11192,
11271,
11272,
11294,
11295,
11319,
11320,
11351,
11352,
11386,
11387,
11403
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11403,
"ccnet_original_nlines": 346,
"rps_doc_curly_bracket": 0.0019293200457468629,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3254792392253876,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03474441170692444,
"rps_doc_frac_lines_end_with_ellipsis": 0.008645529858767986,
"rps_doc_frac_no_alph_words": 0.27595847845077515,
"rps_doc_frac_unique_words": 0.3922031819820404,
"rps_doc_mean_word_length": 4.991139888763428,
"rps_doc_num_sentences": 161,
"rps_doc_symbol_to_word_ratio": 0.003594249952584505,
"rps_doc_unigram_entropy": 5.776531219482422,
"rps_doc_word_count": 1693,
"rps_doc_frac_chars_dupe_10grams": 0.06852070987224579,
"rps_doc_frac_chars_dupe_5grams": 0.13207100331783295,
"rps_doc_frac_chars_dupe_6grams": 0.10142011940479279,
"rps_doc_frac_chars_dupe_7grams": 0.0981065109372139,
"rps_doc_frac_chars_dupe_8grams": 0.08508875966072083,
"rps_doc_frac_chars_dupe_9grams": 0.07254438102245331,
"rps_doc_frac_chars_top_2gram": 0.016923079267144203,
"rps_doc_frac_chars_top_3gram": 0.011597629636526108,
"rps_doc_frac_chars_top_4gram": 0.020710060372948647,
"rps_doc_books_importance": -1093.4652099609375,
"rps_doc_books_importance_length_correction": -1093.4652099609375,
"rps_doc_openwebtext_importance": -585.26171875,
"rps_doc_openwebtext_importance_length_correction": -585.26171875,
"rps_doc_wikipedia_importance": -452.19195556640625,
"rps_doc_wikipedia_importance_length_correction": -452.19195556640625
},
"fasttext": {
"dclm": 0.025876639410853386,
"english": 0.836967945098877,
"fineweb_edu_approx": 1.6514121294021606,
"eai_general_math": 0.042561110109090805,
"eai_open_web_math": 0.13251447677612305,
"eai_web_code": 0.008153979666531086
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,581,445,463,402,220,000 |
Answers
Solutions by everydaycalculation.com
Answers.everydaycalculation.com » Compare fractions
Compare 5/8 and 6/10
5/8 is greater than 6/10
Steps for comparing fractions
1. Find the least common denominator or LCM of the two denominators:
LCM of 8 and 10 is 40
Next, find the equivalent fraction of both fractional numbers with denominator 40
2. For the 1st fraction, since 8 × 5 = 40,
5/8 = 5 × 5/8 × 5 = 25/40
3. Likewise, for the 2nd fraction, since 10 × 4 = 40,
6/10 = 6 × 4/10 × 4 = 24/40
4. Since the denominators are now the same, the fraction with the bigger numerator is the greater fraction
5. 25/40 > 24/40 or 5/8 > 6/10
MathStep (Works offline)
Download our mobile app and learn to work with fractions in your own time:
Android and iPhone/ iPad
Related:
© everydaycalculation.com
|
{
"url": "https://answers.everydaycalculation.com/compare-fractions/5-8-and-6-10",
"source_domain": "answers.everydaycalculation.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "8486",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BKTNUGARLCVXD7LQP33I7CZMCALRPZQN",
"WARC-Concurrent-To": "<urn:uuid:c3823794-ea35-4308-9543-42eefa4acdd3>",
"WARC-Date": "2021-09-17T22:02:54Z",
"WARC-IP-Address": "96.126.107.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XV4RGSGT32F66ZC6SIEMI27ZDJ4NXCJN",
"WARC-Record-ID": "<urn:uuid:5033bfb1-3138-4a11-b9d8-edcaf3e3e5b1>",
"WARC-Target-URI": "https://answers.everydaycalculation.com/compare-fractions/5-8-and-6-10",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0190d56c-bc09-4028-b589-056566591b8b>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-22\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
46,
47,
99,
100,
121,
122,
147,
148,
178,
179,
250,
276,
277,
363,
408,
438,
494,
526,
635,
668,
669,
694,
695,
770,
795,
796,
805,
806
],
"line_end_idx": [
8,
9,
46,
47,
99,
100,
121,
122,
147,
148,
178,
179,
250,
276,
277,
363,
408,
438,
494,
526,
635,
668,
669,
694,
695,
770,
795,
796,
805,
806,
831
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 831,
"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.22842639684677124,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010152280330657959,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5025380849838257,
"rps_doc_frac_unique_words": 0.5555555820465088,
"rps_doc_mean_word_length": 4.503703594207764,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.0774383544921875,
"rps_doc_word_count": 135,
"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.023026319220662117,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -82.47645568847656,
"rps_doc_books_importance_length_correction": -82.47645568847656,
"rps_doc_openwebtext_importance": -42.644859313964844,
"rps_doc_openwebtext_importance_length_correction": -42.16053771972656,
"rps_doc_wikipedia_importance": -41.364261627197266,
"rps_doc_wikipedia_importance_length_correction": -41.364261627197266
},
"fasttext": {
"dclm": 0.9910576939582825,
"english": 0.8889705538749695,
"fineweb_edu_approx": 2.465520143508911,
"eai_general_math": 0.6025970578193665,
"eai_open_web_math": 0.4733656644821167,
"eai_web_code": 0.00022405000345315784
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,674,056,949,584,779,000 |
Premature end of script headers ? What is it ?
Discussion in 'Installation/Configuration' started by misterm, Nov 8, 2005.
1. misterm
misterm Member HowtoForge Supporter
Hello with all
What it is, this error :
"Premature end of script headers"
Because I have prob with repertories cgi-bin of each site, pourrier you to say itself, as I must make there to correct this problem.
Yours sincerely
MM :confused:
2. till
till Super Moderator Staff Member ISPConfig Developer
Have you saved your CGI scripts with unix linebreaks?
3. misterm
misterm Member HowtoForge Supporter
Can you explain me exactly
Hello
Can you explain me exactly, this sentence, because I nothing includes/understands, so that you says, because on the server that I have to create, one will launch lodgings, is that would be a pity which scripts cgi, does not function?
Well with you
MM :confused:
4. till
till Super Moderator Staff Member ISPConfig Developer
Windows and unix have different linebreaks. In Linux the linebreak is "\n", in Windows the linebreak is "\r\n" if you express it in a notation used by comon programming languages. If you have edited a CGI script on a windows computer with e.g. notepad, you will have to convert the linebreaks to unix linebreaks when you upload the file with FTP or SCP to your server.
Share This Page
|
{
"url": "https://www.howtoforge.com/community/threads/premature-end-of-script-headers-what-is-it.1176/",
"source_domain": "www.howtoforge.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "33396",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:E7B7VAC2UHFFSEOANB5XBOYUWMJ7KS6W",
"WARC-Concurrent-To": "<urn:uuid:c8dae7af-9af6-499b-8a60-850e742ffae3>",
"WARC-Date": "2016-10-22T02:06:38Z",
"WARC-IP-Address": "104.25.205.33",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BFIJHSE5QNEMTKKQ6CSL5GW7ISYPPL4Q",
"WARC-Record-ID": "<urn:uuid:eedb620a-5c52-4486-97b2-f017052b8383>",
"WARC-Target-URI": "https://www.howtoforge.com/community/threads/premature-end-of-script-headers-what-is-it.1176/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d799ab80-aa9d-4030-9c0b-eb3a86d6dca0>"
},
"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,
47,
48,
124,
125,
138,
139,
179,
180,
199,
200,
229,
230,
268,
269,
406,
407,
427,
428,
446,
452,
462,
463,
521,
522,
580,
586,
599,
600,
640,
641,
672,
673,
683,
684,
922,
923,
941,
942,
960,
966,
976,
977,
1035,
1036,
1409,
1415,
1416
],
"line_end_idx": [
47,
48,
124,
125,
138,
139,
179,
180,
199,
200,
229,
230,
268,
269,
406,
407,
427,
428,
446,
452,
462,
463,
521,
522,
580,
586,
599,
600,
640,
641,
672,
673,
683,
684,
922,
923,
941,
942,
960,
966,
976,
977,
1035,
1036,
1409,
1415,
1416,
1431
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1431,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36329588294029236,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03745317831635475,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1910112351179123,
"rps_doc_frac_unique_words": 0.5437787771224976,
"rps_doc_mean_word_length": 4.811059951782227,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.547428607940674,
"rps_doc_word_count": 217,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.2662835121154785,
"rps_doc_frac_chars_dupe_6grams": 0.09770114719867706,
"rps_doc_frac_chars_dupe_7grams": 0.09770114719867706,
"rps_doc_frac_chars_dupe_8grams": 0.09770114719867706,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.022988509386777878,
"rps_doc_frac_chars_top_3gram": 0.026819920167326927,
"rps_doc_frac_chars_top_4gram": 0.038314178586006165,
"rps_doc_books_importance": -93.52982330322266,
"rps_doc_books_importance_length_correction": -91.53778076171875,
"rps_doc_openwebtext_importance": -52.26381301879883,
"rps_doc_openwebtext_importance_length_correction": -52.26381301879883,
"rps_doc_wikipedia_importance": -26.73844337463379,
"rps_doc_wikipedia_importance_length_correction": -19.981767654418945
},
"fasttext": {
"dclm": 0.3863314390182495,
"english": 0.8786503076553345,
"fineweb_edu_approx": 1.6316094398498535,
"eai_general_math": 0.18236935138702393,
"eai_open_web_math": 0.7729718685150146,
"eai_web_code": 0.00014389000716619194
}
}
|
{
"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": "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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
287,689,093,300,881,900 |
back to article My name is Dabbsy and I am an EMAILOHOLIC
I think I have 30 email addresses; I’m not sure. I suspect there may be others. I have them on every computer and even carry some around on my smartphone. At the height of my addiction, I was creating domains and distributing email addresses to my wife and my employees. I even gave some to my kids. Clip from the Father Ted TV …
COMMENTS
This topic is closed for new posts.
Page:
Silver badge
Hi Dabbsy ...
My name is Gnomey...I am also an emailcoholic...
Although within the last few years I have had my wife rationalise my Email accounts, she was very good at explaining that I didn't actually need a mail server...and she also pointed out that whilst my hugh.janus email address is amusing it's not professional.
So now I make do with the 3 client email addresses, the 2 company email addresses and admin on 2 shared email accounts, as well as the 4 personal email addresses.
11 isn't that bad is it?
1
0
Silver badge
"Although within the last few years I have had my wife rationalise my Email accounts"
I don't have a wife to rationalise mine (no woman will put up with me for long enough), so I recently did it myself (ooer).
I still have shedloads of addresses in effect (because of the unique address for each site/sign-up/whatever approach), but I've whittled it down to a couple of mailboxes. Day to day, I use just a couple of addresses.
1
0
I am also an emailcoholic...
My personal domain has unlimited addresses so there's the personal one, the one I use for mailing lists, one for shopping, one for work related stuff and another for purely mobile. Even the blooming model railway has its own email addy! Fortunately they're mostly running IMAP and synch ok between laptops, tablet and phone.
Add to that the two main work addresses (personal and generic IT) plus the one that's on an independent non-Exchange domain, and the admin address...
Oh and there's that old address I used to use but don't any more but I have to check it 'cause some people haven't got the message.
0
0
Anonymous Coward
"Synch" would be pronounced like "cinch", and is not thus a phonetically sound abbreviation of "synchronise". "Sync" on the other hand does work phonetically, and that is what you should use.
Off-topic, pedantic and not on completely academically sound footing, I know, but I'm still right.
8
4
Headmaster
quote: ""Synch" would be pronounced like "cinch", and is not thus a phonetically sound abbreviation of "synchronise"."
English apparently has at least 3 sounds for ch, with a voiceless velar stop (k sound) already used in words like choir and cholera. It's entirely legitimate to claim that you assumed everyone would pronounce "synch" with the k sound, rather than say an sh sound as in chef.
As always, I'm sure that this post harping on about language use also contains misuse of language, as per Muphry's law ^^;
6
0
>> English apparently has at least 3 sounds for ch
I tried all three just now and had to clean my screen with a wet wipe.
4
0
Anonymous Coward
Synch
Is pronounced 'sink'
Serious users of the word will say, when the synching (sinking) is completed, that it's 'sunk'
That's AFAIK
1
0
Anonymous Coward
Yup.
Loads of 'em. All over.
My girlfriend knows about 2. And already she thinks I use one of them for illicit purposes.
God knows what she'd do if she found out the extent of it.
Plus there are the additional aliases that most providers let you have.
(I set the maximum 10 so that no one else can has an email address similar to mine.)
Up until now I thought I was the only person who'd done this.
There are people at work who only have their work email address and use this for everything:
Weirdos!
7
0
Kill them with fire
I've just done a purge of old email addresses and centralised everything on one single account, and yet ... I've still got a nagging thought that there's something somewhere poised to send a vitally important mail to one of the old accounts now gathering dust and spam.
1
0
Silver badge
I feel inadequate...
Only 3 email addresses here, and one of them came from CIX rationalising from cix.compulink.co.uk to cix.co.uk
0
0
Hmm let me see... main work address, work support address, generic IT dept address, main home address, GMail address, Hotmail address, address for Reg comments, spam address, address for dodgy websites, gf address for when I'm buying things on her card, address for one of my mates who doesn't have a computer, unused address from mobile phone company.
I can think of 12 atm but there might be more. :o
0
0
Silver badge
Lots and lots of email addresses. 1 work, 1 personal, several for domains associated with various hobbies, and a large batch of individual email addresses for each company I register with, so I can tell if they sell my address to spammers and can then redirect the address to [email protected]
1
0
One per company dealt with
Of those I have 135 (at present), forwarded to my standard email address. Takes 15 seconds to set up a new one. If I get spam on any of the forwarder addresses, I can simply close it down.
0
0
Re: One per company dealt with
Of course, it could be that your remaining 134 addresses are being spoofed to send junk to the rest of us.
2
1
MJI
Silver badge
Lets count
Hmm
1 - Work
2 - One the PC told me to do (MSN via Hotmail)
3 - My Hotmail spam proof email
4 - Abandoned from onetel
5 - Abandoned from ukonline
6 - current BT
7 - Ebay bt
8 - [email protected]
9 - [email protected]
10 - Googlemail
11 - Abandoned from a forum
I use 5 regularly, work, the MSN for webmail, my BT, Ebay BT as they refused my BT, and my .me.uk
0
0
Bronze badge
WTF?
Why does everyone have so many
I have two, my work one and my personal one.
I do have another but its just a forwarder as I am to lazy to manage and maintain my own personal mailserver anymore.
2
1
Re: Why does everyone have so many
Fair question. I receive scores of press releases and beta forum posts every day. It helps to keep them clear of my main email while I'm mobile
2
0
Re: Why does everyone have so many
Same as you: one personal and one work. The work I use for work and the personal one I hardly ever use 'cos I don't like emailing people (or phoning them, or communicating in general).
1
0
Re: Why does everyone have so many
Well, I started with just a Compuserve email account, but that went by the wayside when Compuserve did. Then I went to an actual ISP, and used their assigned email. Decided that I should have a second account from them for activities that seemed likely to generate spam (oddly enough, those two accounts have since swapped places).
Then I got a laptop in addition to my desktop computer, and it became awkward to keep the ISP email accounts in sync. So I opted for a Yahoo email account, followed shortly thereafter by a second, for the same reasons that I have two ISP accounts (also oddly enough, those two accounts have NOT swapped places - say what you like about Yahoo, but their spam filter performs pretty well). Then my employer got all electronified, so I have a work account as well.
Then came the mobile revolution, and I got an email addy from my wireless provider - though I never actually use it for anything; it seems to belong more to my wireless account than to me personally. And of course a gmail account was required, soon to be followed by a second one (see reasons noted above). And now that I've acquired a Windows tablet, I've also acquired an outlook,com address, but so far I've resisted the temptation to actually use that one.
So that's how I wound up with nine more-or-less active email accounts, plus the forlorn ghost of a Compuserve account, condemned to forever wander cyperspace in silence.
0
0
A colleague found it strange when I told him I've got 6....
Turns out that's not many after all :)
Work, hotmail.com (spam bucket, used for free wifi and anything else that asks for an unnecessary email addy), hotmail.co.uk, gmail, yahoo (second spam bucket) and the one my ISP gave me. At some point I've probably used each of them to create an account for something or other, the forgotten password process consists of typing each address in turn until one of them gets recognised...
1
0
Silver badge
Coat
NOBODY needs more than two e-mail addresses
My e-mail address is personal... and... my two e-mail addresses are personal and work... My three addresses are personal, work, and job hunting.... My four... no... amongst my e-mail addresses are personal, work, job hunting, spam... I'll sync them up again...
(Does each identity in the spam address so you can tell who spammed it count as a whole one or a half?)
5
0
Silver badge
Re: NOBODY needs more than two e-mail addresses
Actually it's a great anti-spam system. Every contact I make gets their own email addy. That means if I get spam I know why. I can block just that specific addy and/or notify the 'owner' of what has happened. It all works without any intervention by me (unless I have to black list an addy) because it's based on wildcards.
0
0
I once met a man that had the address:
[email protected] (or possibly [email protected], I can't quite remember).
God knows how early in the life of hotmail he signed up to get that one with no numbers. I had to have numbers after my actual name, and I don't have a very common surname at that. I wonder if it's still in use?
0
0
Silver badge
Feels weird to be the odd one out on the apparently "normal" side of things - I just have whatever the company sets up for me at work (I refuse responsibility for how many aliases and different company domains they set up for me, so I count it as one), a [email protected] one for personal financial and other real-me stuff, and an obscure one I use with any number of "anonymous identities" for absolutely everything else where I need more than a 10 minute throwaway one. Considering the "real" address can be used to recover passwords to pretty much anything I log into with it, I'd obviously rather not use it to log into every darn place I'll visit once-in-a-blue-moon-to-never-again.
0
0
Spam avoidance
I have my own domains and regularly change the "active" email address for each to avoid spam, so in theory I have an infinite number of email addresses. In practice I have 6 web-mail, 3 work(due to mergers), and 4 home addresses that I check at varying intervals. However, soon you will start suffering from withdrawal as not satisfied with the more convenient store&forward method of email, we are all slowly being coaxed to use the far more in-your-face chat and IM methods like Twatter.
Heed my words,.... email is DOOMED! ;-)
0
0
Anonymous Coward
Re: Spam avoidance
You say that email is doomed and we should use Twitter & FB?
What about those of us who have eschewed Twatter and FB?
I know of a good number of people who have closed their social media account because of the spam and abuse and gone back to email.
0
0
Anonymous Coward
What no free ones from mobiles?
Dabbsy,
At the risk of inducing a relapse, are you sure you don't have some email addresses floating around from having registered on a mobile operator's website? I'm sure I've got two or three o2.co.uk addresses where I've joined, left, rejoined them.
0
0
MrT
Silver badge
HAD free O2 ones...
... they all got shut down last November. I tend to stick around until chucked out at the bitter end, which is why my O2 ones were more like trophies. I had a friend running CBL at University of Leeds who kept my staff account from the very early 90's going until the day he retired about 15 years later. I miss that one - sentimental I suppose - but not the O2 ones; they marked the final end of my association with a company I hadn't dealt with since about 2005.
0
0
Silver badge
Meh
Thanks to my disposable email address system I have an infinite number of email addresses. Nearly 30 of them are now blacklisted though.
0
0
Coffee/keyboard
another way to do it
I, like some folks above and probably below, have my own mail server. When I create a throwaway address, its obviously throwaway, for example: [email protected] is just an alias for my real account. Once I've clicked on the confirm link, I delete the alias. It does make it awkward when talking to an actual helpful tech support person and giving them an address that starts with 'throwaway-' or 'garbage-', but somehow, I survive.
0
0
So it's YOU ...
that has been swooping in and taking all the [email protected] box names!
0
0
Silver badge
Pint
Not me, no not me, but a friend has
Had several domain names registered over the years and has (websitetarget)@(domainname).(tld) for a rather long list of websites -- it has been interesting to see his stats on which websites throw your email addy out there for marketing purposes. But he doesn't have a problem. No. Not an issue with :
(last I checked) 700+ email addresses.
and its is friday. Beer.
1
0
One email to bind them all...
I used to use my work email for EVERYTHING but, when they made me redundant (unexpectedly redundant too...) the monumental PIA that was switching everything across to another email address gave me pause for thought. I then bought a domain and run on whichever ISP-given (or other) email account I feel comfortable with pointed to from my shiny domain.
This means I can switch ISPs without a big hassle (just point the domain at the new account). It also means I can use individual usernames for each individual company I deal with and, therefore, know when some scumbag has sold my details on to spam providers. Very satisfying :-) you can not only whine at them for doing such you can also block the emails by forwarding that user to oblivion.
Work email address is now just for work, which is actually a nice separation of work/home. I don't really consider it "mine".
0
0
Alert
Don't leave me hanging
"finding something that supports POP, IMAP, custom Exchange, Google weirdness and the frankly strange iCloud in one program without cocking any of them up is quite a challenge"
So, what did you end up using?
2
0
Re: Don't leave me hanging
+1
(The post is required, and must contain letters.)
0
0
Re: Don't leave me hanging
+10 and a free email address
0
0
Running scared - but not able to hide
I've had a number of email addresses in the past. Most of them I do not use anymore (say, from previous workplaces, probably disabled), but a couple are still functional and even redirected to a catchall address that I do use (they are actually forwarding aliases, not genuine mailboxes that can be independently accessed). I am no longer affiliated with the organizations that provided the aliases. No one emails those addresses. None of my friends or colleagues knows them (or the catchall address to which they are forwarded).
But LinkedIn do. I am not a member of LinkedIn or any other social network. Nevertheless, LinkedIn not only know of my old (think mid-90ies) unused addresses but they are also able to somehow link them to my friends and acquaintances none of whom has ever used them or even knew of them. As a result, an acquaintance logs on to LinkedIn and gets a "suggestion" to connect to me (by name, not by an unfamiliar address). "Hmm, didn't think he was on LinkedIn, but if he is it's weird we are not connected..." is a natural thought, followed by a click on the helpful button. I get an email and see which address LinkedIn sent an email to in the headers. Curse. Shrug. Ignore. Cue multiple annoying "pending invitation" reminders from LinkedIn.
The fact that the bastards are able to figure out a connection between an email alias not used for at least 10 years to friends and acquaintances who are not even aware of that address, combined with the fact that I am completely outside the LinkedIn network and they should not know me at all, is genuinely scary. Yes, also impressive - though they probably just bought some metadata+analytics from Google (or NSA?).
1
0
Anonymous Coward
Re: Running scared - but not able to hide
Who do you think buys up all of the Dell, HP, etc, end-of-lease machines. You typically only have to get a single unscrubbed drive to get a full company directory.
1
0
Re: Running scared - but not able to hide
I don't like LinkedIn's way of amalgamating all of one's email addresses into its account simply because someone tries to add you to their network using the wrong email. I keep my domestic email strictly personal and separate from work, as I do with Facebook. The last thing I need is for my exchanges with my daughter studying in Amsterdam to be interspersed with blathering from irate readers and PRs.
1
0
Bronze badge
Meh
UH-OH... I think I may be one too....
I have a separate email address for every single organization / website/forum that requires an address of me, I must have hundreds by now :(
They all feed into 2 or 3 addresses to rule them all. :(
0
0
QotD
"All important material is directed automatically to a Spam folder where it festers indefinitely." Thank you Mr Dabbs!
Anyway, I have Too Many™, even if you discount the unlimited aliases you get with your own domain name.
0
0
Anonymous Coward
Quality, not Quantity
If you work at a university, the day you get to add the alias "SYSOP" to your account, well, that's the day it doesn't matter how many other email accounts you have, because you are now SYSOP.
But back to the story, I have three main accounts, plus some other cruft at hotmail, gmail, yahoo, Office365, even lycos, as well as my alumni account from university (which is now only used as a "ping" account to make sure email is flowing in and out of my employer's system). I never use the email account my ISP assigned me, it's total crap.
0
0
Re: Quality, not Quantity
"Alumni account"...?! My gods, how many are there of you, man...?! ;oD
I'm assuming only one, in which case, it's 'alumnus' (or if you're female (and I'm 99.9% certain from the way you write, you're not) 'alumna'. Feminine plural..? 'Alumnae').
Ain't Latin a bitch...?!
All together now...
Latin is a language
Dead as dead can be...
5
0
Anonymous Coward
Re: Quality, not Quantity
Romanes eunt domus
0
0
Anonymous Coward
Retirement planning
In the US we have the aptly named CANSPAM act, which immunizes vendors from being guilty of spam if they follow some rules, such as providing an opt-out checkbox and an Unsubscribe option.
I once gave some thought to creating separate email accounts for each business entity. Something like [email protected], [email protected].
The plan:
1. When registering with the unique email address, uncheck the "may we spam you?" option and take a screen snapshot.
2. Wait for the email address to be sold, and/or their own spam to come in.
3. Find a lawyer and negotiate a hefty settlement.
0
0
I'm now stuck with four email addresses in the one permanent workplace - surnameinitial@mainbusiness, firstname.surname@secondarybusiness, firstname@tertiarybusiness and first.surname@parentcompany
Add to that the monstrous number I collected when every ISP close to forced you to use theirs (blocking SMTP to other servers, old ISP restricting SMTP to their network) and I can probably beat 40.
0
0
Pint
eWorld
i still have an eworld invite hanging around......... *looks shifty*
R
0
0
Silver badge
Holmes
You're not really an addict until you have a domain mailbox.
One time I duplicated the addresses for everyone in the company, because of an error in the domain name on the printed brochures. With no time left before the exhibition, the easy solution was to register the new domain name.
0
0
Silver badge
Pint
Do Public Mailboxes/folders count?
Let us see, the insanity has to be near 30
Primary personal
Secondary personal, the one you don’t open at work!
Primary Work
Secondary Work, admin stuff
ISP Provided account
House account, yes one for the house, for mail from the utility companies etc
Throw-a-way account for registering/verifying I’m a person so the web site can send the crap they really need to need to send
Newsletter/forum repository
20+ Public Mailboxes/folders - work related
I’ve always been to lazy to set up my own mail server, but with all the communications being monitored/scanned, maybe a home server may be a project worth looking into.
Have a pint for the weekend!
0
0
I guess I could be the worst of the lot.
Domain names with wildcard redirects. AS MANY EMAIL ADDRESSES AS YOU LIKE. My god, it's like concentrated cocaine.
On the plus side, it's amusing to see people trying to exploit majordomo@, listserve@, root1@, root2@, root3@...
Oh Mr Bayes, how I love you. As much as a man can love another man nonsexually.
0
0
Page:
This topic is closed for new posts.
Forums
|
{
"url": "http://forums.theregister.co.uk/forum/1/2014/01/17/something_for_the_weekend_email_addiction/",
"source_domain": "forums.theregister.co.uk",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "147440",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Q2KXCB24GR3A5FG2TN5RBMP3DVOXM35T",
"WARC-Concurrent-To": "<urn:uuid:b110de04-5831-41c7-abfa-ecbe801e0021>",
"WARC-Date": "2017-01-24T08:02:36Z",
"WARC-IP-Address": "104.20.250.41",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DDX6EN365QCHQNKN4IKLLR2USDMKEE24",
"WARC-Record-ID": "<urn:uuid:531cb858-0f85-47ee-8af7-b906173097db>",
"WARC-Target-URI": "http://forums.theregister.co.uk/forum/1/2014/01/17/something_for_the_weekend_email_addiction/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:46ebb635-2f19-4e14-b141-9c8893ddf2d7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-04\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for January 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
58,
59,
389,
390,
399,
400,
436,
437,
443,
444,
457,
458,
472,
473,
522,
523,
783,
784,
947,
948,
973,
974,
976,
978,
991,
992,
1078,
1079,
1203,
1204,
1421,
1422,
1424,
1426,
1427,
1456,
1457,
1782,
1783,
1933,
1934,
2066,
2067,
2069,
2071,
2088,
2089,
2281,
2282,
2381,
2382,
2384,
2386,
2397,
2398,
2517,
2518,
2793,
2794,
2917,
2918,
2920,
2922,
2923,
2974,
2975,
3046,
3047,
3049,
3051,
3068,
3069,
3075,
3076,
3097,
3098,
3193,
3194,
3207,
3208,
3210,
3212,
3229,
3230,
3235,
3236,
3260,
3261,
3353,
3354,
3413,
3414,
3486,
3487,
3572,
3573,
3635,
3636,
3729,
3730,
3739,
3740,
3742,
3744,
3745,
3765,
3766,
4036,
4037,
4039,
4041,
4054,
4055,
4076,
4077,
4188,
4189,
4191,
4193,
4194,
4547,
4548,
4598,
4599,
4601,
4603,
4616,
4617,
4912,
4913,
4915,
4917,
4918,
4945,
4946,
5135,
5136,
5138,
5140,
5141,
5172,
5173,
5280,
5281,
5283,
5285,
5289,
5302,
5303,
5314,
5315,
5319,
5320,
5329,
5330,
5377,
5378,
5410,
5411,
5437,
5438,
5466,
5467,
5482,
5483,
5495,
5496,
5524,
5525,
5553,
5554,
5570,
5571,
5599,
5600,
5698,
5699,
5701,
5703,
5716,
5721,
5722,
5753,
5754,
5799,
5800,
5918,
5919,
5921,
5923,
5924,
5959,
5960,
6104,
6105,
6107,
6109,
6110,
6145,
6146,
6331,
6332,
6334,
6336,
6337,
6372,
6373,
6705,
6706,
7168,
7169,
7630,
7631,
7801,
7802,
7804,
7806,
7807,
7867,
7868,
7907,
7908,
8295,
8296,
8298,
8300,
8313,
8318,
8319,
8363,
8364,
8625,
8626,
8730,
8731,
8733,
8735,
8748,
8749,
8797,
8798,
9122,
9123,
9125,
9127,
9128,
9167,
9168,
9248,
9249,
9461,
9462,
9464,
9466,
9479,
9480,
10172,
10173,
10175,
10177,
10178,
10193,
10194,
10684,
10685,
10725,
10726,
10728,
10730,
10747,
10748,
10767,
10768,
10829,
10830,
10887,
10888,
11019,
11020,
11022,
11024,
11041,
11042,
11074,
11075,
11083,
11084,
11329,
11330,
11332,
11334,
11338,
11351,
11352,
11372,
11373,
11838,
11839,
11841,
11843,
11856,
11860,
11861,
11998,
11999,
12001,
12003,
12019,
12020,
12041,
12042,
12498,
12499,
12501,
12503,
12504,
12520,
12521,
12599,
12600,
12602,
12604,
12617,
12622,
12623,
12659,
12660,
12962,
12963,
13002,
13003,
13028,
13029,
13031,
13033,
13034,
13064,
13065,
13417,
13418,
13811,
13812,
13938,
13939,
13941,
13943,
13949,
13950,
13973,
13974,
14151,
14152,
14183,
14184,
14186,
14188,
14189,
14216,
14217,
14220,
14221,
14271,
14272,
14274,
14276,
14277,
14304,
14305,
14334,
14335,
14337,
14339,
14340,
14378,
14379,
14909,
14910,
15651,
15652,
16070,
16071,
16073,
16075,
16092,
16093,
16135,
16136,
16300,
16301,
16303,
16305,
16306,
16348,
16349,
16753,
16754,
16756,
16758,
16771,
16775,
16776,
16814,
16815,
16956,
16957,
17014,
17015,
17017,
17019,
17020,
17025,
17026,
17145,
17146,
17250,
17251,
17253,
17255,
17272,
17273,
17295,
17296,
17489,
17490,
17835,
17836,
17838,
17840,
17841,
17867,
17868,
17939,
17940,
18114,
18115,
18140,
18141,
18161,
18162,
18182,
18183,
18206,
18207,
18209,
18211,
18228,
18229,
18255,
18256,
18275,
18276,
18278,
18280,
18297,
18298,
18318,
18319,
18508,
18509,
18654,
18655,
18665,
18666,
18783,
18784,
18860,
18861,
18912,
18913,
18915,
18917,
18918,
19116,
19117,
19315,
19316,
19318,
19320,
19325,
19326,
19333,
19334,
19403,
19404,
19406,
19407,
19409,
19411,
19424,
19431,
19432,
19493,
19494,
19720,
19721,
19723,
19725,
19738,
19743,
19744,
19779,
19780,
19823,
19824,
19841,
19842,
19894,
19895,
19908,
19909,
19937,
19938,
19959,
19960,
20038,
20039,
20165,
20166,
20194,
20195,
20239,
20240,
20409,
20410,
20439,
20440,
20442,
20444,
20445,
20486,
20487,
20602,
20603,
20716,
20717,
20797,
20798,
20800,
20802,
20803,
20809,
20810,
20846,
20847
],
"line_end_idx": [
58,
59,
389,
390,
399,
400,
436,
437,
443,
444,
457,
458,
472,
473,
522,
523,
783,
784,
947,
948,
973,
974,
976,
978,
991,
992,
1078,
1079,
1203,
1204,
1421,
1422,
1424,
1426,
1427,
1456,
1457,
1782,
1783,
1933,
1934,
2066,
2067,
2069,
2071,
2088,
2089,
2281,
2282,
2381,
2382,
2384,
2386,
2397,
2398,
2517,
2518,
2793,
2794,
2917,
2918,
2920,
2922,
2923,
2974,
2975,
3046,
3047,
3049,
3051,
3068,
3069,
3075,
3076,
3097,
3098,
3193,
3194,
3207,
3208,
3210,
3212,
3229,
3230,
3235,
3236,
3260,
3261,
3353,
3354,
3413,
3414,
3486,
3487,
3572,
3573,
3635,
3636,
3729,
3730,
3739,
3740,
3742,
3744,
3745,
3765,
3766,
4036,
4037,
4039,
4041,
4054,
4055,
4076,
4077,
4188,
4189,
4191,
4193,
4194,
4547,
4548,
4598,
4599,
4601,
4603,
4616,
4617,
4912,
4913,
4915,
4917,
4918,
4945,
4946,
5135,
5136,
5138,
5140,
5141,
5172,
5173,
5280,
5281,
5283,
5285,
5289,
5302,
5303,
5314,
5315,
5319,
5320,
5329,
5330,
5377,
5378,
5410,
5411,
5437,
5438,
5466,
5467,
5482,
5483,
5495,
5496,
5524,
5525,
5553,
5554,
5570,
5571,
5599,
5600,
5698,
5699,
5701,
5703,
5716,
5721,
5722,
5753,
5754,
5799,
5800,
5918,
5919,
5921,
5923,
5924,
5959,
5960,
6104,
6105,
6107,
6109,
6110,
6145,
6146,
6331,
6332,
6334,
6336,
6337,
6372,
6373,
6705,
6706,
7168,
7169,
7630,
7631,
7801,
7802,
7804,
7806,
7807,
7867,
7868,
7907,
7908,
8295,
8296,
8298,
8300,
8313,
8318,
8319,
8363,
8364,
8625,
8626,
8730,
8731,
8733,
8735,
8748,
8749,
8797,
8798,
9122,
9123,
9125,
9127,
9128,
9167,
9168,
9248,
9249,
9461,
9462,
9464,
9466,
9479,
9480,
10172,
10173,
10175,
10177,
10178,
10193,
10194,
10684,
10685,
10725,
10726,
10728,
10730,
10747,
10748,
10767,
10768,
10829,
10830,
10887,
10888,
11019,
11020,
11022,
11024,
11041,
11042,
11074,
11075,
11083,
11084,
11329,
11330,
11332,
11334,
11338,
11351,
11352,
11372,
11373,
11838,
11839,
11841,
11843,
11856,
11860,
11861,
11998,
11999,
12001,
12003,
12019,
12020,
12041,
12042,
12498,
12499,
12501,
12503,
12504,
12520,
12521,
12599,
12600,
12602,
12604,
12617,
12622,
12623,
12659,
12660,
12962,
12963,
13002,
13003,
13028,
13029,
13031,
13033,
13034,
13064,
13065,
13417,
13418,
13811,
13812,
13938,
13939,
13941,
13943,
13949,
13950,
13973,
13974,
14151,
14152,
14183,
14184,
14186,
14188,
14189,
14216,
14217,
14220,
14221,
14271,
14272,
14274,
14276,
14277,
14304,
14305,
14334,
14335,
14337,
14339,
14340,
14378,
14379,
14909,
14910,
15651,
15652,
16070,
16071,
16073,
16075,
16092,
16093,
16135,
16136,
16300,
16301,
16303,
16305,
16306,
16348,
16349,
16753,
16754,
16756,
16758,
16771,
16775,
16776,
16814,
16815,
16956,
16957,
17014,
17015,
17017,
17019,
17020,
17025,
17026,
17145,
17146,
17250,
17251,
17253,
17255,
17272,
17273,
17295,
17296,
17489,
17490,
17835,
17836,
17838,
17840,
17841,
17867,
17868,
17939,
17940,
18114,
18115,
18140,
18141,
18161,
18162,
18182,
18183,
18206,
18207,
18209,
18211,
18228,
18229,
18255,
18256,
18275,
18276,
18278,
18280,
18297,
18298,
18318,
18319,
18508,
18509,
18654,
18655,
18665,
18666,
18783,
18784,
18860,
18861,
18912,
18913,
18915,
18917,
18918,
19116,
19117,
19315,
19316,
19318,
19320,
19325,
19326,
19333,
19334,
19403,
19404,
19406,
19407,
19409,
19411,
19424,
19431,
19432,
19493,
19494,
19720,
19721,
19723,
19725,
19738,
19743,
19744,
19779,
19780,
19823,
19824,
19841,
19842,
19894,
19895,
19908,
19909,
19937,
19938,
19959,
19960,
20038,
20039,
20165,
20166,
20194,
20195,
20239,
20240,
20409,
20410,
20439,
20440,
20442,
20444,
20445,
20486,
20487,
20602,
20603,
20716,
20717,
20797,
20798,
20800,
20802,
20803,
20809,
20810,
20846,
20847,
20853
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 20853,
"ccnet_original_nlines": 544,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.424555242061615,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04458599165081978,
"rps_doc_frac_lines_end_with_ellipsis": 0.029357800260186195,
"rps_doc_frac_no_alph_words": 0.19020426273345947,
"rps_doc_frac_unique_words": 0.28914347290992737,
"rps_doc_mean_word_length": 4.381341934204102,
"rps_doc_num_sentences": 229,
"rps_doc_symbol_to_word_ratio": 0.008346149697899818,
"rps_doc_unigram_entropy": 5.92971134185791,
"rps_doc_word_count": 3666,
"rps_doc_frac_chars_dupe_10grams": 0.01930020935833454,
"rps_doc_frac_chars_dupe_5grams": 0.0623210109770298,
"rps_doc_frac_chars_dupe_6grams": 0.058585479855537415,
"rps_doc_frac_chars_dupe_7grams": 0.047565679997205734,
"rps_doc_frac_chars_dupe_8grams": 0.03611006960272789,
"rps_doc_frac_chars_dupe_9grams": 0.024156389757990837,
"rps_doc_frac_chars_top_2gram": 0.0036110100336372852,
"rps_doc_frac_chars_top_3gram": 0.007471050135791302,
"rps_doc_frac_chars_top_4gram": 0.0048561799339950085,
"rps_doc_books_importance": -1710.510986328125,
"rps_doc_books_importance_length_correction": -1710.510986328125,
"rps_doc_openwebtext_importance": -1143.039306640625,
"rps_doc_openwebtext_importance_length_correction": -1143.039306640625,
"rps_doc_wikipedia_importance": -907.0966796875,
"rps_doc_wikipedia_importance_length_correction": -907.0966796875
},
"fasttext": {
"dclm": 0.06593894958496094,
"english": 0.9627179503440857,
"fineweb_edu_approx": 1.0274038314819336,
"eai_general_math": 0.08665156364440918,
"eai_open_web_math": 0.09764158725738525,
"eai_web_code": 0.07786226272583008
}
}
|
{
"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.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,446,004,135,513,082,000 |
181
Possible Duplicate:
Prevent a background process from being stopped after closing SSH client
I have a program that takes a lot of time to finish. It is running as root over ssh.
I want it to continue to run after I logout,is this possible and how would I achieve this?
2
• 1
The nohup(1) idea is better than disown IMHO because disown is a shell-specific built-in of BASH while nohup is part of coreutils and likely to be everywhere. Jun 5 '09 at 6:23
• Use batch, e.g. echo myprogram its arguments | batch Jan 2 '16 at 11:18
374
Assuming that you have a program running in the foreground, press ctrl-Z, then:
[1]+ Stopped myprogram
$ disown -h %1
$ bg 1
[1]+ myprogram &
$ logout
If there is only one job, then you don't need to specify the job number. Just use disown -h and bg.
Explanation of the above steps:
You press ctrl-Z. The system suspends the running program, displays a job number and a "Stopped" message and returns you to a bash prompt.
You type the disown -h %1 command (here, I've used a 1, but you'd use the job number that was displayed in the Stopped message) which marks the job so it ignores the SIGHUP signal (it will not be stopped by logging out).
Next, type the bg command using the same job number; this resumes the running of the program in the background and a message is displayed confirming that.
You can now log out and it will continue running..
11
• 7
Can you explain to me what exactly happens after each step?
– omg
Jun 5 '09 at 7:29
• 14
You press ctrl-Z. The system suspends the running program, displays a job number and a "Stopped" message and returns you to a bash prompt. You type the "disown -h %1" command (here, I've used a "1", but you'd use the job number that was displayed in the "Stopped" message) which marks the job so it ignores the SIGHUP signal (it will not be stopped by logging out). Next, type the "bg" command using the same job number. This resumes the running of the program in the background and a message is displayed confirming that. You can now log out and it will continue running... Jun 5 '09 at 10:23
• 4
...You should be aware that when you use the "bg" command the result is the same as if you'd run your program in the background with an ampersand (&). It won't have any output to stdout so it should be made to write output to a file (nohup will redirect standard output to nohup.out or ~/nohup.out if you don't redirect it yourself). Jun 5 '09 at 10:35
• 13
i test it, and doesn't work.. exit when i'm logout... Jul 6 '11 at 23:08
• 4
@ButtleButkus: You should be able to see them with ps x Oct 17 '12 at 10:43
90
You should try using nohup and running it in the background:
nohup sleep 3600 &
6
• 16
Is there a way to bring this job back to foreground on logging in again?
– Lord Loh.
Mar 12 '12 at 21:10
• Actually it redirects the output to nohup.out file in the same directory by default.
– Gowtham
Dec 28 '15 at 8:52
• 1
@LordLoh. Afaik, the only practical way to do this is to use tmux or screen. Feb 11 '16 at 21:20
• 3
this worked much better, thanks! I just say nohup <my program> and then CTRL-Z + bg Then I can logout. You can validate that it still runs by having another ssh looking at top and see the process keep going
– Hulvej
May 3 '16 at 7:26
• You can also do tail -f nohup.out to see the output in real time, and then kill the PID if you need to restart.
– veggiebenz
Apr 30 '18 at 19:32
43
I would try the program screen.
6
• 2
While screen is a mighty nice tool, nohup is probably better suited for this task. Screen is only needed when you require the program to be interactive, and to be able to go back to the application at a later time. To be entirely honest, I often find myself using screen for the exact same reason as the question above.
– wvdschel
Jun 5 '09 at 5:59
• 4
Even with non-interactive task, it's nice to see that the program finished without errors. It's also good practice to always use screen in case of disconnection.
– bbigras
Jun 5 '09 at 6:45
• 10
alternative to screen would be tmux
– rubo77
Oct 8 '12 at 13:13
• 7
This is the poster child for why link-only answers should never be used.
– mbroshi
Jun 23 '14 at 14:40
• I know this is an old answer, but it has been flagged as a link-only answer and in fact the link is dead. Would it be possible to expand it out to show a brief example of how to use screen, perhaps from the originally linked example (still available at web.archive.org/web/20090106170543/http://www.rackaid.com/…)?
– josliber
Dec 21 '15 at 5:16
15
Start in the background:
./long_running_process options &
And disown the job before you log out:
disown
6
• but the programme has already started to run..
– omg
Jun 5 '09 at 5:21
• And will it contine to run as root?
– omg
Jun 5 '09 at 5:35
• 1
If the program is already running on the console and you can access the console it's running on hit "Ctrl+Z" to send it in the background and then disown the newly created job. As long as a process is started as root it will continue to run as root unless it drops privileges itself.
– diciu
Jun 5 '09 at 5:49
• But the command is named 'disown',isn't that to say root will disown the program,and the program will not continue to run as root ?
– omg
Jun 5 '09 at 5:51
• 2
"disown" is just for abandoning control of a job it does not change the privileges of the process.
– diciu
Jun 5 '09 at 5:52
13
You want nohup. See http://nixcraft.com/linux-software/313-ssh-nohup-connection.html
1
3
You could use screen, detach and reattach
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://stackoverflow.com/questions/954302/how-to-make-a-program-continue-to-run-after-log-out-from-ssh",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "196534",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ECOAS2EVRD57JMPB67BW55R6O3GGURPB",
"WARC-Concurrent-To": "<urn:uuid:bf18097a-79b5-45ee-8b8d-81c11d13dcd7>",
"WARC-Date": "2022-01-28T05:21:56Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ODGHIVQQ3ZNRKTHRU5FF53P5VRSQBL3J",
"WARC-Record-ID": "<urn:uuid:4710e54e-6034-42e9-91fb-d7feccf42027>",
"WARC-Target-URI": "https://stackoverflow.com/questions/954302/how-to-make-a-program-continue-to-run-after-log-out-from-ssh",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f49f9bf1-dbf9-414c-953b-028105a509ad>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-78\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
4,
5,
25,
98,
99,
184,
275,
276,
278,
284,
465,
541,
545,
546,
626,
627,
667,
682,
689,
706,
715,
716,
816,
817,
849,
850,
989,
990,
1211,
1212,
1367,
1368,
1419,
1420,
1423,
1429,
1493,
1503,
1525,
1532,
2130,
2136,
2493,
2500,
2577,
2583,
2663,
2666,
2667,
2728,
2729,
2748,
2750,
2757,
2834,
2850,
2874,
2963,
2977,
3000,
3006,
3107,
3113,
3324,
3337,
3359,
3475,
3492,
3516,
3519,
3520,
3552,
3553,
3555,
3561,
3885,
3900,
3922,
3928,
4094,
4108,
4130,
4137,
4177,
4190,
4213,
4219,
4296,
4310,
4334,
4653,
4668,
4691,
4694,
4695,
4720,
4721,
4754,
4755,
4794,
4795,
4802,
4804,
4855,
4865,
4887,
4927,
4937,
4959,
4965,
5253,
5265,
5287,
5423,
5433,
5455,
5461,
5564,
5576,
5598,
5601,
5602,
5687,
5688,
5690,
5692,
5693,
5735,
5736
],
"line_end_idx": [
4,
5,
25,
98,
99,
184,
275,
276,
278,
284,
465,
541,
545,
546,
626,
627,
667,
682,
689,
706,
715,
716,
816,
817,
849,
850,
989,
990,
1211,
1212,
1367,
1368,
1419,
1420,
1423,
1429,
1493,
1503,
1525,
1532,
2130,
2136,
2493,
2500,
2577,
2583,
2663,
2666,
2667,
2728,
2729,
2748,
2750,
2757,
2834,
2850,
2874,
2963,
2977,
3000,
3006,
3107,
3113,
3324,
3337,
3359,
3475,
3492,
3516,
3519,
3520,
3552,
3553,
3555,
3561,
3885,
3900,
3922,
3928,
4094,
4108,
4130,
4137,
4177,
4190,
4213,
4219,
4296,
4310,
4334,
4653,
4668,
4691,
4694,
4695,
4720,
4721,
4754,
4755,
4794,
4795,
4802,
4804,
4855,
4865,
4887,
4927,
4937,
4959,
4965,
5253,
5265,
5287,
5423,
5433,
5455,
5461,
5564,
5576,
5598,
5601,
5602,
5687,
5688,
5690,
5692,
5693,
5735,
5736,
5826
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5826,
"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.3838827908039093,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0168498195707798,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2886447012424469,
"rps_doc_frac_unique_words": 0.3405456244945526,
"rps_doc_mean_word_length": 3.9802446365356445,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0.002930399961769581,
"rps_doc_unigram_entropy": 5.203125953674316,
"rps_doc_word_count": 1063,
"rps_doc_frac_chars_dupe_10grams": 0.21886079013347626,
"rps_doc_frac_chars_dupe_5grams": 0.23753249645233154,
"rps_doc_frac_chars_dupe_6grams": 0.2311510294675827,
"rps_doc_frac_chars_dupe_7grams": 0.21886079013347626,
"rps_doc_frac_chars_dupe_8grams": 0.21886079013347626,
"rps_doc_frac_chars_dupe_9grams": 0.21886079013347626,
"rps_doc_frac_chars_top_2gram": 0.010399430058896542,
"rps_doc_frac_chars_top_3gram": 0.015599150210618973,
"rps_doc_frac_chars_top_4gram": 0.02079886943101883,
"rps_doc_books_importance": -610.7167358398438,
"rps_doc_books_importance_length_correction": -610.7167358398438,
"rps_doc_openwebtext_importance": -342.5776062011719,
"rps_doc_openwebtext_importance_length_correction": -342.5776062011719,
"rps_doc_wikipedia_importance": -194.29176330566406,
"rps_doc_wikipedia_importance_length_correction": -194.29176330566406
},
"fasttext": {
"dclm": 0.05600440874695778,
"english": 0.906463623046875,
"fineweb_edu_approx": 1.3779443502426147,
"eai_general_math": 0.8394038081169128,
"eai_open_web_math": 0.19228291511535645,
"eai_web_code": 0.28625285625457764
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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,356,150,321,085,271,000 |
18 Jan 2014.
This is my writeup of how system calls work at the assembler level. This article specifically deals with syscalls on Linux on x86_64, but some of the material is more widely applicable.
I apologize for the AT&T assembler syntax, but all the GNU tools default to it. I figured insisting on Intel syntax everywhere would have made the writeup more confusing.
Hello World
Here's a simple "hello world" program:
#include <unistd.h>
int main() {
const char msg[] = "Hello world!\n";
write(STDOUT_FILENO, msg, sizeof(msg) - 1);
return 0;
}
(source code: hello1.c)
Note that sizeof(msg) would return fourteen because the size of the string includes its NUL terminator.
The code above builds and runs as you'd expect:
$ gcc hello1.c
$ ./a.out
Hello world!
$
But how is write() actually implemented?
Like most syscalls, there isn't a write.c in glibc that implements it. Instead, the code is mechanically generated at build time:
$ cd glibc-build-dir
$ make
[...]
(echo '#define SYSCALL_NAME write'; \
echo '#define SYSCALL_NARGS 3'; \
echo '#define SYSCALL_SYMBOL __libc_write'; \
echo '#define SYSCALL_CANCELLABLE 1'; \
echo '#include <syscall-template.S>'; \
echo 'weak_alias (__libc_write, __write)'; \
echo 'libc_hidden_weak (__write)'; \
echo 'weak_alias (__libc_write, write)'; \
echo 'libc_hidden_weak (write)'; \
) | gcc [lots of args elided...]
It's interesting to read through syscall-template.S and its dependencies, but it's much quicker to just look at the disassembly of the resulting object file:
$ objdump -d io/write.o
[...]
0000000000000009 <__write_nocancel>:
9: b8 01 00 00 00 mov $0x1,%eax
e: 0f 05 syscall
10: 48 3d 01 f0 ff ff cmp $0xfffffffffffff001,%rax
16: 0f 83 00 00 00 00 jae 1c <__write_nocancel+0x13>
1c: c3 retq
Let's ignore the nocancel and error handling bits for now, and implement our own write() like this:
ssize_t my_write(int fd, const void *buf, size_t count) {
asm (
"movl $1, %%eax\n\t"
"syscall"
::: "eax" /* tell GCC the above clobbers the eax register */
);
}
(source code: hello2.c)
And it works!
The reason it works, in two parts: First, when main() calls my_write(), it uses the x86_64 function call convention where the first six arguments are passed in registers rdi, rsi, rdx, rcx, r8, r9.
Second, when my_write() issues the syscall instruction, the kernel is expecting the syscall number in rax, and six arguments in the registers rdi, rsi, rdx, r10, r8, r9.
So all three of the arguments to the write syscall are already in the correct registers, we just have to set rax.
Some asides:
b8 01 00 00 00 mov $0x1,%eax
48 c7 c0 01 00 00 00 mov $0x1,%rax
Here's what main() looks like:
main:
.LFB1:
.cfi_startproc
pushq %rbp
.cfi_def_cfa_offset 16
.cfi_offset 6, -16
movq %rsp, %rbp
.cfi_def_cfa_register 6
movl $13, %edx # <--
movl $msg, %esi # <--
movl $1, %edi # <--
call my_write # <--
movl $0, %eax
popq %rbp
.cfi_def_cfa 7, 8
ret
.cfi_endproc
The optimizer
If we turn on optimization, our code no longer works, because my_write() gets inlined into main() and instead of the above, we get:
main:
.LFB1:
.cfi_startproc
#APP
# 4 "hello2.c" 1
movl $1, %eax
syscall
# 0 "" 2
#NO_APP
movl $0, %eax
ret
.cfi_endproc
The optimizer has helpfully optimized out all the register shuffling between the two functions it merged, so our syscall no longer gets any args!
The way to fix this is to explicitly tell GCC what value needs to be in which register, instead of relying on the machine's function call convention. We do this by specifying "constraints" on our inline assembler block:
ssize_t my_write(int fd, const void *buf, size_t count) {
int64_t result;
asm volatile (
"syscall"
: /* outputs */
"=a" (result)
: /* inputs */
"a" (__NR_write), // rax = syscall number
"D" (fd), // rdi = arg1
"S" (buf), // rsi = arg2
"d" (count) // rdx = arg3
: /* clobbers */
"cc",
"r11",
"rcx"
);
return 0;
}
(source code: hello3.c)
Now our code works again, and survives inlining and optimization!
Some things to note:
Our optimized main() looks very clean now:
main:
.LFB1:
.cfi_startproc
movl $1, %edi
movl $13, %edx
movl $msg, %esi
movl %edi, %eax
#APP
# 7 "hello3.c" 1
syscall
# 0 "" 2
#NO_APP
xorl %eax, %eax
ret
And everything except the syscall instruction is coming from GCC's code generator instead of our inline assembler.
errno
We can use our output constraint above to correctly set errno after the write() syscall:
ssize_t my_write(int fd, const void *buf, size_t count) {
int64_t result;
asm (
"syscall"
: /* outputs */
"=a" (result)
: /* inputs */
"a" (__NR_write), // rax = syscall number
"D" (fd), // rdi = arg1
"S" (buf), // rsi = arg2
"d" (count) // rdx = arg3
: /* clobbers */
"cc",
"r11",
"rcx"
);
if (result >= -4095 && result <= -1) {
errno = -result;
return -1;
} else {
return result;
}
}
(source code: hello4.c)
putchar
Let's implement putchar() and make it take an int instead of a char argument like the C89 standard says:
void my_putchar(int c) {
char ch = c;
my_write(STDOUT_FILENO, &ch, 1);
}
static const char msg1[] = "This is ";
static const char msg2[] = "broken.\n";
int main() {
write(STDOUT_FILENO, msg1, sizeof(msg1) - 1);
my_putchar('n');
my_putchar('o');
my_putchar('t');
my_putchar(' ');
write(STDOUT_FILENO, msg2, sizeof(msg2) - 1);
return 0;
}
(source code: putchar1.c)
You can tell what the punch-line is going to be:
$ gcc -O2 putchar1.c
$ ./a.out
This is broken.
$
So what does the generated code look like?
my_putchar:
.LFB1:
.cfi_startproc
leaq -1(%rsp), %rsi
movl $1, %edi
movl $1, %edx
movl %edi, %eax
#APP
# 7 "putchar1.c" 1
syscall
# 0 "" 2
#NO_APP
ret
As always, the write is inlined. my_putchar is passed a single argument in rdi and clobbers it. The buffer it passes to the write syscall is the next byte on the stack, but it doesn't set it to anything.
There's a subtle change we need to make to the input constraints for write:
--- putchar1.c 2014-01-19 00:19:23.213002952 +1100
+++ putchar2.c 2014-01-19 00:24:25.697744948 +1100
@@ -12,6 +12,7 @@
"a" (__NR_write), // rax = syscall number
"D" (fd), // rdi = arg1
"S" (buf), // rsi = arg2
+ "m" (buf), // buf has to be a memory location
"d" (count) // rdx = arg3
: /* clobbers */
"cc",
(source code: putchar2.c)
This gives us a working putchar:
my_putchar:
.LFB1:
.cfi_startproc
pushq %rbp
.cfi_def_cfa_offset 16
.cfi_offset 6, -16
movl $1, %eax
movl $1, %edx
movq %rsp, %rbp
.cfi_def_cfa_register 6
andq $-32, %rsp
addq $16, %rsp
leaq -80(%rsp), %rsi # rsi = pointer to variable on stack
movb %dil, -80(%rsp) # write %dil (DL in Intel) to that location
movq %rsi, -48(%rsp)
movl %eax, %edi
#APP
# 7 "putchar2.c" 1
syscall
# 0 "" 2
#NO_APP
leave
.cfi_def_cfa 7, 8
ret
|
{
"url": "https://unix4lyfe.org/syscalls/",
"source_domain": "unix4lyfe.org",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "14807",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DSN6PJT5KF6NRC5P32EU7YG3QP2HXT3U",
"WARC-Concurrent-To": "<urn:uuid:4c48132c-8ec1-4e4f-9b5a-7696c3d70675>",
"WARC-Date": "2017-05-28T00:55:25Z",
"WARC-IP-Address": "71.19.155.121",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5CV5QHQ3KWFTN5YW4HYEME4YQ72ZBAFK",
"WARC-Record-ID": "<urn:uuid:44d65c4c-eb20-446f-b142-f0adb6a80775>",
"WARC-Target-URI": "https://unix4lyfe.org/syscalls/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0ca1eb5c-b631-427d-b07f-ad8ac279eea7>"
},
"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,
13,
14,
200,
201,
372,
373,
385,
386,
425,
426,
446,
447,
460,
499,
545,
557,
559,
560,
584,
585,
689,
690,
738,
739,
754,
764,
777,
779,
780,
821,
822,
952,
953,
974,
981,
987,
1025,
1062,
1111,
1154,
1197,
1245,
1285,
1331,
1369,
1404,
1405,
1563,
1564,
1588,
1594,
1631,
1676,
1712,
1772,
1834,
1867,
1868,
1968,
1969,
2027,
2035,
2062,
2078,
2145,
2154,
2156,
2157,
2181,
2182,
2196,
2197,
2395,
2396,
2566,
2567,
2681,
2682,
2695,
2696,
2735,
2774,
2775,
2806,
2807,
2813,
2820,
2837,
2850,
2875,
2896,
2915,
2941,
2973,
3005,
3037,
3069,
3086,
3099,
3119,
3125,
3140,
3141,
3155,
3156,
3288,
3289,
3295,
3302,
3319,
3324,
3341,
3357,
3367,
3376,
3384,
3401,
3407,
3422,
3423,
3569,
3570,
3790,
3791,
3849,
3867,
3884,
3900,
3922,
3944,
3965,
4015,
4055,
4095,
4135,
4158,
4172,
4187,
4201,
4210,
4222,
4224,
4225,
4249,
4250,
4316,
4317,
4338,
4339,
4382,
4383,
4389,
4396,
4413,
4430,
4448,
4467,
4486,
4491,
4508,
4518,
4527,
4535,
4554,
4560,
4561,
4676,
4677,
4683,
4684,
4773,
4774,
4832,
4850,
4858,
4874,
4896,
4918,
4939,
4989,
5029,
5069,
5109,
5132,
5146,
5161,
5175,
5184,
5225,
5246,
5261,
5272,
5291,
5295,
5297,
5298,
5322,
5323,
5331,
5332,
5437,
5438,
5463,
5478,
5513,
5515,
5516,
5555,
5595,
5596,
5609,
5657,
5676,
5695,
5714,
5733,
5781,
5793,
5795,
5796,
5822,
5823,
5872,
5873,
5894,
5904,
5920,
5922,
5923,
5966,
5967,
5979,
5986,
6009,
6040,
6065,
6090,
6117,
6122,
6141,
6157,
6166,
6174,
6186,
6187,
6391,
6392,
6468,
6469,
6521,
6573,
6591,
6642,
6683,
6724,
6786,
6827,
6851,
6866,
6867,
6893,
6894,
6927,
6928,
6940,
6947,
6970,
6991,
7022,
7049,
7074,
7099,
7126,
7158,
7185,
7211,
7281,
7358,
7390,
7417,
7422,
7441,
7457,
7466,
7474,
7488,
7514
],
"line_end_idx": [
13,
14,
200,
201,
372,
373,
385,
386,
425,
426,
446,
447,
460,
499,
545,
557,
559,
560,
584,
585,
689,
690,
738,
739,
754,
764,
777,
779,
780,
821,
822,
952,
953,
974,
981,
987,
1025,
1062,
1111,
1154,
1197,
1245,
1285,
1331,
1369,
1404,
1405,
1563,
1564,
1588,
1594,
1631,
1676,
1712,
1772,
1834,
1867,
1868,
1968,
1969,
2027,
2035,
2062,
2078,
2145,
2154,
2156,
2157,
2181,
2182,
2196,
2197,
2395,
2396,
2566,
2567,
2681,
2682,
2695,
2696,
2735,
2774,
2775,
2806,
2807,
2813,
2820,
2837,
2850,
2875,
2896,
2915,
2941,
2973,
3005,
3037,
3069,
3086,
3099,
3119,
3125,
3140,
3141,
3155,
3156,
3288,
3289,
3295,
3302,
3319,
3324,
3341,
3357,
3367,
3376,
3384,
3401,
3407,
3422,
3423,
3569,
3570,
3790,
3791,
3849,
3867,
3884,
3900,
3922,
3944,
3965,
4015,
4055,
4095,
4135,
4158,
4172,
4187,
4201,
4210,
4222,
4224,
4225,
4249,
4250,
4316,
4317,
4338,
4339,
4382,
4383,
4389,
4396,
4413,
4430,
4448,
4467,
4486,
4491,
4508,
4518,
4527,
4535,
4554,
4560,
4561,
4676,
4677,
4683,
4684,
4773,
4774,
4832,
4850,
4858,
4874,
4896,
4918,
4939,
4989,
5029,
5069,
5109,
5132,
5146,
5161,
5175,
5184,
5225,
5246,
5261,
5272,
5291,
5295,
5297,
5298,
5322,
5323,
5331,
5332,
5437,
5438,
5463,
5478,
5513,
5515,
5516,
5555,
5595,
5596,
5609,
5657,
5676,
5695,
5714,
5733,
5781,
5793,
5795,
5796,
5822,
5823,
5872,
5873,
5894,
5904,
5920,
5922,
5923,
5966,
5967,
5979,
5986,
6009,
6040,
6065,
6090,
6117,
6122,
6141,
6157,
6166,
6174,
6186,
6187,
6391,
6392,
6468,
6469,
6521,
6573,
6591,
6642,
6683,
6724,
6786,
6827,
6851,
6866,
6867,
6893,
6894,
6927,
6928,
6940,
6947,
6970,
6991,
7022,
7049,
7074,
7099,
7126,
7158,
7185,
7211,
7281,
7358,
7390,
7417,
7422,
7441,
7457,
7466,
7474,
7488,
7514,
7525
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7525,
"ccnet_original_nlines": 287,
"rps_doc_curly_bracket": 0.0021262499503791332,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18271462619304657,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023781899362802505,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4373549818992615,
"rps_doc_frac_unique_words": 0.3959799110889435,
"rps_doc_mean_word_length": 4.606029987335205,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0.01798143982887268,
"rps_doc_unigram_entropy": 5.5229082107543945,
"rps_doc_word_count": 995,
"rps_doc_frac_chars_dupe_10grams": 0.07789657264947891,
"rps_doc_frac_chars_dupe_5grams": 0.1924503594636917,
"rps_doc_frac_chars_dupe_6grams": 0.15492035448551178,
"rps_doc_frac_chars_dupe_7grams": 0.14990180730819702,
"rps_doc_frac_chars_dupe_8grams": 0.10975343734025955,
"rps_doc_frac_chars_dupe_9grams": 0.1010255292057991,
"rps_doc_frac_chars_top_2gram": 0.007855120114982128,
"rps_doc_frac_chars_top_3gram": 0.006545930169522762,
"rps_doc_frac_chars_top_4gram": 0.012219070456922054,
"rps_doc_books_importance": -732.7494506835938,
"rps_doc_books_importance_length_correction": -732.7494506835938,
"rps_doc_openwebtext_importance": -387.2051086425781,
"rps_doc_openwebtext_importance_length_correction": -387.2051086425781,
"rps_doc_wikipedia_importance": -204.49072265625,
"rps_doc_wikipedia_importance_length_correction": -204.49072265625
},
"fasttext": {
"dclm": 0.8297997117042542,
"english": 0.726094663143158,
"fineweb_edu_approx": 2.758998394012451,
"eai_general_math": 0.7009937763214111,
"eai_open_web_math": 0.2628825902938843,
"eai_web_code": 0.9717531800270081
}
}
|
{
"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.27",
"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": "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": "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,282,470,260,638,098,200 |
Programming Sound Triggers
Capture_03
Again with the sound I over-reached for my skill level. I again thought the audio would just be a matter of drag and drop – but it wasn’t at all. How the basic audio works is the character has an audio listener and you can place audio source into the scene as an invisible object. Unfortunately this plays the sound at the same volume no matter where you are in the scene from start to finish. This just wouldn’t work for triggering audio and placing multiple audio sources throughout the scene.
I ended up creating three C# Scripts:
(With help from outside source examples)
• Audio that plays once when walk into
• Audio that plays continuously once approached
• Audio that plays only in a specific area.
The code connects the sound sources to the trigger collides in the scene so that when the character approaches the trigger the audio plays.
In future I would try and find a way to make the sound blend smoother and feather as you walk through the collider – I think it may just be a matter of changing the shape of the collider, but I could be wrong.
|
{
"url": "https://krystalgamedev.wordpress.com/2015/11/03/",
"source_domain": "krystalgamedev.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "47744",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TDGDN7Q4DYWOWRITLSCGDLT2QVRBACWC",
"WARC-Concurrent-To": "<urn:uuid:6f368abd-2fff-4db2-b514-34e458799dca>",
"WARC-Date": "2019-12-05T22:09:48Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K4YV4SLSCY4TDPAG7AB4IFEF47WSZKDG",
"WARC-Record-ID": "<urn:uuid:941a5623-2613-460f-976b-e413c5ab4bce>",
"WARC-Target-URI": "https://krystalgamedev.wordpress.com/2015/11/03/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:689ff6eb-a4d0-44ea-8469-35102baab4eb>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-207.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
27,
28,
39,
40,
536,
537,
575,
576,
617,
618,
659,
709,
755,
756,
896,
897
],
"line_end_idx": [
27,
28,
39,
40,
536,
537,
575,
576,
617,
618,
659,
709,
755,
756,
896,
897,
1106
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1106,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.456620991230011,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031963471323251724,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09589041024446487,
"rps_doc_frac_unique_words": 0.5400000214576721,
"rps_doc_mean_word_length": 4.394999980926514,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0.004566209856420755,
"rps_doc_unigram_entropy": 4.337335586547852,
"rps_doc_word_count": 200,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03412969037890434,
"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.03640500828623772,
"rps_doc_frac_chars_top_3gram": 0.03412969037890434,
"rps_doc_frac_chars_top_4gram": 0.05119454115629196,
"rps_doc_books_importance": -98.73844909667969,
"rps_doc_books_importance_length_correction": -98.73844909667969,
"rps_doc_openwebtext_importance": -45.54512405395508,
"rps_doc_openwebtext_importance_length_correction": -37.32880401611328,
"rps_doc_wikipedia_importance": -45.215904235839844,
"rps_doc_wikipedia_importance_length_correction": -45.215904235839844
},
"fasttext": {
"dclm": 0.13001585006713867,
"english": 0.9513802528381348,
"fineweb_edu_approx": 1.4235031604766846,
"eai_general_math": 0.1908320188522339,
"eai_open_web_math": 0.0741877630352974,
"eai_web_code": 0.06312566995620728
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,917,620,163,545,120,300 |
Description
In thread dump analysis, one of the key parameter to watch out is: Thread Count. You need to know the application’s thread count consumption under the normal scenario. This understanding will help you in following scenarios:
1. To gauge severity of the issue:
When application experiences any problem, thread count will help to gauge the severity of the issue. Suppose your application uses 100 threads in normal scenario. Suddenly if you see thread count to shoot up to 500 or 600 threads, then it’s a clear indication that your application is suffering from thread leaks or some other problem.
2. New release to production:
When you make new release to production, it’s always a best practice to compare the thread count & their states with the previously running release in production environment. This comparison is one of the measurements for the healthiness of the new install.
3. Diagnosis:
When you want to diagnose any performance problems, thread count, their states and stack traces are important metrics to be looked.
Tit-bit 1: If application creates too many threads then it can result in “java.lang.OutOfMemoryError: Unable to create new native thread”.
Tit-bit 2: Threads do not occupy memory space with in JVM heap. They occupy memory space outside the JVM Heap. This is one of the reason why typically Java process takes more than -Xmx value.
Why named as Stock Ticker?
Stock ticker is an excellent indicator that goes up or down based on the entity’s performance, market response, .. Similarly thread count is a good indicator for the health of the JVM. The only caveat is: when stock ticker increases rapidly to any amount, investors are happy. On the other side, if thread count increases rapidly, it won’t make performance engineer that much happy 🙂
|
{
"url": "https://blog.fastthread.io/2016/01/18/thread-dump-analysis-pattern-stock-ticker/",
"source_domain": "blog.fastthread.io",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "69654",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3WOHVWCDBMHKRXALY5GSJDLWB7YHPKDS",
"WARC-Concurrent-To": "<urn:uuid:bf29acbb-fa17-4b02-a200-8fa13974fcb5>",
"WARC-Date": "2019-11-12T10:19:58Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:U5PY6R5AWRTLAK5URQK3F3DKFNPCFDE4",
"WARC-Record-ID": "<urn:uuid:eed82546-4926-442a-b392-b1b84711989f>",
"WARC-Target-URI": "https://blog.fastthread.io/2016/01/18/thread-dump-analysis-pattern-stock-ticker/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e1c81f95-ab0b-4a03-b3cb-fb69023e4fd2>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-221.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
13,
238,
239,
274,
275,
611,
612,
642,
643,
901,
902,
916,
917,
1049,
1050,
1189,
1190,
1382,
1383,
1410,
1411
],
"line_end_idx": [
12,
13,
238,
239,
274,
275,
611,
612,
642,
643,
901,
902,
916,
917,
1049,
1050,
1189,
1190,
1382,
1383,
1410,
1411,
1794
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1794,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3767705261707306,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008498580195009708,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16997167468070984,
"rps_doc_frac_unique_words": 0.532423198223114,
"rps_doc_mean_word_length": 4.924914836883545,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.718236923217773,
"rps_doc_word_count": 293,
"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.060984060168266296,
"rps_doc_frac_chars_top_3gram": 0.016632020473480225,
"rps_doc_frac_chars_top_4gram": 0.02494801953434944,
"rps_doc_books_importance": -174.49197387695312,
"rps_doc_books_importance_length_correction": -169.270751953125,
"rps_doc_openwebtext_importance": -98.92436981201172,
"rps_doc_openwebtext_importance_length_correction": -98.92436981201172,
"rps_doc_wikipedia_importance": -54.539207458496094,
"rps_doc_wikipedia_importance_length_correction": -53.998661041259766
},
"fasttext": {
"dclm": 0.21524828672409058,
"english": 0.8856955766677856,
"fineweb_edu_approx": 1.6062935590744019,
"eai_general_math": 0.16065376996994019,
"eai_open_web_math": 0.15915918350219727,
"eai_web_code": 0.1258537769317627
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,158,782,833,193,092,000 |
Skip to content
On this page
Keywords Extractor
This tool will extract and list your keywords from a block of text.
What is Keywords Extractor?
A tool called AI Keywords Extractor makes use of AI to pull out crucial words and phrases from a supplied text. It can be used for content optimization, SEO, and sentiment analysis of documents, publications, and social media posts. It can be useful for companies and organizations attempting to improve their SEO and attract a wider audience because it can identify the primary subjects and themes in a text as well as pertinent keywords to a given issue.
How to use Marmof's Keywords Extractor?
STEP 1 - Go to the Marmof dashboard and select the “Keywords Extractor” use case.
STEP 2 - Enter the content you want to extract keywords from and then click the "Generate" button.
STEP 3 - The tool will generate a list of keywords for you.
STEP 4 - Click the "Copy" or "Bookmark" button to save the keywords for later use.
An image
Here are some examples:
Example 1
⌨️ INPUT
Content: AI Keywords Extractor is a tool that uses AI to extract important keywords and phrases from a given text. It can be used to analyze documents, articles, and social media posts for content optimization, SEO, and sentiment analysis. It can help identify the main topics and themes in a text, as well as relevant keywords to a specific topic, which can be beneficial to businesses and organizations trying to optimize their SEO and reach a larger audience.
✅ Output 1
Keywords: AI, Keywords Extractor, content optimization, SEO, sentiment analysis, topics, themes, relevant keywords, businesses, organizations.
✅ Output 2
Keywords: AI, Keywords Extractor, content optimization, SEO, sentiment analysis, topics, themes, keywords.
✅ Output 3
Keywords: AI, Keywords Extractor, content optimization, SEO, sentiment analysis, topics, themes, keywords.
Example 2
⌨️ INPUT
Content: Make writing easier and faster with Marmof! Our AI-powered writing tool helps you create content in just a few seconds. With Marmof, you can get more done in less time and focus on the things that matter. Try it out now!
✅ Output 1
Keywords: writing, Marmof, AI-powered, content, seconds, less time, focus
✅ Output 2
Keywords: Writing, Marmof, AI-powered, Content, Seconds, Time, Focus.
|
{
"url": "https://docs.marmof.com/keywords-extractor.html",
"source_domain": "docs.marmof.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "25727",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D35HO5AQUQCYQD52KSY5STFKDPZTGBJK",
"WARC-Concurrent-To": "<urn:uuid:fbc3574f-90bb-417c-b353-965cdde2182e>",
"WARC-Date": "2024-06-16T14:54:42Z",
"WARC-IP-Address": "76.76.21.21",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UUYWGOHEDQG4BG576SBVLXJ3VF6NYXDT",
"WARC-Record-ID": "<urn:uuid:fdaedcb0-e050-4e2f-a57d-80bf07a2c632>",
"WARC-Target-URI": "https://docs.marmof.com/keywords-extractor.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:741af1a6-2b10-4331-90f3-98cda7839b90>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-116\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,
16,
29,
30,
49,
50,
118,
119,
147,
148,
605,
606,
646,
647,
729,
730,
829,
830,
890,
891,
974,
975,
984,
985,
1009,
1010,
1020,
1021,
1030,
1031,
1494,
1495,
1506,
1507,
1650,
1651,
1662,
1663,
1770,
1771,
1782,
1783,
1890,
1891,
1901,
1902,
1911,
1912,
2142,
2143,
2154,
2155,
2229,
2230,
2241,
2242
],
"line_end_idx": [
16,
29,
30,
49,
50,
118,
119,
147,
148,
605,
606,
646,
647,
729,
730,
829,
830,
890,
891,
974,
975,
984,
985,
1009,
1010,
1020,
1021,
1030,
1031,
1494,
1495,
1506,
1507,
1650,
1651,
1662,
1663,
1770,
1771,
1782,
1783,
1890,
1891,
1901,
1902,
1911,
1912,
2142,
2143,
2154,
2155,
2229,
2230,
2241,
2242,
2311
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2311,
"ccnet_original_nlines": 55,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2869378924369812,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.051391858607530594,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2334047108888626,
"rps_doc_frac_unique_words": 0.3844085931777954,
"rps_doc_mean_word_length": 4.892473220825195,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.534334182739258,
"rps_doc_word_count": 372,
"rps_doc_frac_chars_dupe_10grams": 0.13736264407634735,
"rps_doc_frac_chars_dupe_5grams": 0.27802199125289917,
"rps_doc_frac_chars_dupe_6grams": 0.26153844594955444,
"rps_doc_frac_chars_dupe_7grams": 0.2131868153810501,
"rps_doc_frac_chars_dupe_8grams": 0.1637362539768219,
"rps_doc_frac_chars_dupe_9grams": 0.13736264407634735,
"rps_doc_frac_chars_top_2gram": 0.07472527027130127,
"rps_doc_frac_chars_top_3gram": 0.05219779908657074,
"rps_doc_frac_chars_top_4gram": 0.044505491852760315,
"rps_doc_books_importance": -220.1577911376953,
"rps_doc_books_importance_length_correction": -220.1577911376953,
"rps_doc_openwebtext_importance": -122.31981658935547,
"rps_doc_openwebtext_importance_length_correction": -122.31981658935547,
"rps_doc_wikipedia_importance": -90.47531127929688,
"rps_doc_wikipedia_importance_length_correction": -90.47531127929688
},
"fasttext": {
"dclm": 0.8523037433624268,
"english": 0.8865763545036316,
"fineweb_edu_approx": 2.1937365531921387,
"eai_general_math": 0.08129507303237915,
"eai_open_web_math": 0.14783453941345215,
"eai_web_code": 0.04106355085968971
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,854,856,527,743,263,000 |
Why You Should Overclock Your RAM
Each program on your PC stirs through RAM as it works. Your RAM works at a specific speed set up by the maker, yet a couple of moments in the BIOS can knock it up a long ways past its evaluated detail.
Truly, RAM Speed Matters
Each program you run gets stacked into RAM from your SSD or hard drive, which are similarly much more slow. When it’s stacked, it for the most part remains there for some time, being gotten to by the CPU at whatever point it needs it.
Improving the speed at which your RAM runs can straightforwardly improve your CPU’s exhibition in specific circumstances, however there is a state of consistent losses when the CPU essentially can’t agitate through more memory sufficiently quick. In everyday errands, the RAM being a couple of nanoseconds quicker probably won’t make any difference, however in case you’re truly doing the math, any little exhibition improvement can help.
The normal edge rate is generally helped a couple of rate focuses with quicker RAM when the CPU is doing a large portion of the work. Where RAM speed truly sparkles is in least framerates; for instance, when you load another territory or new articles in a game, in the event that everything needs to occur in one casing, that casing could take longer than expected if it’s looking out for the memory to stack. This is called microstuttering, and it can cause games to feel uneven in any event, when the normal casing rate is high.
Overclocking RAM Isn’t Scary
Overclocking RAM isn’t close to as frightening or perilous as overclocking a CPU or GPU. At the point when you overclock a CPU, you need to stress over whether your cooling will deal with the quicker timekeepers. An overclocked CPU or GPU can be a lot stronger than one running at stock settings.
With memory, they don’t create a lot of warmth by any means, so it’s very protected. Indeed, even on flimsy overclocks, the most terrible that happens is you’ll get a mistake when testing for security and be kicked back to this plan’s beginning point. However in case you’re giving this a shot a PC, you’ll need to check that you’re ready to clear CMOS (to reset the BIOS to default settings) if something goes wrong.
|
{
"url": "http://kingrootapkdownload.co/why-you-should-overclock-your-ram",
"source_domain": "kingrootapkdownload.co",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "16669",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6XGXUDVLKTF4VU337CECWXO46DHKNW42",
"WARC-Concurrent-To": "<urn:uuid:d022556a-8707-4f7e-bb91-7bd623a9c480>",
"WARC-Date": "2021-03-07T03:07:57Z",
"WARC-IP-Address": "172.96.191.166",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EMINDREXXU4WEAXKFRLBFTCAZLA2SPYG",
"WARC-Record-ID": "<urn:uuid:5ba03fc6-548c-4a98-abc5-50832e739ca2>",
"WARC-Target-URI": "http://kingrootapkdownload.co/why-you-should-overclock-your-ram",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:622856c3-6e2e-4e7c-80b4-d01cfee61e1d>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-191.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,
34,
35,
237,
238,
263,
264,
499,
500,
939,
940,
1471,
1472,
1501,
1502,
1799,
1800
],
"line_end_idx": [
34,
35,
237,
238,
263,
264,
499,
500,
939,
940,
1471,
1472,
1501,
1502,
1799,
1800,
2217
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2217,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46521738171577454,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.056521739810705185,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11521738767623901,
"rps_doc_frac_unique_words": 0.5280612111091614,
"rps_doc_mean_word_length": 4.540816307067871,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.967181205749512,
"rps_doc_word_count": 392,
"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.011797750368714333,
"rps_doc_frac_chars_top_3gram": 0.015168540179729462,
"rps_doc_frac_chars_top_4gram": 0.021348310634493828,
"rps_doc_books_importance": -190.10617065429688,
"rps_doc_books_importance_length_correction": -190.10617065429688,
"rps_doc_openwebtext_importance": -105.35597229003906,
"rps_doc_openwebtext_importance_length_correction": -105.35597229003906,
"rps_doc_wikipedia_importance": -84.49105072021484,
"rps_doc_wikipedia_importance_length_correction": -84.49105072021484
},
"fasttext": {
"dclm": 0.7879197001457214,
"english": 0.9398422837257385,
"fineweb_edu_approx": 1.995910406112671,
"eai_general_math": 0.17318838834762573,
"eai_open_web_math": 0.3422433137893677,
"eai_web_code": 0.173367440700531
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,585,756,055,832,931,000 |
PDA
View Full Version : Pop up window
kathryn
07-03-2003, 03:46 PM
Hi,
I have an HTML form with a radio button.
When the user clicks a button I would like a new window to open with a different HTML page and have the print screen available to print the contents.
Thanks, Kathryn
arnyinc
07-03-2003, 04:13 PM
use this page to popup the window after clicking on the radio button.
<html>
<head>
<script language="javascript">
function popup(){
var mypop=window.open("the_page_you_want_to_print.htm", "printme", "height=400, width=400")
}
</script>
</head>
<body>
<form>
<input type="radio" onclick="popup();">
</form>
</body>
</html>
Use this page to display the print screen on your popup. This would be named the_page_you_want_to_print.htm if you keep the same ridiculous naming scheme that i did :)
<html>
<body onload="window.print()">
The stuff you want to print.
</body>
</html>
kathryn
07-03-2003, 05:44 PM
Thanks that worked great ...
Another question though!!!
Is there any way to pass JSP variables (perhaps in the javascript function) from the original page to the pop-up window??
Kathryn
arnyinc
07-03-2003, 06:11 PM
Originally posted by kathryn
Is there any way to pass JSP variables (perhaps in the javascript function) from the original page to the pop-up window??
I'm not too familiar with JSP, but this should be close.
[page1.jsp]
<html>
<head>
<script language="javascript">
function popup(){
var mypop=window.open("page2.asp?yourvar=<% out.println(yourvar);%>", "printme", "height=400, width=400")
}
</script>
</head>
<body>
<form>
<input type="radio" onclick="popup();">
</form>
</body>
</html>
[page2.asp]
<html>
<body onload="window.print()">
<%
'get the value of the variable here... not sure how in jsp
%>
</body>
</html>
kathryn
07-04-2003, 09:55 AM
Thanks that worked great
Kathryn
|
{
"url": "http://www.codingforums.com/archive/index.php/t-22714.html",
"source_domain": "www.codingforums.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "5434",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L7YPT7AOJSYG2LZQNV3E23EQXFEOTXIF",
"WARC-Concurrent-To": "<urn:uuid:02d7cc5c-d99a-4a45-b71d-87363a76f8a3>",
"WARC-Date": "2015-11-28T15:19:47Z",
"WARC-IP-Address": "199.245.54.187",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:L6S6R2PZT2QWNN6LXQFCESUYKHX6I6DH",
"WARC-Record-ID": "<urn:uuid:59342c9d-8a0b-4302-a048-199762b13119>",
"WARC-Target-URI": "http://www.codingforums.com/archive/index.php/t-22714.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5052b574-77b9-4a30-8c1f-124350faad7f>"
},
"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,
1,
5,
6,
40,
41,
42,
43,
51,
72,
76,
117,
267,
283,
284,
292,
313,
383,
384,
391,
392,
399,
430,
448,
540,
542,
552,
560,
567,
574,
614,
622,
630,
638,
639,
807,
808,
815,
846,
875,
883,
891,
892,
900,
921,
950,
977,
1099,
1107,
1108,
1116,
1137,
1166,
1288,
1289,
1346,
1347,
1359,
1366,
1373,
1404,
1422,
1528,
1530,
1540,
1548,
1555,
1562,
1602,
1610,
1618,
1626,
1627,
1639,
1646,
1677,
1680,
1739,
1742,
1750,
1758,
1759,
1767,
1788,
1813
],
"line_end_idx": [
1,
5,
6,
40,
41,
42,
43,
51,
72,
76,
117,
267,
283,
284,
292,
313,
383,
384,
391,
392,
399,
430,
448,
540,
542,
552,
560,
567,
574,
614,
622,
630,
638,
639,
807,
808,
815,
846,
875,
883,
891,
892,
900,
921,
950,
977,
1099,
1107,
1108,
1116,
1137,
1166,
1288,
1289,
1346,
1347,
1359,
1366,
1373,
1404,
1422,
1528,
1530,
1540,
1548,
1555,
1562,
1602,
1610,
1618,
1626,
1627,
1639,
1646,
1677,
1680,
1739,
1742,
1750,
1758,
1759,
1767,
1788,
1813,
1820
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1820,
"ccnet_original_nlines": 84,
"rps_doc_curly_bracket": 0.0021977999713271856,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20484581589698792,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03083699941635132,
"rps_doc_frac_lines_end_with_ellipsis": 0.0117647098377347,
"rps_doc_frac_no_alph_words": 0.40969163179397583,
"rps_doc_frac_unique_words": 0.4741035997867584,
"rps_doc_mean_word_length": 5.231075763702393,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.004405289888381958,
"rps_doc_unigram_entropy": 4.469803333282471,
"rps_doc_word_count": 251,
"rps_doc_frac_chars_dupe_10grams": 0.26808834075927734,
"rps_doc_frac_chars_dupe_5grams": 0.34120336174964905,
"rps_doc_frac_chars_dupe_6grams": 0.34120336174964905,
"rps_doc_frac_chars_dupe_7grams": 0.34120336174964905,
"rps_doc_frac_chars_dupe_8grams": 0.26808834075927734,
"rps_doc_frac_chars_dupe_9grams": 0.26808834075927734,
"rps_doc_frac_chars_top_2gram": 0.01827874965965748,
"rps_doc_frac_chars_top_3gram": 0.021325210109353065,
"rps_doc_frac_chars_top_4gram": 0.019801979884505272,
"rps_doc_books_importance": -171.14793395996094,
"rps_doc_books_importance_length_correction": -168.62225341796875,
"rps_doc_openwebtext_importance": -105.1902847290039,
"rps_doc_openwebtext_importance_length_correction": -105.1902847290039,
"rps_doc_wikipedia_importance": -51.47740936279297,
"rps_doc_wikipedia_importance_length_correction": -51.45646667480469
},
"fasttext": {
"dclm": 0.04946643114089966,
"english": 0.7231304049491882,
"fineweb_edu_approx": 0.8541973829269409,
"eai_general_math": 0.2522682547569275,
"eai_open_web_math": 0.031949520111083984,
"eai_web_code": 0.19023150205612183
}
}
|
{
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,506,345,422,611,453,000 |
0
$\begingroup$
Given right associative tetration where:
$^{m}n =$ n^(n^(n^…))
And a situation such as:
$^{m}n = y$
$^{q}p = z$
What is a practical way to calculate which of $y$ and $z$ are larger?
I'm particularly looking at the case where:
$(n, m, p, q)$ are $> 1$
$p > n$
$m > q$
To simplify the question further, assume that $(n, m, p, q)$ are positive integers, they could for example be in the range 10 to 100.
Therefore $(y, z)$ are also positive integers.
$\endgroup$
1
$\begingroup$
Generally, the (exponent?, tetrand?)... the thing in the upper left, has more of an effect on the value than the base. For example the difference between $^43$ and $^37$ is astronomical (about 3.6 trillion orders of magnitude). This only gets more true as $m$ and $n$ increase.
As a rule of thumb, I would say whichever has the larger argument $m$ or $n$ is almost always larger. As for an exact answer, I don't know if there is one. Values resulting from tetration of large integers, say $^{987}4910$, tend do be so large that there is no way to calculate them exactly.
$\endgroup$
• $\begingroup$ I disagree with this answer. There is no quantification of formalization that a reasonable algorithm is impossible. $\endgroup$ – Turbo Nov 26 '18 at 0:19
• $\begingroup$ The quantification is that the number of digits in $^{987}4910$ exceeds the number of subatomic particles in the observable universe more than $10^{100000}$ times over. Even if you could devise an algorithm, it will still be physically impossible to write each digit of this number down, regardless of how small you make each digit. Furthermore, it would take more time than the universe will physically exist to run the algorithm. Even if you use scientific notation, you'll still be off by orders of magnitude. $\endgroup$ – R. Burton Nov 26 '18 at 4:10
• $\begingroup$ I do not think you understand the point. What you say is not a proof that two numbers represented in some way with $O(n)$ bits cannot be compared in $O(poly(n))$ time. $\endgroup$ – Turbo Nov 26 '18 at 6:10
• $\begingroup$ I suppose... but it doesn't make much difference if the time it takes just to calculate the time it will take to calculate the difference between two sufficiently large numbers exceeds the lifetime of the human species and $O(n)$ is larger than a universe's worth of storage space. $\endgroup$ – R. Burton Nov 26 '18 at 12:23
1
$\begingroup$
There might be a way to use logarithms to simplify in a structured method. Look $a^{a^a}<b^{b^{b^b}}\iff a^a\log a<b^{b^b}\log b\iff (a\log a)+\log\log a<(b^b\log b)+\log\log b$.
$\endgroup$
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://math.stackexchange.com/questions/3012842/larger-value-with-right-associative-tetration",
"source_domain": "math.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "147487",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VCRZCC7YVHZG44B5G77EEUJ2ONWWIMXT",
"WARC-Concurrent-To": "<urn:uuid:61ddafcd-7aac-4ef3-9d9a-c0da0a52a185>",
"WARC-Date": "2019-06-26T10:01:12Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WVNMOY6BGNGOGAW5G26F6PHXWHZPLN4D",
"WARC-Record-ID": "<urn:uuid:f3eb81dd-5b9f-4e77-b332-07c29f44cb47>",
"WARC-Target-URI": "https://math.stackexchange.com/questions/3012842/larger-value-with-right-associative-tetration",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:19975db9-54b1-421e-8f7c-24cf86345eed>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-155-57-213.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
16,
17,
58,
59,
81,
82,
107,
108,
120,
121,
133,
134,
204,
205,
206,
250,
251,
276,
277,
285,
286,
294,
295,
296,
430,
431,
478,
479,
491,
493,
507,
508,
786,
787,
1080,
1081,
1093,
1266,
1840,
2065,
2409,
2411,
2425,
2426,
2605,
2606,
2618,
2619,
2631,
2632,
2732,
2733
],
"line_end_idx": [
2,
16,
17,
58,
59,
81,
82,
107,
108,
120,
121,
133,
134,
204,
205,
206,
250,
251,
276,
277,
285,
286,
294,
295,
296,
430,
431,
478,
479,
491,
493,
507,
508,
786,
787,
1080,
1081,
1093,
1266,
1840,
2065,
2409,
2411,
2425,
2426,
2605,
2606,
2618,
2619,
2631,
2632,
2732,
2733,
2823
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2823,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0.007084660232067108,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39398279786109924,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015759309753775597,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31948423385620117,
"rps_doc_frac_unique_words": 0.48510637879371643,
"rps_doc_mean_word_length": 4.400000095367432,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.004297989886254072,
"rps_doc_unigram_entropy": 5.087066650390625,
"rps_doc_word_count": 470,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05319149047136307,
"rps_doc_frac_chars_dupe_6grams": 0.046421658247709274,
"rps_doc_frac_chars_dupe_7grams": 0.046421658247709274,
"rps_doc_frac_chars_dupe_8grams": 0.024177949875593185,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.021276600658893585,
"rps_doc_frac_chars_top_3gram": 0.013539649546146393,
"rps_doc_frac_chars_top_4gram": 0.01740811951458454,
"rps_doc_books_importance": -365.7761535644531,
"rps_doc_books_importance_length_correction": -365.7761535644531,
"rps_doc_openwebtext_importance": -178.16134643554688,
"rps_doc_openwebtext_importance_length_correction": -178.16134643554688,
"rps_doc_wikipedia_importance": -103.94264221191406,
"rps_doc_wikipedia_importance_length_correction": -103.94264221191406
},
"fasttext": {
"dclm": 0.9697210788726807,
"english": 0.8778324127197266,
"fineweb_edu_approx": 2.842099666595459,
"eai_general_math": 0.348827064037323,
"eai_open_web_math": 0.4167923927307129,
"eai_web_code": 0.0011229499941691756
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "510.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"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": "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": "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
|
8,909,652,026,065,007,000 |
Properties
Label 126.4.g.a
Level $126$
Weight $4$
Character orbit 126.g
Analytic conductor $7.434$
Analytic rank $0$
Dimension $2$
CM no
Inner twists $2$
Related objects
Downloads
Learn more about
Newspace parameters
Level: \( N \) \(=\) \( 126 = 2 \cdot 3^{2} \cdot 7 \)
Weight: \( k \) \(=\) \( 4 \)
Character orbit: \([\chi]\) \(=\) 126.g (of order \(3\), degree \(2\), minimal)
Newform invariants
Self dual: no
Analytic conductor: \(7.43424066072\)
Analytic rank: \(0\)
Dimension: \(2\)
Coefficient field: \(\Q(\sqrt{-3}) \)
Defining polynomial: \(x^{2} - x + 1\)
Coefficient ring: \(\Z[a_1, \ldots, a_{5}]\)
Coefficient ring index: \( 1 \)
Twist minimal: no (minimal twist has level 42)
Sato-Tate group: $\mathrm{SU}(2)[C_{3}]$
$q$-expansion
Coefficients of the \(q\)-expansion are expressed in terms of a primitive root of unity \(\zeta_{6}\). We also show the integral \(q\)-expansion of the trace form.
\(f(q)\) \(=\) \( q + ( -2 + 2 \zeta_{6} ) q^{2} -4 \zeta_{6} q^{4} + ( -15 + 15 \zeta_{6} ) q^{5} + ( 14 + 7 \zeta_{6} ) q^{7} + 8 q^{8} +O(q^{10})\) \( q + ( -2 + 2 \zeta_{6} ) q^{2} -4 \zeta_{6} q^{4} + ( -15 + 15 \zeta_{6} ) q^{5} + ( 14 + 7 \zeta_{6} ) q^{7} + 8 q^{8} -30 \zeta_{6} q^{10} -9 \zeta_{6} q^{11} -88 q^{13} + ( -42 + 28 \zeta_{6} ) q^{14} + ( -16 + 16 \zeta_{6} ) q^{16} -84 \zeta_{6} q^{17} + ( -104 + 104 \zeta_{6} ) q^{19} + 60 q^{20} + 18 q^{22} + ( -84 + 84 \zeta_{6} ) q^{23} -100 \zeta_{6} q^{25} + ( 176 - 176 \zeta_{6} ) q^{26} + ( 28 - 84 \zeta_{6} ) q^{28} -51 q^{29} -185 \zeta_{6} q^{31} -32 \zeta_{6} q^{32} + 168 q^{34} + ( -315 + 210 \zeta_{6} ) q^{35} + ( -44 + 44 \zeta_{6} ) q^{37} -208 \zeta_{6} q^{38} + ( -120 + 120 \zeta_{6} ) q^{40} + 168 q^{41} + 326 q^{43} + ( -36 + 36 \zeta_{6} ) q^{44} -168 \zeta_{6} q^{46} + ( -138 + 138 \zeta_{6} ) q^{47} + ( 147 + 245 \zeta_{6} ) q^{49} + 200 q^{50} + 352 \zeta_{6} q^{52} + 639 \zeta_{6} q^{53} + 135 q^{55} + ( 112 + 56 \zeta_{6} ) q^{56} + ( 102 - 102 \zeta_{6} ) q^{58} + 159 \zeta_{6} q^{59} + ( -722 + 722 \zeta_{6} ) q^{61} + 370 q^{62} + 64 q^{64} + ( 1320 - 1320 \zeta_{6} ) q^{65} + 166 \zeta_{6} q^{67} + ( -336 + 336 \zeta_{6} ) q^{68} + ( 210 - 630 \zeta_{6} ) q^{70} -1086 q^{71} -218 \zeta_{6} q^{73} -88 \zeta_{6} q^{74} + 416 q^{76} + ( 63 - 189 \zeta_{6} ) q^{77} + ( 583 - 583 \zeta_{6} ) q^{79} -240 \zeta_{6} q^{80} + ( -336 + 336 \zeta_{6} ) q^{82} + 597 q^{83} + 1260 q^{85} + ( -652 + 652 \zeta_{6} ) q^{86} -72 \zeta_{6} q^{88} + ( -1038 + 1038 \zeta_{6} ) q^{89} + ( -1232 - 616 \zeta_{6} ) q^{91} + 336 q^{92} -276 \zeta_{6} q^{94} -1560 \zeta_{6} q^{95} -169 q^{97} + ( -784 + 294 \zeta_{6} ) q^{98} +O(q^{100})\)
\(\operatorname{Tr}(f)(q)\) \(=\) \( 2q - 2q^{2} - 4q^{4} - 15q^{5} + 35q^{7} + 16q^{8} + O(q^{10}) \) \( 2q - 2q^{2} - 4q^{4} - 15q^{5} + 35q^{7} + 16q^{8} - 30q^{10} - 9q^{11} - 176q^{13} - 56q^{14} - 16q^{16} - 84q^{17} - 104q^{19} + 120q^{20} + 36q^{22} - 84q^{23} - 100q^{25} + 176q^{26} - 28q^{28} - 102q^{29} - 185q^{31} - 32q^{32} + 336q^{34} - 420q^{35} - 44q^{37} - 208q^{38} - 120q^{40} + 336q^{41} + 652q^{43} - 36q^{44} - 168q^{46} - 138q^{47} + 539q^{49} + 400q^{50} + 352q^{52} + 639q^{53} + 270q^{55} + 280q^{56} + 102q^{58} + 159q^{59} - 722q^{61} + 740q^{62} + 128q^{64} + 1320q^{65} + 166q^{67} - 336q^{68} - 210q^{70} - 2172q^{71} - 218q^{73} - 88q^{74} + 832q^{76} - 63q^{77} + 583q^{79} - 240q^{80} - 336q^{82} + 1194q^{83} + 2520q^{85} - 652q^{86} - 72q^{88} - 1038q^{89} - 3080q^{91} + 672q^{92} - 276q^{94} - 1560q^{95} - 338q^{97} - 1274q^{98} + O(q^{100}) \)
Character values
We give the values of \(\chi\) on generators for \(\left(\mathbb{Z}/126\mathbb{Z}\right)^\times\).
\(n\) \(29\) \(73\)
\(\chi(n)\) \(1\) \(-1 + \zeta_{6}\)
Embeddings
For each embedding \(\iota_m\) of the coefficient field, the values \(\iota_m(a_n)\) are shown below.
For more information on an embedded modular form you can click on its label.
Label \(\iota_m(\nu)\) \( a_{2} \) \( a_{3} \) \( a_{4} \) \( a_{5} \) \( a_{6} \) \( a_{7} \) \( a_{8} \) \( a_{9} \) \( a_{10} \)
37.1
0.500000 + 0.866025i
0.500000 0.866025i
−1.00000 + 1.73205i 0 −2.00000 3.46410i −7.50000 + 12.9904i 0 17.5000 + 6.06218i 8.00000 0 −15.0000 25.9808i
109.1 −1.00000 1.73205i 0 −2.00000 + 3.46410i −7.50000 12.9904i 0 17.5000 6.06218i 8.00000 0 −15.0000 + 25.9808i
\(n\): e.g. 2-40 or 990-1000
Significant digits:
Format:
Inner twists
Char Parity Ord Mult Type
1.a even 1 1 trivial
7.c even 3 1 inner
Twists
By twisting character orbit
Char Parity Ord Mult Type Twist Min Dim
1.a even 1 1 trivial 126.4.g.a 2
3.b odd 2 1 42.4.e.b 2
7.b odd 2 1 882.4.g.l 2
7.c even 3 1 inner 126.4.g.a 2
7.c even 3 1 882.4.a.r 1
7.d odd 6 1 882.4.a.h 1
7.d odd 6 1 882.4.g.l 2
12.b even 2 1 336.4.q.d 2
21.c even 2 1 294.4.e.e 2
21.g even 6 1 294.4.a.g 1
21.g even 6 1 294.4.e.e 2
21.h odd 6 1 42.4.e.b 2
21.h odd 6 1 294.4.a.a 1
84.j odd 6 1 2352.4.a.q 1
84.n even 6 1 336.4.q.d 2
84.n even 6 1 2352.4.a.u 1
By twisted newform orbit
Twist Min Dim Char Parity Ord Mult Type
42.4.e.b 2 3.b odd 2 1
42.4.e.b 2 21.h odd 6 1
126.4.g.a 2 1.a even 1 1 trivial
126.4.g.a 2 7.c even 3 1 inner
294.4.a.a 1 21.h odd 6 1
294.4.a.g 1 21.g even 6 1
294.4.e.e 2 21.c even 2 1
294.4.e.e 2 21.g even 6 1
336.4.q.d 2 12.b even 2 1
336.4.q.d 2 84.n even 6 1
882.4.a.h 1 7.d odd 6 1
882.4.a.r 1 7.c even 3 1
882.4.g.l 2 7.b odd 2 1
882.4.g.l 2 7.d odd 6 1
2352.4.a.q 1 84.j odd 6 1
2352.4.a.u 1 84.n even 6 1
Hecke kernels
This newform subspace can be constructed as the kernel of the linear operator \( T_{5}^{2} + 15 T_{5} + 225 \) acting on \(S_{4}^{\mathrm{new}}(126, [\chi])\).
Hecke characteristic polynomials
$p$ $F_p(T)$
$2$ \( 4 + 2 T + T^{2} \)
$3$ \( T^{2} \)
$5$ \( 225 + 15 T + T^{2} \)
$7$ \( 343 - 35 T + T^{2} \)
$11$ \( 81 + 9 T + T^{2} \)
$13$ \( ( 88 + T )^{2} \)
$17$ \( 7056 + 84 T + T^{2} \)
$19$ \( 10816 + 104 T + T^{2} \)
$23$ \( 7056 + 84 T + T^{2} \)
$29$ \( ( 51 + T )^{2} \)
$31$ \( 34225 + 185 T + T^{2} \)
$37$ \( 1936 + 44 T + T^{2} \)
$41$ \( ( -168 + T )^{2} \)
$43$ \( ( -326 + T )^{2} \)
$47$ \( 19044 + 138 T + T^{2} \)
$53$ \( 408321 - 639 T + T^{2} \)
$59$ \( 25281 - 159 T + T^{2} \)
$61$ \( 521284 + 722 T + T^{2} \)
$67$ \( 27556 - 166 T + T^{2} \)
$71$ \( ( 1086 + T )^{2} \)
$73$ \( 47524 + 218 T + T^{2} \)
$79$ \( 339889 - 583 T + T^{2} \)
$83$ \( ( -597 + T )^{2} \)
$89$ \( 1077444 + 1038 T + T^{2} \)
$97$ \( ( 169 + T )^{2} \)
show more
show less
|
{
"url": "https://www.lmfdb.org/ModularForm/GL2/Q/holomorphic/126/4/g/a/",
"source_domain": "www.lmfdb.org",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "116955",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O4JFBLUY72T2PAK7JSTFETZM3EC2VVMG",
"WARC-Concurrent-To": "<urn:uuid:665f966e-2c6a-44bf-9206-8437d378d5af>",
"WARC-Date": "2021-01-23T07:55:45Z",
"WARC-IP-Address": "35.241.19.59",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NPOA6NDYKQVN577GM27SKOK5DZEU7MMW",
"WARC-Record-ID": "<urn:uuid:95c25b0b-3578-4fb2-8ee2-96e4ec6a148c>",
"WARC-Target-URI": "https://www.lmfdb.org/ModularForm/GL2/Q/holomorphic/126/4/g/a/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3b8d0606-8545-45b2-b224-70ebc555b2e3>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-98.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,
11,
12,
28,
40,
51,
73,
100,
118,
132,
138,
155,
156,
172,
173,
183,
184,
201,
202,
222,
223,
278,
308,
388,
389,
408,
409,
423,
461,
482,
499,
537,
576,
621,
653,
700,
741,
742,
756,
757,
921,
922,
2650,
3536,
3537,
3554,
3555,
3654,
3655,
3675,
3712,
3713,
3724,
3725,
3827,
3828,
3905,
3906,
4038,
4043,
4064,
4083,
4192,
4305,
4334,
4354,
4362,
4363,
4376,
4377,
4403,
4424,
4443,
4444,
4451,
4452,
4487,
4527,
4560,
4583,
4607,
4638,
4663,
4687,
4711,
4737,
4763,
4789,
4815,
4839,
4864,
4890,
4916,
4943,
4948,
4981,
5021,
5044,
5068,
5101,
5132,
5157,
5183,
5209,
5235,
5261,
5287,
5311,
5336,
5360,
5384,
5410,
5437,
5438,
5452,
5453,
5613,
5614,
5647,
5648,
5661,
5687,
5703,
5732,
5761,
5789,
5815,
5846,
5879,
5910,
5936,
5969,
6000,
6028,
6056,
6089,
6123,
6156,
6190,
6223,
6251,
6284,
6318,
6346,
6382,
6409,
6419
],
"line_end_idx": [
11,
12,
28,
40,
51,
73,
100,
118,
132,
138,
155,
156,
172,
173,
183,
184,
201,
202,
222,
223,
278,
308,
388,
389,
408,
409,
423,
461,
482,
499,
537,
576,
621,
653,
700,
741,
742,
756,
757,
921,
922,
2650,
3536,
3537,
3554,
3555,
3654,
3655,
3675,
3712,
3713,
3724,
3725,
3827,
3828,
3905,
3906,
4038,
4043,
4064,
4083,
4192,
4305,
4334,
4354,
4362,
4363,
4376,
4377,
4403,
4424,
4443,
4444,
4451,
4452,
4487,
4527,
4560,
4583,
4607,
4638,
4663,
4687,
4711,
4737,
4763,
4789,
4815,
4839,
4864,
4890,
4916,
4943,
4948,
4981,
5021,
5044,
5068,
5101,
5132,
5157,
5183,
5209,
5235,
5261,
5287,
5311,
5336,
5360,
5384,
5410,
5437,
5438,
5452,
5453,
5613,
5614,
5647,
5648,
5661,
5687,
5703,
5732,
5761,
5789,
5815,
5846,
5879,
5910,
5936,
5969,
6000,
6028,
6056,
6089,
6123,
6156,
6190,
6223,
6251,
6284,
6318,
6346,
6382,
6409,
6419,
6428
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6428,
"ccnet_original_nlines": 146,
"rps_doc_curly_bracket": 0.07654014229774475,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10018975287675858,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022011389955878258,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7548387050628662,
"rps_doc_frac_unique_words": 0.4685777425765991,
"rps_doc_mean_word_length": 3.685777187347412,
"rps_doc_num_sentences": 174,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.382394790649414,
"rps_doc_word_count": 907,
"rps_doc_frac_chars_dupe_10grams": 0.10140591859817505,
"rps_doc_frac_chars_dupe_5grams": 0.2524678409099579,
"rps_doc_frac_chars_dupe_6grams": 0.18905174732208252,
"rps_doc_frac_chars_dupe_7grams": 0.1648220270872116,
"rps_doc_frac_chars_dupe_8grams": 0.1109781563282013,
"rps_doc_frac_chars_dupe_9grams": 0.10140591859817505,
"rps_doc_frac_chars_top_2gram": 0.01076877024024725,
"rps_doc_frac_chars_top_3gram": 0.01495662983506918,
"rps_doc_frac_chars_top_4gram": 0.01196529995650053,
"rps_doc_books_importance": -1063.593994140625,
"rps_doc_books_importance_length_correction": -1063.593994140625,
"rps_doc_openwebtext_importance": -747.4208984375,
"rps_doc_openwebtext_importance_length_correction": -747.4208984375,
"rps_doc_wikipedia_importance": -902.6434936523438,
"rps_doc_wikipedia_importance_length_correction": -902.6434936523438
},
"fasttext": {
"dclm": 0.7645649909973145,
"english": 0.26813143491744995,
"fineweb_edu_approx": 0.8109366297721863,
"eai_general_math": 0.8531968593597412,
"eai_open_web_math": 0.9294230341911316,
"eai_web_code": 0.06806915998458862
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.74",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512.73",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "2",
"label": "Academic/Research"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "20",
"label": "Structured Data"
}
},
"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
|
119,567,819,075,374,110 |
2
$\begingroup$
Let $X$ and $Y$ be two sets of points in $\mathbb{R}^3$. Assume that the cardinality of $Y$ is larger (much larger if you want) than $X$. For each $x_i \in X$, I need to find all $y \in Y$ such that the distance between $x_i$ and $y$ is less than a (fixed) radius $R$. That is, for each $x_i$, I want the set $E_i = \{y \in Y: \|x_i-y\|\ \leq R\}$.
Now this looks to me like a nearest-neighbors type problem just with two different sets of points. If I'm correct, usually something like an R-tree or kd-tree is good for finding nearest neighbors within a single set $X$. But this seems a bit different. I could naively just iterate through $X$ and find the $y_j \in Y$ such that $\|x_i-y_j\| \leq R.$ and I suppose store that in a gigantic array, but this seems like the worst possible method. On the bright side, this is at least embarassingly parallel so there is that at least.
Any suggestions would be greatly appreciated and I apologize if this is a trivial question (I'm not a computer scientist!) Also, if this is the incorrect place to ask such a question, please let me know. If the question is unclear or requires additional information, just let me know. Thanks!
$\endgroup$
1
• 1
$\begingroup$ Why do you consider using a R-tree or a kd-tree the worst possible method? One natural thing to do is to store $Y$ in the k-d tree and then iterate through $X$ to perform near-neighbor search once per element of $X$; why do you conclude that is the worst possible method? $\endgroup$
– D.W.
Mar 3, 2015 at 12:02
1 Answer 1
1
$\begingroup$
Sort the big set $Y$ into a regular grid, then for any query point $x_i,$ find its cell and you only have to check the adjacent cells to determine $E_i$ very quickly. For sorting, indeed, some parallel algorithms are faster than others, see this poster for an overview and example of using fast GPU radix and count sort.
$\endgroup$
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://cs.stackexchange.com/questions/35817/good-data-structure-for-finding-all-points-in-one-set-a-distance-from-each-point",
"source_domain": "cs.stackexchange.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "153427",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XMBZB47SIL7MR4TOKYLHMPVI76U2TVGJ",
"WARC-Concurrent-To": "<urn:uuid:75df82a6-b152-446b-9280-864a702acde6>",
"WARC-Date": "2023-09-22T04:28:30Z",
"WARC-IP-Address": "104.18.11.86",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UGHB2PPNQVWT2ZVDBF6HEZEA7MDP3YSQ",
"WARC-Record-ID": "<urn:uuid:c04aa6e1-44b2-49a6-85a0-0afd243436ee>",
"WARC-Target-URI": "https://cs.stackexchange.com/questions/35817/good-data-structure-for-finding-all-points-in-one-set-a-distance-from-each-point",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0c51917e-f8d0-446b-8b8d-3476b9c6b693>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-30\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
16,
17,
366,
367,
899,
900,
1193,
1194,
1206,
1208,
1214,
1516,
1527,
1552,
1553,
1564,
1565,
1567,
1581,
1582,
1903,
1904,
1916,
1917,
1929,
1930,
2086,
2087
],
"line_end_idx": [
2,
16,
17,
366,
367,
899,
900,
1193,
1194,
1206,
1208,
1214,
1516,
1527,
1552,
1553,
1564,
1565,
1567,
1581,
1582,
1903,
1904,
1916,
1917,
1929,
1930,
2086,
2087,
2177
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2177,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0.0018373900093138218,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39312976598739624,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.057251911610364914,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25190839171409607,
"rps_doc_frac_unique_words": 0.5089974403381348,
"rps_doc_mean_word_length": 4.131105422973633,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.93301248550415,
"rps_doc_word_count": 389,
"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.0056004999205470085,
"rps_doc_frac_chars_top_3gram": 0.029869319871068,
"rps_doc_frac_chars_top_4gram": 0.04107031971216202,
"rps_doc_books_importance": -156.94558715820312,
"rps_doc_books_importance_length_correction": -156.94558715820312,
"rps_doc_openwebtext_importance": -82.04020690917969,
"rps_doc_openwebtext_importance_length_correction": -82.04020690917969,
"rps_doc_wikipedia_importance": -49.83273696899414,
"rps_doc_wikipedia_importance_length_correction": -49.83273696899414
},
"fasttext": {
"dclm": 0.8967365026473999,
"english": 0.9231992959976196,
"fineweb_edu_approx": 2.1059134006500244,
"eai_general_math": 0.5315080285072327,
"eai_open_web_math": 0.6734588742256165,
"eai_web_code": 0.02125524915754795
}
}
|
{
"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": "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": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,703,786,898,992,361,500 |
Begin3 Title: make_uninstall Version: 2.2.1 Entered-date: AUG072005 Description: This script is used to monitor a command like 'make install', so a record of the install can be created, which will allow you to completely remove the package from your system later. Usually when you compile a package you do './configure ; make ; make install'. Instead of the 'make install' step do 'mku', and choose 'Monitor' from the menu. Example: ./configure ; make ; mku You can see a listing for each installed package in /var/log/uninstall/packages/package_name. You can also create a database in "/var/log/uninstall/ configure", with the configure and make rules you want for a particular source package. Run 'mku' and choose 'Configure', then 'Create' from the menu, to create a configure and make rules file. Then, instead of the './configure ; make ; make install' steps do 'mku', and choose 'Configure' then 'Run' from the menu. You'll have the option of creating a Slackware, Debian, or RPM package of the install, after the install or later using /var/log/uninstall/packages/package_name as the guide. The 'mku' script requires 'bash' and 'dialog' and/or 'Xdialog'. Keywords: Author: [email protected] (Kent Robotti) Maintained-by: Primary-site: http://www.tux.org/pub/people/kent-robotti/looplinux Alternate-site: ftp://ibiblio.org/pub/Linux/utils/package Platforms: Linux system with bash shell. Copying-policy: GPL End
|
{
"url": "http://ibiblio.org/pub/linux/utils/package/make_uninstall-2.2.1.lsm",
"source_domain": "ibiblio.org",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "1964",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6U22SRL2QC3BJS25HL4GK53ECUOKCQ44",
"WARC-Concurrent-To": "<urn:uuid:ae5affe4-db83-487a-9b1b-d4899f4d1728>",
"WARC-Date": "2015-03-31T03:30:01Z",
"WARC-IP-Address": "152.19.134.40",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6OIY5DYRIN4NX24HR5GCL5PUTY4KQSGY",
"WARC-Record-ID": "<urn:uuid:2a0b54e4-0d6a-407d-b217-d2f042c959c2>",
"WARC-Target-URI": "http://ibiblio.org/pub/linux/utils/package/make_uninstall-2.2.1.lsm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7c91f07f-117c-4f9e-900b-a38860891d46>"
},
"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
],
"line_end_idx": [
1419
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1419,
"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.25,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008928569965064526,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3273809552192688,
"rps_doc_frac_unique_words": 0.5257732272148132,
"rps_doc_mean_word_length": 5.634020805358887,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.276660442352295,
"rps_doc_word_count": 194,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04574564844369888,
"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.04025617986917496,
"rps_doc_frac_chars_top_3gram": 0.03293687105178833,
"rps_doc_frac_chars_top_4gram": 0.04391583055257797,
"rps_doc_books_importance": -105.08678436279297,
"rps_doc_books_importance_length_correction": -104.24588012695312,
"rps_doc_openwebtext_importance": -80.78684997558594,
"rps_doc_openwebtext_importance_length_correction": -80.78684997558594,
"rps_doc_wikipedia_importance": -61.3388671875,
"rps_doc_wikipedia_importance_length_correction": -55.80257797241211
},
"fasttext": {
"dclm": 0.6696818470954895,
"english": 0.7627179026603699,
"fineweb_edu_approx": 2.8426668643951416,
"eai_general_math": 0.8261809349060059,
"eai_open_web_math": 0.7038364410400391,
"eai_web_code": 0.0915859267115593
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
-3,831,953,631,902,615,000 |
2
I am using the secure pages drupal module to enable https for some of the pages , but i have noticed one bug in this , each time i reload the page its toggling between http and https, and if i go from a secure page to another secure page(ex: login to registration which are bith secure according to settings) the destination page will be in http but if i refresh it toggles between secure and non secure , a similar issue is reported here
2
The source of the problem could be in several places, depending on which webserver you're using, how it's configured, etc.
Are you using Apache with mod_ssl? NOthing else 'in front', like nginx doing the SSL handshaking instead?
In any case, I'm guessing that your webserver's not consistenly serving up the required server var. In 'securepages.module', there's a check for
return (isset($_SERVER['HTTPS']) && $_SERVER['HTTPS'] == 'on') ? TRUE : FALSE;
Not knowing your webserver config, find out what your webserver is doing. add,
<?php
phpinfo();
?>
to your pages and look to see what the values of
$_SERVER['HTTPS']
$_SERVER[SERVER_PORT]
are. Or simply print them out directly ... Check if/how those values toggle on page refresh.
I'm suspicious of caching, too.
| improve this answer | |
1
To ensure that they donot toggle between http and https, go to secure pages and let say you want to make a specific link 'mylink' secure. Write (use aesterik and forward slash before link and (forward slash and aesterik) after your link) in the list of secured pages to ensure that it is secured. I did it in multilingual site and it worked for me.
Posted this thing so that any one can take advantage of it. :)
| improve this answer | |
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://drupal.stackexchange.com/questions/6458/drupal-module-secure-pages-toggles-between-http-and-https-on-reload",
"source_domain": "drupal.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "150757",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:G4GPUFU34NBDUSXAHQ7VGF7CLTOUZJAW",
"WARC-Concurrent-To": "<urn:uuid:97ea0d1a-265a-427b-a0a5-5045bfcc0930>",
"WARC-Date": "2020-10-27T15:17:01Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ORJ77MMGBDGZDNBFGIKJ3LKVIJFMJJXD",
"WARC-Record-ID": "<urn:uuid:ab3e30e2-8381-4603-a45e-7132f7f27f56>",
"WARC-Target-URI": "https://drupal.stackexchange.com/questions/6458/drupal-module-secure-pages-toggles-between-http-and-https-on-reload",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e0fe15b2-4c9c-45f7-a5d6-9849ccd51045>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-44.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,
442,
443,
445,
446,
569,
570,
676,
677,
822,
823,
902,
903,
982,
983,
989,
1001,
1004,
1005,
1054,
1055,
1073,
1095,
1096,
1189,
1190,
1222,
1223,
1249,
1251,
1252,
1601,
1602,
1665,
1666,
1692,
1693,
1705,
1706,
1806,
1807
],
"line_end_idx": [
2,
3,
442,
443,
445,
446,
569,
570,
676,
677,
822,
823,
902,
903,
982,
983,
989,
1001,
1004,
1005,
1054,
1055,
1073,
1095,
1096,
1189,
1190,
1222,
1223,
1249,
1251,
1252,
1601,
1602,
1665,
1666,
1692,
1693,
1705,
1706,
1806,
1807,
1897
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1897,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4126213490962982,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03640776872634888,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2063106745481491,
"rps_doc_frac_unique_words": 0.565079391002655,
"rps_doc_mean_word_length": 4.5714287757873535,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.002427180064842105,
"rps_doc_unigram_entropy": 4.8749260902404785,
"rps_doc_word_count": 315,
"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.015277779661118984,
"rps_doc_frac_chars_top_3gram": 0.019444439560174942,
"rps_doc_frac_chars_top_4gram": 0.02638888917863369,
"rps_doc_books_importance": -164.60308837890625,
"rps_doc_books_importance_length_correction": -164.6027374267578,
"rps_doc_openwebtext_importance": -120.79991149902344,
"rps_doc_openwebtext_importance_length_correction": -120.79991149902344,
"rps_doc_wikipedia_importance": -85.29503631591797,
"rps_doc_wikipedia_importance_length_correction": -85.29503631591797
},
"fasttext": {
"dclm": 0.03382151946425438,
"english": 0.8833678364753723,
"fineweb_edu_approx": 1.114009976387024,
"eai_general_math": 0.00017040999955497682,
"eai_open_web_math": 0.032294150441884995,
"eai_web_code": 0.00002325000059499871
}
}
|
{
"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": "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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,707,600,836,022,603,300 |
1. Download our Official Android App: Forums for Android!
"Smart" zoom for browser?
Discussion in 'Android Devices' started by evo678, Jun 28, 2010.
1. evo678
evo678 Well-Known Member
Thread Starter
Rank:
None
Points:
43
Posts:
112
Joined:
Jun 18, 2010
Jun 18, 2010
112
27
43
I guess that's what it's called? Basically where the web page/text reformats to fit the width of the screen when zoomed. There is a video floating around from The Street TV where the "reviewer" says the DX doesn't do this.
I really like this feature (Evo does this quite well) and is one of my pet peeves with browsing on my Ipod Touch.
Does anyone know for sure whether DX does or doesn't have this capability? I asked the guy who did the AC benchmark test and he said that the DX does do this. Someone else said that it's a setting in the browser. Others are saying that it doesn't do it...
Seems like such a basic feature that I can't imagine a phone like the DX would not be able to do this.
Advertisement
2. swazedahustla
swazedahustla Well-Known Member
Rank:
None
Points:
43
Posts:
178
Joined:
Jun 1, 2010
Jun 1, 2010
178
28
43
BMORE.......4G ALL DAY
Its not that it isn't able to do it, the browser that comes with it just doesn't have that function for some reason. Maybe its a HTC thing, who knows.
3. lexluthor
lexluthor Android Expert
Rank:
None
Points:
283
Posts:
4,161
Joined:
May 15, 2010
May 15, 2010
4,161
402
283
Long Island, NY
xScope does that, but I thought the stock browser on the Inc did that too. Are there different android "stock" browsers?
4. e5116
e5116 Well-Known Member
Rank:
None
Points:
38
Posts:
142
Joined:
Apr 20, 2010
Apr 20, 2010
142
23
38
Yeah, I'm very curious about this functionality too.
So, you're saying that one could easily just install a different browser and this functionality would then be in place, right?
5. gwlaw99
gwlaw99 Android Expert
Rank:
None
Points:
128
Posts:
1,030
Joined:
Nov 1, 2009
Nov 1, 2009
1,030
53
128
The stock android browser doesnt automatically "fit to page" even when this option is checked. This is so when you zoom in on a picture the "fit to page" feature doesn't move the picture off the screen--this would be very annoying. What you need to do is zoom into the text size that you want with pinch zoom and then double tap the screen and it will "fit to page" based on the size text on the screen at that moment.
6. swazedahustla
swazedahustla Well-Known Member
Rank:
None
Points:
43
Posts:
178
Joined:
Jun 1, 2010
Jun 1, 2010
178
28
43
BMORE.......4G ALL DAY
Well not "easy" per say, but theoretically it would be as simple as taking the frameworks of the HTC browser and porting them over to the X. But the hard part would be actually obtaining root on the phone in order to change that up. It seems Motorola is taking a no nonsense stand in terms of root, and they are locking this phone down like crazy. So if someone were to figure out how to root, then it would be pretty simple to get a different browser.
7. swazedahustla
swazedahustla Well-Known Member
Rank:
None
Points:
43
Posts:
178
Joined:
Jun 1, 2010
Jun 1, 2010
178
28
43
BMORE.......4G ALL DAY
I think different phone browsers operate differently. Both my Hero and Evo use the double tap feature and automatically size the text on the page so that it fits. My wife's moment doesn't do that, it just makes the text really big but you still have to pinch it in until all the words are on the screen. Im not sure why that is, but it seems each manufacturer has the ability to tweak that and some just dont do it.
8. soapinmouth
soapinmouth Android Enthusiast
Rank:
None
Points:
53
Posts:
321
Joined:
Apr 7, 2010
Apr 7, 2010
321
56
53
Yes it has it I saw it on one off the.video reviews on youtube.
9. mahers
mahers Android Expert
Rank:
None
Points:
143
Posts:
1,320
Joined:
Apr 2, 2010
Apr 2, 2010
1,320
164
143
Male
Product Manager
Concord, CA
Mobile Burn's Part 2 review shows double tap "smart zoom" and pinch to zoom on web pages at the 3:00 mark.
YouTube - Motorola DROID X review - part 2
Looks smooth.
10. dylo22
dylo22 Android Enthusiast
Rank:
None
Points:
93
Posts:
743
Joined:
Apr 19, 2010
Apr 19, 2010
743
119
93
The video shows double tap zoom, but it doesn't show the text rearranging to fit the screen.
Share This Page
Loading...
|
{
"url": "https://androidforums.com/threads/smart-zoom-for-browser.110933/",
"source_domain": "androidforums.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "144280",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6WUBEPSZNIXESMXWHF6RR5HDLYAGY2XA",
"WARC-Concurrent-To": "<urn:uuid:929d4204-10a6-43c2-ae76-9a7459f316a9>",
"WARC-Date": "2017-11-25T08:21:33Z",
"WARC-IP-Address": "173.192.24.230",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KZS4OZONUZT4MSEJREB2KOZI3M6M2P7Y",
"WARC-Record-ID": "<urn:uuid:0708b12f-dc06-4933-8182-2dabbce8ad10>",
"WARC-Target-URI": "https://androidforums.com/threads/smart-zoom-for-browser.110933/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0983a749-78c3-42c0-a547-e5c3e054176e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-230-1-184.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,
60,
61,
87,
88,
153,
154,
166,
167,
196,
215,
225,
234,
246,
253,
264,
272,
284,
301,
302,
319,
327,
334,
341,
568,
569,
687,
688,
948,
949,
1056,
1062,
1063,
1081,
1082,
1101,
1102,
1138,
1148,
1157,
1169,
1176,
1187,
1195,
1207,
1223,
1224,
1240,
1248,
1255,
1262,
1289,
1444,
1450,
1465,
1466,
1495,
1505,
1514,
1526,
1534,
1545,
1555,
1567,
1584,
1585,
1602,
1612,
1620,
1628,
1648,
1773,
1779,
1790,
1791,
1819,
1829,
1838,
1850,
1857,
1868,
1876,
1888,
1905,
1906,
1923,
1931,
1938,
1945,
2002,
2003,
2134,
2140,
2153,
2154,
2181,
2191,
2200,
2212,
2220,
2231,
2241,
2253,
2269,
2270,
2286,
2296,
2303,
2311,
2734,
2740,
2759,
2760,
2796,
2806,
2815,
2827,
2834,
2845,
2853,
2865,
2881,
2882,
2898,
2906,
2913,
2920,
2947,
2948,
3405,
3411,
3430,
3431,
3467,
3477,
3486,
3498,
3505,
3516,
3524,
3536,
3552,
3553,
3569,
3577,
3584,
3591,
3618,
4038,
4044,
4061,
4062,
4097,
4107,
4116,
4128,
4135,
4146,
4154,
4166,
4182,
4183,
4199,
4207,
4214,
4221,
4289,
4295,
4307,
4308,
4334,
4344,
4353,
4365,
4373,
4384,
4394,
4406,
4422,
4423,
4439,
4449,
4457,
4465,
4474,
4494,
4510,
4621,
4622,
4669,
4670,
4688,
4694,
4707,
4708,
4738,
4748,
4757,
4769,
4776,
4787,
4795,
4807,
4824,
4825,
4842,
4850,
4858,
4865,
4962,
4968,
4969,
4985,
4986
],
"line_end_idx": [
60,
61,
87,
88,
153,
154,
166,
167,
196,
215,
225,
234,
246,
253,
264,
272,
284,
301,
302,
319,
327,
334,
341,
568,
569,
687,
688,
948,
949,
1056,
1062,
1063,
1081,
1082,
1101,
1102,
1138,
1148,
1157,
1169,
1176,
1187,
1195,
1207,
1223,
1224,
1240,
1248,
1255,
1262,
1289,
1444,
1450,
1465,
1466,
1495,
1505,
1514,
1526,
1534,
1545,
1555,
1567,
1584,
1585,
1602,
1612,
1620,
1628,
1648,
1773,
1779,
1790,
1791,
1819,
1829,
1838,
1850,
1857,
1868,
1876,
1888,
1905,
1906,
1923,
1931,
1938,
1945,
2002,
2003,
2134,
2140,
2153,
2154,
2181,
2191,
2200,
2212,
2220,
2231,
2241,
2253,
2269,
2270,
2286,
2296,
2303,
2311,
2734,
2740,
2759,
2760,
2796,
2806,
2815,
2827,
2834,
2845,
2853,
2865,
2881,
2882,
2898,
2906,
2913,
2920,
2947,
2948,
3405,
3411,
3430,
3431,
3467,
3477,
3486,
3498,
3505,
3516,
3524,
3536,
3552,
3553,
3569,
3577,
3584,
3591,
3618,
4038,
4044,
4061,
4062,
4097,
4107,
4116,
4128,
4135,
4146,
4154,
4166,
4182,
4183,
4199,
4207,
4214,
4221,
4289,
4295,
4307,
4308,
4334,
4344,
4353,
4365,
4373,
4384,
4394,
4406,
4422,
4423,
4439,
4449,
4457,
4465,
4474,
4494,
4510,
4621,
4622,
4669,
4670,
4688,
4694,
4707,
4708,
4738,
4748,
4757,
4769,
4776,
4787,
4795,
4807,
4824,
4825,
4842,
4850,
4858,
4865,
4962,
4968,
4969,
4985,
4986,
4996
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4996,
"ccnet_original_nlines": 213,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32663315534591675,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0331658311188221,
"rps_doc_frac_lines_end_with_ellipsis": 0.00934579037129879,
"rps_doc_frac_no_alph_words": 0.2924623191356659,
"rps_doc_frac_unique_words": 0.38697317242622375,
"rps_doc_mean_word_length": 4.182631015777588,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.008040199987590313,
"rps_doc_unigram_entropy": 5.231457710266113,
"rps_doc_word_count": 783,
"rps_doc_frac_chars_dupe_10grams": 0.09801527112722397,
"rps_doc_frac_chars_dupe_5grams": 0.1569465547800064,
"rps_doc_frac_chars_dupe_6grams": 0.09801527112722397,
"rps_doc_frac_chars_dupe_7grams": 0.09801527112722397,
"rps_doc_frac_chars_dupe_8grams": 0.09801527112722397,
"rps_doc_frac_chars_dupe_9grams": 0.09801527112722397,
"rps_doc_frac_chars_top_2gram": 0.02442747913300991,
"rps_doc_frac_chars_top_3gram": 0.042748089879751205,
"rps_doc_frac_chars_top_4gram": 0.01954198069870472,
"rps_doc_books_importance": -401.13787841796875,
"rps_doc_books_importance_length_correction": -401.13787841796875,
"rps_doc_openwebtext_importance": -230.7757568359375,
"rps_doc_openwebtext_importance_length_correction": -230.7757568359375,
"rps_doc_wikipedia_importance": -157.33956909179688,
"rps_doc_wikipedia_importance_length_correction": -157.33956909179688
},
"fasttext": {
"dclm": 0.021766599267721176,
"english": 0.9339247941970825,
"fineweb_edu_approx": 1.187705159187317,
"eai_general_math": 0.06758219003677368,
"eai_open_web_math": 0.3006015419960022,
"eai_web_code": 0.00013982999371364713
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,564,918,865,488,720,000 |
WordPress как на ладони
Недорогой хостинг для сайтов на WordPress: wordpress.jino.ru Авторские Темы для WordPress
функция не описана
acf_field__group::format_value() public ACF 3.6
This filter is appied to the $value after it is loaded from the db and before it is returned to the template
{} Это метод класса: acf_field__group{}
Хуков нет.
Возвращает
$value. (mixed) the modified value
Использование
$acf_field__group = new acf_field__group();
$acf_field__group->format_value( $value, $post_id, $field );
$value (обязательный)
-
$post_id (обязательный)
-
$field (обязательный)
-
Список изменений
С версии 3.6 Введена.
Код acf_field__group::format_value() ACF 5.9.1
<?php
function format_value( $value, $post_id, $field ) {
// bail early if no value
if( empty($value) ) return false;
// modify names
$field = $this->prepare_field_for_db( $field );
// loop
foreach( $field['sub_fields'] as $sub_field ) {
// extract value
$sub_value = acf_extract_var( $value, $sub_field['key'] );
// format value
$sub_value = acf_format_value( $sub_value, $post_id, $sub_field );
// append to $row
$value[ $sub_field['_name'] ] = $sub_value;
}
// return
return $value;
}
|
{
"url": "https://wp-kama.ru/plugin/acf/function/acf_field__group::format_value",
"source_domain": "wp-kama.ru",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "97498",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2TXG5TZZ4V4C4GY6MURIRKFC6V5J5ZWT",
"WARC-Concurrent-To": "<urn:uuid:ed134caa-2ee5-4eb0-b5e5-48d8bcdf926e>",
"WARC-Date": "2021-06-18T09:23:24Z",
"WARC-IP-Address": "87.236.16.123",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DNDYL4ZUI4JZ3N3ZRVZ2FGDI6TZH5MWV",
"WARC-Record-ID": "<urn:uuid:ae84008a-32c9-4bce-b1b7-4158a7e12234>",
"WARC-Target-URI": "https://wp-kama.ru/plugin/acf/function/acf_field__group::format_value",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:979eaf80-0c24-4efd-9aa6-e99be6025f36>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-34.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,
24,
114,
133,
134,
182,
183,
292,
293,
333,
334,
345,
346,
357,
358,
393,
394,
408,
409,
453,
514,
536,
538,
562,
564,
586,
588,
589,
606,
607,
629,
630,
677,
678,
684,
736,
738,
765,
800,
802,
804,
821,
870,
872,
874,
884,
933,
936,
955,
1016,
1019,
1022,
1040,
1109,
1112,
1115,
1135,
1181,
1184,
1187,
1189,
1191,
1202,
1218,
1220
],
"line_end_idx": [
24,
114,
133,
134,
182,
183,
292,
293,
333,
334,
345,
346,
357,
358,
393,
394,
408,
409,
453,
514,
536,
538,
562,
564,
586,
588,
589,
606,
607,
629,
630,
677,
678,
684,
736,
738,
765,
800,
802,
804,
821,
870,
872,
874,
884,
933,
936,
955,
1016,
1019,
1022,
1040,
1109,
1112,
1115,
1135,
1181,
1184,
1187,
1189,
1191,
1202,
1218,
1220,
1221
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1221,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0.006552009843289852,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.13833992183208466,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011857709847390652,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5889328122138977,
"rps_doc_frac_unique_words": 0.6456692814826965,
"rps_doc_mean_word_length": 6.464566707611084,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.156970500946045,
"rps_doc_word_count": 127,
"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.012180269695818424,
"rps_doc_frac_chars_top_3gram": 0.03897685930132866,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -132.2664337158203,
"rps_doc_books_importance_length_correction": -132.2664337158203,
"rps_doc_openwebtext_importance": -72.55938720703125,
"rps_doc_openwebtext_importance_length_correction": -72.55931854248047,
"rps_doc_wikipedia_importance": -61.659515380859375,
"rps_doc_wikipedia_importance_length_correction": -61.659515380859375
},
"fasttext": {
"dclm": 0.4009942412376404,
"english": 0.05715734139084816,
"fineweb_edu_approx": 2.726247549057007,
"eai_general_math": 0.011590720154345036,
"eai_open_web_math": 0.09676384925842285,
"eai_web_code": 0.5568393468856812
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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
|
-6,698,670,372,437,533,000 |
Intranet Focus | Intranet strategy & management Follow Intranet Focus | Intranet strategy & management, filter it, and define how you want to receive the news (via Email, RSS, Telegram, Whatsapp etc.) http://intranetfocus.com Wed, 28 Oct 2020 03:08:27 GMT FeedCreatorClass 1.0 dev (follow.it) Expertise search – the strange use case of the ‘New Hire’ https://api.follow.it/track-rss-story-click/j9CZdmKxZx1CozyUZytbxvofnIDBDYltkQccVsVQOijcxN9FeuycCu_ZEyunOZzvLHZvzDS2fnd59cdRlBMP1quIeCEshRySz8gglG6ZtF5-wTIXrvPlRLlQwTxZw9USmylSGvNeSKI <img src="https://api.follow.it/rssubscribers/rss_show_story_count/362920168/1768029" border=0 width="1" height="1" alt="Story 362920168" title="Story 362920168"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">Expertise search – the strange use case of the ‘New Hire’</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p><span>Over the last few months I have seen a number of suggestions from search vendors and from KM consultants that an enterprise search application is essential for new hires (NH) to be able to find subject matter experts from around the organisation to help them move on with the work they are doing.</span></p> <p><span>I would like to consider some wider managerial implications of this use case which seem not to have been taken into account. </span></p> <p><span>When a NH arrives in an organisation there are two certainties. The first is that they will have a manager. The second is that they will be introduced to project managers or team managers that they will be working with. Their manager will then start them on their first task, and they will quickly be invited to join project and team applications and meetings. However the assumption by those offering expertise search is that the minute the NH hits a problem the solution is to use the search application to find an expert in the organisation who can help them. </span></p> <p><span>Now if I was a NH the first person I would speak to would be my manager. They would either be able to solve the problem or suggest someone I should talk to within their network. That is the role of a manager. I could also raise the issue with someone else on my team, perhaps by posting a message on the team chat. I will be familiar with intranet technology so I might look to see if there is a specific document that I can refer to. </span></p> <p><span>I ask you, is it likely that in an organisation I am totally unfamiliar with that I will conduct a search to find an expert? For a start (and this is a problem in any expert search situation) I am probably not familiar enough with the ‘business language’ to know how to choose relevant query terms for a problem I have never come across before. Just as important the search application may list out more than one expert. How do I choose which one to contact, and how certain can I be that the solution they suggest is sound advice, especially if they are working in a different department, a different country or are responding in their second language?</span></p> <p><span>Let me now consider the situation from the perspective of the manager. Because the NH has not talked to them at the outset manager will not be aware of the problem, so they cannot either offer a solution to the NH or appreciate that they need more training. The manager will also not be able to assess whether the problem is one that has arisen before and which needs deeper investigation as to why it still seems to be a problem. </span></p> <p><span>From the viewpoint of the expert, they will be concerned that the manager is failing in their duty to support the NH and may decide to raise the issue with the manager’s manager, to everyone’s embarrassment. The manager themselves will be concerned that so soon after joining the organisation the NH does not trust them to be supportive and team members will also be curious when at the next meeting the NH explains that they decided to search for an expert because they felt that the team would not support them. </span></p> <p><span>The bottom line is this. How would you, as a manager, feel if a NH seemed to have so little trust in you that they would resort to using a search application they are unfamiliar with to find an expert they did not know to help them with a problem that they could not clearly define? </span></p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/standout-virtual-events-how-to-create-an-experience-that-your-audience-will-love/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Wed, 07 Oct 2020 16:36:41 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx1CozyUZytbxvofnIDBDYltkQccVsVQOijcxN9FeuycCu_ZEyunOZzvLHZvzDS2fnd59cdRlBMP1quIeCEshRySz8gglG6ZtF5-wTIXrvPlRLlQwTxZw9USmylSGvNeSKI Standout Virtual Events – How to create an experience that your audience will love https://api.follow.it/track-rss-story-click/j9CZdmKxZx2MC5N2GWpQ8ZOfeERc_qwXkQccVsVQOijcxN9FeuycCjdWYrJPBwXeqr9Ki72Qy1kRe9dtnCCb0oo7menXnSunpdEWAT8KQ_Ow6cVLoWc36oTzGQtCIOFSQHZ5BKUDxkZtyK43SoN31a3G4vdBXe3PVs_CM59Gpyk <img src="https://api.follow.it/rssubscribers/rss_show_story_count/360372399/1768029" border=0 width="1" height="1" alt="Story 360372399" title="Story 360372399"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">Standout Virtual Events – How to create an experience that your audience will love</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p> </p> <p><span>I have no idea how many blog posts, reports and webinars have been published on how to work effectively on Zoom and Teams. (Other tools are available – I think!) What I am certain is that there have been too many. Now we need to move on and start to work out how to run a virtual event. It seems likely that there are going to be few, if any, on-site events before perhaps late 2021 because of the lead time needed to set up an event with any element of on-site participation. </span></p> <p><span>I’ve already had experience of the <a href="https://irsg.bcs.org/informer/2020/05/ecir-2020-delivering-a-virtual-conference/">European Conference on Information Retrieval 2020</a> as a virtual event in April, a large scale <a href="https://irsg.bcs.org/informer/2020/08/microsoft-research-new-future-of-work-conference-3-5-august-2020-part-1-the-conference-technology-platform/">Microsoft Research Event</a> in August and am involved in the planning of a virtual Search Solutions 2020 at the end of November. This has enabled me to assess the advice given in this book against both event scenarios, but first I need to say something about ‘Standout Virtual Events – How to create an experience that your audience will love’</span></p> <p><span>There are nine chapters in this 100page trade paperback format. On the surface this might seem to be slim but then so is a Longines watch but I’ve never heard this as a reason for not buying one! What you quickly realise is that this book encapsulates the speaking and event management skills of <a href="https://www.davidmeermanscott.com/">David Meerman Scott</a> and the journalistic skills of Michelle Manafy (@michellemanafy). Every word is crafted with care and obvious enthusiasm, but this is balanced by a critical assessment of the challenges as well of the benefits of virtual events. </span></p> <p><span>What I especially liked was the balance between the business planning of virtual events and how the content needs to be delivered. When you listen to a poor speaker in a conference room you can let your eyes and brain glaze over for a while. My experience of virtual events is that for some reason I expect perfection, probably as a reasonable return for sitting on an office chair with headphones on for an extended period of time. </span></p> <p><span>This book has a high AHF (Ah Ha Factor!) and at least once a page and often more several times a page a crucially important insight is presented with elegance and authority. I really enjoyed reading it and it has certainly made sure I think extra-carefully about some facets of a number of forthcoming events I am either participating in or organizing. As a result the return on the purchase investment for me (and for you listening to me) will be immense beyond calculation as it will stop me making a fool of myself. </span></p> <p><span>I have two reflections. The first is that some organisers are considering a hybrid event format, with a mix of video and onsite participants and presenters. Although there are many references to hybrid events in the book I would have welcomed them being brought together. The second is that video technology may be of significant assistance with multi-lingual events where real-time interpretation could be offered. The Microsoft Research event mentioned above ran voice-to-text beneath each speaker, which I found distracting and unhelpful as all the presentations were in English. A brief consideration of the pros and cons would have been helpful in Europe where the language changes every 400 miles or so. </span></p> <p><span>In the UK the paperback price is £9.99. Just put the title in the search bar and press Return. In fact, buy two and send one to the organizer of the next virtual event you are participating in. </span></p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/managing-enterprise-search-vendor-customer-relationships/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Tue, 29 Sep 2020 16:29:07 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx2MC5N2GWpQ8ZOfeERc_qwXkQccVsVQOijcxN9FeuycCjdWYrJPBwXeqr9Ki72Qy1kRe9dtnCCb0oo7menXnSunpdEWAT8KQ_Ow6cVLoWc36oTzGQtCIOFSQHZ5BKUDxkZtyK43SoN31a3G4vdBXe3PVs_CM59Gpyk Managing enterprise search vendor – customer relationships. https://api.follow.it/track-rss-story-click/j9CZdmKxZx1-awdx2_ivHzghPUmfDRHfkQccVsVQOijcxN9FeuycCmGi56Vp2GWlaLCkN0Mudp6qmH6zFbvVkBww7KQYG8qINk_Zwe8eYkLbVYhzbvDqmKNZVP7Eqrksq9rDvlf5Eg0 <img src="https://api.follow.it/rssubscribers/rss_show_story_count/360295022/1768029" border=0 width="1" height="1" alt="Story 360295022" title="Story 360295022"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">Managing enterprise search vendor – customer relationships.</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p><span>Over the last decade of large-scale enterprise search projects I have found that relationships between the vendor and the customer can quickly become strained because the customer has no prior experience of working with a search vendor. Expectations on both sides then invariably do not meet in the middle and too often I end up trying to find a common basis for the resumption of the required degree of sanity. </span></p> <p><span>The list below is based on my experience of where things have gone awry and it is certainly not a complete list. I doubt any will come as a surprise! On both sides of partnership I have suggested that there should be profiles of the people involved in the project. So often I have seen problems arise because the customer has always talked to Freda and now Michel seems to be the contact point. </span></p> <p><span>What I have set out below are what I judge to be highly desirable expectations if an enterprise search implementation is going to be a win-win for the vendor (who always wants reference sites) and the customer (who wants to see a significant increase in search satisfaction). Looking at the customer expectations of a vendor inevitably cause me to consider the situation with Microsoft search applications and with Microsoft implementation partners. I’ll leave you to read the lines and between the lines. </span></p> <p><strong><span>Customer expectations of a vendor</span></strong></p> <ol> <li><span>Transparency of the elements and schedule of the development road map</span></li> <li><span>Any potential requirement for a partial or full (!) reindex are flagged up at the earliest possible time</span></li> <li><span>Ability to input into the development road map</span></li> <li><span>Clarity about the respective roles of the vendor and any associated partners</span></li> <li><span>First level technical support no more than 3 time zones away</span></li> <li><span>Profiles of all members of the implementation and support teams</span></li> <li><span>Documented escalation procedure for red flag issues</span></li> <li><span>Membership of customer communities by region and business sectors</span></li> <li><span>Any hand-over between project leaders to be managed with considerable care</span></li> <li><span>Being proactive with suggestions for improving the search experience based on experience gained with other customers</span></li> </ol> <p><strong><span>Vendor expectations of a customer</span></strong></p> <ol> <li><span>Complete clarity about the objectives for the search implementation</span></li> <li><span>Profiles of all the members of the implementation team</span></li> <li><span>Consistent format for feedback on the progress of the project</span></li> <li><span>Maintaining awareness of changes in stakeholders and expectations</span></li> <li><span>Adequate advance notice of any changes in project personnel</span></li> <li><span>Adherence to agreements over availability of internal support for the application</span></li> <li><span>Structured feedback in an agreed format on search performance</span></li> <li><span>Opportunities to learn from LoB managers about search adoption and satisfaction</span></li> <li><span>Willingness to share experiences with potential customers</span></li> <li><span>Be the first to know if the customer has concerns</span></li> </ol> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/systematic-searching-practical-ideas-for-improving-results/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Tue, 29 Sep 2020 11:29:00 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx1-awdx2_ivHzghPUmfDRHfkQccVsVQOijcxN9FeuycCmGi56Vp2GWlaLCkN0Mudp6qmH6zFbvVkBww7KQYG8qINk_Zwe8eYkLbVYhzbvDqmKNZVP7Eqrksq9rDvlf5Eg0 Systematic searching – practical ideas for improving results https://api.follow.it/track-rss-story-click/j9CZdmKxZx3aP511Q3w_fo5a2ZZG9te1kQccVsVQOijcxN9FeuycCkHK1SCG6IQsxvhNMtMN7DA98BTzsW7zcHBeFZqXkfGcpBMab0hnmNTD11G3KlIp9tpRB0xfRqRjNIbhI0RhmaE <img src="https://api.follow.it/rssubscribers/rss_show_story_count/360026672/1768029" border=0 width="1" height="1" alt="Story 360026672" title="Story 360026672"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">Systematic searching – practical ideas for improving results</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p>I have just finished reading a review copy of <a href="http://www.facetpublishing.co.uk/title.php?id=303731#.X3IGaRSSkuU">Systematic Searching – Practical Ideas for Improving Results</a> from Facet Publishing. It was published in late 2019 but somehow I overlooked its release. Systematic searching emerged from the requirements of evidenced-based medicine. To quote from the book, systematic reviews of interventions require a thorough, objective and reproducible search of a range of sources to identify as many relevant studies as possible within resource limits. It is not just about brute-force searching but having the skills to know which sources to search. It also requires a high level of skill from the searcher to avoid any bias in the way in which the search is conducted and the results are presented.</p> <p>This book has 16 chapters and runs to over 300 pages. Most (but not all) the authors work in the UK clinical review sector and are clearly writing from the wealth of experience they have acquired over many years of training and practice. To give the titles of just a few of the chapters, they cover</p> <ul> <li>Choosing the right databases and search techniques</li> <li>Social media as a source of evidence</li> <li>Text mining for information specialists</li> <li>Training the next generation of information specialists</li> <li>Collaborative working to improve searching</li> </ul> <p>The authors, editors (Paul Levy and Jenny Craven at <a href="https://www.nice.org.uk/">NICE</a>) and the Facet production team deserve great credit for achieving a uniformity of writing style and managing to avoid too much duplication between chapters. Also obvious is the passion that the writers have for their subject and for the role of systematic searching in achieving excellence in health care. There is a very good balance between discussing published research and providing insights and advice from being professional systematic searchers. There are over thirty good case studies presented in text boxes and most chapters end with suggestions for further reading and a short bibliography. In most cases there are references to 2018, which is quite an achievement in a book published in 2019. On that basis I will forgive a failure to reference the work of Peter Pirolli and Stuart Card on information foraging in their seminal paper of 1999, a topic that also missed out in a not entirely successful index.</p> <p>I have nothing but praise for this book, which reminds me that search has to deliver in business-critical situations, especially where health care and medical progress are concerned. This book is all about using the technology and does not get deep into discussions about ranking models. In general these searches are being carried out on commercial systems and there is no scope to play games with the back-end code. Given the current pandemic the timing of publication is fortuitous. Even if heath care is not your core interest reading this book will raise questions about whether in general we are putting enough skills and experience to the service of our customers.</p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/when-cultures-collide-leading-across-cultures/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Mon, 28 Sep 2020 15:55:27 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx3aP511Q3w_fo5a2ZZG9te1kQccVsVQOijcxN9FeuycCkHK1SCG6IQsxvhNMtMN7DA98BTzsW7zcHBeFZqXkfGcpBMab0hnmNTD11G3KlIp9tpRB0xfRqRjNIbhI0RhmaE When Cultures Collide – Leading Across Cultures https://api.follow.it/track-rss-story-click/j9CZdmKxZx0-dc9GuPwHGTRol-kfYgNVkQccVsVQOijcxN9FeuycCuscoA2QhwyK_Qa4hkJwG_JCB9WZNupl8emu74Jq40g0cQOqY_TuwRMbyGVBLsbdUvQFEXKuDDZ0 <img src="https://api.follow.it/rssubscribers/rss_show_story_count/359991660/1768029" border=0 width="1" height="1" alt="Story 359991660" title="Story 359991660"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">When Cultures Collide – Leading Across Cultures</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p> </p> <p><span>In the course of a highly enjoyable and satisfying career I have had the opportunity to work on projects in over 40 countries. One thing I have learned over the years is that no matter how well I think I know the culture (national and managerial) I will always be wrong in what ever assumptions I have made about how to do business. I have also found, to my cost, that the most difficult projects have been working with people who speak English as a second language seemingly as well as I speak it as my first language. It is so easy to assume that they have the same cultural traits as I have. I have lost count of the times a client has had a quiet word with me over a water cooler or the rest room and given me a reality check on how best to do business with them. </span></p> <p><span>At quite an early stage in my management career I came across the work of Geert Hofstede, Glen Fisher and Raymond Cohen and more recently the work of Erin Meyer has been very illuminating. The range of services from <a href="https://www.rw-3.com/">Culture Wizard</a> is also excellent. But time and time again I have prepared for a project by consulting one of the many books written by <a href="https://www.crossculture.com/about-us/">Richard D. Lewis</a>, now in his 90’s. His book When Cultures Collide, published in 1997, placed an emphasis on making an effort to understanding the similarities (just relax!) and differences (beware the red flags!). </span></p> <p><span>Understanding cultural differences is now much more important than it has ever been as we struggle with video technology that hides the body language of individuals and (always overlooked) the feel of a meeting from assessing the level of engagement with people present but not participating. What makes you think for one moment that the only people in on the call are those you can see on your Zoom display? The widespread use of video conferencing is not going to level the playing field. On the contrary countries now wish to emphasis their characteristics to avoid them being ‘smoothed out’ by networking technology. </span></p> <p><span>Sadly so many gurus on how to build communities seem to take the view the what works in the USA works at a global level, despite the differences in approach of the East Coast and West Coast of their country. I started working with a global virtual team based in Australia, India, Belgium, the UK, Canada and the USA in 1974 when all we had were a telephone handset and Group 1 fax. Do any of you remember Group 1 fax working at 5 minutes a page! My largest virtual team was 145 people in 19 countries from Tokyo to San Francisco. By then we had email and rudimentary (and very expensive!) teleconferencing. Even with this level of experience I try hard to listen and watch out for the clues that hint that I may be making assumptions about project team members. </span></p> <p><span>The scale of the challenge is best illustrated by the fact that the 4<sup>th</sup> Edition of <a href="https://www.crossculture.com/product/when-cultures-collide-4th-edition/">When Cultures Collide</a> runs to 556 pages and covers over 60 countries. The paperback version has recently been published. There is a very good introduction to the issues, challenges and solutions that runs to almost 150 pages of the book. No book can be definitive and in every country there will be people who run counter-to-type, often a result of being educated outside of their country of birth. </span></p> <p><span>There is no immediate sign of the ‘new normal’ that was supposed to emerge post the initial impact of Covid-19. Virtual teams will continue to be an essential component of getting work done. If you have to work trans-nationally investing in this book may reduce the amount of laughter post the Zoom/Teams call when everyone shares notes on your cultural intransigence. </span></p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/understanding-and-improving-information-search-a-cognitive-approach/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Mon, 28 Sep 2020 14:13:19 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx0-dc9GuPwHGTRol-kfYgNVkQccVsVQOijcxN9FeuycCuscoA2QhwyK_Qa4hkJwG_JCB9WZNupl8emu74Jq40g0cQOqY_TuwRMbyGVBLsbdUvQFEXKuDDZ0 Understanding and improving information search – a cognitive approach https://api.follow.it/track-rss-story-click/j9CZdmKxZx0KLRl4Z0mu7WVexMf5gn-MkQccVsVQOijcxN9FeuycCvSZnakYLLNkBue1ScqRfCtk8qJL0eY2SLxanc7nyxl9XoBsfsDVJnJvlXemZLzlNzEAPRHBQrYctQR3Ym8ziqqS7EZwFFqGrA-CAoeDpD-D <img src="https://api.follow.it/rssubscribers/rss_show_story_count/359942956/1768029" border=0 width="1" height="1" alt="Story 359942956" title="Story 359942956"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">Understanding and improving information search – a cognitive approach</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p><a href="https://link.springer.com/book/10.1007%2F978-3-030-38825-6"></a></p> <p><span>The term ‘cognitive search’ is commonly used to label how a search application can read the minds of searchers as to their intent in undertaking a search. This book, <a href="https://link.springer.com/book/10.1007%2F978-3-030-38825-6">Understanding and Improving Information Search – a Cognitive Approach </a> takes a much wider perspective, considering the entire process of search, especially exploratory search. I am normally disappointed by the consistency and currency of multi-author books but this title has been assembled with great skill and covers research published in 2019. This is immediately obvious with the introduction by the co-editors Wai Tat Fu and Herre van Oostendorp which leads the reader through the book with great care. </span></p> <p><span>The first part of this book focuses on the computational cognitive modeling framework that integrates information retrieval metrics into cognitive</span> <span>simulations of user behavior in the broader information search process. The opening chapter is a tour de force from Peter Pirolli building on the work that he and Stuart Card undertook in the late 1990s on information foraging, followed by a chapter from Wai Tat Fu on How Cognitive Computational Models Can Improve Information Search. </span></p> <p><span>Having laid the foundational framework, in the second section there are five chapters</span> <span>on the methods and tools that support the cognitive approach. I must highlight Chapter 7 entitled Designing Multistage Search Systems to Support the Information Seeking Process which highlights the importance of designing search user interface features for different information seeking stages (building on the work of Kuhlthau and Wilson amongst others) and should convince you that everything you thought you knew about user interface design for search is probably wrong. In Chapter 8 Kazutoshi Umemoto, Takehiro Yamamoto and Katsumi Tanaka go into further detail on UI design issues. Building on the work of Marti Hearst the authors present some very elegant UI solutions for relevance judgment, information credibility, exploratory search and accommodating a range of search skills. If you are of the opinion that the ‘modern’ UI on Microsoft 365 Search cannot be improved then you may want to give this chapter a miss. </span></p> <p><span>The final section of this 286page book considers a few topics in more depth, of which Chapter 13 on Conversational Interfaces for Information Search is especially valuable given the current level of interest in chat bots. </span></p> <p><span>Although this book is grounded in academic research it is in general written for a more general audience. Enterprise search developers, especially those involved in user interface development, will find much to challenge and inspire them, and this would also be the case for search managers in organisations with a decent level of enterprise search maturity. Inevitably the chapters focus on web search (when will the academic community realise the vast differences between web and enterprise search!) but the general principles expounded in this book are quite widely applicable to enterprise search implementations by anyone with a commitment to understanding how to deliver high levels of search satisfaction. It should also appeal to information scientists, especially those with a strong interest in the psychology of information behaviour and information search. </span></p> <p><span>This book is relatively expensive at £87.50 but for me it has been a Rosetta Stone journey on reading through it as many of the observations I have made over the last decade now start to make sense when considered within a broad cognitive experience agenda. Those who claim that ‘cognitive search’ is a solved technology problem will read this and appreciate that a) there is so much research they should be aware of and b) cognitive search is about understanding user behaviours at a very detailed level. </span></p> <p> </p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/how-good-is-your-enterprise-search-support-team-assuming-you-have-one/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Mon, 28 Sep 2020 11:27:23 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx0KLRl4Z0mu7WVexMf5gn-MkQccVsVQOijcxN9FeuycCvSZnakYLLNkBue1ScqRfCtk8qJL0eY2SLxanc7nyxl9XoBsfsDVJnJvlXemZLzlNzEAPRHBQrYctQR3Ym8ziqqS7EZwFFqGrA-CAoeDpD-D How good is your enterprise search support team? Assuming you have one! https://api.follow.it/track-rss-story-click/j9CZdmKxZx3mDKb4OwmLYSqmZGMjnIErkQccVsVQOijcxN9FeuycCgxa7L5HYFbnwYxWznTOImleU9G-ttDsNKqYfrMVu9WQHDDspBgbyohL9hAraiK0qUpXxPqh3Zb7T5om_EgzLIxpiCxVuupOHlfSeeDUNLg- <img src="https://api.follow.it/rssubscribers/rss_show_story_count/353716486/1768029" border=0 width="1" height="1" alt="Story 353716486" title="Story 353716486"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">How good is your enterprise search support team? Assuming you have one!</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p><span>Charlie Hull has posted an <a href="https://opensourceconnections.com/blog/2020/09/07/stop-chasing-the-search-unicorn-when-building-a-search-team/">excellent analysis</a> of the difficulty in finding experienced search specialists to support search development. Sadly the challenges he outlines are only one half of the problem. Back in 2012 I was asked by the European Commission to <a href="https://ec.europa.eu/jrc/en/publication/eur-scientific-and-technical-research-reports/enterprise-search-european-union-techno-economic-analysis">identify barriers</a> to the development of a European market for enterprise search that would stimulate the demand for search software applications from EU-based companies. I identified that the major barrier was a lack of experienced search specialists not only with the skills to develop search applications but also with the skills to assess user requirements. </span></p> <p><span>Since 2012 nothing has changed. With the praiseworthy exception of <a href="https://opensourceconnections.com/training/">OSC</a> there are no training courses for enterprise search managers and not a single <a href="https://ischools.org/">Information School</a> offers enterprise search as a Masters course. I suspect that the reason for this omission is that academics have little or no direct contact with organisations that need to have effective search. As a result even if they specify a course they have no one to teach it. This lack of academic focus on enterprise search also means that the amount of research carried out in an enterprise setting remains at around 0.1% of the total number of information retrieval/search papers. </span></p> <p><span><a href="https://paulhcleverley.com/2019/06/12/enterprise-search-a-state-of-the-art/">Paul Cleverley</a> has made the point that there is a need for a systems approach in enterprise search deployment, which I would totally support. In my view this systems approach has to take account of the reality of enterprise information management, the subject of <a href="https://www.microsoft.com/en-us/research/publication/establishing-a-research-agenda-for-enterprise-information-management/">my presentation</a> to the Microsoft Research New Future of Work conference in early August and my paper published recently in <a href="https://journals.sagepub.com/doi/10.1177/0266382120950114">Business Information Review</a>. </span></p> <p><span>It is also the case that over the same period of time a number of surveys have shown that the levels of satisfaction are terrifyingly low, with typically <a href="https://irsg.bcs.org/informer/2020/08/the-state-of-enterprise-search-in-scandinavia-in-2019/">around 40% of organisations</a> reporting that their employees are dissatisfied with their enterprise search applications. If this was the case with any other enterprise application the CIO would have been moved out but it seems that enterprise search is just not on anyone’s radar. <a href="https://www.cmswire.com/information-management/the-risks-and-consequences-of-information-mismanagement/">The concomitant risks are huge</a>. </span></p> <p><span>It does not help that search vendors are intent on selling solely on technical sophistication with the implied view that the AI/ML underpinnings of their technology render as superfluous any requirement to define user requirements or to establish a search support team. Nothing could be farther from reality. To quote from Paul Cleverley’s paper (above) </span></p> <p><span>“Every interview with a [major law firm] partner started with ‘hope you are going to fix search because search is rubbish, we need a better search engine’, but they had probably one of the best technically competent search engines around.”</span></p> <p><span>I have had exactly the same experience probably three or four times a year for the last decade. </span></p> <p><span>When a business application fails to support a business process immediate action is taken. In the case of search there are no specific business processes. Every user and every search that they make will be initiated by a different information requirement and process. One of the reasons I offer the <a href="http://intranetfocus.com/searchcheck-service/">SearchCheck</a> service is to be able to provide a benchmark score in the space of two hours. My guess is that when you take the test the results will be well below your expectations, and that information could be exactly what is needed to establish a coherent approach to delivering search across your organisation. </span></p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/10-reasons-why-user-satisfaction-with-enterprise-search-is-so-low/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Tue, 08 Sep 2020 11:48:30 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx3mDKb4OwmLYSqmZGMjnIErkQccVsVQOijcxN9FeuycCgxa7L5HYFbnwYxWznTOImleU9G-ttDsNKqYfrMVu9WQHDDspBgbyohL9hAraiK0qUpXxPqh3Zb7T5om_EgzLIxpiCxVuupOHlfSeeDUNLg- 10 reasons why user satisfaction with enterprise search is so low https://api.follow.it/track-rss-story-click/j9CZdmKxZx32_L29fcnYaAsj71xJcVZRkQccVsVQOijcxN9FeuycCsbB8e-L0FXsv_-Q4hTOa56dYpxZZi6gtjtstTCWKT_wO1s8op2nPHFwp18IgWSkySYp1VQV_RQ7x3fYAohRuFO_0L2yyI_iJw <img src="https://api.follow.it/rssubscribers/rss_show_story_count/353466937/1768029" border=0 width="1" height="1" alt="Story 353466937" title="Story 353466937"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">10 reasons why user satisfaction with enterprise search is so low</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p><span>I’m somewhat exasperated by those who see enterprise search user satisfaction as an easily-solved technology problem. The reality is that enterprise search is unlike any other aspect of search and it is an excellent example of a <a href="https://www.linkedin.com/pulse/why-enterprise-search-wicked-problem-martin-white/">wicked problem</a>. All the evidence suggests that perhaps <a href="https://irsg.bcs.org/informer/2020/08/the-state-of-enterprise-search-in-scandinavia-in-2019/">40% of employees are dissatisfied</a> with their internal search application even though the same percentage regard being able to find information being of the highest importance. In this post I want to go back to basics so that we all appreciate the challenges of delivering a superb user experience.</span></p> <p><strong>Massive amounts of structured and unstructured content, very little of it curated</strong></p> <p><span>In all other search applications, such as web sites, intranets and e-commerce, the content is highly structured by people who have an interest in it being found. In enterprise search employees are not incentivized to make content findable by creating good document structures and adding in metadata. The business objective is productivity and not findability</span></p> <p><strong>Often multiple applications in a federated search implementation</strong></p> <p><span>Technically it is not difficult to run a query across multiple applications to create an enterprise-wide search. However, the user interfaces are then a nightmare to comprehend. Have you noticed that when vendors promote their federated search implementations they never present the UI options that are available. </span></p> <p><strong>Multiple content languages and inconsistent language skills of users</strong></p> <p><span>One of my clients had 75% of its enterprise content in English, but only 25% of employees had English as their mother tongue. That makes for some serious difficulties with creating queries, coming up with synonyms for query expansion, reading snippets in fractured English to determine relevance to the query and then reading through the document. </span></p> <p><strong>Security trimming plays havoc with relevance</strong></p> <p><span>Effective security trimming is sine qua non in enterprise search, but both early and late binding present a host of problems. Equally challenging are the impacts on search satisfaction. Two colleagues may find different documents highlighted as relevant because (not that they know it) they have different security profiles. On seeing what a colleague has found the innocent party then complains that search is broken and of course trust in the search will be broken. </span></p> <p><strong>Employees have a substantial about of information pushed to them by other enterprise applications </strong></p> <p><span>One of the myths of enterprise information management is that users spend their day looking for information. The reality is that information is being pushed to them by other enterprise applications (ERP, CRM, HR) and of course email and social media. </span></p> <p><strong>Search is therefore ‘additive’ and not from a zero knowledge base</strong></p> <p><span>Research back in 2012 showed that enterprise users were experts in their domains, and that as a result of information being pushed to them they were likely to have most of the relevant information and documents. What they wanted to undertake were searches to extend what they had accumulated. The assumption of search vendors and CIOs is that all searches are being carried out as though the employees are totally ignorant. </span></p> <p><strong>Employees have multiple role and responsibilities, and therefore information seeking requirements</strong></p> <p><span>The most difficult aspect of enterprise searching is working out why a search is being conducted, known as the search intent. Creating personalized results on the basis of past searches or documents that have been written fails to appreciate an enterprise search environment where (especially now and for months to come) employees are taking on new responsibilities as colleagues are made redundant and are performing multiple roles. Presenting enterprise search as a technology for mind-reading is not helpful. </span></p> <p><strong>Enterprise search is not based around business processes so it is very difficult to assess whether a search failure is a content issue, a query issue or a technology issue</strong></p> <p><span>The <a href="https://www.clearbox.co.uk/diagnosing-enterprise-search/">failure modes in enterprise search</a> are many and varied. When an HR application fails to track down an employee there are only a few possible failure modes. When enterprise search fails to track down an employee and all they have written then tracking down why is a very complex exercise.</span></p> <p><strong>Largely managed by IT on ‘technical performance’ (uptime/traffic) metrics with few (if any) search specialists</strong></p> <p><span>Because every search user is an individual what they are looking for is individual and usually business-critical. Only with a great deal of attention to search logs and a range of feedback channels can the patterns of search success and failure be defined and addressed, and that takes a blend of a good knowledge of the technology, of the nature of the content being indexed and searched, and the language of the business as far as jargon, synonyms and abbreviations are concerned. </span></p> <p><strong>An assumption is that search is intuitive, so no training and no mentoring available</strong></p> <p><span>In the case of most enterprise applications employees are trained in how to use them and often their ability is subject to certification. There is no evidence that search is de facto intuitive, but a substantial amount of how important training is in ensuring that search users are satisfied with the performance of the application. </span></p> <p>I should add in closing that there are in fact more than 10, but it seemed a good place to stop….for now! </p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/are-relevant-documents-all-we-need-to-make-excellent-decisions/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Mon, 07 Sep 2020 15:25:17 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx32_L29fcnYaAsj71xJcVZRkQccVsVQOijcxN9FeuycCsbB8e-L0FXsv_-Q4hTOa56dYpxZZi6gtjtstTCWKT_wO1s8op2nPHFwp18IgWSkySYp1VQV_RQ7x3fYAohRuFO_0L2yyI_iJw Are ‘relevant documents’ all we need to make excellent decisions? https://api.follow.it/track-rss-story-click/j9CZdmKxZx2jQ4Mh0MovfAho1tj2fTLLkQccVsVQOijcxN9FeuycCmSleVo8bLeH05HjrzQ7bq5pX5yMLi3Wua4D22chzTfkeBucJKv10EazOOi7u_Eikv2v21gqNhxRbr_cAsI2SaFwdk8f16t5ew <img src="https://api.follow.it/rssubscribers/rss_show_story_count/351564393/1768029" border=0 width="1" height="1" alt="Story 351564393" title="Story 351564393"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">Are ‘relevant documents’ all we need to make excellent decisions?</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p><span>Every month I add 10-15 academic papers to my personal digital library. Most relate to some aspect of enterprise search (a collection that already tops 1100 items!) but there are also many on information management, collaboration and virtual teams, my other main research interests. Most I scan and file away with a descriptive title and a marker that indicates whether I have read them in depth. From time to time I come across a paper that breaks new ground in a research area, and I immediately download and read it. One recent paper in this category has the title ‘<a href="https://asistdl.onlinelibrary.wiley.com/doi/abs/10.1002/asi.24398">Do better research engines really equate to better clinical decisions? If not, why not?</a> Since one of the common propositions about search is that it supports better decision making this title immediately caught my attention. </span></p> <p><span>The paper is published in the Journal of the Association for Information Science and Technology but at present has not yet appeared in one of the monthly issues. In the paper <a href="https://scholar.google.com.au/citations?user=3aj36DkAAAAJ&hl=en">Anton van der Vegt</a> and <a href="http://researchers.uq.edu.au/researcher/22857">Guido Zuccon</a> at the University of Queensland together with <a href="https://people.csiro.au/k/b/bevan-koopman">Bevan Koopman (CSIRO)</a> question some of the core beliefs of search performance measurement. Historically this has been measured through an IR systems approach, of which the TREC programs are a good example. The relevance assessments are not conducted by users and there has been a concern for some years about the extent to which these tests translate to a better user search experience. </span></p> <p><span>The methodology used in the project described in this paper was to ask 109 clinicians and final year medical students to answer clinical decisions using two different search applications. One was a very basic BM25 model and the other was a much more sophisticated state-of-the-art application. The decisions were also assessed against a traditional off-line batch test. In all three cases the same test collection was used. </span></p> <p><span>To my surprise the research showed that there was no significant difference between the results from the two search applications. Another outcome of the research project was that half of the clinical decisions were answered incorrectly, which in clinical medicine is not exactly ideal! When the research team considered the relative contribution of search engine effectiveness to the overall end task success they found that the ability to interpret the documents correctly was a much more important factor impacting task success. The analysis showed that searchers could find and view the same relevant documents and come to different conclusions, some correct and some not. </span></p> <p><span>To quote from the conclusions to the paper</span></p> <p><span>“For medical search, this study confirms that providing clinicians with a ranked list of relevant documents is insufficient. To help clinicians to correctly answer more of their questions the IR system may need to help then to interpret information, potentially from within documents and across them. ….The notion of relevance, also, may need to encompass subdocument and cross-document assessment of interpretability”</span></p> <p><span>As with all research papers it is very important not to generalize outcomes from one piece of research (take a look at ‘<a href="https://en.wikipedia.org/wiki/Cold_fusion">cold fusion</a>’ as a warning!) specifically in the clinical domain. I should add that this summary inevitably skates over the considerable amount of detail and statistical validation in the paper. </span></p> <p><span>For me the initial take-aways are that search performance itself does not guarantee that better decisions will be made from documents defined as relevant and that there is considerable scope for better support of interpreting the documents, perhaps by text analytics. It could be that two not-totally relevant documents when considered together could result in a better decision being made by the search user. Hopefully other research teams will take up this research in other subject areas</span></p> <p><span>In a sentence, it is not about information technology or information retrieval but about information management. </span></p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/maximizing-the-success-of-a-b-testing-book-review/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Tue, 01 Sep 2020 11:06:27 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx2jQ4Mh0MovfAho1tj2fTLLkQccVsVQOijcxN9FeuycCmSleVo8bLeH05HjrzQ7bq5pX5yMLi3Wua4D22chzTfkeBucJKv10EazOOi7u_Eikv2v21gqNhxRbr_cAsI2SaFwdk8f16t5ew Maximizing the success of A/B testing – book review https://api.follow.it/track-rss-story-click/j9CZdmKxZx3XEG8ZvpJx8dFAmY8VngmukQccVsVQOijcxN9FeuycCr1u5jw9HX31C-dBM6iO73F39_2ZBlLs0MDWbapeUjOKGE4hXIBKv30dnJm6hNwQA4QeRyGo67dX <img src="https://api.follow.it/rssubscribers/rss_show_story_count/350482602/1768029" border=0 width="1" height="1" alt="Story 350482602" title="Story 350482602"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">Maximizing the success of A/B testing – book review</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p>One of the benefits of web technology is that it is relatively easy to make design changes to a web site or intranet both at the development stage and even when in production. The same is true of course of open source enterprise applications, such as e-commerce and enterprise search. In principle it seems so easy. Measure the performance of Version A, make some changes and then measure the performance of Version B. All you then have to do is compare and implement. Easy!</p> <p>Not according to a recently published book from Cambridge University Press. The full title is <a href="https://www.cambridge.org/gb/academic/subjects/computer-science/knowledge-management-databases-and-data-mining/trustworthy-online-controlled-experiments-practical-guide-b-testing?format=PB">Trustworthy Online Controlled Experiments – A Practical Guide to A/B Testing</a> and the authors are Ron Kohavi, Diane Tang and Ya Xu. The very fact that the book runs to almost 300 pages is an initial indication that A/B testing is not as easy as many might think. The authors have extensive experience from working at Microsoft, Google and LinkedIn and this experience is very visible throughout the book but is coupled with references to around 300 research papers. The blend between authors, and between practice and research, is exemplary in all regards.</p> <p>Part 1 of the book is a general introduction to testing, illustrated with some case studies from Google and Microsoft. Part 2 then goes more deeply into organizational metrics, metrics for experimentation and the overall evaluation criteria, institutional memory and meta-analysis and finally a thoughtful chapter on ethics in controlled experiments.</p> <p>In Part 3 the authors consider complementary techniques and observational causal studies. Part 4 goes into very considerable detail on building an experimentation platform and the book concludes with a 60 page section on advanced topics for analysing experiments. One of the features that intrigued me in the book were the number of named laws, such as Simpson’s Paradox, Goodhart’s Law, Campbell’s Law, the Lucas Critique and Twyman’s Law.</p> <p>The depth and clarity of the exposition on many quite complex issues is exceptional, and this is clearly a direct result of many years of experience and experimentation. However the authors are not prescriptive in setting out a ‘best practice’ testing regime, instead guiding the reader through the decisions they need to make in developing a robust A/B testing programme. It is difficult to see how any other author is going to match this and I would guess that this book is going to be the benchmark title for some years to come. There is an associated <a href="http://experimentguide.com/">web site</a> on which you can currently find a PDF version of Chapter 1. </p> <p>I have just two criticisms of this book. The first is the way that four pages of ‘recommendations’ from the good and the great of the web design world are presented in the front of the book. They are unnecessary and look like a triumph of PR over good editorial judgement. You can only see these recommendations when you have bought the book! The second is that I was also unimpressed with the index, with just a long alphabetical list of topics under the headings of ‘experiments’ and ‘metrics’. They, and some others, are crying out for some clustering of the terms. I would expect better from Cambridge University Press on both counts.</p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/systematic-searching-a-timely-new-book-from-facet-publishing/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Fri, 28 Aug 2020 14:44:09 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx3XEG8ZvpJx8dFAmY8VngmukQccVsVQOijcxN9FeuycCr1u5jw9HX31C-dBM6iO73F39_2ZBlLs0MDWbapeUjOKGE4hXIBKv30dnJm6hNwQA4QeRyGo67dX Systematic Searching – a timely new book from Facet Publishing https://api.follow.it/track-rss-story-click/j9CZdmKxZx3XEG8ZvpJx8ZZ7NgD3ZR0AkQccVsVQOijcxN9FeuycCkHK1SCG6IQsxvhNMtMN7DA98BTzsW7zcIvfTwx16tQwUdHMvnrVK9K2DZUsyBz7rAMComHdTV7K7gFoTsXIF2kOEzcaB5PtRQ <img src="https://api.follow.it/rssubscribers/rss_show_story_count/350482599/1768029" border=0 width="1" height="1" alt="Story 350482599" title="Story 350482599"> <p><div class="et_pb_section et_pb_section_2 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_3"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_3 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_1 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">Systematic Searching – a timely new book from Facet Publishing</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_3 et_section_regular" > <div class="et_pb_row et_pb_row_4"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_4 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_1 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p>Systematic searching emerged from the requirements of evidenced-based medicine To quote from the book, systematic reviews of interventions require a thorough, objective and reproducible search of a range of sources to identify as many relevant studies as possible within resource limits. It is not just about brute-force searching but having the skills to know which sources to search.</p> <p><a href="http://www.facetpublishing.co.uk/title.php?id=303731#.X0kS-chKguU">Systematic Searching – Practical Ideas for Improving Results from Facet Publishing</a> is very timely as the search for solutions to clinical and mental health problems arising from the Covid19 pandemic is going to be with us for some time to come. The book has 16 chapters and runs to over 300 pages. Most (but not all) the authors work in the UK clinical review sector and are clearly writing from the wealth of experience they have acquired over many years of training and practice.</p> <p>To give the titles of just a few of the chapters, they cover</p> <ul> <li>Choosing the right databases and search techniques</li> <li>Social media as a source of evidence</li> <li>Text mining for information specialists</li> <li>Training the next generation of information specialists</li> <li>Collaborative working to improve searching</li> </ul> <p>The authors, editors (Paul Levy and Jenny Craven at NICE) and the Facet production team deserve great credit for achieving a uniformity of writing style and managing to avoid too much duplication between chapters. Also obvious is the passion that the writers have for their subject and for the role of systematic searching in achieving excellence in health care. There is a very good balance between discussing published research and providing insights and advice from being professional systematic searchers. There are over thirty good case studies presented in text boxes and most chapters end with suggestions for further reading and a short bibliography. In most cases there are references to 2018, which is quite an achievement in a book published in 2020. On that basis I will forgive a failure to reference the work of Peter Pirolli and Stuart Card on information foraging in their seminal paper of 1999, a topic that also missed out in a not entirely successful index.</p> <p>I have nothing but praise for this book, which reminds me that search has to deliver in business-critical situations, especially where health care and medical progress are concerned. This book is all about using the technology and does not get deep into discussions about ranking models. In general these searches are being carried out on commercial systems and there is no scope to play games with the back-end code. Even if heath care is not your core interest reading this book will raise questions about whether in general we are putting enough skills and experience to the service of our customers.</p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_5"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_5 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_1 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/managing-enterprise-information/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> <span class="nav-next"> <a href="http://intranetfocus.com/maximizing-the-success-of-a-b-testing-book-review/" rel="next"> <span class="nav-label">Next Post</span><span class="meta-nav"> →</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Fri, 28 Aug 2020 14:30:18 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx3XEG8ZvpJx8ZZ7NgD3ZR0AkQccVsVQOijcxN9FeuycCkHK1SCG6IQsxvhNMtMN7DA98BTzsW7zcIvfTwx16tQwUdHMvnrVK9K2DZUsyBz7rAMComHdTV7K7gFoTsXIF2kOEzcaB5PtRQ Managing Enterprise Information https://api.follow.it/track-rss-story-click/j9CZdmKxZx2e1i5pEWI7Nyrs_uuUixTAkQccVsVQOijcxN9FeuycCmGi56Vp2GWlaLCkN0Mudp6qmH6zFbvVkF6AbH7A1SZytlRKHD-Swlg <img src="https://api.follow.it/rssubscribers/rss_show_story_count/335182721/1768029" border=0 width="1" height="1" alt="Story 335182721" title="Story 335182721"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">Managing Enterprise Information</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p>My new report <a href="http://intranetfocus.com/wp-content/uploads/2020/07/Managing-Enterprise-Information.pdf" rel="attachment wp-att-4766">Managing Enterprise Information</a> [30pp download] illustrates the wide range of factors that should be taken into consideration in managing information in the enterprise. After an introduction about the value of information and about the need to assess information risk there are sections on governance, information behaviours, working in teams, information discovery, knowledge management and records management.</p> <p>The good practice I have seen in the course of my work is presented as fifty recommendations, none of which involve any additional investment in technology.</p> <p>To quote the former US Secretary of Defense Donald Rumsfeld, the greatest challenge that all organisations face is managing known unknowns and unknown unknowns. This will be especially difficult in the post-Covid19 years as organisations cope with achieving more with fewer employees (many of them in different roles and with different responsibilities) and almost certainly a loss of corporate expertise which may not be immediately obvious. </p> <p>Read through this report and tick off how many of the recommendations you have already implemented. Any score less than 50 means that you are at risk of making business-critical decisions during 2020 and 2021 without having the highest quality information available to every employee. Is that a risk that you are prepared to take?</p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/the-search-network-team/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Wed, 08 Jul 2020 12:51:35 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx2e1i5pEWI7Nyrs_uuUixTAkQccVsVQOijcxN9FeuycCmGi56Vp2GWlaLCkN0Mudp6qmH6zFbvVkF6AbH7A1SZytlRKHD-Swlg The Search Network team https://api.follow.it/track-rss-story-click/j9CZdmKxZx2xTg7Vn71-QyfvOxzfDqw1kQccVsVQOijcxN9FeuycCgqm_skDInWHHDDspBgbyoiMBlG0Nb6BduS0w7AbBZjM <img src="https://api.follow.it/rssubscribers/rss_show_story_count/331700071/1768029" border=0 width="1" height="1" alt="Story 331700071" title="Story 331700071"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular" > <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_post_title et_pb_post_title_0 et_pb_bg_layout_light et_pb_text_align_center" > <div class="et_pb_title_container"> <h1 class="entry-title">The Search Network team</h1> </div> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular" > <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_text_align_left et_pb_bg_layout_light"> <div class="et_pb_text_inner"><p>The Search Network is a community of expertise. It was set up in October 2017 by a group of search implementation specialists working in Europe and North America. We have known each other for at least a decade and share a common passion for search that delivers business value. We are increasingly concerned by a focus on search technology by vendors that takes no account of business requirements, implementation challenges and the need for a skilled support team. Search is not a product or a project. It requires an on-going commitment to support changing user and business requirements and to take advantage of enhancements in technology.</p> <p>Members of the Network have web site search, enterprise search and search application development expertise with on-premise, hybrid and cloud implementations. We all work as individuals or micro-companies and have no commercial relationships with any search vendor or implementation partner.</p> <p>The current members of The Search Network are</p> <ul> <li>David Hobbs (Washington DC content audits and content migration)</li> <li>Charlie Hull (Cambridge, UK open source application development)</li> <li>Miles Kehoe (San Francisco, USA, strategy, implementation and recruitment)</li> <li>Helen Lippell (London, UK taxonomy development)</li> <li>Agnes Molnar (Budapest, Hungary Microsoft 365 search)</li> <li>Eric Pugh (Virginia, USA open source application development)</li> <li>Doug Turnbull (Virginia, USA, open source application development)</li> <li>Cedric Ulmer (Nice, France open source enterprise search applications)</li> <li>Martin White (Horsham UK, strategy, search application selection, implementation and evaluation)</li> </ul> <p>The Search Network is an informal community, not a hub-and-spoke network. You can talk to any one of the members and they can bring in others as appropriate. We look forward to helping you achieve search excellence.</p> <p>Martin White</p> <p> </p></div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/information-workarounds-do-you-know-if-you-have-any/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Fri, 26 Jun 2020 10:41:26 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx2xTg7Vn71-QyfvOxzfDqw1kQccVsVQOijcxN9FeuycCgqm_skDInWHHDDspBgbyoiMBlG0Nb6BduS0w7AbBZjM Information workarounds –do you know if you have any? https://api.follow.it/track-rss-story-click/j9CZdmKxZx0t6bN5pd4E5HqTIU2vqFO2kQccVsVQOijcxN9FeuycCgDpPovPUn8FqMF4uY37PPUtYeXYKreRzsBlTULIxxEILame0fL96yWViRl41R4qy5cvuejFq5H9D4ICh4OkP4M <img src="https://api.follow.it/rssubscribers/rss_show_story_count/325077108/1768029" border=0 width="1" height="1" alt="Story 325077108" title="Story 325077108"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular"> <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child et_pb_column_empty"> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular"> <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_bg_layout_light et_pb_text_align_left"> <div class="et_pb_text_inner"> <p><span>One of the many pleasures of intranet consultancy is that you get to meet employees who are keen to tell stories (always constructively) about their work and what they need in the way of information. It does not take long to discover that they have evolved workarounds to improve the way that information flows around the organisation. In general the more digitally skilled they are and the more they want to make a contribution to the organisation the more likely it is that workarounds are going to emerge. </span></p> <p><span>In theory enterprise application workarounds are not acceptable. After all business analysts have worked diligently for many months to define tasks and workflows. That is often the origination of a workaround. All was fine at the requirements definition stage but a year later when the application is being implemented experience and/or sanity have resulted in a changed process. Indeed it is not uncommon for the process change to be agreed without the implications on the enterprise application being worked through. A good example of a workaround is with collaboration applications. In one client SAPJam was the default collaboration platform but Marketing and Sales wanted a specific functionality and implemented Slack in parallel. </span></p> <p><span>Why am I blogging about information workarounds? It is very likely that organisations (<a href="https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3580367">even the UK Courts</a>) will have developed these workarounds in order to keep going through the pandemic. Some of the workarounds may end up being adopted because of the efficiency gains. The issue is whether the culture of the organisation is such that a) staff feel about to report these workarounds and b) there is a process to assess and possibly validate these as the new normal. They could be one of the few benefits to emerge from the last few months of lockdown. </span></p> <p><span>If you want to learn more about why workarounds are developed there is no better place to start than a <a href="http://phd.lib.uni-corvinus.hu/772/2/Bartis_Eszter_den.pdf">PhD thesis</a> [download] by Eszter van der Schaft – Bartis from the Corvinus University, Budapest. She has developed a typology for workarounds. The categories were bypassing routines, substituting routines, complementing routines and data manipulation. A 2014 paper on a <a href="https://repository.usfca.edu/at/40/">theory of workarounds</a> is more interesting than the title might suggest. </span></p> <p>Martin White</p> <p> </p> </div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/a-history-of-enterprise-search-1948-2020/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Thu, 04 Jun 2020 16:29:23 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx0t6bN5pd4E5HqTIU2vqFO2kQccVsVQOijcxN9FeuycCgDpPovPUn8FqMF4uY37PPUtYeXYKreRzsBlTULIxxEILame0fL96yWViRl41R4qy5cvuejFq5H9D4ICh4OkP4M A history of enterprise search 1948 – 2020 https://api.follow.it/track-rss-story-click/j9CZdmKxZx3s_HM2JcTWLUcZapNp-6pZkQccVsVQOijcxN9FeuycCvHMAoum_a2gE1-YwLFrIoWQkujRxo-AtylRYmELFX9ttMs6rjUG9Pe57K9xsRIZYw <img src="https://api.follow.it/rssubscribers/rss_show_story_count/322778751/1768029" border=0 width="1" height="1" alt="Story 322778751" title="Story 322778751"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular"> <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child et_pb_column_empty"> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular"> <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_bg_layout_light et_pb_text_align_left"> <div class="et_pb_text_inner"> <p> </p> <p><span>The potential requirement for being able to search collections of documents can be traced back to a conference organized by the Royal Society in 1948. The first technical step was set out in a Masters thesis submitted to MIT in 1951 by Philip Bagley and entitled ‘Electronic digital machines for high-speed information searching’. Arguably this marked the start of enterprise search development. The pace of development in the 1950s and 1960s was very rapid, and by the 1970s the core features of an enterprise search application had been firmly established. A directory published by the National Bureau of Standards in 1974 lists almost 50 vendors but most of these ran on dedicated mainframe and mini-computers. The first software application products targeted specifically at a networked enterprise were released in in the mid-1980s. </span></p> <p><span>Technical progress in the 1990s was significant and many specialized enterprise search vendors were established. Getting the message of the benefits of investing in enterprise search across to IT managers proved to be very difficult and many of even the most innovative vendors either closed down or were acquired. Those that flourished then became acquisition targets for global IT companies from 2007 onwards. Nevertheless, there are still around 50 vendors active in the market. </span></p> <p><span>This 17page narrative chronology is a personal view of the development of enterprise search. The list of <a href="http://arnoldit.com/wordpress/wizards-index/">Wizards</a>, the innovators in enterprise and web search compiled by Stephen Arnold, well illustrates the scale of the enterprise search business over the last three decades. A <a href="http://intranetfocus.com/resources/reports/">History of Enterprise Search</a> complements this resource and provides links to a wide range of documents and research papers. The report also lists out the sources used in its preparation. Information about errors, ommissions and additional sources would be appreciated. </span></p> <p>Martin White</p> <p> </p> </div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/search-research-note-sr3-impact-of-dyslexia-on-web-application-accessibility/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Wed, 27 May 2020 10:36:25 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx3s_HM2JcTWLUcZapNp-6pZkQccVsVQOijcxN9FeuycCvHMAoum_a2gE1-YwLFrIoWQkujRxo-AtylRYmELFX9ttMs6rjUG9Pe57K9xsRIZYw Search Research Note SR3 – impact of dyslexia on web application accessibility https://api.follow.it/track-rss-story-click/j9CZdmKxZx1d3iLdwK9DqW5Savqx3kfokQccVsVQOijcxN9FeuycCrzcZrBy6MySGZoXUKYbkr2nllXpA97YZvH1c0P0Y4pRQRpJ9lazqHzCyyXtIQH3iOLfe0u9-YCvrXYsHAkt4WbrCD64iuYLX-2ot2Wr2iWIXkp9jc-iN4g <img src="https://api.follow.it/rssubscribers/rss_show_story_count/320400902/1768029" border=0 width="1" height="1" alt="Story 320400902" title="Story 320400902"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular"> <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child et_pb_column_empty"> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular"> <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_bg_layout_light et_pb_text_align_left"> <div class="et_pb_text_inner"> <p>For many years now web interface designers have taken care to support employees who have a range of physical and visual conditions that have an impact on the extent to which they can use a computer interface effectively. Most designers are conversant with the <a href="https://www.w3.org/WAI/">Web Accessibility Initiative</a> provisions though even though there are often indications that design has triumphed over accessibility.</p> <p> Employees with these physical and visual conditions are inevitably visible in the office environment. In the case of open plan offices this visibility may in fact be a challenge and not be conducive to their well-being. We ourselves can have some sense of the challenges a blind or partially sighted employee must have, or someone with poor motor control in their hands. Try using a mouse wearing gardening gloves!</p> <p> The condition that is totally invisible is dyslexia, often given the unfortunate description of ‘word blindness’. Dyslexia is a cognitive spectrum condition that could affect more than 1 in 10 employees. A ‘spectrum condition’ is because there is wide variation in the type and severity of symptoms people experience. This also makes it very difficult to recognise and diagnose because people with the condition have no baseline of ‘normal’ against which to compare their own experience</p> <p> It is quite common for people to conceal the extent of their dyslexia as it still has connotations of being stupid and slow to learn. It is also very difficult for people without the condition to imagine what it must be like. There are some <a href="http://www.dailymail.co.uk/sciencetech/article-3480257/What-s-REALLY-like-read-dyslexia-Simulator-reveals-letters-words-appear-people-condition.html">simulations of dyslexia</a> which given at least an initial impression but cannot reproduce the frustrations that people with the condition must have to cope with.</p> <p>This is especially concerning when it comes to social media, which may well be seen as unsocial media by employees who have some form of dyslexia. I am including collaboration applications in this category. Organisations increasingly rely on social networks to link Work From Home employees together without considering the challenges that dyslexia causes in contributing to social media and also understanding its fragmented language and organisational jargon.</p> <p>Finding technical solutions is not easy because it is a spectrum condition and some employees may just have a problem with a certain font or colour contrast. Others will find it almost impossible to comprehend written text. Many will find workarounds to a particular design or font and are then thrown a very difficult situation when the font of (say) an intranet is changed without any thought about the implications for these employees.</p> <p> <span style="font-size: 19px;">Working at home may well be even more stressful for employees with dyslexia that in the office because of the pressure they may well feel of being under pressure to maintain productivity. In the office they can meet up with either someone from HR or with a mentor, to talk through a problem they face, or frankly just to talk to someone. We are now seeing a trend towards employees spending more time working from home in the future. It will become ‘the way of working’ for a much greater number of employees, but remember that at least 1 in 10, and it may be more, is somewhere on the dyslexia spectrum.</span></p> <p>I have listed out a range of research papers on web accessibility, and in particular the impact on searching, in a recent <a href="https://www.linkedin.com/pulse/working-from-home-impact-dyslexia-martin-white/">LinkedIn post</a>. Most, but sadly not all, are open access. </p> <p><span><a href="https://eprints.qut.edu.au/79704/"></a></span></p> <p>Martin White</p> <p> </p> </div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/usability-testing-a-practitioners-guide-to-evaluating-the-user-experience-morten-hertzum/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Mon, 18 May 2020 15:22:11 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx1d3iLdwK9DqW5Savqx3kfokQccVsVQOijcxN9FeuycCrzcZrBy6MySGZoXUKYbkr2nllXpA97YZvH1c0P0Y4pRQRpJ9lazqHzCyyXtIQH3iOLfe0u9-YCvrXYsHAkt4WbrCD64iuYLX-2ot2Wr2iWIXkp9jc-iN4g ‘Usability Testing – A Practitioner’s Guide to Evaluating the User Experience’ – ... https://api.follow.it/track-rss-story-click/j9CZdmKxZx3qITSzPDyGyEL6p-ZSsK66kQccVsVQOijcxN9FeuycCiRWexW2m8VceiA_z3Gse6lIPDHp2KnWc3fNwFIN0OS5nVPs9PPU6r2Vx-x95sMnNItpfzNNVMt2be2wsKfDsqqFufJyKuJGuobRksT0zfWMwTe5In09KMlLUVLjEDmIKg <img src="https://api.follow.it/rssubscribers/rss_show_story_count/315381428/1768029" border=0 width="1" height="1" alt="Story 315381428" title="Story 315381428"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular"> <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child et_pb_column_empty"> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular"> <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_bg_layout_light et_pb_text_align_left"> <div class="et_pb_text_inner"> <p><span>Over the years there have been many books written on usability testing. <a href="https://www.interaction-design.org/literature/article/don-t-make-me-think-key-learning-points-for-ux-design-for-the-web">‘Don’t make me think’</a> by Steve Krug was my starting point for many years and my copy has quite an array of highlighting and comment. In addition, the work of the <a href="https://www.nngroup.com/">Nielsen Norman Group</a> has been outstanding in raising the issues of usability and providing solutions. More recently I have suggested that usability is so important that we should start with the proposed user interface and then <a href="https://www.cmswire.com/information-management/enterprise-search-development-start-with-the-user-interface/">work backwards</a> to see what really does need to be presented, and how.</span></p> <p><span>I was therefore delighted to come across a new book from <a href="http://mortenhertzum.dk/publ.html">Morten Hertzum</a> , Professor of Information Science at the University of Copenhagen. ‘Usability Testing – A Practitioner’s Guide to Evaluating the User Experience’ that has just been published by <a href="https://www.morganclaypoolpublishers.com/catalog_Orig/product_info.php?cPath=22&products_id=1514&series=30">Morgan and Claypool.</a> This book is like no other that I have come across on this topic in that Professor Hertzum bases his text on the wealth of academic (usually) research that has been carried out over the last couple of decades in human-computer interaction, citing around 200 research papers and reports in the process. </span></p> <p><span>The topics covered in the book are </span></p> <ul> <li><span>Usability and the User Experience</span></li> <li><span>Testing: Maxims and Modifications</span></li> <li><span>Usability Testing: Step by Step</span></li> <li><span>Preparations: Designing and Planning the Test</span></li> <li><span>Execution: Running the Test Session</span></li> <li><span>Analysis: Analyzing the Data and Reporting the Findings</span></li> <li><span>Variations and Alternatives</span></li> </ul> <p><span>The final chapter includes (for example) remote and unmoderated usability tests and pairwise usability tests. </span></p> <p><span>The book is only 103 pages long but packs a wealth of information and commentary into this relatively short book. The author sets out to balance what are often conflicting views on how these tests should be designed and undertaken, adding in his own opinions based on many years of work in this area. It may come as a surprise to many readers that often inspiring authors of other books on this topic present their own views based on their personal experience. Valuable though this can be, seeing alternate views can also be very valuable. </span></p> <p><span>Your initial reaction to a book written by an academic might be that the writing style will be academic and without access to the original research the book will have little value to the practitioner. Nothing could be farther from the truth. I felt that the author was talking to me and not preaching to me, and that there is enough extraction of the core elements of the research not to need to track down the research papers that have been cited. There are many checklists and call-out summaries that can be used without any recourse to the original research. </span></p> <p><span>My only (but major) concern in recommending the book is that there is no discussion about accessibility, a subject that still has not had the attention that it deserves. This book does nothing to improve this situation. See for example a <a href="http://www.cs.nott.ac.uk/~pszsr/files/reyes-cruz-2020-disability-as-competency.pdf">recent paper</a> [pdf] by a team from the Mixed Reality Laboratory, Department of Computer Science, University of Nottingham and <a href="https://interactions.acm.org/archive/view/march-april-2019/disability-interaction-dix">Disability Interaction (DIX): A Manifesto</a>. </span></p> <p><span>To me the core benefit of the approach is that Professor Hertzum presents me with evidence to which I can then add my own interpretation. You can see for yourself from a <a href="http://mortenhertzum.dk/publ/M&C2020_Ch1.pdf">free download of Chapter 1</a>. A look through the author’s list of publications will give you a good sense of the depth of his expertise in this area. Intriguingly both Morten Hertzum and Jakob Nielsen are Danish. </span></p> <p><span>The print version of the book is currently $39.95 and the e-book pdf is $31.96. The publishers also offer various packages and it is well worth looking through other books in the Human-Centered Informatics series. </span></p> <p>Martin White</p> <p> </p> </div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/time-well-spent-a-potential-holistic-view-of-productivity/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Wed, 29 Apr 2020 12:57:48 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx3qITSzPDyGyEL6p-ZSsK66kQccVsVQOijcxN9FeuycCiRWexW2m8VceiA_z3Gse6lIPDHp2KnWc3fNwFIN0OS5nVPs9PPU6r2Vx-x95sMnNItpfzNNVMt2be2wsKfDsqqFufJyKuJGuobRksT0zfWMwTe5In09KMlLUVLjEDmIKg "Time Well Spent”– a potential holistic view of productivity https://api.follow.it/track-rss-story-click/j9CZdmKxZx3YTlbJXDvTIaNW1EZfM9drkQccVsVQOijcxN9FeuycCvVfTGu4WpWIuhQSUURkWig6rE5KKqoCXZ3fKIyH0U3u4MPwtx-QUSe_-V2Ktgk89lhJ6v_cf2xG3GG6-4CMbi8 <img src="https://api.follow.it/rssubscribers/rss_show_story_count/314777645/1768029" border=0 width="1" height="1" alt="Story 314777645" title="Story 314777645"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular"> <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child et_pb_column_empty"> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular"> <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_bg_layout_light et_pb_text_align_left"> <div class="et_pb_text_inner"> <p><span>I have written quite a <a href="https://www.linkedin.com/pulse/microsoft-research-productivity-martin-white/" target="_blank" rel="noopener noreferrer">detailed commentary</a> on some of the research that has been carried out by Microsoft Research into defining, measuring and enhancing productivity. One of the problems with assessing productivity in knowledge work is that the number of items produced in a day is not necessarily a reflection of their value to the operational success of the organisation. In the current Covid situation there will be pressure on distributed employees to create as many documents as possible to show that they are ‘working hard’ even though they are not in the office. Whether they are also generating documents of information and knowledge value will only emerge in the future. </span></p> <p><span>In the case of search applications in particular there has always been an unhelpful metric about the time spent searching which dates back to some comments made in a conference paper presented at the International Conference on the Social Impact of Information Technologies in St. Louis, Missouri, October 12–14, 1998. The study by Kit Sims Taylor found that knowledge workers spend more time unwittingly recreating existing knowledge than in creating new knowledge. This was a very small-scale survey and was the basis for the scenarios used in the 2001 IDC briefing paper on The High Cost of Not Finding Information. The outcomes of these scenarios have been used ever since by search vendors seeking to present a business case for their software. When they do ask them if they have actually read the 1998 paper! </span></p> <p><span>I was therefore delighted to see a conference paper to the CHI (ACM Human Factors in Computing Systems) 2020 conference by Hayley Gillou and her colleagues at the University of British Columbia and the University of Zurich. In this paper the authors present the concept of Time Well Spent (TWS) as a holistic view of performance of a knowledge worker. (There are in fact two versions of the Gillou paper. The CHI conference paper can be downloaded from the <a href="https://www.merlin.uzh.ch/publication/show/19139">University of Zurich</a> but I would also advise you to read the <a href="https://open.library.ubc.ca/cIRcle/collections/ubctheses/24/items/1.0389624">MSc thesis</a> of Hayley Gillou which at 130pp does not add to the outcomes of the CHI paper but does contain all the survey methodology.) </span></p> <p><span>The concept dates back to a <a href="https://www.ted.com/talks/tristan_harris_how_better_tech_could_protect_us_from_distraction">TEDx talk by Ted Harris</a> in 2014 and some previous work undertaken by <a href="https://terpconnect.umd.edu/~choe/download/CHI-2019-Kim-Productivity.pdf">Young-Ho Kim and colleagues</a> [pdf download]. They found six themes that characterize the productivity assessment—work product, time management, worker’s state, attitude toward work, impact & benefit, and compound task—and identified how participants interleaved multiple facets when assessing their productivity. This lies at the very core of the both the definition and measurement issues – ‘productivity’ has these multiple dimensions and all need to be addressed in arriving at solutions. </span></p> <p><span>The Gillou study looks at the challenges of measuring Time Well Spent and reports on a small-scale investigation. The authors are careful not to overstate either the value of TWS or the scalability of the technique. In my view this is an approach that is well worth considering not just as as a potential research opportunity but as the basis for internal discussions around prodcutivity measures. The concept links well to <a href="http://intranetfocus.com/resources/reports/" target="_blank" rel="noopener noreferrer">search satisfaction</a>, and how stopping distances for search results examination are a trade-off between value and effort. The effort is not just a time parameter but of the intellectual element of constructing and revising the query and working through perhaps poor-quality snippets of document results. </span></p> <p>Martin White</p> <p> </p> </div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/enterprise-search-and-ai-better-together/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Mon, 27 Apr 2020 15:09:13 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx3YTlbJXDvTIaNW1EZfM9drkQccVsVQOijcxN9FeuycCvVfTGu4WpWIuhQSUURkWig6rE5KKqoCXZ3fKIyH0U3u4MPwtx-QUSe_-V2Ktgk89lhJ6v_cf2xG3GG6-4CMbi8 Enterprise search and AI – better together? https://api.follow.it/track-rss-story-click/j9CZdmKxZx2ZA--V_WhK_bVQ-WxLeKG4kQccVsVQOijcxN9FeuycCsTtblUQTNUXQXsH9rc2Gd4Ba2Ma8DeH_RCGA3YwmAl1NWZVZ3Xayo98W-uS6BLqaA <img src="https://api.follow.it/rssubscribers/rss_show_story_count/307999761/1768029" border=0 width="1" height="1" alt="Story 307999761" title="Story 307999761"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular"> <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child et_pb_column_empty"> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular"> <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_bg_layout_light et_pb_text_align_left"> <div class="et_pb_text_inner"> <p><span>The structural dynamics of the enterprise search business are very complex. Over <a href="http://intranetfocus.com/vendors/">50 companies</a> offer enterprise search-level software and in addition there are the embedded search applications in a range of enterprise applications (e.g. IBM, Microsoft and OpenText) and a thriving open source community. In addition, there are specialist search systems integrators, and companies such as Basis Technology offering specialized modules. </span></p> <p><span>Gartner, Forrester and other consultancies only look at a limited number of market leaders. There has been no large-scale study of the sector that takes into account both technology development (especially AI and NLP) and the emerging clarity about <a href="https://www.cmswire.com/information-management/diving-into-enterprise-search-query-logs/">how employees use search applications</a>. Over the last couple of years ‘<a href="http://intranetfocus.com/search-research-note-sr2-professional-search/">professional search’</a> has emerged as requiring specialized applications and user interfaces. The development of the Complex Searcher Model and work on <a href="https://www.cmswire.com/information-management/the-scent-of-a-good-search/">information foraging</a> are both very helpful approaches to optimizing enterprise search.</span></p> <p><span>I am delighted to announce that the first outcome of a partnership between Intranet Focus Ltd and Alan Pelz-Sharpe and his colleagues at <a href="https://www.deep-analysis.net/">Deep Analysis</a> has now been published. This research note is entitled <a href="https://www.deep-analysis.net/report/enterprise-search-and-ai-better-together/">Enterprise Search and AI – better together?</a> The Deep Analysis team track developments in the enterprise IT sector and they have a very good understanding of <a href="https://www.deep-analysis.net/media/">the role that AI can play</a>. I bring to the team two decades of experience in enterprise and intranet search implementation and a significant collection of documents from academic research teams around the world. In the first week of the report being available it has been downloaded over 150 times. I am not going to try and summarise it as there is a lot of information and insight in the 5 page document. </span></p> <p><span>This is the first report from our collaboration. We are now working on a large-scale project that will be of value to search vendors in shaping their technical and marketing roadmaps and to major corporate users of search applications who will (we are certain) be looking to invest significantly in search applications for 2021 and beyond based on the lessons they are already learning from how distributed working is changing the way in which information is discovered and used. As with all business sectors the enterprise search community is having to cope with significant short-term problems (especially in being on-site for implementation support) and looking ahead to what the market landscape might be later this year.</span></p> <p><span>If you would like to keep in touch with our plans for the sector please contact either<a href="https://www.deep-analysis.net/the-team/"> Alan</a> (based in the USA) or <a href="mailto:[email protected]">me</a> (based in the UK). There will be opportunities for individual companies to have company-specific information and advice from the research we are undertaking. </span></p> <p>Martin White</p> <p> </p> </div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/enterprise-search-experience-esearchx/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Tue, 31 Mar 2020 14:30:56 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx2ZA--V_WhK_bVQ-WxLeKG4kQccVsVQOijcxN9FeuycCsTtblUQTNUXQXsH9rc2Gd4Ba2Ma8DeH_RCGA3YwmAl1NWZVZ3Xayo98W-uS6BLqaA Enterprise Search Experience – #ESearchX https://api.follow.it/track-rss-story-click/j9CZdmKxZx21RzHw5yS0XaF_UNz-OxCOkQccVsVQOijcxN9FeuycCsTtblUQTNUXQXsH9rc2Gd7p7YsWhl7R2UFFFowWdXRTQgPYwQiJvg-f6RQXnL0yQQ <img src="https://api.follow.it/rssubscribers/rss_show_story_count/305548358/1768029" border=0 width="1" height="1" alt="Story 305548358" title="Story 305548358"> <p><div class="et_pb_section et_pb_section_0 et_pb_with_background et_section_regular"> <div class="et_pb_row et_pb_row_0"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_0 et_pb_css_mix_blend_mode_passthrough et-last-child et_pb_column_empty"> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --><div class="et_pb_section et_pb_section_1 et_section_regular"> <div class="et_pb_row et_pb_row_1"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_1 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_module et_pb_text et_pb_text_0 et_pb_bg_layout_light et_pb_text_align_left"> <div class="et_pb_text_inner"> <p><span>Over the last decade of enterprise search projects, the project objectives have changed from “Help us chose a search application” to “How can we get the best out of our current application?”. As an information scientist my focus has always been on the user experience, going back into the technology only as far as it needed to understand the opportunities and challenges of delivering a good search experience. For some years now I have been working with <a href="https://www.sheffield.ac.uk/is/staff/clough">Professor Paul Clough</a> at the Information School at the University of Sheffield on the development of a search evaluation methodology. It has turned out to be a very considerable challenge. My launch of <a href="http://intranetfocus.com/enterprise-search-consulting-services/">SearchCheck</a> as a search evaluation methodology is qualitative solution even though based around scoring; both Paul and I were (and indeed are!) looking for something more quantitative and robust. </span></p> <p><span>In parallel I have been paying much more attention to user interfaces and trying to understand how enterprise search users search. You can see this trend in my <a href="https://www.cmswire.com/author/martin-white/">CMSWire columns</a>. This interest is also why I published <a href="http://intranetfocus.com/wp-content/uploads/2018/10/Achieving-enterprise-search-satisfaction-Oct-2018.pdf">Achieving Enterprise Search Satisfaction</a> in 2018 around an eight-point strategy on improving search satisfaction. The problem remains as to how we measure search satisfaction. </span></p> <p><span>Listening to James Robertson (Step Two Designs) talk about the <a href="https://www.steptwo.com.au/columntwo/dex-the-way-ahead-presentation-at-intrateam-copenhagen-march-2020/">Digital Employee Experience (DEX)</a> at the IntraTeam Event in Copenhagen in early March started me thinking about the role of search in this Experience. At present search does not get a specific mention in the many blogs and reports on DEX and I’ve decided that the time has come to put enterprise search (in its widest definition as a search environment) into more of a spotlight. </span></p> <p><span>So what is the basis of a ‘Enterprise Search Experience’? As a work-in-progress statement it is to ensure that the value of the results obtained balances with the effort required to find them. There is good evidence to suggest that users stop searching when they feel that the effort to continue will not result in further relevant results. This is defined as the <a href="https://core.ac.uk/download/pdf/42366798.pdf">stopping point</a> in a search session. Attaining a high search experience is not necessarily about being able to deliver results in a single session. A good experience might be to be able to store both the query history in stages and the results obtained at each stage. (This was a key feature of the online search services developed in the 1970s!) </span></p> <p><span>I am now suggesting #ESearchX as a useful Twitter tag for research, outcomes and comments on </span></p> <ul> <li><span>User requirements definitions</span></li> <li><span>User interface design</span></li> <li><span>Usability testing</span></li> <li><span>Accessibility</span></li> <li><span>Metrics and feedback</span></li> </ul> <p><span>These are not exclusive topics but an illustration of what I see as the scope of #ESearchX. Content quality in particular has a major impact on the quality of search results but improving content quality has to be an information management issue, not just a search performance issue. </span></p> <p><span>I would welcome comments on the position I am taking on #ESearchX. I should add that not only was #ESX already taken and I wanted a tag that was more visibly about search. </span></p> <p>Martin White</p> <p> </p> </div> </div> <!-- .et_pb_text --> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --><div class="et_pb_row et_pb_row_2"> <div class="et_pb_column et_pb_column_4_4 et_pb_column_2 et_pb_css_mix_blend_mode_passthrough et-last-child"> <div class="et_pb_with_border et_pb_module et_pb_post_nav_0 et_pb_posts_nav nav-single"> <span class="nav-previous"> <a href="http://intranetfocus.com/search-research-note-sr2-professional-search/" rel="prev"> <span class="meta-nav">← </span><span class="nav-label">Previous Post</span> </a> </span> </div> </div> <!-- .et_pb_column --> </div> <!-- .et_pb_row --> </div> <!-- .et_pb_section --></p> Fri, 20 Mar 2020 10:04:24 GMT https://api.follow.it/track-rss-story-click/j9CZdmKxZx21RzHw5yS0XaF_UNz-OxCOkQccVsVQOijcxN9FeuycCsTtblUQTNUXQXsH9rc2Gd7p7YsWhl7R2UFFFowWdXRTQgPYwQiJvg-f6RQXnL0yQQ
|
{
"url": "https://follow.it/intranet-focus-intranet-strategy-and-management",
"source_domain": "follow.it",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "143345",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JGPBCBO55XHYQOFG5H244YQ45JMPPSQF",
"WARC-Concurrent-To": "<urn:uuid:57c61c6a-72a5-446d-974a-91b293048120>",
"WARC-Date": "2020-10-28T03:08:27Z",
"WARC-IP-Address": "172.67.70.121",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:SLU243GSFWNAPWNPAR3J72MT5MTKNJEI",
"WARC-Record-ID": "<urn:uuid:648ba3ca-bcda-47f0-8ab6-0341e1844d5c>",
"WARC-Target-URI": "https://follow.it/intranet-focus-intranet-strategy-and-management",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:08f373aa-198b-4a57-b2e0-72c2e48b0586>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-44.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
114477
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 114477,
"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.27504807710647583,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010447629727423191,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31290435791015625,
"rps_doc_frac_unique_words": 0.2053287923336029,
"rps_doc_mean_word_length": 6.818758964538574,
"rps_doc_num_sentences": 927,
"rps_doc_symbol_to_word_ratio": 0.0010928499978035688,
"rps_doc_unigram_entropy": 6.325578212738037,
"rps_doc_word_count": 12911,
"rps_doc_frac_chars_dupe_10grams": 0.24398832023143768,
"rps_doc_frac_chars_dupe_5grams": 0.2654111385345459,
"rps_doc_frac_chars_dupe_6grams": 0.25684654712677,
"rps_doc_frac_chars_dupe_7grams": 0.25364336371421814,
"rps_doc_frac_chars_dupe_8grams": 0.25075820088386536,
"rps_doc_frac_chars_dupe_9grams": 0.24561263620853424,
"rps_doc_frac_chars_top_2gram": 0.005111489910632372,
"rps_doc_frac_chars_top_3gram": 0.02044595032930374,
"rps_doc_frac_chars_top_4gram": 0.01567522995173931,
"rps_doc_books_importance": -9644.4345703125,
"rps_doc_books_importance_length_correction": -9644.4345703125,
"rps_doc_openwebtext_importance": -5863.58642578125,
"rps_doc_openwebtext_importance_length_correction": -5863.58642578125,
"rps_doc_wikipedia_importance": -4094.67919921875,
"rps_doc_wikipedia_importance_length_correction": -4094.67919921875
},
"fasttext": {
"dclm": 0.01822572946548462,
"english": 0.8004696369171143,
"fineweb_edu_approx": 1.6009924411773682,
"eai_general_math": 0.11066920310258865,
"eai_open_web_math": 0.20221447944641113,
"eai_web_code": 0.2761341333389282
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.4038",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"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
|
-6,900,774,151,996,758,000 |
Warning: this is an htmlized version!
The original is across this link,
and the conversion rules are here.
#######
#
# E-scripts on reSructuredText (i.e., the ".rst" format).
#
# Note 1: use the eev command (defined in eev.el) and the
# ee alias (in my .zshrc) to execute parts of this file.
# Executing this file as a whole makes no sense.
#
# Note 2: be VERY careful and make sure you understand what
# you're doing.
#
# Note 3: If you use a shell other than zsh things like |&
# and the for loops may not work.
#
# Note 4: I always run as root.
#
# Note 5: some parts are too old and don't work anymore. Some
# never worked.
#
# Note 6: the definitions for the find-xxxfile commands are on my
# .emacs.
#
# Note 7: if you see a strange command check my .zshrc -- it may
# be defined there as a function or an alias.
#
# Note 8: the sections without dates are always older than the
# sections with dates.
#
# This file is at <http://angg.twu.net/e/rst.e>
# or at <http://angg.twu.net/e/rst.e.html>.
# See also <http://angg.twu.net/emacs.html>,
# <http://angg.twu.net/.emacs[.html]>,
# <http://angg.twu.net/.zshrc[.html]>,
# <http://angg.twu.net/escripts.html>,
# and <http://angg.twu.net/>.
#
#######
# «.python-docutils» (to "python-docutils")
# «.emacs» (to "emacs")
# (find-es "python" "rst")
# (find-es "python" "numpy")
#####
#
# The "python-docutils" Debian package
# 2013may13
#
#####
# «python-docutils» (to ".python-docutils")
# (find-zsh "dmissing rst2latex")
# (find-status "python-docutils")
# (find-vldifile "python-docutils.list")
# (find-udfile "python-docutils/")
# (find-udfile "python-docutils/docs/howto/")
# (find-udfile "python-docutils/docs/user/")
# (find-udfile "python-docutils/docs/user/rst/")
# (find-udfile "python-docutils/docs/user/rst/quickstart.txt.gz")
#####
#
# Emacs support
# 2013may13
#
#####
# «emacs» (to ".emacs")
# (find-angg ".emacs" "rst-mode")
# (find-efile "textmodes/rst.el")
# (find-efile "textmodes/rst.el" "rst-faces")
# (find-fline "/usr/share/emacs/site-lisp/rst.el")
# http://docutils.sourceforge.net/rst.html
# http://docutils.sourceforge.net/docs/user/emacs.html
# (find-efaces "rst-adornment")
# (find-eface-links 'rst-level-1-face)
# (find-eface-links 'rst-level-2-face)
# (find-efile "textmodes/rst.el" "defface rst-level-1")
# Orig:
# (set-face-background 'rst-level-1-face "grey85")
# (set-face-background 'rst-level-2-face "grey78")
(defun my-rst-faces () (interactive)
(set-face-background rst-level-1-face "grey15")
(set-face-background rst-level-2-face "grey22")
(set-face-background rst-level-3-face "grey29")
(set-face-background rst-level-4-face "grey36")
(set-face-background rst-level-5-face "grey43")
(set-face-background rst-level-6-face "grey50"))
# Local Variables:
# coding: raw-text-unix
# ee-delimiter-hash: "\n#*\n"
# ee-delimiter-percent: "\n%*\n"
# ee-anchor-format: "«%s»"
# End:
|
{
"url": "http://angg.twu.net/e/rst.e.html",
"source_domain": "angg.twu.net",
"snapshot_id": "crawl=CC-MAIN-2018-22",
"warc_metadata": {
"Content-Length": "5216",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GQ6G65LPMGTVEAXJE2VTQWMAETLTUJ66",
"WARC-Concurrent-To": "<urn:uuid:d5c88739-72c7-4134-9cfd-bcf22ead808f>",
"WARC-Date": "2018-05-25T09:09:38Z",
"WARC-IP-Address": "66.135.44.32",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OCMWOPUT4XZAJM5SVOBPCIFAQMFHGWSV",
"WARC-Record-ID": "<urn:uuid:f546fb27-ba11-4fc3-8f7e-dfb4c81e7ce7>",
"WARC-Target-URI": "http://angg.twu.net/e/rst.e.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:28b044ff-f252-47df-aee3-c7c7644d798b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-146-108-157.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
38,
72,
107,
115,
117,
175,
177,
235,
292,
341,
343,
403,
419,
421,
480,
514,
516,
548,
550,
612,
628,
630,
696,
706,
708,
773,
819,
821,
884,
907,
909,
957,
1011,
1063,
1118,
1173,
1228,
1270,
1272,
1280,
1281,
1282,
1283,
1284,
1328,
1353,
1354,
1355,
1382,
1411,
1412,
1413,
1414,
1415,
1421,
1423,
1462,
1474,
1476,
1482,
1483,
1527,
1561,
1597,
1638,
1675,
1721,
1766,
1815,
1881,
1882,
1883,
1884,
1885,
1891,
1893,
1909,
1921,
1923,
1929,
1930,
1954,
1988,
2022,
2068,
2119,
2162,
2217,
2249,
2288,
2327,
2383,
2384,
2392,
2443,
2494,
2495,
2532,
2582,
2632,
2682,
2732,
2782,
2833,
2834,
2835,
2836,
2837,
2838,
2839,
2840,
2841,
2842,
2843,
2863,
2902,
2936,
2970,
3002
],
"line_end_idx": [
38,
72,
107,
115,
117,
175,
177,
235,
292,
341,
343,
403,
419,
421,
480,
514,
516,
548,
550,
612,
628,
630,
696,
706,
708,
773,
819,
821,
884,
907,
909,
957,
1011,
1063,
1118,
1173,
1228,
1270,
1272,
1280,
1281,
1282,
1283,
1284,
1328,
1353,
1354,
1355,
1382,
1411,
1412,
1413,
1414,
1415,
1421,
1423,
1462,
1474,
1476,
1482,
1483,
1527,
1561,
1597,
1638,
1675,
1721,
1766,
1815,
1881,
1882,
1883,
1884,
1885,
1891,
1893,
1909,
1921,
1923,
1929,
1930,
1954,
1988,
2022,
2068,
2119,
2162,
2217,
2249,
2288,
2327,
2383,
2384,
2392,
2443,
2494,
2495,
2532,
2582,
2632,
2682,
2732,
2782,
2833,
2834,
2835,
2836,
2837,
2838,
2839,
2840,
2841,
2842,
2843,
2863,
2902,
2936,
2970,
3002,
3009
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3009,
"ccnet_original_nlines": 119,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11599098891019821,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0033783800899982452,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5123873949050903,
"rps_doc_frac_unique_words": 0.6245487332344055,
"rps_doc_mean_word_length": 7.075812339782715,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0.125,
"rps_doc_unigram_entropy": 4.9223480224609375,
"rps_doc_word_count": 277,
"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.0091836703941226,
"rps_doc_frac_chars_top_3gram": 0.03265305981040001,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -444.3010559082031,
"rps_doc_books_importance_length_correction": -444.3010559082031,
"rps_doc_openwebtext_importance": -233.1416015625,
"rps_doc_openwebtext_importance_length_correction": -233.1416015625,
"rps_doc_wikipedia_importance": -221.05001831054688,
"rps_doc_wikipedia_importance_length_correction": -221.05001831054688
},
"fasttext": {
"dclm": 0.8878844976425171,
"english": 0.6341808438301086,
"fineweb_edu_approx": 2.0591697692871094,
"eai_general_math": 0.9999957084655762,
"eai_open_web_math": 0.818780243396759,
"eai_web_code": 0.9993838667869568
}
}
|
{
"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": "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
|
-7,545,007,623,958,130,000 |
Solved
Knoppix does not recognize sata drive on usb adapter
Posted on 2012-03-20
10
1,070 Views
Last Modified: 2012-03-26
I have 2 drives from a Buffalo LinkStation Pro Duo. The housing failed and I am trying to get the data from the drives.
The drives were configured as RAID 1 and Buffalo advises that they are in xfs file system and I should be able to see them in Linux.
I have created a boot disk with Knoppix 6.7.1 which boots into Knoppix fine. I then connect a USB powered drive adapter to one of the drives from the Buffalo unit and connect that to the PC.
I can see the local hard drive and browse successfully, but when I select the option for "my computer" I do not see the external drive.
I see an icon for the local drive (160G), I see an icon for file system, which displays the contents of the local drive. I can also see the WD Passport USB drive that I want to transfer the data to. I see four "documents" that are all labeled RAID -1 Array... that do not display anything.
Where do I go from here, or what am I doing wrong?
Thank you for any suggestions.
0
Comment
Question by:Tomster2
• 4
• 3
• 3
10 Comments
LVL 1
Assisted Solution
by:Leigh_Marsh
Leigh_Marsh earned 100 total points
ID: 37742546
Try this:
Software-RAID HOWTO: Error Recovery
Seems like you haven't recoverd form the raid setup yet, and it needs to have the Raid 1 mirror declared inactive before linux will read it as a single drive.
Good luck.
Edit: Let me know if I need to simplify the instructions. I just don't have the time this moment for a long post. Thanks.
0
LVL 88
Assisted Solution
by:rindi
rindi earned 400 total points
ID: 37742561
First of all, I wouldn't use Knoppix for that, but rather the PartedMagic LiveCD, it is more suited for this type of scenario:
http://partedmagic.com
It is also smaller and boots faster than knoppix, and if you want you can put it on a USB stick instead of a CD (you could probably do that with knoppix too). For this you would use the unetbootin utility:
http://distrowatch.com/table.php?distribution=partedmagic
I'd also rather connect the HD directly to the PC, not via USB, as that can add additional problems, but it should still work...
Once you are in partedmagic, you can try mounting the drive (there is a "mounting" utility, the icon right next to the "Start" button equivalent). If it can be mounted, then you may be able to copy files off the disk, if you can't mount it, then you can run testdisk and photorec which are tools on that CD to scan the disk and recover data.
0
Author Comment
by:Tomster2
ID: 37743508
Created a partedmagic CD and booted.
I found the mount button. This utility, recognized the drive and labeled it as a Linux Raid Member, but when I clicked on "Mount" nothing happened.
I then looked at photorec, and this tool looked like you can select the drive (the linux drive from the buffalo) and then pick a destination to restore all the contents to. The choice of destination drive show local folders and also
drwxr-x--- 0 0 400 20-March-2012 10:46 .
and
drwxrwxrwt 0 0 240 20-March-2012 10:39 ..
How do I interpret these? Are they the WD Passport Drive which has room for the files, or are they the local drive which does not have room?
0
LVL 88
Assisted Solution
by:rindi
rindi earned 400 total points
ID: 37744078
In linux the drives don't have letters, rather they are normaly referenced in a format similar to this:
/dev /sda
/dev/sdb
etc.
sda is normally the first disk it finds, while sdb is the 2nd and so on.
Then you also have partitions on your disks. Sda1 would be the first primary partition on the first disk, Sda2 the 2nd primary partition on Disk 1, and Sdb5 the first logical partition on Disk 2 etc.
So Sda or Sdb, or Sdc etc tells you what disk it is, and the number after that tells you the partition it is.
0
Author Comment
by:Tomster2
ID: 37745125
Thank you for the explanation of the naming conventions.
As far as not being able to see a destination drive, that was my error. With various boots, and reboots today, I had unplugged the western digital passport. No wonder the computer couldn't find a destination drive. It finds it much more easily when it is plugged in!!!
In the meantime, I have had a thread on the Knoppix forum, and with some helpful command line comments there, I was able to mount the drive and browse and copy what I needed.
0
Efficient way to get backups off site to Azure
This user guide provides instructions on how to deploy and configure both a StoneFly Scale Out NAS Enterprise Cloud Drive virtual machine and Veeam Cloud Connect in the Microsoft Azure Cloud.
LVL 88
Expert Comment
by:rindi
ID: 37745927
Ahhh, you hoped the disk was air-powered and had a wireless connection?....;)
0
LVL 1
Expert Comment
by:Leigh_Marsh
ID: 37747278
So it is resolved? Please post results and solution for others to see.
Thank you.
0
Accepted Solution
by:
Tomster2 earned 0 total points
ID: 37748355
Be glad to...
I found a way to do it with Knoppix thanks to contributors at forum.Knoppix.net here:
http://knoppix.net/forum/threads/29779-Knoppix-does-not-recognize-sata-drive-on-usb-adapter
Knoppix is a version of Linux. Their home page knoppix.com has an iso download that you can burn to disk in the language of your choice.
To burn the CD I used CDBurnerXP. This is free on the internet and has the redeeming quality of being very simple to use... and when used... it works!
Once your machine is booted in Knoppix, the rest of the steps using the command line are nicely spelled out in the knoppix thread above.
For hardware, you will need a USB Drive Adapter... this are available from various sources for about $30.
The steps taken are:
1) Boot the PC using the Knoppix disk
2) Plug in one of the drives from your Buffalo Unit using a USB Drive Adapter
3) Plug in another external drive to copy the data to (if the local PC drive does not have room)
4) Find the name of the partition with the data using the command line tools described in the thread
5) Deactivate the RAID 1 for that partition using the command line (also described)
6) Mount the drive (also described)
7) Open the Knoppix file manager (located under Accessories) to view the files you want
8) Copy and Paste as desired
9) unmount the drive using the command line
10) Stop the drive using the command line
11) Exit Knoppix
12) Remove CD, after Knoppix exits
Hope this proves helpful to anyone else that encounters this situation.
Tomster2
0
LVL 1
Expert Comment
by:Leigh_Marsh
ID: 37748994
Glad you found the answer. I figured declaring the Raid inactive would do the trick.
CraigsList should turn up one of those, but you might want to look underneath for the Tesla stamp of approval. :D
0
Author Closing Comment
by:Tomster2
ID: 37764955
Although I tracked down the final solution, the timely comments from both of you keep hope alive that this was indeed doable. Rindi received more points because of his multiple and detailed replies.
My thanks to both of you.
Now if I can just find an air powered, wireless USB drive... :-)
0
Featured Post
Efficient way to get backups off site to Azure
This user guide provides instructions on how to deploy and configure both a StoneFly Scale Out NAS Enterprise Cloud Drive virtual machine and Veeam Cloud Connect in the Microsoft Azure Cloud.
Question has a verified solution.
If you are experiencing a similar issue, please ask a related question
As you can read I recycle all my old hardware and the time has come that my power supply of 200 Watt cannot provide enough power for my backup server. I have lots of Compaq power supply's laying around, so I figured to use one of these PSU's. I t…
System overheating may become a serious problem if not taken care of at the proper time. I am writing this article because I faced a similar problem. Intro All electronic devices produce heat, but computers are a special case - the processors bo…
Connecting to an Amazon Linux EC2 Instance from Windows Using PuTTY.
Get a first impression of how PRTG looks and learn how it works. This video is a short introduction to PRTG, as an initial overview or as a quick start for new PRTG users.
920 members asked questions and received personalized solutions in the past 7 days.
Join the community of 500,000 technology professionals and ask your questions.
Join & Ask a Question
Need Help in Real-Time?
Connect with top rated Experts
14 Experts available now in Live!
Get 1:1 Help Now
|
{
"url": "https://www.experts-exchange.com/questions/27640239/Knoppix-does-not-recognize-sata-drive-on-usb-adapter.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "188044",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XJKOJO4JUYCTCA2FZ6BD63S7QKCD7PCC",
"WARC-Concurrent-To": "<urn:uuid:2f11d2d9-6d65-4b89-9afc-8b4cbc6f4df8>",
"WARC-Date": "2017-01-21T09:24:44Z",
"WARC-IP-Address": "104.20.168.10",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7V5YARHMOBS7EQCQHF6CBS3DYXUYHM6M",
"WARC-Record-ID": "<urn:uuid:ed106fc1-a0c9-4ef1-9a88-5191a62354b8>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/27640239/Knoppix-does-not-recognize-sata-drive-on-usb-adapter.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:107c19bf-1c58-4a2e-b570-22b0743b9135>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-04\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for January 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
7,
8,
61,
62,
83,
86,
98,
124,
244,
245,
378,
379,
570,
571,
707,
708,
998,
999,
1050,
1051,
1082,
1084,
1092,
1113,
1119,
1125,
1131,
1143,
1145,
1151,
1152,
1170,
1171,
1186,
1222,
1235,
1245,
1281,
1282,
1441,
1442,
1453,
1454,
1576,
1578,
1580,
1587,
1588,
1606,
1607,
1616,
1646,
1659,
1786,
1787,
1810,
1811,
2017,
2018,
2076,
2077,
2206,
2207,
2549,
2551,
2553,
2554,
2569,
2570,
2582,
2595,
2632,
2633,
2782,
2783,
3017,
3018,
3061,
3062,
3066,
3067,
3110,
3111,
3253,
3255,
3257,
3264,
3265,
3283,
3284,
3293,
3323,
3336,
3440,
3441,
3451,
3460,
3465,
3466,
3539,
3540,
3740,
3741,
3851,
3853,
3855,
3856,
3871,
3872,
3884,
3897,
3954,
3955,
4226,
4227,
4402,
4404,
4451,
4452,
4644,
4645,
4647,
4654,
4655,
4670,
4671,
4680,
4693,
4771,
4773,
4775,
4781,
4782,
4797,
4798,
4813,
4826,
4897,
4898,
4909,
4911,
4913,
4914,
4932,
4933,
4937,
4968,
4981,
4995,
4996,
5083,
5084,
5177,
5178,
5317,
5318,
5470,
5471,
5608,
5609,
5715,
5716,
5737,
5738,
5776,
5777,
5855,
5856,
5953,
5954,
6055,
6056,
6140,
6141,
6177,
6178,
6266,
6267,
6296,
6297,
6341,
6342,
6384,
6385,
6403,
6404,
6439,
6440,
6512,
6513,
6522,
6524,
6526,
6532,
6533,
6548,
6549,
6564,
6577,
6662,
6663,
6777,
6779,
6781,
6782,
6805,
6806,
6818,
6831,
7031,
7032,
7058,
7059,
7124,
7126,
7127,
7141,
7142,
7189,
7190,
7382,
7383,
7417,
7418,
7489,
7490,
7738,
7985,
8054,
8228,
8229,
8313,
8314,
8393,
8394,
8416,
8417,
8441,
8442,
8473,
8474,
8508,
8509
],
"line_end_idx": [
7,
8,
61,
62,
83,
86,
98,
124,
244,
245,
378,
379,
570,
571,
707,
708,
998,
999,
1050,
1051,
1082,
1084,
1092,
1113,
1119,
1125,
1131,
1143,
1145,
1151,
1152,
1170,
1171,
1186,
1222,
1235,
1245,
1281,
1282,
1441,
1442,
1453,
1454,
1576,
1578,
1580,
1587,
1588,
1606,
1607,
1616,
1646,
1659,
1786,
1787,
1810,
1811,
2017,
2018,
2076,
2077,
2206,
2207,
2549,
2551,
2553,
2554,
2569,
2570,
2582,
2595,
2632,
2633,
2782,
2783,
3017,
3018,
3061,
3062,
3066,
3067,
3110,
3111,
3253,
3255,
3257,
3264,
3265,
3283,
3284,
3293,
3323,
3336,
3440,
3441,
3451,
3460,
3465,
3466,
3539,
3540,
3740,
3741,
3851,
3853,
3855,
3856,
3871,
3872,
3884,
3897,
3954,
3955,
4226,
4227,
4402,
4404,
4451,
4452,
4644,
4645,
4647,
4654,
4655,
4670,
4671,
4680,
4693,
4771,
4773,
4775,
4781,
4782,
4797,
4798,
4813,
4826,
4897,
4898,
4909,
4911,
4913,
4914,
4932,
4933,
4937,
4968,
4981,
4995,
4996,
5083,
5084,
5177,
5178,
5317,
5318,
5470,
5471,
5608,
5609,
5715,
5716,
5737,
5738,
5776,
5777,
5855,
5856,
5953,
5954,
6055,
6056,
6140,
6141,
6177,
6178,
6266,
6267,
6296,
6297,
6341,
6342,
6384,
6385,
6403,
6404,
6439,
6440,
6512,
6513,
6522,
6524,
6526,
6532,
6533,
6548,
6549,
6564,
6577,
6662,
6663,
6777,
6779,
6781,
6782,
6805,
6806,
6818,
6831,
7031,
7032,
7058,
7059,
7124,
7126,
7127,
7141,
7142,
7189,
7190,
7382,
7383,
7417,
7418,
7489,
7490,
7738,
7985,
8054,
8228,
8229,
8313,
8314,
8393,
8394,
8416,
8417,
8441,
8442,
8473,
8474,
8508,
8509,
8525
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8525,
"ccnet_original_nlines": 243,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39303481578826904,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04809286817908287,
"rps_doc_frac_lines_end_with_ellipsis": 0.01639343984425068,
"rps_doc_frac_no_alph_words": 0.19016030430793762,
"rps_doc_frac_unique_words": 0.36010709404945374,
"rps_doc_mean_word_length": 4.422356128692627,
"rps_doc_num_sentences": 87,
"rps_doc_symbol_to_word_ratio": 0.005527920089662075,
"rps_doc_unigram_entropy": 5.554234027862549,
"rps_doc_word_count": 1494,
"rps_doc_frac_chars_dupe_10grams": 0.07688815146684647,
"rps_doc_frac_chars_dupe_5grams": 0.1120024174451828,
"rps_doc_frac_chars_dupe_6grams": 0.09474799036979675,
"rps_doc_frac_chars_dupe_7grams": 0.08657483756542206,
"rps_doc_frac_chars_dupe_8grams": 0.07688815146684647,
"rps_doc_frac_chars_dupe_9grams": 0.07688815146684647,
"rps_doc_frac_chars_top_2gram": 0.00847585964947939,
"rps_doc_frac_chars_top_3gram": 0.011351600289344788,
"rps_doc_frac_chars_top_4gram": 0.014378690160810947,
"rps_doc_books_importance": -896.6698608398438,
"rps_doc_books_importance_length_correction": -896.6698608398438,
"rps_doc_openwebtext_importance": -483.5761413574219,
"rps_doc_openwebtext_importance_length_correction": -483.5761413574219,
"rps_doc_wikipedia_importance": -369.3663330078125,
"rps_doc_wikipedia_importance_length_correction": -369.3663330078125
},
"fasttext": {
"dclm": 0.01950925961136818,
"english": 0.9247494339942932,
"fineweb_edu_approx": 1.4696578979492188,
"eai_general_math": 0.17387044429779053,
"eai_open_web_math": 0.3524600863456726,
"eai_web_code": 0.02061253972351551
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02854",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,441,991,853,872,611,000 |
Account Statuses API
The Account Statuses API allows you to see the status of your Merchant Center Account or an MCA (multi-client account) and all sub-accounts associated with it.
Merchants who have multiple online stores or brands which are sold on separate websites may choose to have sub-accounts under an MCA.
get
The accountstatuses.get API call allows an MCA account to get account status information for a single sub-account, or a standalone account to get its own account status information.
Use the following API call in order to get the account status information where the merchantId is the MCA account number and accountId is its sub-account.
If the Merchant Center account is not a multi-client account, accountstatuses.get can still return account status information; in this case use the same Merchant Center account number for both parameters in the API call below.
Control which product issues are returned by the accountstatuses.get method by using the destination parameter. When the destination is not specified, the default return response only includes statuses for destination: Shopping.
GET https://www.googleapis.com/content/v2/merchantId/accountstatuses/accountId
The following is a sample JSON response for a sub-account that was suspended for a "landing page not working policy" violation.
{
"kind": "content#accountStatus",
"accountId": "123456789",
"websiteClaimed": true,
"accountLevelIssues": [
{
"id": "editorial_and_professional_standards_destination_url_down_policy",
"title": "Account suspended due to policy violation: landing page not working",
"country": "US",
"severity": "critical",
"documentation": "https://support.google.com/merchants/answer/6150244#wycd-usefulness"
},
{
"id": "missing_ad_words_link",
"title": "No Google Ads account linked",
"severity": "error",
"documentation": "https://support.google.com/merchants/answer/6159060"
}
],
"products": [
{
"channel": "online",
"destination": "Shopping",
"country": "US",
"statistics": {
"active": "0",
"pending": "0",
"disapproved": "5",
"expiring": "0"
},
"itemLevelIssues": [
{
"code": "image_link_broken",
"servability": "disapproved",
"resolution": "merchant_action",
"attributeName": "image link",
"description": "Invalid image [image link]",
"detail": "Ensure the image is accessible and uses an accepted image format (JPEG, PNG, GIF)",
"documentation": "https://support.google.com/merchants/answer/6098289",
"numItems": "2"
},
{
"code": "landing_page_error",
"servability": "disapproved",
"resolution": "merchant_action",
"attributeName": "link",
"description": "Unavailable desktop landing page",
"detail": "Update your website or landing page URL to enable access from desktop devices",
"documentation": "https://support.google.com/merchants/answer/6098155",
"numItems": "5"
},
{
"code": "missing_condition_microdata",
"servability": "unaffected",
"resolution": "merchant_action",
"description": "Missing or invalid data [condition]",
"detail": "Add valid structured data markup to your landing page",
"documentation": "https://support.google.com/merchants/answer/6183460",
"numItems": "5"
},
{
"code": "mobile_landing_page_error",
"servability": "disapproved",
"resolution": "merchant_action",
"attributeName": "link",
"description": "Unavailable mobile landing page",
"detail": "Update your website or landing page URL to enable access from mobile devices",
"documentation": "https://support.google.com/merchants/answer/6098296",
"numItems": "3"
}
]
}
]
}
list
The accountstatuses.list API call returns information on all sub-accounts. Use the following API call in order to get the account status information where the merchantId is the account number for a multi-client account.
The accountstatuses.list method also provides the ability to filter product issues by destination. When the destination is not specified, the default return response only includes statuses for destination: Shopping.
GET https://www.googleapis.com/content/v2/merchantId/accountstatuses
The following is a sample JSON response:
{
"kind": "content#accountstatusesListResponse",
"resources": [
{
"kind": "content#accountStatus",
"accountId": "1234567",
"websiteClaimed": true,
"accountLevelIssues": [
{
"id": "editorial_and_professional_standards_destination_url_down_policy",
"title": "Account suspended due to policy violation: landing page not working",
"country": "US",
"severity": "critical",
"documentation": "https://support.google.com/merchants/answer/6150244#wycd-usefulness"
},
{
"id": "missing_ad_words_link",
"title": "No Google Ads account linked",
"severity": "error",
"documentation": "https://support.google.com/merchants/answer/6159060"
}
],
"products": [
{
"channel": "online",
"destination": "Shopping",
"country": "US",
"statistics": {
"active": "0",
"pending": "0",
"disapproved": "0",
"expiring": "0"
}
}
]
},
{
"kind": "content#accountStatus",
"accountId": "123456789",
"websiteClaimed": true,
"accountLevelIssues": [
{
"id": "home_page_issue",
"title": "Website URL not provided",
"severity": "critical",
"documentation": "https://support.google.com/merchants/answer/176793"
},
{
"id": "missing_ad_words_link",
"title": "No Google Ads account linked",
"severity": "error",
"documentation": "https://support.google.com/merchants/answer/6159060"
}
],
"products": [
{
"channel": "online",
"destination": "Shopping",
"country": "US",
"statistics": {
"active": "0",
"pending": "0",
"disapproved": "0",
"expiring": "0"
}
}
]
}
]
}
A call to the accountstatuses.list for a non-MCA account (for example, a standalone Merchant Center account) returns a 403 error, with a JSON body similar to this:
{
"error": {
"errors": [
{
"domain": "global",
"reason": "forbidden",
"message": "111111111 is not a multi-client account (MCA). The only account
service operations allowed on non-MCAs are 'get', 'update',
'authinfo' and 'claimwebsite'."
}
],
"code": 403,
"message": "111111111 is not a multi-client account (MCA). The only account
service operations allowed on non-MCAs are 'get', 'update',
'authinfo' and 'claimwebsite'."
}
}
Batch mode
An accountstatuses.custombatch with a GET method returns account status information for multiple sub-accounts in a multi-client account.
The request JSON includes the merchantId of the MCA account number, the accountId of the sub-account, a unique batchId and the method set to get.
POST https://www.googleapis.com/content/v2/accountstatuses/batch
The following is a sample request JSON body:
{
"entries": [
{
"accountId": 1212121212,
"merchantId": 4444444444,
"method": "get",
"batchId": 9
},
{
"accountId": 1313131313,
"merchantId": 4444444444,
"method": "get",
"batchId": 99
}
]
}
The following is a sample JSON response body:
{
"kind": "content#accountstatusesCustomBatchResponse",
"entries": [
{
"batchId": 9,
"accountStatus": {
"kind": "content#accountStatus",
"accountId": "1212121212",
"websiteClaimed": true,
"accountLevelIssues": [
{
"id": "home_page_issue",
"title": "Website URL not provided",
"severity": "critical",
"documentation": "https://support.google.com/merchants/answer/176793"
},
{
"id": "missing_ad_words_link",
"title": "No Google Ads account linked",
"severity": "error",
"documentation": "https://support.google.com/merchants/answer/6159060"
}
],
"products": [
{
"channel": "online",
"destination": "Shopping",
"country": "US",
"statistics": {
"active": "0",
"pending": "0",
"disapproved": "0",
"expiring": "0"
}
}
]
}
},
{
"batchId": 99,
"accountStatus": {
"kind": "content#accountStatus",
"accountId": "1313131313",
"websiteClaimed": true,
"accountLevelIssues": [
{
"id": "editorial_and_professional_standards_destination_url_down_policy",
"title": "Account suspended due to policy violation: landing page not working",
"country": "US",
"severity": "critical",
"documentation": "https://support.google.com/merchants/answer/6150244#wycd-usefulness"
},
{
"id": "missing_ad_words_link",
"title": "No Google Ads account linked",
"severity": "error",
"documentation": "https://support.google.com/merchants/answer/6159060"
}
],
"products": [
{
"channel": "online",
"destination": "Shopping",
"country": "US",
"statistics": {
"active": "0",
"pending": "0",
"disapproved": "0",
"expiring": "0"
}
}
]
}
}
]
}
Changes from v2 to v2.1
In the AccountStatus resource, dataQualityIssues has been superseded by itemLevelIssues. Refer to the Content API Migrating from v2 to v2.1 for more details on these changes.
Testing the accountstatuses API
These test examples use base_url to refer to https://www.googleapis.com. In addition, all examples use /content/v2 in the URL in a production environment. To test API v2.1, you would instead use /content/v2.1.
In the following example we get, list, and custombatch.get account status for MCA accounts:
1. Get sub-account status for an MCA using accountstatuses.get.
1. Get the merchantId and accountId by performing a GET to the API endpoint:
GET https://www.googleapis.com/content/v2/merchantId/accountstatuses/accountId
2. You should receive an HTTP 200 status code for success and the account status list in JSON.
2. View all sub-account status for an MCA using accountstatuses.list.
1. Perform a GET to the API endpoint with your merchantId:
GET https://www.googleapis.com/content/v2/merchantId/accountstatuses
2. You should receive an HTTP 200 status code for success and the account status list in JSON for the merchantId submitted.
3. View multiple sub-accounts for MCA in batch mode using accountstatuses.custombatch.
1. Construct valid JSON using your accountID, merchant ID, and a get method.
2. Perform a POST to the API endpoint:
POST https://www.googleapis.com/content/v2/accountstatuses/batch
3. You should receive an HTTP 200 status code for success and the account status list in JSON.
إرسال تعليقات حول...
Content API for Shopping
|
{
"url": "https://developers.google.com/shopping-content/v2/accountstatuses?hl=ar",
"source_domain": "developers.google.com",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "61613",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5B2MEWYMOUPOF6EYJABLPL523WP6FPKD",
"WARC-Concurrent-To": "<urn:uuid:90aea5cc-3973-4913-a9f7-7140399aee76>",
"WARC-Date": "2019-09-15T06:00:09Z",
"WARC-IP-Address": "172.217.8.14",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6KROVZYIFNZ2POJG4ULLOKZLXW4C27ZA",
"WARC-Record-ID": "<urn:uuid:a4c2d5c3-ae3f-4932-895d-00272eddf994>",
"WARC-Target-URI": "https://developers.google.com/shopping-content/v2/accountstatuses?hl=ar",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f4de335e-2858-418e-adfb-65777a5d62f2>"
},
"warc_info": "isPartOf: CC-MAIN-2019-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-47.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,
21,
22,
182,
183,
317,
318,
322,
323,
505,
506,
661,
662,
889,
890,
1119,
1120,
1199,
1200,
1328,
1329,
1331,
1365,
1392,
1417,
1442,
1446,
1523,
1606,
1626,
1653,
1743,
1748,
1752,
1786,
1830,
1854,
1928,
1932,
1936,
1951,
1955,
1979,
2009,
2029,
2048,
2067,
2087,
2111,
2131,
2137,
2161,
2167,
2201,
2236,
2274,
2310,
2360,
2460,
2537,
2558,
2565,
2571,
2606,
2641,
2679,
2709,
2765,
2861,
2938,
2959,
2966,
2972,
3016,
3050,
3088,
3147,
3219,
3296,
3317,
3324,
3330,
3372,
3407,
3445,
3475,
3530,
3625,
3702,
3723,
3729,
3734,
3738,
3741,
3743,
3744,
3749,
3750,
3970,
3971,
4187,
4188,
4257,
4258,
4299,
4300,
4302,
4350,
4366,
4370,
4406,
4433,
4460,
4487,
4493,
4572,
4657,
4679,
4708,
4800,
4807,
4813,
4849,
4895,
4921,
4997,
5003,
5009,
5026,
5032,
5058,
5090,
5112,
5133,
5154,
5176,
5202,
5224,
5231,
5237,
5242,
5247,
5251,
5287,
5316,
5343,
5370,
5376,
5406,
5448,
5477,
5552,
5559,
5565,
5601,
5647,
5673,
5749,
5755,
5761,
5778,
5784,
5810,
5842,
5864,
5885,
5906,
5928,
5954,
5976,
5983,
5989,
5994,
5998,
6001,
6003,
6004,
6168,
6169,
6171,
6183,
6197,
6202,
6226,
6253,
6333,
6409,
6457,
6462,
6467,
6482,
6560,
6634,
6680,
6683,
6685,
6686,
6697,
6698,
6835,
6836,
6982,
6983,
7048,
7049,
7094,
7095,
7097,
7112,
7118,
7149,
7181,
7204,
7223,
7230,
7236,
7267,
7299,
7322,
7342,
7348,
7352,
7354,
7355,
7401,
7402,
7404,
7459,
7473,
7477,
7494,
7516,
7553,
7584,
7612,
7640,
7647,
7678,
7721,
7751,
7827,
7835,
7842,
7879,
7926,
7953,
8030,
8037,
8044,
8062,
8069,
8096,
8129,
8152,
8174,
8196,
8219,
8246,
8269,
8277,
8284,
8290,
8295,
8300,
8304,
8322,
8344,
8381,
8412,
8440,
8468,
8475,
8555,
8641,
8664,
8694,
8787,
8795,
8802,
8839,
8886,
8913,
8990,
8997,
9004,
9022,
9029,
9056,
9089,
9112,
9134,
9156,
9179,
9206,
9229,
9237,
9244,
9250,
9255,
9259,
9262,
9264,
9265,
9289,
9290,
9465,
9466,
9498,
9499,
9709,
9710,
9802,
9803,
9869,
9870,
9951,
9952,
10037,
10044,
10143,
10144,
10216,
10217,
10280,
10281,
10356,
10363,
10491,
10492,
10581,
10582,
10663,
10664,
10707,
10708,
10779,
10786,
10885,
10886,
10907,
10908
],
"line_end_idx": [
21,
22,
182,
183,
317,
318,
322,
323,
505,
506,
661,
662,
889,
890,
1119,
1120,
1199,
1200,
1328,
1329,
1331,
1365,
1392,
1417,
1442,
1446,
1523,
1606,
1626,
1653,
1743,
1748,
1752,
1786,
1830,
1854,
1928,
1932,
1936,
1951,
1955,
1979,
2009,
2029,
2048,
2067,
2087,
2111,
2131,
2137,
2161,
2167,
2201,
2236,
2274,
2310,
2360,
2460,
2537,
2558,
2565,
2571,
2606,
2641,
2679,
2709,
2765,
2861,
2938,
2959,
2966,
2972,
3016,
3050,
3088,
3147,
3219,
3296,
3317,
3324,
3330,
3372,
3407,
3445,
3475,
3530,
3625,
3702,
3723,
3729,
3734,
3738,
3741,
3743,
3744,
3749,
3750,
3970,
3971,
4187,
4188,
4257,
4258,
4299,
4300,
4302,
4350,
4366,
4370,
4406,
4433,
4460,
4487,
4493,
4572,
4657,
4679,
4708,
4800,
4807,
4813,
4849,
4895,
4921,
4997,
5003,
5009,
5026,
5032,
5058,
5090,
5112,
5133,
5154,
5176,
5202,
5224,
5231,
5237,
5242,
5247,
5251,
5287,
5316,
5343,
5370,
5376,
5406,
5448,
5477,
5552,
5559,
5565,
5601,
5647,
5673,
5749,
5755,
5761,
5778,
5784,
5810,
5842,
5864,
5885,
5906,
5928,
5954,
5976,
5983,
5989,
5994,
5998,
6001,
6003,
6004,
6168,
6169,
6171,
6183,
6197,
6202,
6226,
6253,
6333,
6409,
6457,
6462,
6467,
6482,
6560,
6634,
6680,
6683,
6685,
6686,
6697,
6698,
6835,
6836,
6982,
6983,
7048,
7049,
7094,
7095,
7097,
7112,
7118,
7149,
7181,
7204,
7223,
7230,
7236,
7267,
7299,
7322,
7342,
7348,
7352,
7354,
7355,
7401,
7402,
7404,
7459,
7473,
7477,
7494,
7516,
7553,
7584,
7612,
7640,
7647,
7678,
7721,
7751,
7827,
7835,
7842,
7879,
7926,
7953,
8030,
8037,
8044,
8062,
8069,
8096,
8129,
8152,
8174,
8196,
8219,
8246,
8269,
8277,
8284,
8290,
8295,
8300,
8304,
8322,
8344,
8381,
8412,
8440,
8468,
8475,
8555,
8641,
8664,
8694,
8787,
8795,
8802,
8839,
8886,
8913,
8990,
8997,
9004,
9022,
9029,
9056,
9089,
9112,
9134,
9156,
9179,
9206,
9229,
9237,
9244,
9250,
9255,
9259,
9262,
9264,
9265,
9289,
9290,
9465,
9466,
9498,
9499,
9709,
9710,
9802,
9803,
9869,
9870,
9951,
9952,
10037,
10044,
10143,
10144,
10216,
10217,
10280,
10281,
10356,
10363,
10491,
10492,
10581,
10582,
10663,
10664,
10707,
10708,
10779,
10786,
10885,
10886,
10907,
10908,
10932
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10932,
"ccnet_original_nlines": 340,
"rps_doc_curly_bracket": 0.007135020103305578,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1462971419095993,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030440710484981537,
"rps_doc_frac_lines_end_with_ellipsis": 0.0029325499199330807,
"rps_doc_frac_no_alph_words": 0.47932758927345276,
"rps_doc_frac_unique_words": 0.26057693362236023,
"rps_doc_mean_word_length": 6.940384387969971,
"rps_doc_num_sentences": 99,
"rps_doc_symbol_to_word_ratio": 0.004997729789465666,
"rps_doc_unigram_entropy": 5.098278045654297,
"rps_doc_word_count": 1040,
"rps_doc_frac_chars_dupe_10grams": 0.4276807904243469,
"rps_doc_frac_chars_dupe_5grams": 0.5145469903945923,
"rps_doc_frac_chars_dupe_6grams": 0.4901634752750397,
"rps_doc_frac_chars_dupe_7grams": 0.47658631205558777,
"rps_doc_frac_chars_dupe_8grams": 0.46287059783935547,
"rps_doc_frac_chars_dupe_9grams": 0.4276807904243469,
"rps_doc_frac_chars_top_2gram": 0.01801053062081337,
"rps_doc_frac_chars_top_3gram": 0.01995011977851391,
"rps_doc_frac_chars_top_4gram": 0.02632308006286621,
"rps_doc_books_importance": -626.970703125,
"rps_doc_books_importance_length_correction": -626.970703125,
"rps_doc_openwebtext_importance": -164.93997192382812,
"rps_doc_openwebtext_importance_length_correction": -164.93997192382812,
"rps_doc_wikipedia_importance": -203.54415893554688,
"rps_doc_wikipedia_importance_length_correction": -203.54415893554688
},
"fasttext": {
"dclm": 0.6571231484413147,
"english": 0.6599858403205872,
"fineweb_edu_approx": 1.573230504989624,
"eai_general_math": 0.0415608286857605,
"eai_open_web_math": 0.04401040077209473,
"eai_web_code": 0.8594011664390564
}
}
|
{
"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": "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
|
-7,098,138,450,504,406,000 |
Server Fault is a question and answer site for system and network administrators. It's 100% free, no registration required.
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
I have a shell file which needs to perform a replace of some text in a php file.
The line that needs replacing is:
$database = $db."_db";
The actual sed command needs to contain a variable so not sure what i should be escaping and where?
#!/bin/sh
sed -i s/$db."db"/$DATABASE/ mysql_connect.php
Thanks.
share|improve this question
up vote 3 down vote accepted
Enclose the string in single quotes to prevent variable expansion.
sed -i s/'$db."_db"'/$DATABASE/ mysql_connect.php
to replace all occurrences of $db."_db" with the value of $DATABASE.
share|improve this answer
perfect thanks :) – seengee Jul 24 '12 at 11:19
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://serverfault.com/questions/410596/sed-replace-inside-shell-file?answertab=oldest",
"source_domain": "serverfault.com",
"snapshot_id": "crawl=CC-MAIN-2016-18",
"warc_metadata": {
"Content-Length": "72428",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:67ODYMSSSXX5OKKXFOPTGYNNWCJRWC4D",
"WARC-Concurrent-To": "<urn:uuid:8b533a0e-edb4-4417-8dd4-b76e128f767e>",
"WARC-Date": "2016-05-01T08:49:04Z",
"WARC-IP-Address": "104.16.46.232",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:N7L6ANTXBMJS2JXXYZIVAZUROTJBPRFA",
"WARC-Record-ID": "<urn:uuid:147e6a31-b35f-4862-887e-229c344c47c5>",
"WARC-Target-URI": "http://serverfault.com/questions/410596/sed-replace-inside-shell-file?answertab=oldest",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2eac5f02-da00-4c65-a71f-3f4b620aaaa1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-239-7-51.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
124,
125,
133,
154,
186,
210,
265,
266,
347,
348,
382,
383,
406,
407,
507,
508,
518,
519,
566,
567,
575,
576,
604,
633,
634,
701,
702,
752,
753,
822,
823,
849,
854,
902,
903,
915,
916,
918,
926,
927,
1005,
1006
],
"line_end_idx": [
124,
125,
133,
154,
186,
210,
265,
266,
347,
348,
382,
383,
406,
407,
507,
508,
518,
519,
566,
567,
575,
576,
604,
633,
634,
701,
702,
752,
753,
822,
823,
849,
854,
902,
903,
915,
916,
918,
926,
927,
1005,
1006,
1096
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1096,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3429751992225647,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016528930515050888,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24380165338516235,
"rps_doc_frac_unique_words": 0.6477272510528564,
"rps_doc_mean_word_length": 4.653409004211426,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.004132229834794998,
"rps_doc_unigram_entropy": 4.5279107093811035,
"rps_doc_word_count": 176,
"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.021978020668029785,
"rps_doc_frac_chars_top_3gram": 0.041514039039611816,
"rps_doc_frac_chars_top_4gram": 0.07814408093690872,
"rps_doc_books_importance": -77.14784240722656,
"rps_doc_books_importance_length_correction": -77.14784240722656,
"rps_doc_openwebtext_importance": -55.867679595947266,
"rps_doc_openwebtext_importance_length_correction": -46.652130126953125,
"rps_doc_wikipedia_importance": -51.100730895996094,
"rps_doc_wikipedia_importance_length_correction": -51.100730895996094
},
"fasttext": {
"dclm": 0.7923470139503479,
"english": 0.8643769025802612,
"fineweb_edu_approx": 1.7093359231948853,
"eai_general_math": -0.000008459999662591144,
"eai_open_web_math": 0.2020004391670227,
"eai_web_code": -0.000010009999641624745
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-894,273,283,070,533,900 |
The Register® — Biting the hand that feeds IT
Feeds
* Posts by tygrus
4 posts • joined Tuesday 20th June 2006 03:26 GMT
tygrus
Flame
crossfire Risk
I would not like to be caught in the cross fire. Either in the air or on the ground if aimed wrongly. Still sounds very experimental and risky.
0
0
tygrus
Possible new pricing model: SW cost 3x what the HW cost
For every $100 spent on IBM hardware they will charge you $## amount each year to use DB2 etc.
0
0
tygrus
re: it's a form of democracy....
Quote [Sun has near proximity....
near proximity is a 25 $ word for "close, but not there"]
maybe that should have read
near proximity is a $0.019999 word for "close, but not there"
not quite my 2c worth
0
0
tygrus
poly-dodgy-graph
Confounders of a polygraph?
? Person is convinced of the lie either by mental disease, hypnosis, amnesia or distorted point of view. It can only help identify when someone is deliberately lying.
? Anxiety and stress may make someone scaried to answer any question and paranoid of possible implications of the questions posed. They may answer trufull but they can still react similar to another persons lie.
? Many stories or conspiracies about special military or esponage training to beat polygraphs and withstand interogations.
0
0
|
{
"url": "http://forums.theregister.co.uk/user/113/",
"source_domain": "forums.theregister.co.uk",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "28238",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZMBH5IHCF4IKFBPZ7WZ4SDHHD3Q5Q4E7",
"WARC-Concurrent-To": "<urn:uuid:bb1ba879-cb97-4c32-aab3-56db0fcac9d8>",
"WARC-Date": "2013-12-11T09:24:41Z",
"WARC-IP-Address": "50.57.15.204",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QTW2CYQV5EKDW2GHDO2XJWRVJU6SQVJR",
"WARC-Record-ID": "<urn:uuid:b7821abc-42f8-4144-b397-1258983488b2>",
"WARC-Target-URI": "http://forums.theregister.co.uk/user/113/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:44248dd3-0d83-42c0-acb4-d8b960a3de5e>"
},
"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,
46,
47,
53,
54,
72,
73,
123,
124,
131,
137,
138,
153,
154,
298,
299,
301,
303,
310,
311,
367,
368,
463,
464,
466,
468,
475,
476,
509,
510,
544,
545,
603,
604,
632,
633,
695,
696,
718,
719,
721,
723,
730,
731,
748,
749,
777,
778,
945,
946,
1158,
1159,
1282,
1283,
1285
],
"line_end_idx": [
46,
47,
53,
54,
72,
73,
123,
124,
131,
137,
138,
153,
154,
298,
299,
301,
303,
310,
311,
367,
368,
463,
464,
466,
468,
475,
476,
509,
510,
544,
545,
603,
604,
632,
633,
695,
696,
718,
719,
721,
723,
730,
731,
748,
749,
777,
778,
945,
946,
1158,
1159,
1282,
1283,
1285,
1286
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1286,
"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.36259540915489197,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02671756036579609,
"rps_doc_frac_lines_end_with_ellipsis": 0.0363636389374733,
"rps_doc_frac_no_alph_words": 0.209923654794693,
"rps_doc_frac_unique_words": 0.6772727370262146,
"rps_doc_mean_word_length": 4.513636589050293,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.015267180278897285,
"rps_doc_unigram_entropy": 4.799715518951416,
"rps_doc_word_count": 220,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04632427170872688,
"rps_doc_frac_chars_dupe_6grams": 0.04632427170872688,
"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.008056390099227428,
"rps_doc_frac_chars_top_3gram": 0.024169180542230606,
"rps_doc_frac_chars_top_4gram": 0.032225579023361206,
"rps_doc_books_importance": -63.21723937988281,
"rps_doc_books_importance_length_correction": -63.21723937988281,
"rps_doc_openwebtext_importance": -45.5640869140625,
"rps_doc_openwebtext_importance_length_correction": -45.5640869140625,
"rps_doc_wikipedia_importance": -9.94587230682373,
"rps_doc_wikipedia_importance_length_correction": -9.945871353149414
},
"fasttext": {
"dclm": 0.5600869059562683,
"english": 0.9422283172607422,
"fineweb_edu_approx": 2.506026268005371,
"eai_general_math": 0.15347260236740112,
"eai_open_web_math": 0.23432815074920654,
"eai_web_code": 0.008450689725577831
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "338.4",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "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": "5",
"label": "Comment Section"
},
"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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,417,823,223,573,659,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.
How can I execute code only for iOS 5 with iOS<5 compatibility? I have written this code:
BOOL isIOS5 = [[[UIDevice currentDevice] systemVersion] floatValue] > 4.3;
if (isIOS5) {
[[UINavigationBar appearance]setBackgroundImage:[UIImage imageNamed:@"cabecera.png"] forBarMetrics:UIBarMetricsDefault];
[[UINavigationBar appearance]setTintColor:[UIColor colorWithRed:80.0f/255.0f green:150.0f/255.0f blue:185.0f/255.0f alpha:1]];
}
If I execute the app in iOS 5 it works fine, but if I try to execute the app in iOS <5 emulator it breaks. Is there a way to write an app who has code only for iOS5 but ignores it when iOS<5?
share|improve this question
This previous answer should help you out: [How to target a specific iPhone version?][1] [1]: stackoverflow.com/questions/820142/… – sosborn Oct 27 '11 at 7:57
Supposing Apple release iOS 4.4 with security fixes for older devices? – Johnsyweb Oct 27 '11 at 9:58
4 Answers 4
up vote 9 down vote accepted
In your case, you should check if the method is available in the current iOS Version:
if([UINavigationBar respondsToSelector:@selector(appearance)]) //iOS >=5.0
{
[[UINavigationBar appearance]setBackgroundImage:[UIImage imageNamed:@"cabecera.png"] forBarMetrics:UIBarMetricsDefault];
[[UINavigationBar appearance]setTintColor:[UIColor colorWithRed:80.0f/255.0f green:150.0f/255.0f blue:185.0f/255.0f alpha:1]];
}
Please also see this question/answer.
share|improve this answer
Thanks, but that code breaks: 2011-10-27 10:09:11.236 IOSBoilerplate[8045:e903] +[UINavigationBar appearance]: unrecognized selector sent to class 0xed7544 2011-10-27 10:09:11.239 IOSBoilerplate[8045:e903] *** Terminating app due to uncaught exception 'NSInvalidArgumentException', reason: '+[UINavigationBar appearance]: unrecognized selector sent to class 0xed7544' – Jimmy Oct 27 '11 at 8:14
sorry for that, I corrected the code – simpleBob Oct 27 '11 at 8:24
[[UINavigationBar class] respondsToSelector:@selector(appearance)] can be written as [UINavigationBar respondsToSelector:@selector(appearance)] – user102008 Jun 12 '12 at 21:59
@user102008 thanks for the tip. I updated the code. – simpleBob Sep 11 '13 at 7:39
You shouldn't test for the version of the OS.
Instead you should test if the feature is available or not.
Especially test if UINavigationBar responds to the @selector(appearance) selector.
You should read this Apple documentation which explains it all (especially this page)
share|improve this answer
The answers here aren't entirely correct. If we were talking about a backwards compatible API then they'd be correct, you wouldn't need to check the version number at runtime. But in the case of iOS, the reality is that there are situations when you need to because Apple haven't just added functionality as you might expect, they occasionally alter existing functionality in incompatible ways when a new release is made.
A prime example being UIViewController's parentViewController:
Prior to iOS 5.0, if a view did not have a parent view controller and was being presented, the presenting view controller would be returned. On iOS 5, this behavior no longer occurs.
In which case the way you checked the version at runtime is fine.
share|improve this answer
I am not very much sure about this but you can this also..
Click on your **project**->go to **info**-> go to **build** section-> in that go to **Deployment** section->then **IOS deployment** section choose the **deployment target** you want and save and run...
Hope it may help you... :)
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/7913054/how-to-execute-code-only-for-ios-5-without-breaking-the-app",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "91264",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JRCRWI33G2E3XNM72DDMBLDTU2AV3C4C",
"WARC-Concurrent-To": "<urn:uuid:f8577a54-774c-4ab5-bd00-464784ebab6b>",
"WARC-Date": "2015-01-31T00:06:50Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ZAE3GD5QXOEPP7XLMYRCG3B4M44E64S7",
"WARC-Record-ID": "<urn:uuid:918dcd89-e2bf-430c-b05c-89bbf8492b24>",
"WARC-Target-URI": "http://stackoverflow.com/questions/7913054/how-to-execute-code-only-for-ios-5-without-breaking-the-app",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f893039d-095d-4798-8875-3be0fc906f3f>"
},
"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,
25,
157,
158,
248,
249,
325,
340,
341,
466,
597,
598,
601,
602,
794,
795,
823,
828,
988,
993,
998,
1101,
1102,
1114,
1115,
1144,
1145,
1231,
1232,
1307,
1309,
1434,
1565,
1567,
1568,
1606,
1607,
1633,
1638,
2034,
2039,
2108,
2113,
2291,
2296,
2380,
2381,
2427,
2428,
2488,
2489,
2572,
2573,
2659,
2660,
2686,
2687,
3109,
3110,
3173,
3174,
3357,
3358,
3424,
3425,
3451,
3452,
3511,
3512,
3714,
3715,
3742,
3743,
3769,
3770,
3782,
3783,
3785,
3793,
3794,
3872,
3873
],
"line_end_idx": [
25,
157,
158,
248,
249,
325,
340,
341,
466,
597,
598,
601,
602,
794,
795,
823,
828,
988,
993,
998,
1101,
1102,
1114,
1115,
1144,
1145,
1231,
1232,
1307,
1309,
1434,
1565,
1567,
1568,
1606,
1607,
1633,
1638,
2034,
2039,
2108,
2113,
2291,
2296,
2380,
2381,
2427,
2428,
2488,
2489,
2572,
2573,
2659,
2660,
2686,
2687,
3109,
3110,
3173,
3174,
3357,
3358,
3424,
3425,
3451,
3452,
3511,
3512,
3714,
3715,
3742,
3743,
3769,
3770,
3782,
3783,
3785,
3793,
3794,
3872,
3873,
3963
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3963,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0.0010093400487676263,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2705601751804352,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01430273987352848,
"rps_doc_frac_lines_end_with_ellipsis": 0.012195119634270668,
"rps_doc_frac_no_alph_words": 0.3480333685874939,
"rps_doc_frac_unique_words": 0.4915888011455536,
"rps_doc_mean_word_length": 5.704672813415527,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.0035756900906562805,
"rps_doc_unigram_entropy": 5.189939975738525,
"rps_doc_word_count": 535,
"rps_doc_frac_chars_dupe_10grams": 0.13302752375602722,
"rps_doc_frac_chars_dupe_5grams": 0.18741808831691742,
"rps_doc_frac_chars_dupe_6grams": 0.18741808831691742,
"rps_doc_frac_chars_dupe_7grams": 0.1749672293663025,
"rps_doc_frac_chars_dupe_8grams": 0.1749672293663025,
"rps_doc_frac_chars_dupe_9grams": 0.13302752375602722,
"rps_doc_frac_chars_top_2gram": 0.02621231973171234,
"rps_doc_frac_chars_top_3gram": 0.00917430967092514,
"rps_doc_frac_chars_top_4gram": 0.01179554034024477,
"rps_doc_books_importance": -384.5848693847656,
"rps_doc_books_importance_length_correction": -384.5848693847656,
"rps_doc_openwebtext_importance": -198.6410369873047,
"rps_doc_openwebtext_importance_length_correction": -198.6410369873047,
"rps_doc_wikipedia_importance": -140.20755004882812,
"rps_doc_wikipedia_importance_length_correction": -140.20755004882812
},
"fasttext": {
"dclm": 0.133777916431427,
"english": 0.822343111038208,
"fineweb_edu_approx": 1.5841825008392334,
"eai_general_math": 0.00029205999453552067,
"eai_open_web_math": 0.08021230250597,
"eai_web_code": 0.00003420999928493984
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.436",
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
9,215,922,407,351,554,000 |
VB Nested Loop
VB.Net allows using one loop inside another loop. Following section shows few examples to illustrate the concept.
Syntax
The syntax for a nested For loop statement in VB.Net is as follows:
For counter1 [ As datatype1 ] = start1 To end1 [ Step step1 ]
For counter2 [ As datatype2 ] = start2 To end2 [ Step step2 ]
...
Next [ counter2 ]
Next [ counter 1]
The syntax for a nested While loop statement in VB.Net is as follows:
While condition1
While condition2
...
End While
End While
The syntax for a nested Do...While loop statement in VB.Net is as follows:
Do { While | Until } condition1
Do { While | Until } condition2
...
Loop
Loop
Example
Module loops
Sub Main()
' local variable definition
Dim i, j As Integer
For i = 2 To 100
For j = 2 To i
' if factor found, not prime
If ((i Mod j) = 0) Then
Exit For
End If
Next j
If (j > (i \ j)) Then
Console.WriteLine("{0} is prime", i)
End If
Next i
Console.ReadLine()
End Sub
End Module
Output
2 is prime
3 is prime
5 is prime
7 is prime
11 is prime
13 is prime
17 is prime
19 is prime
23 is prime
29 is prime
31 is prime
37 is prime
41 is prime
43 is prime
47 is prime
53 is prime
59 is prime
61 is prime
67 is prime
71 is prime
73 is prime
79 is prime
83 is prime
89 is prime
97 is prime
Share this article on
|
{
"url": "https://www.fastlearning.in/vb/vb_nested_loop.php",
"source_domain": "www.fastlearning.in",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "40110",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JXCQ57F26343Q5V62LONYZFAJ3QCNHV2",
"WARC-Concurrent-To": "<urn:uuid:74fab6db-d9a9-4bbc-9018-02f0797b238c>",
"WARC-Date": "2019-03-24T13:49:11Z",
"WARC-IP-Address": "103.21.58.181",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:G7M5E7CBHCPKM36WRCVOIGJ5H53MMBTZ",
"WARC-Record-ID": "<urn:uuid:5e2c8be3-eb69-4c05-b0a0-dd78b61abb53>",
"WARC-Target-URI": "https://www.fastlearning.in/vb/vb_nested_loop.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b473547e-3e21-4f78-a630-cd7d8564b619>"
},
"warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-33-242-24.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
1,
2,
18,
19,
20,
134,
135,
142,
143,
211,
212,
274,
340,
348,
370,
388,
389,
459,
460,
477,
498,
506,
520,
530,
531,
606,
607,
639,
675,
683,
692,
697,
698,
706,
707,
720,
734,
769,
795,
818,
843,
886,
924,
951,
972,
989,
1021,
1072,
1089,
1102,
1127,
1138,
1149,
1156,
1167,
1178,
1189,
1200,
1212,
1224,
1236,
1248,
1260,
1272,
1284,
1296,
1308,
1320,
1332,
1344,
1356,
1368,
1380,
1392,
1404,
1416,
1428,
1440,
1452,
1453
],
"line_end_idx": [
1,
2,
18,
19,
20,
134,
135,
142,
143,
211,
212,
274,
340,
348,
370,
388,
389,
459,
460,
477,
498,
506,
520,
530,
531,
606,
607,
639,
675,
683,
692,
697,
698,
706,
707,
720,
734,
769,
795,
818,
843,
886,
924,
951,
972,
989,
1021,
1072,
1089,
1102,
1127,
1138,
1149,
1156,
1167,
1178,
1189,
1200,
1212,
1224,
1236,
1248,
1260,
1272,
1284,
1296,
1308,
1320,
1332,
1344,
1356,
1368,
1380,
1392,
1404,
1416,
1428,
1440,
1452,
1453,
1474
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1474,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0.004070559982210398,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22442243993282318,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01650165021419525,
"rps_doc_frac_lines_end_with_ellipsis": 0.037037041038274765,
"rps_doc_frac_no_alph_words": 0.2871287167072296,
"rps_doc_frac_unique_words": 0.4225941300392151,
"rps_doc_mean_word_length": 3.907949686050415,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.013201319612562656,
"rps_doc_unigram_entropy": 3.9897680282592773,
"rps_doc_word_count": 239,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.16059957444667816,
"rps_doc_frac_chars_dupe_6grams": 0.09957172721624374,
"rps_doc_frac_chars_dupe_7grams": 0.09957172721624374,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.1948608160018921,
"rps_doc_frac_chars_top_3gram": 0.03854389861226082,
"rps_doc_frac_chars_top_4gram": 0.04175588861107826,
"rps_doc_books_importance": -98.28238677978516,
"rps_doc_books_importance_length_correction": -91.63396453857422,
"rps_doc_openwebtext_importance": -59.72964096069336,
"rps_doc_openwebtext_importance_length_correction": -59.72964096069336,
"rps_doc_wikipedia_importance": -34.088836669921875,
"rps_doc_wikipedia_importance_length_correction": -23.77045440673828
},
"fasttext": {
"dclm": 0.06101303920149803,
"english": 0.8770458698272705,
"fineweb_edu_approx": 1.7769774198532104,
"eai_general_math": 0.9966276288032532,
"eai_open_web_math": 0.44985413551330566,
"eai_web_code": 0.5025198459625244
}
}
|
{
"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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,932,121,565,630,106,000 |
Over 1 million tech questions and answers.
Did a complete Factory Reset. Now Windows 8.1 not ...
Q: Did a complete Factory Reset. Now Windows 8.1 not ...
The subject pretty much says it all. I have a Lenovo Yoga, and had to do a Factory Reset. Now I'm getting an error that it's not activated. I've gotten the key off the computer itself, and done the Microsoft Activation Center's thing, and couldn't get anywhere. This product is legit, it didn't go anywhere, so why am.i having so much difficulty??
Read other answers
RELEVANCY SCORE 200
Preferred Solution: Did a complete Factory Reset. Now Windows 8.1 not ...
I recommend downloading and running Reimage. It's a computer repair tool that has been proven to identify and fix many Windows problems with a high level of success.
I've used it in the past to identify and fix everything from blue screens (BSOD's), ActiveX errors, corrupt files and processes, dll/exe/sys errors, recover lost memory, Windows update problems, defragging, malware removal etc.
You can download it direct from this link http://downloadreimage.com/download.php. (This link will automatically start a download of Reimage that you can save to your computer.)
RELEVANCY SCORE 83.2
The Envy dv7 was not working properly and decided to do a factory reset. When through all the steps and once the process started, it keeps stopping with the following message: Windows could not complete the installation. To install Windows on this compute, restart the installation. Turning it on and off will give me the same error message. How would I go about installing windows when it does not give me an option anymore? I did the following already: Restore BIOS default settingsTest the hard drive using HP PC Hardware Diagnostics UEFI Any other suggestions? Thank you.
Read other answers
RELEVANCY SCORE 83.2
Backstory: For X-mas we purchased a gently handy-downed Dell Inspiron 3520. I factory reset it so that I could put in our information, I also put on ESET Anti-Virus. I then downloaded the Windows 10 Activator, it ran its process says everything was fine and it started to download. Everything was going great, there was no issues until it came to the final phases which was the reboot. For over 3 hours it just showed nothing more than black screen with Dell Logo.
I call Dell and after 30 minutes they say its a software issue and that I'd have to pay $200+ for them to fix it over the phone with me. I tell them I can't afford that and we disconnect. So I go into the start up system and attempt to Factory Restore it again, it starts the process goes all the way through and then it goes back to the black screen with Dell logo only this time a dialogue box pops up. Its named Install Windows and it says, "Windows could not complete the installation. To install Windows on this computer, restart the installation."
I've tried F8, but its not recognizing it, or even trying to open the command prompt and following other steps I found online such as typing in 'oobe' isn't working.
Any help would be much appreciated.
A:Trying to Factory Reset get this "Windows could not complete
What's the exact service tag/serial number and express service code number on that Dell Inspiron 3520 laptop?
What Windows 10 "activator" are you referring to, and where did you download it from?
--------------------------------------------------------------
Read other 2 answers
RELEVANCY SCORE 75.2
I'm trying to reset/restore my Inspiron all-in-one running Windows 10 while saving my personal files. It gets to 22% complete and stops. The only details I get says "Unable to reset you PC. No files have been changed"
What is going on and how can I do the reset
A:Factory restore/reset will not complete
I'm assuming you're trying to reset from Update & Security(Recovery/Reset This PC)? If yes, I'd suggest you try from Advanced Startup. Please go back to Update & Security,click on Recovery, and then Advanced Startup( Restart now). Stroll down to Troubleshoot, click on it, and then Reset this PC.
Read other 1 answers
RELEVANCY SCORE 73.6
Hi, I started to reinstall my laptop to factory default settings. I realised I had lost recovery disk 5 when asked to insert. I only have 4/5 disks. I can't complete the recovery and my computer wont boot. What must I do? Yuki
Read other answers
RELEVANCY SCORE 64.8
I got this today "Your device is at risk because it’s out of date and missing important security and quality updates. Let’s get you back on track so Windows can run more securely. Select this button to get going"
I ran several command prompts including chkdsk, got a repair utility to repair registery... etc, defragmented and everything I tried every solution found online and I still get this error when useing updates. I even updated my drivers. I tried everything, s I even uninstalled my antivirus and tried it again. I gave up and tried to do a reset and also tried to whipe everything and do a reset and can not. really odd.
Any insight will be appreciated.
Also on the microsoft website I saw a security update dated 09/25/2017 ( today) and when trying to manually update it said it did not apply to my pc. I own a Dell Desktop all in 1 64-bit operating system Product ID 00325-95873-11633-AAOEM touchscreen 24 inch all in one
A:Windows 10 update issues. Also can not do a factory reset or any kind of reset
This sounds like your system took a hit with phishing-ware or other malware.
Factory reset instructions:
www.dell.com/.../reset-or-reinstall-windows-10-on-your-dell-computer
Read other 1 answers
RELEVANCY SCORE 59.2
Basicly my comp has too many problems i can't be stuffed fixing it, and i have nothing important to lose...I have my HP recovery CDs(all 17 =P) and want to completely delete all files and reinstall my system..
Can someone please give me step by step instructions on how to do this?
Also I ahve had someone install a version of AVG 8.0 free which doesn't expire as it has a liscense.. can someone please tell me how to get this back after my complete reinstall if i keep my liscense number.
Thanks already.
A:Complete reset of windows XP
This link will guide you through a complete reinstall of WinXP: *link*
As for the AVG thing: record you license number (on a piece of paper, or whatever) and when you are finished reinstalling XP, go to Grisoft's website and install the trial version AVG 8.0. When it prompts you to register or buy a license, enter you license number that you recorded earlier.
Read other 2 answers
RELEVANCY SCORE 58.8
Hey guys, i found this info form a website on how to completely reset your network.. take a look at this and can someone update it to comply with windows 8.1 64bit?
-what is missing for windows 8.1 64bit to totally reset your network.. this probably should be a sticky at some point too as everybody should know this info..
*these are commands you would type into a administrator command prompt..
UPDATE: On Windows 7, you'll need to do this to reset your network adapters:
ipconfig /flushdnsnbtstat -Rnbtstat -RRnetsh int reset allnetsh int ipv4 resetnetsh int ipv6 resetnetsh winsock reset
Now, reboot and pray. Possibly not in that orde
A:How to Complete reset windows 8 Networking..??
Originally Posted by bassfacer22
-what is missing for windows 8.1 64bit to totally reset your network..
Well, when you hit Diagnose this connection, that is what it basically does, but an interesting idea.
You might also add: "ipconfig /release" and "ipconfig /renew"
https://kb.wisc.edu/helpdesk/page.php?id=37620
ipconfig /flushdns
When DNSCache service is disabled, this problem is gone, it is also recommended for security reasons.
nbtstat -Rnbtstat -RR
Unless you have DSL connection or using file sharing, NetBIOS can be disabled, security reasons as well.
Read other 5 answers
RELEVANCY SCORE 58.4
Hello, I have an older (2007 ish) ASUS laptop that has Windows 7 installed. It is rarely used so I'm not in the market for a new laptop, but it is running extremely slow. Will not download updates, etc. There is some sort of conflict.
I'd like to wipe the whole thing clean but here's my dilemma. Windows Office is installed but I don't have the installation CD's. If I do a factory reset, is there any bare-bones types of word available for download?
Really Word (and IE/Firefox) are all the laptop is used for, so I didn't know if there was some bare bones "light" version of Word out there. Alternatively, is there anything I can download from the laptop now and reinstall after the refresh?
I just don't want to spend hundreds of dollars on a new version of Office.
Thanks!
A:Windows 7 and Factory Reset
What version of Office are you running? There are no bare-bones versions of Word unless you are talking about free programs that can open Office Documents. There are number of those including Kingsoft, Open Office, and Softmaker's Free Office.
Read other 7 answers
RELEVANCY SCORE 58.4
Sorry this is in the wrong section, options were very limited. I have been given a touchsmart 310 running windows 10, I Can not install or change anything because I am not logged in as the administrator but I cannot find the account to log in to matter what I try so I think my best option is to do a factory reset, but I dont know if will I need the windows key. Has anyone everdone this reset & did you need your windows key & am I going to be able to do the reset without being logged in as the administrator.
A:factory reset windows 10
Hi, There are many HP Touchsmart 310, it must be HP touchsmart 310-something such as http://support.hp.com/au-en/document/c02622055 I don't think it has Windows 10 pre-installed and you may not be able to do factory restore because you need Admin password which you don't have. My suggestion: clear everything and install fresh Windows 10 1. Create Windows 10 installation media using the following instructions https://www.microsoft.com/en-au/software-download/windows10 2. Use the media to install Windows 10 to your machine, skip the step to enter the product key and continue, 3. Go online and Windows 10 will automatically activate using the key in the BIOS. Please note: you must install Windows 10 version/edition which is on the machine now, you can't change to other version/edition (ie can't change from Home to Pro for example. Regards.
Read other 1 answers
RELEVANCY SCORE 58.4
Hi was wondering if someone can help please. My Samsung laptop came with windows 7 installed and i done the free windows 10 upgrade. It was all good for a while and then I had an update and now i can get to my homepage but none of the icons are working. I think to myself the only way I can sort it out is to factory reset the laptop but because i have got windows 10 on it now and it was windows 7 am i still able to do this and what operating system will i be on
thanks
A:windows 10 factory reset
Read other 12 answers
RELEVANCY SCORE 58.4
So I installed Windows 8 whenever it came out and then updated to 8.1 last fall. Since then my computer has become bogged down and running really bad. It's time just start fresh but when I go in to the PC settings to restore it, it says I don't have the necessary files and that I need to insert a disc. Since I installed 8.1 from the store I have no disc to restore it from.
I saw some tutorials on activating 8.1 from 8 but I don't even know if I'm following the right ones or not. I'm not sure what I'm doing. This was much easier to do in Windows 7. But anyways, I would really appreciate any help on overcoming this so I can restore my computer.
A:How to do a factory reset of Windows 8.1?
Have you made the OEM manufacturer's Recovery Disks?
Information
We always assume you have made your Recovery Disks using the OEM manufacturer's Recovery Media Creator app the first day you had your new PC.
& made the Startup Repair CD. (Windows 8 only)
Recovery Drive - Create with USB Flash Drive in Windows 8
System Repair Disc - Create in Windows 8 (Windows 8 only)
I would recommend you making the OEM manufacturer's Recovery DVD's or USB drive.
or
You can order the Microsoft official OEM Recovery disks from the OEM manufacturer's website.
Read other 4 answers
RELEVANCY SCORE 58.4
I haven't done a wipe and reload of my OS in a long time and just a week or so ago i heard someone say something about a factory reset and heard all about it but didnt hear much about how to do it so how is it done . I googled/youtube searched it and it gave me nothing about it all it came up is restoring your computer and recovery options so is there an easy way of doing so any help would be appreciated.
Sorry for my bad spelling and grammar errors.
A:Need to know how to do a factory reset in windows 7?
It's doable through tutorials on this site IF your PC has the capability. Some do, some don't.
But a few questions:
Have you made one or more "recovery" discs, by burning to a CD or DVD?
If you have not made recovery disks, your PC may or may not have a recovery partition that will allow you to restore to the state in which the PC left the factory.
Are you familiar with Windows Disk Management?
Does your PC have a sticker on it with a 25 character "Product Key"? If it does, you should be able to do a fresh install of Windows that you may prefer to a "factory reset", depending on your preferences. Many people don't like the configuration from the factory and would prefer a custom setup. Maybe you would. Maybe not.
Read other 9 answers
RELEVANCY SCORE 58.4
bought a used windows 7 pc. the owner built it themselves. i want to factory restore it... but it says i need the windows 7 disk to do that (something like that cant remember exact phrase).. which disk do i need exactly... would i need to buy the whole new windows 7 program? or are there just ones so i can just facorty reset it?
A:need windows 7 factory reset help
and also will i lose all my drivers?
-op
Read other 2 answers
RELEVANCY SCORE 58.4
I've been trying to get it to factory reset with no luckI turned laptop on and it said automatic repair then changed to diagnosin problem and didn't move for about an hour so tryed to resetI've held the power button and f11, then troubleshoot, there's no option to reset so done system restore , that said there were no restore points , and took me to a new menu with the reset option I clicked that and it just stayed on that screen for hours
Read other answers
RELEVANCY SCORE 58.4
I bought my Pavillion in 2014 and of course it came with Windows 8.1. I've upgraded it to windows 10 for about a year. I'm still a student and I want to use purley for school work. Problem is I have lots of junk on it like games that I no longer need. I thought of a lot of things to speed it up as it is painfully slow such as an SSD upgrade, but that is a bit pricey. The only thing I could think of is reset it so it doesn't have loads of rubbish running in the backround becuase the disk is always running at 100% usage (even at idle). So I was thinking, if i reset it to factory settings, will it keep windows 10 on it or will it degrade back to windows 8.1? Many thanks
A:If I factory reset, will it keep windows 10?
JC442 Hello;Allow me to welcome you to the HP forums!A "factory reset" returns the PC to the state it was in when it left the factory, so of course, it will reinstall the original OS, drivers, and apps.
Read other 1 answers
RELEVANCY SCORE 58.4
i've factory reset my laptop and its been an hour since it was 9% , it didn't go on any higher , any ideas whats the problem here?
Read other answers
RELEVANCY SCORE 58.4
Hey everyone,
I'm returning my Asus G53sw-A1 w/ Windows 7 and getting a replacement shipped.
Long story short, my video card is demonic.
Anyways, I have done a lot of personal work during the last week and want to make sure everything is absolutely wiped clean before I ship this back.
How do I do this?
Thanks in advance,
Brady
A:How do I reset Windows 7 to factory?
Just hit it with the oem disks that came with the computer that should wipe everything and return it to a factory state.
Read other 9 answers
RELEVANCY SCORE 58.4
I have an HP ENVY 700 that has been having many issues over a long period of time. It most recently got so bad that it would not start. After calling HP support and purchasing a "Smart Friends" membership, they told me that there was most likely some corrupted files in my booting system that stopped it from rebooting. After almost a month of attempting to fix the issue, HP sent me 5 "System Recovery" discs to factory reset my entire hard drive. I was first unable to back-up any of my files that were on the computer (because, again, it won't start up to where I can remove them and also the recovery manager won't work either) and now, after many late nights and hours on call with HP, the recovery manager cannot even factory reset my computer. I make it through 4 full discs before reaching 70% progress on the 5th disc where I get an error message. It reads "Recovery Manager could not restore your computer using the factory image. Please contact HP support. Error code: 0xe0ef0003" (Those are all zeros by the way.) I have called the support, or "smart friends" back and they said that it was either an issue with the discs (which were completely new and barely out of the package) or a hardware problem unlike they had originally believed. I hope somebody here can point me in the right direction before I am forced to buy yet another membership for the separate tech support specifically for hardware. Thank you for your feedback!!!
... Read more
Read other answers
RELEVANCY SCORE 58.4
Hi I began a factory reset on an old windows 7 laptop during the process the laptop lost power,I managed to start the reset again but it's been saying please wait for the last three days when I boot into safe mode everything seems to be set up.Is there anyway to stop or force stop the reset.
A:windows 7 factory reset
Read other 16 answers
RELEVANCY SCORE 58.4
hiI want to get back to the os that came with my laptop windows 8.1 upgraded to windows 10 I did not like 10 so put on win 7 BUT I not know that you could not get any drivers for this laptop under win 7 So press f11 on start up BUT only windows 7 showing, how can I get back to win 8.1 then to win10 Many thanks
A:factory reset windows 8.1
Hi: If you previously had upgraded to W10 and it was successfully activated, you can go right back to W10 by using the Media creation tool at the link below and clean install W10. When you get to the window during the installation process where you are asked to input a product key, select the 'I don't have a product key' option, and W10 will install and autumatically reactivate once you are connected to the internet. https://www.microsoft.com/en-us/software-download/windows10 If you want to go back to W8.1, you will have to use the W8.1 recovery media you should have made when you first got the PC.
Read other 1 answers
RELEVANCY SCORE 58.4
So, I want to factory reset Windows 10 through Settings. There are two options which are: to keep files and to remove files. I only want to delete everything from C, but not in D, because I made backups there. Is there a way to reset Windows 10 in that way? Thanks.
A:Best way to factory reset Windows 10?
Read other 8 answers
RELEVANCY SCORE 58.4
Hello! I have an old Dell Latitude D630 with Windows 7, I do not have the disk, and apparently the product key I got from NirSoft's ProduKey isn't valid. Is there any way to reset it?
A:Factory reset Windows 7
What are you trying to reset? Are you looking to reinstall Windows.
A program such as this one should be able to grab your key:
https://www.magicaljellybean.com/keyfinder/
Read other 2 answers
RELEVANCY SCORE 58
Hey guys, didn't want to double post so here is my question but I really like this "general" forum so I posted it here too..
-quick question about Completely resetting your network in windows 8.1
please have a quick look below..
How to Complete reset windows 8 Networking..??
thanks
thanks
A:Complete reset windows 8.1 networking question..
Not too crazy about the " Reboot and Pray" part.
Read other 2 answers
RELEVANCY SCORE 58
Windows 10 caused so many issues with my laptop. We reset to factory settings and no its says there is no operating system. The recovery partition was corrupt. Where can I get a windows 7 os disk or download?
Read other answers
RELEVANCY SCORE 58
Hi.
I have a Toshiba Satellite a500-19x which is about 2 years old. I have had problems with factory reset on the laptop and would like some advice on what might be the problem.
I have done a factory reset on the laptop a few times and each time there was a problem, which I will do my best to explain. What happens is as follows -
Starts factory reset and all goes well. Asks for User Name, Keyboard Layout ect starts to install setup and then start up to a brand new homepage.Next it shuts down. Automatically boots up again, goes through this all again 'Installing setting for System Restore' and then shuts down, boots up and repeat and repeat.
It will do this for maybe 30 minutes before it stops. The computer will turn on and work fine after like factory new.
I brought it back to the shop and they said something about Windows was not installed properly on the laptop at the start and that is why it done it.
The hard drives crashed about a year ago and were replaced through the shop and all worked fine.
However now I would like to preform a factory reset just to spruce up the laptop but am afraid it will still have this problem.
Any help/suggestions or fixes would be appreciate and feel free to ask for more info in case I left anything out.
Thanks
A:Windows 7 Factory reset problem
How are you doing the system restore. Is it from a partition on the Hard Drive or through a set of recovery disks. If you are doing it from the hard drive and the drive was going bad this could have caused the problem. Also if a shop reinstalled the operating system they may not have put the recovery partition on the drive. In this case you would need recovery discs. If you do not have them, they can be ordered through the manufacturer.
Read other 26 answers
RELEVANCY SCORE 58
I got a pc which has Windows 8.1 Single Language before and I upgraded it to Windows 8.1 PRO if I reset the factory settings does it will go back to windows 8.1 single language?
A:Reset Factory Settings Windows 8.1 PRO
Did you upgrade using "Get Features with a New Edition of Windows" or Clean Installation?
Read other 5 answers
RELEVANCY SCORE 58
Hello,
I want to perform a factory reset on Dell Inspiron M511R that came with Win7 preinstalled. Do I need Windows Product Key?
The CoA label is sticked on the bottom of the laptop and after years of usage it just became unreadable. The computer is functioning normally so far.
Can I get the WPK somehow? (The same or a new one.)
Thank you.
A:factory reset and Windows Product Key
You can do a clean install of Windows 10, as long as the system has been activated with Win 10 and has it digital license. Just skip past where they ask for a license key.
Doing a factory reset over a newer OS may be a problem. Are you wanting to do that because you need some of the OEM utilities? It is usually best to do clean installs, especially when changing OSes..
I will assume the system was not using a UEFI bios which means the license in not there. Some third party software may be able to retrieve a key but I have no experience. If you have OEM recovery media, it might work, maybe someone else will know for sure.
Read other 1 answers
RELEVANCY SCORE 58
need some help with a factory reset on windows 8.
my son decided to reset his windows 8 laptop to original factory settings, during the reset process his mom decided it was taking to long and turned off the laptop.
now when its turned on it shows the message "restoring your computer", this message will then change to "diagnosing your computer", the screen will then go blank and it start all over again.
I can boot it from a USB drive, but when I click on "repair" i get an error message that it cant repair the computer.
when i try to run restore from the USB I get a similar message.
is there anyway to run the system restore from the DOS prompt?
A:windows 8 factory reset problem
Welcome to EightForums.
Try doing Reset.
Information
We always assume you have made your Recovery Disks using the OEM manufacturer's Recovery Media Creator app the first day you had your new PC.
& made the Startup Repair CD.
Recovery Drive - Create with USB Flash Drive in Windows 8
System Repair Disc - Create in Windows 8
You can use the OEM version of
Recovery Drive - Create with USB Flash Drive in Windows 8
Warning
Deleting the Recovery Partition is NOT RECOMMENDED
Did you make the OEM manufacturer's Recovery Disks?
You can order the Microsoft official OEM Recovery disks from the OEM manufacturer's website.
The Recovery USB drive can be very problematic, I recommend you also make a Windows System Image.
System Image - Create in Windows 8
Recovery Drive - Create with USB Flash Drive in Windows 8
System Repair Disc - Create in Windows 8
System Image Recovery - Restore Image on Computer in Windows 8
or
look for a 3rd party ,Backup software, which fully supports Windows 8, uEFI, GPT & Secure Boot.
Which is signed by Microsoft.
Read other 12 answers
RELEVANCY SCORE 58
I was trying to factory reset my laptop to give it away to a friend and when I was doing that it had a problem doing so. So I tried to restart it and now it give me a black screen with white lettering (an operating system wasn't found. Try disconnecting any drives that don't contain an operating system.) I tried f11 at the beginning but it just has F11... System recovery but I just freezes..... Help
Read other answers
RELEVANCY SCORE 58
hi.
my name is sagie and i have my reinstallation disk of windows 7 but he is scratched(not working)
i have all other details but this disk id done for .
now my computer was "fixed" once so i dont have the recovery in my hard drive.
i want to creat a new reinstall disk or something so ican finally format my computer again.
btw i have dell inspiron n5010 win 7 X64
thanks for help (:
A:Restore my windows 7 to its factory reset
Hi
Please take a look at the bottom of your laptop and check whether there is a COA sticker like the below one.
If yes, you can use the key printed on that sticker to perform a clean installation. Please refer the detailed guide written by "gregrocker" for more info.
Clean Reinstall - Factory OEM Windows 7
The guide covers everything you need to know and includes download links for legal versions of Windows 7. Make sure to download the exact edition of Windows 7 image which will be printed on the sticker ( ie Pro means Professional ). After performing the clean install, use phone based activation as online activation is not supported for OEM installations.
Activate Windows 7 by Phone
Read other 5 answers
RELEVANCY SCORE 58
Upgraded to Windows 10, 8 months ago but did not know my Pavilion dv6 did not have Windows 10 drivers to support it. Now I have problems with Windows update. Solution is to go back to Windows 7 but not really sure how.First I would backup all personal files (non-applications).- Would I lose my applications that came with my laptop from HP such as MS Office if I did a factory reset? - If yes, would HP give me the key to get MS Office reinstalled if my PC is not in warranty anylonger? Or do I have to purchase it again?If I press ESC during startup, will it allow me to go back to Windows 7 There is a D: Recovery drive on the PC and E: HP Tools drive.; what are these used for? Also, I have 3 Discs that were created for me by Geek Squad after i got my laptop in 2010, labeled HP Recovery Disc. Would I use them to go back to Windows 7 and would they have MS Office on them?
Read other answers
RELEVANCY SCORE 58
Hi,
I'm trying to reboot my Windows 8 (factory reset). I followed the tutorial of eightforums.com, though
it is still not working. I tried three differents things
1. I went to settings, change PC settings, general then remove everything and reinstall windows but I had the following error message "Insert media, some files are missing. Your windows installation or recovery media will provide these files".
2. After booting my usb key with the installation files, I restarted my computer then I went to "Troubleshoot"
then "Reset your PC" and I had the following error message "Insert your Windows installation or recovery media to continue". So failure
3. The last thing I found do not do a factory reset, but ask me where to build the OS between 8 different partition. (I have Debian, Ubuntu (which doesn't work) and windows 8 and one "shared file" between Debian and windows8
Thanks
Read other answers
RELEVANCY SCORE 58
I'm beginning to reach the end of the road with my laptop, and I'd rather get it working than get a new one, but I'm a tad bit of a noob, so please explain things clearly, thanks.
Upon my intense dissatisfaction with windows 10, I decided to switch to linux, and I therefore created another partition on my hard drive and installed linux on it. Things were fine for a while, I was using linux fulltime, and despite windows 10 still being on my laptop, I never booted into it. This remained the case for around 2-3 weeks, before I decided to switch back to Windows 10.
However, upon attempting to boot into windows 10, the bootscreen came up, but it just stayed there forever, without booting, so I held the power button to get out of it.
I therefore used a system recovery disk that I made a few months ago when windows 10 was still working to get into the recovery options (I can't access them from the OS itself because I can't get into the OS in the first place.)
I went into Troubleshoot and attempted a full system reset, which I hoped would also remove Linux and in general fix all of the problems. However, the reset failed, and I had no clue why it had done so, and so I attempted a startup repair. It searched for faults and before long was displaying the message "Repairing disk errors. This might take over an hour to complete." with the Toshiba logo above it (brand of my laptop). This made me suspect that there may be some kind of hard drive fault. It was running for a fe... Read more
A:Windows won't boot or do a factory reset
Originally Posted by Adam Partridge
I'm beginning to reach the end of the road with my laptop, and I'd rather get it working than get a new one, but I'm a tad bit of a noob, so please explain things clearly, thanks.
Upon my intense dissatisfaction with windows 10, I decided to switch to linux, and I therefore created another partition on my hard drive and installed linux on it. Things were fine for a while, I was using linux fulltime, and despite windows 10 still being on my laptop, I never booted into it. This remained the case for around 2-3 weeks, before I decided to switch back to Windows 10.
However, upon attempting to boot into windows 10, the bootscreen came up, but it just stayed there forever, without booting, so I held the power button to get out of it.
I therefore used a system recovery disk that I made a few months ago when windows 10 was still working to get into the recovery options (I can't access them from the OS itself because I can't get into the OS in the first place.)
I went into Troubleshoot and attempted a full system reset, which I hoped would also remove Linux and in general fix all of the problems. However, the reset failed, and I had no clue why it had done so, and so I attempted a startup repair. It searched for faults and before long was displaying the message "Repairing disk errors. This might take over an hour to complete." with the Toshiba logo above it (brand of my laptop). This made me suspect that there may be ... Read more
Read other 4 answers
RELEVANCY SCORE 58
Hi,just bought X1 Yoga 1st Gen and wanted to do a factory reset (also known as Windows 10 "Reset this PC")The system kind of not finished the reset process.. I saw the precentage bar going and then a black screen which continues to be black (the computer is on, the keyboard light is on.. )now the computer shows the Lenovo logo and keep booting itself.. i tryied to press Enter and go to F11 (Recovery) but nothing changed..- How can i get myself the Windows 10 Pro Signature Edition?
Read other answers
RELEVANCY SCORE 58
hi, my laptop came stock with windows 7 64 bit professional in one of the partition, and also DVD.and currently it's being upgraded to windows 10 64 bit. i suspect due to the upgrade, the performance is really slow as it's meant for work. are there anyway that i can get hold of how to restore it to windows 10 64 bit factory setup DVD?
Read other answers
RELEVANCY SCORE 58
Please see my first post under "will not update" to see where this all started
A brief history...I had serious 'infections' (see page 2, message number 27)
after many days of scans and fixes it was decided I should do a factory reset. (see page 9, message number 124)
I did the wrong type of backup, 10 discs, but only the first one was put back on after the reset.
Many more days of scans and errors. It was decided I should try again. This time I only backed up my files. they have not been reinstalled yet. Did have problems with the factory reset. (see page 13, message number 181 and message 195)
Still getting lots of errors... see the last two pages of previous post for the VEW scans
Figuring the problem could be that the reset process was interrupted. Thought I would try another factory reset but now when I try that 'files cannot be found' and I am instructed to insert recovery disc...which I do not have.
So, three questions.
Can the errors be fixed without doing another factory reset?
If not, can I make a recovery disc from my other windows 7 computer?
If I do that, will I be prompted to enter the code that proves it is a legit copy of Windows, since it comes from a different computer. I was not prompted to enter anything when I did the factory resets.
Edited by Cookiegal to include link to previous thread as point of reference:
http://forums.techguy.org/8798129-post195.html
A:windows errors after factory reset
Read other 16 answers
RELEVANCY SCORE 58
I am trying to use the Hp recovery feature to reset my laptop back to the factory default OS windows 8, however when i try to launch into the recovery enviorment using the HP Recovery manager application i am faced with an error "Can?t open file: X:\sources\Recovery\tools\HP\Rita-tool\". i did see the article here http://support.hp.com/us-en/document/c04758961 stating to download an update to fix this issue, but it did not prevent me from getting this error. my thought is that the HP recovery applications is not truly installed on my OS, im thinking this because it does not show up in the programs and features section in the control pannel, however the files are still intact for it from when i transitioned to windows 10. is it possible to re-install this application properly? i still have the recovery partition on my hard drive i just need a way to load it.
Read other answers
RELEVANCY SCORE 58
My computer was running slow so I tried to factory reset my computor. It got to 33% and failed. I tried again and again but it keeps getting stuck at 33%. When I try to boot up normal it is unable to start windows so I can't get into safe mode. This is the error it gives me when I try to restore.
Restore failed - error code=0x17 (WIMAPPLYImage cannot apply image : data error (cylinder redundancy check).)
I have an emachines. It has a product key on the side but when I tried to put it in on Microsoft Windows download, from another computer, it said that this key goes to a software from computer. Is there any way I can get windows back?
A:windows failed to factory reset...
Well...eMachines was acquired by Gateway...which was acquired by Acer...which no longer supports the eMachines line. See http://www.neowin.net/news/acer-ditching-cheap-emachines-pc-brand .
Both Gateway and eMachines seem to have a history of possibly faulty recovery mechanisms.
The only thing I can suggest is to contact someone at the eMachines website and try to get replacement disks,
eMachines Customer Service
Louis
Read other 1 answers
RELEVANCY SCORE 58
how do i factory rest my inspiron mini 10 laptop i have no cd rom drive i just have the usb ports and how do i get a good windows 8.1 on my laptop with out paying for it until the 1st or the secound month on the first i got my laptop for free and its needs
to be wiped and cant figure on how to do it... I want to download it to my laptop and reset the whole laptop and even wipe the accounts out of it....
Read other answers
RELEVANCY SCORE 58
Hi everyone,
just wondering why my computer randomly reset itself to its previous out of the box condition. Actually, not even that, I just put it on today and after I logged in it said it was configuring Windows...so I thought maybe it was just an automatic update that was being applied. However, my windows 8 theme has been changed, I have lost all of my tiles except maybe a few, and my desktop Icons have been cleaned up, not completely, just the ones I don't use often. Also, I am missing a lot of files from my documents, my desktop, my downloads and anywhere else I saved files. The browsers I use which are Chrome, Firefox and IE all start as if it was the first time they were used, also all of my bookmarks, saved passwords and all other records are gone. However, none of the software I installed has been changed or removed.
I checked my update history and according to that record I haven't received an auto update since July 21st. It is very unlikely that anybody else has used my computer in the last 12 hours because nobody else knows my password, nor can they guess it.
I am not sure what else to consider...any ideas...
A:Random Windows 8 Factory Reset?
Okay, all of a sudden, I log in today and everything is back to normal again. All of my files have been restored just the way they were. The theme has been restored, my tiles, my browsers, everything. Very strange, maybe it is a virus, either way I am not ready to mark as solved because it might happen again.
Read other 2 answers
RELEVANCY SCORE 58
I have a HP pavilvion running windows 8.1 , after installing some updates my computer went really slow, now I am trying to do a factory reset, but every time I try to do this my computer says " can't find a find a factory image" or " Unable to reset your PC. a required drive partition is missing". Thank you.
Read other answers
RELEVANCY SCORE 58
I had been having problems with my work PC for months. Very slow boot up, lagging during use, programs not responding etc...
Then worse issues started like the system restore not saving any restore points, not allowing me to manually create restore points...
I tried all the normal stuff.
Sfc Scan came up clean, Check disk came up clean, AVG and Malwarebytes scans were clean....
It seemed like the longer I left it on the better it ran, but anytime it restarted it got terrible again. Then about a week ago I tried to do another Check Disk, I scheduled it and restarted the PC as I was leaving for the day.
When I got in the next morning I checked the event log and no Check disk was on there. So I tried it again that day and the same thing happened.
Then yesterday it all blew up. I was on my PC it was mostly running ok, except for skype which would not properly connect. Since I need that program working to do my job I restarted the PC.
It would let me enter my password but then was stuck on the Welcome screen for about 30 minutes.
So I powered down and tried to boot into safe mode, and it did the same thing, stuck on the welcome screen.
So I powered down again and went into start up repair. Startup repair failed.
I used a command prompt to run check disk on C: and it only took about 30 seconds which I found odd but it said it came up clean. I also did it on DBackup) and it also took about 30 seconds and came up clean. Then I did it on EOS) and it was going extremely... Read more
A:Windows will not boot - even after factory reset
It may be a corrupt Windows Update, is your PC set to auto update?
Perhaps another reset but this time set updates to notify.
Also check the disk health with its manufacturer's tools.
Read other 1 answers
RELEVANCY SCORE 58
I have factory reset once before with windows 10 and it let me keep windows 10 when I did it. But now I want to do it again but it is showing me a notice that if i reset, I will go back to windows 7. Is there a way I can factory reset my pc while still keeping windows 10?
Also I have another question but I don't want to make another thread about it. In games such as cs go, why is my game freezing for no reason? About every 30 sec - 1 min, i freeze for about 5-10 seconds. Between the freezes, i get split second freezes. This is really annoying me. Anybody know how to fix? I am getting a constant 200 fps and 10 ping
A:How to factory reset without losing windows 10?
Hi, factory reset = have the PC restored to the state it was in when you bought it (as far as what's on the disk is concerned!).
If you bought it with Win 7, it will revert to Win 7, assuming you still have the relevant partition on your disk. Everything else on the disk will be lost. Repeat, everything.
You may wish to consider an in-place repair install which allows you to keep everything, and completely refreshes Windows.
Repair Install Windows 10 with an In-place Upgrade - Windows 10 Forums
Alternatively, you can clean install Win 10, and it will automatically register since you have it installed already. That will only affect the partition on which you have Win 10 installed, but you will lose all programs installed and all settings you have configured, and you will lose all personal data on that partition.
Hope that helps.
Read other 1 answers
RELEVANCY SCORE 58
My Navy father is shipping back out to Kuwait in a few weeks and a friend gave him a laptop to take overseas. It seems to be plagued with viruses. Google redirects, fake antivirus popups, etc have made this computer nearly unusable. We have tried everything and thought the issues were fixed but they keep coming back. At this point we are at our wits end and just need to wipe the bleeping thing.
Please forgive my noobishness, but I am an amateur when it comes to this stuff and my dad has no one else to help him with this stuff. We need to reinstall windows 7 pro but we do not have any discs and there seems to be no option to completely wipe this thing like i can with my desktop, which apparently has windows 7 formatted to the HDD permanently.
The computer is an HP Elitebook 8560w. As I said we do not have the install discs for windows. Will it be necessary to obtain some discs or is there anything else I can do to completely wipe everything and start from scratch? There is nothing that needs to be backed up. Any help would be most appreciated as my dad would love to be able to use this machine to Skype with his family back home. Thank you in advance.
A:Help reinstalling Windows 7 Pro / factory reset
A factory reset does the job, see http://www.manualslib.com/manual/667014/Hp-Elitebook-8560w.html?page=131 .
Louis
Read other 16 answers
RELEVANCY SCORE 58
hi there I bought windows 8 as a download back when it was first released. I reverted my computer back tofactory settings today to solve a few problems I was having with my system, however I am now back to windows vista!! how can I recover my windows 8?
A:how can I get windows 8 back after a factory reset?
I dont believe you can undo a reset/refresh unless you made an image of wiin8 at some point when it was running..
You may have to reinstall that downloaded version.
Which reminds me Im going to do one today! I have my win8 setup very nice, I dont want to have to re-do it...
Read other 5 answers
|
{
"url": "http://thewikipost.org/topic/opSaJ8VcCUtxM3BkQznr4YE6MmyhzYza/Did-a-complete-Factory-Reset-Now-Windows-8-1-not.html",
"source_domain": "thewikipost.org",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "113149",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F5ZYRXN6ALIQ2LKJZHTMKXTXX4JNO3KC",
"WARC-Concurrent-To": "<urn:uuid:83e125ec-49bb-4d88-bc22-04a8c77fe271>",
"WARC-Date": "2018-11-17T19:41:06Z",
"WARC-IP-Address": "104.27.149.214",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:WRIL6DQ67UJ47LDWNPURQ6W6ZTE7R3FU",
"WARC-Record-ID": "<urn:uuid:88ff0cf7-f177-4e18-af3f-fd539a8b1f70>",
"WARC-Target-URI": "http://thewikipost.org/topic/opSaJ8VcCUtxM3BkQznr4YE6MmyhzYza/Did-a-complete-Factory-Reset-Now-Windows-8-1-not.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c0f9fb8e-eade-4310-a9e4-0b8231e71e96>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-166-161-213.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,
43,
44,
98,
99,
156,
157,
505,
506,
525,
545,
619,
620,
786,
787,
1015,
1016,
1194,
1195,
1216,
1217,
1794,
1795,
1814,
1835,
1836,
2301,
2302,
2856,
2857,
3023,
3024,
3060,
3062,
3063,
3126,
3127,
3237,
3238,
3324,
3325,
3388,
3390,
3391,
3412,
3433,
3434,
3652,
3696,
3697,
3739,
3740,
4037,
4038,
4059,
4080,
4081,
4308,
4309,
4328,
4349,
4350,
4563,
4564,
4996,
4997,
5030,
5031,
5303,
5304,
5385,
5386,
5463,
5491,
5560,
5561,
5582,
5603,
5604,
5814,
5886,
5887,
6095,
6096,
6112,
6114,
6115,
6146,
6147,
6218,
6219,
6510,
6512,
6513,
6534,
6555,
6556,
6721,
6722,
6881,
6882,
6955,
6956,
7033,
7034,
7152,
7200,
7201,
7250,
7251,
7284,
7285,
7286,
7357,
7358,
7359,
7360,
7462,
7463,
7525,
7526,
7573,
7592,
7694,
7716,
7821,
7822,
7843,
7864,
7865,
8103,
8105,
8324,
8326,
8570,
8572,
8647,
8649,
8657,
8658,
8688,
8689,
8933,
8934,
8955,
8976,
8977,
9493,
9494,
9521,
9522,
10383,
10384,
10405,
10426,
10427,
10892,
10899,
10901,
10902,
10929,
10930,
10952,
10973,
10974,
11350,
11351,
11626,
11627,
11671,
11672,
11725,
11726,
11741,
11742,
11884,
11931,
11989,
12047,
12048,
12049,
12050,
12051,
12132,
12135,
12228,
12229,
12250,
12271,
12272,
12681,
12682,
12683,
12684,
12685,
12731,
12732,
12787,
12788,
12883,
12884,
12905,
12906,
12977,
12978,
13142,
13143,
13190,
13191,
13516,
13517,
13538,
13559,
13560,
13891,
13892,
13928,
13929,
13966,
13970,
13971,
13992,
14013,
14014,
14458,
14459,
14478,
14499,
14500,
15176,
15177,
15224,
15225,
15428,
15429,
15450,
15471,
15472,
15603,
15604,
15623,
15644,
15645,
15659,
15660,
15739,
15740,
15784,
15785,
15934,
15935,
15953,
15954,
15973,
15979,
15980,
16019,
16020,
16141,
16142,
16163,
16184,
16185,
17630,
17644,
17645,
17664,
17685,
17686,
17979,
17981,
17982,
18008,
18009,
18031,
18052,
18053,
18368,
18369,
18397,
18398,
19004,
19005,
19026,
19047,
19048,
19314,
19316,
19317,
19357,
19358,
19379,
19400,
19401,
19585,
19586,
19612,
19613,
19681,
19682,
19742,
19743,
19787,
19788,
19809,
19828,
19829,
19954,
19955,
20026,
20059,
20060,
20107,
20108,
20115,
20116,
20117,
20124,
20125,
20176,
20177,
20226,
20227,
20248,
20267,
20268,
20477,
20478,
20497,
20516,
20517,
20521,
20695,
20696,
20850,
20851,
21168,
21169,
21287,
21288,
21438,
21439,
21536,
21537,
21665,
21666,
21780,
21781,
21788,
21789,
21823,
21824,
22265,
22266,
22288,
22307,
22308,
22486,
22487,
22528,
22529,
22619,
22620,
22641,
22660,
22661,
22668,
22790,
22940,
22992,
23003,
23004,
23044,
23045,
23218,
23420,
23679,
23680,
23701,
23720,
23721,
23771,
23936,
24127,
24245,
24309,
24310,
24373,
24374,
24408,
24409,
24433,
24434,
24451,
24452,
24453,
24468,
24469,
24611,
24641,
24699,
24740,
24741,
24742,
24743,
24744,
24745,
24776,
24834,
24845,
24896,
24897,
24898,
24950,
24951,
25044,
25045,
25046,
25047,
25048,
25049,
25147,
25148,
25183,
25184,
25242,
25243,
25284,
25285,
25348,
25349,
25352,
25448,
25478,
25479,
25501,
25520,
25521,
25924,
25925,
25944,
25963,
25964,
25968,
25969,
26066,
26119,
26120,
26199,
26200,
26292,
26293,
26334,
26335,
26354,
26355,
26399,
26400,
26403,
26404,
26513,
26514,
26515,
26671,
26672,
26712,
26713,
27070,
27071,
27099,
27100,
27121,
27140,
27141,
28027,
28028,
28047,
28066,
28067,
28071,
28072,
28174,
28231,
28232,
28476,
28477,
28588,
28724,
28725,
28950,
28951,
28958,
28959,
28978,
28997,
28998,
29178,
29179,
29567,
29568,
29738,
29739,
29968,
29969,
30502,
30503,
30546,
30547,
30583,
30584,
30585,
30765,
30766,
31154,
31155,
31325,
31326,
31555,
31556,
32035,
32036,
32057,
32076,
32077,
32565,
32566,
32585,
32604,
32605,
32942,
32943,
32962,
32981,
32982,
33061,
33062,
33139,
33251,
33252,
33350,
33351,
33587,
33588,
33678,
33679,
33906,
33907,
33928,
33989,
34058,
34262,
34263,
34341,
34342,
34389,
34391,
34392,
34429,
34430,
34452,
34471,
34472,
35342,
35343,
35362,
35381,
35382,
35680,
35790,
36025,
36026,
36063,
36064,
36254,
36256,
36346,
36348,
36458,
36460,
36487,
36489,
36495,
36496,
36517,
36536,
36537,
36794,
36946,
36947,
36966,
36985,
36986,
36999,
37000,
37825,
37826,
38076,
38077,
38128,
38130,
38131,
38165,
38166,
38477,
38479,
38480,
38501,
38520,
38521,
38832,
38833,
38852,
38871,
38872,
38997,
39131,
39132,
39162,
39163,
39255,
39256,
39484,
39629,
39630,
39820,
39821,
39918,
40026,
40104,
40105,
40376,
40377,
40428,
40429,
40496,
40555,
40556,
40614,
40615,
40636,
40655,
40656,
40929,
40930,
41279,
41280,
41330,
41331,
41460,
41461,
41638,
41639,
41762,
41833,
41834,
42157,
42158,
42175,
42176,
42197,
42216,
42217,
42615,
42969,
43385,
43386,
43436,
43437,
43546,
43548,
43554,
43555,
43577,
43596,
43597,
43851,
43852,
43906,
43907,
44021,
44022,
44073,
44074,
44184,
44185
],
"line_end_idx": [
43,
44,
98,
99,
156,
157,
505,
506,
525,
545,
619,
620,
786,
787,
1015,
1016,
1194,
1195,
1216,
1217,
1794,
1795,
1814,
1835,
1836,
2301,
2302,
2856,
2857,
3023,
3024,
3060,
3062,
3063,
3126,
3127,
3237,
3238,
3324,
3325,
3388,
3390,
3391,
3412,
3433,
3434,
3652,
3696,
3697,
3739,
3740,
4037,
4038,
4059,
4080,
4081,
4308,
4309,
4328,
4349,
4350,
4563,
4564,
4996,
4997,
5030,
5031,
5303,
5304,
5385,
5386,
5463,
5491,
5560,
5561,
5582,
5603,
5604,
5814,
5886,
5887,
6095,
6096,
6112,
6114,
6115,
6146,
6147,
6218,
6219,
6510,
6512,
6513,
6534,
6555,
6556,
6721,
6722,
6881,
6882,
6955,
6956,
7033,
7034,
7152,
7200,
7201,
7250,
7251,
7284,
7285,
7286,
7357,
7358,
7359,
7360,
7462,
7463,
7525,
7526,
7573,
7592,
7694,
7716,
7821,
7822,
7843,
7864,
7865,
8103,
8105,
8324,
8326,
8570,
8572,
8647,
8649,
8657,
8658,
8688,
8689,
8933,
8934,
8955,
8976,
8977,
9493,
9494,
9521,
9522,
10383,
10384,
10405,
10426,
10427,
10892,
10899,
10901,
10902,
10929,
10930,
10952,
10973,
10974,
11350,
11351,
11626,
11627,
11671,
11672,
11725,
11726,
11741,
11742,
11884,
11931,
11989,
12047,
12048,
12049,
12050,
12051,
12132,
12135,
12228,
12229,
12250,
12271,
12272,
12681,
12682,
12683,
12684,
12685,
12731,
12732,
12787,
12788,
12883,
12884,
12905,
12906,
12977,
12978,
13142,
13143,
13190,
13191,
13516,
13517,
13538,
13559,
13560,
13891,
13892,
13928,
13929,
13966,
13970,
13971,
13992,
14013,
14014,
14458,
14459,
14478,
14499,
14500,
15176,
15177,
15224,
15225,
15428,
15429,
15450,
15471,
15472,
15603,
15604,
15623,
15644,
15645,
15659,
15660,
15739,
15740,
15784,
15785,
15934,
15935,
15953,
15954,
15973,
15979,
15980,
16019,
16020,
16141,
16142,
16163,
16184,
16185,
17630,
17644,
17645,
17664,
17685,
17686,
17979,
17981,
17982,
18008,
18009,
18031,
18052,
18053,
18368,
18369,
18397,
18398,
19004,
19005,
19026,
19047,
19048,
19314,
19316,
19317,
19357,
19358,
19379,
19400,
19401,
19585,
19586,
19612,
19613,
19681,
19682,
19742,
19743,
19787,
19788,
19809,
19828,
19829,
19954,
19955,
20026,
20059,
20060,
20107,
20108,
20115,
20116,
20117,
20124,
20125,
20176,
20177,
20226,
20227,
20248,
20267,
20268,
20477,
20478,
20497,
20516,
20517,
20521,
20695,
20696,
20850,
20851,
21168,
21169,
21287,
21288,
21438,
21439,
21536,
21537,
21665,
21666,
21780,
21781,
21788,
21789,
21823,
21824,
22265,
22266,
22288,
22307,
22308,
22486,
22487,
22528,
22529,
22619,
22620,
22641,
22660,
22661,
22668,
22790,
22940,
22992,
23003,
23004,
23044,
23045,
23218,
23420,
23679,
23680,
23701,
23720,
23721,
23771,
23936,
24127,
24245,
24309,
24310,
24373,
24374,
24408,
24409,
24433,
24434,
24451,
24452,
24453,
24468,
24469,
24611,
24641,
24699,
24740,
24741,
24742,
24743,
24744,
24745,
24776,
24834,
24845,
24896,
24897,
24898,
24950,
24951,
25044,
25045,
25046,
25047,
25048,
25049,
25147,
25148,
25183,
25184,
25242,
25243,
25284,
25285,
25348,
25349,
25352,
25448,
25478,
25479,
25501,
25520,
25521,
25924,
25925,
25944,
25963,
25964,
25968,
25969,
26066,
26119,
26120,
26199,
26200,
26292,
26293,
26334,
26335,
26354,
26355,
26399,
26400,
26403,
26404,
26513,
26514,
26515,
26671,
26672,
26712,
26713,
27070,
27071,
27099,
27100,
27121,
27140,
27141,
28027,
28028,
28047,
28066,
28067,
28071,
28072,
28174,
28231,
28232,
28476,
28477,
28588,
28724,
28725,
28950,
28951,
28958,
28959,
28978,
28997,
28998,
29178,
29179,
29567,
29568,
29738,
29739,
29968,
29969,
30502,
30503,
30546,
30547,
30583,
30584,
30585,
30765,
30766,
31154,
31155,
31325,
31326,
31555,
31556,
32035,
32036,
32057,
32076,
32077,
32565,
32566,
32585,
32604,
32605,
32942,
32943,
32962,
32981,
32982,
33061,
33062,
33139,
33251,
33252,
33350,
33351,
33587,
33588,
33678,
33679,
33906,
33907,
33928,
33989,
34058,
34262,
34263,
34341,
34342,
34389,
34391,
34392,
34429,
34430,
34452,
34471,
34472,
35342,
35343,
35362,
35381,
35382,
35680,
35790,
36025,
36026,
36063,
36064,
36254,
36256,
36346,
36348,
36458,
36460,
36487,
36489,
36495,
36496,
36517,
36536,
36537,
36794,
36946,
36947,
36966,
36985,
36986,
36999,
37000,
37825,
37826,
38076,
38077,
38128,
38130,
38131,
38165,
38166,
38477,
38479,
38480,
38501,
38520,
38521,
38832,
38833,
38852,
38871,
38872,
38997,
39131,
39132,
39162,
39163,
39255,
39256,
39484,
39629,
39630,
39820,
39821,
39918,
40026,
40104,
40105,
40376,
40377,
40428,
40429,
40496,
40555,
40556,
40614,
40615,
40636,
40655,
40656,
40929,
40930,
41279,
41280,
41330,
41331,
41460,
41461,
41638,
41639,
41762,
41833,
41834,
42157,
42158,
42175,
42176,
42197,
42216,
42217,
42615,
42969,
43385,
43386,
43436,
43437,
43546,
43548,
43554,
43555,
43577,
43596,
43597,
43851,
43852,
43906,
43907,
44021,
44022,
44073,
44074,
44184,
44185,
44205
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 44205,
"ccnet_original_nlines": 684,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43528667092323303,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05807336047291756,
"rps_doc_frac_lines_end_with_ellipsis": 0.014598540030419827,
"rps_doc_frac_no_alph_words": 0.1639966368675232,
"rps_doc_frac_unique_words": 0.1691417098045349,
"rps_doc_mean_word_length": 4.3288445472717285,
"rps_doc_num_sentences": 521,
"rps_doc_symbol_to_word_ratio": 0.0031618899665772915,
"rps_doc_unigram_entropy": 5.874404430389404,
"rps_doc_word_count": 7946,
"rps_doc_frac_chars_dupe_10grams": 0.0930895134806633,
"rps_doc_frac_chars_dupe_5grams": 0.17082884907722473,
"rps_doc_frac_chars_dupe_6grams": 0.1480652391910553,
"rps_doc_frac_chars_dupe_7grams": 0.12829607725143433,
"rps_doc_frac_chars_dupe_8grams": 0.10323575139045715,
"rps_doc_frac_chars_dupe_9grams": 0.09649097174406052,
"rps_doc_frac_chars_top_2gram": 0.02162978984415531,
"rps_doc_frac_chars_top_3gram": 0.0274733304977417,
"rps_doc_frac_chars_top_4gram": 0.015379250049591064,
"rps_doc_books_importance": -3782.441650390625,
"rps_doc_books_importance_length_correction": -3782.441650390625,
"rps_doc_openwebtext_importance": -2674.0107421875,
"rps_doc_openwebtext_importance_length_correction": -2674.0107421875,
"rps_doc_wikipedia_importance": -1755.4837646484375,
"rps_doc_wikipedia_importance_length_correction": -1755.4837646484375
},
"fasttext": {
"dclm": 0.02184516005218029,
"english": 0.9509630799293518,
"fineweb_edu_approx": 1.0649548768997192,
"eai_general_math": 0.21305567026138306,
"eai_open_web_math": 0.22416627407073975,
"eai_web_code": 0.13019269704818726
}
}
|
{
"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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,853,571,470,110,562,300 |
Reference documentation for deal.II version Git 32ab9f15fd 2020-11-24 23:04:10 -0500
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Classes | Public Types | Public Member Functions | Static Public Member Functions | Private Member Functions | Private Attributes | Friends | Related Functions | List of all members
CUDAWrappers::MatrixFree< dim, Number > Class Template Reference
#include <deal.II/matrix_free/cuda_matrix_free.h>
Inheritance diagram for CUDAWrappers::MatrixFree< dim, Number >:
[legend]
Classes
struct AdditionalData
struct Data
Public Types
enum ParallelizationScheme { parallel_in_elem, parallel_over_elem }
using jacobian_type = Tensor< 2, dim, Tensor< 1, dim, Number > >
using point_type = Point< dim, Number >
Public Member Functions
MatrixFree ()
~MatrixFree ()
unsigned int get_padding_length () const
void reinit (const Mapping< dim > &mapping, const DoFHandler< dim > &dof_handler, const AffineConstraints< Number > &constraints, const Quadrature< 1 > &quad, const AdditionalData &additional_data=AdditionalData())
void reinit (const DoFHandler< dim > &dof_handler, const AffineConstraints< Number > &constraints, const Quadrature< 1 > &quad, const AdditionalData &AdditionalData=AdditionalData())
Data get_data (unsigned int color) const
template<typename Functor , typename VectorType >
void cell_loop (const Functor &func, const VectorType &src, VectorType &dst) const
template<typename Functor >
void evaluate_coefficients (Functor func) const
template<typename VectorType >
void copy_constrained_values (const VectorType &src, VectorType &dst) const
template<typename VectorType >
void set_constrained_values (const Number val, VectorType &dst) const
void initialize_dof_vector (LinearAlgebra::CUDAWrappers::Vector< Number > &vec) const
void initialize_dof_vector (LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > &vec) const
const std::shared_ptr< const Utilities::MPI::Partitioner > & get_vector_partitioner () const
void free ()
const DoFHandler< dim > & get_dof_handler () const
std::size_t memory_consumption () const
template<class Archive >
void serialize (Archive &ar, const unsigned int version)
Subscriptor functionality
Classes derived from Subscriptor provide a facility to subscribe to this object. This is mostly used by the SmartPointer class.
void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
unsigned int n_subscriptions () const
template<typename StreamType >
void list_subscribers (StreamType &stream) const
void list_subscribers () const
Static Public Member Functions
static ::ExceptionBaseExcInUse (int arg1, std::string arg2, std::string arg3)
static ::ExceptionBaseExcNoSubscriber (std::string arg1, std::string arg2)
Private Member Functions
void internal_reinit (const Mapping< dim > &mapping, const DoFHandler< dim > &dof_handler, const AffineConstraints< Number > &constraints, const Quadrature< 1 > &quad, std::shared_ptr< const MPI_Comm > comm, const AdditionalData additional_data)
template<typename Functor , typename VectorType >
void serial_cell_loop (const Functor &func, const VectorType &src, VectorType &dst) const
template<typename Functor >
void distributed_cell_loop (const Functor &func, const LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > &src, LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > &dst) const
template<typename Functor >
void distributed_cell_loop (const Functor &func, const LinearAlgebra::CUDAWrappers::Vector< Number > &src, LinearAlgebra::CUDAWrappers::Vector< Number > &dst) const
template<typename VectorType >
void serial_copy_constrained_values (const VectorType &src, VectorType &dst) const
void distributed_copy_constrained_values (const LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > &src, LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > &dst) const
void distributed_copy_constrained_values (const LinearAlgebra::CUDAWrappers::Vector< Number > &src, LinearAlgebra::CUDAWrappers::Vector< Number > &dst) const
template<typename VectorType >
void serial_set_constrained_values (const Number val, VectorType &dst) const
void distributed_set_constrained_values (const Number val, LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > &dst) const
void distributed_set_constrained_values (const Number val, LinearAlgebra::CUDAWrappers::Vector< Number > &dst) const
Private Attributes
int my_id
ParallelizationScheme parallelization_scheme
bool use_coloring
bool overlap_communication_computation
types::global_dof_index n_dofs
unsigned int fe_degree
unsigned int dofs_per_cell
unsigned int n_constrained_dofs
unsigned int q_points_per_cell
unsigned int n_colors
std::vector< unsigned intn_cells
std::vector< point_type * > q_points
std::vector< types::global_dof_index * > local_to_global
std::vector< Number * > inv_jacobian
std::vector< Number * > JxW
types::global_dof_indexconstrained_dofs
std::vector< unsigned int * > constraint_mask
std::vector< dim3 > grid_dim
std::vector< dim3 > block_dim
std::shared_ptr< const Utilities::MPI::Partitionerpartitioner
unsigned int cells_per_block
dim3 constraint_grid_dim
dim3 constraint_block_dim
unsigned int padding_length
std::vector< unsigned introw_start
const DoFHandler< dim > * dof_handler
Friends
class internal::ReinitHelper< dim, Number >
Related Functions
(Note that these are not member functions.)
template<int dim>
unsigned int q_point_id_in_cell (const unsigned int n_q_points_1d)
template<int dim, typename Number >
unsigned int local_q_point_id (const unsigned int cell, const typename CUDAWrappers::MatrixFree< dim, Number >::Data *data, const unsigned int n_q_points_1d, const unsigned int n_q_points)
template<int dim, typename Number >
CUDAWrappers::MatrixFree< dim, Number >::point_typeget_quadrature_point (const unsigned int cell, const typename CUDAWrappers::MatrixFree< dim, Number >::Data *data, const unsigned int n_q_points_1d)
Detailed Description
template<int dim, typename Number = double>
class CUDAWrappers::MatrixFree< dim, Number >
This class collects all the data that is stored for the matrix free implementation. The storage scheme is tailored towards several loops performed with the same data, i.e., typically doing many matrix-vector products or residual computations on the same mesh.
This class does not implement any operations involving finite element basis functions, i.e., regarding the operation performed on the cells. For these operations, the class FEEvaluation is designed to use the data collected in this class.
This class implements a loop over all cells (cell_loop()). This loop is scheduled in such a way that cells that share degrees of freedom are not worked on simultaneously, which implies that it is possible to write to vectors in parallel without having to explicitly synchronize access to these vectors and matrices. This class does not implement any shape values, all it does is to cache the respective data. To implement finite element operations, use the class CUDAWrappers::FEEvalutation.
This class traverse the cells in a different order than the usual Triangulation class in deal.II.
Note
Only float and double are supported.
Definition at line 80 of file cuda_matrix_free.h.
Member Typedef Documentation
◆ jacobian_type
template<int dim, typename Number = double>
using CUDAWrappers::MatrixFree< dim, Number >::jacobian_type = Tensor<2, dim, Tensor<1, dim, Number> >
Definition at line 83 of file cuda_matrix_free.h.
◆ point_type
template<int dim, typename Number = double>
using CUDAWrappers::MatrixFree< dim, Number >::point_type = Point<dim, Number>
Definition at line 84 of file cuda_matrix_free.h.
Member Enumeration Documentation
◆ ParallelizationScheme
template<int dim, typename Number = double>
enum CUDAWrappers::MatrixFree::ParallelizationScheme
Parallelization scheme used: parallel_in_elem (parallelism at the level of degrees of freedom) or parallel_over_elem (parallelism at the level of cells)
Enumerator
parallel_in_elem
parallel_over_elem
Definition at line 91 of file cuda_matrix_free.h.
Constructor & Destructor Documentation
◆ MatrixFree()
template<int dim, typename Number = double>
CUDAWrappers::MatrixFree< dim, Number >::MatrixFree ( )
Default constructor.
◆ ~MatrixFree()
template<int dim, typename Number = double>
CUDAWrappers::MatrixFree< dim, Number >::~MatrixFree ( )
Destructor.
Member Function Documentation
◆ get_padding_length()
template<int dim, typename Number = double>
unsigned int CUDAWrappers::MatrixFree< dim, Number >::get_padding_length ( ) const
Return the length of the padding.
◆ reinit() [1/2]
template<int dim, typename Number = double>
void CUDAWrappers::MatrixFree< dim, Number >::reinit ( const Mapping< dim > & mapping,
const DoFHandler< dim > & dof_handler,
const AffineConstraints< Number > & constraints,
const Quadrature< 1 > & quad,
const AdditionalData additional_data = AdditionalData()
)
Extracts the information needed to perform loops over cells. The DoFHandler and AffineConstraints objects describe the layout of degrees of freedom, the DoFHandler and the mapping describe the transformation from unit to real cell, and the finite element underlying the DoFHandler together with the quadrature formula describe the local operations.
◆ reinit() [2/2]
template<int dim, typename Number = double>
void CUDAWrappers::MatrixFree< dim, Number >::reinit ( const DoFHandler< dim > & dof_handler,
const AffineConstraints< Number > & constraints,
const Quadrature< 1 > & quad,
const AdditionalData AdditionalData = AdditionalData()
)
Initializes the data structures. Same as above but using a Q1 mapping.
◆ get_data()
template<int dim, typename Number = double>
Data CUDAWrappers::MatrixFree< dim, Number >::get_data ( unsigned int color) const
Return the Data structure associated with color.
◆ cell_loop()
template<int dim, typename Number = double>
template<typename Functor , typename VectorType >
void CUDAWrappers::MatrixFree< dim, Number >::cell_loop ( const Functor & func,
const VectorType src,
VectorType dst
) const
This method runs the loop over all cells and apply the local operation on each element in parallel. func is a functor which is applied on each color.
func needs to define
__device__ void operator()(
const unsigned int cell,
const Number * src,
Number * dst) const;
static const unsigned int n_dofs_1d;
static const unsigned int n_local_dofs;
static const unsigned int n_q_points;
◆ evaluate_coefficients()
template<int dim, typename Number = double>
template<typename Functor >
void CUDAWrappers::MatrixFree< dim, Number >::evaluate_coefficients ( Functor func) const
This method runs the loop over all cells and apply the local operation on each element in parallel. This function is very similar to cell_loop() but it uses a simpler functor.
func needs to define
__device__ void operator()(
const unsigned int cell,
static const unsigned int n_dofs_1d;
static const unsigned int n_local_dofs;
static const unsigned int n_q_points;
◆ copy_constrained_values()
template<int dim, typename Number = double>
template<typename VectorType >
void CUDAWrappers::MatrixFree< dim, Number >::copy_constrained_values ( const VectorType src,
VectorType dst
) const
Copy the values of the constrained entries from src to dst. This is used to impose zero Dirichlet boundary condition.
◆ set_constrained_values()
template<int dim, typename Number = double>
template<typename VectorType >
void CUDAWrappers::MatrixFree< dim, Number >::set_constrained_values ( const Number val,
VectorType dst
) const
Set the entries in dst corresponding to constrained values to val. The main purpose of this function is to set the constrained entries of the source vector used in cell_loop() to zero.
◆ initialize_dof_vector() [1/2]
template<int dim, typename Number = double>
void CUDAWrappers::MatrixFree< dim, Number >::initialize_dof_vector ( LinearAlgebra::CUDAWrappers::Vector< Number > & vec) const
Initialize a serial vector. The size corresponds to the number of degrees of freedom in the DoFHandler object.
◆ initialize_dof_vector() [2/2]
template<int dim, typename Number = double>
void CUDAWrappers::MatrixFree< dim, Number >::initialize_dof_vector ( LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > & vec) const
Initialize a distributed vector. The local elements correspond to the locally owned degrees of freedom and the ghost elements correspond to the (additional) locally relevant dofs.
◆ get_vector_partitioner()
template<int dim, typename Number = double>
const std::shared_ptr<const Utilities::MPI::Partitioner>& CUDAWrappers::MatrixFree< dim, Number >::get_vector_partitioner ( ) const
Return the partitioner that represents the locally owned data and the ghost indices where access is needed to for the cell loop. The partitioner is constructed from the locally owned dofs and ghost dofs given by the respective fields. If you want to have specific information about these objects, you can query them with the respective access functions. If you just want to initialize a (parallel) vector, you should usually prefer this data structure as the data exchange information can be reused from one vector to another.
◆ free()
template<int dim, typename Number = double>
void CUDAWrappers::MatrixFree< dim, Number >::free ( )
Free all the memory allocated.
◆ get_dof_handler()
template<int dim, typename Number = double>
const DoFHandler<dim>& CUDAWrappers::MatrixFree< dim, Number >::get_dof_handler ( ) const
Return the DoFHandler.
◆ memory_consumption()
template<int dim, typename Number = double>
std::size_t CUDAWrappers::MatrixFree< dim, Number >::memory_consumption ( ) const
Return an approximation of the memory consumption of this class in bytes.
◆ internal_reinit()
template<int dim, typename Number = double>
void CUDAWrappers::MatrixFree< dim, Number >::internal_reinit ( const Mapping< dim > & mapping,
const DoFHandler< dim > & dof_handler,
const AffineConstraints< Number > & constraints,
const Quadrature< 1 > & quad,
std::shared_ptr< const MPI_Comm comm,
const AdditionalData additional_data
)
private
Initializes the data structures.
◆ serial_cell_loop()
template<int dim, typename Number = double>
template<typename Functor , typename VectorType >
void CUDAWrappers::MatrixFree< dim, Number >::serial_cell_loop ( const Functor & func,
const VectorType src,
VectorType dst
) const
private
Helper function. Loop over all the cells and apply the functor on each element in parallel. This function is used when MPI is not used.
◆ distributed_cell_loop() [1/2]
template<int dim, typename Number = double>
template<typename Functor >
void CUDAWrappers::MatrixFree< dim, Number >::distributed_cell_loop ( const Functor & func,
const LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > & src,
LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > & dst
) const
private
Helper function. Loop over all the cells and apply the functor on each element in parallel. This function is used when MPI is used.
◆ distributed_cell_loop() [2/2]
template<int dim, typename Number = double>
template<typename Functor >
void CUDAWrappers::MatrixFree< dim, Number >::distributed_cell_loop ( const Functor & func,
const LinearAlgebra::CUDAWrappers::Vector< Number > & src,
LinearAlgebra::CUDAWrappers::Vector< Number > & dst
) const
private
This function should never be called. Calling it results in an internal error. This function exists only because cell_loop needs distributed_cell_loop() to exist for LinearAlgebra::CUDAWrappers::Vector.
◆ serial_copy_constrained_values()
template<int dim, typename Number = double>
template<typename VectorType >
void CUDAWrappers::MatrixFree< dim, Number >::serial_copy_constrained_values ( const VectorType src,
VectorType dst
) const
private
Helper function. Copy the values of the constrained entries of src to dst. This function is used when MPI is not used.
◆ distributed_copy_constrained_values() [1/2]
template<int dim, typename Number = double>
void CUDAWrappers::MatrixFree< dim, Number >::distributed_copy_constrained_values ( const LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > & src,
LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > & dst
) const
private
Helper function. Copy the values of the constrained entries of src to dst. This function is used when MPI is used.
◆ distributed_copy_constrained_values() [2/2]
template<int dim, typename Number = double>
void CUDAWrappers::MatrixFree< dim, Number >::distributed_copy_constrained_values ( const LinearAlgebra::CUDAWrappers::Vector< Number > & src,
LinearAlgebra::CUDAWrappers::Vector< Number > & dst
) const
private
This function should never be called. Calling it results in an internal error. This function exists only because copy_constrained_values needs distributed_copy_constrained_values() to exist for LinearAlgebra::CUDAWrappers::Vector.
◆ serial_set_constrained_values()
template<int dim, typename Number = double>
template<typename VectorType >
void CUDAWrappers::MatrixFree< dim, Number >::serial_set_constrained_values ( const Number val,
VectorType dst
) const
private
Helper function. Set the constrained entries of dst to val. This function is used when MPI is not used.
◆ distributed_set_constrained_values() [1/2]
template<int dim, typename Number = double>
void CUDAWrappers::MatrixFree< dim, Number >::distributed_set_constrained_values ( const Number val,
LinearAlgebra::distributed::Vector< Number, MemorySpace::CUDA > & dst
) const
private
Helper function. Set the constrained entries of dst to val. This function is used when MPI is used.
◆ distributed_set_constrained_values() [2/2]
template<int dim, typename Number = double>
void CUDAWrappers::MatrixFree< dim, Number >::distributed_set_constrained_values ( const Number val,
LinearAlgebra::CUDAWrappers::Vector< Number > & dst
) const
private
This function should never be called. Calling it results in an internal error. This function exists only because set_constrained_values needs distributed_set_constrained_values() to exist for LinearAlgebra::CUDAWrappers::Vector.
◆ subscribe()
void Subscriptor::subscribe ( std::atomic< bool > *const validity,
const std::string & identifier = ""
) const
inherited
Subscribes a user of the object by storing the pointer validity. The subscriber may be identified by text supplied as identifier.
Definition at line 136 of file subscriptor.cc.
◆ unsubscribe()
void Subscriptor::unsubscribe ( std::atomic< bool > *const validity,
const std::string & identifier = ""
) const
inherited
Unsubscribes a user from the object.
Note
The identifier and the validity pointer must be the same as the one supplied to subscribe().
Definition at line 156 of file subscriptor.cc.
◆ n_subscriptions()
unsigned int Subscriptor::n_subscriptions ( ) const
inlineinherited
Return the present number of subscriptions to this object. This allows to use this class for reference counted lifetime determination where the last one to unsubscribe also deletes the object.
Definition at line 300 of file subscriptor.h.
◆ list_subscribers() [1/2]
template<typename StreamType >
void Subscriptor::list_subscribers ( StreamType & stream) const
inlineinherited
List the subscribers to the input stream.
Definition at line 317 of file subscriptor.h.
◆ list_subscribers() [2/2]
void Subscriptor::list_subscribers ( ) const
inherited
List the subscribers to deallog.
Definition at line 204 of file subscriptor.cc.
◆ serialize()
template<class Archive >
void Subscriptor::serialize ( Archive & ar,
const unsigned int version
)
inlineinherited
Read or write the data of this object to or from a stream for the purpose of serialization.
This function does not actually serialize any of the member variables of this class. The reason is that what this class stores is only who subscribes to this object, but who does so at the time of storing the contents of this object does not necessarily have anything to do with who subscribes to the object when it is restored. Consequently, we do not want to overwrite the subscribers at the time of restoring, and then there is no reason to write the subscribers out in the first place.
Definition at line 309 of file subscriptor.h.
Friends And Related Function Documentation
◆ internal::ReinitHelper< dim, Number >
template<int dim, typename Number = double>
friend class internal::ReinitHelper< dim, Number >
friend
Definition at line 619 of file cuda_matrix_free.h.
◆ q_point_id_in_cell()
template<int dim>
unsigned int q_point_id_in_cell ( const unsigned int n_q_points_1d)
related
Compute the quadrature point index in the local cell of a given thread.
Definition at line 689 of file cuda_matrix_free.h.
◆ local_q_point_id()
template<int dim, typename Number >
unsigned int local_q_point_id ( const unsigned int cell,
const typename CUDAWrappers::MatrixFree< dim, Number >::Data data,
const unsigned int n_q_points_1d,
const unsigned int n_q_points
)
related
Return the quadrature point index local of a given thread. The index is only unique for a given MPI process.
Definition at line 709 of file cuda_matrix_free.h.
◆ get_quadrature_point()
template<int dim, typename Number >
CUDAWrappers::MatrixFree< dim, Number >::point_type & get_quadrature_point ( const unsigned int cell,
const typename CUDAWrappers::MatrixFree< dim, Number >::Data data,
const unsigned int n_q_points_1d
)
related
Return the quadrature point associated with a given thread.
Definition at line 728 of file cuda_matrix_free.h.
Member Data Documentation
◆ my_id
template<int dim, typename Number = double>
int CUDAWrappers::MatrixFree< dim, Number >::my_id
private
Unique ID associated with the object.
Definition at line 478 of file cuda_matrix_free.h.
◆ parallelization_scheme
template<int dim, typename Number = double>
ParallelizationScheme CUDAWrappers::MatrixFree< dim, Number >::parallelization_scheme
private
Parallelization scheme used, parallelization over degrees of freedom or over cells.
Definition at line 484 of file cuda_matrix_free.h.
◆ use_coloring
template<int dim, typename Number = double>
bool CUDAWrappers::MatrixFree< dim, Number >::use_coloring
private
If true, use graph coloring. Otherwise, use atomic operations. Graph coloring ensures bitwise reproducibility but is slower on Pascal and newer architectures.
Definition at line 491 of file cuda_matrix_free.h.
◆ overlap_communication_computation
template<int dim, typename Number = double>
bool CUDAWrappers::MatrixFree< dim, Number >::overlap_communication_computation
private
Overlap MPI communications with computation. This requires CUDA-aware MPI and use_coloring must be false.
Definition at line 497 of file cuda_matrix_free.h.
◆ n_dofs
template<int dim, typename Number = double>
types::global_dof_index CUDAWrappers::MatrixFree< dim, Number >::n_dofs
private
Total number of degrees of freedom.
Definition at line 502 of file cuda_matrix_free.h.
◆ fe_degree
template<int dim, typename Number = double>
unsigned int CUDAWrappers::MatrixFree< dim, Number >::fe_degree
private
Degree of the finite element used.
Definition at line 507 of file cuda_matrix_free.h.
◆ dofs_per_cell
template<int dim, typename Number = double>
unsigned int CUDAWrappers::MatrixFree< dim, Number >::dofs_per_cell
private
Number of degrees of freedom per cell.
Definition at line 512 of file cuda_matrix_free.h.
◆ n_constrained_dofs
template<int dim, typename Number = double>
unsigned int CUDAWrappers::MatrixFree< dim, Number >::n_constrained_dofs
private
Number of constrained degrees of freedom.
Definition at line 517 of file cuda_matrix_free.h.
◆ q_points_per_cell
template<int dim, typename Number = double>
unsigned int CUDAWrappers::MatrixFree< dim, Number >::q_points_per_cell
private
Number of quadrature points per cells.
Definition at line 522 of file cuda_matrix_free.h.
◆ n_colors
template<int dim, typename Number = double>
unsigned int CUDAWrappers::MatrixFree< dim, Number >::n_colors
private
Number of colors produced by the graph coloring algorithm.
Definition at line 527 of file cuda_matrix_free.h.
◆ n_cells
template<int dim, typename Number = double>
std::vector<unsigned int> CUDAWrappers::MatrixFree< dim, Number >::n_cells
private
Number of cells in each color.
Definition at line 532 of file cuda_matrix_free.h.
◆ q_points
template<int dim, typename Number = double>
std::vector<point_type *> CUDAWrappers::MatrixFree< dim, Number >::q_points
private
Vector of pointers to the quadrature points associated to the cells of each color.
Definition at line 538 of file cuda_matrix_free.h.
◆ local_to_global
template<int dim, typename Number = double>
std::vector<types::global_dof_index *> CUDAWrappers::MatrixFree< dim, Number >::local_to_global
private
Map the position in the local vector to the position in the global vector.
Definition at line 544 of file cuda_matrix_free.h.
◆ inv_jacobian
template<int dim, typename Number = double>
std::vector<Number *> CUDAWrappers::MatrixFree< dim, Number >::inv_jacobian
private
Vector of pointer to the inverse Jacobian associated to the cells of each color.
Definition at line 550 of file cuda_matrix_free.h.
◆ JxW
template<int dim, typename Number = double>
std::vector<Number *> CUDAWrappers::MatrixFree< dim, Number >::JxW
private
Vector of pointer to the Jacobian times the weights associated to the cells of each color.
Definition at line 556 of file cuda_matrix_free.h.
◆ constrained_dofs
template<int dim, typename Number = double>
types::global_dof_index* CUDAWrappers::MatrixFree< dim, Number >::constrained_dofs
private
Pointer to the constrained degrees of freedom.
Definition at line 561 of file cuda_matrix_free.h.
◆ constraint_mask
template<int dim, typename Number = double>
std::vector<unsigned int *> CUDAWrappers::MatrixFree< dim, Number >::constraint_mask
private
Mask deciding where constraints are set on a given cell.
Definition at line 566 of file cuda_matrix_free.h.
◆ grid_dim
template<int dim, typename Number = double>
std::vector<dim3> CUDAWrappers::MatrixFree< dim, Number >::grid_dim
private
Grid dimensions associated to the different colors. The grid dimensions are used to launch the CUDA kernels.
Definition at line 572 of file cuda_matrix_free.h.
◆ block_dim
template<int dim, typename Number = double>
std::vector<dim3> CUDAWrappers::MatrixFree< dim, Number >::block_dim
private
Block dimensions associated to the different colors. The block dimensions are used to launch the CUDA kernels.
Definition at line 578 of file cuda_matrix_free.h.
◆ partitioner
template<int dim, typename Number = double>
std::shared_ptr<const Utilities::MPI::Partitioner> CUDAWrappers::MatrixFree< dim, Number >::partitioner
private
Shared pointer to a Partitioner for distributed Vectors used in cell_loop. When MPI is not used the pointer is null.
Definition at line 584 of file cuda_matrix_free.h.
◆ cells_per_block
template<int dim, typename Number = double>
unsigned int CUDAWrappers::MatrixFree< dim, Number >::cells_per_block
private
Cells per block (determined by the function cells_per_block_shmem() ).
Definition at line 589 of file cuda_matrix_free.h.
◆ constraint_grid_dim
template<int dim, typename Number = double>
dim3 CUDAWrappers::MatrixFree< dim, Number >::constraint_grid_dim
private
Grid dimensions used to launch the CUDA kernels in *_constrained_values-operations.
Definition at line 595 of file cuda_matrix_free.h.
◆ constraint_block_dim
template<int dim, typename Number = double>
dim3 CUDAWrappers::MatrixFree< dim, Number >::constraint_block_dim
private
Block dimensions used to launch the CUDA kernels in *_constrained_values-operations.
Definition at line 601 of file cuda_matrix_free.h.
◆ padding_length
template<int dim, typename Number = double>
unsigned int CUDAWrappers::MatrixFree< dim, Number >::padding_length
private
Length of the padding (closest power of two larger than or equal to the number of thread).
Definition at line 607 of file cuda_matrix_free.h.
◆ row_start
template<int dim, typename Number = double>
std::vector<unsigned int> CUDAWrappers::MatrixFree< dim, Number >::row_start
private
Row start of each color.
Definition at line 612 of file cuda_matrix_free.h.
◆ dof_handler
template<int dim, typename Number = double>
const DoFHandler<dim>* CUDAWrappers::MatrixFree< dim, Number >::dof_handler
private
Pointer to the DoFHandler associated with the object.
Definition at line 617 of file cuda_matrix_free.h.
The documentation for this class was generated from the following file:
|
{
"url": "https://dealii.org/developer/doxygen/deal.II/classCUDAWrappers_1_1MatrixFree.html",
"source_domain": "dealii.org",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "136970",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IXOUMOD2744TJMZTYSHL52DFLKAU5JGL",
"WARC-Concurrent-To": "<urn:uuid:2eac7c8f-b913-432a-a90d-a1989dcc8a39>",
"WARC-Date": "2020-11-25T10:28:26Z",
"WARC-IP-Address": "129.206.107.243",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:QR3DKMU5P7F7D3ZUGEXNK2CWNHAALUNW",
"WARC-Record-ID": "<urn:uuid:be367930-cd1f-4bb8-8c70-f67752425fd0>",
"WARC-Target-URI": "https://dealii.org/developer/doxygen/deal.II/classCUDAWrappers_1_1MatrixFree.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c401aecd-e153-4cf5-a485-7285fc90f627>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-245.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,
86,
342,
524,
589,
590,
640,
641,
706,
715,
716,
724,
725,
748,
750,
763,
765,
766,
779,
780,
849,
851,
916,
918,
958,
960,
961,
985,
986,
1001,
1003,
1019,
1021,
1062,
1064,
1279,
1281,
1464,
1466,
1507,
1509,
1559,
1642,
1644,
1672,
1720,
1722,
1753,
1829,
1831,
1862,
1932,
1934,
2020,
2022,
2126,
2128,
2221,
2223,
2236,
2238,
2289,
2291,
2331,
2333,
2358,
2415,
2417,
2443,
2444,
2572,
2573,
2666,
2668,
2763,
2765,
2803,
2805,
2836,
2885,
2887,
2918,
2920,
2921,
2952,
2953,
3031,
3033,
3108,
3110,
3111,
3136,
3137,
3383,
3385,
3435,
3525,
3527,
3555,
3756,
3758,
3786,
3951,
3953,
3984,
4067,
4069,
4263,
4265,
4423,
4425,
4456,
4533,
4535,
4670,
4672,
4789,
4791,
4792,
4811,
4812,
4822,
4824,
4869,
4871,
4889,
4891,
4930,
4932,
4963,
4965,
4988,
4990,
5017,
5019,
5051,
5053,
5084,
5086,
5108,
5110,
5143,
5145,
5182,
5184,
5241,
5243,
5280,
5282,
5310,
5312,
5352,
5354,
5400,
5402,
5431,
5433,
5463,
5465,
5527,
5529,
5558,
5560,
5585,
5587,
5613,
5615,
5643,
5645,
5680,
5682,
5720,
5722,
5723,
5731,
5732,
5776,
5778,
5779,
5797,
5798,
5842,
5843,
5861,
5928,
5930,
5966,
6155,
6157,
6193,
6393,
6395,
6396,
6417,
6418,
6462,
6508,
6509,
6769,
6770,
7009,
7010,
7502,
7503,
7601,
7602,
7607,
7644,
7645,
7695,
7696,
7725,
7726,
7742,
7743,
7787,
7890,
7891,
7941,
7942,
7955,
7956,
8000,
8079,
8080,
8130,
8131,
8164,
8165,
8189,
8190,
8234,
8287,
8288,
8441,
8442,
8453,
8471,
8491,
8492,
8542,
8543,
8582,
8583,
8598,
8599,
8643,
8699,
8700,
8721,
8722,
8738,
8739,
8783,
8840,
8841,
8853,
8854,
8884,
8885,
8908,
8909,
8953,
9036,
9037,
9071,
9072,
9089,
9090,
9134,
9222,
9262,
9312,
9343,
9400,
9402,
9403,
9752,
9753,
9770,
9771,
9815,
9910,
9960,
9991,
10047,
10049,
10050,
10121,
10122,
10135,
10136,
10180,
10264,
10265,
10314,
10315,
10329,
10330,
10374,
10424,
10505,
10527,
10543,
10551,
10552,
10702,
10703,
10724,
10725,
10753,
10778,
10798,
10819,
10856,
10896,
10934,
10935,
10961,
10962,
11006,
11034,
11125,
11126,
11302,
11303,
11324,
11325,
11353,
11378,
11415,
11455,
11493,
11494,
11522,
11523,
11567,
11598,
11692,
11708,
11716,
11717,
11835,
11836,
11863,
11864,
11908,
11939,
12029,
12045,
12053,
12054,
12239,
12240,
12272,
12273,
12317,
12447,
12448,
12559,
12560,
12592,
12593,
12637,
12785,
12786,
12966,
12967,
12994,
12995,
13039,
13171,
13172,
13699,
13700,
13709,
13710,
13754,
13809,
13810,
13841,
13842,
13862,
13863,
13907,
13997,
13998,
14021,
14022,
14045,
14046,
14090,
14172,
14173,
14247,
14248,
14268,
14269,
14313,
14410,
14450,
14500,
14531,
14569,
14608,
14610,
14618,
14619,
14652,
14653,
14674,
14675,
14719,
14769,
14857,
14879,
14895,
14903,
14911,
14912,
15048,
15049,
15081,
15082,
15126,
15154,
15247,
15325,
15397,
15405,
15413,
15414,
15546,
15547,
15579,
15580,
15624,
15652,
15745,
15805,
15859,
15867,
15875,
15876,
16079,
16080,
16115,
16116,
16160,
16191,
16292,
16308,
16316,
16324,
16325,
16444,
16445,
16491,
16492,
16536,
16698,
16770,
16778,
16786,
16787,
16902,
16903,
16949,
16950,
16994,
17138,
17192,
17200,
17208,
17209,
17440,
17441,
17475,
17476,
17520,
17551,
17648,
17664,
17672,
17680,
17681,
17785,
17786,
17831,
17832,
17876,
17978,
18050,
18058,
18066,
18067,
18167,
18168,
18213,
18214,
18258,
18360,
18414,
18422,
18430,
18431,
18660,
18661,
18675,
18676,
18744,
18782,
18790,
18800,
18801,
18931,
18932,
18979,
18980,
18996,
18997,
19067,
19105,
19113,
19123,
19124,
19161,
19162,
19167,
19260,
19261,
19308,
19309,
19329,
19330,
19382,
19398,
19399,
19592,
19593,
19639,
19640,
19667,
19668,
19699,
19764,
19780,
19781,
19823,
19824,
19870,
19871,
19898,
19899,
19944,
19954,
19955,
19988,
19989,
20036,
20037,
20051,
20052,
20077,
20122,
20151,
20153,
20169,
20170,
20262,
20263,
20753,
20754,
20800,
20801,
20844,
20845,
20885,
20886,
20930,
20981,
20988,
20989,
21040,
21041,
21064,
21065,
21083,
21152,
21160,
21161,
21233,
21234,
21285,
21286,
21307,
21308,
21344,
21402,
21469,
21504,
21536,
21538,
21546,
21547,
21656,
21657,
21708,
21709,
21734,
21735,
21771,
21874,
21941,
21976,
21978,
21986,
21987,
22047,
22048,
22099,
22100,
22126,
22127,
22135,
22136,
22180,
22231,
22239,
22240,
22278,
22279,
22330,
22331,
22356,
22357,
22401,
22487,
22495,
22496,
22580,
22581,
22632,
22633,
22648,
22649,
22693,
22752,
22760,
22761,
22920,
22921,
22972,
22973,
23009,
23010,
23054,
23134,
23142,
23143,
23249,
23250,
23301,
23302,
23311,
23312,
23356,
23428,
23436,
23437,
23473,
23474,
23525,
23526,
23538,
23539,
23583,
23647,
23655,
23656,
23691,
23692,
23743,
23744,
23760,
23761,
23805,
23873,
23881,
23882,
23921,
23922,
23973,
23974,
23995,
23996,
24040,
24113,
24121,
24122,
24164,
24165,
24216,
24217,
24237,
24238,
24282,
24354,
24362,
24363,
24402,
24403,
24454,
24455,
24466,
24467,
24511,
24574,
24582,
24583,
24642,
24643,
24694,
24695,
24705,
24706,
24750,
24825,
24833,
24834,
24865,
24866,
24917,
24918,
24929,
24930,
24974,
25050,
25058,
25059,
25142,
25143,
25194,
25195,
25213,
25214,
25258,
25354,
25362,
25363,
25438,
25439,
25490,
25491,
25506,
25507,
25551,
25627,
25635,
25636,
25717,
25718,
25769,
25770,
25776,
25777,
25821,
25888,
25896,
25897,
25988,
25989,
26040,
26041,
26060,
26061,
26105,
26188,
26196,
26197,
26244,
26245,
26296,
26297,
26315,
26316,
26360,
26445,
26453,
26454,
26511,
26512,
26563,
26564,
26575,
26576,
26620,
26688,
26696,
26697,
26806,
26807,
26858,
26859,
26871,
26872,
26916,
26985,
26993,
26994,
27105,
27106,
27157,
27158,
27172,
27173,
27217,
27321,
27329,
27330,
27447,
27448,
27499,
27500,
27518,
27519,
27563,
27633,
27641,
27642,
27713,
27714,
27765,
27766,
27788,
27789,
27833,
27899,
27907,
27908,
27992,
27993,
28044,
28045,
28068,
28069,
28113,
28180,
28188,
28189,
28274,
28275,
28326,
28327,
28344,
28345,
28389,
28458,
28466,
28467,
28558,
28559,
28610,
28611,
28623,
28624,
28668,
28745,
28753,
28754,
28779,
28780,
28831,
28832,
28846,
28847,
28891,
28967,
28975,
28976,
29030,
29031,
29082,
29083,
29084
],
"line_end_idx": [
86,
342,
524,
589,
590,
640,
641,
706,
715,
716,
724,
725,
748,
750,
763,
765,
766,
779,
780,
849,
851,
916,
918,
958,
960,
961,
985,
986,
1001,
1003,
1019,
1021,
1062,
1064,
1279,
1281,
1464,
1466,
1507,
1509,
1559,
1642,
1644,
1672,
1720,
1722,
1753,
1829,
1831,
1862,
1932,
1934,
2020,
2022,
2126,
2128,
2221,
2223,
2236,
2238,
2289,
2291,
2331,
2333,
2358,
2415,
2417,
2443,
2444,
2572,
2573,
2666,
2668,
2763,
2765,
2803,
2805,
2836,
2885,
2887,
2918,
2920,
2921,
2952,
2953,
3031,
3033,
3108,
3110,
3111,
3136,
3137,
3383,
3385,
3435,
3525,
3527,
3555,
3756,
3758,
3786,
3951,
3953,
3984,
4067,
4069,
4263,
4265,
4423,
4425,
4456,
4533,
4535,
4670,
4672,
4789,
4791,
4792,
4811,
4812,
4822,
4824,
4869,
4871,
4889,
4891,
4930,
4932,
4963,
4965,
4988,
4990,
5017,
5019,
5051,
5053,
5084,
5086,
5108,
5110,
5143,
5145,
5182,
5184,
5241,
5243,
5280,
5282,
5310,
5312,
5352,
5354,
5400,
5402,
5431,
5433,
5463,
5465,
5527,
5529,
5558,
5560,
5585,
5587,
5613,
5615,
5643,
5645,
5680,
5682,
5720,
5722,
5723,
5731,
5732,
5776,
5778,
5779,
5797,
5798,
5842,
5843,
5861,
5928,
5930,
5966,
6155,
6157,
6193,
6393,
6395,
6396,
6417,
6418,
6462,
6508,
6509,
6769,
6770,
7009,
7010,
7502,
7503,
7601,
7602,
7607,
7644,
7645,
7695,
7696,
7725,
7726,
7742,
7743,
7787,
7890,
7891,
7941,
7942,
7955,
7956,
8000,
8079,
8080,
8130,
8131,
8164,
8165,
8189,
8190,
8234,
8287,
8288,
8441,
8442,
8453,
8471,
8491,
8492,
8542,
8543,
8582,
8583,
8598,
8599,
8643,
8699,
8700,
8721,
8722,
8738,
8739,
8783,
8840,
8841,
8853,
8854,
8884,
8885,
8908,
8909,
8953,
9036,
9037,
9071,
9072,
9089,
9090,
9134,
9222,
9262,
9312,
9343,
9400,
9402,
9403,
9752,
9753,
9770,
9771,
9815,
9910,
9960,
9991,
10047,
10049,
10050,
10121,
10122,
10135,
10136,
10180,
10264,
10265,
10314,
10315,
10329,
10330,
10374,
10424,
10505,
10527,
10543,
10551,
10552,
10702,
10703,
10724,
10725,
10753,
10778,
10798,
10819,
10856,
10896,
10934,
10935,
10961,
10962,
11006,
11034,
11125,
11126,
11302,
11303,
11324,
11325,
11353,
11378,
11415,
11455,
11493,
11494,
11522,
11523,
11567,
11598,
11692,
11708,
11716,
11717,
11835,
11836,
11863,
11864,
11908,
11939,
12029,
12045,
12053,
12054,
12239,
12240,
12272,
12273,
12317,
12447,
12448,
12559,
12560,
12592,
12593,
12637,
12785,
12786,
12966,
12967,
12994,
12995,
13039,
13171,
13172,
13699,
13700,
13709,
13710,
13754,
13809,
13810,
13841,
13842,
13862,
13863,
13907,
13997,
13998,
14021,
14022,
14045,
14046,
14090,
14172,
14173,
14247,
14248,
14268,
14269,
14313,
14410,
14450,
14500,
14531,
14569,
14608,
14610,
14618,
14619,
14652,
14653,
14674,
14675,
14719,
14769,
14857,
14879,
14895,
14903,
14911,
14912,
15048,
15049,
15081,
15082,
15126,
15154,
15247,
15325,
15397,
15405,
15413,
15414,
15546,
15547,
15579,
15580,
15624,
15652,
15745,
15805,
15859,
15867,
15875,
15876,
16079,
16080,
16115,
16116,
16160,
16191,
16292,
16308,
16316,
16324,
16325,
16444,
16445,
16491,
16492,
16536,
16698,
16770,
16778,
16786,
16787,
16902,
16903,
16949,
16950,
16994,
17138,
17192,
17200,
17208,
17209,
17440,
17441,
17475,
17476,
17520,
17551,
17648,
17664,
17672,
17680,
17681,
17785,
17786,
17831,
17832,
17876,
17978,
18050,
18058,
18066,
18067,
18167,
18168,
18213,
18214,
18258,
18360,
18414,
18422,
18430,
18431,
18660,
18661,
18675,
18676,
18744,
18782,
18790,
18800,
18801,
18931,
18932,
18979,
18980,
18996,
18997,
19067,
19105,
19113,
19123,
19124,
19161,
19162,
19167,
19260,
19261,
19308,
19309,
19329,
19330,
19382,
19398,
19399,
19592,
19593,
19639,
19640,
19667,
19668,
19699,
19764,
19780,
19781,
19823,
19824,
19870,
19871,
19898,
19899,
19944,
19954,
19955,
19988,
19989,
20036,
20037,
20051,
20052,
20077,
20122,
20151,
20153,
20169,
20170,
20262,
20263,
20753,
20754,
20800,
20801,
20844,
20845,
20885,
20886,
20930,
20981,
20988,
20989,
21040,
21041,
21064,
21065,
21083,
21152,
21160,
21161,
21233,
21234,
21285,
21286,
21307,
21308,
21344,
21402,
21469,
21504,
21536,
21538,
21546,
21547,
21656,
21657,
21708,
21709,
21734,
21735,
21771,
21874,
21941,
21976,
21978,
21986,
21987,
22047,
22048,
22099,
22100,
22126,
22127,
22135,
22136,
22180,
22231,
22239,
22240,
22278,
22279,
22330,
22331,
22356,
22357,
22401,
22487,
22495,
22496,
22580,
22581,
22632,
22633,
22648,
22649,
22693,
22752,
22760,
22761,
22920,
22921,
22972,
22973,
23009,
23010,
23054,
23134,
23142,
23143,
23249,
23250,
23301,
23302,
23311,
23312,
23356,
23428,
23436,
23437,
23473,
23474,
23525,
23526,
23538,
23539,
23583,
23647,
23655,
23656,
23691,
23692,
23743,
23744,
23760,
23761,
23805,
23873,
23881,
23882,
23921,
23922,
23973,
23974,
23995,
23996,
24040,
24113,
24121,
24122,
24164,
24165,
24216,
24217,
24237,
24238,
24282,
24354,
24362,
24363,
24402,
24403,
24454,
24455,
24466,
24467,
24511,
24574,
24582,
24583,
24642,
24643,
24694,
24695,
24705,
24706,
24750,
24825,
24833,
24834,
24865,
24866,
24917,
24918,
24929,
24930,
24974,
25050,
25058,
25059,
25142,
25143,
25194,
25195,
25213,
25214,
25258,
25354,
25362,
25363,
25438,
25439,
25490,
25491,
25506,
25507,
25551,
25627,
25635,
25636,
25717,
25718,
25769,
25770,
25776,
25777,
25821,
25888,
25896,
25897,
25988,
25989,
26040,
26041,
26060,
26061,
26105,
26188,
26196,
26197,
26244,
26245,
26296,
26297,
26315,
26316,
26360,
26445,
26453,
26454,
26511,
26512,
26563,
26564,
26575,
26576,
26620,
26688,
26696,
26697,
26806,
26807,
26858,
26859,
26871,
26872,
26916,
26985,
26993,
26994,
27105,
27106,
27157,
27158,
27172,
27173,
27217,
27321,
27329,
27330,
27447,
27448,
27499,
27500,
27518,
27519,
27563,
27633,
27641,
27642,
27713,
27714,
27765,
27766,
27788,
27789,
27833,
27899,
27907,
27908,
27992,
27993,
28044,
28045,
28068,
28069,
28113,
28180,
28188,
28189,
28274,
28275,
28326,
28327,
28344,
28345,
28389,
28458,
28466,
28467,
28558,
28559,
28610,
28611,
28623,
28624,
28668,
28745,
28753,
28754,
28779,
28780,
28831,
28832,
28846,
28847,
28891,
28967,
28975,
28976,
29030,
29031,
29082,
29083,
29084,
29155
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 29155,
"ccnet_original_nlines": 884,
"rps_doc_curly_bracket": 0.0009603800135664642,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.14576981961727142,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006859759800136089,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32907775044441223,
"rps_doc_frac_unique_words": 0.17117665708065033,
"rps_doc_mean_word_length": 6.867741107940674,
"rps_doc_num_sentences": 210,
"rps_doc_symbol_to_word_ratio": 0.0005716499872505665,
"rps_doc_unigram_entropy": 5.134701728820801,
"rps_doc_word_count": 3289,
"rps_doc_frac_chars_dupe_10grams": 0.3357977569103241,
"rps_doc_frac_chars_dupe_5grams": 0.5274481773376465,
"rps_doc_frac_chars_dupe_6grams": 0.47658050060272217,
"rps_doc_frac_chars_dupe_7grams": 0.45564016699790955,
"rps_doc_frac_chars_dupe_8grams": 0.4131397306919098,
"rps_doc_frac_chars_dupe_9grams": 0.40765008330345154,
"rps_doc_frac_chars_top_2gram": 0.027492469176650047,
"rps_doc_frac_chars_top_3gram": 0.08646184206008911,
"rps_doc_frac_chars_top_4gram": 0.07561536878347397,
"rps_doc_books_importance": -2826.50830078125,
"rps_doc_books_importance_length_correction": -2826.50830078125,
"rps_doc_openwebtext_importance": -1649.3382568359375,
"rps_doc_openwebtext_importance_length_correction": -1649.3382568359375,
"rps_doc_wikipedia_importance": -1016.127197265625,
"rps_doc_wikipedia_importance_length_correction": -1016.127197265625
},
"fasttext": {
"dclm": 0.058486878871917725,
"english": 0.5342335104942322,
"fineweb_edu_approx": 2.3573532104492188,
"eai_general_math": 0.43143510818481445,
"eai_open_web_math": 0.10922586917877197,
"eai_web_code": 0.22885674238204956
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "518",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Numerical analysis"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,663,278,897,121,356,300 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks RobOMonk
Do you know where your variables are?
PerlMonks
MakeMaker to make Makefile in subdir
by scain (Curate)
on Sep 23, 2003 at 20:51 UTC ( #293675=perlquestion: print w/ replies, xml ) Need Help??
scain has asked for the wisdom of the Perl Monks concerning the following question:
Hello all,
So, how many times can I put the word 'make' in a title?
OK, here is the question, I have a big application that is composed of several smaller components developed by separate but related groups plus utility code, glue code, examples and documentation. Because these smaller components have Makefile.PLs of their own, I want to write a super Makefile.PL that will know about the Makefile.PL files that are in subdirectories. While I have read man make, perldoc ExtUtils::MakeMaker, perldoc ExtUtils::MakeMaker::Tutorial and info make, it is still not clear to me how to do this. Can anyone shed light on this?
Scott
Project coordinator of the Generic Model Organism Database Project
Comment on MakeMaker to make Makefile in subdir
Select or Download Code
Re: MakeMaker to make Makefile in subdir
by PodMaster (Abbot) on Sep 23, 2003 at 22:33 UTC
Its mostly magic. This has been discussed before, but I can't be bothered to super search it, so i'm just gonna give you a few examples of distributions that do this
MJD says "you can't just make shit up and expect the computer to know what you mean, retardo!"
I run a Win32 PPM repository for perl 5.6.x and 5.8.x -- I take requests (README).
** The third rule of perl club is a statement of fact: pod is sexy.
Great. I checked out libwin32-0.191 and it does seem to magically cascade to Makefile.PL's. But a little experimentation showed the trick is to ensure that each makefile is only one directory below the next. So even though h2xs builds a tree, the next set of modules only want the leaf directory of that tree, and in fact build totally correctly regardless as to what that leaf directory is called. (the latter fact is not shown below. Anyways thanks for the heads up on how to figure this out, I hope its as useful to scain as it has been to me.
D:\perl\Recursive\L1>dir Volume in drive D is New Volume Volume Serial Number is 0842-2896 Directory of D:\perl\Recursive\L1 2003/09/24 11:12 <DIR> . 2003/09/24 11:12 <DIR> .. 2003/09/24 00:12 168 Changes 2003/09/24 00:12 1,214 L1.pm 2003/09/24 11:12 <DIR> L2 2003/09/24 10:00 498 Makefile.PL 2003/09/24 00:12 56 MANIFEST 2003/09/24 00:12 1,112 README 2003/09/24 11:12 <DIR> Recurse 2003/09/24 11:12 <DIR> Recursive 2003/09/24 00:12 487 test.pl 6 File(s) 3,535 bytes 5 Dir(s) 6,143,295,488 bytes free D:\perl\Recursive\L1>tree D:\perl\Recursive Folder PATH listing for volume New Volume Volume serial number is 0006FE80 0842:2896 D:\PERL\RECURSIVE +---L1 +---L2 +---Recurse +---Recursive +---Recursive D:\perl\Recursive\L1>perl makefile.pl Checking if your kit is complete... Looks good Checking if your kit is complete... Looks good Writing Makefile for Recursive::L2 Checking if your kit is complete... Looks good Writing Makefile for Second::Recurse Checking if your kit is complete... Looks good Checking if your kit is complete... Looks good Writing Makefile for Recursive::Recursive::Recursive Writing Makefile for Recursive::Recursive Writing Makefile for Recursive::L1 D:\perl\Recursive\L1>nmake Microsoft (R) Program Maintenance Utility Version 7.00.9466 Copyright (C) Microsoft Corporation. All rights reserved. cp L1.pm blib\lib\Recursive\L1.pm cp L2.pm ..\blib\lib\Recursive\L2.pm cp Recurse.pm ..\blib\lib\Second\Recurse.pm cp Recursive.pm ..\blib\lib\Recursive\Recursive.pm cp Recursive.pm ..\..\blib\lib\Recursive\Recursive\Recursive.pm D:\perl\Recursive\L1>tree D:\perl\Recursive Folder PATH listing for volume New Volume Volume serial number is 0006FE80 0842:2896 D:\PERL\RECURSIVE +---L1 +---blib | +---arch | | +---auto | | +---Recursive | | | +---L1 | | | +---L2 | | | +---Recursive | | | +---Recursive | | +---Second | | +---Recurse | +---lib | +---auto | | +---Recursive | | | +---L1 | | | +---L2 | | | +---Recursive | | | +---Recursive | | +---Second | | +---Recurse | +---Recursive | | +---Recursive | +---Second +---L2 +---Recurse +---Recursive +---Recursive D:\perl\Recursive\L1>
Cheers mate.
---
demerphq
First they ignore you, then they laugh at you, then they fight you, then you win.
-- Gandhi
Thanks demerphq and PodMaster; this is at least getting me close. There is some magic here. My directory structure looks like this:
gmod/ src/ component1/ component2/ component3/
All I had to do was put a simple Makefile.PL in the src/ directory and when the main Makefile.PL was executed in the gmod/ directory, it saw the one in src/, which in turn saw the ones in component directories.
This probably would have worked flawlessly if the items in the component directories were only Perl modules, but they are more complicated than that, and have in their Makefile.PLs custom overrides to the install target (so that items can be installed under /usr/local/apache, for instance). I may be able to get around that by overriding the install target in the main Makefile.PL, but that is unattractive for at least one reason: it makes the main Makefile.PL more fragile (if the author of component1 changes his Makefile.PL and doesn't tell me, it won't work as expected).
Thanks again,
Scott
Project coordinator of the Generic Model Organism Database Project
Re: MakeMaker to make Makefile in subdir
by demerphq (Chancellor) on Sep 23, 2003 at 23:09 UTC
I dont think there is a way "standard" way to do this if you mean recursively generating the makefiles from Makefile.PL's and then the appropriate action as a cascade. I can think of a few (horrible) ways to do this by hand but... :-(
The solution ive come with at work is to merge components into one extremely large distro, with some twenty or so modules controlled from one Makefile. Its relatively easy to do, but a touch of a pain to admin. Anway, if you do find a way, please let me know. I do recommend of all places perlXStut as it has something in there involving MYEXTLIB but it looks like that is oriented towards building C libraries and not a perl distro.
---
demerphq
First they ignore you, then they laugh at you, then they fight you, then you win.
-- Gandhi
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: perlquestion [id://293675]
Approved by sgifford
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (15)
As of 2014-03-10 15:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
Have you used a cryptocurrency?
Results (213 votes), past polls
|
{
"url": "http://www.perlmonks.org/index.pl/jacques?node_id=293675",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "30326",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PWDKN3ZNBDNB5DYPAH4WYDPVGIBUXX4Q",
"WARC-Concurrent-To": "<urn:uuid:3ab52f2e-dc3a-4d52-9544-8db102456704>",
"WARC-Date": "2014-03-10T15:08:20Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VDIC2IPUCYT52QR5OYGAI4JP63LBBSQE",
"WARC-Record-ID": "<urn:uuid:d228dc57-093f-4408-8387-5f979a10c728>",
"WARC-Target-URI": "http://www.perlmonks.org/index.pl/jacques?node_id=293675",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:830004da-ffc6-433b-b140-af96db234d52>"
},
"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,
72,
110,
112,
124,
125,
162,
163,
181,
270,
354,
355,
366,
367,
424,
425,
979,
980,
986,
1053,
1054,
1102,
1126,
1167,
1217,
1387,
1388,
1487,
1574,
1646,
1647,
2200,
2201,
4313,
4314,
4333,
4334,
4335,
4345,
4360,
4361,
4451,
4469,
4470,
4471,
4611,
4666,
4885,
4886,
5472,
5473,
5495,
5509,
5584,
5585,
5626,
5680,
5681,
5920,
5921,
6359,
6360,
6361,
6369,
6382,
6383,
6471,
6487,
6488,
6489,
6497,
6507,
6517,
6518,
6538,
6556,
6569,
6582,
6620,
6641,
6646,
6658,
6695,
6696,
6734,
6747,
6789,
6816,
6826,
6839,
6851,
6862,
6880,
6881,
6917,
6918,
6919,
6920,
6921
],
"line_end_idx": [
72,
110,
112,
124,
125,
162,
163,
181,
270,
354,
355,
366,
367,
424,
425,
979,
980,
986,
1053,
1054,
1102,
1126,
1167,
1217,
1387,
1388,
1487,
1574,
1646,
1647,
2200,
2201,
4313,
4314,
4333,
4334,
4335,
4345,
4360,
4361,
4451,
4469,
4470,
4471,
4611,
4666,
4885,
4886,
5472,
5473,
5495,
5509,
5584,
5585,
5626,
5680,
5681,
5920,
5921,
6359,
6360,
6361,
6369,
6382,
6383,
6471,
6487,
6488,
6489,
6497,
6507,
6517,
6518,
6538,
6556,
6569,
6582,
6620,
6641,
6646,
6658,
6695,
6696,
6734,
6747,
6789,
6816,
6826,
6839,
6851,
6862,
6880,
6881,
6917,
6918,
6919,
6920,
6921,
6956
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6956,
"ccnet_original_nlines": 98,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2835346460342407,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05657977983355522,
"rps_doc_frac_lines_end_with_ellipsis": 0.010101010091602802,
"rps_doc_frac_no_alph_words": 0.32104259729385376,
"rps_doc_frac_unique_words": 0.43976494669914246,
"rps_doc_mean_word_length": 5.019588470458984,
"rps_doc_num_sentences": 90,
"rps_doc_symbol_to_word_ratio": 0.0050858198665082455,
"rps_doc_unigram_entropy": 5.598074436187744,
"rps_doc_word_count": 1021,
"rps_doc_frac_chars_dupe_10grams": 0.14712195098400116,
"rps_doc_frac_chars_dupe_5grams": 0.20526829361915588,
"rps_doc_frac_chars_dupe_6grams": 0.19765853881835938,
"rps_doc_frac_chars_dupe_7grams": 0.18595121800899506,
"rps_doc_frac_chars_dupe_8grams": 0.17951220273971558,
"rps_doc_frac_chars_dupe_9grams": 0.14712195098400116,
"rps_doc_frac_chars_top_2gram": 0.00819511990994215,
"rps_doc_frac_chars_top_3gram": 0.014634150080382824,
"rps_doc_frac_chars_top_4gram": 0.016585370525717735,
"rps_doc_books_importance": -684.895263671875,
"rps_doc_books_importance_length_correction": -684.895263671875,
"rps_doc_openwebtext_importance": -370.8592224121094,
"rps_doc_openwebtext_importance_length_correction": -370.8592224121094,
"rps_doc_wikipedia_importance": -281.54913330078125,
"rps_doc_wikipedia_importance_length_correction": -281.54913330078125
},
"fasttext": {
"dclm": 0.17103028297424316,
"english": 0.8879689574241638,
"fineweb_edu_approx": 1.7805293798446655,
"eai_general_math": 0.255179226398468,
"eai_open_web_math": 0.3019214868545532,
"eai_web_code": 0.20712512731552124
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.136",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "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
|
-6,899,742,341,319,575,000 |
New! View global litigation for patent families
US5819251A - System and apparatus for storage retrieval and analysis of relational and non-relational data - Google Patents
System and apparatus for storage retrieval and analysis of relational and non-relational data Download PDF
Info
Publication number
US5819251A
US5819251A US08595905 US59590596A US5819251A US 5819251 A US5819251 A US 5819251A US 08595905 US08595905 US 08595905 US 59590596 A US59590596 A US 59590596A US 5819251 A US5819251 A US 5819251A
Authority
US
Grant status
Grant
Patent type
Prior art keywords
relational
text
data
non
database
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
US08595905
Inventor
Mark Kremer
Quoc Tai Tran
Michael Depledge
Santanu Mukhopadhyay
William M. Keese
Behrouz Arbab-Dehkordi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Oracle International Corp
Original Assignee
Oracle Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Grant date
Links
Images
Classifications
• GPHYSICS
• G06COMPUTING; CALCULATING; COUNTING
• G06FELECTRICAL DIGITAL DATA PROCESSING
• G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
• G06F17/30Information retrieval; Database structures therefor ; File system structures therefor
• G06F17/30286Information retrieval; Database structures therefor ; File system structures therefor in structured data stores
• G06F17/30587Details of specialised database models
• G06F17/30595Relational databases
• YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
• Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
• Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
• Y10S707/00Data processing: database and file management or data structures
• Y10S707/99931Database or file accessing
• YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
• Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
• Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
• Y10S707/00Data processing: database and file management or data structures
• Y10S707/99941Database schema or data structure
• Y10S707/99944Object-oriented database structure
• Y10S707/99945Object-oriented database structure processing
Abstract
A system and apparatus is disclosed which stores, retrieves and analyzes relational and non-relational data. An application program provides a data query statement containing both relational and non-relational portions to a relational server. In an embodiment, the query statement is a Structured Query Language ("SQL") CONTAINS stored procedure or CONTAINS function statement. The relational data server then provides the non-relational query to either a text queue or database management language ("DML") queue. A non-relational data server then accesses either the text queue or the DML queue. The non-relational data server obtains pointers to the non-relational data and stores them in a temporary table. The pointers and relational data portion are processed by the relational server to obtain the relational and non-relational data. In an embodiment, the non-relational data server is a text server including an engine, filter, lexer, data storage and word list.
Description
REFERENCE TO MICROFICHE APPENDIX
Reference is made herein to Microfiche Appendix A, entitled "Oracle TexTile Functional Specification, Oct. 11, 1995," reproduced within a total number of 1 microfiche and a total number of 55 frames.
COPYRIGHT LIMITED WAIVER NOTICE
Appendix A contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction of the Appendix as it appears in the United States Patent and Trademark patent files or records, but otherwise reserves all copyright rights whatsoever.
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates generally to a database management system and, more specifically, to the storage, retrieval and analysis of relational and non-relational data.
2. Description of the Related Art
A database management system provides for the storage, retrieval and analysis of data. Most modern business database management systems use a relational model.
The relational database model is based on the mathematical concept of a relation and is often implemented as a table. A particular relational database based on this model is defined using mathematically-based rules which indicate precisely which tables should be included. Data in the rows of a table form tuples. Data in each column of a table are attributes of the tuples. Data is stored in a plurality of tables, each of which corresponds to a set of tuples for common predefined attributes. A collection of related tables or relations in the database is known as a schema.
Typical examples of so called "relational" database management system applications are financial accounting database systems, airline reservation database systems, and inventory control database systems. An example of a relational database system is the Oracle7 database server, available from Oracle Corporation, 500 Oracle Parkway, Redwood Shores, Calif. 94065. Such a database system has a large installed base of units.
Other relational database systems are described in U.S. Pat. No. 5,437,027, entitled SYSTEM AND METHOD FOR DATABASE MANAGEMENT SUPPORTING OBJECT-ORIENTED PROGRAMMING, issued Jun. 25, 1995 and U.S. Pat. No. 5,412,804, entitled EXTENDING THE SEMANTICS OF THE OUTER JOIN OPERATOR FOR UN-NESTING QUERIES TO A DATABASE, issued May 2, 1995.
A data manipulation language, or "query language", for a relational database management system typically specifies operations upon one or more relations to create a new relation. For example, a "restriction" operation forms a subset of the rows in a table by applying a condition or "predicate", to the values in each row. A "projection" operation removes columns from the rows by forming a stream of rows with only specified columns. A "join" operation combines data from a first table with data from a second table, typically by applying a predicate comparing the values in a column of the second table.
The type of the predefined attribute information in a relational database is often limited in scope. Generally, attributes are constrained to numbers and American Standard Code for Information Interchange ("ASCII") text strings. In the past, this limitation has not been overly restrictive for traditional business data-processing applications. Traditional business data-processing applications generally do not require search mechanisms more complex than ASCII character and numerical matching and comparison.
The search mechanisms useful for traditional relational database applications do not operate as well for more complex non-relational data. A non-relational database is a database which cannot be related by mathematical expressions. Examples of non-relational database applications are computer-aided design and manufacturing database systems, software engineering database systems, multimedia information systems, graphic database systems, sound database systems, text document database systems, and expert database systems.
For example, a pattern-matching search for graphic data is very complicated. A graphical pattern-matching analysis is well beyond the capabilities of a typical relational database system. Also, a graphic data search must be described in a way that is clear to the user and possible for the database system to interpret and execute efficiently. Such a search may require modification of the relational database query language interpreter.
Databases containing text documents also require complicated searching specific to the text characteristics. A search of English text documents may require more complicated searching than a simple text comparison of the data. Further, an alternate search mechanism would be required for searching non-English text, such as Japanese documents. Searches through text databases may require 1) comparison of documents or formats other than plain text, 2) the ability to handle words spelled differently or entered into the database incorrectly, 3) the ability to search for words that may be included in the text document instead of words in the search query, and 4) different tenses of the same words. Text of languages that are not easily represented in plain text are often difficult to deal with in relational databases.
Advancing technology has driven an increased need to store, retrieve and analyze non-relational data in a database management system. This need presents a problem for database management system manufacturers, who are challenged with providing database systems that are compatible with existing systems that can store, retrieve and analyze non-relational data, as well as relational data.
One solution to this problem is a complete redesign of a database management system to include non-relational data types. This proposed solution is shown in FIG. 1. An example of this approach is the Montage Object-Relation Database Management System ("ORDBMS") as described at page 50, volume 7 number 2 of DBMS, February 1994. This database management system 1 is an implementation of the POSTGRES system developed by the University of California. Database management system 1 is based on object-oriented design principles and was designed to be a "razor" into which various data type or "blades" in database 5 can be incorporated.
A disadvantage of the database management system 1 is that the use of "blades" require extensive modification of relational and non-relational server 4 program code. Extending the database system through relational and non-relational server 4 program code limits the number of third-party software programs currently available for use with server 4. Also, there is a loss of continuity with earlier developed systems, which could lead to compatibility problems.
Further, upgrades to the relational and non-relational server 4 will require the entire database management system to be shut down, or in other words, the database management system 1 does not allow for "hot upgrades."
Also, designing database management system 1 requires a large amount of development resources and costs. Redesign requires retraining of system developers, application developers, and database administrators.
Still another disadvantage of the database management system 1 is that it requires the use of object-oriented Structured Query Language 3 ("SQL" 3) in application 2 to define and manipulate the extended data types. Thus, the database management system 1 does not operate within the strict SQL 92 completely relational model, as adopted by the American National Standards Institute in 1992. SQL 3 is not yet an approved standard. This limits acceptance of the solution by early adopters and application developers.
Thus, a database management system which stores, retrieves and analyzes relational and non-relational data using existing application software is desirable. Further, the database management system should be easily upgradable without requiring to shut down the entire system. The database management system should also be consistent with existing data manipulation languages, thereby reducing cost and time required in implementing and operating the database management system.
SUMMARY OF THE INVENTION
According to the present invention, a database management system providing relational and non-relational data is presented. The database management system has an input device receiving a request, and an output device providing data. A memory contains the relational data and non-relational data. A processing system, coupled to the memory, includes a relational server responsive to the request which outputs relational data. The processing system also includes a non-relational server, responsive to the request outputting non-relational data. According to another aspect of the present invention, the processing system further includes means for parsing the request or database query into a relational database query and a non-relational database query. Further, the relational server is responsive to an SQL CONTAINS procedure or function statement.
According to another aspect of the present invention, the processing system further includes a first queue coupled to the non-relational server for storing the non-relational database query. A second queue is coupled to the non-relational database server for storing non-relational database modification requests. A table is also coupled to the non-relational server and the relational server for storing a relational data pointer provided by the non-relational server.
According to still another aspect of the present invention, the relational server is an SQL database server and the non-relational server is a text server. The text server includes a text engine, filter, lexer, data store and word list.
An apparatus for providing relational and non-relational data according to the present invention is also provided. The apparatus comprises a memory containing relational data and non-relational data and means for receiving a query. Means for parsing the query into a relational portion and a non-relational portion is coupled to the means for receiving. Means for providing relational data from the memory responsive to the query relational portion is coupled to the parsing means and memory. Finally, means for providing non-relational data from the memory responsive to the query non-relational portion is coupled to the parsing means and memory.
According to another aspect of the invention, the means for providing relational data includes a relational server and the means for providing non-relational data includes a non-relational server.
A method for providing data from a database containing relational data and non-relational data according to the present invention is also provided. The method includes providing a Structured Query Language ("SQL") statement and parsing the SQL statement into a relational portion and a non-relational portion. The non-relational portion is then processed to obtain pointers to the non-relational data in the database. The non-relational pointers are then stored in a table and the relational portion is processed, along with the pointers to the non-relational data, to obtain the data.
According to another aspect of the invention, the SQL statement is an SQL 92 statement. Further, the SQL statement is a CONTAIN procedure or function statement.
According to another aspect of the invention, the method step for processing the non-relational portion further comprises the step of queuing the non-relational portion on a queue. The non-relational portion is then popped from the queue and the non-relational portion is processed by the non-relational server.
An article of manufacture is also provided according to the present invention. The article of manufacture includes a computer readable medium having computer readable program means embodied therein for obtaining data in a database containing relational and non-relational data. The computer readable code means in the article of manufacture comprises computer readable program code means for causing the computer to read a query statement having a relational portion and non-relational portion. Computer readable program code means for causing the computer to parse the query into a relational portion and non-relational portion is then provided. Computer readable program means also causes the computer to obtain relational data from the database responsive to the relational portion. Computer readable program code means then causes the computer to obtain a pointer to the non-relational data and responds to the non-relational portion by displaying the relational data and the non-relational data.
According to another aspect of the present invention, the query statement is an SQL 92 statement.
BRIEF DESCRIPTION OF THE DRAWING
Other objects and advantages of the invention will become apparent upon reading the following detailed description and upon reference to the drawing in which:
FIG. 1 is a block diagram of a prior art relational and non-relational database management system;
FIG. 2 is a block diagram of a hardware and software configuration embodiment according to the present invention;
FIG. 3 is a block diagram of an embodiment of a relational and non-relational database management system according to the present invention;
FIG. 3a is a block diagram of another embodiment of a relational and non-relational database management system according to the present invention;
FIG. 4 is a block diagram of a relational database according to the present invention;
FIG. 5 is a block diagram of a non-relational text server according to the present invention;
FIG. 6 is a logic flowchart for processing a Data Definition Language ("DDL") statement according to the present invention;
FIG. 7 is a logic flowchart for processing a query according to the present invention; and
FIG. 8 is a logic flowchart for processing a textual component of an SQL query according to the present invention.
DETAILED DESCRIPTION OF THE INVENTION I. Hardware and Software Configurations
FIG. 2 illustrates a block diagram of a hardware and software embodiment operating context of the present invention. A user 8, which may be human or another application, interacts with the interactive device 10 to send information to, and receive information from, user interface management system 12. Interactive device 10 may be communication hardware such as display, keyboard, or other data input and data output devices. User interface management system 12, which may be communication software, in turn sends the information to, and receives information from, an application software program 14. Application 14 interfaces with operating system software 16 and relational and non-relational database management system RDBMS 18.
RDBMS 18 includes at least one relational server and one non-relational server. A server is defined as a computer program running within a computer system which provides a service to other programs. RDBMS 18 stores, retrieves and analyzes objects created by application 14. RDBMS 18 interfaces with operating system software 16 to utilize various operation system services and with secondary memory storage device 24, typically a disk drive, to physically store and retrieve the objects created by application 14. Operating system 16 also interfaces with additional computer hardware 22, as necessary, to provide its system services to application 14, RDBMS 18 and secondary memory storage device 24.
While FIG. 2 illustrates a system embodiment of the present invention, RDBMS 18 may also be installed on a computer readable medium, such as a magnetic disk.
A. Hardware Configurations
RDBMS 18 may be implemented in many various hardware configurations, as described below. Computer hardware 22 in FIG. 2 represents the various hardware configurations. However, at least one server must be an Oracle7 instance.
1. SMP Machines
The RDBMS 18 takes advantage of the multiple processors in symetric multiprocessing ("SMP") machines. RDBMS 18 architecture provides near linear scale up with central processing units ("CPUs") as the number of concurrent users increases.
SMP machines allow RDBMS 18 to scale up with the addition of textual data. RDBMS 18 employs parallel query and parallel indexing enhancing performance over large text collections. Striping data over disk drives and multiple CPUs are required for an optimal parallel configuration.
2. Network
Non-relational servers do not need to be on the same machine as an Oracle7 instance. A non-relational server could be on another machine and access Oracle7 through a network using, for example, SQL*Net. Work can be balanced between two or more machines. The speed of the network connection would, of course, be a factor for query and indexing performance.
3. MPP
RDBMS 18 also takes advantage of multiple processors and multiple nodes in massively parallel processing ("MPP") machines. Scaling issues are similar to SMP machines, but more configuration options are possible with MPP machines. For example, Oracle7 instances could reside on some nodes while non-relational servers could reside on other nodes. Alternatively, groups of Oracle7 instances and non-relational servers could be sprinkled on the separate nodes. In all cases, a non-relational server should simply piggy-back on an Oracle7 parallel server. More CPUs are generally available within MPP machines; therefore, they are ideal for parallel query and parallel indexing. Striping data over disk drives is required for optimal parallel configuration.
4. Distributed
Non-relational servers rely on Oracle7's distributed capabilities. Non-relational servers place no limitations on Oracle7 SQL; therefore, RDBMS 18 fully supports distributed queries, two-phase commit, and replication.
B. Platform/Operating System Software
Platforms, or operating system software 16, for RDBMS 18 include the major UNIX platforms, the UNIX workgroup platforms, and the proprietary workgroup platforms. Massively parallel platforms may also be used. For example, the following platforms could be used: 1) HP-UX; 2) IBM AIX; 3) Sun SunOS 4.1.3; 4) Sun Solaris 2.4; 5) DEC UNIX (formerly known as OSF/1); 6) Sequent PTX; 7) Pyramid; 8) DG-Aviion; 9) SCO Unix; 10) Unix Ware; 11) Sun Solaris x 86; 12) Microsoft NT; 13) Novell Netware; 14) IBM OS/2; 15) IBM SP-2; 16) nCube; 17) NCR 3600; and 18) Cray SuperServer 6400.
C. Application Programming Environments
In one embodiment, user interface management system 12 is Microsoft Windows. Windows application development tools, such as Oracle Forms, Oracle Power Objects, and Microsoft Visual Basic, may also be used.
Oracle programming environments, including the Oracle Call Interface ("OCI"), Pro*C, User Programmer Interface ("UPI"), and Procedural Language/Structured Query Language ("PL/SQL"), may be used to develop application software 14. The non-transparent query method, involving calling the CONTAINS PL/SQL procedure directly, described in detail below, can be used from any of these environments with any version of an SQL server as a relational server in RDBMS 18. Similarly, non-relational queries can be performed in all of Oracle's programming environments using an alternative transparent query method described in detail below.
II. Data Model
A. Overview
The following describes a general data flow according to the present invention with a more detailed description provided below. A functional specification describing an embodiment of the present invention entitled "Oracle TexTile Functional Specification, Oct. 11, 1995" is attached as Appendix A. FIG. 3 is a block diagram which depicts an embodiment of the present invention. FIG. 3 illustrates RDBMS 18 shown in FIG. 2. Relational and non-relational data is stored in relational and non-relational database 135. The characteristics of the attributes stored in database 135 are stored in a data dictionary 130. Data in database 135 has relational and non-relational attributes. A software application 100 provides a request 105 to the relational data server 110. In the preferred embodiment, relational sever 110 is an Oracle7 ver 7.3 SQL relational data server. Request 105 can be a request for data (Data Query), or an instruction to create and maintain indexes (Data Definition Language ("DDL") Request), or an instruction to modify data (Data Management Language ("DML") Event). In the preferred embodiment, request 105 may be a CONTAINS stored procedure or CONTAINS function in an SQL statement. If request 105 involves non-relational attributes, relational data server 110 parses and non-relational portions and produces a non-relational query. In the preferred embodiment, the non-relational query portion will be either a Data Query, DDL Request, or DML Event.
If the non-relational query portion is a Data Query or DDL Request, the query is placed on the Data Query Queue 115. A non-relational data server 140 configured to satisfy that type of non-relational query (Data Query or DDL Request) takes the non-relational query from the Data Query Queue 115, and processes the non-relational query. Results are stored in temporary table 145. Relational data server 110 processes the relational component of query 105. Relational data server 110 executes the relational query that makes use of the data in temporary table 145, and reports the results to application 100.
If the non-relational request is a DML Event, the request is placed on DML Queue 120 in pending table 121. A non-relational data server 140 configured to satisfy DML Events transfers the request from the pending table 121 to the In Progress Table 122 while the request is being processed. When the DML Event is complete, appropriate result information is communicated to application 100.
While FIG. 3 shows one relational server and one non-relational server, other embodiments could include multiple relational and non-relational servers.
FIG. 3a is a block diagram which depicts another embodiment of the present invention. Similarly, data in database 135 has relational and non-relational attributes. Application 100 has a query that involves non-relational attributes of database 135. Application 200 places a non-relational query on either Data Query Queue 215 or DML Queue 220.
A non-relational database server 240 configured to satisfy that type of non-relational query (Data Query, DDL Request, or DML Event) takes a non-relational request from Data Query Queue 215 or DML Queue 220, and processes the non-relational request. Query results are stored in temporary table 245. Application 100 provides a query to relational data server 205 that makes use of the data in the temporary table 245, and reports the results to application 100.
B. Relational and Non-relational Database: Text Columns
Turning now to FIG. 4, there is shown a detailed representation of a relational database 32 in relational and non-relational database 135, shown in FIG. 3. Relational database 32 includes data stored in a number of tables, such as the tables 51 and 52. Each table corresponds to a particular relation in the relational database. Table 51, for example, corresponds to a relation "R" and table 52 corresponds to a relation "S". Each table is shown as a rectangular matrix of rows and columns. Internally, however, data could be stored in any number of ways. Each row, for example, could be stored as a record of a file. Alternatively, the data in each of the tables could be freely dispersed in memory, and the rows and columns could be defined by lists of pointers to the data. In any event, the data structures storing the data in the tables 51 and 52 permit all of the rows in a table to be accessed sequentially and further permit a specified column position of an accessed row to be indexed.
Each column in each of the tables is labeled by a key called an attribute. Most conventional database query languages assign an alphanumeric relation name to each table and further assign an alphanumeric attribute name associated with one table which need not be distinct from the attribute name of another table. A particular column of data, however, can be uniquely specified by the combination or concatenation of both a relation name and an attribute name.
To speed up access to the rows of the tables, the relational database 32 further includes a number of indices for columns of tables. These indices, along with their corresponding table information, are stored in what is known as a schema, such as schema 53. For example, schema 53 contains index 56 to relation "R" of the first table 51, and an index 57 to the relation "S" for the second table 52. The relation "R" is stored in schema 53 as rows of values for attributes named "a", "b", "c", "d", "e", "f", "g" corresponding to each column of the table R, and the relation "g" is stored in schema 53 as rows of values for attributes named "h", "i", "j", "k", "l" corresponding to each column of the table S. The indexes 54 and 55, for example, provide for a numerical pointer or location address to be obtained for rapid access to table entries given the table and column names.
For processing certain relational operations, it is only necessary to scan sequentially through all of the rows of a table. To facilitate the selection and retrieval of a particular row, however, it is desirable to identify one or more columns of the table as including keys to the individual rows. Some operating systems, for example, have optimized procedures for storing tables in files according to a primary key and for retrieving a row or record specified by the primary key. In such systems, if the user does not specify a column as including the primary key, the system may nevertheless assign a primary key to each row. In such a case, the primary key is known as a "surrogate column" which, if not accessible to the user, will be accessible to the computer programmer.
In an embodiment, non-relational data server 140 in FIG. 3 is a text server. In this embodiment, any standard column within any standard table may be used as a text column in database 135. Text columns are of data type CHAR, VARCHAR2, LONG, or LONG RAW. Text columns have a policy attached to them. Text, or documents, are usually stored directly in a text column. The one exception is external text.
External text is text that is stored in operating system file system, not in database 135. In the present invention, this is considered an indirect data store. The column that is defined to the system as the text column does not directly store the text but rather stores the name of the operating system file which contains the text.
C. Data Dictionary
Data dictionary 130 in FIG. 3 registers non-relational data components (objects) and stores the preferences for those components. Policies are logical groupings of non-relational data components and are defined and stored within data dictionary 130. In an embodiment, each column has at least one policy assigned to it. Data dictionary 130 also manages user preferences, resource limits and non-relational data server 140 status.
1. Non-relational Components and their Preferences
In a text server embodiment, the replaceable components in non-relational data server 140 are Engines, Filters, Lexers, Data Stores and Word Lists (Stemmers, Soundex and Fuzzy Match), as seen in FIG. 5 and described in detail below. Each component must be registered with the data dictionary 130.
Preferences and attributes are also defined in data dictionary 130. Preferences and attributes can be set for each of these components. For example, the English Fuzzy Match component has a preference to choose between tuning for typewritten text or for text which has resulted from a scan and Optical Character Recognition ("OCR") process. All preference attributes have default values.
2. Policy
A non-relational server policy is a logical grouping of components and their preference attribute settings. In the text server embodiment, every text column that will be indexed by a text server must be assigned a policy. For example, consider a table with two text columns: one holds English Microsoft Word documents and the other holds Japanese plain text comments.
The example table schema looks like this:
Table: DOC-- AND-- COMMENT
Columns: TEXTKEY number (unique primary key)
TEXTDATE date
AUTHOR varchar2(50)
COMMENTS varchar2(2000) (text column storing Japanese ASCII)
DOC long raw (text column storing English MS-Word)
Two text server policies are created; one for the DOC column and one for the COMMENTS column. The policies look like this:
Policy name: I-- DOC
Column: <schema>.DOC-- AND-- COMMENT.DOC
Engine: Text General Purpose Engine
Filter: MS-Word
Lexer: Text General Purpose Lexer
Data Store: Direct
Stemmer: English Stemmer
Word List: English Soundex, English and typewritten Fuzzy Match
Policy name: I-- COMMENTS
Column: <schema>.DOC-- AND-- COMMENT.COMMENTS
Engine: Specialized Japanese Engine
Filter: None
Lexer: Specialized Japanese Lexer
Data Store: Direct
Stemmer: None
Word List: Japanese Soundex, Japanese and typewritten Fuzzy Match
The mix-and-match approach of a text server policy definitions gives the application developer flexibility and encourages modular design when developing text applications.
3. Users
In an embodiment, a text server 300 relies on an Oracle7 data dictionary to track and manage users. The text data dictionary stores a minimal amount of information about users. The data dictionary stores preference information for a user. There are three preferences:
Default penetration--A user may specify default penetration operators which are automatically used on every query.
Thesaurus--Which thesaurus does the user prefer?
Concept Dictionary--Which concept dictionary does the user prefer?
In the text server embodiment, data dictionary 130 also stores specific resource usage information. Resource information includes:
1. Maximum number of temporary tables 145 available.
2. The share level of temporary tables. Share levels describe whether temporary tables may be shared, for example, between sessions or schemas.
A text data dictionary also tracks a unique session identifier for every user calling text server 300. This aids tracking and cleanup.
3. Servers
Data dictionary 130 also stores information necessary to track various non-relational servers. The non-relational server attributes tracked are Server Name and Server Status. Non-relational servers can have the following status:
1) INIT, Initializing itself; IDLE, Idle; waiting for a text request; RUN, Handling a request; PAUSE, Paused; will not resume operation until it receives a CONTINUE prompt; SHUTTING-- DOWN, Shutting down; EXIT-- NORMAL, Exited with a normal or immediate shutdown operation; EXIT-- ABORT, Exited with a shutdown abort operation.
III. Process Model: Text Server
The following describes the process model of a text server embodiment of the present invention. It should be understood that other non-relational servers may be implemented likewise.
A. Text Server
Text server 300, shown in FIG. 5, is a shared server which is designed to handle text functions, and only text functions. Text server 300 may be implemented as non-relational data server 140 as shown in FIGS. 3 and 2. A text server process mirrors a shared SQL server, or relational server counterparts, only processing the textual part of a query or SQL request. In an embodiment, the textual component of an SQL request can be one of three types: 1) Text queries (using the CONTAINS function or procedure), 2) DDL Requests (create index, drop index, etc.), or 3) DML Events (normal inserts, updates, and deletes).
At system startup, a configurable number of text servers 300 are started. These text servers listen for text requests. Text requests can come from two different logical queues, Data Text Queue 115 and DML Queue 120 as seen in FIG. 3. The non-relational portion of SQL queries and non-relational DDL statements get pushed onto Data Text Queue 115. In the preferred embodiment, an Oracle7 server pipe is used in the implementation. Text server 300 then pops the requests off Data Text Queue 115 and performs the requested operation.
DML events get communicated to the text server 300 through DML Queue 120. Any insertion, update, or deletion of text must also notify text server 300 through DML Queue 120. This is usually done through a simple trigger on a table containing the text column. In a preferred embodiment, DML Queue 120 consists of two standard Oracle tables.
Individual text servers may be started with a personality mask such that they are dedicated to a certain task, or group of tasks. The text server personalities are:
1. DBA. This personality allows a text server to startup new text servers, to perform client and server failure detection and correction, and to perform system garbage collection.
2. DML. This personality allows a text server to service non-relational DML requests.
3. QUERY. This personality allows a text server to run text queries.
4. DDL. This personality allows a Text Server to service non-relational DDL requests.
All text servers automatically take on the DBA personality. This prevents a single point of failure in a multi-server configuration. Text Servers can have one or more of the personalities DML, QUERY, and DDL. In a preferred embodiment, a non-relational database system according to the present invention should be started with at least one server having the QUERY personality, so the simplest configuration is one text server with the {DBA, QUERY} personality mask.
B. Text Queue
An SQL query statement (a select statement) which includes a CONTAINS function in the WHERE clause will dispatch the text query to text queue 115. Likewise, DDL Request statements, such as create index, drop index, and create policy, will also dispatch the operation to the text queue 115.
Whether it is the textual component of an SQL query or a non-relational database DDL Request statement that is dispatched to text queue 115, the first available text server (with the proper personality mask) will pick up the request. After getting the request, the text server will perform the operation and notify the calling client or application of its completion.
1. DDL Process
The steps of processing a non-relational database DDL Request statement is illustrated in FIG. 6.
A user or application 100 issues the following procedure calls in step 400:
execute dr-- ddl.create-- policy(`I-- TEXT`,`TEXTTAB.TEXT`);
execute dr-- ddl.create-- index(`I-- TEXT`).
The request to create a non-relational database index, identified by policy I-- TEXT, for text column TEXT in table TEXTTAB is pushed onto text queue 115 in step 401.
An available text server pops the request off text queue 115 in step 402 and creates the index in step 403.
A text server notifies the user of successful completion in step 404 or notifies user that there was an error and the indexing was not completed in step 405.
a. DDL Services
The non-relational and relational database management system according to the present invention provides DDL services for application developers to define, create, and maintain text indexes. The following DDL services are provided:
1. CREATE-- POLICY. Creates a new policy.
2. DROP-- POLICY. Drops a policy. If the policy has already been assigned to a text column the text index will also be dropped.
3. UPDATE-- POLICY. Updates a policy. If the policy being updated has already been assigned to a text column the updated policy will become a new policy with a different name. The old policy will remain intact.
4. CREATE-- PREFERENCE. Creates a new preference. This procedure will return an error if there are invalid attribute values.
5. DROP-- PREFERENCE. Deletes a preference. This procedure will return an error if the preference being deleted is referenced by a policy. The preference will not be deleted.
6. UPDATE-- PREFERENCE. Updates a preference. This procedure will return an error if the preference being updated is being referenced by a policy. The preference will not be updated.
7. CREATE-- INDEX. Creates the text index for a text column.
8. DROP-- INDEX. Drops the text index for a text column.
9. OPTIMIZE-- INDEX. Optimizes the text index for a text column.
10. SYNC. Synchronizes the system to a particular point in time. The sync service causes nothing to actually happen, it just waits for rows sitting in the DML Queue to be processed.
2. Textual Query Process
There are two methods for running non-relational queries, and in particular, text queries. The first is using the CONTAINS functions, which is transparent to the application, and the second method, a non-transparent method to the application, is using the CONTAINS stored procedure. An example of using the CONTAINS and SCORE functions is below:
select SCORE(TEXT) SCORE, TEXTDATE, AUTHOR, TITLE from TEXTTAB where contains (`TEXTTAB.TEXT`, `oracle and database`)>0 and TEXTDATE between `01-APR-95` and `10-APR-95` order by SCORE desc
The CONTAINS procedure is part of package DR-- QUERY and has the following definition:
______________________________________PROCEDURE CONTAINS(POLICY.sub.-- NAME VARCHAR2,TEXT.sub.-- QUERY VARCHAR2,RESTAB VARCHAR2,SHARELEVEL NUMBER default 0,QUERY.sub.-- ID NUMBER default NULL,CURSOR.sub.-- ID NUMBER default NULL)______________________________________
Where POLICY-- NAME is the full qualified name of a text column and RESTAB is a result table with the following layout:
<key><score> <contains-- id>!
Whether the result table has a value for <contains-- id> will depend on the number of CONTAINS functions in the query and the SHARE level. If a user's CONTAINS functions share a result table then <contains-- id> will be included. If a user's CONTAINS functions do not share a result table then <contains-- id> will not be included.
As an example of using the CONTAINS procedure, consider the following table:
TABLE 1______________________________________Table TEXTTABColumns TEXTKEY number (unique primary key) TEXTDATE date AUTHOR varchar2(50) TITLE varchar2(100) TEXT long (text column with direct text storage)______________________________________
Running a text query for the terms `oracle and database`, that will return TEXTDATE, AUTHOR, and TITLE would be done in the following manner (assume I-- TEXT is the policy for text column TEXTTAB.TEXT):
execute DR-- QUERY.CONTAINS (`I-- TEXT`, `oracle and database`, `DR-- TEMP`,0);
select SCORE, TEXTDATE, AUTHOR, TITLE from TEXTTAB, DR-- TEMP where
TEXTTAB.TEXTKEY=DR-- TEMP.TEXTKEY order by SCORE desc;
a. Temporary Tables
In the above example, DR-- TEMP is temporary table 145 in FIG. 3. Temporary tables store intermediate results of text queries. These intermediate results, or pointers, are then merged into the standard SQL query through a join operation or a sub-query operation. Temporary tables can be named anything but must have the following schema:
Table: DR-- TEMP
Columns: TEXTKEY varchar2(64)
SCORE number
CONID number
b. Score Function
The general purpose text engine returns a relevance score for each text column row intersection which is retrieved by a text search. Each row returned is given a score between 1 and 100. The score is a measure of how relevant the text contained in that row was with respect to the given query. Scoring of results is discussed further in the next section.
c. Text Processing Example
The steps of processing the textual component of an SQL query is illustrated in FIG. 7.
A user runs the following query in step 700:
select TEXTDATE, AUTHOR, TITLE from TEXTTAB where contains (TEXT, `oracle and database`)>0 and TEXTDATE between `01-APR-95` and `10-APR-95`.
The textual component of the query, find the tokens "oracle and database" within the text column TEXT in step 701, is pushed onto the text queue 115 in step 702.
An available text server, for example, text server 300, pops the request off text queue 115 in step 703 and runs the text query in step 704.
After the query has been run, text server 300 saves the results to temporary table 145 in step 705, DR-- TEMP for this example. The results are the primary keys from table TEXTTAB which satisfy the text query and the corresponding score of each returned row.
Text server 300 notifies the user of successful completion in step 707 or error in step 706.
The textual component of the query, "contains(TEXT,`oracle and database`)", gets replaced or rewritten with the following: "SCORE" in step 708. This rewriting is done by the SQL interpreter which is discussed in the next section.
The following query gets run with the results being displayed to the user or application in step 709:
select TEXTDATE, AUTHOR, TITLE from TEXTTAB-- VIEW TEXTTAB where SCORE>0 and TEXTDATE between `01-APR-95` and `10-APR-95`.
TEXTTAB-- VIEW is a view of TEXTTAB joined with the DR-- TEMP to expose the SCORE column. This will be explained further below.
C. The Text Query Rewrite
Content based search capabilities (text retrieval capabilities) are utilized through a set of PL/SQL functions called from various clauses of an SQL query statement. According to one embodiment, a relational data server 110 as shown in FIG. 3, or for example an SQL server, will rewrite queries which include SQL CONTAINS and SCORE function calls. This allows text search and retrieval to be performed from any Oracle interface. The following describes the CONTAINS, SCORE and DISPLAY functions in detail.
1. The CONTAINS Function
The CONTAINS function applies a text query, contained in a string argument, to a text column. It has two variants illustrated in Table 2.
TABLE 2______________________________________FUNCTION CONTAINS(COLUMN $TEXT.sub.-- COLUMN, /*Not a PL/SQL type */ TEXT.sub.-- QUERY STRING, LABEL INTEGER default0) returns number;FUNCTION CONTAINS(COLUMN $TEXT.sub.-- COLUMN, /*Not a PL/SQL type */ TEXT.sub.-- QUERY.sub.-- BIND INTEGER, LABEL, INTEGER default 0) returns number;______________________________________ COLUMN--The name of a valid base table or view text column. TEXT.sub.-- QUERY--The text query string. The text query must be a litera string, no string expressions allowed. LABEL--An optional numeric parameter to differentiate between multiple CONTAINS applied to the same column. TEXT.sub.-- QUERY.sub.-- BIND--A numeric identified for late binding of a text query. A text query string may be bound after parsing and before execution.
The CONTAINS function may only appear in the WHERE clause of a SELECT statement. The CONTAINS function may not be used in the WHERE clause of an UPDATE, INSERT, or DELETE statement.
2. The SCORE Function
The SCORE function returns a relevance score for its text column operand. The SCORE function syntax is illustrated in Table 3.
TABLE 3______________________________________FUNCTION SCORE( COLUMN $TEXT.sub.-- COLUMN /*Not a PL/SQL type*/ LABEL INTEGER default NULL returns INTEGER______________________________________ COLUMN--The name of a text column that is also the operand of a CONTAINS function in the same statement and corresponding WHERE. LABEL--Optional, must match the label value of a corresponding CONTAINS.
The SCORE function may only be called from an SQL SELECT list, ORDER BY, GROUP BY or HAVING expression. The SCORE function must have a corresponding CONTAINS function clause. For optimal execution, users will alias SCORE in the select list and refer to that alias in other clauses (the query optimizer does not detect common sub-expressions). The SCORE function will return 0 for documents that were not selected by its corresponding CONTAINS function.
3. The DISPLAY Function
The DISPLAY function is used to return a specific number of filtered characters of a text column. The syntax of the DISPLAY function is illustrated in Table 4.
TABLE 4______________________________________FUNCTION DISPLAY( COLUMN $TEXT.sub.-- COLUMN, /*Not a PL/SQL type */ LENGTH INTEGER default 40, OFFSET INTEGER default 0, WHITE1 INTEGER default 1) returns VARCHAR2;______________________________________ COLUMN--is a valid text column. LENGTH--optional, the desired length of the returned string. OFFSET--optional, where to start the returned string. WHITE1--optional, substitute sequences of white spaces with single blanks The default setting is 1 (yes), to disable set to NULL or 0.
4. The Rewrite Process
SQL statements according to the present invention incorporating non-relational database functions are valid SQL statements which get rewritten by a relational data server 110 or, for example an SQL server, for execution and performance purposes. At SQL query statement parse stage (parse in OCI), a text query rewrite will map out the desired functions and execute the steps illustrated in FIG. 8.
Map text calls in SQL statement in step 800, if no calls detected, exit.
Validate functions scope and match functions called from proper clauses in step 801.
Validate text column arguments in step 802.
Allocate resources in step 803 (temporary tables and packages required for statement execution).
Rewrite query substituting the table names and each function call in step 804. Rewrite substitutions is described in detail below.
Proceed with rewritten statement parsing in the database.
If an error is found at any stage, it must be reported and the rewrite process will stop.
5. Rewrite Substitutions
This section describes the substitutions that the text query rewrite process described above makes when mapping non-relational database functions to SQL clauses which will give the proper results and are optimized for performance. The following substitutions are made:
a. Table Names
Table names in the FROM clause of a SELECT statement get substituted if they are an operand to a CONTAINS function. They are substituted with the name of the view which relational server 110, and in particular an SQL server, creates on the fly. The view is a join of the text table to the temporary results table. The main purpose of the view is to expose the SCORE column, or columns, from the temporary results tables.
b. Contains
CONTAINS(COLUMN, TEXT-- QUERY,LABEL) is substituted by:
SCORE
Where:
SCORE is the column from the temporary results table. If more than one score is required then a number will be appended to the column name (SCORE1, SCORE2, SCORE3, etc.).
C. Score
SCORE(RESUME,LABEL) is substituted by:
SCORE
Where:
SCORE is the column from the view of the base table and the temporary results table. If more than one score is required then a number will be appended to the column name (SCORE1, SCORE2, SCORE3, etc.)
d. Display
DISPLAY(COLUMN , . . . ) is substituted by:
DISPLAY(POLICY, . . . )
DISPLAY--(the rewrite) is an overload of the original display.
POLICY--The policy name associated with the text column COLUMN.
D. DML Queue
The non-relational database DML queue 120 is used to notify the non-relational data server 140 of changes made to data in a text column. The non-relational database DML queue 120 is comprised of two tables, the pending table 121 and the in-progress table 122. Rows are placed in the DML queue 120 by a trigger which is created on the table containing the text column.
1. Pending table
Pending table 121 contains a list of all primary keys that have been updated (through an insert, update, or delete SQL operation) and that need attention.
2. In-Progress table
In progress table 122 contains all the primary keys that are currently being processed by the non-relational data server 140.
When a user inserts, updates, or deletes a cell of a text column a trigger also inserts a row into pending table 121 to note that the given cell has changed. The insert is done in the same transaction as the update to the base table and is only visible to DML queue 120 after the user issues a commit. An example of what the insert to pending table 121 looks like follows (PKEY=primary key for base table):
insert into pending (CID,PKEY)
values(my-- column-- id,my-- pkey);
The row is inserted to pending table 121 without a timestamp. As the non-relational database server 140 begins to process the rows in DML Queue 120, the rows will also be timestamped and inserted into In-Process-Queue. When the server completes processing a row, it is deleted from In-Process-Queue.
In some cases, an application will not want to place a trigger on a table for DML Queue notification. According to the present invention, non-relational database server 140 provides an alternative DML Queue notification procedure. The DML Queue may be notified of updates to text by calling an SQL stored procedure.
3. Timestamps
To support the Oracle7 process model, and to support a sync operation, DML Queue 120 entries must be processed in the time order that they appeared. At a specified time interval on the order of a few minutes, and whenever sync is called, all unmarked rows within pending table 121 will be marked with a timestamp. The timestamp is a lower bound based on when that change was committed.
4. Sync
A user can ask to block until all the currently pending DML operations have been indexed. A user can also ask to wait until all the DML operations completed before a given timestamp have been indexed. Both requests ask the non-relational database server 140 to synchronize the changes in DML Queue 120 to a given timestamp.
These two operations are called "sync" although they do not actually force anything to happen. What they do is "watch" the pending table until given entries have disappeared.
A user may also ask the non-relational database server 140 up to what time it is synchronized. The non-relational database server 140 will pass back the lowest timestamp found in DML Queue 120. The user is then guaranteed that all changes committed on or before this time have also been indexed.
5. DML Queue and Create Index
It is possible to perform updates to a text column within a table while the non-relational database server 140 is creating an index on the same text column. In this case, any changes to the table being indexed by a non-relational database server 140, will be queued in DML Queue 120. However, the changes will not be processed until after the create index finishes. This avoids a race condition where the DML Queue request might be processed, but then overwritten by the create index, even though the create index was processing an older version of the document.
IV. Text Server Components
Non-relational database servers according to the present invention are polymorphic in nature, meaning they can be comprised of several different types of objects and they can take on different personalities. For example, the text server 300 in FIG. 5 is object-oriented and can instantiate different components depending on the type of text to be processed. If text server 300 is asked to index a text column containing Microsoft Word documents, text server 300 will instantiate an MS-Word filter. If text server 300 is asked to index a text column containing Novell WordPerfect documents, a WordPerfect filter will be instantiated.
The following subsections discuss the replaceable components (objects) which can be integrated into text server 300. The framework provides a well defined interface for the integration of these components.
A. Engine
A specialized text engine is the largest component (in terms of the amount of work that it must do) which may be added to text server 300. Text engine 150 must be able to index a text column and, consequently, perform text retrieval over that same text column. In a preferred embodiment, text engine 150 stores its indexes within an SQL server.
The reason to use a special text engine is because text, and text applications, can differ. Some engines are optimized for certain types of text. Japanese text, for example, cannot be handled in the same manner as English and other European languages.
Text retrieval requires a text index for fast query performance. A text engine 150 within text server 300 according to the present invention has two major functions, index and query. Given a set of records, text engine 130 must be able to index that set and, consequently, satisfy text queries over that set.
In one embodiment, the present invention provides one text indexing engine. Engine 150 is general purpose and is suited for a broad range of text types and text applications. The text engine 150 extracts tokens from text and builds an inverted index. The actual implementation of the index is further optimized for fast query performance. Compression is applied to the index data to keep the size it requires on disk to a minimum. Engine 150 then uses this index to satisfy text query criteria.
The parameters which may be set for the text engine 150 include memory utilization or how much memory is text engine 150 allowed to use.
B. Filter
Filter 151 is used to perform text retrieval over word processing, or formatted documents. There may be multiple filters in text server 300. The system stores documents in their natural format and uses filters to build temporary ASCII views of documents. The system can then index the ASCII text of the formatted document.
Filter 151 used at indexing time must be synchronized with the filters used in a text viewing tool. This allows correct search term highlighting to be performed within the viewer.
For example, the system according to the present invention includes filters for Microsoft Word and Novell WordPerfect.
C. Lexer
Lexer 152 is the program code which breaks up text into its indexable tokens. English and most European languages can use the same lexer. Tokens in those languages are distinguished by white space and punctuation (comma, period, question mark, etc.).
Japanese and Chinese are pictorial based languages and cannot be tokenized in the same manner as English. A common text retrieval solution for these languages is a dictionary based lexer. The picture symbols used in the text are matched against a dictionary of known words to determine the tokens. This requires a specialized lexer.
Another language that may require a special lexer is German. Due to the heavy use of compound words in the German language, the tokenization process can benefit from a special lexer which will break up certain compound words.
The parameters which may be set for lexer 152 are:
1. Alpha-join characters. Characters which are not alphanumeric can be defined as characters which will join words into tokens. For example, by specifying "*" as an alpha-join character the word SQL*TextRetrieval will be indexed as one token rather than as the two tokens SQL and TextRetrieval.
2. Numeric-join characters. Characters which are not alphanumeric can be defined as characters which will join numbers into tokens. For example, by specifying "-" as a numeric-join character the date 05-04-95 will be indexed as one token.
D. Data Stores
The system uses a data stores 153 (object) to abstract the storage of text from the processing of text. In one embodiment, the system will provide support for three data stores: direct, external, and master/detail.
The direct data store simply means that the text is stored directly in the text column. The external data store is characterized by the storage of text in operating system file system. In the external data store, a character column is used to hold the name of the operating system file.
The third type of text column is a master/detail data store. This is for applications which have chosen to store text in a detail table. These applications use multiple rows to make up a single text item (a single document).
To summarize, examples of each of the three types of data stores are shown in Tables 5-7.
TABLE 5______________________________________Direct Data Store______________________________________Table: DIRECT.sub.-- TEXTColumns: TEXTKEY number (unique primary key) TEXTDATE date AUTHOR varchar2(5) NOTES varchar2(2000)(text column with direct text storage) TEXT long (text column with direct text storage)______________________________________
TABLE 6______________________________________External Data Store______________________________________Table: EXTERNAL.sub.-- TEXTColumns: TEXTKEY number (unique primary key) TEXTDATE date AUTHOR vachar2(50) NOTES varchar2(2000) (text column with direct text storage) TEXT varchar2(100) (text column OS file name)______________________________________
TABLE 7______________________________________Master/Detail Data Store______________________________________Table MD.sub.-- HEADERColumns: TEXTKEY number (unique primary key) TEXTDATE ndate AUTHOR varchar2(50)Table MD.sub.-- TEXT TEXTKEY number (foreign key to MD.sub.-- HEADER.TEXT KEY)______________________________________
E. Word List
In one embodiment of the present invention, there are three forms of a word list 155 component, soundex 155a, fuzzy match 155b and stemmer 154. These components expand a text query. Soundex expands a query by finding search tokens that sound similar to the specified search token. For example, a soundex search on the token "Newblood" would also search on the token "Newbold".
Fuzzy match expands a query by finding the spelling variants of a search token. For example, a fuzzy match search on the token "receive" will also search on the token "receive". Fuzzy match can be tuned specifically for typewritten text or for text which has been through the OCR process.
The non-relational database server according to the present invention provides an open interface to soundex and fuzzy match components because, similarly to stemming, different languages will have different requirements. Further, some languages may require word list support which is different than Soundex and Fuzzy Match.
Stemmer 154 is used to expand queries by deriving variations (verb conjugation; noun, pronoun, and adjective inflections) of a search token. For example, a stem search on the token "buy" will expand to search on tokens "buys", "buying", and "bought", but not on the token "buyer". A search on the token "buyer" will expand to search on "buyers".
Different languages have different stemming rules and, therefore, require different stemmers. In one embodiment, the supported languages are English, Spanish, French, German and Italian.
V. Conclusion
The foregoing description of the preferred embodiments of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Obviously, many modifications and variations will be apparent to practitioners skilled in the art. The embodiments were chosen and described in order to best explain the principles of the invention and its practical applications, thereby enabling others skilled in the art to understand the invention for various embodiments and with the various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalents.
Claims (16)
What is claimed is:
1. A database management system, having an input device receiving a database query and an output device providing data, comprising:
(a) a memory containing relational data and non-relational data; and
(b) a processing system, coupled to the memory, including
(i) a relational server, responsive to the database query, outputting relational data; and,
(ii) a non-relational server, responsive to the database query, outputting non-relational data, wherein the database query is an SQL CONTAINS procedure statement.
2. A database management system, having an input device receiving a database query and an output device providing data, comprising:
(a) a memory containing relational data and non-relational data; and
(b) a processing system, coupled to the memory, including
(i) a relational server, responsive to the database query, outputting relational data;
(ii) a non-relational server, responsive to the database query, outputting non-relational data; and,
(iii) means for parsing the database query into a relational database query and a non-relational database query, wherein the means for parsing is responsive to an SQL CONTAINS function statement.
3. A database management system, having an input device receiving a database query and an output device providing data, comprising:
(a) a memory containing relational data and non-relational data; and
(b) a processing system, coupled to the memory, including
(i) a relational server, responsive to the database query, outputting relational data;
(ii) a non-relational server, responsive to the database query, outputting non-relational data;
(iii) means for parsing the database query into a relational database query and a non-relational database query;
(iv) a first queue, coupled to the non-relational server, for storing the non-relational database query;
(v) a second queue, coupled to the non-relational database server, for storing a non-relational database modification request; and
(vi) a table, coupled to the non-relational server and the relational server, for storing a relational data pointer provided by the non-relational server.
4. A database management system, having an input device receiving a database query and an output device providing data, comprising:
(a) a memory containing relational data and non-relational data; and
(b) a processing system, coupled to the memory, including
(i) a relational server, responsive to the database query, outputting relational data;
(ii) a non-relational server, responsive to the database query, outputting non-relational data;
(iii) means for parsing the database query into a non-relational database query and a non-relational database modification request;
(iv) a first text queue, coupled to the non-relational server, for storing the non-relational database query, wherein the first text queue is an Oracle 7 Server Pipe;
(v) a second queue, coupled to the non-relational database server, for storing a non-relational database modification request; and,
(vi) a table, coupled to the non-relational server and the relational server, for storing a relational data pointer provided by the non-relational server.
5. An apparatus for providing data, comprising;
(a) a memory containing relational data and non-relational data;
(b) means for receiving a query, wherein the query is a Structured Query Language ("SQL") 92 statement;
(c) means, coupled to the means for receiving, for parsing the query into a relational portion and a non-relational portion;
(d) means, coupled to the parsing means and memory, for providing relational data from the memory responsive to the query relational portion; and,
(e) means, coupled to the parsing means and memory, for providing non-relational data from the memory responsive to the query non-relational portion.
6. An apparatus for providing data, comprising:
(a) a memory containing relational data and non-relational data;
(b) means for receiving a query, wherein the query is a Structured Query Language ("SQL") CONTAIN function statement;
(c) means, coupled to the means for receiving, for parsing the query into a relational portion and a non-relational portion;
(d) means, coupled to the parsing means and memory, for providing relational data from the memory responsive to the query relational portion; and,
(e) means, coupled to the parsing means and memory, for providing non-relational data from the memory responsive to the query non-relational portion.
7. An apparatus for providing data, comprising:
(a) a memory containing relational data and non-relational data;
(b) means for receiving a query, wherein the query is a Structured Query Language ("SQL") CONTAIN procedure statement;
(c) means, coupled to the means for receiving, for parsing the query into a relational portion and a non-relational portion;
(d) means, coupled to the parsing means and memory, for providing relational data from the memory responsive to the query relational portion; and,
(e) means, coupled to the parsing means and memory, for providing non-relational data from the memory responsive to the query non-relational portion.
8. A method for providing data from a database containing relational data and non-relational data, comprising the steps of:
(a) providing a Structured Query Language ("SQL") statement, wherein the SQL statement is an SQL 92 statement;
(b) parsing the SQL statement into a relational portion and a non-relational portion;
(c) processing the non-relational portion to obtain pointers to the non-relational data in the database;
(d) storing the non-relational pointers; and,
(e) processing the relational portion and pointers to the non-relational data to obtain the data.
9. A method for providing data from a database containing relational data and non-relational data, comprising the steps of:
(a) providing Structured Query Language ("SQL") statement, wherein the SQL statement is a CONTAIN function;
(b) parsing the SQL statement into a relational portion and a non-relational portion;
(c) processing the non-relational portion to obtain pointers to the non-relational data in the database;
(d) storing the non-relational pointers; and,
(e) processing the relational portion and pointers to the non-relational data to obtain the data.
10. A method for providing data from a database containing relational data and non-relational data, comprising the steps of:
(a) providing Structured Query Language ("SQL") statement, wherein the SQL statement is a CONTAIN procedure;
(b) parsing the SQL statement into a relational portion and a non-relational portion;
(c) processing the non-relational portion to obtain pointers to the non-relational data in the database;
(d) storing the non-relational pointers; and,
(e) processing the relational portion and pointers to the non-relational data to obtain the data.
11. A method for providing data from a database containing relational data and non-relational data, comprising the steps of:
(a) providing a Structured Query Language ("SQL") statement;
(b) parsing the SQL statement into a relational portion and a non-relational portion;
(c) processing the non-relational portion to obtain pointers to the non-relational data in the database, comprising the steps of:
(i) queuing the non-relational portion on a queue;
(ii) popping the non-relational portion from the queue; and,
(iii) processing the non-relational portion by a non-relational server;
(d) storing the non-relational pointers; and
(e) processing the relational portion and pointers to the non-relational data to obtain the data.
12. The method of claim 11, wherein the non-relational server comprises a text server including a text engine, a filter and a lexer.
13. An article of manufacture, including a computer readable medium having computer readable program code means embodied therein for obtaining data in a database containing relational and non-relational data, the computer readable program code means in the article of manufacture comprising:
computer readable program code means for causing a computer to read a query statement;
computer readable program code means for causing a computer to parse the query into a relational portion and a non-relational portion;
computer readable program code means for causing a computer to obtain relational data from the database responsive to the relational portion;
computer readable program code means for causing a computer to obtain a pointer to the non-relational data in the database responsive to the non-relational portion; and
computer readable program code means for causing a computer to display the relational data and non-relational data.
14. An article of manufacture, including a computer readable medium having computer readable program code means embodied therein for obtaining data in a database containing relational and non-relational data, the computer readable program code means in the article of manufacture comprising:
computer readable program code means for causing a computer to read a query statement having a relational portion and a non-relational portion, wherein the query statement is a Structured Query Language ("SQL") 92 statement;
computer readable program code means for causing a computer to parse the query into a relational portion and a non-relational portion;
computer readable program code means for causing a computer to obtain relational data from the database responsive to the relational portion;
computer readable program code means for causing a computer to obtain a pointer to the non-relational data in the database responsive to the non-relational portion; and,
computer readable program code means for causing a computer to display the relational data and non-relational data.
15. An article of manufacture, including a computer readable medium having computer readable program code means embodied therein for obtaining data in a database containing relational and non-relational data, the computer readable program code means in the article of manufacture comprising:
computer readable program code means for causing a computer to read a query statement having a relational portion and a non-relational portion, wherein the query statement is a Structured Query Language ("SQL") CONTAIN function statement;
computer readable program code means for causing a computer to parse the query into a relational portion and a non-relational portion;
computer readable program code means for causing a computer to obtain relational data from the database responsive to the relational portion;
computer readable program code means for causing a computer to obtain a pointer to the non-relational data in the database responsive to the non-relational portion; and,
computer readable program code means for causing a computer to display the relational data and non-relational data.
16. An article of manufacture, including a computer readable medium having computer readable program code means embodied therein for obtaining data in a database containing relational and non-relational data, the computer readable program code means in the article of manufacture comprising:
computer readable program code means for causing a computer to read a query statement having a relational portion and a non-relational portion, wherein the query statement is a Structured Query Language ("SQL") CONTAIN procedure statement;
computer readable program code means for causing a computer to parse the query into a relational portion and a non-relational portion;
computer readable program code means for causing a computer to obtain relational data from the database responsive to the relational portion;
computer readable program code means for causing a computer to obtain a pointer to the non-relational data in the database responsive to the non-relational portion; and,
computer readable program code means for causing a computer to display the relational data and non-relational data.
US08595905 1996-02-06 1996-02-06 System and apparatus for storage retrieval and analysis of relational and non-relational data Expired - Lifetime US5819251A (en)
Priority Applications (1)
Application Number Priority Date Filing Date Title
US08595905 US5819251A (en) 1996-02-06 1996-02-06 System and apparatus for storage retrieval and analysis of relational and non-relational data
Applications Claiming Priority (1)
Application Number Priority Date Filing Date Title
US08595905 US5819251A (en) 1996-02-06 1996-02-06 System and apparatus for storage retrieval and analysis of relational and non-relational data
Publications (1)
Publication Number Publication Date
US5819251A true US5819251A (en) 1998-10-06
Family
ID=24385201
Family Applications (1)
Application Number Title Priority Date Filing Date
US08595905 Expired - Lifetime US5819251A (en) 1996-02-06 1996-02-06 System and apparatus for storage retrieval and analysis of relational and non-relational data
Country Status (1)
Country Link
US (1) US5819251A (en)
Cited By (99)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999014651A2 (en) * 1997-09-17 1999-03-25 Tenfold Corporation Method and system for database application software creation requiring minimal programming
US5930800A (en) * 1996-08-28 1999-07-27 Hitachi, Ltd. Execution of user defined ADT function implemented by embedded module in a database management method
US5937409A (en) * 1997-07-25 1999-08-10 Oracle Corporation Integrating relational databases in an object oriented environment
US5995980A (en) * 1996-07-23 1999-11-30 Olson; Jack E. System and method for database update replication
US6055511A (en) * 1998-11-30 2000-04-25 Breault Research Organization, Inc. Computerized incentive compensation
US6069627A (en) * 1995-11-01 2000-05-30 International Business Machines Corporation Extender user interface
US6169990B1 (en) * 1996-03-02 2001-01-02 University Of Strathclyde Databases
US6253228B1 (en) * 1997-03-31 2001-06-26 Apple Computer, Inc. Method and apparatus for updating and synchronizing information between a client and a server
US20010018684A1 (en) * 2000-02-25 2001-08-30 International Business Machines Corporation System and method for accessing non-relational data by relational access methods
US20010021932A1 (en) * 1999-12-23 2001-09-13 Wilhelm Mild Access to server resources from heterogeneous platforms
US6292794B1 (en) * 1998-10-22 2001-09-18 Libera, Inc. Method of integrating text retrieval to enhance software stem searching
US20010025138A1 (en) * 1999-06-03 2001-09-27 Bardy Gust H. System and method for processing normalized voice feedback for use in automated patient care
US6308167B1 (en) * 1998-04-09 2001-10-23 Compaq Computer Corporation Computer system using a queuing system and method for managing a queue and heterogeneous data structures
US20010051764A1 (en) * 1999-06-03 2001-12-13 Bardy Gust H. System and method for analyzing patient information for use in automated patient care
US6360228B1 (en) * 1999-06-02 2002-03-19 Oracle Corporation Transactional framework for executing statements involving non-native code
US20020052542A1 (en) * 1999-06-03 2002-05-02 Bardy Gust H. System and method for providing collection and analysis of patient information for use in automated patient care
EP1207462A2 (en) * 2000-11-16 2002-05-22 Protegrity Research & Development A method for altering encryption status in a relation database in a continuous process
US20020065957A1 (en) * 1996-04-30 2002-05-30 International Business Machines Corporation Object oriented information retrieval framework mechanism
US6401084B1 (en) * 1998-07-15 2002-06-04 Amazon.Com Holdings, Inc System and method for correcting spelling errors in search queries using both matching and non-matching search terms
US6424974B1 (en) * 1997-03-31 2002-07-23 International Business Machines Corporation Storing P-code in a database
US20020120616A1 (en) * 2000-12-30 2002-08-29 Bo-Hyun Yun System and method for retrieving a XML (eXtensible Markup Language) document
US6480848B1 (en) * 1999-07-19 2002-11-12 International Business Machines Corporation Extension of data definition language (DDL) capabilities for relational databases for applications issuing DML and DDL statements
US20020169830A1 (en) * 2001-05-08 2002-11-14 Wilhelm Mild System and method for redirection of host data access to multiple non-host file systems or data stores
US20020169367A1 (en) * 1999-11-16 2002-11-14 Bardy Gust H. System and method for providing diagnosis and monitoring of respiratory insufficiency for use in automated patient care
US20020178173A1 (en) * 2001-05-25 2002-11-28 International Business Machines Corporation Method and apparatus for performing the identification of files to be backed up using relational meta data
US20020178436A1 (en) * 2001-05-25 2002-11-28 International Business Machines Corporation Method and apparatus for the automatic discovery of the relationships between applications and their associated data and configuration files
US20020178233A1 (en) * 2001-05-25 2002-11-28 International Business Machines Corporation Method and apparatus for the automatic migration of applications and their associated data and configuration files
US20020194176A1 (en) * 1999-07-20 2002-12-19 Gruenwald Bjorn J. System and method for organizing data
US20030037039A1 (en) * 2001-08-16 2003-02-20 International Business Machines Corporation Schema for SQL statements
US6584508B1 (en) * 1999-07-13 2003-06-24 Networks Associates Technology, Inc. Advanced data guard having independently wrapped components
US20030135524A1 (en) * 2001-09-06 2003-07-17 Cane David A. Data backup
US20030187839A1 (en) * 2002-03-28 2003-10-02 International Business Machines Corporation Method and structure for federated web service discovery search over multiple registries with result aggregation
US6697799B1 (en) * 1999-09-10 2004-02-24 Requisite Technology, Inc. Automated classification of items using cascade searches
US20040039745A1 (en) * 2002-08-23 2004-02-26 Evans Stephen C. Apparatus and method for associating classes
US6714935B1 (en) * 1998-09-21 2004-03-30 Microsoft Corporation Management of non-persistent data in a persistent database
US6735582B2 (en) * 2000-12-15 2004-05-11 International Business Machines Corporation Pre-load cursor in a database method and system
US20040147981A1 (en) * 1999-06-03 2004-07-29 Bardy Gust H System and method for collection and analysis of patient information for automated remote patient care
US20040158561A1 (en) * 2003-02-04 2004-08-12 Gruenwald Bjorn J. System and method for translating languages using an intermediate content space
US20040172385A1 (en) * 2003-02-27 2004-09-02 Vikram Dayal Database query and content transmission governor
US20040205287A1 (en) * 2001-01-18 2004-10-14 Joder Steven D. Method, apparatus, and system for quality performance evaluation of a supplier base
US20040223648A1 (en) * 2003-05-05 2004-11-11 Keith Hoene Determining differences between documents
US20040236237A1 (en) * 1999-11-16 2004-11-25 Bardy Gust H. System and method for analyzing a patient status for myocardial ischemia for use in automated patient care
US20050096510A1 (en) * 1999-11-16 2005-05-05 Bardy Gust H. System and method for ordering and prioritizing multiple health disorders
US20050097569A1 (en) * 2003-10-29 2005-05-05 Oracle International Corporation Event notification in a clustered computing environments
US6898586B1 (en) 1998-10-23 2005-05-24 Access Innovations, Inc. System and method for database design and maintenance
US6907424B1 (en) * 1999-09-10 2005-06-14 Requisite Technology, Inc. Sequential subset catalog search engine
US20050165799A1 (en) * 2004-01-23 2005-07-28 Oracle International Corporation Multi-table access control
US20050171411A1 (en) * 1999-06-03 2005-08-04 Kenknight Bruce System and method for transacting an automated patient communications session
US6931389B1 (en) 1997-10-14 2005-08-16 International Business Machines Corporation System and method for filtering query statements from multiple plans and packages according to user-defined filters of query explain data
US20050182308A1 (en) * 1999-07-26 2005-08-18 Bardy Gust H. System and method for determining a reference baseline record
US20050193031A1 (en) * 1999-12-16 2005-09-01 Livevault Corporation Systems and methods for backing up data files
US20050192962A1 (en) * 2004-02-26 2005-09-01 Patricia Furrer Apparatus, system, method for enabling web-applications to access enterprise managed data
US6978261B2 (en) * 1999-07-29 2005-12-20 International Business Machines Corporation Using database management system's infrastructure to invoke a stored procedure for creating and preparing a database application
US6985904B1 (en) 2002-02-28 2006-01-10 Oracle International Corporation Systems and methods for sharing of execution plans for similar database statements
US6996581B2 (en) * 2001-09-28 2006-02-07 International Business Machines Corporation Template management of database instances
US20060080300A1 (en) * 2001-04-12 2006-04-13 Primentia, Inc. System and method for organizing data
US7043492B1 (en) 2001-07-05 2006-05-09 Requisite Technology, Inc. Automated classification of items using classification mappings
US7092931B1 (en) 2002-05-10 2006-08-15 Oracle Corporation Methods and systems for database statement execution plan optimization
US20060265351A1 (en) * 2005-05-19 2006-11-23 International Business Machines Corporation Tracking premature termination of a database query
US7147600B2 (en) 1999-07-26 2006-12-12 Cardiac Intelligence Corporation System and method for determining a reference baseline of patient information
US20070038662A1 (en) * 2005-08-04 2007-02-15 Peter Bendel Method and system for managing external routines in a database management system
US20070239669A1 (en) * 2006-04-06 2007-10-11 Carlos Ordonez Translator of statistical language programs into sql
US7292139B2 (en) 2002-12-17 2007-11-06 Cardiac Pacemakers, Inc. Repeater device for communications with an implantable medical device
US7302291B2 (en) 1999-11-16 2007-11-27 Cardiac Intelligence Corporation System and method for analyzing a patient status for atrial fibrillation for use in automated patient care
US7329226B1 (en) 2004-07-06 2008-02-12 Cardiac Pacemakers, Inc. System and method for assessing pulmonary performance through transthoracic impedance monitoring
US20080086498A1 (en) * 2006-10-05 2008-04-10 Prateek Sureka Novel Database
US7406469B1 (en) * 2002-06-20 2008-07-29 Oracle International Corporation Linear instance mapping for query rewrite
US20080243715A1 (en) * 2007-04-02 2008-10-02 Bank Of America Corporation Financial Account Information Management and Auditing
US20080263019A1 (en) * 2001-09-24 2008-10-23 Iac Search & Media, Inc. Natural language query processing
US7488290B1 (en) 2004-02-19 2009-02-10 Cardiac Pacemakers, Inc. System and method for assessing cardiac performance through transcardiac impedance monitoring
US20090158298A1 (en) * 2007-12-12 2009-06-18 Abhishek Saxena Database system and eventing infrastructure
US20090193006A1 (en) * 2008-01-07 2009-07-30 Ori Herrnstadt Multiple dimenisioned database architecture
US20090222404A1 (en) * 2008-02-28 2009-09-03 Microsoft Corporation Querying nonsql data stores with a sql-style language
US7590620B1 (en) * 2004-06-18 2009-09-15 Google Inc. System and method for analyzing data records
US20100161702A1 (en) * 2008-12-24 2010-06-24 Dmitry Ragozin Fluid Dynamics Simulator
US20100287185A1 (en) * 2009-05-11 2010-11-11 Jean-Yves Cras Generation of logical database schema representation based on symbolic business intelligence query
US20100287214A1 (en) * 2009-05-08 2010-11-11 Microsoft Corporation Static Analysis Framework for Database Applications
US7874993B2 (en) 1999-11-16 2011-01-25 Cardiac Pacemakers, Inc. System and method for diagnosing and monitoring congestive heart failure
US20110196843A1 (en) * 2008-09-15 2011-08-11 Dustin Kurt Adler Instance Management of Code in a Database
US8025624B2 (en) 2004-02-19 2011-09-27 Cardiac Pacemakers, Inc. System and method for assessing cardiac performance through cardiac vibration monitoring
US20110258178A1 (en) * 2010-04-19 2011-10-20 Salesforce.Com Methods and systems for performing cross store joins in a multi-tenant store
US20120330954A1 (en) * 2011-06-27 2012-12-27 Swaminathan Sivasubramanian System And Method For Implementing A Scalable Data Storage Service
US8346714B1 (en) * 2009-12-17 2013-01-01 Teradota Us, Inc. Transactiontime and validtime timestamping in an enterprise active data warehouse
US20130007773A1 (en) * 2011-06-28 2013-01-03 Steven Scott Guilford Systems, methods, apparatuses, and computer program products for facilitating integration of third party technology with a database
US8369937B2 (en) 1999-11-16 2013-02-05 Cardiac Pacemakers, Inc. System and method for prioritizing medical conditions
US20130238595A1 (en) * 2010-04-19 2013-09-12 Salesforce.Com, Inc. Methods and systems for optimizing queries in a multi-tenant store
US8781847B2 (en) 2005-05-03 2014-07-15 Cardiac Pacemakers, Inc. System and method for managing alert notifications in an automated patient management system
US8799318B2 (en) * 2012-07-27 2014-08-05 Sap Ag Function module leveraging fuzzy search capability
US8941658B2 (en) 2011-06-15 2015-01-27 Ca, Inc. Method and apparatus for layered overview in visualization of large enterprise it environment
EP2715519A4 (en) * 2010-04-19 2015-08-05 Salesforce Com Inc Methods and systems for performing cross store joins in a multi-tenant store
US9111012B2 (en) 2012-11-26 2015-08-18 Accenture Global Services Limited Data consistency management
US9189515B1 (en) * 2013-03-08 2015-11-17 Amazon Technologies, Inc. Data retrieval from heterogeneous storage systems
US9244999B2 (en) 2012-02-27 2016-01-26 International Business Machines Corporation Database query using a user-defined function
US9244971B1 (en) 2013-03-07 2016-01-26 Amazon Technologies, Inc. Data retrieval from heterogeneous storage systems
US20160092594A1 (en) * 2014-09-30 2016-03-31 International Business Machines Corporation Virtualizing schema relations over a single database relation
WO2016085774A1 (en) * 2014-11-28 2016-06-02 Microsoft Technology Licensing, Llc Efficient data manipulation support
US9471654B1 (en) * 2013-11-07 2016-10-18 Progress Software Corporation Modeling of a non-relational database as a normalized relational database
US20170149974A1 (en) * 2007-04-17 2017-05-25 Newvoicemedia, Ltd. Method and apparatus for using a search engine advantageously within a contact center system
US20170177640A1 (en) * 2015-12-22 2017-06-22 Sap Se Global and local temporary database tables
Citations (16)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4774661A (en) * 1985-11-19 1988-09-27 American Telephone And Telegraph Company, At&T Information Systems Database management system with active data dictionary
US5157783A (en) * 1988-02-26 1992-10-20 Wang Laboratories, Inc. Data base system which maintains project query list, desktop list and status of multiple ongoing research projects
US5182708A (en) * 1990-12-11 1993-01-26 Ricoh Corporation Method and apparatus for classifying text
US5261102A (en) * 1991-03-28 1993-11-09 International Business Machines Corporation System for determining direct and indirect user access privileges to data base objects
US5295256A (en) * 1990-12-14 1994-03-15 Racal-Datacom, Inc. Automatic storage of persistent objects in a relational schema
US5379419A (en) * 1990-12-07 1995-01-03 Digital Equipment Corporation Methods and apparatus for accesssing non-relational data files using relational queries
US5412808A (en) * 1991-07-24 1995-05-02 At&T Corp. System for parsing extended file names in an operating system
US5412804A (en) * 1992-04-30 1995-05-02 Oracle Corporation Extending the semantics of the outer join operator for un-nesting queries to a data base
US5426780A (en) * 1992-02-28 1995-06-20 Intergraph Corporation System for dynamic segmentation analysis using conversion of relational data into object-oriented data
US5428776A (en) * 1991-03-12 1995-06-27 Wang Laboratories, Inc. System for composing a graphical interface to a relational database which displays a network of query and source icons
US5437027A (en) * 1990-05-30 1995-07-25 Texas Instruments Incorporated System and method for database management supporting object-oriented programming
US5499359A (en) * 1994-01-18 1996-03-12 Borland International, Inc. Methods for improved referential integrity in a relational database management system
US5499371A (en) * 1993-07-21 1996-03-12 Persistence Software, Inc. Method and apparatus for automatic generation of object oriented code for mapping relational data to objects
US5504885A (en) * 1993-06-29 1996-04-02 Texas Instruments Incorporated O-R gateway: a system for connecting object-oriented application programs and relational databases
US5596746A (en) * 1991-10-21 1997-01-21 General Electric Company Method for transforming relational data base schemas into object models using ideal table meta models
US5615362A (en) * 1993-08-02 1997-03-25 Persistence Software, Inc. Method and apparatus for managing relational data in an object cache
Patent Citations (16)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4774661A (en) * 1985-11-19 1988-09-27 American Telephone And Telegraph Company, At&T Information Systems Database management system with active data dictionary
US5157783A (en) * 1988-02-26 1992-10-20 Wang Laboratories, Inc. Data base system which maintains project query list, desktop list and status of multiple ongoing research projects
US5437027A (en) * 1990-05-30 1995-07-25 Texas Instruments Incorporated System and method for database management supporting object-oriented programming
US5379419A (en) * 1990-12-07 1995-01-03 Digital Equipment Corporation Methods and apparatus for accesssing non-relational data files using relational queries
US5182708A (en) * 1990-12-11 1993-01-26 Ricoh Corporation Method and apparatus for classifying text
US5295256A (en) * 1990-12-14 1994-03-15 Racal-Datacom, Inc. Automatic storage of persistent objects in a relational schema
US5428776A (en) * 1991-03-12 1995-06-27 Wang Laboratories, Inc. System for composing a graphical interface to a relational database which displays a network of query and source icons
US5261102A (en) * 1991-03-28 1993-11-09 International Business Machines Corporation System for determining direct and indirect user access privileges to data base objects
US5412808A (en) * 1991-07-24 1995-05-02 At&T Corp. System for parsing extended file names in an operating system
US5596746A (en) * 1991-10-21 1997-01-21 General Electric Company Method for transforming relational data base schemas into object models using ideal table meta models
US5426780A (en) * 1992-02-28 1995-06-20 Intergraph Corporation System for dynamic segmentation analysis using conversion of relational data into object-oriented data
US5412804A (en) * 1992-04-30 1995-05-02 Oracle Corporation Extending the semantics of the outer join operator for un-nesting queries to a data base
US5504885A (en) * 1993-06-29 1996-04-02 Texas Instruments Incorporated O-R gateway: a system for connecting object-oriented application programs and relational databases
US5499371A (en) * 1993-07-21 1996-03-12 Persistence Software, Inc. Method and apparatus for automatic generation of object oriented code for mapping relational data to objects
US5615362A (en) * 1993-08-02 1997-03-25 Persistence Software, Inc. Method and apparatus for managing relational data in an object cache
US5499359A (en) * 1994-01-18 1996-03-12 Borland International, Inc. Methods for improved referential integrity in a relational database management system
Non-Patent Citations (2)
* Cited by examiner, † Cited by third party
Title
"A New Direction in DBMS" by Dr. Michael R. Stonebraker, DBMS (Feb. 1994), p. 50.
A New Direction in DBMS by Dr. Michael R. Stonebraker, DBMS (Feb. 1994), p. 50. *
Cited By (212)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6069627A (en) * 1995-11-01 2000-05-30 International Business Machines Corporation Extender user interface
US6169990B1 (en) * 1996-03-02 2001-01-02 University Of Strathclyde Databases
US7089532B2 (en) * 1996-04-30 2006-08-08 International Business Machines Corporation Object oriented information retrieval framework mechanism
US20020065957A1 (en) * 1996-04-30 2002-05-30 International Business Machines Corporation Object oriented information retrieval framework mechanism
US5995980A (en) * 1996-07-23 1999-11-30 Olson; Jack E. System and method for database update replication
US5930800A (en) * 1996-08-28 1999-07-27 Hitachi, Ltd. Execution of user defined ADT function implemented by embedded module in a database management method
US20040024741A1 (en) * 1996-08-28 2004-02-05 Hitachi, Ltd. Database processing method
US6424974B1 (en) * 1997-03-31 2002-07-23 International Business Machines Corporation Storing P-code in a database
US6253228B1 (en) * 1997-03-31 2001-06-26 Apple Computer, Inc. Method and apparatus for updating and synchronizing information between a client and a server
US5937409A (en) * 1997-07-25 1999-08-10 Oracle Corporation Integrating relational databases in an object oriented environment
US6016394A (en) * 1997-09-17 2000-01-18 Tenfold Corporation Method and system for database application software creation requiring minimal programming
WO1999014651A3 (en) * 1997-09-17 1999-05-06 Tenfold Corp Method and system for database application software creation requiring minimal programming
WO1999014651A2 (en) * 1997-09-17 1999-03-25 Tenfold Corporation Method and system for database application software creation requiring minimal programming
US6931389B1 (en) 1997-10-14 2005-08-16 International Business Machines Corporation System and method for filtering query statements from multiple plans and packages according to user-defined filters of query explain data
US6308167B1 (en) * 1998-04-09 2001-10-23 Compaq Computer Corporation Computer system using a queuing system and method for managing a queue and heterogeneous data structures
US20040049516A1 (en) * 1998-04-09 2004-03-11 Brinkmeyer Jay C. Computer system using a queuing system and method for managing a queue and heterogeneous data structures
US6725226B2 (en) 1998-04-09 2004-04-20 Hewlett-Packard Development Company, L.P. Computer system using a queuing system and method for managing a queue and heterogeneous data structures
US6853993B2 (en) * 1998-07-15 2005-02-08 A9.Com, Inc. System and methods for predicting correct spellings of terms in multiple-term search queries
US7444324B2 (en) 1998-07-15 2008-10-28 A9.Com, Inc. Search query processing to identify search string corrections that reflect past search query submissions of users
US20050071332A1 (en) * 1998-07-15 2005-03-31 Ortega Ruben Ernesto Search query processing to identify related search terms and to correct misspellings of search terms
US7840577B2 (en) 1998-07-15 2010-11-23 A9.Com, Inc. Search query processing to identify related search terms and to correct misspellings of search terms
US6401084B1 (en) * 1998-07-15 2002-06-04 Amazon.Com Holdings, Inc System and method for correcting spelling errors in search queries using both matching and non-matching search terms
US20110035370A1 (en) * 1998-07-15 2011-02-10 Ortega Ruben E Identifying related search terms based on search behaviors of users
US20020152204A1 (en) * 1998-07-15 2002-10-17 Ortega Ruben Ernesto System and methods for predicting correct spellings of terms in multiple-term search queries
US7996398B2 (en) * 1998-07-15 2011-08-09 A9.Com, Inc. Identifying related search terms based on search behaviors of users
US6714935B1 (en) * 1998-09-21 2004-03-30 Microsoft Corporation Management of non-persistent data in a persistent database
US6292794B1 (en) * 1998-10-22 2001-09-18 Libera, Inc. Method of integrating text retrieval to enhance software stem searching
US6898586B1 (en) 1998-10-23 2005-05-24 Access Innovations, Inc. System and method for database design and maintenance
US6055511A (en) * 1998-11-30 2000-04-25 Breault Research Organization, Inc. Computerized incentive compensation
US6360228B1 (en) * 1999-06-02 2002-03-19 Oracle Corporation Transactional framework for executing statements involving non-native code
US7144369B2 (en) 1999-06-03 2006-12-05 Cardiac Intelligence Corporation System and method for providing collection and analysis of patient information for use in automated patient care
US6974413B2 (en) 1999-06-03 2005-12-13 Cardiac Intelligence Corporation System and method for analyzing patient information for use in automated patient care
US20050171411A1 (en) * 1999-06-03 2005-08-04 Kenknight Bruce System and method for transacting an automated patient communications session
US9149237B2 (en) 1999-06-03 2015-10-06 Cardiac Pacemakers, Inc. System and method for evaluating a patient status for use in heart failure assessment
US20040147979A1 (en) * 1999-06-03 2004-07-29 Bardy Gust H. System and method for collection and analysis of regularly retrieved patient information for automated remote patient care
US20070100667A1 (en) * 1999-06-03 2007-05-03 Bardy Gust H System and method for analyzing data during automated patient management
US7104955B2 (en) 1999-06-03 2006-09-12 Cardiac Intelligence Corporation System and method for collection and analysis of regularly retrieved patient information for automated remote patient care
US20070293772A1 (en) * 1999-06-03 2007-12-20 Bardy Gust H System and method for processing voice feedback in conjunction with heart failure assessment
US9186061B2 (en) 1999-06-03 2015-11-17 Cardiac Pacemakers, Inc. System and method for evaluating a patient status for use in heart failure assessment
US20020052542A1 (en) * 1999-06-03 2002-05-02 Bardy Gust H. System and method for providing collection and analysis of patient information for use in automated patient care
US6997873B2 (en) 1999-06-03 2006-02-14 Cardiac Intelligence Corporation System and method for processing normalized voice feedback for use in automated patient care
US20050228243A1 (en) * 1999-06-03 2005-10-13 Bardy Gust H System and method for providing feedback to an individual patient
US20010051764A1 (en) * 1999-06-03 2001-12-13 Bardy Gust H. System and method for analyzing patient information for use in automated patient care
US20010025138A1 (en) * 1999-06-03 2001-09-27 Bardy Gust H. System and method for processing normalized voice feedback for use in automated patient care
US20040147981A1 (en) * 1999-06-03 2004-07-29 Bardy Gust H System and method for collection and analysis of patient information for automated remote patient care
US7134996B2 (en) 1999-06-03 2006-11-14 Cardiac Intelligence Corporation System and method for collection and analysis of patient information for automated remote patient care
US9526456B2 (en) 1999-06-03 2016-12-27 Cardiac Pacemakers, Inc. System and method for evaluating a patient status for use in heart failure assessment
US8277378B2 (en) 1999-06-03 2012-10-02 Cardiac Pacemakers, Inc System and method for collection and analysis of patient information for automated remote patient care
US8556810B2 (en) 1999-06-03 2013-10-15 Cardiac Pacemakers, Inc. System and method for evaluating a patient status for use in heart failure assessment
US7429243B2 (en) 1999-06-03 2008-09-30 Cardiac Intelligence Corporation System and method for transacting an automated patient communications session
US6584508B1 (en) * 1999-07-13 2003-06-24 Networks Associates Technology, Inc. Advanced data guard having independently wrapped components
US6480848B1 (en) * 1999-07-19 2002-11-12 International Business Machines Corporation Extension of data definition language (DDL) capabilities for relational databases for applications issuing DML and DDL statements
US20020194176A1 (en) * 1999-07-20 2002-12-19 Gruenwald Bjorn J. System and method for organizing data
US20030037051A1 (en) * 1999-07-20 2003-02-20 Gruenwald Bjorn J. System and method for organizing data
US7698283B2 (en) * 1999-07-20 2010-04-13 Primentia, Inc. System and method for organizing data
US20110010398A1 (en) * 1999-07-20 2011-01-13 Gruenwald Bjorn J System and Method for Organizing Data
US20050182308A1 (en) * 1999-07-26 2005-08-18 Bardy Gust H. System and method for determining a reference baseline record
US8308650B2 (en) 1999-07-26 2012-11-13 Cardiac Pacemakers, Inc. System and method for generating baseline data for automated management of cardiovascular pressure
US8702603B2 (en) 1999-07-26 2014-04-22 Cardiac Pacemakers, Inc. System and apparatus for providing baseline data for automated patient management
US7147600B2 (en) 1999-07-26 2006-12-12 Cardiac Intelligence Corporation System and method for determining a reference baseline of patient information
US7248916B2 (en) 1999-07-26 2007-07-24 Cardiac Intelligence Corporation Automated system and method for establishing a patient status reference baseline
US9610012B2 (en) 1999-07-26 2017-04-04 Cardiac Pacemakers, Inc. System and apparatus for providing baseline data for automated patient management
US7837629B2 (en) 1999-07-26 2010-11-23 Cardiac Pacemakers, Inc. System and method for generating baseline data for automated management of edema
US8888698B2 (en) 1999-07-26 2014-11-18 Cardiac Pacemakers, Inc. System and method for determining a reference baseline for use in heart failure assessment
US6978261B2 (en) * 1999-07-29 2005-12-20 International Business Machines Corporation Using database management system's infrastructure to invoke a stored procedure for creating and preparing a database application
US6697799B1 (en) * 1999-09-10 2004-02-24 Requisite Technology, Inc. Automated classification of items using cascade searches
US6907424B1 (en) * 1999-09-10 2005-06-14 Requisite Technology, Inc. Sequential subset catalog search engine
US7302291B2 (en) 1999-11-16 2007-11-27 Cardiac Intelligence Corporation System and method for analyzing a patient status for atrial fibrillation for use in automated patient care
US7874993B2 (en) 1999-11-16 2011-01-25 Cardiac Pacemakers, Inc. System and method for diagnosing and monitoring congestive heart failure
US20050096510A1 (en) * 1999-11-16 2005-05-05 Bardy Gust H. System and method for ordering and prioritizing multiple health disorders
US9232900B2 (en) 1999-11-16 2016-01-12 Cardiac Pacemakers, Inc. System and method for analyzing a patient status for congestive heart failure for use in automated patient care
US20020169367A1 (en) * 1999-11-16 2002-11-14 Bardy Gust H. System and method for providing diagnosis and monitoring of respiratory insufficiency for use in automated patient care
US20040236237A1 (en) * 1999-11-16 2004-11-25 Bardy Gust H. System and method for analyzing a patient status for myocardial ischemia for use in automated patient care
US8874200B2 (en) 1999-11-16 2014-10-28 Cardiac Pacemakers, Inc. System and method for automated diagnosis of atrial fibrillation through remote monitoring
US7959574B2 (en) 1999-11-16 2011-06-14 Cardiac Pacemakers, Inc. System and method for analyzing a patient status for respiratory insufficiency for use in automated patient care
US7972274B2 (en) 1999-11-16 2011-07-05 Cardiac Pacemakers, Inc. System and method for analyzing a patient status for congestive heart failure for use in automated patient care
US20040039263A1 (en) * 1999-11-16 2004-02-26 Bardy Gust H. System and method for diagnosing and monitoring respiratory insufficiency for automated remote patient care
US8747329B2 (en) 1999-11-16 2014-06-10 Cardiac Pacemakers, Inc. System and method for managing respiratory insufficiency through remote patient care
US8092382B2 (en) 1999-11-16 2012-01-10 Cardiac Pacemakers, Inc. System and method for prioritizing medical conditions
US8731648B2 (en) 1999-11-16 2014-05-20 Cardiac Pacemakers, Inc. System and method for prioritizing medical conditions
US7117028B2 (en) 1999-11-16 2006-10-03 Cardiac Intelligence Corporation System and method for ordering and prioritizing multiple health disorders
US8672856B2 (en) 1999-11-16 2014-03-18 Cardiac Pacemakers Inc. System and method for automated diagnosis of myocardial ischemia through remote monitoring
US7299087B2 (en) 1999-11-16 2007-11-20 Cardiac Intelligence Corporation System and method for analyzing a patient status for myocardial ischemia for use in automated patient care
US8231539B2 (en) 1999-11-16 2012-07-31 Cardiac Pacemakers, Inc. Automated patient care system and method for diagnosing and monitoring respiratory insufficiency
US8231540B2 (en) 1999-11-16 2012-07-31 Cardiac Pacemakers, Inc. System and method for managing respiratory insufficiency in conjunction with heart failure assessment
US8366629B2 (en) 1999-11-16 2013-02-05 Cardiac Pacemakers, Inc. System and method for diagnosing and monitoring congestive heart failure
US20070203415A1 (en) * 1999-11-16 2007-08-30 Bardy Gust H System and method for determining edema through remote patient monitoring
US7207945B2 (en) 1999-11-16 2007-04-24 Cardiac Intelligence Corporation System and method for providing diagnosis and monitoring of respiratory insufficiency for use in automated patient care
US7258670B2 (en) 1999-11-16 2007-08-21 Cardiac Intelligence Corporation System and method for diagnosing and monitoring respiratory insufficiency for automated remote patient care
US8942794B2 (en) 1999-11-16 2015-01-27 Cardiac Pacemakers, Inc. System and method for prioritizing medical conditions
US8369937B2 (en) 1999-11-16 2013-02-05 Cardiac Pacemakers, Inc. System and method for prioritizing medical conditions
US8343064B2 (en) 1999-11-16 2013-01-01 Cardiac Pacemakers, Inc. System and method for diagnosing and monitoring congestive heart failure
US20050193031A1 (en) * 1999-12-16 2005-09-01 Livevault Corporation Systems and methods for backing up data files
US20010021932A1 (en) * 1999-12-23 2001-09-13 Wilhelm Mild Access to server resources from heterogeneous platforms
US6938052B2 (en) * 1999-12-23 2005-08-30 International Business Machines Corporation Access to server resources from heterogeneous platforms
US20010018684A1 (en) * 2000-02-25 2001-08-30 International Business Machines Corporation System and method for accessing non-relational data by relational access methods
EP1207462A3 (en) * 2000-11-16 2005-12-21 Protegrity Research & Development A method for altering encryption status in a relation database in a continuous process
EP1207462A2 (en) * 2000-11-16 2002-05-22 Protegrity Research & Development A method for altering encryption status in a relation database in a continuous process
US6735582B2 (en) * 2000-12-15 2004-05-11 International Business Machines Corporation Pre-load cursor in a database method and system
US20020120616A1 (en) * 2000-12-30 2002-08-29 Bo-Hyun Yun System and method for retrieving a XML (eXtensible Markup Language) document
US20040205287A1 (en) * 2001-01-18 2004-10-14 Joder Steven D. Method, apparatus, and system for quality performance evaluation of a supplier base
US7870113B2 (en) 2001-04-12 2011-01-11 Primentia, Inc. System and method for organizing data
US20060080300A1 (en) * 2001-04-12 2006-04-13 Primentia, Inc. System and method for organizing data
US20020169830A1 (en) * 2001-05-08 2002-11-14 Wilhelm Mild System and method for redirection of host data access to multiple non-host file systems or data stores
US8001242B2 (en) * 2001-05-08 2011-08-16 International Business Machines Corporation Method for redirection of host data access to multiple non-host file systems or data stores
US7028079B2 (en) 2001-05-25 2006-04-11 Lenovo (Singapore) Pte, Ltd. Method and apparatus for the automatic migration of applications and their associated data and configuration files
US7016920B2 (en) * 2001-05-25 2006-03-21 International Business Machines Corporation Method for tracking relationships between specified file name and particular program used for subsequent access in a database
US20020178173A1 (en) * 2001-05-25 2002-11-28 International Business Machines Corporation Method and apparatus for performing the identification of files to be backed up using relational meta data
US6976039B2 (en) 2001-05-25 2005-12-13 International Business Machines Corporation Method and system for processing backup data associated with application, querying metadata files describing files accessed by the application
US20020178233A1 (en) * 2001-05-25 2002-11-28 International Business Machines Corporation Method and apparatus for the automatic migration of applications and their associated data and configuration files
US20020178436A1 (en) * 2001-05-25 2002-11-28 International Business Machines Corporation Method and apparatus for the automatic discovery of the relationships between applications and their associated data and configuration files
US7043492B1 (en) 2001-07-05 2006-05-09 Requisite Technology, Inc. Automated classification of items using classification mappings
US20030037039A1 (en) * 2001-08-16 2003-02-20 International Business Machines Corporation Schema for SQL statements
US7092955B2 (en) * 2001-08-16 2006-08-15 International Business Machines Corporation Schema for SQL statements
US7509356B2 (en) * 2001-09-06 2009-03-24 Iron Mountain Incorporated Data backup
US20030135524A1 (en) * 2001-09-06 2003-07-17 Cane David A. Data backup
US7917497B2 (en) * 2001-09-24 2011-03-29 Iac Search & Media, Inc. Natural language query processing
US20080263019A1 (en) * 2001-09-24 2008-10-23 Iac Search & Media, Inc. Natural language query processing
US6996581B2 (en) * 2001-09-28 2006-02-07 International Business Machines Corporation Template management of database instances
US6985904B1 (en) 2002-02-28 2006-01-10 Oracle International Corporation Systems and methods for sharing of execution plans for similar database statements
US7177862B2 (en) * 2002-03-28 2007-02-13 International Business Machines Corporation Method and structure for federated web service discovery search over multiple registries with result aggregation
US20030187839A1 (en) * 2002-03-28 2003-10-02 International Business Machines Corporation Method and structure for federated web service discovery search over multiple registries with result aggregation
US7092931B1 (en) 2002-05-10 2006-08-15 Oracle Corporation Methods and systems for database statement execution plan optimization
US7406469B1 (en) * 2002-06-20 2008-07-29 Oracle International Corporation Linear instance mapping for query rewrite
US20040039745A1 (en) * 2002-08-23 2004-02-26 Evans Stephen C. Apparatus and method for associating classes
US7213026B2 (en) * 2002-08-23 2007-05-01 Sun Microsystems, Inc. Apparatus and method for associating classes
US7791467B2 (en) 2002-12-17 2010-09-07 Cardiac Pacemakers, Inc. Repeater providing data exchange with a medical device for remote patient care and method thereof
US8451113B2 (en) 2002-12-17 2013-05-28 Cardiac Pacemakers, Inc. Repeater providing data exchange with a medical device for remote patient care and method thereof
US7292139B2 (en) 2002-12-17 2007-11-06 Cardiac Pacemakers, Inc. Repeater device for communications with an implantable medical device
US8791815B2 (en) 2002-12-17 2014-07-29 Cardiac Pacemakers, Inc. System and method providing data exchange with a medical device for remote patient care
US8130093B2 (en) 2002-12-17 2012-03-06 Cardiac Pacemakers, Inc. Repeater providing data exchange with a medical device for remote patient care and method thereof
US20040158561A1 (en) * 2003-02-04 2004-08-12 Gruenwald Bjorn J. System and method for translating languages using an intermediate content space
US20040172385A1 (en) * 2003-02-27 2004-09-02 Vikram Dayal Database query and content transmission governor
US20040223648A1 (en) * 2003-05-05 2004-11-11 Keith Hoene Determining differences between documents
US7647595B2 (en) 2003-10-29 2010-01-12 Oracle International Corporation Efficient event notification in clustered computing environments
US20050097569A1 (en) * 2003-10-29 2005-05-05 Oracle International Corporation Event notification in a clustered computing environments
US20050165799A1 (en) * 2004-01-23 2005-07-28 Oracle International Corporation Multi-table access control
US7346617B2 (en) 2004-01-23 2008-03-18 Oracle International Corporation Multi-table access control
US7488290B1 (en) 2004-02-19 2009-02-10 Cardiac Pacemakers, Inc. System and method for assessing cardiac performance through transcardiac impedance monitoring
US8025624B2 (en) 2004-02-19 2011-09-27 Cardiac Pacemakers, Inc. System and method for assessing cardiac performance through cardiac vibration monitoring
US8888710B2 (en) 2004-02-19 2014-11-18 Cardiac Pacemakers, Inc. System and method for assessing cardiac performance through cardiac vibration monitoring
US20050192962A1 (en) * 2004-02-26 2005-09-01 Patricia Furrer Apparatus, system, method for enabling web-applications to access enterprise managed data
CN100461175C (en) 2004-02-26 2009-02-11 国际商业机器公司 Method and device for enabling web-applications to access enterprise managed data
US7590620B1 (en) * 2004-06-18 2009-09-15 Google Inc. System and method for analyzing data records
US9405808B2 (en) 2004-06-18 2016-08-02 Google Inc. System and method for analyzing data records
US8126909B2 (en) 2004-06-18 2012-02-28 Google Inc. System and method for analyzing data records
US20100005080A1 (en) * 2004-06-18 2010-01-07 Pike Robert C System and method for analyzing data records
US9830357B2 (en) 2004-06-18 2017-11-28 Google Inc. System and method for analyzing data records
US7329226B1 (en) 2004-07-06 2008-02-12 Cardiac Pacemakers, Inc. System and method for assessing pulmonary performance through transthoracic impedance monitoring
US8795189B2 (en) 2004-07-06 2014-08-05 Cardiac Pacemakers, Inc. System and method for determining pulmonary performance from transthoracic impedance measures
US8781847B2 (en) 2005-05-03 2014-07-15 Cardiac Pacemakers, Inc. System and method for managing alert notifications in an automated patient management system
US7996386B2 (en) 2005-05-19 2011-08-09 International Business Machines Corporation Tracking premature termination of a database query
US7493306B2 (en) * 2005-05-19 2009-02-17 International Business Machines Corporation Tracking premature termination of a database query
US20090119249A1 (en) * 2005-05-19 2009-05-07 International Business Machines Corporation Tracking premature termination of a database query
US20060265351A1 (en) * 2005-05-19 2006-11-23 International Business Machines Corporation Tracking premature termination of a database query
US20080288553A1 (en) * 2005-08-04 2008-11-20 International Business Machines Corporation Medium and system for managing external routines in a database management system
US8024357B2 (en) 2005-08-04 2011-09-20 International Business Machines Corporation Medium and system for managing external routines in a database management system
US20070038662A1 (en) * 2005-08-04 2007-02-15 Peter Bendel Method and system for managing external routines in a database management system
US8019784B2 (en) 2005-08-04 2011-09-13 International Business Machines Corporation Managing external routines in a database management system
US20080270455A1 (en) * 2005-08-04 2008-10-30 International Business Machines Corporation Method for managing external routines in a database management system
US8676785B2 (en) * 2006-04-06 2014-03-18 Teradata Us, Inc. Translator of statistical language programs into SQL
US20070239669A1 (en) * 2006-04-06 2007-10-11 Carlos Ordonez Translator of statistical language programs into sql
WO2008041242A3 (en) * 2006-10-05 2008-11-13 Brainwave Applic Ltd A novel database
US20080086498A1 (en) * 2006-10-05 2008-04-10 Prateek Sureka Novel Database
US8005866B2 (en) 2006-10-05 2011-08-23 Prateek Sureka Database
US20080243715A1 (en) * 2007-04-02 2008-10-02 Bank Of America Corporation Financial Account Information Management and Auditing
US8099345B2 (en) * 2007-04-02 2012-01-17 Bank Of America Corporation Financial account information management and auditing
US20170149974A1 (en) * 2007-04-17 2017-05-25 Newvoicemedia, Ltd. Method and apparatus for using a search engine advantageously within a contact center system
US20090158298A1 (en) * 2007-12-12 2009-06-18 Abhishek Saxena Database system and eventing infrastructure
US20130031084A1 (en) * 2008-01-07 2013-01-31 Akiban Technologies, Inc. Multiple dimensioned database architecture
US20090193006A1 (en) * 2008-01-07 2009-07-30 Ori Herrnstadt Multiple dimenisioned database architecture
US8150850B2 (en) * 2008-01-07 2012-04-03 Akiban Technologies, Inc. Multiple dimensioned database architecture
US7933916B2 (en) 2008-02-28 2011-04-26 Microsoft Corporation Querying nonSQL data stores with a SQL-style language
US20090222404A1 (en) * 2008-02-28 2009-09-03 Microsoft Corporation Querying nonsql data stores with a sql-style language
US20110196843A1 (en) * 2008-09-15 2011-08-11 Dustin Kurt Adler Instance Management of Code in a Database
US8713074B2 (en) * 2008-09-15 2014-04-29 Group-A Autosports, Inc. Instance management of code in a database
US8306798B2 (en) * 2008-12-24 2012-11-06 Intel Corporation Fluid dynamics simulator
US20100161702A1 (en) * 2008-12-24 2010-06-24 Dmitry Ragozin Fluid Dynamics Simulator
US8452754B2 (en) * 2009-05-08 2013-05-28 Microsoft Corporation Static analysis framework for database applications
US20100287214A1 (en) * 2009-05-08 2010-11-11 Microsoft Corporation Static Analysis Framework for Database Applications
US20100287185A1 (en) * 2009-05-11 2010-11-11 Jean-Yves Cras Generation of logical database schema representation based on symbolic business intelligence query
US8229952B2 (en) * 2009-05-11 2012-07-24 Business Objects Software Limited Generation of logical database schema representation based on symbolic business intelligence query
US8346714B1 (en) * 2009-12-17 2013-01-01 Teradota Us, Inc. Transactiontime and validtime timestamping in an enterprise active data warehouse
US20110258178A1 (en) * 2010-04-19 2011-10-20 Salesforce.Com Methods and systems for performing cross store joins in a multi-tenant store
US9507822B2 (en) * 2010-04-19 2016-11-29 Salesforce.Com, Inc. Methods and systems for optimizing queries in a database system
US20130238595A1 (en) * 2010-04-19 2013-09-12 Salesforce.Com, Inc. Methods and systems for optimizing queries in a multi-tenant store
EP2715519A4 (en) * 2010-04-19 2015-08-05 Salesforce Com Inc Methods and systems for performing cross store joins in a multi-tenant store
WO2012087366A1 (en) 2010-12-20 2012-06-28 Salesforce.Com, Inc. Methods and systems for performing cross store joins in a multi-tenant store
US8941658B2 (en) 2011-06-15 2015-01-27 Ca, Inc. Method and apparatus for layered overview in visualization of large enterprise it environment
US8918435B2 (en) * 2011-06-27 2014-12-23 Amazon Technology, Inc. System and method for implementing a scalable data storage service
US20120330954A1 (en) * 2011-06-27 2012-12-27 Swaminathan Sivasubramanian System And Method For Implementing A Scalable Data Storage Service
US20160378845A1 (en) * 2011-06-27 2016-12-29 Amazon Technologies, Inc. System and method for implementing a scalable data storage service
US8595267B2 (en) * 2011-06-27 2013-11-26 Amazon Technologies, Inc. System and method for implementing a scalable data storage service
US20140082028A1 (en) * 2011-06-27 2014-03-20 Amazon Technologies, Inc. System and method for implementing a scalable data storage service
US9754009B2 (en) * 2011-06-27 2017-09-05 Amazon Technologies, Inc. System and method for implementing a scalable data storage service
US9432459B2 (en) * 2011-06-27 2016-08-30 Amazon Technologies, Inc. System and method for implementing a scalable data storage service
US20150112999A1 (en) * 2011-06-27 2015-04-23 Amazon Technologies, Inc. System and method for implementing a scalable data storage service
US20130007773A1 (en) * 2011-06-28 2013-01-03 Steven Scott Guilford Systems, methods, apparatuses, and computer program products for facilitating integration of third party technology with a database
US9244999B2 (en) 2012-02-27 2016-01-26 International Business Machines Corporation Database query using a user-defined function
US8799318B2 (en) * 2012-07-27 2014-08-05 Sap Ag Function module leveraging fuzzy search capability
US9727600B2 (en) 2012-11-26 2017-08-08 Accenture Global Services Limited Data consistency management
US9111012B2 (en) 2012-11-26 2015-08-18 Accenture Global Services Limited Data consistency management
US9244971B1 (en) 2013-03-07 2016-01-26 Amazon Technologies, Inc. Data retrieval from heterogeneous storage systems
US9740738B1 (en) 2013-03-07 2017-08-22 Amazon Technologies, Inc. Data retrieval from datastores with different data storage formats
US9189515B1 (en) * 2013-03-08 2015-11-17 Amazon Technologies, Inc. Data retrieval from heterogeneous storage systems
US9471654B1 (en) * 2013-11-07 2016-10-18 Progress Software Corporation Modeling of a non-relational database as a normalized relational database
US20160092503A1 (en) * 2014-09-30 2016-03-31 International Business Machines Corporation Virtualizing schema relations over a single database relation
US20160092594A1 (en) * 2014-09-30 2016-03-31 International Business Machines Corporation Virtualizing schema relations over a single database relation
US9805136B2 (en) * 2014-09-30 2017-10-31 International Business Machines Corporation Virtualizing schema relations over a single database relation
US9805137B2 (en) * 2014-09-30 2017-10-31 International Business Machines Corporation Virtualizing schema relations over a single database relation
WO2016085774A1 (en) * 2014-11-28 2016-06-02 Microsoft Technology Licensing, Llc Efficient data manipulation support
US20170177640A1 (en) * 2015-12-22 2017-06-22 Sap Se Global and local temporary database tables
Similar Documents
Publication Publication Date Title
Hollink et al. Classification of user image descriptions
Dar et al. DTL's DataSpot: Database exploration using plain language
US6128610A (en) Index with entries that store the key of a row and all non-key values of the row
Ma et al. Interest-based personalized search
US6484161B1 (en) Method and system for performing online data queries in a distributed computer system
US6385618B1 (en) Integrating both modifications to an object model and modifications to a database into source code by an object-relational mapping tool
US7526425B2 (en) Method and system for extending keyword searching to syntactically and semantically annotated data
Maarek et al. An information retrieval approach for automatically constructing software libraries
US5950210A (en) Database row version differentiation process
US6980976B2 (en) Combined database index of unstructured and structured columns
US6119128A (en) Recovering different types of objects with one pass of the log
US5666526A (en) Method and system for supporting scrollable, updatable database queries
Groff et al. SQL: the complete reference
US6598055B1 (en) Generic code for manipulating data of a structured object
US7644361B2 (en) Method of using recommendations to visually create new views of data across heterogeneous sources
Salton et al. Information retrieval
Florescu et al. Integrating keyword search into XML query processing
US20060074977A1 (en) Deferred incorporation of updates for spatial indexes
US6738759B1 (en) System and method for performing similarity searching using pointer optimization
US6263335B1 (en) Information extraction system and method using concept-relation-concept (CRC) triples
US20020065857A1 (en) System and method for analysis and clustering of documents for search engine
US20030167266A1 (en) Creation of structured data from plain text
US6728707B1 (en) Relational text index creation and searching
US6480848B1 (en) Extension of data definition language (DDL) capabilities for relational databases for applications issuing DML and DDL statements
Burkowski Retrieval activities in a database consisting of heterogeneous collections of structured text
Legal Events
Date Code Title Description
AS Assignment
Owner name: ORACLE CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KREMER, MARK;TRAN, QUOC TAI;DEPLEDGE, MICHAEL;AND OTHERS;REEL/FRAME:008221/0687;SIGNING DATES FROM 19960314 TO 19960610
CC Certificate of correction
FPAY Fee payment
Year of fee payment: 4
REMI Maintenance fee reminder mailed
AS Assignment
Owner name: ORACLE INTERNATIONAL CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ORACLE CORPORATION;REEL/FRAME:014725/0175
Effective date: 20031113
FPAY Fee payment
Year of fee payment: 8
FPAY Fee payment
Year of fee payment: 12
|
{
"url": "https://patents.google.com/patent/US5819251",
"source_domain": "patents.google.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "360834",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CDIZ7CCWHO7NMAKCVTJIQC57W4TG6R5R",
"WARC-Concurrent-To": "<urn:uuid:149c562f-76ef-41e9-8bc1-40499876a9cb>",
"WARC-Date": "2018-04-25T15:02:24Z",
"WARC-IP-Address": "172.217.3.46",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TJKTEKLDLR6FLC32YEOT6U4C7CDOVCFQ",
"WARC-Record-ID": "<urn:uuid:aa4faa18-79bd-47aa-abb2-60033aca6305>",
"WARC-Target-URI": "https://patents.google.com/patent/US5819251",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3a7a4953-9c58-4ac6-afa6-7f95d35ef530>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-179-87-62.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,
48,
49,
173,
174,
281,
282,
287,
288,
307,
318,
512,
522,
525,
538,
544,
556,
575,
586,
591,
596,
600,
609,
624,
815,
834,
853,
864,
873,
885,
899,
916,
937,
954,
977,
1150,
1176,
1194,
1206,
1397,
1409,
1426,
1437,
1438,
1444,
1445,
1452,
1453,
1469,
1470,
1485,
1527,
1572,
1687,
1788,
1918,
1975,
2014,
2257,
2308,
2412,
2493,
2539,
2782,
2833,
2937,
3018,
3071,
3125,
3190,
3191,
3200,
3201,
4171,
4172,
4184,
4185,
4218,
4219,
4419,
4420,
4452,
4453,
4744,
4745,
4773,
4774,
4800,
4801,
4975,
4976,
5010,
5011,
5171,
5172,
5749,
5750,
6174,
6175,
6510,
6511,
7117,
7118,
7629,
7630,
8155,
8156,
8594,
8595,
9416,
9417,
9805,
9806,
10440,
10441,
10903,
10904,
11123,
11124,
11333,
11334,
11848,
11849,
12326,
12327,
12352,
12353,
13206,
13207,
13677,
13678,
13915,
13916,
14565,
14566,
14763,
14764,
15350,
15351,
15512,
15513,
15825,
15826,
16827,
16828,
16926,
16927,
16960,
16961,
17120,
17121,
17220,
17221,
17335,
17336,
17477,
17478,
17625,
17626,
17713,
17714,
17808,
17809,
17933,
17934,
18025,
18026,
18141,
18142,
18220,
18221,
18953,
18954,
19655,
19656,
19814,
19815,
19842,
19843,
20069,
20070,
20086,
20087,
20325,
20326,
20607,
20608,
20619,
20620,
20976,
20977,
20984,
20985,
21739,
21740,
21755,
21756,
21974,
21975,
22013,
22014,
22590,
22591,
22631,
22632,
22838,
22839,
23469,
23470,
23485,
23486,
23498,
23499,
24970,
24971,
25578,
25579,
25967,
25968,
26120,
26121,
26465,
26466,
26927,
26928,
26984,
26985,
27980,
27981,
28442,
28443,
29323,
29324,
30103,
30104,
30505,
30506,
30840,
30841,
30860,
30861,
31291,
31292,
31343,
31344,
31641,
31642,
32029,
32030,
32040,
32041,
32409,
32410,
32452,
32453,
32480,
32481,
32526,
32527,
32541,
32542,
32562,
32563,
32624,
32625,
32676,
32677,
32800,
32801,
32822,
32823,
32864,
32865,
32901,
32902,
32918,
32919,
32953,
32954,
32973,
32974,
32999,
33000,
33064,
33065,
33091,
33092,
33138,
33139,
33175,
33176,
33189,
33190,
33224,
33225,
33244,
33245,
33259,
33260,
33326,
33327,
33499,
33500,
33509,
33510,
33778,
33779,
33894,
33895,
33944,
33945,
34012,
34013,
34144,
34145,
34198,
34199,
34343,
34344,
34479,
34480,
34491,
34492,
34721,
34722,
35050,
35051,
35083,
35084,
35267,
35268,
35283,
35284,
35900,
35901,
36432,
36433,
36772,
36773,
36938,
36939,
37119,
37120,
37206,
37207,
37276,
37277,
37363,
37364,
37830,
37831,
37845,
37846,
38136,
38137,
38505,
38506,
38521,
38522,
38620,
38621,
38697,
38698,
38759,
38760,
38805,
38806,
38973,
38974,
39082,
39083,
39241,
39242,
39258,
39259,
39491,
39492,
39534,
39535,
39663,
39664,
39875,
39876,
40001,
40002,
40177,
40178,
40361,
40362,
40423,
40424,
40481,
40482,
40547,
40548,
40730,
40731,
40756,
40757,
41103,
41104,
41293,
41294,
41381,
41382,
41689,
41690,
41810,
41811,
41841,
41842,
42174,
42175,
42252,
42253,
42567,
42568,
42771,
42772,
42852,
42853,
42921,
42922,
42977,
42978,
42998,
42999,
43337,
43338,
43355,
43356,
43386,
43387,
43400,
43401,
43414,
43415,
43433,
43434,
43789,
43790,
43817,
43818,
43906,
43907,
43952,
43953,
44094,
44095,
44257,
44258,
44399,
44400,
44659,
44660,
44753,
44754,
44984,
44985,
45087,
45088,
45211,
45212,
45340,
45341,
45367,
45368,
45874,
45875,
45900,
45901,
46039,
46040,
46895,
46896,
47078,
47079,
47101,
47102,
47229,
47230,
47651,
47652,
48105,
48106,
48130,
48131,
48291,
48292,
48863,
48864,
48887,
48888,
49286,
49287,
49360,
49361,
49446,
49447,
49491,
49492,
49589,
49590,
49721,
49722,
49780,
49781,
49871,
49872,
49897,
49898,
50167,
50168,
50183,
50184,
50605,
50606,
50618,
50619,
50675,
50676,
50682,
50683,
50690,
50691,
50862,
50863,
50872,
50873,
50912,
50913,
50919,
50920,
50927,
50928,
51129,
51130,
51141,
51142,
51186,
51187,
51211,
51212,
51275,
51276,
51340,
51341,
51354,
51355,
51723,
51724,
51741,
51742,
51897,
51898,
51919,
51920,
52046,
52047,
52454,
52455,
52486,
52487,
52523,
52524,
52824,
52825,
53141,
53142,
53156,
53157,
53543,
53544,
53552,
53553,
53877,
53878,
54053,
54054,
54350,
54351,
54381,
54382,
54945,
54946,
54973,
54974,
55607,
55608,
55814,
55815,
55825,
55826,
56171,
56172,
56424,
56425,
56734,
56735,
57230,
57231,
57368,
57369,
57379,
57380,
57703,
57704,
57884,
57885,
58004,
58005,
58014,
58015,
58266,
58267,
58600,
58601,
58827,
58828,
58879,
58880,
59175,
59176,
59415,
59416,
59431,
59432,
59647,
59648,
59935,
59936,
60161,
60162,
60252,
60253,
60783,
60784,
61315,
61316,
61782,
61783,
61796,
61797,
62174,
62175,
62464,
62465,
62789,
62790,
63136,
63137,
63324,
63325,
63339,
63340,
64097,
64098,
64110,
64111,
64131,
64263,
64332,
64390,
64482,
64645,
64777,
64846,
64904,
64991,
65092,
65288,
65420,
65489,
65547,
65634,
65730,
65843,
65948,
66079,
66234,
66366,
66435,
66493,
66580,
66676,
66808,
66975,
67107,
67262,
67310,
67375,
67479,
67604,
67751,
67901,
67949,
68014,
68132,
68257,
68404,
68554,
68602,
68667,
68786,
68911,
69058,
69208,
69332,
69443,
69529,
69634,
69680,
69778,
69902,
70010,
70096,
70201,
70247,
70345,
70470,
70579,
70665,
70770,
70816,
70914,
71039,
71100,
71186,
71316,
71367,
71428,
71500,
71545,
71643,
71776,
72068,
72155,
72290,
72432,
72601,
72717,
73009,
73234,
73369,
73511,
73681,
73797,
74089,
74328,
74463,
74605,
74775,
74891,
75183,
75423,
75558,
75700,
75870,
75986,
76148,
76149,
76175,
76176,
76227,
76370,
76371,
76406,
76407,
76458,
76601,
76602,
76619,
76620,
76656,
76699,
76700,
76707,
76708,
76720,
76721,
76745,
76746,
76797,
76959,
76960,
76979,
76980,
76993,
77016,
77017,
77031,
77032,
77076,
77141,
77296,
77452,
77578,
77683,
77795,
77903,
77980,
78136,
78306,
78420,
78546,
78698,
78872,
79017,
79152,
79324,
79490,
79637,
79820,
79934,
80068,
80283,
80444,
80623,
80819,
81049,
81253,
81355,
81470,
81608,
81679,
81881,
82006,
82113,
82235,
82368,
82529,
82673,
82780,
82925,
83024,
83190,
83323,
83458,
83576,
83684,
83789,
83928,
84149,
84270,
84383,
84534,
84748,
84903,
85030,
85129,
85259,
85388,
85528,
85678,
85817,
85930,
86064,
86243,
86404,
86479,
86595,
86722,
86826,
86984,
87089,
87193,
87314,
87412,
87497,
87656,
87775,
87912,
88017,
88170,
88307,
88447,
88588,
88787,
88905,
89038,
89195,
89294,
89436,
89573,
89674,
89791,
89919,
90034,
90185,
90301,
90446,
90604,
90699,
90700,
90715,
90716,
90760,
90825,
90987,
91166,
91266,
91437,
91560,
91718,
91831,
91979,
92145,
92328,
92480,
92634,
92810,
92980,
93147,
93283,
93284,
93306,
93307,
93351,
93416,
93578,
93757,
93909,
94067,
94167,
94290,
94473,
94644,
94757,
94924,
95090,
95238,
95408,
95584,
95720,
95874,
95875,
95900,
95901,
95945,
95951,
96033,
96115,
96116,
96131,
96132,
96176,
96241,
96349,
96426,
96569,
96716,
96821,
96977,
97063,
97177,
97333,
97459,
97610,
97758,
97913,
98134,
98308,
98476,
98662,
98809,
98975,
99142,
99295,
99478,
99606,
99765,
99887,
100009,
100135,
100253,
100365,
100500,
100685,
100843,
100982,
101132,
101314,
101445,
101640,
101791,
101941,
102113,
102278,
102402,
102547,
102699,
102860,
103035,
103185,
103351,
103501,
103651,
103789,
104004,
104106,
104208,
104303,
104404,
104525,
104688,
104834,
104984,
105137,
105283,
105428,
105583,
105797,
105922,
106030,
106209,
106346,
106479,
106655,
106834,
107000,
107155,
107332,
107508,
107675,
107824,
107942,
108060,
108206,
108360,
108539,
108700,
108866,
109003,
109135,
109327,
109507,
109625,
109743,
109880,
109993,
110107,
110248,
110418,
110584,
110750,
110883,
111017,
111162,
111255,
111354,
111515,
111692,
111875,
112086,
112282,
112508,
112712,
112942,
113072,
113187,
113298,
113378,
113449,
113549,
113653,
113780,
113935,
114133,
114335,
114464,
114580,
114687,
114796,
114958,
115120,
115254,
115406,
115568,
115712,
115819,
115918,
116055,
116190,
116295,
116394,
116552,
116705,
116858,
117009,
117140,
117238,
117334,
117430,
117534,
117630,
117791,
117949,
118106,
118240,
118376,
118516,
118656,
118826,
118990,
119129,
119271,
119430,
119542,
119655,
119737,
119812,
119875,
120002,
120125,
120283,
120388,
120502,
120606,
120716,
120831,
120952,
121057,
121165,
121249,
121334,
121449,
121568,
121727,
121901,
122042,
122179,
122305,
122438,
122575,
122715,
122857,
122989,
123129,
123267,
123401,
123539,
123673,
123807,
123945,
124144,
124272,
124371,
124472,
124573,
124688,
124820,
124937,
125082,
125233,
125384,
125531,
125678,
125794,
125889,
125890,
125908,
125909,
125944,
126001,
126070,
126167,
126212,
126315,
126468,
126584,
126682,
126743,
126823,
126902,
126990,
127031,
127106,
127221,
127257,
127326,
127401,
127499,
127602,
127700,
127765,
127827,
127974,
128078,
128079,
128092,
128093,
128121,
128135,
128136,
128179,
128180,
128361,
128362,
128391,
128408,
128409,
128432,
128433,
128470,
128484,
128485,
128542,
128543,
128645,
128646,
128671,
128672,
128689,
128690,
128713,
128714,
128731,
128732
],
"line_end_idx": [
48,
49,
173,
174,
281,
282,
287,
288,
307,
318,
512,
522,
525,
538,
544,
556,
575,
586,
591,
596,
600,
609,
624,
815,
834,
853,
864,
873,
885,
899,
916,
937,
954,
977,
1150,
1176,
1194,
1206,
1397,
1409,
1426,
1437,
1438,
1444,
1445,
1452,
1453,
1469,
1470,
1485,
1527,
1572,
1687,
1788,
1918,
1975,
2014,
2257,
2308,
2412,
2493,
2539,
2782,
2833,
2937,
3018,
3071,
3125,
3190,
3191,
3200,
3201,
4171,
4172,
4184,
4185,
4218,
4219,
4419,
4420,
4452,
4453,
4744,
4745,
4773,
4774,
4800,
4801,
4975,
4976,
5010,
5011,
5171,
5172,
5749,
5750,
6174,
6175,
6510,
6511,
7117,
7118,
7629,
7630,
8155,
8156,
8594,
8595,
9416,
9417,
9805,
9806,
10440,
10441,
10903,
10904,
11123,
11124,
11333,
11334,
11848,
11849,
12326,
12327,
12352,
12353,
13206,
13207,
13677,
13678,
13915,
13916,
14565,
14566,
14763,
14764,
15350,
15351,
15512,
15513,
15825,
15826,
16827,
16828,
16926,
16927,
16960,
16961,
17120,
17121,
17220,
17221,
17335,
17336,
17477,
17478,
17625,
17626,
17713,
17714,
17808,
17809,
17933,
17934,
18025,
18026,
18141,
18142,
18220,
18221,
18953,
18954,
19655,
19656,
19814,
19815,
19842,
19843,
20069,
20070,
20086,
20087,
20325,
20326,
20607,
20608,
20619,
20620,
20976,
20977,
20984,
20985,
21739,
21740,
21755,
21756,
21974,
21975,
22013,
22014,
22590,
22591,
22631,
22632,
22838,
22839,
23469,
23470,
23485,
23486,
23498,
23499,
24970,
24971,
25578,
25579,
25967,
25968,
26120,
26121,
26465,
26466,
26927,
26928,
26984,
26985,
27980,
27981,
28442,
28443,
29323,
29324,
30103,
30104,
30505,
30506,
30840,
30841,
30860,
30861,
31291,
31292,
31343,
31344,
31641,
31642,
32029,
32030,
32040,
32041,
32409,
32410,
32452,
32453,
32480,
32481,
32526,
32527,
32541,
32542,
32562,
32563,
32624,
32625,
32676,
32677,
32800,
32801,
32822,
32823,
32864,
32865,
32901,
32902,
32918,
32919,
32953,
32954,
32973,
32974,
32999,
33000,
33064,
33065,
33091,
33092,
33138,
33139,
33175,
33176,
33189,
33190,
33224,
33225,
33244,
33245,
33259,
33260,
33326,
33327,
33499,
33500,
33509,
33510,
33778,
33779,
33894,
33895,
33944,
33945,
34012,
34013,
34144,
34145,
34198,
34199,
34343,
34344,
34479,
34480,
34491,
34492,
34721,
34722,
35050,
35051,
35083,
35084,
35267,
35268,
35283,
35284,
35900,
35901,
36432,
36433,
36772,
36773,
36938,
36939,
37119,
37120,
37206,
37207,
37276,
37277,
37363,
37364,
37830,
37831,
37845,
37846,
38136,
38137,
38505,
38506,
38521,
38522,
38620,
38621,
38697,
38698,
38759,
38760,
38805,
38806,
38973,
38974,
39082,
39083,
39241,
39242,
39258,
39259,
39491,
39492,
39534,
39535,
39663,
39664,
39875,
39876,
40001,
40002,
40177,
40178,
40361,
40362,
40423,
40424,
40481,
40482,
40547,
40548,
40730,
40731,
40756,
40757,
41103,
41104,
41293,
41294,
41381,
41382,
41689,
41690,
41810,
41811,
41841,
41842,
42174,
42175,
42252,
42253,
42567,
42568,
42771,
42772,
42852,
42853,
42921,
42922,
42977,
42978,
42998,
42999,
43337,
43338,
43355,
43356,
43386,
43387,
43400,
43401,
43414,
43415,
43433,
43434,
43789,
43790,
43817,
43818,
43906,
43907,
43952,
43953,
44094,
44095,
44257,
44258,
44399,
44400,
44659,
44660,
44753,
44754,
44984,
44985,
45087,
45088,
45211,
45212,
45340,
45341,
45367,
45368,
45874,
45875,
45900,
45901,
46039,
46040,
46895,
46896,
47078,
47079,
47101,
47102,
47229,
47230,
47651,
47652,
48105,
48106,
48130,
48131,
48291,
48292,
48863,
48864,
48887,
48888,
49286,
49287,
49360,
49361,
49446,
49447,
49491,
49492,
49589,
49590,
49721,
49722,
49780,
49781,
49871,
49872,
49897,
49898,
50167,
50168,
50183,
50184,
50605,
50606,
50618,
50619,
50675,
50676,
50682,
50683,
50690,
50691,
50862,
50863,
50872,
50873,
50912,
50913,
50919,
50920,
50927,
50928,
51129,
51130,
51141,
51142,
51186,
51187,
51211,
51212,
51275,
51276,
51340,
51341,
51354,
51355,
51723,
51724,
51741,
51742,
51897,
51898,
51919,
51920,
52046,
52047,
52454,
52455,
52486,
52487,
52523,
52524,
52824,
52825,
53141,
53142,
53156,
53157,
53543,
53544,
53552,
53553,
53877,
53878,
54053,
54054,
54350,
54351,
54381,
54382,
54945,
54946,
54973,
54974,
55607,
55608,
55814,
55815,
55825,
55826,
56171,
56172,
56424,
56425,
56734,
56735,
57230,
57231,
57368,
57369,
57379,
57380,
57703,
57704,
57884,
57885,
58004,
58005,
58014,
58015,
58266,
58267,
58600,
58601,
58827,
58828,
58879,
58880,
59175,
59176,
59415,
59416,
59431,
59432,
59647,
59648,
59935,
59936,
60161,
60162,
60252,
60253,
60783,
60784,
61315,
61316,
61782,
61783,
61796,
61797,
62174,
62175,
62464,
62465,
62789,
62790,
63136,
63137,
63324,
63325,
63339,
63340,
64097,
64098,
64110,
64111,
64131,
64263,
64332,
64390,
64482,
64645,
64777,
64846,
64904,
64991,
65092,
65288,
65420,
65489,
65547,
65634,
65730,
65843,
65948,
66079,
66234,
66366,
66435,
66493,
66580,
66676,
66808,
66975,
67107,
67262,
67310,
67375,
67479,
67604,
67751,
67901,
67949,
68014,
68132,
68257,
68404,
68554,
68602,
68667,
68786,
68911,
69058,
69208,
69332,
69443,
69529,
69634,
69680,
69778,
69902,
70010,
70096,
70201,
70247,
70345,
70470,
70579,
70665,
70770,
70816,
70914,
71039,
71100,
71186,
71316,
71367,
71428,
71500,
71545,
71643,
71776,
72068,
72155,
72290,
72432,
72601,
72717,
73009,
73234,
73369,
73511,
73681,
73797,
74089,
74328,
74463,
74605,
74775,
74891,
75183,
75423,
75558,
75700,
75870,
75986,
76148,
76149,
76175,
76176,
76227,
76370,
76371,
76406,
76407,
76458,
76601,
76602,
76619,
76620,
76656,
76699,
76700,
76707,
76708,
76720,
76721,
76745,
76746,
76797,
76959,
76960,
76979,
76980,
76993,
77016,
77017,
77031,
77032,
77076,
77141,
77296,
77452,
77578,
77683,
77795,
77903,
77980,
78136,
78306,
78420,
78546,
78698,
78872,
79017,
79152,
79324,
79490,
79637,
79820,
79934,
80068,
80283,
80444,
80623,
80819,
81049,
81253,
81355,
81470,
81608,
81679,
81881,
82006,
82113,
82235,
82368,
82529,
82673,
82780,
82925,
83024,
83190,
83323,
83458,
83576,
83684,
83789,
83928,
84149,
84270,
84383,
84534,
84748,
84903,
85030,
85129,
85259,
85388,
85528,
85678,
85817,
85930,
86064,
86243,
86404,
86479,
86595,
86722,
86826,
86984,
87089,
87193,
87314,
87412,
87497,
87656,
87775,
87912,
88017,
88170,
88307,
88447,
88588,
88787,
88905,
89038,
89195,
89294,
89436,
89573,
89674,
89791,
89919,
90034,
90185,
90301,
90446,
90604,
90699,
90700,
90715,
90716,
90760,
90825,
90987,
91166,
91266,
91437,
91560,
91718,
91831,
91979,
92145,
92328,
92480,
92634,
92810,
92980,
93147,
93283,
93284,
93306,
93307,
93351,
93416,
93578,
93757,
93909,
94067,
94167,
94290,
94473,
94644,
94757,
94924,
95090,
95238,
95408,
95584,
95720,
95874,
95875,
95900,
95901,
95945,
95951,
96033,
96115,
96116,
96131,
96132,
96176,
96241,
96349,
96426,
96569,
96716,
96821,
96977,
97063,
97177,
97333,
97459,
97610,
97758,
97913,
98134,
98308,
98476,
98662,
98809,
98975,
99142,
99295,
99478,
99606,
99765,
99887,
100009,
100135,
100253,
100365,
100500,
100685,
100843,
100982,
101132,
101314,
101445,
101640,
101791,
101941,
102113,
102278,
102402,
102547,
102699,
102860,
103035,
103185,
103351,
103501,
103651,
103789,
104004,
104106,
104208,
104303,
104404,
104525,
104688,
104834,
104984,
105137,
105283,
105428,
105583,
105797,
105922,
106030,
106209,
106346,
106479,
106655,
106834,
107000,
107155,
107332,
107508,
107675,
107824,
107942,
108060,
108206,
108360,
108539,
108700,
108866,
109003,
109135,
109327,
109507,
109625,
109743,
109880,
109993,
110107,
110248,
110418,
110584,
110750,
110883,
111017,
111162,
111255,
111354,
111515,
111692,
111875,
112086,
112282,
112508,
112712,
112942,
113072,
113187,
113298,
113378,
113449,
113549,
113653,
113780,
113935,
114133,
114335,
114464,
114580,
114687,
114796,
114958,
115120,
115254,
115406,
115568,
115712,
115819,
115918,
116055,
116190,
116295,
116394,
116552,
116705,
116858,
117009,
117140,
117238,
117334,
117430,
117534,
117630,
117791,
117949,
118106,
118240,
118376,
118516,
118656,
118826,
118990,
119129,
119271,
119430,
119542,
119655,
119737,
119812,
119875,
120002,
120125,
120283,
120388,
120502,
120606,
120716,
120831,
120952,
121057,
121165,
121249,
121334,
121449,
121568,
121727,
121901,
122042,
122179,
122305,
122438,
122575,
122715,
122857,
122989,
123129,
123267,
123401,
123539,
123673,
123807,
123945,
124144,
124272,
124371,
124472,
124573,
124688,
124820,
124937,
125082,
125233,
125384,
125531,
125678,
125794,
125889,
125890,
125908,
125909,
125944,
126001,
126070,
126167,
126212,
126315,
126468,
126584,
126682,
126743,
126823,
126902,
126990,
127031,
127106,
127221,
127257,
127326,
127401,
127499,
127602,
127700,
127765,
127827,
127974,
128078,
128079,
128092,
128093,
128121,
128135,
128136,
128179,
128180,
128361,
128362,
128391,
128408,
128409,
128432,
128433,
128470,
128484,
128485,
128542,
128543,
128645,
128646,
128671,
128672,
128689,
128690,
128713,
128714,
128731,
128732,
128755
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 128755,
"ccnet_original_nlines": 1217,
"rps_doc_curly_bracket": 0.000015530000382568687,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23104649782180786,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05530858039855957,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3085826337337494,
"rps_doc_frac_unique_words": 0.14440353214740753,
"rps_doc_mean_word_length": 5.764423847198486,
"rps_doc_num_sentences": 861,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 6.1831183433532715,
"rps_doc_word_count": 17922,
"rps_doc_frac_chars_dupe_10grams": 0.4479043781757355,
"rps_doc_frac_chars_dupe_5grams": 0.5656083822250366,
"rps_doc_frac_chars_dupe_6grams": 0.5379440784454346,
"rps_doc_frac_chars_dupe_7grams": 0.5117316842079163,
"rps_doc_frac_chars_dupe_8grams": 0.48914915323257446,
"rps_doc_frac_chars_dupe_9grams": 0.46764108538627625,
"rps_doc_frac_chars_top_2gram": 0.012196299619972706,
"rps_doc_frac_chars_top_3gram": 0.014519410207867622,
"rps_doc_frac_chars_top_4gram": 0.02125640958547592,
"rps_doc_books_importance": -12322.767578125,
"rps_doc_books_importance_length_correction": -12322.767578125,
"rps_doc_openwebtext_importance": -6657.28662109375,
"rps_doc_openwebtext_importance_length_correction": -6657.28662109375,
"rps_doc_wikipedia_importance": -4125.26123046875,
"rps_doc_wikipedia_importance_length_correction": -4125.26123046875
},
"fasttext": {
"dclm": 0.23629021644592285,
"english": 0.7822790145874023,
"fineweb_edu_approx": 2.6460204124450684,
"eai_general_math": 0.04143058881163597,
"eai_open_web_math": 0.0631338432431221,
"eai_web_code": 0.013284499756991863
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "11",
"label": "Legal Notices"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,204,014,573,918,095,000 |
Create
cancel
Showing results for
Search instead for
Did you mean:
Sign up Log in
Un-watching trello cards
Nini Bubuteishvili April 9, 2022
Greetings,
I get a lot of notifications about cards that are watched by me. Is there any option to un-watch them all? Not manually, one by one, but collectively.
Thanks in advance
2 answers
0 votes
Hannah Humbert - Simpla Workflows
Community Leader
Community Leader
Community Leaders are connectors, ambassadors, and mentors. On the online community, they serve as thought leaders, product experts, and moderators.
April 10, 2022
Moving forward, you might also want to reduce the amount of cards you end up being a watcher of.
When you comment on a card, by default, you'll become a watcher of that card. However, you can un-check that option.
watch a card.PNG
Moving forward, the checkbox will remain un-checked.
Also, you become a watcher when you're added as a member of a card. I don't believe there's a setting to turn this off, but you could create a butler rule to automatically remove yourself as a watcher - e.g. when I'm added to a card, leave the card.
If you do both of those things, you can then choose what cards you want to be notified of by manually watching them which will significantly reduce your notifications.
Artemis
Rising Star
Rising Star
Rising Stars are recognized for providing high-quality answers to other users. Rising Stars receive a certificate of achievement and are on the path to becoming Community Leaders.
April 11, 2022
This is a great point with Butler! I'd make one suggestion to change the Butler rule action from "leave the card" to "unsubscribe from the card". Leaving the card will remove the membership from the card but "unsubscribe" stops watching it.
Hannah Humbert - Simpla Workflows
Community Leader
Community Leader
Community Leaders are connectors, ambassadors, and mentors. On the online community, they serve as thought leaders, product experts, and moderators.
April 11, 2022
@Artemis Good catch! That was what I meant 😅
Like Artemis likes this
Nini Bubuteishvili April 20, 2022
Thanks, both of you!
Like # people like this
Daniel Tan February 25, 2023
Hi Hannah,, so if there are only some cards I don't want to watch, with the majority i want to watch. Does that mean I can watch the board and select some that i don't want to watch? or watching the board will override?
and each time I comment I have to set it to unwatch? would that mean I added to the member as I comment and can use your butler rule to unwatch?
0 votes
Artemis
Rising Star
Rising Star
Rising Stars are recognized for providing high-quality answers to other users. Rising Stars receive a certificate of achievement and are on the path to becoming Community Leaders.
April 9, 2022
There isn't a way to watch or un-watch multiple cards in bulk, but you can speed things up by hovering your mouse over a watched card on the board view (look for the eye icon on the card front) and tap 's' to un-watch it. You'll know it worked when the eye icon disappears.
Daniel Tan March 2, 2023
Hi Artemis,
just to check there's only watch vs unwatching there's no unwatch per say?
I'm watching the board as most of the cards I need to watch except for a few. but I still keep getting notifications for every card. So the only way is the manually watch most of the card? Or it's just not working consistently such as the missing notification badge which there are a lot of posts as well.
Also, the eye icons don't seem to be accurate. Only a few cards have those icons.
Suggest an answer
Log in or Sign up to answer
TAGS
AUG Leaders
Atlassian Community Events
|
{
"url": "https://community.atlassian.com/t5/Trello-questions/Un-watching-trello-cards/qaq-p/1997910",
"source_domain": "community.atlassian.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "267783",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I657YSWDPQJEZPIBHH2YJRTVQCTFE37S",
"WARC-Concurrent-To": "<urn:uuid:7af4e1fd-ffee-460f-af23-23ded55e6ab6>",
"WARC-Date": "2024-08-10T03:52:10Z",
"WARC-IP-Address": "52.85.151.19",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IZ5IHU4T2V437U5USIJ4N3PX6NINKRIF",
"WARC-Record-ID": "<urn:uuid:5193568f-6011-404f-84de-aa5deff1992d>",
"WARC-Target-URI": "https://community.atlassian.com/t5/Trello-questions/Un-watching-trello-cards/qaq-p/1997910",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d52897fb-64f8-48a4-8ee4-0e84d725fba2>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-209\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
7,
14,
35,
55,
70,
85,
86,
111,
112,
145,
146,
158,
159,
161,
162,
314,
315,
317,
318,
336,
337,
347,
348,
356,
390,
407,
424,
573,
588,
589,
687,
688,
806,
807,
824,
877,
878,
1128,
1129,
1297,
1298,
1306,
1318,
1330,
1510,
1525,
1526,
1768,
1769,
1803,
1820,
1837,
1986,
2001,
2002,
2047,
2048,
2072,
2106,
2107,
2129,
2130,
2154,
2183,
2184,
2404,
2405,
2550,
2551,
2559,
2567,
2579,
2591,
2771,
2785,
2786,
3060,
3061,
3086,
3087,
3099,
3100,
3102,
3103,
3178,
3179,
3485,
3486,
3568,
3569,
3587,
3588,
3616,
3621,
3633,
3634
],
"line_end_idx": [
7,
14,
35,
55,
70,
85,
86,
111,
112,
145,
146,
158,
159,
161,
162,
314,
315,
317,
318,
336,
337,
347,
348,
356,
390,
407,
424,
573,
588,
589,
687,
688,
806,
807,
824,
877,
878,
1128,
1129,
1297,
1298,
1306,
1318,
1330,
1510,
1525,
1526,
1768,
1769,
1803,
1820,
1837,
1986,
2001,
2002,
2047,
2048,
2072,
2106,
2107,
2129,
2130,
2154,
2183,
2184,
2404,
2405,
2550,
2551,
2559,
2567,
2579,
2591,
2771,
2785,
2786,
3060,
3061,
3086,
3087,
3099,
3100,
3102,
3103,
3178,
3179,
3485,
3486,
3568,
3569,
3587,
3588,
3616,
3621,
3633,
3634,
3660
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3660,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40337222814559937,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02204928919672966,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1738002598285675,
"rps_doc_frac_unique_words": 0.3876582384109497,
"rps_doc_mean_word_length": 4.52531623840332,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.0012970200041309,
"rps_doc_unigram_entropy": 5.062517166137695,
"rps_doc_word_count": 632,
"rps_doc_frac_chars_dupe_10grams": 0.2566433548927307,
"rps_doc_frac_chars_dupe_5grams": 0.2678321599960327,
"rps_doc_frac_chars_dupe_6grams": 0.2566433548927307,
"rps_doc_frac_chars_dupe_7grams": 0.2566433548927307,
"rps_doc_frac_chars_dupe_8grams": 0.2566433548927307,
"rps_doc_frac_chars_dupe_9grams": 0.2566433548927307,
"rps_doc_frac_chars_top_2gram": 0.017132870852947235,
"rps_doc_frac_chars_top_3gram": 0.0335664302110672,
"rps_doc_frac_chars_top_4gram": 0.0195804201066494,
"rps_doc_books_importance": -277.7311706542969,
"rps_doc_books_importance_length_correction": -277.7311706542969,
"rps_doc_openwebtext_importance": -131.7797088623047,
"rps_doc_openwebtext_importance_length_correction": -131.7797088623047,
"rps_doc_wikipedia_importance": -105.32801818847656,
"rps_doc_wikipedia_importance_length_correction": -105.32801818847656
},
"fasttext": {
"dclm": 0.06366211175918579,
"english": 0.965255856513977,
"fineweb_edu_approx": 1.0401105880737305,
"eai_general_math": 0.012999240309000015,
"eai_open_web_math": 0.18828612565994263,
"eai_web_code": 0.004105390049517155
}
}
|
{
"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": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,018,848,642,502,264,000 |
Getting started with BigQuery GIS
This tutorial introduces you to BigQuery GIS. BigQuery GIS lets you analyze and visualize geospatial data in BigQuery.
Objectives
In this tutorial, you:
• Use a BigQuery GIS function to convert latitude and longitude columns into geographical points
• Run a query that finds all the Citi Bike stations with more than 30 bikes available for rental
• Visualize your results in BigQuery Geo Viz
Costs
This tutorial uses billable components of Google Cloud, including:
• BigQuery
You incur charges for:
• Querying data in the BigQuery public datasets.
• The first 1 TB is free each month.
• If you are using flat-rate pricing, query costs are included in the monthly flat-rate price.
Before you begin
1. Sign in to your Google Account.
If you don't already have one, sign up for a new account.
2. In the Google Cloud Console, on the project selector page, select or create a Google Cloud project.
Go to the project selector page
3. Projeniz için faturalandırmanın etkinleştirildiğinden emin olun.
Faturalandırmayı etkinleştirmeyi öğren
4. BigQuery is automatically enabled in new projects. To activate BigQuery in an existing project, go to Enable the BigQuery API.
Enable the API
Explore the sample data
This tutorial uses a dataset available through the Google Cloud Public Dataset Program. A public dataset is any dataset that is stored in BigQuery and made available to the general public. The public datasets are datasets that BigQuery hosts for you to access and integrate into your applications. Google pays for the storage of these datasets and provides public access to the data via a project. You pay only for the queries that you perform on the data (the first 1 TB per month is free, subject to query pricing details).
The NYC Citi Bike Trips dataset
NYC Citi Bike Trips
Citi Bike is the nation's largest bike share program, with 10,000 bikes and 600 stations across Manhattan, Brooklyn, Queens, and Jersey City. This dataset includes Citi Bike trips since Citi Bike launched in September 2013 and is updated daily. The data is processed by Citi Bike to remove trips that are taken by staff to service and inspect the system and any trips below 60 seconds in length, which are considered false starts.
You can start exploring this data in the BigQuery console by viewing the details of the citibike_stations table:
Go to citibike_stations schema
Three columns in this table are relevant to this tutorial:
• bike_stations.longitude: the longitude of a station. The values are valid WGS 84 longitudes in decimal degrees format.
• bike_stations.latitude: the latitude of a station. The values are valid WGS 84 latitudes in decimal degrees format.
• num_bikes_available: the number of bikes available for rental.
Query the bike stations with more than 30 bikes available
In this section of the tutorial, you run a standard SQL query that finds all the Citi Bike stations in New York City with more than 30 bikes available to rent.
Query details
The following standard SQL query is used to find the Citi Bike stations with more than 30 bikes.
SELECT
ST_GeogPoint(longitude, latitude) AS WKT,
num_bikes_available
FROM
`bigquery-public-data.new_york.citibike_stations`
WHERE num_bikes_available > 30
The query clauses do the following:
• SELECT ST_GeogPoint(longitude, latitude) AS WKT, num_bikes_available
The SELECT clause selects the num_bikes_available column and uses the ST_GeogPoint function to convert the values in the latitude and longitude columns to GEOGRAPHY types (points).
• FROM `bigquery-public-data.new_york.citibike_stations`
The FROM clause specifies the table being queried: citibike_stations.
• WHERE num_bikes_available > 30
The WHERE clause filters the values in the num_bikes_available column to just those stations with more than 30 bikes.
Run the query
To run the query by using the Cloud Console:
1. Go to the BigQuery page in the Cloud Console.
Go to the BigQuery page
2. Enter the following standard SQL query in the Query editor text area.
-- Finds Citi Bike stations with > 30 bikes
SELECT
ST_GeogPoint(longitude, latitude) AS WKT,
num_bikes_available
FROM
`bigquery-public-data.new_york.citibike_stations`
WHERE num_bikes_available > 30
3. Click Run.
The query takes a moment to complete. After the query runs, your results appear in the Query results pane.
Bike station query results.
Visualize the query results in Geo Viz
Next, you visualize your results using BigQuery Geo Viz: a web tool for visualization of geospatial data in BigQuery using Maps APIs.
Launch Geo Viz and authenticate
Before using Geo Viz, you must authenticate and grant access to data in BigQuery.
To set up Geo Viz:
1. Open the Geo Viz web tool.
Open the Geo Viz web tool
2. Under step one, Select data, click Authorize.
Geo Viz authorization button.
3. In the Choose an account dialog, click your Google Account.
Choose account dialog.
4. In the access dialog, click Allow to give Geo Viz access to your BigQuery data.
Allow access dialog.
Run a standard SQL query on BigQuery GIS data
After you authenticate and grant access, the next step is to run the query in Geo Viz.
To run the query:
1. For step one, Select data, enter your project ID in the Project ID field.
2. In the query window, enter the following standard SQL query.
-- Finds Citi Bike stations with > 30 bikes
SELECT
ST_GeogPoint(longitude, latitude) AS WKT,
num_bikes_available
FROM
`bigquery-public-data.new_york.citibike_stations`
WHERE num_bikes_available > 30
3. Click Run.
4. When the query completes, click See results. You can also click step two Define columns.
See results.
5. This moves you to step two. In step two, for Geometry column, choose WKT. This plots the points corresponding to the bike stations on your map.
Mapped results.
Format your visualization
The Style section provides a list of visual styles for customization. Certain properties apply only to certain types of data. For example, circleRadius affects only points.
Supported style properties include:
• fillColor. The fill color of a polygon or point. For example, "linear" or "interval" functions can be used to map numeric values to a color gradient.
• fillOpacity. The fill opacity of a polygon or point. Values must be in the range 0 to 1, where 0 = transparent and 1 = opaque.
• strokeColor. The stroke or outline color of a polygon or line.
• strokeOpacity. The stroke or outline opacity of polygon or line. Values must be in the range 0 to 1, where 0 = transparent and 1 = opaque.
• strokeWeight. The stroke or outline width in pixels of a polygon or line.
• circleRadius. The radius of the circle representing a point in pixels. For example, a "linear" function can be used to map numeric values to point sizes to create a scatterplot style.
Each style can be given either a global value (applied to every result) or a data-driven value (applied in different ways depending on data in each result row). For data-driven values, the following are used to determine the result:
• function. A function used to compute a style value from a field's values.
• identity. The data value of each field is used as the styling value.
• categorical. The data values of each field listed in the domain are mapped one to one with corresponding styles in the range.
• interval. Data values of each field are rounded down to the nearest value in the domain and are then styled with the corresponding style in the range.
• linear. Data values of each field are interpolated linearly across values in the domain and are then styled with a blend of the corresponding styles in the range.
• field. The specified field in the data is used as the input to the styling function.
• domain. An ordered list of sample input values from a field. Sample inputs (domain) are paired with sample outputs (range) based on the given function and are used to infer style values for all inputs (even those not listed in the domain). Values in the domain must have the same type (text, number, and so on) as the values of the field you are visualizing.
• range. A list of sample output values for the style rule. Values in the range must have the same type (color or number) as the style property you are controlling. For example, the range of the fillColor property should contain only colors.
To format your map:
1. Click Add styles in step two or click step 3 Style.
2. Change the color of your points. Click fillColor.
3. In the Value field, enter #0000FF, the HTML color code for blue.
Fill color.
4. Examine your map. If you hover on one of your points, the value is displayed.
Map point details.
5. Click fillOpacity.
6. In the Value field, enter .5.
Fill opacity.
7. Examine your map. The fill color of the points is now semi-transparent.
Map with semi-transparent points.
8. Change the size of the points based on the number of bikes available. Click circleRadius.
9. In the circleRadius panel:
1. Click Data driven.
2. For Function, choose linear.
3. For Field, choose num_bikes_available.
4. For Domain, enter 30 in the first box and 60 in the second.
5. For Range, enter 5 in the first box and 20 in the second.
Circle radius.
10. Examine your map. The radius of each circle now corresponds to the number of bikes available at that location.
Final map.
11. Close Geo Viz.
Cleaning up
To avoid incurring charges to your Google Cloud Platform account for the resources used in this tutorial:
• You can delete the project you created.
• Or you can keep the project for future use.
To delete the project:
1. In the Cloud Console, go to the Manage resources page.
Go to the Manage resources page
2. In the project list, select the project that you want to delete and then click Delete .
3. In the dialog, type the project ID and then click Shut down to delete the project.
What's next
|
{
"url": "https://cloud.google.com/bigquery/docs/gis-getting-started?hl=tr",
"source_domain": "cloud.google.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "677486",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XF4KETJRPPDVWPCF4YD55RVR27FJHTWQ",
"WARC-Concurrent-To": "<urn:uuid:0448a2fc-db01-4ee2-a865-2436c811cf74>",
"WARC-Date": "2020-11-26T14:17:24Z",
"WARC-IP-Address": "172.217.15.78",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3DWZGD3AXZBCJEBDZO2WUJ7BGPR53I2Z",
"WARC-Record-ID": "<urn:uuid:42c1d4d2-f6e7-45fb-882b-32e5570c6a72>",
"WARC-Target-URI": "https://cloud.google.com/bigquery/docs/gis-getting-started?hl=tr",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c28a0259-8da3-4b6e-b78f-9dabd542b2e4>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-245.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,
34,
35,
154,
155,
166,
167,
190,
191,
290,
389,
436,
437,
443,
444,
511,
512,
525,
526,
549,
550,
601,
642,
741,
742,
759,
760,
797,
798,
860,
861,
966,
967,
1003,
1004,
1074,
1075,
1118,
1119,
1251,
1252,
1271,
1272,
1296,
1297,
1823,
1824,
1856,
1857,
1877,
1878,
2309,
2310,
2423,
2424,
2455,
2456,
2515,
2516,
2639,
2759,
2826,
2827,
2885,
2886,
3046,
3047,
3061,
3062,
3159,
3160,
3167,
3212,
3234,
3239,
3291,
3322,
3323,
3359,
3360,
3433,
3618,
3677,
3751,
3786,
3908,
3909,
3923,
3924,
3969,
3970,
4021,
4022,
4050,
4051,
4126,
4127,
4175,
4186,
4235,
4261,
4270,
4326,
4361,
4366,
4382,
4383,
4494,
4495,
4527,
4528,
4567,
4568,
4702,
4703,
4735,
4736,
4818,
4819,
4838,
4839,
4871,
4872,
4902,
4903,
4954,
4955,
4989,
4990,
5055,
5056,
5083,
5084,
5169,
5170,
5195,
5196,
5242,
5243,
5330,
5331,
5349,
5350,
5429,
5430,
5496,
5497,
5545,
5556,
5605,
5631,
5640,
5696,
5731,
5736,
5752,
5753,
5847,
5848,
5865,
5866,
6015,
6016,
6036,
6037,
6063,
6064,
6237,
6238,
6274,
6275,
6429,
6560,
6627,
6770,
6848,
7036,
7037,
7270,
7271,
7349,
7422,
7552,
7707,
7874,
7963,
8326,
8570,
8571,
8591,
8592,
8649,
8650,
8705,
8706,
8776,
8777,
8793,
8794,
8877,
8878,
8901,
8902,
8926,
8927,
8962,
8963,
8981,
8982,
9059,
9060,
9098,
9099,
9194,
9195,
9227,
9228,
9254,
9290,
9336,
9403,
9468,
9469,
9490,
9491,
9608,
9609,
9624,
9625,
9646,
9647,
9659,
9660,
9766,
9767,
9811,
9859,
9860,
9883,
9884,
9944,
9945,
9981,
9982,
10075,
10163,
10164
],
"line_end_idx": [
34,
35,
154,
155,
166,
167,
190,
191,
290,
389,
436,
437,
443,
444,
511,
512,
525,
526,
549,
550,
601,
642,
741,
742,
759,
760,
797,
798,
860,
861,
966,
967,
1003,
1004,
1074,
1075,
1118,
1119,
1251,
1252,
1271,
1272,
1296,
1297,
1823,
1824,
1856,
1857,
1877,
1878,
2309,
2310,
2423,
2424,
2455,
2456,
2515,
2516,
2639,
2759,
2826,
2827,
2885,
2886,
3046,
3047,
3061,
3062,
3159,
3160,
3167,
3212,
3234,
3239,
3291,
3322,
3323,
3359,
3360,
3433,
3618,
3677,
3751,
3786,
3908,
3909,
3923,
3924,
3969,
3970,
4021,
4022,
4050,
4051,
4126,
4127,
4175,
4186,
4235,
4261,
4270,
4326,
4361,
4366,
4382,
4383,
4494,
4495,
4527,
4528,
4567,
4568,
4702,
4703,
4735,
4736,
4818,
4819,
4838,
4839,
4871,
4872,
4902,
4903,
4954,
4955,
4989,
4990,
5055,
5056,
5083,
5084,
5169,
5170,
5195,
5196,
5242,
5243,
5330,
5331,
5349,
5350,
5429,
5430,
5496,
5497,
5545,
5556,
5605,
5631,
5640,
5696,
5731,
5736,
5752,
5753,
5847,
5848,
5865,
5866,
6015,
6016,
6036,
6037,
6063,
6064,
6237,
6238,
6274,
6275,
6429,
6560,
6627,
6770,
6848,
7036,
7037,
7270,
7271,
7349,
7422,
7552,
7707,
7874,
7963,
8326,
8570,
8571,
8591,
8592,
8649,
8650,
8705,
8706,
8776,
8777,
8793,
8794,
8877,
8878,
8901,
8902,
8926,
8927,
8962,
8963,
8981,
8982,
9059,
9060,
9098,
9099,
9194,
9195,
9227,
9228,
9254,
9290,
9336,
9403,
9468,
9469,
9490,
9491,
9608,
9609,
9624,
9625,
9646,
9647,
9659,
9660,
9766,
9767,
9811,
9859,
9860,
9883,
9884,
9944,
9945,
9981,
9982,
10075,
10163,
10164,
10175
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10175,
"ccnet_original_nlines": 246,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.308118999004364,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025718610733747482,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20877458155155182,
"rps_doc_frac_unique_words": 0.2509180009365082,
"rps_doc_mean_word_length": 4.742961883544922,
"rps_doc_num_sentences": 173,
"rps_doc_symbol_to_word_ratio": 0.0005042899865657091,
"rps_doc_unigram_entropy": 5.177980899810791,
"rps_doc_word_count": 1634,
"rps_doc_frac_chars_dupe_10grams": 0.07380644977092743,
"rps_doc_frac_chars_dupe_5grams": 0.22825805842876434,
"rps_doc_frac_chars_dupe_6grams": 0.17793548107147217,
"rps_doc_frac_chars_dupe_7grams": 0.12580645084381104,
"rps_doc_frac_chars_dupe_8grams": 0.11961290240287781,
"rps_doc_frac_chars_dupe_9grams": 0.09096773713827133,
"rps_doc_frac_chars_top_2gram": 0.022580649703741074,
"rps_doc_frac_chars_top_3gram": 0.0077419402077794075,
"rps_doc_frac_chars_top_4gram": 0.009032259695231915,
"rps_doc_books_importance": -964.2244873046875,
"rps_doc_books_importance_length_correction": -964.2244873046875,
"rps_doc_openwebtext_importance": -616.3322143554688,
"rps_doc_openwebtext_importance_length_correction": -616.3322143554688,
"rps_doc_wikipedia_importance": -486.7718200683594,
"rps_doc_wikipedia_importance_length_correction": -486.7718200683594
},
"fasttext": {
"dclm": 0.0998806431889534,
"english": 0.7747525572776794,
"fineweb_edu_approx": 2.407099485397339,
"eai_general_math": 0.5734647512435913,
"eai_open_web_math": 0.11472761631011963,
"eai_web_code": 0.3941214084625244
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,713,269,940,073,722,000 |
2.4 (Current)
Search
K
Links
Line
Struct in Yarn
Inherits from System.ValueType
Summary
A line of dialogue, sent from the Dialogue to the game.
public struct Line
Remarks
When the game receives a Line, it should do the following things to prepare the line for presentation to the user.
1. 1.
Use the value in the ID field to look up the appropriate user-facing text in the string table.
2. 2.
Use ExpandSubstitutions(string,IList<string>) to replace all substitutions in the user-facing text.
3. 3.
Use ParseMarkup(string) to parse all markup in the line.
You do not create instances of this struct yourself. They are created by the Dialogue during program execution.
Fields
Name
Description
ID
The string ID for this line.
The values that should be inserted into the user-facing text before delivery.
See Also
|
{
"url": "https://docs.yarnspinner.dev/api/csharp/yarn/yarn.line",
"source_domain": "docs.yarnspinner.dev",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "653531",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EKUBYC43DFY7QMPCENS3I3LUVZQLI2QK",
"WARC-Concurrent-To": "<urn:uuid:d8f40e1e-4a18-4a07-b88c-0476c5ee065f>",
"WARC-Date": "2024-02-21T01:09:10Z",
"WARC-IP-Address": "104.18.40.47",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MBJ4XSQM6VFLYDDO7GIWYSTGRK4DK3HY",
"WARC-Record-ID": "<urn:uuid:b9eeffe6-f1ca-4948-ae9c-7885864ee8a3>",
"WARC-Target-URI": "https://docs.yarnspinner.dev/api/csharp/yarn/yarn.line",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:56b4ab2f-114c-4f84-99b8-6140cf2b2c72>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-126\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,
14,
21,
23,
29,
30,
35,
36,
51,
82,
83,
91,
92,
148,
167,
168,
176,
177,
292,
300,
399,
407,
511,
519,
580,
692,
693,
700,
701,
706,
718,
721,
750,
828,
829
],
"line_end_idx": [
14,
21,
23,
29,
30,
35,
36,
51,
82,
83,
91,
92,
148,
167,
168,
176,
177,
292,
300,
399,
407,
511,
519,
580,
692,
693,
700,
701,
706,
718,
721,
750,
828,
829,
837
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 837,
"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.323699414730072,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028901729732751846,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2196531742811203,
"rps_doc_frac_unique_words": 0.5895522236824036,
"rps_doc_mean_word_length": 4.820895671844482,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.042784690856934,
"rps_doc_word_count": 134,
"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.030959749594330788,
"rps_doc_frac_chars_top_3gram": 0.05263157933950424,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -83.14279174804688,
"rps_doc_books_importance_length_correction": -83.14279174804688,
"rps_doc_openwebtext_importance": -60.35641860961914,
"rps_doc_openwebtext_importance_length_correction": -59.323551177978516,
"rps_doc_wikipedia_importance": -30.811737060546875,
"rps_doc_wikipedia_importance_length_correction": -30.811737060546875
},
"fasttext": {
"dclm": 0.8476119637489319,
"english": 0.8023529648780823,
"fineweb_edu_approx": 2.0554490089416504,
"eai_general_math": 0.2787156105041504,
"eai_open_web_math": 0.16652852296829224,
"eai_web_code": 0.010458470322191715
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,684,112,737,062,612,000 |
windows server 2012 r2 evaluation
We have installed the 2012 R2 evaluation to test our application software. Users will be accessing data in a folder on the evaluation server via a mapped drive. They will log into the SBS 2003 domain, the evaluation server is a member server of the 2003 domain. Question is will there be licensing issues on the eval server? Once we have fully tested the application we will purchase 2012 and the appropriate licenses but for testing we need to have several people accessing the application at the same time.
LVL 1
dpachecoAsked:
Who is Participating?
Patrick BogersConnect With a Mentor Datacenter platform engineer LindowsCommented:
Hi
Using a share one the eval server does not cause any licences issue since your user cals are handled by the sbs server.
0
Shahnawaz AhmedTechnical Services SpecialistCommented:
There should not be any issue. As i have tested my self in my Lab environment couple of different scenario but i never came to know such issue.
0
dpachecoAuthor Commented:
Patricksr1972 - I am assuming once we've purchased 2012 that legally we will still need to purchase cal's for those users accessing that server? Or am I wrong about that?
0
Creating Active Directory Users from a Text File
If your organization has a need to mass-create AD user accounts, watch this video to see how its done without the need for scripting or other unnecessary complexities.
Patrick BogersDatacenter platform engineer LindowsCommented:
Hi
You are right, while purchasing 2012R2 you need to have sufficient user OR device CALS.
(if you have more users then devices USER cals are preffered)
When you are planning to use the 2012 box as a Remote Desktop Server you would need to purchase additional licences.
0
MaheshArchitectCommented:
Your SBS 2003 CALs where not valid on Windows 2012 R2 server
You need to purchase user CALS for 2012 R2 as a fact and that will allow you to access any down grade servers such as 2012 \ 2008 R2 \2008 \ 2003
Since you have evaluation copy, you can use it without any issues and CALS during evaluation period
You may register \ activate 2012 R2 server on the internet with Microsoft which will give you 180 days free
Mahesh.
0
dpachecoAuthor Commented:
That's what I thought ;)
0
Patrick BogersDatacenter platform engineer LindowsCommented:
Hi
I forgot to say...
CALS needed depends on what version 2012 R2 you are purchasing.
(Standard, Datacenter require CALS, Foundation and Essentials do not.)
0
dpachecoAuthor Commented:
It's Standard, thanks.
0
Lee W, MVPTechnology and Business Process AdvisorCommented:
Please re-read the evaluation license - I'm fairly certain you are NOT PERMITTED to use it in production.
Second, you may have trouble/not be able to "activate" an eval copy once you get a key (I once tried it wouldn't do so).
0
MaheshArchitectCommented:
I have registered \ activated eval copy with 180 days free trial in production and later on activated it permanently
Evaluation copy is there so that you can evaluate all features \ functionality during evaluation no matter its in production or in test lab
0
Patrick BogersDatacenter platform engineer LindowsCommented:
I see where you are coming from Lee W but when is a test enviroment a production enviroment?
If you want to test how this new technology is performing in your excisting enviroment and you are not exploiting it to make money i feel you are free to name it 'test enviroment'
0
Lee W, MVPTechnology and Business Process AdvisorCommented:
@Mahesh:
In 2012? Or in 2008? A volume license key would not install on a 2012 install I had.
@Patricksr1972:
In this case, it's PROBABLY ok, so long as the data from the test isn't kept/used going forward.
0
dpachecoAuthor Commented:
We need to be able to test this with multiple users accessing the application otherwise it's not a real test and I don't want to reinstall again. From what I'm reading you can convert evaluation versions to full retail versions, there's instructions for this on technet.
0
Patrick BogersDatacenter platform engineer LindowsCommented:
@Mahesh, your point of view needs correction.
You are NOT allowed, for example, to have an EVAL version (say) 2012R2 Datacenter run in a datacenter hosting websites and services for your clients for which you are getting paid.
So yes it does matter in what kind of enviroment you are 'testing'
0
dpachecoAuthor Commented:
@Lee W - what difference does it make whether the data is kept or not? The data belongs to the client not Microsoft and once you've paid purchased the license for the software they have nothing to say about what data is on the server.
0
Lee W, MVPTechnology and Business Process AdvisorCommented:
Good luck - I tried as I stated and it would not accept the key. There could have been something odd in my case (I definitely was NOT using an OEM key) but you should be prepared if it doesn't work.
0
Lee W, MVPTechnology and Business Process AdvisorCommented:
I'm not the MS police and I'm not going to report you to anyone... I assume everyone wants to be as legal as they can - that everyone wants to be honest... The way I interpret the licensing of a trial version, you CANNOT use it in production. If you used it in evaluation but kept the "produced" data, then it would be in production.
0
dpachecoAuthor Commented:
We'll know soon enough if 2012 will work and will have 170 days or so to activate. Painful to have to start over but doable.
0
Patrick BogersDatacenter platform engineer LindowsCommented:
@Lee, thanks for contributing. I think it is usefull sharing experiences with eachother.
The key not accepting sounds to me like you downloaded a MSDN version or OEM trial for the software which does not recognise VLC keys.
@dpacheco, as long as you are not using features that would normally require additional CAL;s you will be fine.
0
dpachecoAuthor Commented:
We do want to be legal, I guess I'll consult with the company attorney.
0
dpachecoAuthor Commented:
I appreciate this information. We wouldn't have to have this conversation or hire attorneys to translate if Microsoft's licensing was simpler/clearer. ;) Thanks.
0
MaheshArchitectCommented:
@ Lee W
Check below article, you can convert edition between retail, VLK and OEM as long as you have appropriate key
http://technet.microsoft.com/en-us/library/dn303416.aspx
At any time after installing Windows Server 2012, you can freely convert it between a volume-licensed version, a retail version, or an OEM version. The edition remains the same during this conversion.
To do this, from an elevated command prompt, run:
slmgr /ipk <key>
Where <key> is the appropriate volume-license, retail, or OEM product key.
@Patricksr1972
Microsoft never says that you can't use evaluation version in production (Please show me any link if you have)
You have to make the OS authentic after your trial period expires
Note that trial (eval) period is also a license to use server software with out any issues during trial period
You must \ should register server with authentic key after trial period expires
Now you have to have enough server standard CALS to access server software from clients, that is different story
Mahesh.
0
All Courses
From novice to tech pro — start learning today.
|
{
"url": "https://www.experts-exchange.com/questions/28408859/windows-server-2012-r2-evaluation.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "186150",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RV23URH3JOZEFUTG5CQI3HSG5MGM5LFM",
"WARC-Concurrent-To": "<urn:uuid:ad3f1c02-36fd-4619-996d-4adfe9231827>",
"WARC-Date": "2018-02-25T00:42:45Z",
"WARC-IP-Address": "104.20.168.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BHFMN542O6HHFIPK5U2MRVYMCKVUT6HP",
"WARC-Record-ID": "<urn:uuid:7b28edd3-56dc-4e4f-9977-272fe1f703f2>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/28408859/windows-server-2012-r2-evaluation.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f90c8635-c4cd-4a01-a110-9c34bd09575e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-169-167-79.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,
34,
35,
544,
550,
565,
587,
589,
672,
675,
676,
796,
798,
800,
855,
999,
1001,
1003,
1029,
1200,
1202,
1251,
1252,
1420,
1421,
1423,
1484,
1487,
1488,
1576,
1638,
1755,
1757,
1759,
1785,
1846,
1992,
1993,
2093,
2094,
2202,
2203,
2211,
2213,
2215,
2241,
2266,
2268,
2270,
2331,
2334,
2335,
2354,
2418,
2489,
2491,
2493,
2519,
2542,
2544,
2546,
2606,
2712,
2713,
2834,
2836,
2838,
2864,
2981,
2982,
3122,
3124,
3126,
3187,
3280,
3281,
3461,
3463,
3465,
3525,
3534,
3621,
3622,
3638,
3735,
3737,
3739,
3765,
4036,
4038,
4040,
4101,
4147,
4148,
4329,
4396,
4398,
4400,
4426,
4661,
4663,
4665,
4725,
4925,
4927,
4929,
4989,
5324,
5326,
5328,
5354,
5479,
5481,
5483,
5544,
5633,
5768,
5769,
5881,
5883,
5885,
5911,
5983,
5985,
5987,
6013,
6175,
6177,
6179,
6205,
6213,
6322,
6379,
6380,
6581,
6582,
6632,
6633,
6650,
6725,
6726,
6727,
6742,
6853,
6919,
7030,
7110,
7223,
7224,
7232,
7234,
7246,
7247
],
"line_end_idx": [
34,
35,
544,
550,
565,
587,
589,
672,
675,
676,
796,
798,
800,
855,
999,
1001,
1003,
1029,
1200,
1202,
1251,
1252,
1420,
1421,
1423,
1484,
1487,
1488,
1576,
1638,
1755,
1757,
1759,
1785,
1846,
1992,
1993,
2093,
2094,
2202,
2203,
2211,
2213,
2215,
2241,
2266,
2268,
2270,
2331,
2334,
2335,
2354,
2418,
2489,
2491,
2493,
2519,
2542,
2544,
2546,
2606,
2712,
2713,
2834,
2836,
2838,
2864,
2981,
2982,
3122,
3124,
3126,
3187,
3280,
3281,
3461,
3463,
3465,
3525,
3534,
3621,
3622,
3638,
3735,
3737,
3739,
3765,
4036,
4038,
4040,
4101,
4147,
4148,
4329,
4396,
4398,
4400,
4426,
4661,
4663,
4665,
4725,
4925,
4927,
4929,
4989,
5324,
5326,
5328,
5354,
5479,
5481,
5483,
5544,
5633,
5768,
5769,
5881,
5883,
5885,
5911,
5983,
5985,
5987,
6013,
6175,
6177,
6179,
6205,
6213,
6322,
6379,
6380,
6581,
6582,
6632,
6633,
6650,
6725,
6726,
6727,
6742,
6853,
6919,
7030,
7110,
7223,
7224,
7232,
7234,
7246,
7247,
7294
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7294,
"ccnet_original_nlines": 152,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40800562500953674,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04775280877947807,
"rps_doc_frac_lines_end_with_ellipsis": 0.006535950116813183,
"rps_doc_frac_no_alph_words": 0.17134830355644226,
"rps_doc_frac_unique_words": 0.3375314772129059,
"rps_doc_mean_word_length": 4.879932880401611,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.0021067399065941572,
"rps_doc_unigram_entropy": 5.382094383239746,
"rps_doc_word_count": 1191,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0844803899526596,
"rps_doc_frac_chars_dupe_6grams": 0.0844803899526596,
"rps_doc_frac_chars_dupe_7grams": 0.03578801825642586,
"rps_doc_frac_chars_dupe_8grams": 0.03578801825642586,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01135582011193037,
"rps_doc_frac_chars_top_3gram": 0.033035099506378174,
"rps_doc_frac_chars_top_4gram": 0.03355126827955246,
"rps_doc_books_importance": -625.233642578125,
"rps_doc_books_importance_length_correction": -625.233642578125,
"rps_doc_openwebtext_importance": -326.4150085449219,
"rps_doc_openwebtext_importance_length_correction": -326.4150085449219,
"rps_doc_wikipedia_importance": -234.58151245117188,
"rps_doc_wikipedia_importance_length_correction": -234.58151245117188
},
"fasttext": {
"dclm": 0.029234470799565315,
"english": 0.93129962682724,
"fineweb_edu_approx": 1.31352698802948,
"eai_general_math": 0.042939480394124985,
"eai_open_web_math": 0.20259499549865723,
"eai_web_code": 0.008397700265049934
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.442",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "344.730285",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Martial law"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,277,718,041,506,972,700 |
HomeComputers15 advance keyboard shortcuts every Microsoft PowerPoint user should know
15 advance keyboard shortcuts every Microsoft PowerPoint user should know
Use MS PowerPoint a lot? Here are some keyboard shortcuts which will come in handy.
MS PowerPoint is a program that is included in the Microsoft Office suite. It is used to make presentations for personal and professional purposes. Gradually, with each version, the program is becoming more creative and interactive. Various other features are added by Microsoft in PowerPoint which massively increased the requirement and use of this MS Office program. Here are some of the Best shortcuts to use while making a presentation on Powerpoint.
- Advertisement -
During the presentation, if one feels like having a black screen or blank screen, it is easy to do it in MS PowerPoint. One can press W for a white screen or B for a blank or black screen.
• Laser Pointer
During a presentation, a user can change the pointer into a visual laser pointer by pressing Ctrl + L.
• Draw on presentation
It’s easy to draw on your presentation directly without using any external device. The user can use the shortcut Ctrl + P to change the pointer into the pen and conveniently draw over the presentation.
Read Also: 6 Best websites where you can get free templates
• Inserting a Hyperlink
Select text or object in a slide and then press Ctrl + K to open the Insert Hyperlink in the dialogue box to turn it into a link. One can also press Ctrl + K without selecting anything first, then specify where to add a hyperlink later.
• Change the order of a slide
By Pressing Ctrl + Up Arrow to move the selected slide one position up in the presentation and the reverse can be done by pressing Ctrl + Down Arrow to move it one later in the presentation.
• Change Font
Users can press Ctrl + Shift + Right Arrow to increase the size of the selected text a little at a time. To make the font smaller: Press Ctrl + Shift + Left Arrow to decrease the size of the selected text.
• Alignment
Press Ctrl + E to centre the selected paragraph. For Left alignment of text: Press Ctrl + L to the selected paragraph. To right align select the paragraph and press Ctrl + R.
• Justify text
If the user feels that the text is going out of their page margin or is not aligned properly one can use Justify. Press Ctrl + J to justify the selected paragraph. This causes the text to auto-fit to the left and right margins of the slide.
Read Also: JBL Commercial makes its debut in India with the launch
• Subscript and superscript
For superscripting, a user can press Ctrl and the Plus sign to turn the selected text into superscript. Subscribing is easy as well Press Ctrl + = to turn the selected text into a subscript.
• Check spelling
Many consumers make a lot of mistakes while making a presentation and finding a mistake one by one seems very hectic. Microsoft thought about it and made a shortcut for it. By pressing F7 users can run a built-in spell-check.
• Search within a presentation
Want to search for a specific text on your presentation? Get it done by pressing Ctrl+F. This will open a dialogue box where you can search the desired word. One can also replace the word with some other with the same dialogue box.
Read Also: WhatsApp revealed the cheat codes for Web and Desktop apps
• Help
Microsoft has its own help support built in the software which can be activated by pressing F1.
• Redo and Undo
Did a mistake and want to reverse the action? By pressing Ctrl+Z one can Undo the action. To do vice versa Redo option is used and can be activated by pressing Ctrl+Y. There are few actions that cannot be undone or redone in such a case nothing will happen even if you press the shortcut.
• Cancel
Esc shortcut is used to abort any task you don’t want to complete. It can also be used to exit the presentation.
• Cut, Copy and Paste
Press Ctrl + C to copy text to the clipboard, press Ctrl + X to cut, and Press Ctrl + V to paste the content of the clipboard at the cursor location.
These shortcuts are very easy to use and will come in handy in making a good presentation. These shortcuts will not only save a ton of time but also increase your productivity.
For the latest gadget and tech news, and gadget reviews, follow us on TwitterFacebook and Instagram. For newest tech & gadget videos subscribe to our YouTube Channel. You can also stay up to date using the Gadget Bridge Android App. You can find the latest car and bike news here.
- Advertisement -
LEAVE A REPLY
Please enter your comment!
Please enter your name here
- Advertisement -
Follow Us
119,407FansLike
8,924FollowersFollow
4,767FollowersFollow
5,090SubscribersSubscribe
Must Read
Google Pixel 6 and Pixel 6 Pro have been officially released: Specifications and pricing details inside
Google Pixel 6 and Pixel 6 Pro have been officially released:...
0
Software giant Google today officially announced the launch of the Pixel smartphones globally. The new series includes two phones- the Google Pixel 6 and...
- Advertisement -
|
{
"url": "https://www.gadgetbridge.com/computers/15-advance-keyboard-shortcuts-every-microsoft-powerpoint-user-should-know/",
"source_domain": "www.gadgetbridge.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "394470",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HH27YK3BZYNSTZPFJXLZH26WEFQU6DWZ",
"WARC-Concurrent-To": "<urn:uuid:3228149a-d43f-43fc-9594-fcf25c84aeec>",
"WARC-Date": "2021-10-20T03:38:01Z",
"WARC-IP-Address": "104.21.43.114",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VLNS376Z2GILA6CCH27ERVENTLIPR2YA",
"WARC-Record-ID": "<urn:uuid:0308e824-f608-4f23-afb7-3d75edba2115>",
"WARC-Target-URI": "https://www.gadgetbridge.com/computers/15-advance-keyboard-shortcuts-every-microsoft-powerpoint-user-should-know/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:945c7105-f5e5-4cc5-8037-bb997767c4ff>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-40\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,
87,
88,
162,
163,
247,
248,
704,
705,
723,
724,
913,
914,
932,
933,
1036,
1037,
1062,
1063,
1265,
1266,
1327,
1328,
1354,
1355,
1592,
1593,
1625,
1626,
1817,
1818,
1835,
1836,
2042,
2043,
2057,
2058,
2233,
2234,
2251,
2252,
2493,
2494,
2562,
2563,
2593,
2594,
2785,
2786,
2805,
2806,
3032,
3033,
3066,
3067,
3299,
3300,
3370,
3371,
3381,
3382,
3478,
3479,
3497,
3498,
3787,
3788,
3799,
3800,
3913,
3914,
3938,
3939,
4089,
4090,
4267,
4268,
4549,
4550,
4568,
4569,
4583,
4584,
4611,
4639,
4640,
4658,
4659,
4669,
4670,
4686,
4707,
4728,
4754,
4755,
4765,
4766,
4870,
4871,
4936,
4937,
4939,
5096
],
"line_end_idx": [
87,
88,
162,
163,
247,
248,
704,
705,
723,
724,
913,
914,
932,
933,
1036,
1037,
1062,
1063,
1265,
1266,
1327,
1328,
1354,
1355,
1592,
1593,
1625,
1626,
1817,
1818,
1835,
1836,
2042,
2043,
2057,
2058,
2233,
2234,
2251,
2252,
2493,
2494,
2562,
2563,
2593,
2594,
2785,
2786,
2805,
2806,
3032,
3033,
3066,
3067,
3299,
3300,
3370,
3371,
3381,
3382,
3478,
3479,
3497,
3498,
3787,
3788,
3799,
3800,
3913,
3914,
3938,
3939,
4089,
4090,
4267,
4268,
4549,
4550,
4568,
4569,
4583,
4584,
4611,
4639,
4640,
4658,
4659,
4669,
4670,
4686,
4707,
4728,
4754,
4755,
4765,
4766,
4870,
4871,
4936,
4937,
4939,
5096,
5113
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5113,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3819095492362976,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02613065019249916,
"rps_doc_frac_lines_end_with_ellipsis": 0.019417479634284973,
"rps_doc_frac_no_alph_words": 0.13567839562892914,
"rps_doc_frac_unique_words": 0.3775743842124939,
"rps_doc_mean_word_length": 4.599542140960693,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0.0020100499968975782,
"rps_doc_unigram_entropy": 5.163705348968506,
"rps_doc_word_count": 874,
"rps_doc_frac_chars_dupe_10grams": 0.024875620380043983,
"rps_doc_frac_chars_dupe_5grams": 0.0920398011803627,
"rps_doc_frac_chars_dupe_6grams": 0.08009950071573257,
"rps_doc_frac_chars_dupe_7grams": 0.05572139099240303,
"rps_doc_frac_chars_dupe_8grams": 0.05572139099240303,
"rps_doc_frac_chars_dupe_9grams": 0.05572139099240303,
"rps_doc_frac_chars_top_2gram": 0.029104480519890785,
"rps_doc_frac_chars_top_3gram": 0.014925369992852211,
"rps_doc_frac_chars_top_4gram": 0.011194029822945595,
"rps_doc_books_importance": -441.7737731933594,
"rps_doc_books_importance_length_correction": -441.7737731933594,
"rps_doc_openwebtext_importance": -258.5532531738281,
"rps_doc_openwebtext_importance_length_correction": -258.5532531738281,
"rps_doc_wikipedia_importance": -190.1430206298828,
"rps_doc_wikipedia_importance_length_correction": -190.1430206298828
},
"fasttext": {
"dclm": 0.020134689286351204,
"english": 0.8647007346153259,
"fineweb_edu_approx": 1.8524504899978638,
"eai_general_math": 0.0692022368311882,
"eai_open_web_math": 0.217862069606781,
"eai_web_code": 0.003311040112748742
}
}
|
{
"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": "651.15",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Office management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "12",
"label": "Listicle"
}
},
"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,944,991,410,960,038,000 |
15 votes
Let me tell you why only a dumbass would get into NFT games
27 comments
1. [14]
skybrian
Link
A long, profane rant about why, as a game designer, NFT's are a bad idea. [...] [...]
A long, profane rant about why, as a game designer, NFT's are a bad idea.
“It makes me feel good to have a thing because no one else can have it” is, I’d argue, not something many people feel. I do not want to create a game based around haves and have nots — if I am making a game where a core mechanic is about making people feel bad that they don’t have something and can never get it, I think that makes me a bad person and a worse game designer. My job, as a designer, is to create aspiration and desire, to make you excited to engage with my game. If I build my game around an economic model that relies on making thousands of you feel bad so one of you can feel good, I have failed you as a game designer.
[...]
The reason none of the Mario Kart clones that exist sell as well as Mario Kart with their knockoff characters is because Mario is a bigger brand. No one wants to buy Mario Kart to find that they can’t get Mario, and no one is going to buy a kart racing game they’ve never heard of where the pitch is that only one of you can ever have Mario and that’s a 1 in 39,000,000 chance that it’s going to be you.
These ideas are at odds with each other. To make a ton of money in NFTs, there has to be a ton of consumers, but to give NFTs value, [an] NFT has to be scarce. You cannot make a game where there are only 200 unique characters and also 39,000,000 unique customers. This hypothetical Mario Kart With NFTs could literally never exist. It’s at odds with itself.
[...]
Who should bear the cost of this?
Well, it’s not gonna be me, because why would I do this — why would I spend literally billions of dollars so you can always keep your loot in future games with absolutely no compensation other than the first time you spend $60 on the first game decades ago?
So are you going to spend literally $50,000 to get your gun moved from one game to the other? If you are, I want you to at least consider how sustainable this business model is — because there are not Call of Duty player numbers with the kind of money to spend updating a gun for a new game.
6 votes
1. [13]
stu2b50
Link Parent
I don't really think the game design parts of this argument make all that much sense, because this pretty much already exists. There's a gigantic CS:GO weapon skin market, for example, where CS:GO...
I don't really think the game design parts of this argument make all that much sense, because this pretty much already exists. There's a gigantic CS:GO weapon skin market, for example, where CS:GO skins are scarce, people pay massive amounts of money for them, the market is surprisingly liquid, and people use them for money laundering and avoiding regulations (e.g all the CS:GO skin online casinos). Lots of very popular and successful games that have mechanics or even revolve around FOMO of scarce digital items!
It may be against his personal aesthetic - a very understandable position - but clearly people eat it up, and it's not like only shady developers do it (Valve is a reputable developer by most metrics!).
“It makes me feel good to have a thing because no one else can have it” is, I’d argue, not something many people feel.
That's a very very common feeling for people to have in both games and real life!
The more convincing one is just... yeah, Valve did it with a database and some business logic on their backend, why do you need a blockchain. What about items that persist between multiple games? Surely the developers of those games can collaborate? If they're like actively hostile and trying to screw over the other I don't see why they'd want to share digital doodads at all, so for this premise to exist they must want to collaborate?
Well, that's for public blockchains. For a group of closed individuals (like a handful of game companies), a private hashchain where you do consensus with BFT is both efficient and not the worst idea, although again I'm not quite sure why you'd collaborate with a company you trust so little that you think they might fabricate your shared digital items.
10 votes
1. skybrian
Link Parent
Part of his argument seems to be that it's just hard for different game companies to collaborate even if they wanted to, due to things like IP licensing issues, different game mechanics (otherwise...
Part of his argument seems to be that it's just hard for different game companies to collaborate even if they wanted to, due to things like IP licensing issues, different game mechanics (otherwise they'd be clones), improvements to game technology over the years, differences in business models making it unclear who pays for what and how to split revenue, wanting to control how their own game evolves, and so on.
There are certainly lots of games with mods but mods aren't portable. The question is how to come up with standards so that any game engine that implements the same standard isn't basically a clone as far as game mechanics are concerned.
2 votes
2. TheJorro
Link Parent
The CSGO skins thing is talked about directly in the article, and a specific situation that happened around them in the professional scene too. He actually says the same thing you do here, that...
The CSGO skins thing is talked about directly in the article, and a specific situation that happened around them in the professional scene too. He actually says the same thing you do here, that the NFT approach is exactly the same thing that happened with the CSGO skins, specifically like the scandal that happened with them:
But — and this is a bit more sinister — because it’s not using real, traceable cash, the goal is to obfuscate who the owner is. Remember the CSGO gambling scandal, where a bunch of youtubers pretended to win big on CSGO skin trading websites, encouraging children to pay real money to gamble on various weapon cosmetics? Yeahhhh… about that. Those guys all had stake in the websites in question; they manipulated the back end to make it look like anyone could get lucky without disclosing they profited off the websites they were running. The goal was to trick stupid people into going “oh I can make money here” and then finding out that well, no, no you cannot. NFTs are literally the exact same thing.
That’s happening in the NFT space now. Kinda weird how the first ‘big’ NFT buyer is super anonymous, huh?
Well… that kinda thing’s been happening a lot. A lot of the ‘big’ NFT sales going down involve people selling things to themselves, attempting to drive up demand. Like, hey, last week, a guy sold an NFT for the ethereum equivalent of $528 million USD. Only… he sold it to himself. To drive the price up. To convince people his stupid jpg of a lion was worth a lot of money.
Lots of games may be exploiting this FOMO and generating money out of it but they're not exactly well-respected for it. I'm not sure how the success of capitalistic exploitation trumps the argument of capitalistic exploitation being a pretty shady thing to do and is easily exploited from the shadows.
The actual argument here isn't about the viability of NFTs in games, it's about the ethics of it. The full paragraph of that quote there actually has the thesis in bold:
“It makes me feel good to have a thing because no one else can have it” is, I’d argue, not something many people feel. I do not want to create a game based around haves and have nots — if I am making a game where a core mechanic is about making people feel bad that they don’t have something and can never get it, I think that makes me a bad person and a worse game designer. My job, as a designer, is to create aspiration and desire, to make you excited to engage with my game. If I build my game around an economic model that relies on making thousands of you feel bad so one of you can feel good, I have failed you as a game designer.
1 vote
3. [10]
meff
Link Parent
A consortium of game companies running a private chain for managing digital game goods might be pretty cool. New game studios can opt into at least respecting the rules of the chain, and can...
Well, that's for public blockchains. For a group of closed individuals (like a handful of game companies), a private hashchain where you do consensus with BFT is both efficient and not the worst idea, although again I'm not quite sure why you'd collaborate with a company you trust so little that you think they might fabricate your shared digital items.
A consortium of game companies running a private chain for managing digital game goods might be pretty cool. New game studios can opt into at least respecting the rules of the chain, and can eventually run mining infrastructure if they feel they wish to help secure the chain.
1. [9]
stu2b50
Link Parent
If it's a private chain you don't need to use PoW, and instead can use one of the traditional algorithms for the Byzantine Fault Tolerance problem like pBFT.
can eventually run mining infrastructure
If it's a private chain you don't need to use PoW, and instead can use one of the traditional algorithms for the Byzantine Fault Tolerance problem like pBFT.
4 votes
1. [7]
hook
Link Parent
TBH, if it’s a private chain, you might just go for a more standard DB and not waste all the energy. The two most important aspects of a blockchain compared to other DBs are 1) all transactions...
TBH, if it’s a private chain, you might just go for a more standard DB and not waste all the energy.
The two most important aspects of a blockchain compared to other DBs are 1) all transactions are recorded so no data is lost, and 2) it is built for a situation where you need to trust the system, since you cannot trust all the actors, so the votes are divided up. If you have enough votes, you can still rewrite stuff, so a centralised chain where the votes are all in the hands of one (or very few) is in effect very close to just a standard DB.
6 votes
1. [6]
stu2b50
Link Parent
The hypothetical with a private chain is, say, that there's a 6-7 large group of major game companies (EA, Activision, etc). They trust each other, since they're big and with reputation to lose...
The hypothetical with a private chain is, say, that there's a 6-7 large group of major game companies (EA, Activision, etc). They trust each other, since they're big and with reputation to lose and things that can be sued.
They want to add in a smaller dev to their virtual doodad ecosystem. But they're worried about said smaller dev counterfeiting rare doodads or whatever. Probably just wouldn't want to work with them, but if they did, so long as the unknowns are a small enough proportion of the voters (which can be done for any N smaller devs just by giving the big boys more votes), they can trust in the system that if they allocate 20 doodads that the smaller dev can make, that will be how many doodads they mint.
Probably contrived but a genuine niche.
In terms of energy, it'd be on the usual scale of "doesn't matter" - pBFT and it's brethren aren't particularly expensive. Whether or not one of those game servers are written in python or go would be a bigger detriment.
There are actual production databases that effectively use a hashchain + pBFT to maintain consensus on the DB journal across multiple nodes like https://bedrockdb.com.
2 votes
1. skybrian
Link Parent
Does Bedrock DB really use a Byzantine algorithm to achieve consensus? I was able to confirm that they use Paxos but I haven’t found anything about them using Byzantine Paxos. I was under the...
Does Bedrock DB really use a Byzantine algorithm to achieve consensus? I was able to confirm that they use Paxos but I haven’t found anything about them using Byzantine Paxos.
I was under the impression that distributed databases don’t usually guard against Byzantine faults. Paxos or Raft is usually good enough.
1 vote
2. [4]
hook
Link Parent
I still fail to see why your usecase needs a blockchain. (sorry for being terse, on mobile and it' late)
I still fail to see why your usecase needs a blockchain.
(sorry for being terse, on mobile and it' late)
1. [3]
stu2b50
Link Parent
At this point blockchain has become too charged to be a useful phrase. Why do we want a hashchain? Immutability, that way once everyone has a record up to X point, everyone can be sure that, if...
At this point blockchain has become too charged to be a useful phrase.
Why do we want a hashchain? Immutability, that way once everyone has a record up to X point, everyone can be sure that, if the hashes follow each other, everyone has the same records. That's not too strange - that's in effect part of what a branch in Git is. If you just have a list of records, it becomes easier to make mistakes. Let's say we have the records "insert A; mutate B; insert C". If one node just gets "insert A; insert C" - they can easily tell that something has gone wrong, because once you start hashing things they don't match up (without B as the predecessor the hash for C would be wrong).
It's a useful property, and practically free on modern computers to run the hashes.
Why a consensus algorithm? Well, I mean, this is the definition of the byzantine problem, no?
In its simplest form, a number of generals are attacking a fortress and must decide as a group only whether to attack or retreat. Some generals may prefer to attack, while others prefer to retreat. The important thing is that all generals agree on a common decision, for a halfhearted attack by a few generals would become a rout, and would be worse than either a coordinated attack or a coordinated retreat.
The problem is complicated by the presence of treacherous generals who may not only cast a vote for a suboptimal strategy, they may do so selectively. For instance, if nine generals are voting, four of whom support attacking while four others are in favor of retreat, the ninth general may send a vote of retreat to those generals in favor of retreat, and a vote of attack to the rest. Those who received a retreat vote from the ninth general will retreat, while the rest will attack (which may not go well for the attackers). The problem is complicated further by the generals being physically separated and having to send their votes via messengers who may fail to deliver votes or may forge false votes.
This type of problem comes up in many areas (although the non-byzantine family of paxos algorithms is more common given that it's usually more "one or more machines in a group is dead" rather than actively malicous).
Together it's a set of fairly common technologies, that's efficient to run, which accomplishes attributes that are desirable for the situation (easy to verify correctness, append only, some resilience to attackers) of inviting entities you don't fully trust to add to a journal.
Perhaps you could think of it like a Github repo with an overly complicated PR system - the master is the hashchain that everyone agrees to, and to do pull requests the set of maintainers have a somewhat complicated voting system to agree to merge or not merge.
2 votes
1. [2]
hook
Link Parent
I understand the concept, but thank you for explaining the Byzantine problem to me – I haven’t found the time to look that one up and it’s been popping up often. The issue I have with it all is...
I understand the concept, but thank you for explaining the Byzantine problem to me – I haven’t found the time to look that one up and it’s been popping up often.
The issue I have with it all is that while it may solve the problem, the question is whether it’s 1) an actual problem in the use case and 2) it is the only and best solution.
E.g. going back to your chain of doodads:
Why would IndieDev need full access to the DB of doodads? How does the blockchain prevent IndieDev from “counterfeiting” assets (they can still copy and change a pixel for it to have a different hash value)? Why would they even need a vote in the internals of the DB? Especially if their vote is pondered down.
If BigGamesGroups don’t trust them, there’s many other ways for them to keep the DB and assets in check, and giving IndieDev the needed read and limited write access via an API to a normal DB. You can set as many limitation or permissions there as you want.
If the issue is with IndieDev not trusting BigGamesGroups, then with their (esp. pondered down) minority vote, their influence is still negligible. Perhaps the idea is that all the IndieDevGroups together could have more votes than all the BigGamesGroups, but I don’t see that scenario IRL in the first place. And even if, it would probably result in a fork. Again, nothing here that the blockchain prevented or made easier.
Maybe the issue is that we want to make sure that the transfer of such rare and expensive doodads is trusted. And here you just need to look at all the BTC/ETH/NFT/… hoaxes and scams out there – the blockchain not only does not prevent them, but the immutability actually facilitates them and makes any remediation much much harder. You can trust that the transaction happened and what it was, but pretty much everything around that is wild wild west.
I’ve been there when Bitcoin Pizza happened, and while I agree that blockchains are a very powerful technology (if implemented right!) I’ve yet to see an actual problem that a blockchain solves better than pre-existing solutions.
When it comes to GitHub, it’s totally possible to rewrite Git history. As long as people don’t clone or fork before, don’t notice or just don’t care enough about it. (For an actual blockchain example see also The DAO, also interesting from the voting, transaction reliability, scamming, etc. PoVs).
Also in general, when we’re talking about serious load (even those NFT JPEGs), it is often not on the blockchain itself, but on a separate medium and the transaction in the block just points to the load (e.g. via URL).
1. stu2b50
Link Parent
Again, I think you're letting "blockchain" bleed through. For instance, yeah, you can rewrite history in Git by just accepting a different chain. And so you can in this scheme! You just need a...
Again, I think you're letting "blockchain" bleed through.
For instance, yeah, you can rewrite history in Git by just accepting a different chain. And so you can in this scheme! You just need a majority of votes to take the new chain. But it means that for a given chain, you can't rewrite history, and provides an error detection for the integrity of said chain. Additionally, the chain is only really used as a journaling mechanism - it doesn't mean you can't do undo things. DB journals are also append only for the purpose of ACID compliance, yet as you have noticed, there is no issue undoing things in that scheme because "undoing" a transaction is business logic - these are disconnected concepts.
After journaling the business logic records of "X did Z to Y", they would store the records with whatever database they want. That doesn't really have anything to do with each other. The chain record is on a higher level of abstraction in this case, since we're not trying to use it as a general datastore as in a blockchain currency.
If BigGamesGroups don’t trust them, there’s many other ways for them to keep the DB and assets in check, and giving IndieDev the needed read and limited write access via an API to a normal DB. You can set as many limitation or permissions there as you want.
The difference is that this assumes complete trust in that BigGameGroup as a collective by both the members of the BigGameGroup and the indie devs. The private chain scheme would only require implicit trust of however large amount of members the BFT solution chosen requires.
It also requires that, at some point, a single entity, presumably either one of the big corporations or a new group formed by it, actually maintains that API on a day to day. Whereas, for transparency purposes, each member may wish to run their own instance. In which case, you could just have everyone run a Paxos BFT algorithm without the hashchain layer but you have to store them somewhere, seems like a light lift to run and store a SHA256 hash per record for data resilience reasons.
Again, it is a contrived situation - the more likely situation in reality is something like Valve workshop, where Valve manages the digital doodads and indies just gotta roll with it. If companies want to partner on a deeper level that Valve doesn't trust... then they don't add them, because it's probably not that much of a value add to add potentially hostile companies to the ecosystem.
I’ve yet to see an actual problem that a blockchain solves better than pre-existing solutions
There's always bedrockdb - hard to say it's straight up better than a distributed MySQL database, but it does provide different benefits and is battle tested.
2. meff
Link Parent
Yeah sorry, I wrote "mining" there without thinking too hard about what I was writing. Indeed you don't need to use a PoW algorithm here so you don't need to mine.
Yeah sorry, I wrote "mining" there without thinking too hard about what I was writing. Indeed you don't need to use a PoW algorithm here so you don't need to mine.
2. [13]
meff
Link
I'm curious about what the point is of posting these sorts of articles on this site. I did a simple search on here about NFTs, and almost all of the sentiment toward it is negative. This is...
I'm curious about what the point is of posting these sorts of articles on this site. I did a simple search on here about NFTs, and almost all of the sentiment toward it is negative. This is another negative post, this time profanity laced, about NFTs. Is the goal to bring out arguments in favor of NFTs? I don't see what the purpose of posting content like this is.
4 votes
1. [2]
skybrian
Link Parent
I find a lot of finance stuff fascinating even if I wouldn't participate myself. For example, I'm a big fan of Matt Levine even though he often writes about crazy stuff, sometimes literally fraud....
I find a lot of finance stuff fascinating even if I wouldn't participate myself. For example, I'm a big fan of Matt Levine even though he often writes about crazy stuff, sometimes literally fraud. I guess it's sort of like how movies about bank robberies are popular?
Also, sometimes the crazy stuff involves edge cases, which tend to raise philosophical issues. That's kind of fun too.
Cryptocurrency is at the intersection of finance, computer algorithms, and people doing dumb stuff. As a spectator, what's not to like? (Well, mostly a spectator. I do have a small amount of Ethereum that I'm not doing anything with.)
Game design and the game business is another thing I'm interested in even though I play very few games most of the time, and I'm quite out of the loop. So I thought this rant was interesting and don't mind the profanity too much.
But admittedly, the author does hold cryptocurrency in contempt. If someone thinks the author is making bad arguments I think it would be understandable to be upset over it. I'm not sure I really want to get into an argument over whether it truly deserves contempt, though?
And then there is the question of what's worth posting on a general interest site, which I'm quite unsure about. I just thought it was interesting.
9 votes
1. meff
Link Parent
Thanks this actually makes a lot of sense to me. I just wished the author had used more novel arguments, but fair enough, and some of the discussion being generated is pretty interesting. Cheers!
Thanks this actually makes a lot of sense to me. I just wished the author had used more novel arguments, but fair enough, and some of the discussion being generated is pretty interesting. Cheers!
2 votes
2. [9]
Seven
Link Parent
A lot of people on Tildes have financial interests staked in crypto and NFTs, so these sorts of articles are a pushback to the positive sentiment driven by those members. It's also a pushback to...
A lot of people on Tildes have financial interests staked in crypto and NFTs, so these sorts of articles are a pushback to the positive sentiment driven by those members. It's also a pushback to the general excitement in the tech industry over crypto.
5 votes
1. [8]
meff
Link Parent
Could you quantify this? I took a search on Tildes and found almost universally negative sentiment. Where is this positive sentiment? It's not on HackerNews nor on Lobste.rs. News articles outside...
A lot of people on Tildes have financial interests staked in crypto and NFTs, so these sorts of articles are a pushback to the positive sentiment driven by those members.
Could you quantify this? I took a search on Tildes and found almost universally negative sentiment.
It's also a pushback to the general excitement in the tech industry over crypto.
Where is this positive sentiment? It's not on HackerNews nor on Lobste.rs. News articles outside of the cryptocurrency space routinely dump on NFTs and cryptocurrency as a whole. I guess if you hang out on cryptocurrency Twitter you'll find a pro-NFT bubble, but you can probably find a pro-X bubble for anything on Twitter.
I'm wary of repeatedly posting articles that dunk on the same viewpoint and are largely agreed upon by a community. At its worst, this sort of behavior creates an out-group (in this case, folks in the NFT world) that can be rallied against in the in-group (Tilders?) to create a sort of group identity and echo chamber dynamics. At its best it's rehashing the same viewpoints over and over again and crowds out more interesting/nuanced discussion.
In pretty much every other technical site I'm on, cryptocurrency discussions are largely low-quality emotional rebuttals to low-quality articles criticizing cryptocurrencies which are posted because posters know the site agrees with these dynamics. I'd like to avoid those circular dynamics on this site if possible; they don't lead to good or illuminating discussion.
7 votes
1. [2]
skybrian
Link Parent
I think a lot of the positive sentiment might be outside our filter bubble. We keep hearing about it in the news and prices keep rising. Or fluctuating, anyway.
I think a lot of the positive sentiment might be outside our filter bubble. We keep hearing about it in the news and prices keep rising. Or fluctuating, anyway.
2 votes
1. Wes
Link Parent
I suspect it's not so much that our bubbles are negative, but their bubbles are positive. It seems like outside of these specific communities, the general sentiment is skeptical of...
I suspect it's not so much that our bubbles are negative, but their bubbles are positive. It seems like outside of these specific communities, the general sentiment is skeptical of cryptocurrencies, and outright hostile to NFTs.
Rightly so, in my opinion.
2 votes
2. [5]
Seven
Link Parent
This discussion from August is what first comes to mind for me personally when I think of positive crypto sentiment here on Tildes. There were three different users defending the NFTs, and while...
Could you quantify this? I took a search on Tildes and found almost universally negative sentiment.
This discussion from August is what first comes to mind for me personally when I think of positive crypto sentiment here on Tildes. There were three different users defending the NFTs, and while they were certainly in the minority, they received a fair amount of votes and support, more than I would have expected. I wouldn't call the general feeling about crypto on Tildes to be universally negative, but it is indeed mostly negative.
Where is this positive sentiment?
I see excitement over crypto constantly in my corporate Slack server (my company has over 50,000 employees). While it's not exactly outright promotion of cryptocurrencies/NFTs, a lot of my coworkers around the globe seem to be very excited over blockchain technology and crypto in that sense. Just today I found someone asking about people to follow on social media for information about web3, DAOs, and Ethereum Name Service.
At its best it's rehashing the same viewpoints over and over again and crowds out more interesting/nuanced discussion.
I'm going to take a slightly controversial position here for Tildes and say that even if this is true, I still think it's important to actively take a stance against crypto even if it produces subpar discussions. I think the existence and popularity of crypto is a material threat to the climate, and I think it's really important to do whatever we can to protect the climate, even if that is just making sure no one touches crypto on Tildes. I live on the planet, and I don't like what crypto is doing to accelerate its destruction. Because of that, I think it's more important that we establish a community consensus against crypto than to ensure quality discussions around it. Of course, I would like both, and I think we have seen good discussions around crypto generally even if most people are on the same side of "crypto is bad and a scam".
2 votes
1. [4]
meff
Link Parent
Yes I disagree with this position. Creating a negative consensus around an issue because members dislike the issue is pretty much the textbook definition of an echo chamber; it's the same thing...
I'm going to take a slightly controversial position here for Tildes and say that even if this is true, I still think it's important to actively take a stance against crypto even if it produces subpar discussions.
Yes I disagree with this position. Creating a negative consensus around an issue because members dislike the issue is pretty much the textbook definition of an echo chamber; it's the same thing that happens on sites with lower quality discussion. I think the ability to have nuanced discussion even about topics you disagree with is an important part of creating a high quality discussion space.
1. [3]
Seven
Link Parent
It's not just a disagreement though. Cryptocurrencies are accelerating the destruction of the planet. I live on the planet, so I don't want that to happen. It's like a lesser version of the...
It's not just a disagreement though. Cryptocurrencies are accelerating the destruction of the planet. I live on the planet, so I don't want that to happen. It's like a lesser version of the situation of hate speech. I don't just "disagree" with hate speech; it has a materially negative effect on the world. I think preventing that negative effect on the world is more important than preserving high quality discussion. This isn't to say that we shouldn't have both, just that one, to me, is far more important than the other. It's more than just disliking the issue or disagreeing with crypto and NFTs; it's a real and present danger to everyone.
1. [2]
skybrian
Link Parent
On the other hand, discussing NFT’s isn’t the same as making or buying them, and the NFT hype (which seems to be dying down) has only an indirect effect on the price of Ethereum, and the price is...
On the other hand, discussing NFT’s isn’t the same as making or buying them, and the NFT hype (which seems to be dying down) has only an indirect effect on the price of Ethereum, and the price is what actually controls the blockchain’s burn rate. So we are two steps removed.
Also, Tildes is a tiny site, with tiny influence compared to the rest of the Internet. We don’t have any real influence over whether NFT’s are popular or Ethereum is popular, let alone climate change. They are enormously bigger than us.
That means we don’t need to treat Tildes moderation as being of terribly high-stakes, planet-shaking importance. The main thing at risk is our own enjoyment of this website.
3 votes
1. Seven
Link Parent
Yeah, you're right on that. I think we should absolutely encourage better discussion around NFTs. I definitely think we can do better in provoking good, nuanced discussion around crypto while also...
Yeah, you're right on that. I think we should absolutely encourage better discussion around NFTs. I definitely think we can do better in provoking good, nuanced discussion around crypto while also ideologically opposing it.
1 vote
3. Akir
Link Parent
Personally speaking, I wish that I had a set of peril-sensitive glasses set to sensor out all things crypto, blockchain, or any other speculative market. IMHO these are all marketplaces full of...
Personally speaking, I wish that I had a set of peril-sensitive glasses set to sensor out all things crypto, blockchain, or any other speculative market.
IMHO these are all marketplaces full of moderately rich unscrupulous people taking money away from moderately rich people who simply don't know any better than to buy stupid things for the sake of status symbolism. But the sad thing about cryptocurrency in particular is that there are some decidedly not-rich people who will end up even worse after the bubble eventually pops.
4 votes
|
{
"url": "https://tildes.net/~games.game_design/zgg/let_me_tell_you_why_only_a_dumbass_would_get_into_nft_games",
"source_domain": "tildes.net",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "85590",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C4BRAHE2MTPGAGYZ2AAB2G2YZJQ7JP4P",
"WARC-Concurrent-To": "<urn:uuid:d5719340-91a8-4eef-81d7-21348ebb65ce>",
"WARC-Date": "2022-05-16T18:27:13Z",
"WARC-IP-Address": "54.39.49.122",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3N7LMJF3U5YJICPSVSUEFVG5FMLAGXVZ",
"WARC-Record-ID": "<urn:uuid:335b1678-3530-422e-a3d5-bc768c3fc093>",
"WARC-Target-URI": "https://tildes.net/~games.game_design/zgg/let_me_tell_you_why_only_a_dumbass_would_get_into_nft_games",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8f340283-00e3-4d9a-b655-9f0074df748b>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-5\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,
9,
10,
70,
71,
83,
84,
94,
107,
116,
206,
207,
285,
286,
928,
929,
939,
940,
1348,
1349,
1711,
1712,
1722,
1723,
1761,
1762,
2024,
2025,
2321,
2322,
2334,
2346,
2360,
2378,
2584,
2585,
3109,
3110,
3319,
3320,
3445,
3446,
3534,
3535,
3980,
3981,
4342,
4343,
4358,
4376,
4396,
4604,
4605,
5028,
5029,
5275,
5276,
5292,
5310,
5330,
5535,
5536,
5871,
5872,
6585,
6586,
6700,
6701,
7083,
7084,
7394,
7395,
7573,
7574,
8220,
8221,
8236,
8250,
8263,
8283,
8485,
8486,
8849,
8850,
9135,
9136,
9151,
9169,
9191,
9359,
9360,
9411,
9412,
9580,
9581,
9599,
9616,
9633,
9657,
9866,
9867,
9980,
9981,
10441,
10442,
10462,
10481,
10503,
10529,
10740,
10741,
10978,
10979,
11495,
11496,
11550,
11551,
11552,
11787,
11788,
11970,
11971,
11993,
12019,
12047,
12258,
12259,
12451,
12452,
12606,
12607,
12630,
12651,
12672,
12700,
12821,
12822,
12895,
12896,
12960,
12961,
12984,
13010,
13040,
13255,
13256,
13345,
13346,
13974,
13975,
14077,
14078,
14190,
14191,
14618,
14619,
15344,
15345,
15580,
15581,
15878,
15879,
15880,
16160,
16161,
16187,
16212,
16237,
16269,
16486,
16487,
16669,
16670,
16866,
16867,
16929,
16930,
17261,
17262,
17540,
17541,
17986,
17987,
18459,
18460,
18710,
18711,
18712,
19031,
19032,
19271,
19272,
19303,
19337,
19555,
19556,
19636,
19637,
20305,
20306,
20663,
20664,
20944,
20945,
21243,
21244,
21756,
21757,
22170,
22171,
22287,
22288,
22469,
22470,
22488,
22512,
22688,
22689,
22865,
22866,
22876,
22885,
22894,
23091,
23092,
23463,
23464,
23476,
23487,
23502,
23520,
23726,
23727,
24001,
24002,
24127,
24128,
24369,
24370,
24606,
24607,
24887,
24888,
25042,
25043,
25057,
25071,
25091,
25295,
25296,
25500,
25501,
25517,
25528,
25540,
25558,
25762,
25763,
26021,
26022,
26036,
26049,
26062,
26082,
26290,
26291,
26470,
26471,
26579,
26580,
26669,
26670,
27003,
27004,
27005,
27461,
27462,
27839,
27840,
27856,
27871,
27890,
27912,
28083,
28084,
28255,
28256,
28274,
28291,
28315,
28511,
28512,
28753,
28754,
28793,
28794,
28814,
28829,
28845,
28867,
29075,
29076,
29186,
29187,
29633,
29634,
29678,
29679,
30116,
30117,
30246,
30247,
31105,
31106,
31124,
31141,
31158,
31182,
31391,
31392,
31617,
31618,
32026,
32027,
32046,
32066,
32092,
32299,
32300,
32962,
32963,
32984,
33009,
33037,
33252,
33253,
33545,
33546,
33799,
33800,
33990,
33991,
34015,
34040,
34070,
34288,
34289,
34531,
34532,
34557,
34569,
34587,
34790,
34791,
34951,
34952,
35336,
35337
],
"line_end_idx": [
9,
10,
70,
71,
83,
84,
94,
107,
116,
206,
207,
285,
286,
928,
929,
939,
940,
1348,
1349,
1711,
1712,
1722,
1723,
1761,
1762,
2024,
2025,
2321,
2322,
2334,
2346,
2360,
2378,
2584,
2585,
3109,
3110,
3319,
3320,
3445,
3446,
3534,
3535,
3980,
3981,
4342,
4343,
4358,
4376,
4396,
4604,
4605,
5028,
5029,
5275,
5276,
5292,
5310,
5330,
5535,
5536,
5871,
5872,
6585,
6586,
6700,
6701,
7083,
7084,
7394,
7395,
7573,
7574,
8220,
8221,
8236,
8250,
8263,
8283,
8485,
8486,
8849,
8850,
9135,
9136,
9151,
9169,
9191,
9359,
9360,
9411,
9412,
9580,
9581,
9599,
9616,
9633,
9657,
9866,
9867,
9980,
9981,
10441,
10442,
10462,
10481,
10503,
10529,
10740,
10741,
10978,
10979,
11495,
11496,
11550,
11551,
11552,
11787,
11788,
11970,
11971,
11993,
12019,
12047,
12258,
12259,
12451,
12452,
12606,
12607,
12630,
12651,
12672,
12700,
12821,
12822,
12895,
12896,
12960,
12961,
12984,
13010,
13040,
13255,
13256,
13345,
13346,
13974,
13975,
14077,
14078,
14190,
14191,
14618,
14619,
15344,
15345,
15580,
15581,
15878,
15879,
15880,
16160,
16161,
16187,
16212,
16237,
16269,
16486,
16487,
16669,
16670,
16866,
16867,
16929,
16930,
17261,
17262,
17540,
17541,
17986,
17987,
18459,
18460,
18710,
18711,
18712,
19031,
19032,
19271,
19272,
19303,
19337,
19555,
19556,
19636,
19637,
20305,
20306,
20663,
20664,
20944,
20945,
21243,
21244,
21756,
21757,
22170,
22171,
22287,
22288,
22469,
22470,
22488,
22512,
22688,
22689,
22865,
22866,
22876,
22885,
22894,
23091,
23092,
23463,
23464,
23476,
23487,
23502,
23520,
23726,
23727,
24001,
24002,
24127,
24128,
24369,
24370,
24606,
24607,
24887,
24888,
25042,
25043,
25057,
25071,
25091,
25295,
25296,
25500,
25501,
25517,
25528,
25540,
25558,
25762,
25763,
26021,
26022,
26036,
26049,
26062,
26082,
26290,
26291,
26470,
26471,
26579,
26580,
26669,
26670,
27003,
27004,
27005,
27461,
27462,
27839,
27840,
27856,
27871,
27890,
27912,
28083,
28084,
28255,
28256,
28274,
28291,
28315,
28511,
28512,
28753,
28754,
28793,
28794,
28814,
28829,
28845,
28867,
29075,
29076,
29186,
29187,
29633,
29634,
29678,
29679,
30116,
30117,
30246,
30247,
31105,
31106,
31124,
31141,
31158,
31182,
31391,
31392,
31617,
31618,
32026,
32027,
32046,
32066,
32092,
32299,
32300,
32962,
32963,
32984,
33009,
33037,
33252,
33253,
33545,
33546,
33799,
33800,
33990,
33991,
34015,
34040,
34070,
34288,
34289,
34531,
34532,
34557,
34569,
34587,
34790,
34791,
34951,
34952,
35336,
35337,
35350
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 35350,
"ccnet_original_nlines": 357,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4679376184940338,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03090699017047882,
"rps_doc_frac_lines_end_with_ellipsis": 0.05865921825170517,
"rps_doc_frac_no_alph_words": 0.14948007464408875,
"rps_doc_frac_unique_words": 0.21303822100162506,
"rps_doc_mean_word_length": 4.492996692657471,
"rps_doc_num_sentences": 326,
"rps_doc_symbol_to_word_ratio": 0.004477180074900389,
"rps_doc_unigram_entropy": 6.01702356338501,
"rps_doc_word_count": 5783,
"rps_doc_frac_chars_dupe_10grams": 0.42123696208000183,
"rps_doc_frac_chars_dupe_5grams": 0.43205171823501587,
"rps_doc_frac_chars_dupe_6grams": 0.4258938431739807,
"rps_doc_frac_chars_dupe_7grams": 0.4231612980365753,
"rps_doc_frac_chars_dupe_8grams": 0.42123696208000183,
"rps_doc_frac_chars_dupe_9grams": 0.42123696208000183,
"rps_doc_frac_chars_top_2gram": 0.004810839891433716,
"rps_doc_frac_chars_top_3gram": 0.0027710399590432644,
"rps_doc_frac_chars_top_4gram": 0.0030019599944353104,
"rps_doc_books_importance": -3394.856201171875,
"rps_doc_books_importance_length_correction": -3394.856201171875,
"rps_doc_openwebtext_importance": -1691.2626953125,
"rps_doc_openwebtext_importance_length_correction": -1691.2626953125,
"rps_doc_wikipedia_importance": -1290.44091796875,
"rps_doc_wikipedia_importance_length_correction": -1290.44091796875
},
"fasttext": {
"dclm": 0.8689615726470947,
"english": 0.9666760563850403,
"fineweb_edu_approx": 1.427122712135315,
"eai_general_math": 0.3067876100540161,
"eai_open_web_math": 0.22456306219100952,
"eai_web_code": 0.0906115174293518
}
}
|
{
"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": "338.9",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,716,560,641,971,196,000 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
Is there a way to get the HTML in a webview in an Android app? I would prefer this to getting the HTML via a simple resource download, especially if I can get HTML generated by JavaScript.
For example if I wanted a list of all URLs in a random HTML document accessible to my android application, including web apps such as gmail, how would I go about it?
The android documentation warns about letting JavaScript access the application, but I was thinking maybe a solution would be, if at all possible, to inject some JavaScript into the webpage which then communicates with my application in a hopefully safe way (via message passing or something through an iframe on a site that I control the javascript on or something similar).
Any one have any ideas?
share|improve this question
2 Answers 2
up vote 1 down vote accepted
Is there a way to get the HTML in a webview in an Android app?
Not easily. javascript: URLs work, and addJavascriptInterface() allows you to set up callbacks that the Javascript can call. You may be able to create a snippet of Javascript loaded by a javascript: URL that obtains your DOM, or walks your list of links, or something, sending the results back to you via the callback object you registered via addJavascriptInterface().
share|improve this answer
a = (WebView) findViewById(R.id.web);
a.loadUrl("javascript:(function() { " +
"document.getElementById('inputID').value='"+EditText.getText()+"'; " +
"document.getElementById('inputID').value='"+EditText.getText()+"'; " +
"})()");
a.loadUrl("javascript:(function() {IWBUTTON1_onclick(false);})()");
share|improve this answer
2
Please add some content to your code.. – TheAlbear Dec 6 '11 at 12:28
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/4543663/is-there-a-way-to-get-the-html-in-a-webview-in-an-android-app",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "76767",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:32FY5WUKRU7RTUUWWSYVFTWMIPINA3IC",
"WARC-Concurrent-To": "<urn:uuid:c6ab655d-a6b8-4aef-baf6-ec6d594add1d>",
"WARC-Date": "2015-09-01T18:33:37Z",
"WARC-IP-Address": "104.16.105.85",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:V7HKAVK7TX33RUXATTHTYIGKGOSFYONB",
"WARC-Record-ID": "<urn:uuid:02d090d3-1878-4d95-a3fb-fab004ac9f9d>",
"WARC-Target-URI": "http://stackoverflow.com/questions/4543663/is-there-a-way-to-get-the-html-in-a-webview-in-an-android-app",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:72b26d74-7464-4316-8b58-508303ad99aa>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
131,
132,
321,
322,
488,
489,
865,
866,
890,
891,
919,
920,
932,
933,
962,
963,
1026,
1027,
1397,
1398,
1424,
1463,
1464,
1504,
1592,
1680,
1705,
1774,
1800,
1804,
1875,
1876,
1888,
1889,
1891,
1899,
1900,
1978,
1979
],
"line_end_idx": [
25,
131,
132,
321,
322,
488,
489,
865,
866,
890,
891,
919,
920,
932,
933,
962,
963,
1026,
1027,
1397,
1398,
1424,
1463,
1464,
1504,
1592,
1680,
1705,
1774,
1800,
1804,
1875,
1876,
1888,
1889,
1891,
1899,
1900,
1978,
1979,
2069
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2069,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0.0019333000527694821,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3765281140804291,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0342298299074173,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22249388694763184,
"rps_doc_frac_unique_words": 0.5445544719696045,
"rps_doc_mean_word_length": 5.145214557647705,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.783087253570557,
"rps_doc_word_count": 303,
"rps_doc_frac_chars_dupe_10grams": 0.06029506027698517,
"rps_doc_frac_chars_dupe_5grams": 0.06029506027698517,
"rps_doc_frac_chars_dupe_6grams": 0.06029506027698517,
"rps_doc_frac_chars_dupe_7grams": 0.06029506027698517,
"rps_doc_frac_chars_dupe_8grams": 0.06029506027698517,
"rps_doc_frac_chars_dupe_9grams": 0.06029506027698517,
"rps_doc_frac_chars_top_2gram": 0.007697239983826876,
"rps_doc_frac_chars_top_3gram": 0.0102629903703928,
"rps_doc_frac_chars_top_4gram": 0.014111610129475594,
"rps_doc_books_importance": -210.7073974609375,
"rps_doc_books_importance_length_correction": -210.7073974609375,
"rps_doc_openwebtext_importance": -116.4235610961914,
"rps_doc_openwebtext_importance_length_correction": -116.4235610961914,
"rps_doc_wikipedia_importance": -85.26063537597656,
"rps_doc_wikipedia_importance_length_correction": -85.26063537597656
},
"fasttext": {
"dclm": 0.5624659657478333,
"english": 0.8164013028144836,
"fineweb_edu_approx": 1.2541154623031616,
"eai_general_math": 0.00003386000025784597,
"eai_open_web_math": 0.038866281509399414,
"eai_web_code": 0.00012027999764541164
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,673,224,486,547,225,000 |
December 17, 2014
Hot Topics:
Hamsterdb: a Small, Fast Database That Won't Weigh You Down
• July 14, 2008
• By Victor Volkman
• Send Email »
• More Articles »
Even more goodies are available through ham_new_ex(). These let you tune the cache size, page size, and B+tree index key size.
26
27 for (i=0; i<LOOP; i++) { //demonstrate insert functions
28 key.size=sizeof(i);
29 key.data=&i;
30 record.size=sizeof(i);
31 record.data=&i;
32 st=ham_insert(db, 0, &key, &record, 0);
33 if (st!=HAM_SUCCESS)
34 error("ham_insert", st);
35 }
36
In the next section (lines 26-36), you simply insert about 10 records with the datavalues 1 thru 10. The ham_insert() used on line #32 is the standard method of getting data into the database. The second parameter is a transaction handle (or null if you don't care to use transactions). The next parameter is the primary key you will associate with the record data. If you open the database with the HAM_RECORD_NUMBER flag, the system will generate this for you. The fourth parameter is nothing but a pointer to the data you're going to insert (note the size was set on line #30). Last, a set of insertion flags that can be HAM_OVERWRITE to replace a record with a matching key or HAM_DUPLICATE to force an additional record if the key already existed.
37 for (i=0; i<LOOP; i++) { // retrieve the data
38 key.size=sizeof(i);
39 key.data=&i;
40
41 st=ham_find(db, 0, &key, &record, 0);
42 if (st!=HAM_SUCCESS)
43 error("ham_find", st);
44
45 if (*(int *)record.data!=i) {
46 printf("ham_find() ok, but returned bad value\n");
47 return (-1);
48 }
49 }
The next thing you try is to query the database to find those records you just inserted. Because you're not using SQL, you are limited to matching exact records 1-for-1 based on keys. If youwanted to do some type of query and scan the database closely, you would have used the cursor functions (which are outside the scope of this limited introduction). The first two parameters to ham_find() are the database handle and transaction handle (or null). The function returns either HAM_SUCCESS or HAM_KEY_NOT_FOUND depending on how it went and fills up the record data if it worked.
50
51 st=ham_close(db, 0);
52 if (st!=HAM_SUCCESS)
53 error("ham_close", st);
54 st=ham_open(db, "test.db", 0);
55 if (st!=HAM_SUCCESS)
56 error("ham_open", st);
57
58 for (i=0; i<LOOP; i++) { // delete the data
59 key.size=sizeof(i);
60 key.data=&i;
61 st=ham_erase(db, 0, &key, 0);
62 if (st!=HAM_SUCCESS)
63 error("ham_erase", st);
64 }
In lines 51-64, you're showing off that you can close and reopen the database and pick up right where you left off. The ham_erase() function works about like you think it would, being an implicit search-and-destroy in one step. It returns HAM_SUCCESS or HAM_KEY_NOT_FOUND.
66 for (i=0; i<LOOP; i++) {
67 key.size=sizeof(i);
68 key.data=&i;
69
70 st=ham_find(db, 0, &key, &record, 0);
71 if (st!=HAM_KEY_NOT_FOUND)
72 error("ham_find", st);
73 }
74
75 st=ham_close(db, 0);
76 if (st!=HAM_SUCCESS)
77 error("ham_close", st);
78
79 ham_delete(db);
80 printf("success!\n");
81 return (0);
82 }
83
84 void error(const char *foo, ham_status_t st)
85 {
86 printf("%s() returned error %d: %s\n", foo, st,
ham_strerror(st));
87 exit(-1);
88 }
89
In this last segment, lines #66-74, you try to find those records you just deleted. Normally, you wouldn't do things exactly this way, but it's just a demo so you're trying lots of variations on a theme. Finally, you close down the database file with ham_close() and delete the instance with ham_delete() on line #79.
Conclusion
Well, if hamsterdb isn't the simplest record-manager API I've seen in the past 30 years, I don't know what is. Certainly, it has the easiest learning curve of any B+tree system I've ever used. There are a ton of features that I didn't even get very near in this demo, including:
• Cursors for navigating the data
• Encryption support
• Custom-comparison functions for sorting
• Zlib-based compression of record data
• Transaction and rollback
If you're developing a lean-and-mean application, hamsterdb may be the small and fast addition that you need for simple database needs.
About the Author
Victor Volkman has been writing for C/C++ Users Journal and other programming journals since the late 1980s. He is a graduate of Michigan Tech and a faculty advisor board member for the Washtenaw Community College CIS department. Volkman is the editor of numerous books including, C/C++ Treasure Chest and is the owner of Loving Healing Press. He can help you in your quest for open source tools and libraries; just send an email to [email protected]
Page 2 of 2
Comment and Contribute
(Maximum characters: 1200). You have characters left.
Enterprise Development Update
Don't miss an article. Subscribe to our newsletter below.
Sitemap | Contact Us
Rocket Fuel
|
{
"url": "http://www.developer.com/db/article.php/10920_3758591_2/Hamsterdb-a-Small-Fast-Database-That-Wont-Weigh-You-Down.htm",
"source_domain": "www.developer.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "63348",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A5PB2PJQ7DKXXI3YTOJMGDJLKEF2FPDB",
"WARC-Concurrent-To": "<urn:uuid:fe9bb06c-7031-432a-8912-2cf17542dda6>",
"WARC-Date": "2014-12-18T02:26:34Z",
"WARC-IP-Address": "23.0.160.73",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:RTQYVZ44BX7CAU3LYM6G462JX5YXYKIP",
"WARC-Record-ID": "<urn:uuid:5baf4a1d-f61d-482d-b8da-b8ad0b1073d3>",
"WARC-Target-URI": "http://www.developer.com/db/article.php/10920_3758591_2/Hamsterdb-a-Small-Fast-Database-That-Wont-Weigh-You-Down.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:46d12eef-005e-4a3c-868b-9c47751ecd41>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-231-17-201.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-52\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for December 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
18,
30,
31,
91,
92,
110,
132,
149,
169,
170,
297,
298,
301,
366,
395,
417,
449,
474,
523,
553,
590,
598,
601,
602,
1355,
1356,
1411,
1440,
1462,
1465,
1512,
1542,
1577,
1580,
1619,
1682,
1707,
1718,
1726,
1727,
2307,
2308,
2311,
2338,
2365,
2398,
2435,
2462,
2494,
2497,
2550,
2579,
2601,
2640,
2670,
2706,
2714,
2715,
2988,
2989,
3020,
3049,
3071,
3074,
3121,
3157,
3192,
3200,
3203,
3230,
3257,
3290,
3293,
3315,
3343,
3361,
3366,
3369,
3417,
3422,
3476,
3504,
3520,
3525,
3528,
3529,
3847,
3848,
3859,
3860,
4139,
4140,
4176,
4199,
4243,
4285,
4314,
4315,
4451,
4452,
4469,
4470,
4919,
4920,
4921,
4922,
4923,
4924,
4936,
4937,
4938,
4939,
4962,
4963,
4965,
4966,
4967,
5021,
5022,
5024,
5025,
5027,
5028,
5029,
5059,
5060,
5118,
5119,
5140,
5141
],
"line_end_idx": [
18,
30,
31,
91,
92,
110,
132,
149,
169,
170,
297,
298,
301,
366,
395,
417,
449,
474,
523,
553,
590,
598,
601,
602,
1355,
1356,
1411,
1440,
1462,
1465,
1512,
1542,
1577,
1580,
1619,
1682,
1707,
1718,
1726,
1727,
2307,
2308,
2311,
2338,
2365,
2398,
2435,
2462,
2494,
2497,
2550,
2579,
2601,
2640,
2670,
2706,
2714,
2715,
2988,
2989,
3020,
3049,
3071,
3074,
3121,
3157,
3192,
3200,
3203,
3230,
3257,
3290,
3293,
3315,
3343,
3361,
3366,
3369,
3417,
3422,
3476,
3504,
3520,
3525,
3528,
3529,
3847,
3848,
3859,
3860,
4139,
4140,
4176,
4199,
4243,
4285,
4314,
4315,
4451,
4452,
4469,
4470,
4919,
4920,
4921,
4922,
4923,
4924,
4936,
4937,
4938,
4939,
4962,
4963,
4965,
4966,
4967,
5021,
5022,
5024,
5025,
5027,
5028,
5029,
5059,
5060,
5118,
5119,
5140,
5141,
5152
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5152,
"ccnet_original_nlines": 130,
"rps_doc_curly_bracket": 0.002523289993405342,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27441078424453735,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026936030015349388,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.35774409770965576,
"rps_doc_frac_unique_words": 0.5350649356842041,
"rps_doc_mean_word_length": 4.658441543579102,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0.003367000026628375,
"rps_doc_unigram_entropy": 5.534308433532715,
"rps_doc_word_count": 770,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.026205740869045258,
"rps_doc_frac_chars_dupe_6grams": 0.01393922045826912,
"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.021466409787535667,
"rps_doc_frac_chars_top_3gram": 0.011151379905641079,
"rps_doc_frac_chars_top_4gram": 0.012266520410776138,
"rps_doc_books_importance": -386.36163330078125,
"rps_doc_books_importance_length_correction": -386.36163330078125,
"rps_doc_openwebtext_importance": -208.7276611328125,
"rps_doc_openwebtext_importance_length_correction": -208.7276611328125,
"rps_doc_wikipedia_importance": -89.07366180419922,
"rps_doc_wikipedia_importance_length_correction": -89.07366180419922
},
"fasttext": {
"dclm": 0.14147549867630005,
"english": 0.7823451161384583,
"fineweb_edu_approx": 1.293701171875,
"eai_general_math": 0.13114041090011597,
"eai_open_web_math": 0.21405118703842163,
"eai_web_code": 0.04478013888001442
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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
|
713,750,773,114,752,300 |
Trang Chủ Lớp 7 Đề thi học kì 2 lớp 7 Đề kiểm tra học kì 2 Toán 7: Tính số trung bình cộng...
Đề kiểm tra học kì 2 Toán 7: Tính số trung bình cộng của dấu hiệu?
CHIA SẺ
Đề thi học kì 2 môn Toán lớp 7: Cho đa thức \(F(x) = a.{x^2} + b.x + c\) biết F(0) = 2016, F(1) = 2017, F(-1) = 2018. Tính F(2)
I. Trắc nghiệm (2đ) Học sinh làm trực tiếp vào đề kiểm tra
Khoanh tròn vào chữ cái trước câu trả lời đúng
1. Trong các số sau, số nào là nghiệm của đa thức: \(F(x) = {x^2} + 2x – 3\)
A. 1. B. 2.
C. 3. D. 4.
2. Cho \(\Delta ABC\) có \(\hat A = 70^\circ ,\hat B = 50^\circ \) khi đó
A. AC > BC B. AB > AC
C. AB = BC D. AB < AC
3. Bậc của đa thức \(2{x^4} – x + 4{x^3} – 2{x^4} + 5\) là:
A. 0 B. 2.
C. 3. D. 4
4. Cho \(\Delta ABC\) cân ở A, trung tuyến AM, trọng tâm G. Biết AB = 5 cm, BM = 4 cm khi đó độ dài AG là:
A. \(\dfrac{5}{3}\,cm\) B. 4 cm
C. 2 cm. D. 3 cm.
II. Tự luận (8đ)
Bài 1. (1.5đ) Cho hai đơn thức \( – \dfrac{3}{4}{x^2}y\) và \(\dfrac{2}{3}x{y^2}z\)
a) Tính tích hai đơn thức trên
b) Xác định hệ số, phần biến, bậc đơn thức tích
Bài 2. (1.5đ) Khi điều tra về số \({m^3}\) nước dùng trong tháng của mỗi hộ gia đình trong xóm, người điều tra ghi lại bảng sau:
a) Dấu hiệu ở đây là gì?
b) Lập bảng tần số
c) Tính số trung bình cộng của dấu hiệu?
Bài 3 (1.5đ): Cho hai đa thức \(A = {x^2} – 3xy – {y^2} + 1\) và \(B = 2{x^2} + {y^2} – 7xy – 5\)
a) Tính A + B = ?
b) Tìm đa thức C biết C + A = B
Bài 4: (3đ) Cho \(\Delta ABC\) vuông tại A. Tia phân giác của \(\hat B\) cắt AC tại E. Từ E kẻ ED vuông góc với BC tại D
a) Chứng minh: ..
b) Chứng minh BE là đường trung trực của đoạn AD
c) Kẻ \(AH \bot BC(H \in BC).\) Chứng minh AD là tia phân giác của \(\widehat {HAC}\)
Bài 5 (0,5đ): Cho đa thức \(F(x) = a.{x^2} + b.x + c\) biết F(0) = 2016, F(1) = 2017, F(-1) = 2018.
Tính F(2)
I. Trắc nghiệm
câu
1
2
3
4
Đáp án
A
B
C
C
II. Tự luận
Bài 1.
a) Ta có: \(\dfrac{{ – 3}}{4}{x^2}y.\dfrac{2}{3}x{y^2}z = \dfrac{{ – 3}}{4}.\dfrac{2}{3}{x^2}xy{y^2}\)\(\, = \dfrac{{ – 1}}{2}{x^3}{y^3}z\)
b) Hệ số: \(\dfrac{{ – 1}}{2}\)
- Quảng cáo -
Phần biến: \({x^3}{y^3}z\)
Bậc của đơn thức: 7
Bài 2:
a) Dấu hiệu là: Số \({m^3}\) nước dùng trong tháng của mỗi hộ gia đình trong xóm.
b, c)
Giá trị (x)
Tần số (n)
Các tích (x.n)
13
1
13
16
9
144
17
6
102
18
2
36
20
1
20
40
1
40
N = 20
Tổng: 355
\(\overline X = \dfrac{{355}}{{20}}\)\(\, = 17,75\)
Bài 3:
\(a)\,A + B = 3{x^2} – 10x – 4\)
\(b)\,\,C = B + ( – A)\)\(\, = {x^2} – 4xy + 2{y^2} – 6\)
Bài 4:
a) Xét \(\Delta ABE\) và \(\Delta DBE\) ta có:
\(\begin{array}{l}\hat A = \widehat D = 90^\circ \left( {gt} \right)\\{\widehat B_1} = {\widehat B_2}\left( {gt} \right)\end{array}\)
BE chung
\( \Rightarrow \Delta ABE = \Delta DBE\) (cạnh huyền – góc nhọn)
b) Vì \(\Delta ABE = \Delta DBE\) ta có
BA = BD (hai cạnh tương ứng) nên B thuộc đường trung trực của đoạn AD
EA = ED (câu b) nên \(\Delta EAD\) cân tại E (định nghĩa) nên \(\widehat {HAD} = \widehat {ADE}\) (hai góc SLT bằng nhau)
Vậy \(\widehat {HAD} = \widehat {DAE}\) hay AD là tia phân giác của \(\widehat {HAC}\)
Bài 5:
Ta có:
\(\begin{array}{l}F(0) = a{.0^2} + b.0 + c = 20,16\\ \Rightarrow c = 2016\\df(1) = a{.1^2} + b.1 + c = 2017\\ \Rightarrow a + b = 1\\df( – 1) = a.{( – 1)^2} + b.( – 1) + c \\\;\;\;\;\;\;\;\;\;\;\;\;\;= 2018\\ \Rightarrow a – b = 2\end{array}\)
Vì a + b = 1 và a – b = 2 nên \( \Rightarrow a = \dfrac{3}{2};b = \dfrac{{ – 1}}{2}\)
Vậy: \(F(2) = \dfrac{3}{2}{.2^2} – \left( {\dfrac{{ – 1}}{2}} \right).2 + 2016 \)\(\,= 2023\)
|
{
"url": "https://dethikiemtra.com/lop-7/de-thi-hoc-ki-2-lop-7/de-kiem-tra-hoc-ki-2-toan-7-tinh-so-trung-binh-cong-cua-dau-hieu-d45394.html",
"source_domain": "dethikiemtra.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "116984",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FMQ7VJWIPUSIF3FPBNRVXVUVRWDBNAHL",
"WARC-Concurrent-To": "<urn:uuid:c3f0dffe-38b7-4016-bd61-a71a43123b55>",
"WARC-Date": "2019-07-21T11:41:46Z",
"WARC-IP-Address": "103.221.223.121",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DKADMPLIKOYJ76LY4YWRCN3J36XPJE7U",
"WARC-Record-ID": "<urn:uuid:f726c48d-5fcd-4e8c-ab85-7a6bdbc3bd8b>",
"WARC-Target-URI": "https://dethikiemtra.com/lop-7/de-thi-hoc-ki-2-lop-7/de-kiem-tra-hoc-ki-2-toan-7-tinh-so-trung-binh-cong-cua-dau-hieu-d45394.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8cabcc17-60b6-4a34-8b66-a33b20d17a85>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-143-3-249.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,
94,
95,
162,
163,
171,
299,
300,
359,
360,
411,
412,
489,
490,
529,
530,
570,
571,
645,
646,
686,
687,
727,
728,
788,
789,
827,
828,
865,
866,
973,
974,
1033,
1034,
1075,
1076,
1093,
1094,
1178,
1179,
1210,
1211,
1259,
1260,
1389,
1390,
1415,
1416,
1435,
1436,
1477,
1478,
1576,
1577,
1595,
1596,
1628,
1629,
1750,
1751,
1769,
1770,
1819,
1820,
1906,
1907,
2007,
2008,
2018,
2019,
2020,
2035,
2036,
2040,
2041,
2043,
2044,
2046,
2047,
2049,
2050,
2052,
2053,
2060,
2061,
2063,
2064,
2066,
2067,
2069,
2070,
2072,
2073,
2085,
2086,
2093,
2094,
2234,
2235,
2267,
2268,
2282,
2283,
2310,
2311,
2331,
2332,
2339,
2340,
2422,
2423,
2429,
2430,
2442,
2443,
2454,
2455,
2470,
2471,
2474,
2475,
2477,
2478,
2481,
2482,
2485,
2486,
2488,
2489,
2493,
2494,
2497,
2498,
2500,
2501,
2505,
2506,
2509,
2510,
2512,
2513,
2516,
2517,
2520,
2521,
2523,
2524,
2527,
2528,
2531,
2532,
2534,
2535,
2538,
2539,
2546,
2547,
2557,
2558,
2611,
2612,
2619,
2620,
2653,
2654,
2712,
2713,
2720,
2721,
2768,
2769,
2914,
2915,
2935,
2936,
3001,
3002,
3042,
3043,
3113,
3114,
3236,
3237,
3324,
3325,
3332,
3333,
3340,
3341,
3585,
3586,
3672,
3673
],
"line_end_idx": [
94,
95,
162,
163,
171,
299,
300,
359,
360,
411,
412,
489,
490,
529,
530,
570,
571,
645,
646,
686,
687,
727,
728,
788,
789,
827,
828,
865,
866,
973,
974,
1033,
1034,
1075,
1076,
1093,
1094,
1178,
1179,
1210,
1211,
1259,
1260,
1389,
1390,
1415,
1416,
1435,
1436,
1477,
1478,
1576,
1577,
1595,
1596,
1628,
1629,
1750,
1751,
1769,
1770,
1819,
1820,
1906,
1907,
2007,
2008,
2018,
2019,
2020,
2035,
2036,
2040,
2041,
2043,
2044,
2046,
2047,
2049,
2050,
2052,
2053,
2060,
2061,
2063,
2064,
2066,
2067,
2069,
2070,
2072,
2073,
2085,
2086,
2093,
2094,
2234,
2235,
2267,
2268,
2282,
2283,
2310,
2311,
2331,
2332,
2339,
2340,
2422,
2423,
2429,
2430,
2442,
2443,
2454,
2455,
2470,
2471,
2474,
2475,
2477,
2478,
2481,
2482,
2485,
2486,
2488,
2489,
2493,
2494,
2497,
2498,
2500,
2501,
2505,
2506,
2509,
2510,
2512,
2513,
2516,
2517,
2520,
2521,
2523,
2524,
2527,
2528,
2531,
2532,
2534,
2535,
2538,
2539,
2546,
2547,
2557,
2558,
2611,
2612,
2619,
2620,
2653,
2654,
2712,
2713,
2720,
2721,
2768,
2769,
2914,
2915,
2935,
2936,
3001,
3002,
3042,
3043,
3113,
3114,
3236,
3237,
3324,
3325,
3332,
3333,
3340,
3341,
3585,
3586,
3672,
3673,
3766
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3766,
"ccnet_original_nlines": 192,
"rps_doc_curly_bracket": 0.043547529727220535,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07262997329235077,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08792048692703247,
"rps_doc_frac_lines_end_with_ellipsis": 0.005181349813938141,
"rps_doc_frac_no_alph_words": 0.5542813539505005,
"rps_doc_frac_unique_words": 0.369047611951828,
"rps_doc_mean_word_length": 3.422619104385376,
"rps_doc_num_sentences": 67,
"rps_doc_symbol_to_word_ratio": 0.0007645299774594605,
"rps_doc_unigram_entropy": 5.059907913208008,
"rps_doc_word_count": 672,
"rps_doc_frac_chars_dupe_10grams": 0.18521739542484283,
"rps_doc_frac_chars_dupe_5grams": 0.2534782588481903,
"rps_doc_frac_chars_dupe_6grams": 0.24043478071689606,
"rps_doc_frac_chars_dupe_7grams": 0.2091304361820221,
"rps_doc_frac_chars_dupe_8grams": 0.2091304361820221,
"rps_doc_frac_chars_dupe_9grams": 0.18521739542484283,
"rps_doc_frac_chars_top_2gram": 0.02086956985294819,
"rps_doc_frac_chars_top_3gram": 0.013913040049374104,
"rps_doc_frac_chars_top_4gram": 0.024782609194517136,
"rps_doc_books_importance": -481.33563232421875,
"rps_doc_books_importance_length_correction": -481.33563232421875,
"rps_doc_openwebtext_importance": -248.98226928710938,
"rps_doc_openwebtext_importance_length_correction": -248.98226928710938,
"rps_doc_wikipedia_importance": -185.79994201660156,
"rps_doc_wikipedia_importance_length_correction": -185.79994201660156
},
"fasttext": {
"dclm": 0.903011679649353,
"english": 0.00420306995511055,
"fineweb_edu_approx": 3.256669759750366,
"eai_general_math": 0.010512829758226871,
"eai_open_web_math": 0.7972420454025269,
"eai_web_code": 0.6945875883102417
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "516.0",
"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": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-8,214,557,570,440,718,000 |
fcml 1.2.2
Public Attributes | List of all members
fcml_st_parser_config Struct Reference
Parser configuration. More...
#include <fcml_parser.h>
Public Attributes
fcml_bool ignore_undefined_symbols
Set to true in order to ignore all undefined symbols. More...
fcml_bool disable_symbols_declaration
Disables symbols support. More...
fcml_bool override_labels
Set to true in order to allow overriding existing labels. More...
fcml_bool alloc_symbol_table_if_needed
By default parser ignores all symbol declarations if there is no symbol table provided in the parser context. More...
fcml_bool enable_error_messages
Enables textual error messages. More...
Detailed Description
Parser configuration.
Member Data Documentation
◆ alloc_symbol_table_if_needed
fcml_bool fcml_st_parser_config::alloc_symbol_table_if_needed
By default parser ignores all symbol declarations if there is no symbol table provided in the parser context.
By setting this value to true you can force the parser to allocate new symbol table when needed. Remember that you are then responsible for freeing it, so this functionality can be a bit dangerous because you have to check the existence of the symbol table every time it should be deallocated.
◆ disable_symbols_declaration
fcml_bool fcml_st_parser_config::disable_symbols_declaration
Disables symbols support.
It set to true every defined label will cause an error.
◆ enable_error_messages
fcml_bool fcml_st_parser_config::enable_error_messages
Enables textual error messages.
◆ ignore_undefined_symbols
fcml_bool fcml_st_parser_config::ignore_undefined_symbols
Set to true in order to ignore all undefined symbols.
In such a case every unknown symbol is treated as 0.
◆ override_labels
fcml_bool fcml_st_parser_config::override_labels
Set to true in order to allow overriding existing labels.
If set to false parser returns "Symbol already exists" error when symbol already exists.
The documentation for this struct was generated from the following file:
|
{
"url": "https://fcml-lib.com/api/structfcml__st__parser__config.html",
"source_domain": "fcml-lib.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "10567",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GWLX462ETIVJ4OPS22T2SLW42X73XJCQ",
"WARC-Concurrent-To": "<urn:uuid:4048bd14-40ff-48b1-bf4a-637edcc34ae1>",
"WARC-Date": "2024-02-22T07:57:47Z",
"WARC-IP-Address": "185.199.109.153",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:RPNI22Z6IKLTNEVEPEGAWFGLD5QW2RLJ",
"WARC-Record-ID": "<urn:uuid:719eae7a-2db1-4634-9139-d92a31f1149e>",
"WARC-Target-URI": "https://fcml-lib.com/api/structfcml__st__parser__config.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bca6d2e1-2b83-40c1-8a12-449ee166f3b1>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-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,
12,
52,
91,
92,
122,
123,
148,
149,
167,
168,
203,
266,
268,
306,
341,
343,
369,
436,
438,
477,
596,
598,
630,
671,
673,
674,
695,
696,
718,
719,
745,
746,
777,
778,
840,
841,
951,
952,
1246,
1247,
1277,
1278,
1339,
1340,
1366,
1367,
1423,
1424,
1448,
1449,
1504,
1505,
1537,
1538,
1565,
1566,
1624,
1625,
1679,
1680,
1733,
1734,
1752,
1753,
1802,
1803,
1861,
1862,
1951,
1952,
1953
],
"line_end_idx": [
12,
52,
91,
92,
122,
123,
148,
149,
167,
168,
203,
266,
268,
306,
341,
343,
369,
436,
438,
477,
596,
598,
630,
671,
673,
674,
695,
696,
718,
719,
745,
746,
777,
778,
840,
841,
951,
952,
1246,
1247,
1277,
1278,
1339,
1340,
1366,
1367,
1423,
1424,
1448,
1449,
1504,
1505,
1537,
1538,
1565,
1566,
1624,
1625,
1679,
1680,
1733,
1734,
1752,
1753,
1802,
1803,
1861,
1862,
1951,
1952,
1953,
2025
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2025,
"ccnet_original_nlines": 71,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28378379344940186,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0.0833333283662796,
"rps_doc_frac_no_alph_words": 0.1621621549129486,
"rps_doc_frac_unique_words": 0.465863436460495,
"rps_doc_mean_word_length": 6.481927871704102,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.02364864945411682,
"rps_doc_unigram_entropy": 4.459108829498291,
"rps_doc_word_count": 249,
"rps_doc_frac_chars_dupe_10grams": 0.2242874801158905,
"rps_doc_frac_chars_dupe_5grams": 0.2242874801158905,
"rps_doc_frac_chars_dupe_6grams": 0.2242874801158905,
"rps_doc_frac_chars_dupe_7grams": 0.2242874801158905,
"rps_doc_frac_chars_dupe_8grams": 0.2242874801158905,
"rps_doc_frac_chars_dupe_9grams": 0.2242874801158905,
"rps_doc_frac_chars_top_2gram": 0.01858736015856266,
"rps_doc_frac_chars_top_3gram": 0.027881039306521416,
"rps_doc_frac_chars_top_4gram": 0.027261460199952126,
"rps_doc_books_importance": -142.49221801757812,
"rps_doc_books_importance_length_correction": -142.49221801757812,
"rps_doc_openwebtext_importance": -80.98399353027344,
"rps_doc_openwebtext_importance_length_correction": -80.98399353027344,
"rps_doc_wikipedia_importance": -50.428585052490234,
"rps_doc_wikipedia_importance_length_correction": -50.428585052490234
},
"fasttext": {
"dclm": 0.10549002885818481,
"english": 0.5696452260017395,
"fineweb_edu_approx": 1.9061166048049927,
"eai_general_math": 0.11703324317932129,
"eai_open_web_math": 0.5020686388015747,
"eai_web_code": 0.3088754415512085
}
}
|
{
"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": "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,711,619,214,153,206,000 |
Level: Intermediate, Version: FM 10 or later
Unique Records Revisited, part 2
When you consider how easily most common reporting tasks are accomplished in FileMaker Pro, the lack of a built in, clear cut method to count unique values within a given found set seems a bit surprising. But where there’s a will, there’s a way, and in part 1 we looked at a method that required the found set be sorted. Well I have some good news: today’s demo (Count Unique – Three Variations, 6.4 Mb) has no sorting requirement.
Here we have a flat file (single table) of contact information. For any given found set, the primary key (ID) will of course be unique, but each of the other fields will potentially contain duplicates, and we want to be able to quickly count the unique values without having to first sort the found set.
The basic approach can be summarized in a few words:
1. Build a multiline key (MLK) of IDs for all records in the found set.
2. Relate the MLK to the ID field.
3. Create a conditional value list based on this relationship.
4. Count the values in the value list.
Step 1 requires a bit of elaboration, so I’d like to pretend for a moment that step 1 has already happened, and we have a return-delimited stack of IDs sitting in a global text field, g_MLK.
To get a sense of the big picture, we’ll look at steps 2, 3 and 4 now, and then circle back to step 1 for an in-depth exploration.
In step 2 we relate g_MLK to ID (the primary key field in Contacts), like so:
Since at this point the ID stack in g_MLK has a one-to-one correspondence with the records in the found set, if we are sitting on a layout based on the Contacts table occurrence, and we look across the relationship, we will see all the records in the current found set. We can easily confirm this by comparing Get(FoundCount) with Count(Contacts Filter::ID), or by comparing the contents of g_MLK with List(Contacts Filter::ID).
If you aren’t familiar with multiline keys, they can seem a bit like magic at first. Normal key fields will only contain one value. But if you place a return delimited list of keys into a text field, and use it as a relational predicate, any entry in that list can produce a valid relational match. I like to think of it as the relational equivalent of an “or” find.
Now comes step 3, and we actually need to define seven value lists, because there are seven fields we want to count unique values for. Since field-based value lists only show unique values, they are ideally suited for our needs (the reason they only show unique values is they derive their values from field indexes, rather than field contents — which explains why you cannot base a value list on an unindexed field).
Each value list will be based on a different field… here’s the setup for “Found Set Cities”. We want the value list to be filtered by the IDs sitting in g_MLK, so we need make sure that we have:
1. Specified the related table occurrence (Found Set Filter)
2. Specified the correct field (in this case, City)
3. Chosen “Include only related starting from: Contacts”
This type of value list is variously known as a “filtered”, “conditional” or (less commonly) a “related” value list.
And in step 4, we count the values in each value list, using the ValueCount and ValueListItems functions (each “Unique_” field is a global number field) :
…with a result such as the one you see at the left. But what about step 1? Well, enough procrastination, let’s get to it. Building a multiline key of values from the current found set it really a topic in itself, with numerous methods to consider, which is why I saved it for last.
As its name implies, today’s demo (Count Unique – Three Variations, 6.4 Mb) uses three different techniques to build the MLK. At the risk of stating the obvious: the ideal approach would be the top speed performer in all hosting scenarios (stand-alone, LAN, or WAN), regardless of found set size or platform.
Of the three approaches in this demo, the “Copy All Records” method has been around since the 1990s, and of course the AppleScript method is Mac-only, but certainly worth taking a look at. The AppleScript and Export/Import techniques come from a demo file (FastVariables) put together by Ralph Learmont, and modified by Bruce Robertson, specifically to demonstrate the various methods of loading the IDs for the current found set into a global field. I strongly recommend downloading FastVariables and experimenting with the various methods… if possible, on a LAN and WAN, not just locally.
And now, ladies and gentlemen, after hours of testing, and discussion with a number of colleagues, it appears that there is actually a clear winner under all circumstances: the unambiguous performance winner is the Export/Import technique from Ralph Learmont. If this were a chess tournament, I would nominate this technique for a “brilliancy prize”, because it is a fine example of outside-the-box thinking, taking advantage of several obscure FileMaker behaviors. Let’s take a look at this portion of the “count unique” script:
It starts out innocuously enough, by exporting the IDs for the found set as a text file, Exp.txt, and placing it into FileMaker’s temp folder.
Next a $folderpath variable is assigned, and one might wonder, “What the heck is that about? We already specified the complete path for the export file. And why does the Import Records step refer to $folderpath instead of $filepath?”
Well, that’s what is so clever about Ralph’s approach. If he were simply doing a standard “file” import, FileMaker would attempt to insert one line from the text file into each record. Instead, Ralph is utilizing FileMaker’s ability to import a whole folder of either text or media files. Observant readers may be saying, “But we don’t have a whole folder full of text files; only Exp.txt which we just exported.” Guess what? That’s exactly what we want.
We aren’t trying to import multiple files, we’re trying to ensure that the contents of Exp.txt becomes a return-delimited list in g_MLK, and that’s precisely what happens when we use this approach.
Incidentally, since we have multiple records in our found set, but a single text file to import, FileMaker would like to display a dialog to warn us that it did not have enough text files to populate all the records (at that moment, it doesn’t know or care that we’re importing into a global field). We don’t want our users to see that error, hence the use of Set Error Capture in the script.
Note: I do not recommend that the Export/Import method be used in FM 9 or earlier. The reason this article is tagged as “version FM 10 or later” is because of a quiet but very welcome behavior change introduced in that version: formerly FileMaker stored its temp files in the generic temp folder designated by the OS — now FileMaker creates its own temp folder (typically named S10) inside the main temp folder. You can use the Get(TemporaryPath) function to see exactly where this folder is located. Since this folder is created for FileMaker’s exclusive use, a) FileMaker will purge its contents automatically on application exit, and b) it is highly unlikely there will be a text file sitting in that folder unless a FM script has placed one there.
A final comment about the demo file. FileMaker will cache the IDs when you click any of the buttons, so it’s imperative to close the file between each test if you want accurate timings. Once caching has taken place, all the methods will run substantially faster.
5 thoughts on “Unique Records Revisited, part 2”
1. How can I get Filemaker to perform a find that only returns unique records? This is a common and simple task in MySQL but I cannot find an easy way to do this in Filemaker.
For example, let say I poll 500 people and I ask them their favorite ice cream flavor. I want to perform a find in the ice cream flavor field and see a list of all of the flavors…but I don’t want to see 200 records for chocolate, 50 for vanilla, etc. I just want to see a found set that single record for each flavor that was submitted.
I realize that I can generate a report that displays this information but I want to do this with a standard find command. Is this possible?
1. Hi John, not directly with a single find command. You’d need to do some additional scripting to collapse the found set to just unique entries.
2. Or perhaps my previous response took your question (can you get the answer using a simple find request) too literally. What you care about is the list of unique values, so why not just view the index of the Flavor field? That would show you the unique values. And if you base a value list on the contents of the Flavor field, you can use the ValueListItems() function to make those values available to the calc engine.
2. Thank you Kevin!
After many years of programming, this “out-of-the-box” thinking gives us new tools to look at the data.
With an SQL-plugin or FM12, we can use SELECT DISTINCT to set the g_MLK with unique values.
Does FM12’s implementation of SQL support this?
1. Hello Arild,
Glad to hear you found the article useful. With regards to your question…
The issue is that SQL (via plug-in or ExecuteSQL) has no concept of a FileMaker found set. I proposed a work around using a custom function called FoundSetToSQL which you can read about here:
http://filemakerhacks.com/?p=5013
Hope this helps,
Kevin
Leave a Reply
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
{
"url": "https://filemakerhacks.com/2011/05/22/unique-records-revisited-p2/",
"source_domain": "filemakerhacks.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "130403",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EXN32XZFGCRF3WYVNXRTOJ2PTQTZHPFA",
"WARC-Concurrent-To": "<urn:uuid:05c4eb31-1a92-4a58-8f72-59b48a5c4b80>",
"WARC-Date": "2019-07-16T19:35:38Z",
"WARC-IP-Address": "192.0.78.137",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3CTDVXJ3XOUZVROYDKPL23Y7YQOYILXB",
"WARC-Record-ID": "<urn:uuid:e9cf5b37-8d8a-4994-8f2c-6621fd2760b1>",
"WARC-Target-URI": "https://filemakerhacks.com/2011/05/22/unique-records-revisited-p2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:80d7278c-580f-4f0f-b870-f796d0c7dc96>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-47-193-50.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
45,
46,
79,
80,
512,
513,
817,
818,
871,
872,
946,
983,
1048,
1089,
1090,
1281,
1282,
1413,
1414,
1492,
1493,
1922,
1923,
2290,
2291,
2709,
2710,
2906,
2907,
2970,
3024,
3083,
3084,
3201,
3202,
3357,
3358,
3640,
3641,
3950,
3951,
4542,
4543,
5073,
5074,
5217,
5218,
5453,
5454,
5909,
5910,
6108,
6109,
6502,
6503,
7256,
7257,
7520,
7521,
7570,
7571,
7749,
7750,
8091,
8092,
8236,
8237,
8387,
8388,
8814,
8815,
8837,
8945,
9041,
9093,
9094,
9114,
9115,
9195,
9196,
9394,
9395,
9435,
9436,
9459,
9471,
9472,
9486,
9487
],
"line_end_idx": [
45,
46,
79,
80,
512,
513,
817,
818,
871,
872,
946,
983,
1048,
1089,
1090,
1281,
1282,
1413,
1414,
1492,
1493,
1922,
1923,
2290,
2291,
2709,
2710,
2906,
2907,
2970,
3024,
3083,
3084,
3201,
3202,
3357,
3358,
3640,
3641,
3950,
3951,
4542,
4543,
5073,
5074,
5217,
5218,
5453,
5454,
5909,
5910,
6108,
6109,
6502,
6503,
7256,
7257,
7520,
7521,
7570,
7571,
7749,
7750,
8091,
8092,
8236,
8237,
8387,
8388,
8814,
8815,
8837,
8945,
9041,
9093,
9094,
9114,
9115,
9195,
9196,
9394,
9395,
9435,
9436,
9459,
9471,
9472,
9486,
9487,
9567
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9567,
"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.4305283725261688,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022015659138560295,
"rps_doc_frac_lines_end_with_ellipsis": 0.01111111044883728,
"rps_doc_frac_no_alph_words": 0.17514677345752716,
"rps_doc_frac_unique_words": 0.3643457293510437,
"rps_doc_mean_word_length": 4.501800537109375,
"rps_doc_num_sentences": 92,
"rps_doc_symbol_to_word_ratio": 0.0024461799766868353,
"rps_doc_unigram_entropy": 5.619884967803955,
"rps_doc_word_count": 1666,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.020800000056624413,
"rps_doc_frac_chars_dupe_6grams": 0.01119999960064888,
"rps_doc_frac_chars_dupe_7grams": 0.01119999960064888,
"rps_doc_frac_chars_dupe_8grams": 0.01119999960064888,
"rps_doc_frac_chars_dupe_9grams": 0.01119999960064888,
"rps_doc_frac_chars_top_2gram": 0.017066670581698418,
"rps_doc_frac_chars_top_3gram": 0.008799999952316284,
"rps_doc_frac_chars_top_4gram": 0.007199999876320362,
"rps_doc_books_importance": -1236.10595703125,
"rps_doc_books_importance_length_correction": -1236.10595703125,
"rps_doc_openwebtext_importance": -485.3653869628906,
"rps_doc_openwebtext_importance_length_correction": -485.3653869628906,
"rps_doc_wikipedia_importance": -465.4833984375,
"rps_doc_wikipedia_importance_length_correction": -465.4833984375
},
"fasttext": {
"dclm": 0.10859668254852295,
"english": 0.9185845255851746,
"fineweb_edu_approx": 1.801200270652771,
"eai_general_math": 0.8356378674507141,
"eai_open_web_math": 0.31770801544189453,
"eai_web_code": 0.4427548050880432
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
-6,267,653,100,337,721,000 |
show / hide menu
Rules Expression Builder
When you create a new rule by clicking on the Create New rule button in the Rules panel
• The new rule will be created with the default name.
• Click on the edit button to rename the rule name.
• Click on the “+” button in the Decisions section to to create a new decision.
Expression Builder
1. Click on the controls in the first listbox. This will display all the controls in the current form in the next listbox.
2. Select the required control. In this example if I select the control named “dgVacation” which is a dynamic grid. This will display all the properties of the grid control.
3. Select the ColIndex property, which will let us know the current column in focus in the grid.
4. Click on the add button which will add the expressions section. Then click on the “=” button to add the operator to the expression.
5. Click on the operator “=” to display the “Add LHS” and “Add RHS” buttons.
6. Clicking on the “Add RHS” button will insert a new textbox right side of the operator.
7. Type the value 2 in the “RHS” textbox.
Now we have an expression that checks if the current row is the first column. Click on the Done button for completing the expression.
|
{
"url": "https://www.claysys.com/appforms/documentation/appforms-designer/appforms-designer-basics/rules-expression-builder/",
"source_domain": "www.claysys.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "203771",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ON755HGZTHBU4LEVITE6JYQQGCTIW7KX",
"WARC-Concurrent-To": "<urn:uuid:cf18f4ca-f0e6-4295-ab3b-a1ac19bfcb7f>",
"WARC-Date": "2022-08-12T02:31:14Z",
"WARC-IP-Address": "103.156.209.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:B3CAR6PIM255JKDQ3PI6D4SHMUG7RDQV",
"WARC-Record-ID": "<urn:uuid:dcd9b035-72c0-427b-b7f0-70dac9c3283e>",
"WARC-Target-URI": "https://www.claysys.com/appforms/documentation/appforms-designer/appforms-designer-basics/rules-expression-builder/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5b86f4ee-9eda-4242-aacc-30702c76a6de>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-80\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
17,
18,
43,
44,
132,
133,
189,
243,
325,
326,
345,
346,
471,
647,
746,
883,
962,
1054,
1098
],
"line_end_idx": [
17,
18,
43,
44,
132,
133,
189,
243,
325,
326,
345,
346,
471,
647,
746,
883,
962,
1054,
1098,
1235
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1235,
"ccnet_original_nlines": 19,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4000000059604645,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01923076994717121,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1884615421295166,
"rps_doc_frac_unique_words": 0.43111109733581543,
"rps_doc_mean_word_length": 4.235555648803711,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.060801029205322,
"rps_doc_word_count": 225,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10283315926790237,
"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.04721930995583534,
"rps_doc_frac_chars_top_3gram": 0.07345225661993027,
"rps_doc_frac_chars_top_4gram": 0.025183629244565964,
"rps_doc_books_importance": -166.4898681640625,
"rps_doc_books_importance_length_correction": -166.4898681640625,
"rps_doc_openwebtext_importance": -102.06867218017578,
"rps_doc_openwebtext_importance_length_correction": -102.06866455078125,
"rps_doc_wikipedia_importance": -63.37058639526367,
"rps_doc_wikipedia_importance_length_correction": -63.37058639526367
},
"fasttext": {
"dclm": 0.0236395001411438,
"english": 0.8166919946670532,
"fineweb_edu_approx": 1.1007483005523682,
"eai_general_math": 0.7007982730865479,
"eai_open_web_math": 0.11063790321350098,
"eai_web_code": 0.11965472251176834
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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,324,201,925,773,389,300 |
Question
Medium
Timing Icon
Solving time: 3 mins
The radii of two circles are and respectively. Find the radius of the circle which has circumference equal to the sum of the circumferences of the two circles.
Text SolutionText solutionverified iconVerified
Circumference of Circle Circumference of circle with radius Circumference of circle with radius
Radius of the circle is
Was this solution helpful?
88
Share
Report
Video Solution
Video solutions (7)
Learn from their 1-to-1 discussion with Filo tutors.
filo Logo
2 mins
Uploaded on: 5/29/2023
Ask your question, on a video call with tutor
Was this solution helpful?
137
Share
Report
filo Logo
2 mins
Uploaded on: 2/23/2024
Ask your question, on a video call with tutor
Was this solution helpful?
145
Share
Report
filo Logo
4 mins
Uploaded on: 3/28/2023
Ask your question, on a video call with tutor
Was this solution helpful?
92
Share
Report
See more 1-on-1 discussions (4)
tutor 0tutor 1tutor 2
Found 5 tutors discussing this question
Discuss this question LIVE
15 mins ago
One destination for complete JEE/NEET preparation
One destination to cover all your homework and assignment needs
Learn Practice Revision Succeed
Instant 1:1 help, 24x7
Instant 1:1 help, 24x7
60, 000+ Expert tutors
60, 000+ Expert tutors
Textbook solutions
Textbook solutions
Big idea maths, McGraw-Hill Education etc
Big idea maths, McGraw-Hill Education etc
Essay review
Essay review
Get expert feedback on your essay
Get expert feedback on your essay
Schedule classes
Schedule classes
High dosage tutoring from Dedicated 3 experts
High dosage tutoring from Dedicated 3 experts
Trusted by 4 million+ students
Practice questions on similar concepts asked by Filo students
Question 1
Views
Views: 6,005
EXERCISE 1. A circus artist is climbing a long rope, which is tightly stretched and tied from the top of a vertical pole to the ground. Find the height of the pole, if the angle made by the rope with the ground level is (see Fig. 9.11). 2. A tree breaks due to storm and the broken part bends so that the top of the tree touches the ground making an angle with it. The distance between the foot of the tree to the point where the top touches the ground is . Find the height of the Fig. 9.11 tree. 3. A contractor plans to install two slides for the children to play in a park. For the children below the age of 5 years, she prefers to have a slide whose top is at a height of , and 204 MлTиEмАтісS is inclined at an angle of to the ground, whereas for elder children, she wants to have a steep slide at a height of , and inclined at an angle of to the ground. What should be the length of the slide in each case? 4. The angle of elevation of the top of a tower from a point on the ground, which is away from the foot of the tower, is . Find the height of the tower. 5. A kite is flying at a height of above the ground. The string attached to the kite is temporarily tied to a point on the ground. The inclination of the string with the ground is . Find the length of the string, assuming that there is no slack in the string. 6. A tall boy is standing at some distance from a tall building. The angle of elevation from his eyes to the top of the building increases from to as he walks towards the building. Find the distance he walked towards the building. 7. From a point on the ground, the angles of elevation of the bottom and the top of a transmission tower fixed at the top of a high building are and respectively. Find the height of the tower. 8. A statue, tall, stands on the top of a pedestal. From a point on the ground, the angle of elevation of the top of the statue is and from the same point the angle of elevation of the top of the pedestal is . Find the height of the pedestal. 9. The angle of elevation of the top of a building from the foot of the tower is and the angle of elevation of the top of the tower from the foot of the building is . If the tower is high, find the height of the building. 10. Two poles of equal heights are standing opposite each other on either side of the road, which is wide. From a point between them on the road, the angles of elevation of the top of the poles are and , respectively. Find the height of the poles and the distances of the point from the poles. 11. A TV tower stands vertically on a bank of a canal. From a point on the other bank directly opposite the tower, the angle of elevation of the top of the tower is . From another point away from this point on the line joing this point to the foot of the tower, the angle of elevation of the top of the tower is (see Fig. 9.12). Find the height of the tower and the width of the canal. Fig. 12. From the top of a high building, the angle of elevation of the top of a cable tower is and the angle of depression of its foot is . Determine the height of the tower. 13. As observed from the top of a high lighthouse from the sea-level, the angles of depression of two ships are and . If one ship is exactly behind the other on the same side of the lighthouse, find the distance between the two ships.
View more
Doubt Icon Doubt Icon
Stuck on the question or explanation?
Connect with our Mathematics tutors online and get step by step solution of this question.
231 students are taking LIVE classes
Question Text
The radii of two circles are and respectively. Find the radius of the circle which has circumference equal to the sum of the circumferences of the two circles.
Updated OnFeb 23, 2024
TopicCircles
SubjectMathematics
ClassClass 10
Answer TypeText solution:1 Video solution: 7
Upvotes844
Avg. Video Duration3 min
|
{
"url": "https://askfilo.com/math-question-answers/the-radii-of-two-circles-are-19-cm-and-9-cm-respectively",
"source_domain": "askfilo.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "403703",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MZPKDKZNKKTQ3V6HTKZ42I7WH7DT5S7G",
"WARC-Concurrent-To": "<urn:uuid:7f80642a-9193-418c-bb31-5fa75212b1a3>",
"WARC-Date": "2024-09-08T03:27:40Z",
"WARC-IP-Address": "151.101.65.55",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:REYFFUSAUBVUTCWZGDBR7KK3WW7WQRYH",
"WARC-Record-ID": "<urn:uuid:4be7781d-1f07-4d8a-a19c-6a0159b8b69c>",
"WARC-Target-URI": "https://askfilo.com/math-question-answers/the-radii-of-two-circles-are-19-cm-and-9-cm-respectively",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8b7db001-6b14-42e1-a5eb-c3a5dda8e7e9>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-15\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,
9,
16,
28,
29,
50,
51,
211,
212,
260,
261,
357,
381,
408,
411,
417,
424,
439,
440,
460,
461,
514,
515,
525,
532,
533,
556,
557,
603,
630,
634,
640,
647,
657,
664,
665,
688,
689,
735,
762,
766,
772,
779,
789,
796,
797,
820,
821,
867,
894,
897,
903,
910,
942,
964,
1004,
1031,
1043,
1093,
1157,
1189,
1212,
1235,
1258,
1281,
1300,
1319,
1361,
1403,
1416,
1429,
1463,
1497,
1514,
1531,
1577,
1623,
1654,
1655,
1717,
1718,
1729,
1735,
1736,
1749,
1750,
5056,
5066,
5088,
5089,
5127,
5128,
5219,
5220,
5257,
5271,
5431,
5454,
5467,
5486,
5500,
5545,
5556
],
"line_end_idx": [
9,
16,
28,
29,
50,
51,
211,
212,
260,
261,
357,
381,
408,
411,
417,
424,
439,
440,
460,
461,
514,
515,
525,
532,
533,
556,
557,
603,
630,
634,
640,
647,
657,
664,
665,
688,
689,
735,
762,
766,
772,
779,
789,
796,
797,
820,
821,
867,
894,
897,
903,
910,
942,
964,
1004,
1031,
1043,
1093,
1157,
1189,
1212,
1235,
1258,
1281,
1300,
1319,
1361,
1403,
1416,
1429,
1463,
1497,
1514,
1531,
1577,
1623,
1654,
1655,
1717,
1718,
1729,
1735,
1736,
1749,
1750,
5056,
5066,
5088,
5089,
5127,
5128,
5219,
5220,
5257,
5271,
5431,
5454,
5467,
5486,
5500,
5545,
5556,
5580
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5580,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39505118131637573,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011092149652540684,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.170648455619812,
"rps_doc_frac_unique_words": 0.2888015806674957,
"rps_doc_mean_word_length": 4.319253444671631,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.707483291625977,
"rps_doc_word_count": 1018,
"rps_doc_frac_chars_dupe_10grams": 0.1284967064857483,
"rps_doc_frac_chars_dupe_5grams": 0.3900386691093445,
"rps_doc_frac_chars_dupe_6grams": 0.3327268660068512,
"rps_doc_frac_chars_dupe_7grams": 0.23743461072444916,
"rps_doc_frac_chars_dupe_8grams": 0.1935410499572754,
"rps_doc_frac_chars_dupe_9grams": 0.16352057456970215,
"rps_doc_frac_chars_top_2gram": 0.05230839177966118,
"rps_doc_frac_chars_top_3gram": 0.030930180102586746,
"rps_doc_frac_chars_top_4gram": 0.03638844937086105,
"rps_doc_books_importance": -240.23187255859375,
"rps_doc_books_importance_length_correction": -240.23187255859375,
"rps_doc_openwebtext_importance": -216.17025756835938,
"rps_doc_openwebtext_importance_length_correction": -216.17025756835938,
"rps_doc_wikipedia_importance": -152.5010986328125,
"rps_doc_wikipedia_importance_length_correction": -152.5010986328125
},
"fasttext": {
"dclm": 0.3345566987991333,
"english": 0.9004953503608704,
"fineweb_edu_approx": 2.6015167236328125,
"eai_general_math": 0.9213740825653076,
"eai_open_web_math": 0.60833340883255,
"eai_web_code": 0.010017160326242447
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.22",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "516.2",
"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": "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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,351,539,320,945,196,000 |
SHOGUN 4.0.0
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Trie.h
Go to the documentation of this file.
1 /*
2 * This program is free software; you can redistribute it and/or modify
3 * it under the terms of the GNU General Public License as published by
4 * the Free Software Foundation; either version 3 of the License, or
5 * (at your option) any later version.
6 *
7 * Written (W) 1999-2009 Soeren Sonnenburg
8 * Written (W) 1999-2009 Gunnar Raetsch
9 * Copyright (C) 1999-2009 Fraunhofer Institute FIRST and Max-Planck-Society
10 */
11
12 #ifndef _TRIE_H___
13 #define _TRIE_H___
14
15 #include <shogun/lib/config.h>
16
17 #include <shogun/lib/common.h>
18 #include <shogun/io/SGIO.h>
19 #include <shogun/base/DynArray.h>
21 #include <shogun/base/SGObject.h>
22
23 namespace shogun
24 {
25 #ifndef DOXYGEN_SHOULD_SKIP_THIS
26
27 // sentinel is 0xFFFFFFFC or float -2
28 #define NO_CHILD ((int32_t)-1073741824)
29
30 #define WEIGHTS_IN_TRIE
31 //#define TRIE_CHECK_EVERYTHING
32
33 #ifdef TRIE_CHECK_EVERYTHING
34 #define TRIE_ASSERT_EVERYTHING(x) ASSERT(x)
35 #else
36 #define TRIE_ASSERT_EVERYTHING(x)
37 #endif
38
39 //#define TRIE_ASSERT(x) ASSERT(x)
40 #define TRIE_ASSERT(x)
41
42 #define TRIE_TERMINAL_CHARACTER 7
43
45 struct ConsensusEntry
46 {
48 uint64_t string;
50 float32_t score;
52 int32_t bt;
53 };
54
56 struct POIMTrie
57 {
59 float64_t weight;
60 #ifdef TRIE_CHECK_EVERYTHING
61
62 bool has_seq;
64 bool has_floats;
65 #endif
66 union
67 {
69 float32_t child_weights[4];
71 int32_t children[4];
73 uint8_t seq[16] ;
74 };
75
77 float64_t S;
79 float64_t L;
81 float64_t R;
82 };
83
85 struct DNATrie
86 {
88 float64_t weight;
89 #ifdef TRIE_CHECK_EVERYTHING
90
91 bool has_seq;
93 bool has_floats;
94 #endif
95 union
96 {
98 float32_t child_weights[4];
100 int32_t children[4];
102 uint8_t seq[16] ;
103 };
104 };
105
107 struct TreeParseInfo {
109 int32_t num_sym;
111 int32_t num_feat;
113 int32_t p;
115 int32_t k;
117 int32_t* nofsKmers;
119 float64_t* margFactors;
121 int32_t* x;
123 int32_t* substrs;
125 int32_t y0;
127 float64_t* C_k;
129 float64_t* L_k;
131 float64_t* R_k;
132 };
133
134 #endif // DOXYGEN_SHOULD_SKIP_THIS
135
136 template <class Trie> class CTrie;
137
138 #define IGNORE_IN_CLASSLIST
139
157 IGNORE_IN_CLASSLIST template <class Trie> class CTrie : public CSGObject
158 {
159 public:
161 CTrie();
162
169 CTrie(int32_t d, bool p_use_compact_terminal_nodes=true);
170
172 CTrie(const CTrie & to_copy);
173 virtual ~CTrie();
174
176 const CTrie & operator=(const CTrie & to_copy);
177
185 bool compare_traverse(
186 int32_t node, const CTrie & other, int32_t other_node);
187
193 bool compare(const CTrie & other);
194
201 bool find_node(int32_t node, int32_t * trace, int32_t &trace_len) const;
202
209 int32_t find_deepest_node(
210 int32_t start_node, int32_t &deepest_node) const;
211
216 void display_node(int32_t node) const;
217
219 void destroy();
220
225 void set_degree(int32_t d);
226
233 void create(int32_t len, bool p_use_compact_terminal_nodes=true);
234
240 void delete_trees(bool p_use_compact_terminal_nodes=true);
241
252 void add_to_trie(
253 int32_t i, int32_t seq_offset, int32_t* vec, float32_t alpha,
254 float64_t *weights, bool degree_times_position_weights);
255
262 float64_t compute_abs_weights_tree(int32_t tree, int32_t depth);
263
269 float64_t* compute_abs_weights(int32_t &len);
270
284 int32_t* vec, int32_t len, int32_t seq_pos, int32_t tree_pos,
285 int32_t weight_pos, float64_t * weights,
286 bool degree_times_position_weights) ;
287
303 int32_t* vec, int32_t len, int32_t seq_pos, int32_t tree_pos,
304 int32_t weight_pos, float64_t* LevelContrib, float64_t factor,
305 int32_t mkl_stepsize, float64_t * weights,
306 bool degree_times_position_weights);
307
323 int32_t tree, int32_t i, int32_t j, float64_t weight, int32_t d,
324 int32_t max_degree, int32_t num_feat, int32_t num_sym,
325 int32_t sym_offset, int32_t offs, float64_t* result);
326
340 int32_t tree, int32_t i, float64_t alpha, int32_t *vec,
341 int32_t len_rem, int32_t degree_rec, int32_t mismatch_rec,
342 int32_t max_mismatch, float64_t * weights);
343
353 void traverse(
354 int32_t tree, const int32_t p, struct TreeParseInfo info,
355 const int32_t depth, int32_t* const x, const int32_t k);
356
366 void count(
367 const float64_t w, const int32_t depth,
368 const struct TreeParseInfo info, const int32_t p, int32_t* x,
369 const int32_t k);
370
377 int32_t compact_nodes(int32_t start_node, int32_t depth, float64_t * weights);
378
388 int32_t pos, uint64_t seq, int32_t deg, float64_t* weights);
389
400 Trie* tree, int32_t depth, uint64_t seq, float64_t value,
401 DynArray<ConsensusEntry>* table, float64_t* weights);
402
412 int32_t pos, DynArray<ConsensusEntry>* prev,
413 DynArray<ConsensusEntry>* cur, bool cumulative,
414 float64_t* weights);
415
421 void POIMs_extract_W(float64_t* const* const W, const int32_t K);
422
427 void POIMs_precalc_SLR(const float64_t* const distrib);
428
438 void POIMs_get_SLR(
439 const int32_t parentIdx, const int32_t sym, const int32_t depth,
440 float64_t* S, float64_t* L, float64_t* R);
441
448 void POIMs_add_SLR(
449 float64_t* const* const poims, const int32_t K,
450 const int32_t debug);
451
457 {
459 }
460
467 bool p_use_compact_terminal_nodes)
468 {
469 use_compact_terminal_nodes=p_use_compact_terminal_nodes ;
470 }
471
476 inline int32_t get_num_used_nodes()
477 {
478 return TreeMemPtr;
479 }
480
485 inline void set_position_weights(float64_t* p_position_weights)
486 {
487 position_weights=p_position_weights;
488 }
489
494 inline int32_t get_node(bool last_node=false)
495 {
496 int32_t ret = TreeMemPtr++;
497 check_treemem() ;
498
499 if (last_node)
500 {
501 for (int32_t q=0; q<4; q++)
502 TreeMem[ret].child_weights[q]=0.0;
503 }
504 else
505 {
506 for (int32_t q=0; q<4; q++)
507 TreeMem[ret].children[q]=NO_CHILD;
508 }
509 #ifdef TRIE_CHECK_EVERYTHING
510 TreeMem[ret].has_seq=false ;
511 TreeMem[ret].has_floats=false ;
512 #endif
513 TreeMem[ret].weight=0.0;
514 return ret ;
515 }
516
518 inline void check_treemem()
519 {
520 if (TreeMemPtr+10 < TreeMemPtrMax)
521 return;
522 SG_DEBUG("Extending TreeMem from %i to %i elements\n",
523 TreeMemPtrMax, (int32_t) ((float64_t)TreeMemPtrMax*1.2));
524 int32_t old_sz=TreeMemPtrMax;
525 TreeMemPtrMax = (int32_t) ((float64_t)TreeMemPtrMax*1.2);
526 TreeMem = SG_REALLOC(Trie, TreeMem, old_sz, TreeMemPtrMax);
527 }
528
533 inline void set_weights_in_tree(bool weights_in_tree_)
534 {
535 weights_in_tree = weights_in_tree_;
536 }
537
542 inline bool get_weights_in_tree()
543 {
544 return weights_in_tree;
545 }
546
557 const int32_t nodeIdx, const int32_t depth, const int32_t offset,
558 const int32_t y0, float64_t* const* const W, const int32_t K);
559
573 const float64_t* const distrib, const int32_t i,
574 const int32_t nodeIdx, int32_t left_tries_idx[4],
575 const int32_t depth, int32_t const lastSym, float64_t* S,
576 float64_t* L, float64_t* R);
577
578
590 const float64_t* const distrib, const int32_t i,
591 const int32_t nodeIdx, int32_t left_tries_idx[4],
592 const int32_t depth, float64_t* S, float64_t* L, float64_t* R);
593
605 const int32_t nodeIdx, const int32_t depth,const int32_t i,
606 const int32_t y0, float64_t* const* const poims, const int32_t K,
607 const int32_t debug);
608
623 float64_t* const* const poims, const int32_t K, const int32_t k,
624 const int32_t i, const int32_t y, const float64_t valW,
625 const float64_t valS, const float64_t valL, const float64_t valR,
626 const int32_t debug);
627
629 virtual const char* get_name() const { return "Trie"; }
630
631 public:
633 int32_t NUM_SYMS;
634
635 protected:
637 int32_t length;
639 int32_t * trees;
640
642 int32_t degree;
645
647 Trie* TreeMem;
649 int32_t TreeMemPtr;
651 int32_t TreeMemPtrMax;
654
657
659 int32_t* nofsKmers;
660 };
661 template <class Trie>
663 : CSGObject(), degree(0), position_weights(NULL),
664 use_compact_terminal_nodes(false),
665 weights_in_tree(true)
666 {
667
668 TreeMemPtrMax=0;
669 TreeMemPtr=0;
670 TreeMem=NULL;
671
672 length=0;
673 trees=NULL;
674
675 NUM_SYMS=4;
676 }
677
678 template <class Trie>
679 CTrie<Trie>::CTrie(int32_t d, bool p_use_compact_terminal_nodes)
680 : CSGObject(), degree(d), position_weights(NULL),
681 use_compact_terminal_nodes(p_use_compact_terminal_nodes),
682 weights_in_tree(true)
683 {
684 TreeMemPtrMax=1024*1024/sizeof(Trie);
685 TreeMemPtr=0;
686 TreeMem=SG_MALLOC(Trie, TreeMemPtrMax);
687
688 length=0;
689 trees=NULL;
690
691 NUM_SYMS=4;
692 }
693
694 template <class Trie>
695 CTrie<Trie>::CTrie(const CTrie & to_copy)
696 : CSGObject(to_copy), degree(to_copy.degree), position_weights(NULL),
697 use_compact_terminal_nodes(to_copy.use_compact_terminal_nodes)
698 {
699 if (to_copy.position_weights!=NULL)
700 {
702 /*SG_MALLOC(float64_t, to_copy.length);
703 for (int32_t i=0; i<to_copy.length; i++)
704 position_weights[i]=to_copy.position_weights[i]; */
705 }
706 else
707 position_weights=NULL;
708
710 TreeMemPtr=to_copy.TreeMemPtr;
711 TreeMem=SG_MALLOC(Trie, TreeMemPtrMax);
712 memcpy(TreeMem, to_copy.TreeMem, TreeMemPtrMax*sizeof(Trie));
713
714 length=to_copy.length;
715 trees=SG_MALLOC(int32_t, length);
716 for (int32_t i=0; i<length; i++)
717 trees[i]=to_copy.trees[i];
718
719 NUM_SYMS=4;
720 }
721
722 template <class Trie>
724 {
725 degree=to_copy.degree ;
726 use_compact_terminal_nodes=to_copy.use_compact_terminal_nodes ;
727
728 SG_FREE(position_weights);
729 position_weights=NULL ;
730 if (to_copy.position_weights!=NULL)
731 {
732 position_weights=to_copy.position_weights ;
733 /*position_weights = SG_MALLOC(float64_t, to_copy.length);
734 for (int32_t i=0; i<to_copy.length; i++)
735 position_weights[i]=to_copy.position_weights[i] ;*/
736 }
737 else
738 position_weights=NULL ;
739
740 TreeMemPtrMax=to_copy.TreeMemPtrMax ;
741 TreeMemPtr=to_copy.TreeMemPtr ;
742 SG_FREE(TreeMem) ;
743 TreeMem = SG_MALLOC(Trie, TreeMemPtrMax);
744 memcpy(TreeMem, to_copy.TreeMem, TreeMemPtrMax*sizeof(Trie)) ;
745
746 length = to_copy.length ;
747 if (trees)
748 SG_FREE(trees);
749 trees=SG_MALLOC(int32_t, length);
750 for (int32_t i=0; i<length; i++)
751 trees[i]=to_copy.trees[i] ;
752
753 return *this ;
754 }
755
756 template <class Trie>
758 int32_t start_node, int32_t& deepest_node) const
759 {
760 #ifdef TRIE_CHECK_EVERYTHING
761 int32_t ret=0 ;
762 SG_DEBUG("start_node=%i\n", start_node)
763
764 if (start_node==NO_CHILD)
765 {
766 for (int32_t i=0; i<length; i++)
767 {
768 int32_t my_deepest_node ;
769 int32_t depth=find_deepest_node(i, my_deepest_node) ;
770 SG_DEBUG("start_node %i depth=%i\n", i, depth)
771 if (depth>ret)
772 {
773 deepest_node=my_deepest_node ;
774 ret=depth ;
775 }
776 }
777 return ret ;
778 }
779
780 if (TreeMem[start_node].has_seq)
781 {
782 for (int32_t q=0; q<16; q++)
783 if (TreeMem[start_node].seq[q]!=TRIE_TERMINAL_CHARACTER)
784 ret++ ;
785 deepest_node=start_node ;
786 return ret ;
787 }
788 if (TreeMem[start_node].has_floats)
789 {
790 deepest_node=start_node ;
791 return 1 ;
792 }
793
794 for (int32_t q=0; q<4; q++)
795 {
796 int32_t my_deepest_node ;
797 if (TreeMem[start_node].children[q]==NO_CHILD)
798 continue ;
799 int32_t depth=find_deepest_node(abs(TreeMem[start_node].children[q]), my_deepest_node) ;
800 if (depth>ret)
801 {
802 deepest_node=my_deepest_node ;
803 ret=depth ;
804 }
805 }
806 return ret ;
807 #else
808 SG_ERROR("not implemented\n")
809 return 0 ;
810 #endif
811 }
812
813 template <class Trie>
815 int32_t start_node, int32_t depth, float64_t * weights)
816 {
817 SG_ERROR("code buggy\n")
818
819 int32_t ret=0 ;
820
821 if (start_node==NO_CHILD)
822 {
823 for (int32_t i=0; i<length; i++)
824 compact_nodes(i,1, weights) ;
825 return 0 ;
826 }
827 if (start_node<0)
828 return -1 ;
829
830 if (depth==degree-1)
831 {
832 TRIE_ASSERT_EVERYTHING(TreeMem[start_node].has_floats)
833 int32_t num_used=0 ;
834 for (int32_t q=0; q<4; q++)
835 if (TreeMem[start_node].child_weights[q]!=0.0)
836 num_used++ ;
837 if (num_used>1)
838 return -1 ;
839 return 1 ;
840 }
841 TRIE_ASSERT_EVERYTHING(!TreeMem[start_node].has_floats)
842
843 int32_t num_used = 0 ;
844 int32_t q_used=-1 ;
845
846 for (int32_t q=0; q<4; q++)
847 {
848 if (TreeMem[start_node].children[q]==NO_CHILD)
849 continue ;
850 num_used++ ;
851 q_used=q ;
852 }
853 if (num_used>1)
854 {
855 if (depth>=degree-2)
856 return -1 ;
857 for (int32_t q=0; q<4; q++)
858 {
859 if (TreeMem[start_node].children[q]==NO_CHILD)
860 continue ;
861 int32_t num=compact_nodes(abs(TreeMem[start_node].children[q]), depth+1, weights) ;
862 if (num<=2)
863 continue ;
864 int32_t node=get_node() ;
865
866 int32_t last_node=TreeMem[start_node].children[q] ;
867 if (weights_in_tree)
868 {
869 ASSERT(weights[depth]!=0.0)
870 TreeMem[node].weight=TreeMem[last_node].weight/weights[depth] ;
871 }
872 else
873 TreeMem[node].weight=TreeMem[last_node].weight ;
874
875 #ifdef TRIE_CHECK_EVERYTHING
876 TreeMem[node].has_seq=true ;
877 #endif
878 memset(TreeMem[node].seq, TRIE_TERMINAL_CHARACTER, 16) ;
879 for (int32_t n=0; n<num; n++)
880 {
881 ASSERT(depth+n+1<=degree-1)
882 ASSERT(last_node!=NO_CHILD)
883 if (depth+n+1==degree-1)
884 {
885 TRIE_ASSERT_EVERYTHING(TreeMem[last_node].has_floats)
886 int32_t k ;
887 for (k=0; k<4; k++)
888 if (TreeMem[last_node].child_weights[k]!=0.0)
889 break ;
890 if (k==4)
891 break ;
892 TreeMem[node].seq[n]=k ;
893 break ;
894 }
895 else
896 {
897 TRIE_ASSERT_EVERYTHING(!TreeMem[last_node].has_floats)
898 int32_t k ;
899 for (k=0; k<4; k++)
900 if (TreeMem[last_node].children[k]!=NO_CHILD)
901 break ;
902 if (k==4)
903 break ;
904 TreeMem[node].seq[n]=k ;
905 last_node=TreeMem[last_node].children[k] ;
906 }
907 }
908 TreeMem[start_node].children[q]=-node ;
909 }
910 return -1 ;
911 }
912 if (num_used==0)
913 return 0 ;
914
915 ret=compact_nodes(abs(TreeMem[start_node].children[q_used]), depth+1, weights) ;
916 if (ret<0)
917 return ret ;
918 return ret+1 ;
919 }
920
921
922 template <class Trie>
924 int32_t node, const CTrie<Trie> & other, int32_t other_node)
925 {
926 SG_DEBUG("checking nodes %i and %i\n", node, other_node)
927 if (fabs(TreeMem[node].weight-other.TreeMem[other_node].weight)>=1e-5)
928 {
929 SG_DEBUG("CTrie::compare: TreeMem[%i].weight=%f!=other.TreeMem[%i].weight=%f\n", node, TreeMem[node].weight, other_node,other.TreeMem[other_node].weight)
930 SG_DEBUG(">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n")
931 display_node(node) ;
932 SG_DEBUG("============================================================\n")
933 other.display_node(other_node) ;
934 SG_DEBUG("<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\n")
935 return false ;
936 }
937
938 #ifdef TRIE_CHECK_EVERYTHING
939 if (TreeMem[node].has_seq!=other.TreeMem[other_node].has_seq)
940 {
941 SG_DEBUG("CTrie::compare: TreeMem[%i].has_seq=%i!=other.TreeMem[%i].has_seq=%i\n", node, TreeMem[node].has_seq, other_node,other.TreeMem[other_node].has_seq)
942 SG_DEBUG(">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n")
943 display_node(node) ;
944 SG_DEBUG("============================================================\n")
945 other.display_node(other_node) ;
946 SG_DEBUG("<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\n")
947 return false ;
948 }
949 if (TreeMem[node].has_floats!=other.TreeMem[other_node].has_floats)
950 {
951 SG_DEBUG("CTrie::compare: TreeMem[%i].has_floats=%i!=other.TreeMem[%i].has_floats=%i\n", node, TreeMem[node].has_floats, other_node, other.TreeMem[other_node].has_floats)
952 return false ;
953 }
954 if (other.TreeMem[other_node].has_floats)
955 {
956 for (int32_t q=0; q<4; q++)
957 if (fabs(TreeMem[node].child_weights[q]-other.TreeMem[other_node].child_weights[q])>1e-5)
958 {
959 SG_DEBUG("CTrie::compare: TreeMem[%i].child_weights[%i]=%e!=other.TreeMem[%i].child_weights[%i]=%e\n", node, q,TreeMem[node].child_weights[q], other_node,q,other.TreeMem[other_node].child_weights[q])
960 SG_DEBUG(">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n")
961 display_node(node) ;
962 SG_DEBUG("============================================================\n")
963 other.display_node(other_node) ;
964 SG_DEBUG("<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\n")
965 return false ;
966 }
967 }
968 if (other.TreeMem[other_node].has_seq)
969 {
970 for (int32_t q=0; q<16; q++)
971 if ((TreeMem[node].seq[q]!=other.TreeMem[other_node].seq[q]) && ((TreeMem[node].seq[q]<4)||(other.TreeMem[other_node].seq[q]<4)))
972 {
973 SG_DEBUG("CTrie::compare: TreeMem[%i].seq[%i]=%i!=other.TreeMem[%i].seq[%i]=%i\n", node,q,TreeMem[node].seq[q], other_node,q,other.TreeMem[other_node].seq[q])
974 SG_DEBUG(">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n")
975 display_node(node) ;
976 SG_DEBUG("============================================================\n")
977 other.display_node(other_node) ;
978 SG_DEBUG("<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\n")
979 return false ;
980 }
981 }
982 if (!other.TreeMem[other_node].has_seq && !other.TreeMem[other_node].has_floats)
983 {
984 for (int32_t q=0; q<4; q++)
985 {
986 if ((TreeMem[node].children[q]==NO_CHILD) && (other.TreeMem[other_node].children[q]==NO_CHILD))
987 continue ;
988 if ((TreeMem[node].children[q]==NO_CHILD)!=(other.TreeMem[other_node].children[q]==NO_CHILD))
989 {
990 SG_DEBUG("CTrie::compare: TreeMem[%i].children[%i]=%i!=other.TreeMem[%i].children[%i]=%i\n", node,q,TreeMem[node].children[q], other_node,q,other.TreeMem[other_node].children[q])
991 SG_DEBUG(">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n")
992 display_node(node) ;
993 SG_DEBUG("============================================================\n")
994 other.display_node(other_node) ;
995 SG_DEBUG("<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\n")
996 return false ;
997 }
998 if (!compare_traverse(abs(TreeMem[node].children[q]), other, abs(other.TreeMem[other_node].children[q])))
999 return false ;
1000 }
1001 }
1002 #else
1003 SG_ERROR("not implemented\n")
1004 #endif
1005
1006 return true ;
1007 }
1008
1009 template <class Trie>
1011 {
1012 bool ret=true ;
1013 for (int32_t i=0; i<length; i++)
1014 if (!compare_traverse(trees[i], other, other.trees[i]))
1015 return false ;
1016 else
1017 SG_DEBUG("two tries at %i identical\n", i)
1018
1019 return ret ;
1020 }
1021
1022 template <class Trie>
1024 int32_t node, int32_t * trace, int32_t& trace_len) const
1025 {
1026 #ifdef TRIE_CHECK_EVERYTHING
1027 ASSERT(trace_len-1>=0)
1028 ASSERT((trace[trace_len-1]>=0) && (trace[trace_len-1]<TreeMemPtrMax))
1029 if (TreeMem[trace[trace_len-1]].has_seq)
1030 return false ;
1031 if (TreeMem[trace[trace_len-1]].has_floats)
1032 return false ;
1033
1034 for (int32_t q=0; q<4; q++)
1035 {
1036 if (TreeMem[trace[trace_len-1]].children[q]==NO_CHILD)
1037 continue ;
1038 int32_t tl=trace_len+1 ;
1039 if (TreeMem[trace[trace_len-1]].children[q]>=0)
1040 trace[trace_len]=TreeMem[trace[trace_len-1]].children[q] ;
1041 else
1042 trace[trace_len]=-TreeMem[trace[trace_len-1]].children[q] ;
1043
1044 if (trace[trace_len]==node)
1045 {
1046 trace_len=tl ;
1047 return true ;
1048 }
1049 if (find_node(node, trace, tl))
1050 {
1051 trace_len=tl ;
1052 return true ;
1053 }
1054 }
1055 trace_len=0 ;
1056 return false ;
1057 #else
1058 SG_ERROR("not implemented\n")
1059 return false ;
1060 #endif
1061 }
1062
1063 template <class Trie>
1064 void CTrie<Trie>::display_node(int32_t node) const
1065 {
1066 #ifdef TRIE_CHECK_EVERYTHING
1067 int32_t * trace=SG_MALLOC(int32_t, 2*degree);
1068 int32_t trace_len=-1 ;
1069 bool found = false ;
1070 int32_t tree=-1 ;
1071 for (tree=0; tree<length; tree++)
1072 {
1073 trace[0]=trees[tree] ;
1074 trace_len=1 ;
1075 found=find_node(node, trace, trace_len) ;
1076 if (found)
1077 break ;
1078 }
1079 ASSERT(found)
1080 SG_PRINT("position %i trace: ", tree)
1081
1082 for (int32_t i=0; i<trace_len-1; i++)
1083 {
1084 int32_t branch=-1 ;
1085 for (int32_t q=0; q<4; q++)
1086 if (abs(TreeMem[trace[i]].children[q])==trace[i+1])
1087 {
1088 branch=q;
1089 break ;
1090 }
1091 ASSERT(branch!=-1)
1092 char acgt[5]="ACGT" ;
1093 SG_PRINT("%c", acgt[branch])
1094 }
1095 SG_PRINT("\nnode=%i\nweight=%f\nhas_seq=%i\nhas_floats=%i\n", node, TreeMem[node].weight, TreeMem[node].has_seq, TreeMem[node].has_floats)
1096 if (TreeMem[node].has_floats)
1097 {
1098 for (int32_t q=0; q<4; q++)
1099 SG_PRINT("child_weighs[%i] = %f\n", q, TreeMem[node].child_weights[q])
1100 }
1101 if (TreeMem[node].has_seq)
1102 {
1103 for (int32_t q=0; q<16; q++)
1104 SG_PRINT("seq[%i] = %i\n", q, TreeMem[node].seq[q])
1105 }
1106 if (!TreeMem[node].has_seq && !TreeMem[node].has_floats)
1107 {
1108 for (int32_t q=0; q<4; q++)
1109 {
1110 if (TreeMem[node].children[q]!=NO_CHILD)
1111 {
1112 SG_PRINT("children[%i] = %i -> \n", q, TreeMem[node].children[q])
1113 display_node(abs(TreeMem[node].children[q])) ;
1114 }
1115 else
1116 SG_PRINT("children[%i] = NO_CHILD -| \n", q, TreeMem[node].children[q])
1117 }
1118
1119 }
1120
1121 SG_FREE(trace);
1122 #else
1123 SG_ERROR("not implemented\n")
1124 #endif
1125 }
1126
1127
1128 template <class Trie> CTrie<Trie>::~CTrie()
1129 {
1130 destroy() ;
1131
1132 SG_FREE(TreeMem) ;
1133 }
1134
1135 template <class Trie> void CTrie<Trie>::destroy()
1136 {
1137 if (trees!=NULL)
1138 {
1139 delete_trees();
1140 for (int32_t i=0; i<length; i++)
1141 trees[i] = NO_CHILD;
1142 SG_FREE(trees);
1143
1144 TreeMemPtr=0;
1145 length=0;
1146 trees=NULL;
1147 }
1148 }
1149
1150 template <class Trie> void CTrie<Trie>::set_degree(int32_t d)
1151 {
1152 delete_trees(get_use_compact_terminal_nodes());
1153 degree=d;
1154 }
1155
1156 template <class Trie> void CTrie<Trie>::create(
1157 int32_t len, bool p_use_compact_terminal_nodes)
1158 {
1159 destroy();
1160
1161 trees=SG_MALLOC(int32_t, len);
1162 TreeMemPtr=0 ;
1163 for (int32_t i=0; i<len; i++)
1164 trees[i]=get_node(degree==1);
1165 length = len ;
1166
1167 use_compact_terminal_nodes=p_use_compact_terminal_nodes ;
1168 }
1169
1170
1171 template <class Trie> void CTrie<Trie>::delete_trees(
1172 bool p_use_compact_terminal_nodes)
1173 {
1174 if (trees==NULL)
1175 return;
1176
1177 TreeMemPtr=0 ;
1178 for (int32_t i=0; i<length; i++)
1179 trees[i]=get_node(degree==1);
1180
1181 use_compact_terminal_nodes=p_use_compact_terminal_nodes ;
1182 }
1183
1184 template <class Trie>
1186 {
1187 float64_t ret=0 ;
1188
1189 if (tree==NO_CHILD)
1190 return 0 ;
1191 TRIE_ASSERT(tree>=0)
1192
1193 if (depth==degree-2)
1194 {
1195 ret+=(TreeMem[tree].weight) ;
1196
1197 for (int32_t k=0; k<4; k++)
1198 ret+=(TreeMem[tree].child_weights[k]) ;
1199
1200 return ret ;
1201 }
1202
1203 ret+=(TreeMem[tree].weight) ;
1204
1205 for (int32_t i=0; i<4; i++)
1206 if (TreeMem[tree].children[i]!=NO_CHILD)
1207 ret += compute_abs_weights_tree(TreeMem[tree].children[i], depth+1) ;
1208
1209 return ret ;
1210 }
1211
1212
1213 template <class Trie>
1215 {
1216 float64_t * sum=SG_MALLOC(float64_t, length*4);
1217 for (int32_t i=0; i<length*4; i++)
1218 sum[i]=0 ;
1219 len=length ;
1220
1221 for (int32_t i=0; i<length; i++)
1222 {
1223 TRIE_ASSERT(trees[i]!=NO_CHILD)
1224 for (int32_t k=0; k<4; k++)
1225 {
1226 sum[i*4+k]=compute_abs_weights_tree(TreeMem[trees[i]].children[k], 0) ;
1227 }
1228 }
1229
1230 return sum ;
1231 }
1232
1233 template <class Trie>
1235 int32_t tree, int32_t i, float64_t alpha,
1236 int32_t *vec, int32_t len_rem,
1237 int32_t degree_rec, int32_t mismatch_rec,
1238 int32_t max_mismatch, float64_t * weights)
1239 {
1240 if (tree==NO_CHILD)
1241 tree=trees[i] ;
1242 TRIE_ASSERT(tree!=NO_CHILD)
1243
1244 if ((len_rem<=0) || (mismatch_rec>max_mismatch) || (degree_rec>degree))
1245 return ;
1246 const int32_t other[4][3] = { {1,2,3},{0,2,3},{0,1,3},{0,1,2} } ;
1247
1248 int32_t subtree = NO_CHILD ;
1249
1250 if (degree_rec==degree-1)
1251 {
1252 TRIE_ASSERT_EVERYTHING(TreeMem[tree].has_floats)
1253 if (weights_in_tree)
1254 TreeMem[tree].child_weights[vec[0]] += alpha*weights[degree_rec+degree*mismatch_rec];
1255 else
1256 if (weights[degree_rec]!=0.0)
1257 TreeMem[tree].child_weights[vec[0]] += alpha*weights[degree_rec+degree*mismatch_rec]/weights[degree_rec];
1258 if (mismatch_rec+1<=max_mismatch)
1259 for (int32_t o=0; o<3; o++)
1260 {
1261 if (weights_in_tree)
1262 TreeMem[tree].child_weights[other[vec[0]][o]] += alpha*weights[degree_rec+degree*(mismatch_rec+1)];
1263 else
1264 if (weights[degree_rec]!=0.0)
1265 TreeMem[tree].child_weights[other[vec[0]][o]] += alpha*weights[degree_rec+degree*(mismatch_rec+1)]/weights[degree_rec];
1266 }
1267 return ;
1268 }
1269 else
1270 {
1271 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_floats)
1272 if (TreeMem[tree].children[vec[0]]!=NO_CHILD)
1273 {
1274 subtree=TreeMem[tree].children[vec[0]] ;
1275 if (weights_in_tree)
1276 TreeMem[subtree].weight += alpha*weights[degree_rec+degree*mismatch_rec];
1277 else
1278 if (weights[degree_rec]!=0.0)
1279 TreeMem[subtree].weight += alpha*weights[degree_rec+degree*mismatch_rec]/weights[degree_rec];
1280 }
1281 else
1282 {
1283 int32_t tmp = get_node(degree_rec==degree-2);
1284 ASSERT(tmp>=0)
1285 TreeMem[tree].children[vec[0]]=tmp ;
1286 subtree=tmp ;
1287 #ifdef TRIE_CHECK_EVERYTHING
1288 if (degree_rec==degree-2)
1289 TreeMem[subtree].has_floats=true ;
1290 #endif
1291 if (weights_in_tree)
1292 TreeMem[subtree].weight = alpha*weights[degree_rec+degree*mismatch_rec] ;
1293 else
1294 if (weights[degree_rec]!=0.0)
1295 TreeMem[subtree].weight = alpha*weights[degree_rec+degree*mismatch_rec]/weights[degree_rec] ;
1296 else
1297 TreeMem[subtree].weight = 0.0 ;
1298 }
1299 add_example_to_tree_mismatch_recursion(subtree, i, alpha,
1300 &vec[1], len_rem-1,
1301 degree_rec+1, mismatch_rec, max_mismatch, weights) ;
1302
1303 if (mismatch_rec+1<=max_mismatch)
1304 {
1305 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_floats)
1306 for (int32_t o=0; o<3; o++)
1307 {
1308 int32_t ot = other[vec[0]][o] ;
1309 if (TreeMem[tree].children[ot]!=NO_CHILD)
1310 {
1311 subtree=TreeMem[tree].children[ot] ;
1312 if (weights_in_tree)
1313 TreeMem[subtree].weight += alpha*weights[degree_rec+degree*(mismatch_rec+1)];
1314 else
1315 if (weights[degree_rec]!=0.0)
1316 TreeMem[subtree].weight += alpha*weights[degree_rec+degree*(mismatch_rec+1)]/weights[degree_rec];
1317 }
1318 else
1319 {
1320 int32_t tmp = get_node(degree_rec==degree-2);
1321 ASSERT(tmp>=0)
1322 TreeMem[tree].children[ot]=tmp ;
1323 subtree=tmp ;
1324 #ifdef TRIE_CHECK_EVERYTHING
1325 if (degree_rec==degree-2)
1326 TreeMem[subtree].has_floats=true ;
1327 #endif
1328
1329 if (weights_in_tree)
1330 TreeMem[subtree].weight = alpha*weights[degree_rec+degree*(mismatch_rec+1)] ;
1331 else
1332 if (weights[degree_rec]!=0.0)
1333 TreeMem[subtree].weight = alpha*weights[degree_rec+degree*(mismatch_rec+1)]/weights[degree_rec] ;
1334 else
1335 TreeMem[subtree].weight = 0.0 ;
1336 }
1337
1338 add_example_to_tree_mismatch_recursion(subtree, i, alpha,
1339 &vec[1], len_rem-1,
1340 degree_rec+1, mismatch_rec+1, max_mismatch, weights) ;
1341 }
1342 }
1343 }
1344 }
1345
1346 template <class Trie>
1348 int32_t tree, int32_t i, int32_t j, float64_t weight, int32_t d,
1349 int32_t max_degree, int32_t num_feat, int32_t num_sym, int32_t sym_offset,
1350 int32_t offs, float64_t* result)
1351 {
1352 if (i+j<num_feat)
1353 {
1354 float64_t decay=1.0; //no decay by default
1355 //if (j>d)
1356 // decay=pow(0.5,j); //marginalize out lower order matches
1357
1358 if (j<degree-1)
1359 {
1360 for (int32_t k=0; k<num_sym; k++)
1361 {
1362 if (TreeMem[tree].children[k]!=NO_CHILD)
1363 {
1364 int32_t child=TreeMem[tree].children[k];
1365 //continue recursion if not yet at max_degree, else add to result
1366 if (d<max_degree-1)
1367 compute_scoring_helper(child, i, j+1, weight+decay*TreeMem[child].weight, d+1, max_degree, num_feat, num_sym, sym_offset, num_sym*offs+k, result);
1368 else
1369 result[sym_offset*(i+j-max_degree+1)+num_sym*offs+k] += weight+decay*TreeMem[child].weight;
1370
1372 if (d==0)
1373 compute_scoring_helper(child, i, j+1, 0.0, 0, max_degree, num_feat, num_sym, sym_offset, offs, result);
1374 }
1375 }
1376 }
1377 else if (j==degree-1)
1378 {
1379 for (int32_t k=0; k<num_sym; k++)
1380 {
1381 //continue recursion if not yet at max_degree, else add to result
1382 if (d<max_degree-1 && i<num_feat-1)
1383 compute_scoring_helper(trees[i+1], i+1, 0, weight+decay*TreeMem[tree].child_weights[k], d+1, max_degree, num_feat, num_sym, sym_offset, num_sym*offs+k, result);
1384 else
1385 result[sym_offset*(i+j-max_degree+1)+num_sym*offs+k] += weight+decay*TreeMem[tree].child_weights[k];
1386 }
1387 }
1388 }
1389 }
1390
1391 template <class Trie>
1393 int32_t tree, const int32_t p, struct TreeParseInfo info,
1394 const int32_t depth, int32_t* const x, const int32_t k)
1395 {
1396 const int32_t num_sym = info.num_sym;
1397 const int32_t y0 = info.y0;
1398 const int32_t y1 = (k==0) ? 0 : y0 - ( (depth<k) ? 0 : info.nofsKmers[k-1] * x[depth-k] );
1399 //const int32_t temp = info.substrs[depth]*num_sym - ( (depth<=k) ? 0 : info.nofsKmers[k] * x[depth-k-1] );
1400 //if( !( info.y0 == temp ) ) {
1401 // printf( "\n temp=%d y0=%d k=%d depth=%d \n", temp, info.y0, k, depth );
1402 //}
1403 //ASSERT( info.y0 == temp )
1404 int32_t sym;
1405 ASSERT( depth < degree )
1406 //ASSERT( 0 <= info.substrs[depth] && info.substrs[depth] < info.nofsKmers[k] )
1407 if (depth<degree-1)
1408 {
1409 for( sym=0; sym<num_sym; ++sym ) {
1410 const int32_t childNum = TreeMem[tree].children[ sym ];
1411 if( childNum != NO_CHILD ) {
1412 int32_t child = childNum ;
1413 x[depth] = sym;
1414 info.substrs[depth+1] = y0 + sym;
1415 info.y0 = (k==0) ? 0 : (y1+sym)*num_sym;
1416 //ASSERT( info.y0 == ( info.substrs[depth+1]*num_sym - ( (depth<k) ? 0 : info.nofsKmers[k] * x[depth-k] ) ) )
1417 count( TreeMem[child].weight, depth, info, p, x, k );
1418 traverse( child, p, info, depth+1, x, k );
1419 x[depth] = -1;
1420 }
1421 }
1422 }
1423 else if( depth == degree-1 )
1424 {
1425 for( sym=0; sym<num_sym; ++sym ) {
1426 const float64_t w = TreeMem[tree].child_weights[ sym ];
1427 if( w != 0.0 ) {
1428 x[depth] = sym;
1429 info.substrs[depth+1] = y0 + sym;
1430 info.y0 = (k==0) ? 0 : (y1+sym)*num_sym;
1431 //ASSERT( info.y0 == ( info.substrs[depth+1]*num_sym - ( (depth<k) ? 0 : info.nofsKmers[k] * x[depth-k] ) ) )
1432 count( w, depth, info, p, x, k );
1433 x[depth] = -1;
1434 }
1435 }
1436 }
1437 //info.substrs[depth+1] = -1;
1438 //info.y0 = temp;
1439 }
1440
1441 template <class Trie>
1443 const float64_t w, const int32_t depth, const struct TreeParseInfo info,
1444 const int32_t p, int32_t* x, const int32_t k)
1445 {
1446 ASSERT( fabs(w) < 1e10 )
1447 ASSERT( x[depth] >= 0 )
1448 ASSERT( x[depth+1] < 0 )
1449 if ( depth < k ) {
1450 return;
1451 }
1452 //ASSERT( info.margFactors[ depth-k ] == pow( 0.25, depth-k ) )
1453 const int32_t nofKmers = info.nofsKmers[k];
1454 const float64_t margWeight = w * info.margFactors[ depth-k ];
1455 const int32_t m_a = depth - k + 1;
1456 const int32_t m_b = info.num_feat - p;
1457 const int32_t m = ( m_a < m_b ) ? m_a : m_b;
1458 // all proper k-substrings
1459 const int32_t offset0 = nofKmers * p;
1460 int32_t i;
1461 int32_t offset;
1462 offset = offset0;
1463 for( i = 0; i < m; ++i ) {
1464 const int32_t y = info.substrs[i+k+1];
1465 info.C_k[ y + offset ] += margWeight;
1466 offset += nofKmers;
1467 }
1468 if( depth > k ) {
1469 // k-prefix
1470 const int32_t offsR = info.substrs[k+1] + offset0;
1471 info.R_k[offsR] += margWeight;
1472 // k-suffix
1473 if( p+depth-k < info.num_feat ) {
1474 const int32_t offsL = info.substrs[depth+1] + nofKmers * (p+depth-k);
1475 info.L_k[offsL] += margWeight;
1476 }
1477 }
1478 // # N.x = substring represented by N
1479 // # N.d = length of N.x
1480 // # N.s = starting position of N.x
1481 // # N.w = weight for feature represented by N
1482 // if( N.d >= k )
1483 // margContrib = w / 4^(N.d-k)
1484 // for i = 1 to (N.d-k+1)
1485 // y = N.x[i:(i+k-1)] # overlapped k-mer
1486 // C_k[ N.s+i-1, y ] += margContrib
1487 // end;
1488 // if( N.d > k )
1489 // L_k[ N.s+N.d-k, N.x[N.d-k+(1:k)] ] += margContrib # j-suffix of N.x
1490 // R_k[ N.s, N.x[1:k] ] += margContrib # j-prefix of N.x
1491 // end;
1492 // end;
1493 }
1494
1495 template <class Trie>
1497 int32_t i, int32_t seq_offset, int32_t * vec, float32_t alpha,
1498 float64_t *weights, bool degree_times_position_weights)
1499 {
1500 int32_t tree = trees[i] ;
1501 //ASSERT(seq_offset==0)
1502
1503 int32_t max_depth = 0 ;
1504 float64_t* weights_column ;
1505 if (degree_times_position_weights)
1506 weights_column = &weights[(i+seq_offset)*degree] ;
1507 else
1508 weights_column = weights ;
1509
1510 if (weights_in_tree)
1511 {
1512 for (int32_t j=0; (j<degree) && (i+j<length); j++)
1513 if (CMath::abs(weights_column[j]*alpha)>0)
1514 max_depth = j+1 ;
1515 }
1516 else
1517 // don't use the weights
1518 max_depth=degree ;
1519
1520 for (int32_t j=0; (j<max_depth) && (i+j+seq_offset<length); j++)
1521 {
1522 TRIE_ASSERT((vec[i+j+seq_offset]>=0) && (vec[i+j+seq_offset]<4))
1523 if ((j<degree-1) && (TreeMem[tree].children[vec[i+j+seq_offset]]!=NO_CHILD))
1524 {
1525 if (TreeMem[tree].children[vec[i+j+seq_offset]]<0)
1526 {
1527 // special treatment of the next nodes
1528 TRIE_ASSERT(j >= degree-16)
1529 // get the right element
1530 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1531 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_floats)
1532 int32_t node = - TreeMem[tree].children[vec[i+j+seq_offset]] ;
1533
1534 TRIE_ASSERT((node>=0) && (node<=TreeMemPtrMax))
1535 TRIE_ASSERT_EVERYTHING(TreeMem[node].has_seq)
1536 TRIE_ASSERT_EVERYTHING(!TreeMem[node].has_floats)
1537
1538 // check whether the same string is stored
1539 int32_t mismatch_pos = -1 ;
1540 {
1541 int32_t k ;
1542 for (k=0; (j+k<max_depth) && (i+j+seq_offset+k<length); k++)
1543 {
1544 TRIE_ASSERT((vec[i+j+seq_offset+k]>=0) && (vec[i+j+seq_offset+k]<4))
1545 // ###
1546 if ((TreeMem[node].seq[k]>=4) && (TreeMem[node].seq[k]!=TRIE_TERMINAL_CHARACTER))
1547 fprintf(stderr, "+++i=%i j=%i seq[%i]=%i\n", i, j, k, TreeMem[node].seq[k]) ;
1548 TRIE_ASSERT((TreeMem[node].seq[k]<4) || (TreeMem[node].seq[k]==TRIE_TERMINAL_CHARACTER))
1549 TRIE_ASSERT(k<16)
1550 if (TreeMem[node].seq[k]!=vec[i+j+seq_offset+k])
1551 {
1552 mismatch_pos=k ;
1553 break ;
1554 }
1555 }
1556 }
1557
1558 // what happens when the .seq sequence is longer than vec? should we branch???
1559
1560 if (mismatch_pos==-1)
1561 // if so, then just increase the weight by alpha and stop
1562 TreeMem[node].weight+=alpha ;
1563 else
1564 // otherwise
1565 // 1. replace current node with new node
1566 // 2. create new nodes until mismatching positon
1567 // 2. add a branch with old string (old node) and the new string (new node)
1568 {
1569 // replace old node
1570 int32_t last_node=tree ;
1571
1572 // create new nodes until mismatch
1573 int32_t k ;
1574 for (k=0; k<mismatch_pos; k++)
1575 {
1576 TRIE_ASSERT((vec[i+j+seq_offset+k]>=0) && (vec[i+j+seq_offset+k]<4))
1577 TRIE_ASSERT(vec[i+j+seq_offset+k]==TreeMem[node].seq[k])
1578
1579 int32_t tmp=get_node();
1580 TreeMem[last_node].children[vec[i+j+seq_offset+k]]=tmp ;
1581 last_node=tmp ;
1582 if (weights_in_tree)
1583 TreeMem[last_node].weight = (TreeMem[node].weight+alpha)*weights_column[j+k] ;
1584 else
1585 TreeMem[last_node].weight = (TreeMem[node].weight+alpha) ;
1586 TRIE_ASSERT(j+k!=degree-1)
1587 }
1588 if ((TreeMem[node].seq[mismatch_pos]>=4) && (TreeMem[node].seq[mismatch_pos]!=TRIE_TERMINAL_CHARACTER))
1589 fprintf(stderr, "**i=%i j=%i seq[%i]=%i\n", i, j, k, TreeMem[node].seq[mismatch_pos]) ;
1590 ASSERT((TreeMem[node].seq[mismatch_pos]<4) || (TreeMem[node].seq[mismatch_pos]==TRIE_TERMINAL_CHARACTER))
1591 TRIE_ASSERT(vec[i+j+seq_offset+mismatch_pos]!=TreeMem[node].seq[mismatch_pos])
1592
1593 if (j+k==degree-1)
1594 {
1595 // init child weights with zero if after dropping out
1596 // of the k<mismatch_pos loop we are one level below degree
1597 // (keep this even after get_node() change!)
1598 for (int32_t q=0; q<4; q++)
1599 TreeMem[last_node].child_weights[q]=0.0 ;
1600 if (weights_in_tree)
1601 {
1602 if (TreeMem[node].seq[mismatch_pos]<4) // i.e. !=TRIE_TERMINAL_CHARACTER
1603 TreeMem[last_node].child_weights[TreeMem[node].seq[mismatch_pos]]+=TreeMem[node].weight*weights_column[degree-1] ;
1604 TreeMem[last_node].child_weights[vec[i+j+seq_offset+k]] += alpha*weights_column[degree-1] ;
1605 }
1606 else
1607 {
1608 if (TreeMem[node].seq[mismatch_pos]<4) // i.e. !=TRIE_TERMINAL_CHARACTER
1609 TreeMem[last_node].child_weights[TreeMem[node].seq[mismatch_pos]]=TreeMem[node].weight ;
1610 TreeMem[last_node].child_weights[vec[i+j+seq_offset+k]] = alpha ;
1611 }
1612
1613 #ifdef TRIE_CHECK_EVERYTHING
1614 TreeMem[last_node].has_floats=true ;
1615 #endif
1616 }
1617 else
1618 {
1619 // the branch for the existing string
1620 if (TreeMem[node].seq[mismatch_pos]<4) // i.e. !=TRIE_TERMINAL_CHARACTER
1621 {
1622 TreeMem[last_node].children[TreeMem[node].seq[mismatch_pos]] = -node ;
1623
1624 // move string by mismatch_pos positions
1625 for (int32_t q=0; q<16; q++)
1626 {
1627 if ((j+q+mismatch_pos<degree) && (i+j+seq_offset+q+mismatch_pos<length))
1628 TreeMem[node].seq[q] = TreeMem[node].seq[q+mismatch_pos] ;
1629 else
1630 TreeMem[node].seq[q] = TRIE_TERMINAL_CHARACTER ;
1631 }
1632 #ifdef TRIE_CHECK_EVERYTHING
1633 TreeMem[node].has_seq=true ;
1634 #endif
1635 }
1636
1637 // the new branch
1638 TRIE_ASSERT((vec[i+j+seq_offset+mismatch_pos]>=0) && (vec[i+j+seq_offset+mismatch_pos]<4))
1639 int32_t tmp = get_node() ;
1640 TreeMem[last_node].children[vec[i+j+seq_offset+mismatch_pos]] = -tmp ;
1641 last_node=tmp ;
1642
1643 TreeMem[last_node].weight = alpha ;
1644 #ifdef TRIE_CHECK_EVERYTHING
1645 TreeMem[last_node].has_seq = true ;
1646 #endif
1647 memset(TreeMem[last_node].seq, TRIE_TERMINAL_CHARACTER, 16) ;
1648 for (int32_t q=0; (j+q+mismatch_pos<degree) && (i+j+seq_offset+q+mismatch_pos<length); q++)
1649 TreeMem[last_node].seq[q] = vec[i+j+seq_offset+mismatch_pos+q] ;
1650 }
1651 }
1652 break ;
1653 }
1654 else
1655 {
1656 tree=TreeMem[tree].children[vec[i+j+seq_offset]] ;
1657 TRIE_ASSERT((tree>=0) && (tree<TreeMemPtrMax))
1658 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1659 if (weights_in_tree)
1660 TreeMem[tree].weight += alpha*weights_column[j];
1661 else
1662 TreeMem[tree].weight += alpha ;
1663 }
1664 }
1665 else if (j==degree-1)
1666 {
1667 // special treatment of the last node
1668 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1669 TRIE_ASSERT_EVERYTHING(TreeMem[tree].has_floats)
1670 if (weights_in_tree)
1671 TreeMem[tree].child_weights[vec[i+j+seq_offset]] += alpha*weights_column[j] ;
1672 else
1673 TreeMem[tree].child_weights[vec[i+j+seq_offset]] += alpha;
1674
1675 break;
1676 }
1677 else
1678 {
1679 bool use_seq = use_compact_terminal_nodes && (j>degree-16) ;
1680 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1681 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_floats)
1682
1683 int32_t tmp = get_node((j==degree-2) && (!use_seq));
1684 if (use_seq)
1685 TreeMem[tree].children[vec[i+j+seq_offset]] = -tmp ;
1686 else
1687 TreeMem[tree].children[vec[i+j+seq_offset]] = tmp ;
1688 tree=tmp ;
1689
1690 TRIE_ASSERT((tree>=0) && (tree<TreeMemPtrMax))
1691 #ifdef TRIE_CHECK_EVERYTHING
1692 TreeMem[tree].has_seq = use_seq ;
1693 #endif
1694 if (use_seq)
1695 {
1696 TreeMem[tree].weight = alpha ;
1697 // important to have the terminal characters (see ###)
1698 memset(TreeMem[tree].seq, TRIE_TERMINAL_CHARACTER, 16) ;
1699 for (int32_t q=0; (j+q<degree) && (i+j+seq_offset+q<length); q++)
1700 {
1701 TRIE_ASSERT(q<16)
1702 TreeMem[tree].seq[q]=vec[i+j+seq_offset+q] ;
1703 }
1704 break ;
1705 }
1706 else
1707 {
1708 if (weights_in_tree)
1709 TreeMem[tree].weight = alpha*weights_column[j] ;
1710 else
1711 TreeMem[tree].weight = alpha ;
1712 #ifdef TRIE_CHECK_EVERYTHING
1713 if (j==degree-2)
1714 TreeMem[tree].has_floats = true ;
1715 #endif
1716 }
1717 }
1718 }
1719 }
1720
1721 template <class Trie>
1723 int32_t* vec, int32_t len, int32_t seq_pos, int32_t tree_pos,
1724 int32_t weight_pos, float64_t* weights,
1725 bool degree_times_position_weights)
1726 {
1727 int32_t tree = trees[tree_pos] ;
1728
1729 if ((position_weights!=NULL) && (position_weights[weight_pos]==0))
1730 return 0.0;
1731
1732 float64_t *weights_column=NULL ;
1733 if (degree_times_position_weights)
1734 weights_column=&weights[weight_pos*degree] ;
1735 else // weights is a vector (1 x degree)
1736 weights_column=weights ;
1737
1738 float64_t sum=0 ;
1739 for (int32_t j=0; seq_pos+j < len; j++)
1740 {
1741 TRIE_ASSERT((vec[seq_pos+j]<4) && (vec[seq_pos+j]>=0))
1742
1743 if ((j<degree-1) && (TreeMem[tree].children[vec[seq_pos+j]]!=NO_CHILD))
1744 {
1745 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_floats)
1746 if (TreeMem[tree].children[vec[seq_pos+j]]<0)
1747 {
1748 tree = - TreeMem[tree].children[vec[seq_pos+j]];
1749 TRIE_ASSERT(tree>=0)
1750 TRIE_ASSERT_EVERYTHING(TreeMem[tree].has_seq)
1751 float64_t this_weight=0.0 ;
1752 for (int32_t k=0; (j+k<degree) && (seq_pos+j+k<length); k++)
1753 {
1754 TRIE_ASSERT((vec[seq_pos+j+k]<4) && (vec[seq_pos+j+k]>=0))
1755 if (TreeMem[tree].seq[k]!=vec[seq_pos+j+k])
1756 break ;
1757 this_weight += weights_column[j+k] ;
1758 }
1759 sum += TreeMem[tree].weight * this_weight ;
1760 break ;
1761 }
1762 else
1763 {
1764 tree=TreeMem[tree].children[vec[seq_pos+j]];
1765 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1766 if (weights_in_tree)
1767 sum += TreeMem[tree].weight ;
1768 else
1769 sum += TreeMem[tree].weight * weights_column[j] ;
1770 } ;
1771 }
1772 else
1773 {
1774 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1775 if (j==degree-1)
1776 {
1777 TRIE_ASSERT_EVERYTHING(TreeMem[tree].has_floats)
1778 if (weights_in_tree)
1779 sum += TreeMem[tree].child_weights[vec[seq_pos+j]] ;
1780 else
1781 sum += TreeMem[tree].child_weights[vec[seq_pos+j]] * weights_column[j] ;
1782 }
1783 else
1784 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_floats)
1785
1786 break;
1787 }
1788 }
1789
1790 if (position_weights!=NULL)
1791 return sum*position_weights[weight_pos] ;
1792 else
1793 return sum ;
1794 }
1795
1796 template <class Trie>
1798 int32_t* vec, int32_t len, int32_t seq_pos, int32_t tree_pos,
1799 int32_t weight_pos, float64_t* LevelContrib, float64_t factor,
1800 int32_t mkl_stepsize, float64_t * weights,
1801 bool degree_times_position_weights)
1802 {
1803 int32_t tree = trees[tree_pos] ;
1804 if (factor==0)
1805 return ;
1806
1807 if (position_weights!=NULL)
1808 {
1809 factor *= position_weights[weight_pos] ;
1810 if (factor==0)
1811 return ;
1812 if (!degree_times_position_weights) // with position_weigths, weights is a vector (1 x degree)
1813 {
1814 for (int32_t j=0; seq_pos+j<len; j++)
1815 {
1816 if ((j<degree-1) && (TreeMem[tree].children[vec[seq_pos+j]]!=NO_CHILD))
1817 {
1818 if (TreeMem[tree].children[vec[seq_pos+j]]<0)
1819 {
1820 tree = -TreeMem[tree].children[vec[seq_pos+j]];
1821 TRIE_ASSERT_EVERYTHING(TreeMem[tree].has_seq)
1822 for (int32_t k=0; (j+k<degree) && (seq_pos+j+k<length); k++)
1823 {
1824 if (TreeMem[tree].seq[k]!=vec[seq_pos+j+k])
1825 break ;
1826 if (weights_in_tree)
1827 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].weight ;
1828 else
1829 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].weight*weights[j+k] ;
1830 }
1831 break ;
1832 }
1833 else
1834 {
1835 tree=TreeMem[tree].children[vec[seq_pos+j]];
1836 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1837 if (weights_in_tree)
1838 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].weight ;
1839 else
1840 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].weight*weights[j] ;
1841 }
1842 }
1843 else
1844 {
1845 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1846 if (j==degree-1)
1847 {
1848 if (weights_in_tree)
1849 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].child_weights[vec[seq_pos+j]] ;
1850 else
1851 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].child_weights[vec[seq_pos+j]]*weights[j] ;
1852 }
1853 }
1854 }
1855 }
1856 else // with position_weigths, weights is a matrix (len x degree)
1857 {
1858 for (int32_t j=0; seq_pos+j<len; j++)
1859 {
1860 if ((j<degree-1) && (TreeMem[tree].children[vec[seq_pos+j]]!=NO_CHILD))
1861 {
1862 if (TreeMem[tree].children[vec[seq_pos+j]]<0)
1863 {
1864 tree = -TreeMem[tree].children[vec[seq_pos+j]];
1865 TRIE_ASSERT_EVERYTHING(TreeMem[tree].has_seq)
1866 for (int32_t k=0; (j+k<degree) && (seq_pos+j+k<length); k++)
1867 {
1868 if (TreeMem[tree].seq[k]!=vec[seq_pos+j+k])
1869 break ;
1870 if (weights_in_tree)
1871 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].weight ;
1872 else
1873 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].weight*weights[j+k+weight_pos*degree] ;
1874 }
1875 break ;
1876 }
1877 else
1878 {
1879 tree=TreeMem[tree].children[vec[seq_pos+j]];
1880 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1881 if (weights_in_tree)
1882 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].weight ;
1883 else
1884 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].weight*weights[j+weight_pos*degree] ;
1885 }
1886 }
1887 else
1888 {
1889 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1890 if (j==degree-1)
1891 {
1892 if (weights_in_tree)
1893 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].child_weights[vec[seq_pos+j]] ;
1894 else
1895 LevelContrib[weight_pos/mkl_stepsize] += factor*TreeMem[tree].child_weights[vec[seq_pos+j]]*weights[j+weight_pos*degree] ;
1896 }
1897 break ;
1898 }
1899 }
1900 }
1901 }
1902 else if (!degree_times_position_weights) // no position_weigths, weights is a vector (1 x degree)
1903 {
1904 for (int32_t j=0; seq_pos+j<len; j++)
1905 {
1906 if ((j<degree-1) && (TreeMem[tree].children[vec[seq_pos+j]]!=NO_CHILD))
1907 {
1908 if (TreeMem[tree].children[vec[seq_pos+j]]<0)
1909 {
1910 tree = -TreeMem[tree].children[vec[seq_pos+j]];
1911 TRIE_ASSERT_EVERYTHING(TreeMem[tree].has_seq)
1912 for (int32_t k=0; (j+k<degree) && (seq_pos+j+k<length); k++)
1913 {
1914 if (TreeMem[tree].seq[k]!=vec[seq_pos+j+k])
1915 break ;
1916 if (weights_in_tree)
1917 LevelContrib[(j+k)/mkl_stepsize] += factor*TreeMem[tree].weight ;
1918 else
1919 LevelContrib[(j+k)/mkl_stepsize] += factor*TreeMem[tree].weight*weights[j+k] ;
1920 }
1921 break ;
1922 }
1923 else
1924 {
1925 tree=TreeMem[tree].children[vec[seq_pos+j]];
1926 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1927 if (weights_in_tree)
1928 LevelContrib[j/mkl_stepsize] += factor*TreeMem[tree].weight ;
1929 else
1930 LevelContrib[j/mkl_stepsize] += factor*TreeMem[tree].weight*weights[j] ;
1931 }
1932 }
1933 else
1934 {
1935 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1936 if (j==degree-1)
1937 {
1938 if (weights_in_tree)
1939 LevelContrib[j/mkl_stepsize] += factor*TreeMem[tree].child_weights[vec[seq_pos+j]] ;
1940 else
1941 LevelContrib[j/mkl_stepsize] += factor*TreeMem[tree].child_weights[vec[seq_pos+j]]*weights[j] ;
1942 }
1943 break ;
1944 }
1945 }
1946 }
1947 else // no position_weigths, weights is a matrix (len x degree)
1948 {
1949 /*if (!position_mask)
1950 {
1951 position_mask = SG_MALLOC(bool, len);
1952 for (int32_t i=0; i<len; i++)
1953 {
1954 position_mask[i]=false ;
1955
1956 for (int32_t j=0; j<degree; j++)
1957 if (weights[i*degree+j]!=0.0)
1958 {
1959 position_mask[i]=true ;
1960 break ;
1961 }
1962 }
1963 }
1964 if (position_mask[weight_pos]==0)
1965 return ;*/
1966
1967 for (int32_t j=0; seq_pos+j<len; j++)
1968 {
1969 if ((j<degree-1) && (TreeMem[tree].children[vec[seq_pos+j]]!=NO_CHILD))
1970 {
1971 if (TreeMem[tree].children[vec[seq_pos+j]]<0)
1972 {
1973 tree = -TreeMem[tree].children[vec[seq_pos+j]];
1974 TRIE_ASSERT_EVERYTHING(TreeMem[tree].has_seq)
1975 for (int32_t k=0; (j+k<degree) && (seq_pos+j+k<length); k++)
1976 {
1977 if (TreeMem[tree].seq[k]!=vec[seq_pos+j+k])
1978 break ;
1979 if (weights_in_tree)
1980 LevelContrib[(j+k+degree*weight_pos)/mkl_stepsize] += factor*TreeMem[tree].weight ;
1981 else
1982 LevelContrib[(j+k+degree*weight_pos)/mkl_stepsize] += factor*TreeMem[tree].weight*weights[j+k+weight_pos*degree] ;
1983 }
1984 break ;
1985 }
1986 else
1987 {
1988 tree=TreeMem[tree].children[vec[seq_pos+j]];
1989 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1990 if (weights_in_tree)
1991 LevelContrib[(j+degree*weight_pos)/mkl_stepsize] += factor * TreeMem[tree].weight ;
1992 else
1993 LevelContrib[(j+degree*weight_pos)/mkl_stepsize] += factor * TreeMem[tree].weight * weights[j+weight_pos*degree] ;
1994 }
1995 }
1996 else
1997 {
1998 TRIE_ASSERT_EVERYTHING(!TreeMem[tree].has_seq)
1999 if (j==degree-1)
2000 {
2001 if (weights_in_tree)
2002 LevelContrib[(j+degree*weight_pos)/mkl_stepsize] += factor * TreeMem[tree].child_weights[vec[seq_pos+j]] ;
2003 else
2004 LevelContrib[(j+degree*weight_pos)/mkl_stepsize] += factor * TreeMem[tree].child_weights[vec[seq_pos+j]] * weights[j+weight_pos*degree] ;
2005 }
2006 break ;
2007 }
2008 }
2009 }
2010 }
2011
2012 template <class Trie>
2014 Trie* tree, int32_t depth, uint64_t seq, float64_t value,
2015 DynArray<ConsensusEntry>* table, float64_t* weights)
2016 {
2017 float64_t w=1.0;
2018
2019 if (weights_in_tree || depth==0)
2020 value+=tree->weight;
2021 else
2022 {
2023 w=weights[degree-1];
2024 value+=weights[depth-1]*tree->weight;
2025 }
2026
2027 if (degree-1==depth)
2028 {
2029 for (int32_t sym=0; sym<4; sym++)
2030 {
2031 float64_t v=w*tree->child_weights[sym];
2032 if (v!=0.0)
2033 {
2034 ConsensusEntry entry;
2035 entry.bt=-1;
2036 entry.score=value+v;
2037 entry.string=seq | ((uint64_t) sym) << (2*(degree-depth-1));
2038
2039 table->append_element(entry);
2040 }
2041 }
2042 }
2043 else
2044 {
2045 for (int32_t sym=0; sym<4; sym++)
2046 {
2047 uint64_t str=seq | ((uint64_t) sym) << (2*(degree-depth-1));
2048 if (tree->children[sym] != NO_CHILD)
2049 fill_backtracking_table_recursion(&TreeMem[tree->children[sym]], depth+1, str, value, table, weights);
2050 }
2051 }
2052 }
2053
2054 template <class Trie>
2056 int32_t pos, uint64_t seq, int32_t deg, float64_t* weights)
2057 {
2058 float64_t result=0.0;
2059
2060 //SG_PRINT("pos:%i length:%i deg:%i seq:0x%0llx...\n", pos, length, deg, seq)
2061
2062 for (int32_t i=pos; i<pos+deg && i<length; i++)
2063 {
2064 //SG_PRINT("loop %d\n", i)
2065 Trie* tree = &TreeMem[trees[i]];
2066
2067 for (int32_t d=0; d<deg-i+pos; d++)
2068 {
2069 //SG_PRINT("loop degree %d shit: %d\n", d, (2*(deg-1-d-i+pos)))
2070 ASSERT(d-1<degree)
2071 int32_t sym = (int32_t) (seq >> (2*(deg-1-d-i+pos)) & 3);
2072
2073 float64_t w=1.0;
2074 if (!weights_in_tree)
2075 w=weights[d];
2076
2077 ASSERT(tree->children[sym] != NO_CHILD)
2078 tree=&TreeMem[tree->children[sym]];
2079 result+=w*tree->weight;
2080 }
2081 }
2082 //SG_PRINT("cum: %f\n", result)
2083 return result;
2084 }
2085
2086 template <class Trie>
2088 int32_t pos, DynArray<ConsensusEntry>* prev,
2089 DynArray<ConsensusEntry>* cur, bool cumulative, float64_t* weights)
2090 {
2091 ASSERT(pos>=0 && pos<length)
2092 ASSERT(!use_compact_terminal_nodes)
2093
2094 Trie* t = &TreeMem[trees[pos]];
2095
2096 fill_backtracking_table_recursion(t, 0, (uint64_t) 0, 0.0, cur, weights);
2097
2098
2099 if (cumulative)
2100 {
2101 int32_t num_cur=cur->get_num_elements();
2102 for (int32_t i=0; i<num_cur; i++)
2103 {
2104 ConsensusEntry entry=cur->get_element(i);
2105 entry.score+=get_cumulative_score(pos+1, entry.string, degree-1, weights);
2106 cur->set_element(entry,i);
2107 //SG_PRINT("cum: str:0%0llx sc:%f bt:%d\n",entry.string,entry.score,entry.bt)
2108 }
2109 }
2110
2111 //if previous tree exists find maximum scoring path
2112 //for each element in cur and update bt table
2113 if (prev)
2114 {
2115 int32_t num_cur=cur->get_num_elements();
2116 int32_t num_prev=prev->get_num_elements();
2117
2118 for (int32_t i=0; i<num_cur; i++)
2119 {
2120 //uint64_t str_cur_old= cur->get_element(i).string;
2121 uint64_t str_cur= cur->get_element(i).string >> 2;
2122 //SG_PRINT("...cur:0x%0llx cur_noprfx:0x%0llx...\n", str_cur_old, str_cur)
2123
2124 int32_t bt=-1;
2125 float64_t max_score=0.0;
2126
2127 for (int32_t j=0; j<num_prev; j++)
2128 {
2129 //uint64_t str_prev_old= prev->get_element(j).string;
2130 uint64_t mask=
2131 ((((uint64_t)0)-1) ^ (((uint64_t) 3) << (2*(degree-1))));
2132 uint64_t str_prev= mask & prev->get_element(j).string;
2133 //SG_PRINT("...prev:0x%0llx prev_nosfx:0x%0llx mask:%0llx...\n", str_prev_old, str_prev,mask)
2134
2135 if (str_cur == str_prev)
2136 {
2137 float64_t sc=prev->get_element(j).score+cur->get_element(i).score;
2138 if (bt==-1 || sc>max_score)
2139 {
2140 bt=j;
2141 max_score=sc;
2142
2143 //SG_PRINT("new_max[%i,%i] = %f\n", j,i, max_score)
2144 }
2145 }
2146 }
2147
2148 ASSERT(bt!=-1)
2149 ConsensusEntry entry;
2150 entry.bt=bt;
2151 entry.score=max_score;
2152 entry.string=cur->get_element(i).string;
2153 cur->set_element(entry, i);
2154 //SG_PRINT("entry[%d]: str:0%0llx sc:%f bt:%d\n",i, entry.string,entry.score,entry.bt)
2155 }
2156 }
2157 }
2158 }
2159 #endif // _TRIE_H___
SHOGUN Machine Learning Toolbox - Documentation
|
{
"url": "http://www.shogun-toolbox.org/doc/en/latest/Trie_8h_source.html",
"source_domain": "www.shogun-toolbox.org",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "289832",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M7X7JCSS6YRGJENUYLTS5MF5YKT7BNPY",
"WARC-Concurrent-To": "<urn:uuid:48dc3ff3-3cfe-4308-b9e1-a8f7ad3901b0>",
"WARC-Date": "2015-01-29T00:20:03Z",
"WARC-IP-Address": "94.23.237.10",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JV57N56LY32C5BTBQA7YE2YVFGYJHX4X",
"WARC-Record-ID": "<urn:uuid:2863cb41-07e5-4742-adcb-26a925cd329a>",
"WARC-Target-URI": "http://www.shogun-toolbox.org/doc/en/latest/Trie_8h_source.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0779c13b-9bda-4cce-b437-afbbd26e3ee5>"
},
"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,
14,
125,
132,
170,
175,
249,
323,
394,
435,
440,
485,
527,
606,
613,
617,
639,
661,
665,
699,
703,
737,
768,
805,
842,
846,
866,
871,
907,
911,
952,
995,
999,
1026,
1061,
1065,
1097,
1144,
1153,
1190,
1200,
1204,
1242,
1268,
1272,
1309,
1313,
1338,
1343,
1364,
1385,
1401,
1407,
1411,
1430,
1435,
1457,
1489,
1493,
1511,
1532,
1542,
1552,
1558,
1590,
1615,
1637,
1644,
1648,
1665,
1682,
1699,
1705,
1709,
1727,
1732,
1754,
1786,
1790,
1808,
1829,
1839,
1849,
1855,
1887,
1913,
1936,
1944,
1951,
1956,
1983,
2005,
2028,
2044,
2060,
2085,
2114,
2131,
2154,
2171,
2192,
2213,
2234,
2241,
2246,
2285,
2290,
2329,
2334,
2366,
2371,
2448,
2454,
2467,
2481,
2486,
2549,
2554,
2589,
2612,
2617,
2670,
2675,
2703,
2764,
2769,
2809,
2814,
2892,
2897,
2929,
2984,
2989,
3033,
3038,
3059,
3064,
3097,
3102,
3173,
3178,
3242,
3247,
3270,
3337,
3399,
3404,
3474,
3479,
3530,
3535,
3602,
3648,
3691,
3696,
3763,
3831,
3879,
3921,
3926,
3996,
4056,
4115,
4120,
4181,
4245,
4294,
4299,
4319,
4382,
4444,
4449,
4466,
4511,
4578,
4601,
4606,
4690,
4695,
4761,
4766,
4829,
4888,
4893,
4943,
4996,
5022,
5027,
5098,
5103,
5164,
5169,
5194,
5264,
5312,
5317,
5342,
5395,
5422,
5427,
5434,
5441,
5446,
5486,
5493,
5556,
5563,
5568,
5609,
5616,
5640,
5647,
5652,
5721,
5728,
5770,
5777,
5782,
5833,
5840,
5873,
5896,
5901,
5921,
5928,
5961,
6001,
6008,
6018,
6025,
6058,
6098,
6105,
6138,
6172,
6209,
6220,
6250,
6268,
6275,
6280,
6313,
6320,
6360,
6373,
6433,
6496,
6531,
6594,
6659,
6666,
6671,
6731,
6738,
6779,
6786,
6791,
6830,
6837,
6866,
6873,
6878,
6949,
7017,
7022,
7076,
7131,
7194,
7228,
7233,
7238,
7292,
7347,
7416,
7421,
7486,
7557,
7584,
7589,
7659,
7720,
7791,
7818,
7823,
7884,
7889,
7902,
7925,
7930,
7946,
7967,
7989,
7994,
8015,
8020,
8040,
8065,
8093,
8098,
8103,
8128,
8135,
8162,
8217,
8257,
8284,
8291,
8296,
8318,
8337,
8356,
8361,
8376,
8393,
8398,
8415,
8422,
8427,
8454,
8524,
8579,
8642,
8669,
8676,
8719,
8738,
8783,
8788,
8803,
8820,
8825,
8842,
8849,
8854,
8881,
8928,
9003,
9071,
9078,
9119,
9126,
9171,
9217,
9274,
9281,
9291,
9319,
9324,
9360,
9405,
9472,
9477,
9505,
9544,
9582,
9614,
9619,
9636,
9643,
9648,
9675,
9681,
9710,
9779,
9784,
9816,
9845,
9886,
9893,
9942,
10006,
10052,
10109,
10116,
10126,
10155,
10160,
10203,
10240,
10264,
10311,
10379,
10384,
10415,
10431,
10452,
10491,
10529,
10562,
10567,
10587,
10593,
10598,
10624,
10678,
10684,
10717,
10738,
10783,
10788,
10819,
10826,
10864,
10871,
10902,
10961,
11013,
11033,
11040,
11076,
11093,
11100,
11107,
11125,
11132,
11137,
11175,
11182,
11216,
11278,
11291,
11322,
11340,
11347,
11388,
11395,
11426,
11442,
11449,
11454,
11487,
11494,
11525,
11577,
11593,
11687,
11707,
11714,
11750,
11767,
11774,
11781,
11799,
11809,
11844,
11860,
11871,
11877,
11882,
11909,
11970,
11976,
12006,
12011,
12032,
12037,
12068,
12075,
12113,
12148,
12164,
12171,
12194,
12211,
12216,
12242,
12249,
12309,
12335,
12368,
12420,
12438,
12459,
12476,
12492,
12499,
12560,
12565,
12593,
12618,
12623,
12656,
12663,
12715,
12731,
12749,
12765,
12772,
12793,
12800,
12826,
12843,
12876,
12883,
12935,
12951,
13040,
13057,
13073,
13104,
13109,
13166,
13192,
13199,
13232,
13301,
13308,
13318,
13372,
13377,
13410,
13444,
13455,
13517,
13552,
13559,
13592,
13625,
13655,
13662,
13721,
13738,
13763,
13814,
13827,
13842,
13855,
13885,
13898,
13905,
13915,
13922,
13982,
13999,
14024,
14075,
14088,
14103,
14116,
14146,
14194,
14201,
14208,
14253,
14260,
14277,
14284,
14306,
14322,
14327,
14413,
14429,
14447,
14467,
14473,
14478,
14483,
14510,
14576,
14582,
14644,
14720,
14727,
14886,
14966,
14992,
15072,
15110,
15190,
15210,
15217,
15222,
15255,
15322,
15329,
15492,
15572,
15598,
15678,
15716,
15796,
15816,
15823,
15896,
15903,
16079,
16099,
16106,
16153,
16160,
16193,
16288,
16295,
16500,
16580,
16606,
16686,
16724,
16804,
16824,
16831,
16838,
16882,
16889,
16923,
17058,
17065,
17229,
17309,
17335,
17415,
17453,
17533,
17553,
17560,
17567,
17653,
17660,
17693,
17700,
17801,
17817,
17916,
17923,
18107,
18187,
18213,
18293,
18331,
18411,
18431,
18438,
18549,
18569,
18577,
18585,
18596,
18632,
18644,
18650,
18670,
18677,
18683,
18711,
18718,
18740,
18779,
18841,
18862,
18873,
18922,
18928,
18947,
18954,
18960,
18987,
19050,
19057,
19091,
19120,
19196,
19243,
19264,
19314,
19335,
19341,
19375,
19383,
19444,
19461,
19492,
19546,
19611,
19622,
19688,
19694,
19728,
19736,
19757,
19777,
19785,
19823,
19831,
19852,
19872,
19880,
19888,
19908,
19929,
19940,
19976,
19997,
20009,
20016,
20022,
20049,
20105,
20112,
20146,
20198,
20227,
20254,
20278,
20318,
20326,
20355,
20375,
20423,
20440,
20454,
20462,
20482,
20526,
20532,
20576,
20584,
20610,
20644,
20702,
20710,
20726,
20740,
20748,
20773,
20801,
20836,
20844,
20989,
21025,
21033,
21067,
21144,
21152,
21185,
21193,
21228,
21286,
21294,
21357,
21365,
21399,
21407,
21454,
21462,
21534,
21587,
21595,
21606,
21684,
21692,
21698,
21706,
21712,
21734,
21745,
21781,
21793,
21800,
21806,
21812,
21861,
21868,
21886,
21892,
21917,
21924,
21930,
21985,
21992,
22015,
22023,
22045,
22084,
22111,
22133,
22139,
22159,
22175,
22193,
22201,
22208,
22214,
22281,
22288,
22342,
22358,
22365,
22371,
22424,
22478,
22485,
22502,
22508,
22545,
22566,
22602,
22638,
22659,
22665,
22729,
22736,
22742,
22748,
22807,
22848,
22855,
22878,
22892,
22898,
22919,
22958,
22994,
23000,
23064,
23071,
23077,
23105,
23112,
23136,
23142,
23168,
23185,
23212,
23218,
23245,
23253,
23289,
23295,
23329,
23375,
23381,
23400,
23408,
23414,
23450,
23456,
23490,
23537,
23613,
23619,
23638,
23645,
23651,
23657,
23685,
23692,
23746,
23787,
23804,
23823,
23829,
23868,
23876,
23914,
23948,
23956,
24034,
24042,
24050,
24056,
24075,
24082,
24088,
24116,
24164,
24201,
24249,
24298,
24305,
24331,
24353,
24387,
24393,
24471,
24486,
24558,
24564,
24599,
24605,
24637,
24645,
24700,
24727,
24819,
24830,
24866,
24978,
25018,
25052,
25060,
25087,
25193,
25204,
25240,
25366,
25374,
25389,
25397,
25408,
25416,
25472,
25524,
25532,
25579,
25606,
25686,
25697,
25733,
25833,
25841,
25852,
25860,
25912,
25933,
25976,
25996,
26030,
26062,
26103,
26115,
26142,
26222,
26233,
26269,
26369,
26380,
26418,
26426,
26490,
26516,
26575,
26581,
26621,
26629,
26685,
26719,
26727,
26765,
26813,
26821,
26864,
26891,
26975,
26986,
27022,
27126,
27134,
27145,
27153,
27205,
27226,
27265,
27285,
27319,
27351,
27392,
27404,
27410,
27437,
27521,
27532,
27568,
27672,
27683,
27721,
27729,
27735,
27799,
27825,
27886,
27894,
27902,
27910,
27917,
27923,
27951,
28022,
28103,
28142,
28149,
28173,
28181,
28230,
28247,
28312,
28318,
28340,
28348,
28388,
28396,
28443,
28451,
28498,
28570,
28596,
28749,
28760,
28858,
28864,
28880,
28990,
28998,
29006,
29014,
29042,
29050,
29090,
29098,
29170,
29212,
29379,
29390,
29497,
29505,
29513,
29521,
29528,
29534,
29562,
29626,
29688,
29695,
29739,
29773,
29870,
29984,
30021,
30102,
30112,
30146,
30165,
30196,
30282,
30308,
30316,
30357,
30419,
30454,
30487,
30509,
30549,
30596,
30712,
30772,
30821,
30842,
30850,
30858,
30866,
30901,
30909,
30950,
31012,
31035,
31057,
31097,
31144,
31260,
31300,
31321,
31329,
31337,
31345,
31381,
31405,
31412,
31418,
31446,
31525,
31577,
31584,
31615,
31645,
31676,
31701,
31715,
31723,
31793,
31843,
31911,
31952,
31997,
32048,
32081,
32125,
32142,
32164,
32188,
32221,
32266,
32310,
32336,
32344,
32368,
32386,
32443,
32480,
32498,
32538,
32614,
32651,
32659,
32667,
32711,
32742,
32784,
32837,
32861,
32898,
32930,
32977,
33019,
33033,
33056,
33133,
33196,
33210,
33224,
33231,
33237,
33265,
33334,
33396,
33403,
33435,
33465,
33471,
33501,
33535,
33576,
33633,
33644,
33677,
33683,
33710,
33718,
33775,
33824,
33848,
33856,
33867,
33898,
33923,
33929,
34000,
34008,
34079,
34162,
34170,
34227,
34235,
34280,
34314,
34345,
34398,
34454,
34523,
34529,
34583,
34635,
34691,
34697,
34746,
34780,
34788,
34806,
34873,
34881,
34956,
34969,
35057,
35141,
35236,
35260,
35315,
35323,
35346,
35360,
35368,
35376,
35384,
35390,
35475,
35481,
35509,
35573,
35609,
35620,
35639,
35686,
35741,
35823,
35831,
35857,
35888,
35894,
35935,
35953,
35990,
35998,
36073,
36136,
36142,
36172,
36235,
36257,
36284,
36369,
36380,
36445,
36478,
36486,
36596,
36690,
36802,
36887,
36893,
36918,
36926,
36986,
37052,
37103,
37137,
37185,
37212,
37220,
37299,
37420,
37518,
37526,
37537,
37545,
37624,
37719,
37791,
37799,
37805,
37839,
37882,
37894,
37902,
37913,
37921,
37965,
38044,
38052,
38129,
38135,
38182,
38217,
38225,
38304,
38369,
38380,
38435,
38443,
38477,
38512,
38524,
38532,
38538,
38562,
38659,
38692,
38769,
38791,
38797,
38839,
38873,
38915,
38927,
38995,
39093,
39164,
39172,
39180,
39194,
39202,
39213,
39221,
39278,
39331,
39384,
39411,
39466,
39477,
39515,
39523,
39531,
39559,
39567,
39611,
39664,
39719,
39746,
39830,
39841,
39906,
39912,
39925,
39933,
39944,
39952,
40019,
40072,
40128,
40134,
40193,
40212,
40271,
40282,
40340,
40357,
40363,
40416,
40450,
40490,
40502,
40521,
40529,
40566,
40627,
40690,
40762,
40770,
40794,
40845,
40853,
40867,
40875,
40886,
40894,
40921,
40976,
40987,
41024,
41058,
41081,
41121,
41133,
41141,
41149,
41157,
41164,
41170,
41198,
41266,
41312,
41354,
41361,
41400,
41406,
41479,
41497,
41503,
41542,
41583,
41634,
41681,
41712,
41718,
41742,
41788,
41796,
41857,
41863,
41941,
41949,
42005,
42057,
42065,
42120,
42147,
42199,
42233,
42300,
42308,
42373,
42423,
42437,
42480,
42488,
42538,
42552,
42560,
42571,
42579,
42630,
42683,
42710,
42746,
42757,
42813,
42823,
42831,
42842,
42850,
42903,
42926,
42934,
42989,
43016,
43075,
43086,
43165,
43173,
43184,
43240,
43246,
43259,
43267,
43275,
43281,
43315,
43363,
43374,
43393,
43400,
43406,
43434,
43502,
43571,
43620,
43662,
43669,
43708,
43729,
43744,
43750,
43784,
43792,
43839,
43860,
43875,
43976,
43984,
44028,
44036,
44114,
44122,
44174,
44182,
44236,
44288,
44355,
44363,
44413,
44427,
44454,
44531,
44542,
44632,
44640,
44654,
44662,
44673,
44681,
44732,
44785,
44812,
44889,
44900,
44988,
44996,
45004,
45015,
45023,
45076,
45099,
45107,
45134,
45234,
45245,
45356,
45364,
45372,
45380,
45388,
45460,
45468,
45512,
45520,
45598,
45606,
45658,
45666,
45720,
45772,
45839,
45847,
45897,
45911,
45938,
46015,
46026,
46134,
46142,
46156,
46164,
46175,
46183,
46234,
46287,
46314,
46391,
46402,
46508,
46516,
46524,
46535,
46543,
46596,
46619,
46627,
46654,
46754,
46765,
46894,
46902,
46916,
46924,
46932,
46940,
46948,
47052,
47060,
47104,
47112,
47190,
47198,
47250,
47258,
47312,
47364,
47431,
47439,
47489,
47503,
47530,
47602,
47613,
47698,
47706,
47720,
47728,
47739,
47747,
47798,
47851,
47878,
47946,
47957,
48036,
48044,
48052,
48063,
48071,
48124,
48147,
48155,
48182,
48273,
48284,
48386,
48394,
48408,
48416,
48424,
48432,
48502,
48510,
48538,
48546,
48590,
48626,
48634,
48665,
48671,
48710,
48746,
48754,
48784,
48798,
48806,
48814,
48822,
48862,
48879,
48885,
48929,
48937,
49015,
49023,
49075,
49083,
49137,
49189,
49256,
49264,
49314,
49328,
49355,
49445,
49456,
49577,
49585,
49599,
49607,
49618,
49626,
49677,
49730,
49757,
49847,
49858,
49979,
49987,
49995,
50006,
50014,
50067,
50090,
50098,
50125,
50238,
50249,
50393,
50401,
50415,
50423,
50431,
50439,
50446,
50452,
50480,
50544,
50603,
50610,
50633,
50639,
50678,
50705,
50716,
50724,
50751,
50795,
50803,
50809,
50836,
50844,
50884,
50892,
50938,
50956,
50964,
50992,
51011,
51038,
51105,
51111,
51147,
51155,
51163,
51171,
51182,
51190,
51230,
51238,
51305,
51348,
51457,
51465,
51473,
51480,
51486,
51514,
51580,
51587,
51615,
51621,
51705,
51711,
51765,
51773,
51806,
51845,
51851,
51893,
51901,
51971,
51996,
52060,
52066,
52089,
52117,
52137,
52143,
52189,
52231,
52261,
52269,
52277,
52315,
52336,
52343,
52349,
52377,
52428,
52502,
52509,
52544,
52586,
52592,
52630,
52636,
52716,
52722,
52728,
52750,
52758,
52805,
52845,
52853,
52901,
52982,
53015,
53099,
53107,
53115,
53121,
53179,
53231,
53247,
53255,
53302,
53351,
53357,
53397,
53405,
53463,
53520,
53601,
53607,
53628,
53659,
53665,
53706,
53714,
53774,
53795,
53859,
53920,
54020,
54026,
54057,
54065,
54138,
54172,
54180,
54192,
54212,
54218,
54276,
54284,
54292,
54300,
54306,
54327,
54355,
54374,
54403,
54450,
54484,
54577,
54585,
54593,
54600,
54607,
54633,
54634
],
"line_end_idx": [
14,
125,
132,
170,
175,
249,
323,
394,
435,
440,
485,
527,
606,
613,
617,
639,
661,
665,
699,
703,
737,
768,
805,
842,
846,
866,
871,
907,
911,
952,
995,
999,
1026,
1061,
1065,
1097,
1144,
1153,
1190,
1200,
1204,
1242,
1268,
1272,
1309,
1313,
1338,
1343,
1364,
1385,
1401,
1407,
1411,
1430,
1435,
1457,
1489,
1493,
1511,
1532,
1542,
1552,
1558,
1590,
1615,
1637,
1644,
1648,
1665,
1682,
1699,
1705,
1709,
1727,
1732,
1754,
1786,
1790,
1808,
1829,
1839,
1849,
1855,
1887,
1913,
1936,
1944,
1951,
1956,
1983,
2005,
2028,
2044,
2060,
2085,
2114,
2131,
2154,
2171,
2192,
2213,
2234,
2241,
2246,
2285,
2290,
2329,
2334,
2366,
2371,
2448,
2454,
2467,
2481,
2486,
2549,
2554,
2589,
2612,
2617,
2670,
2675,
2703,
2764,
2769,
2809,
2814,
2892,
2897,
2929,
2984,
2989,
3033,
3038,
3059,
3064,
3097,
3102,
3173,
3178,
3242,
3247,
3270,
3337,
3399,
3404,
3474,
3479,
3530,
3535,
3602,
3648,
3691,
3696,
3763,
3831,
3879,
3921,
3926,
3996,
4056,
4115,
4120,
4181,
4245,
4294,
4299,
4319,
4382,
4444,
4449,
4466,
4511,
4578,
4601,
4606,
4690,
4695,
4761,
4766,
4829,
4888,
4893,
4943,
4996,
5022,
5027,
5098,
5103,
5164,
5169,
5194,
5264,
5312,
5317,
5342,
5395,
5422,
5427,
5434,
5441,
5446,
5486,
5493,
5556,
5563,
5568,
5609,
5616,
5640,
5647,
5652,
5721,
5728,
5770,
5777,
5782,
5833,
5840,
5873,
5896,
5901,
5921,
5928,
5961,
6001,
6008,
6018,
6025,
6058,
6098,
6105,
6138,
6172,
6209,
6220,
6250,
6268,
6275,
6280,
6313,
6320,
6360,
6373,
6433,
6496,
6531,
6594,
6659,
6666,
6671,
6731,
6738,
6779,
6786,
6791,
6830,
6837,
6866,
6873,
6878,
6949,
7017,
7022,
7076,
7131,
7194,
7228,
7233,
7238,
7292,
7347,
7416,
7421,
7486,
7557,
7584,
7589,
7659,
7720,
7791,
7818,
7823,
7884,
7889,
7902,
7925,
7930,
7946,
7967,
7989,
7994,
8015,
8020,
8040,
8065,
8093,
8098,
8103,
8128,
8135,
8162,
8217,
8257,
8284,
8291,
8296,
8318,
8337,
8356,
8361,
8376,
8393,
8398,
8415,
8422,
8427,
8454,
8524,
8579,
8642,
8669,
8676,
8719,
8738,
8783,
8788,
8803,
8820,
8825,
8842,
8849,
8854,
8881,
8928,
9003,
9071,
9078,
9119,
9126,
9171,
9217,
9274,
9281,
9291,
9319,
9324,
9360,
9405,
9472,
9477,
9505,
9544,
9582,
9614,
9619,
9636,
9643,
9648,
9675,
9681,
9710,
9779,
9784,
9816,
9845,
9886,
9893,
9942,
10006,
10052,
10109,
10116,
10126,
10155,
10160,
10203,
10240,
10264,
10311,
10379,
10384,
10415,
10431,
10452,
10491,
10529,
10562,
10567,
10587,
10593,
10598,
10624,
10678,
10684,
10717,
10738,
10783,
10788,
10819,
10826,
10864,
10871,
10902,
10961,
11013,
11033,
11040,
11076,
11093,
11100,
11107,
11125,
11132,
11137,
11175,
11182,
11216,
11278,
11291,
11322,
11340,
11347,
11388,
11395,
11426,
11442,
11449,
11454,
11487,
11494,
11525,
11577,
11593,
11687,
11707,
11714,
11750,
11767,
11774,
11781,
11799,
11809,
11844,
11860,
11871,
11877,
11882,
11909,
11970,
11976,
12006,
12011,
12032,
12037,
12068,
12075,
12113,
12148,
12164,
12171,
12194,
12211,
12216,
12242,
12249,
12309,
12335,
12368,
12420,
12438,
12459,
12476,
12492,
12499,
12560,
12565,
12593,
12618,
12623,
12656,
12663,
12715,
12731,
12749,
12765,
12772,
12793,
12800,
12826,
12843,
12876,
12883,
12935,
12951,
13040,
13057,
13073,
13104,
13109,
13166,
13192,
13199,
13232,
13301,
13308,
13318,
13372,
13377,
13410,
13444,
13455,
13517,
13552,
13559,
13592,
13625,
13655,
13662,
13721,
13738,
13763,
13814,
13827,
13842,
13855,
13885,
13898,
13905,
13915,
13922,
13982,
13999,
14024,
14075,
14088,
14103,
14116,
14146,
14194,
14201,
14208,
14253,
14260,
14277,
14284,
14306,
14322,
14327,
14413,
14429,
14447,
14467,
14473,
14478,
14483,
14510,
14576,
14582,
14644,
14720,
14727,
14886,
14966,
14992,
15072,
15110,
15190,
15210,
15217,
15222,
15255,
15322,
15329,
15492,
15572,
15598,
15678,
15716,
15796,
15816,
15823,
15896,
15903,
16079,
16099,
16106,
16153,
16160,
16193,
16288,
16295,
16500,
16580,
16606,
16686,
16724,
16804,
16824,
16831,
16838,
16882,
16889,
16923,
17058,
17065,
17229,
17309,
17335,
17415,
17453,
17533,
17553,
17560,
17567,
17653,
17660,
17693,
17700,
17801,
17817,
17916,
17923,
18107,
18187,
18213,
18293,
18331,
18411,
18431,
18438,
18549,
18569,
18577,
18585,
18596,
18632,
18644,
18650,
18670,
18677,
18683,
18711,
18718,
18740,
18779,
18841,
18862,
18873,
18922,
18928,
18947,
18954,
18960,
18987,
19050,
19057,
19091,
19120,
19196,
19243,
19264,
19314,
19335,
19341,
19375,
19383,
19444,
19461,
19492,
19546,
19611,
19622,
19688,
19694,
19728,
19736,
19757,
19777,
19785,
19823,
19831,
19852,
19872,
19880,
19888,
19908,
19929,
19940,
19976,
19997,
20009,
20016,
20022,
20049,
20105,
20112,
20146,
20198,
20227,
20254,
20278,
20318,
20326,
20355,
20375,
20423,
20440,
20454,
20462,
20482,
20526,
20532,
20576,
20584,
20610,
20644,
20702,
20710,
20726,
20740,
20748,
20773,
20801,
20836,
20844,
20989,
21025,
21033,
21067,
21144,
21152,
21185,
21193,
21228,
21286,
21294,
21357,
21365,
21399,
21407,
21454,
21462,
21534,
21587,
21595,
21606,
21684,
21692,
21698,
21706,
21712,
21734,
21745,
21781,
21793,
21800,
21806,
21812,
21861,
21868,
21886,
21892,
21917,
21924,
21930,
21985,
21992,
22015,
22023,
22045,
22084,
22111,
22133,
22139,
22159,
22175,
22193,
22201,
22208,
22214,
22281,
22288,
22342,
22358,
22365,
22371,
22424,
22478,
22485,
22502,
22508,
22545,
22566,
22602,
22638,
22659,
22665,
22729,
22736,
22742,
22748,
22807,
22848,
22855,
22878,
22892,
22898,
22919,
22958,
22994,
23000,
23064,
23071,
23077,
23105,
23112,
23136,
23142,
23168,
23185,
23212,
23218,
23245,
23253,
23289,
23295,
23329,
23375,
23381,
23400,
23408,
23414,
23450,
23456,
23490,
23537,
23613,
23619,
23638,
23645,
23651,
23657,
23685,
23692,
23746,
23787,
23804,
23823,
23829,
23868,
23876,
23914,
23948,
23956,
24034,
24042,
24050,
24056,
24075,
24082,
24088,
24116,
24164,
24201,
24249,
24298,
24305,
24331,
24353,
24387,
24393,
24471,
24486,
24558,
24564,
24599,
24605,
24637,
24645,
24700,
24727,
24819,
24830,
24866,
24978,
25018,
25052,
25060,
25087,
25193,
25204,
25240,
25366,
25374,
25389,
25397,
25408,
25416,
25472,
25524,
25532,
25579,
25606,
25686,
25697,
25733,
25833,
25841,
25852,
25860,
25912,
25933,
25976,
25996,
26030,
26062,
26103,
26115,
26142,
26222,
26233,
26269,
26369,
26380,
26418,
26426,
26490,
26516,
26575,
26581,
26621,
26629,
26685,
26719,
26727,
26765,
26813,
26821,
26864,
26891,
26975,
26986,
27022,
27126,
27134,
27145,
27153,
27205,
27226,
27265,
27285,
27319,
27351,
27392,
27404,
27410,
27437,
27521,
27532,
27568,
27672,
27683,
27721,
27729,
27735,
27799,
27825,
27886,
27894,
27902,
27910,
27917,
27923,
27951,
28022,
28103,
28142,
28149,
28173,
28181,
28230,
28247,
28312,
28318,
28340,
28348,
28388,
28396,
28443,
28451,
28498,
28570,
28596,
28749,
28760,
28858,
28864,
28880,
28990,
28998,
29006,
29014,
29042,
29050,
29090,
29098,
29170,
29212,
29379,
29390,
29497,
29505,
29513,
29521,
29528,
29534,
29562,
29626,
29688,
29695,
29739,
29773,
29870,
29984,
30021,
30102,
30112,
30146,
30165,
30196,
30282,
30308,
30316,
30357,
30419,
30454,
30487,
30509,
30549,
30596,
30712,
30772,
30821,
30842,
30850,
30858,
30866,
30901,
30909,
30950,
31012,
31035,
31057,
31097,
31144,
31260,
31300,
31321,
31329,
31337,
31345,
31381,
31405,
31412,
31418,
31446,
31525,
31577,
31584,
31615,
31645,
31676,
31701,
31715,
31723,
31793,
31843,
31911,
31952,
31997,
32048,
32081,
32125,
32142,
32164,
32188,
32221,
32266,
32310,
32336,
32344,
32368,
32386,
32443,
32480,
32498,
32538,
32614,
32651,
32659,
32667,
32711,
32742,
32784,
32837,
32861,
32898,
32930,
32977,
33019,
33033,
33056,
33133,
33196,
33210,
33224,
33231,
33237,
33265,
33334,
33396,
33403,
33435,
33465,
33471,
33501,
33535,
33576,
33633,
33644,
33677,
33683,
33710,
33718,
33775,
33824,
33848,
33856,
33867,
33898,
33923,
33929,
34000,
34008,
34079,
34162,
34170,
34227,
34235,
34280,
34314,
34345,
34398,
34454,
34523,
34529,
34583,
34635,
34691,
34697,
34746,
34780,
34788,
34806,
34873,
34881,
34956,
34969,
35057,
35141,
35236,
35260,
35315,
35323,
35346,
35360,
35368,
35376,
35384,
35390,
35475,
35481,
35509,
35573,
35609,
35620,
35639,
35686,
35741,
35823,
35831,
35857,
35888,
35894,
35935,
35953,
35990,
35998,
36073,
36136,
36142,
36172,
36235,
36257,
36284,
36369,
36380,
36445,
36478,
36486,
36596,
36690,
36802,
36887,
36893,
36918,
36926,
36986,
37052,
37103,
37137,
37185,
37212,
37220,
37299,
37420,
37518,
37526,
37537,
37545,
37624,
37719,
37791,
37799,
37805,
37839,
37882,
37894,
37902,
37913,
37921,
37965,
38044,
38052,
38129,
38135,
38182,
38217,
38225,
38304,
38369,
38380,
38435,
38443,
38477,
38512,
38524,
38532,
38538,
38562,
38659,
38692,
38769,
38791,
38797,
38839,
38873,
38915,
38927,
38995,
39093,
39164,
39172,
39180,
39194,
39202,
39213,
39221,
39278,
39331,
39384,
39411,
39466,
39477,
39515,
39523,
39531,
39559,
39567,
39611,
39664,
39719,
39746,
39830,
39841,
39906,
39912,
39925,
39933,
39944,
39952,
40019,
40072,
40128,
40134,
40193,
40212,
40271,
40282,
40340,
40357,
40363,
40416,
40450,
40490,
40502,
40521,
40529,
40566,
40627,
40690,
40762,
40770,
40794,
40845,
40853,
40867,
40875,
40886,
40894,
40921,
40976,
40987,
41024,
41058,
41081,
41121,
41133,
41141,
41149,
41157,
41164,
41170,
41198,
41266,
41312,
41354,
41361,
41400,
41406,
41479,
41497,
41503,
41542,
41583,
41634,
41681,
41712,
41718,
41742,
41788,
41796,
41857,
41863,
41941,
41949,
42005,
42057,
42065,
42120,
42147,
42199,
42233,
42300,
42308,
42373,
42423,
42437,
42480,
42488,
42538,
42552,
42560,
42571,
42579,
42630,
42683,
42710,
42746,
42757,
42813,
42823,
42831,
42842,
42850,
42903,
42926,
42934,
42989,
43016,
43075,
43086,
43165,
43173,
43184,
43240,
43246,
43259,
43267,
43275,
43281,
43315,
43363,
43374,
43393,
43400,
43406,
43434,
43502,
43571,
43620,
43662,
43669,
43708,
43729,
43744,
43750,
43784,
43792,
43839,
43860,
43875,
43976,
43984,
44028,
44036,
44114,
44122,
44174,
44182,
44236,
44288,
44355,
44363,
44413,
44427,
44454,
44531,
44542,
44632,
44640,
44654,
44662,
44673,
44681,
44732,
44785,
44812,
44889,
44900,
44988,
44996,
45004,
45015,
45023,
45076,
45099,
45107,
45134,
45234,
45245,
45356,
45364,
45372,
45380,
45388,
45460,
45468,
45512,
45520,
45598,
45606,
45658,
45666,
45720,
45772,
45839,
45847,
45897,
45911,
45938,
46015,
46026,
46134,
46142,
46156,
46164,
46175,
46183,
46234,
46287,
46314,
46391,
46402,
46508,
46516,
46524,
46535,
46543,
46596,
46619,
46627,
46654,
46754,
46765,
46894,
46902,
46916,
46924,
46932,
46940,
46948,
47052,
47060,
47104,
47112,
47190,
47198,
47250,
47258,
47312,
47364,
47431,
47439,
47489,
47503,
47530,
47602,
47613,
47698,
47706,
47720,
47728,
47739,
47747,
47798,
47851,
47878,
47946,
47957,
48036,
48044,
48052,
48063,
48071,
48124,
48147,
48155,
48182,
48273,
48284,
48386,
48394,
48408,
48416,
48424,
48432,
48502,
48510,
48538,
48546,
48590,
48626,
48634,
48665,
48671,
48710,
48746,
48754,
48784,
48798,
48806,
48814,
48822,
48862,
48879,
48885,
48929,
48937,
49015,
49023,
49075,
49083,
49137,
49189,
49256,
49264,
49314,
49328,
49355,
49445,
49456,
49577,
49585,
49599,
49607,
49618,
49626,
49677,
49730,
49757,
49847,
49858,
49979,
49987,
49995,
50006,
50014,
50067,
50090,
50098,
50125,
50238,
50249,
50393,
50401,
50415,
50423,
50431,
50439,
50446,
50452,
50480,
50544,
50603,
50610,
50633,
50639,
50678,
50705,
50716,
50724,
50751,
50795,
50803,
50809,
50836,
50844,
50884,
50892,
50938,
50956,
50964,
50992,
51011,
51038,
51105,
51111,
51147,
51155,
51163,
51171,
51182,
51190,
51230,
51238,
51305,
51348,
51457,
51465,
51473,
51480,
51486,
51514,
51580,
51587,
51615,
51621,
51705,
51711,
51765,
51773,
51806,
51845,
51851,
51893,
51901,
51971,
51996,
52060,
52066,
52089,
52117,
52137,
52143,
52189,
52231,
52261,
52269,
52277,
52315,
52336,
52343,
52349,
52377,
52428,
52502,
52509,
52544,
52586,
52592,
52630,
52636,
52716,
52722,
52728,
52750,
52758,
52805,
52845,
52853,
52901,
52982,
53015,
53099,
53107,
53115,
53121,
53179,
53231,
53247,
53255,
53302,
53351,
53357,
53397,
53405,
53463,
53520,
53601,
53607,
53628,
53659,
53665,
53706,
53714,
53774,
53795,
53859,
53920,
54020,
54026,
54057,
54065,
54138,
54172,
54180,
54192,
54212,
54218,
54276,
54284,
54292,
54300,
54306,
54327,
54355,
54374,
54403,
54450,
54484,
54577,
54585,
54593,
54600,
54607,
54633,
54634,
54681
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 54681,
"ccnet_original_nlines": 1779,
"rps_doc_curly_bracket": 0.007278580218553543,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1052592471241951,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02188264951109886,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5953564047813416,
"rps_doc_frac_unique_words": 0.5285238027572632,
"rps_doc_mean_word_length": 7.212311267852783,
"rps_doc_num_sentences": 569,
"rps_doc_symbol_to_word_ratio": 0.00548921013250947,
"rps_doc_unigram_entropy": 6.942329406738281,
"rps_doc_word_count": 5101,
"rps_doc_frac_chars_dupe_10grams": 0.005218809936195612,
"rps_doc_frac_chars_dupe_5grams": 0.08888284862041473,
"rps_doc_frac_chars_dupe_6grams": 0.057162269949913025,
"rps_doc_frac_chars_dupe_7grams": 0.03895080089569092,
"rps_doc_frac_chars_dupe_8grams": 0.025876600295305252,
"rps_doc_frac_chars_dupe_9grams": 0.007393309846520424,
"rps_doc_frac_chars_top_2gram": 0.014922530390322208,
"rps_doc_frac_chars_top_3gram": 0.013400379568338394,
"rps_doc_frac_chars_top_4gram": 0.004593640100210905,
"rps_doc_books_importance": -5684.45556640625,
"rps_doc_books_importance_length_correction": -5684.45556640625,
"rps_doc_openwebtext_importance": -3409.28662109375,
"rps_doc_openwebtext_importance_length_correction": -3409.28662109375,
"rps_doc_wikipedia_importance": -2564.205322265625,
"rps_doc_wikipedia_importance_length_correction": -2564.205322265625
},
"fasttext": {
"dclm": 0.9801239371299744,
"english": 0.13898363709449768,
"fineweb_edu_approx": 2.226834774017334,
"eai_general_math": 0.45551908016204834,
"eai_open_web_math": 0.16816478967666626,
"eai_web_code": 0.7345004081726074
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "006.3",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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
|
9,013,037,539,155,423,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 currently have wordpress blog with multiple subdomains. Currently the permalink structure is /%year%/%monthnum%/%day%/%postname%/ i want to change it remove year month and day and just put in postname. The problem if i do it now, the existing links will throw a 404 error, to avoid it i want to redirect current permalink structure to new permalink structure
for example i have url http://subdomain1.mydomain.com/2012/07/30/my-post-name/ then i want it to be redirected to http://subdomain1.mydomain.com/my-post-name/
RedirectMatch 301 ^/([0-9]{4})/([0-9]{2})/([0-9]{2})/(.*)$ http://subdomain1.mydomain.com/$4
the problem with the above regex is it redirects every subdomain to subdomain1.mydomain.com, i want to something like
RedirectMatch 301 ^subdomain1.domain.com/([0-9]{4})/([0-9]{2})/([0-9]{2})/(.*)$ http://subdomain1.domain.com/$4
RedirectMatch 301 ^subdomain2.domain.com/([0-9]{4})/([0-9]{2})/([0-9]{2})/(.*)$ http://subdomain2.domain.com/$4
the above thing is not working.
can you let me correct regex, i am ready to add a line .htaccess for each subdomain if required
share|improve this question
add comment
1 Answer
Solved it by removing the domain name
RedirectMatch 301 ^/([0-9]{4})/([0-9]{2})/([0-9]{2})/(.*)$ /$4
It solves my current requirement, but what if i wanted to some subdomains to redirect and some not to in the future. Can anyone provide a better solution.
tried the below one too but it did not work for me
RewriteCond %{HTTP_HOST} ^subdomain\.domain\.com$
RewriteRule ^/([0-9]{4})/([0-9]{2})/([0-9]{2})/(.*)$ http://subdomain.domain.com/$4 [R=301,L]
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/11770237/wordpress-permalinks-change-without-404-error/11799028",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "60857",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BQMYXK6PUKSWVMKGFP4CZYL3OOMGSMGQ",
"WARC-Concurrent-To": "<urn:uuid:5bd6fb7a-4480-4cef-aae3-5dd2996ff17e>",
"WARC-Date": "2014-03-11T04:10:27Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WYIG4AOZC3RZY4LXRUROJ3VT56C2IW5E",
"WARC-Record-ID": "<urn:uuid:65fe978d-e55a-41e0-83df-664bec8aa9ce>",
"WARC-Target-URI": "http://stackoverflow.com/questions/11770237/wordpress-permalinks-change-without-404-error/11799028",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c9f52106-63b9-4d53-8316-2a51044d6083>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
519,
520,
679,
680,
773,
774,
892,
893,
1011,
1129,
1130,
1162,
1163,
1259,
1260,
1288,
1300,
1301,
1310,
1311,
1349,
1350,
1413,
1414,
1569,
1570,
1621,
1622,
1672,
1766,
1792,
1804,
1805,
1817,
1818,
1820,
1828,
1829,
1907,
1908
],
"line_end_idx": [
25,
157,
158,
519,
520,
679,
680,
773,
774,
892,
893,
1011,
1129,
1130,
1162,
1163,
1259,
1260,
1288,
1300,
1301,
1310,
1311,
1349,
1350,
1413,
1414,
1569,
1570,
1621,
1622,
1672,
1766,
1792,
1804,
1805,
1817,
1818,
1820,
1828,
1829,
1907,
1908,
1998
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1998,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0.016016019508242607,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29411765933036804,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006302520167082548,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4075630307197571,
"rps_doc_frac_unique_words": 0.586614191532135,
"rps_doc_mean_word_length": 5.7086615562438965,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.692546367645264,
"rps_doc_word_count": 254,
"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.01379309967160225,
"rps_doc_frac_chars_top_3gram": 0.01448275987058878,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -163.8436737060547,
"rps_doc_books_importance_length_correction": -163.8436737060547,
"rps_doc_openwebtext_importance": -106.84776306152344,
"rps_doc_openwebtext_importance_length_correction": -106.84776306152344,
"rps_doc_wikipedia_importance": -74.78912353515625,
"rps_doc_wikipedia_importance_length_correction": -74.78912353515625
},
"fasttext": {
"dclm": 0.03962022066116333,
"english": 0.7694880366325378,
"fineweb_edu_approx": 0.9335969686508179,
"eai_general_math": 0.00001109000004362315,
"eai_open_web_math": 0.07071971893310547,
"eai_web_code": -0.000007029999778751517
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,224,872,361,052,266,000 |
Smartphones – A Quick Overview
The Smartphone is the wave of the present and future. Just when most people thought that mobile phones could not get better than the Apple iPhone, a series of Smartphones have made its glorious entrance.
The concept for Smartphone apps, short for Smartphone applications, is not new. Actually, it dates back to 1992, when the first Smartphone, common hype named Simon was invented. It was an early mobile or cell phone. It includes such apps as a clock, address book, email, notepad, a send and receive fax machine, as well as games. It was a legend ahead of its time.
The first actual Smartphone was sold in 2000, when the Ericsson R380 was released. It was the first cell phone that was actually called a Smartphone. By 2005, Nokia started launching its Nseries of 3G Smartphones, emplaye which were not called cell phones or Smartphones, but “multimedia computers”, even though in effect, they were essentially Smartphones.
In 2008, Android, a cross platform OS for Smartphones, was released. This was the first Smartphone to feature the use of applications, or “apps.” In July of the same year, Apple introduced its App Store. The app store is capable of delivering third-party applications to a user’s iPhone or iPod touchpad via wi-fi or cellular networks without using a PC to download. สล็อต รวม ค่าย เว็บตรง ไม่ผ่านเอเย่นต์ 2023
The App Store has become a huge sensation. In fact, as of March 2010, it has offered 170,000 applications and had made three billion downloads as of January 2010.
There are different types of apps. For example, on an iPhone, there are virtually apps for everything known to man. As their commercial puts it, “Yeah, there’s an app for that too.” If one were to consider the number of apps available on iPod, they would seemingly never get to the end of it all. Its list is inexhaustibly endless.
BlackBerry- At BlackBerry App World, you can reportedly download 140,000 apps free, with games, social networking, shopping, productivity as well as other amenities. You can personalize your BlackBerry Smartphone with literally tons of apps for whatever you want while you are on the go. BlackBerry App World has as of this article’s writing 5 million users worldwide.
HTC- Named for H.T. Chou, one of the company’s directors, hermes 手袋 is an Asian-based company that specializes in the use of Smartphone applications. It credits itself with creating several of cell phones firsts, including being the first company to feature the Microsoft Smartphone.
It has many, many apps as well free that you can download via the Android market. It has been received to somewhat mixed reviews. One user claims that though it was somewhat okay, it was observed that the battery on their Smartphone heated up and tended to die out very fast. However, other users give the HTC apps rave reviews.
Nokia- The Nokia E62 is another Smartphone that is becoming increasingly hot on the Smartphone market. It has various features and applications such as N-series, E-series, Xpress Music, and Classic, etc. Like its competitors, it has to stay ahead, and like its competitors, claims to offer numerous apps free.
Like with all Smartphones, they have their various games. Interestingly, it has been observed by most PC review articles that most PC apps are actually games. Some of the most popular games being played on Apple Smartphones for instance are “Tapulous Tap Revenge”, a style-rhythm game, smartphone for elderly and “Tap Tap Revenge”. In fact, it was estimated in 2009 that three of the top games being played on Smartphones were Tap Tap Revenge; Touch Hockey: FS5; and that old-time favorite, Pac-Man as well as other games out of the top twenty-five.
naz
Related Posts
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://erh6.vip/2023/03/28/smartphones-a-quick-overview/",
"source_domain": "erh6.vip",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "46718",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SBHGB7Y2WN4W7G7SM4CXEBMWWL45QMH6",
"WARC-Concurrent-To": "<urn:uuid:5d5ec5eb-12f5-4f3e-9af8-b469129676d1>",
"WARC-Date": "2023-06-04T21:25:05Z",
"WARC-IP-Address": "162.0.215.251",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PJBIIOTFBC7VQDYD5B7R6LZXMSYHFF6G",
"WARC-Record-ID": "<urn:uuid:1305b234-6c9f-4f61-82a2-20ae5bfcb95f>",
"WARC-Target-URI": "https://erh6.vip/2023/03/28/smartphones-a-quick-overview/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e1bb9dc7-77f3-4de6-b9f1-cdde27ab796b>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-77\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
31,
32,
236,
237,
602,
603,
961,
962,
1373,
1374,
1537,
1538,
1870,
1871,
2240,
2241,
2525,
2526,
2855,
2856,
3166,
3167,
3717,
3718,
3720,
3721,
3725,
3726,
3740,
3741,
3755,
3756
],
"line_end_idx": [
31,
32,
236,
237,
602,
603,
961,
962,
1373,
1374,
1537,
1538,
1870,
1871,
2240,
2241,
2525,
2526,
2855,
2856,
3166,
3167,
3717,
3718,
3720,
3721,
3725,
3726,
3740,
3741,
3755,
3756,
3826
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3826,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38167938590049744,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019083969295024872,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19465649127960205,
"rps_doc_frac_unique_words": 0.47252747416496277,
"rps_doc_mean_word_length": 4.803767681121826,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.213613033294678,
"rps_doc_word_count": 637,
"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.009803920052945614,
"rps_doc_frac_chars_top_3gram": 0.007843139581382275,
"rps_doc_frac_chars_top_4gram": 0.008496729657053947,
"rps_doc_books_importance": -339.4424133300781,
"rps_doc_books_importance_length_correction": -339.4424133300781,
"rps_doc_openwebtext_importance": -191.80905151367188,
"rps_doc_openwebtext_importance_length_correction": -191.80905151367188,
"rps_doc_wikipedia_importance": -134.18272399902344,
"rps_doc_wikipedia_importance_length_correction": -134.18272399902344
},
"fasttext": {
"dclm": 0.043878260999917984,
"english": 0.9774831533432007,
"fineweb_edu_approx": 2.066293716430664,
"eai_general_math": 0.0019820299930870533,
"eai_open_web_math": 0.10226708650588989,
"eai_web_code": 0.0006302000256255269
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,065,521,856,952,805,000 |
Source code for arch.unitroot._engle_granger
from __future__ import annotations
from typing import Optional
import numpy as np
import pandas as pd
from scipy import stats
from statsmodels.iolib.summary import Summary
from statsmodels.iolib.table import SimpleTable
from statsmodels.regression.linear_model import RegressionResults
from arch.typing import ArrayLike1D, ArrayLike2D
from arch.unitroot._shared import (
ResidualCointegrationTestResult,
_check_cointegrating_regression,
_cross_section,
)
from arch.unitroot.critical_values.engle_granger import (
CV_PARAMETERS,
LARGE_PARAMETERS,
SMALL_PARAMETERS,
TAU_MAX,
TAU_MIN,
TAU_STAR,
)
from arch.unitroot.unitroot import ADF, TREND_DESCRIPTION
[docs]def engle_granger( y: ArrayLike1D, x: ArrayLike2D, trend: str = "c", *, lags: Optional[int] = None, max_lags: Optional[int] = None, method: str = "bic", ) -> EngleGrangerTestResults: r""" Test for cointegration within a set of time series. Parameters ---------- y : array_like The left-hand-side variable in the cointegrating regression. x : array_like The right-hand-side variables in the cointegrating regression. trend : {"n","c","ct","ctt"}, default "c" Trend to include in the cointegrating regression. Trends are: * "n": No deterministic terms * "c": Constant * "ct": Constant and linear trend * "ctt": Constant, linear and quadratic trends lags : int, default None The number of lagged differences to include in the Augmented Dickey-Fuller test used on the residuals of the max_lags : int, default None The maximum number of lags to consider when using automatic lag-length in the Augmented Dickey-Fuller regression. method: {"aic", "bic", "tstat"}, default "bic" The method used to select the number of lags included in the Augmented Dickey-Fuller regression. Returns ------- EngleGrangerTestResults Results of the Engle-Granger test. See Also -------- arch.unitroot.ADF Augmented Dickey-Fuller testing. arch.unitroot.PhillipsPerron Phillips & Perron's unit root test. arch.unitroot.cointegration.phillips_ouliaris Phillips-Ouliaris tests of cointegration. Notes ----- The model estimated is .. math:: Y_t = X_t \beta + D_t \gamma + \epsilon_t where :math:`Z_t = [Y_t,X_t]` is being tested for cointegration. :math:`D_t` is a set of deterministic terms that may include a constant, a time trend or a quadratic time trend. The null hypothesis is that the series are not cointegrated. The test is implemented as an ADF of the estimated residuals from the cross-sectional regression using a set of critical values that is determined by the number of assumed stochastic trends when the null hypothesis is true. """ setup = _check_cointegrating_regression(y, x, trend) xsection = _cross_section(setup.y, setup.x, setup.trend) resid = xsection.resid # Never pass in the trend here since only used in x-section adf = ADF(resid, lags, trend="n", max_lags=max_lags, method=method) stat = adf.stat nobs = resid.shape[0] - adf.lags - 1 num_x = setup.x.shape[1] cv = engle_granger_cv(trend, num_x, nobs) pv = engle_granger_pval(stat, trend, num_x) return EngleGrangerTestResults( stat, pv, cv, order=num_x, adf=adf, xsection=xsection )
[docs]class EngleGrangerTestResults(ResidualCointegrationTestResult): """ Results class for Engle-Granger cointegration tests. Parameters ---------- stat : float The Engle-Granger test statistic. pvalue : float The pvalue of the Engle-Granger test statistic. crit_vals : Series The critical values of the Engle-Granger specific to the sample size and model dimension. null : str The null hypothesis. alternative : str The alternative hypothesis. trend : str The model's trend description. order : int The number of stochastic trends in the null distribution. adf : ADF The ADF instance used to perform the test and lag selection. xsection : RegressionResults The OLS results used in the cross-sectional regression. """ def __init__( self, stat: float, pvalue: float, crit_vals: pd.Series, null: str = "No Cointegration", alternative: str = "Cointegration", trend: str = "c", order: int = 2, adf: Optional[ADF] = None, xsection: Optional[RegressionResults] = None, ) -> None: super().__init__( stat, pvalue, crit_vals, null, alternative, trend, order, xsection ) self.name = "Engle-Granger Cointegration Test" assert adf is not None self._adf = adf self._additional_info.update( { "ADF Lag length": self.lags, "Trend": self.trend, "Estimated Root ρ (γ+1)": self.rho, "Distribution Order": self.distribution_order, } ) @property def lags(self) -> int: """The number of lags used in the Augmented Dickey-Fuller regression.""" return self._adf.lags @property def max_lags(self) -> Optional[int]: """The maximum number of lags used in the lag-length selection.""" return self._adf.max_lags @property def rho(self) -> float: r""" The estimated coefficient in the Dickey-Fuller Test Returns ------- float The coefficient. Notes ----- The value returned is :math:`\hat{\rho}=\hat{\gamma}+1` from the ADF regression .. math:: \Delta y_t = \gamma y_{t-1} + \sum_{i=1}^p \delta_i \Delta y_{t-i} + \epsilon_t """ return 1 + self._adf.regression.params[0]
[docs] def summary(self) -> Summary: """Summary of test, containing statistic, p-value and critical values""" table_data = [ ("Test Statistic", f"{self.stat:0.3f}"), ("P-value", f"{self.pvalue:0.3f}"), ("ADF Lag length", f"{self.lags:d}"), ("Estimated Root ρ (γ+1)", f"{self.rho:0.3f}"), ] title = self.name table = SimpleTable( table_data, stubs=None, title=title, colwidths=18, datatypes=[0, 1], data_aligns=("l", "r"), ) smry = Summary() smry.tables.append(table) cv_string = "Critical Values: " for val in self.critical_values.keys(): p = str(int(val)) + "%" cv_string += f"{self.critical_values[val]:0.2f}" cv_string += " (" + p + ")" cv_string += ", " # Remove trailing ,<space> cv_string = cv_string[:-2] extra_text = [ "Trend: " + TREND_DESCRIPTION[self._trend], cv_string, "Null Hypothesis: " + self.null_hypothesis, "Alternative Hypothesis: " + self.alternative_hypothesis, "Distribution Order: " + str(self.distribution_order), ] smry.add_extra_txt(extra_text) return smry
def engle_granger_cv(trend: str, num_x: int, nobs: int) -> pd.Series: """ Critical Values for Engle-Granger t-tests Parameters ---------- trend : {"n", "c", "ct", "ctt"} The trend included in the model num_x : The number of cross-sectional regressors in the model. Must be between 1 and 12. nobs : int The number of observations in the time series. Returns ------- Series The critical values for 1, 5 and 10% """ trends = ("n", "c", "ct", "ctt") if trend not in trends: valid = ",".join(trends) raise ValueError(f"Trend must by one of: {valid}") if not 1 <= num_x <= 12: raise ValueError( "The number of cross-sectional variables must be between 1 and " "12 (inclusive)" ) tbl = CV_PARAMETERS[trend] crit_vals = {} for size in (10, 5, 1): params = tbl[size][num_x] x = 1.0 / (nobs ** np.arange(4.0)) crit_vals[size] = x @ params return pd.Series(crit_vals) def engle_granger_pval(stat: float, trend: str, num_x: int) -> float: """ Asymptotic P-values for Engle-Granger t-tests Parameters ---------- stat : float The test statistic trend : {"n", "c", "ct", "ctt"} The trend included in the model num_x : The number of cross-sectional regressors in the model. Must be between 1 and 12. Returns ------- Series The critical values for 1, 5 and 10% """ trends = ("n", "c", "ct", "ctt") if trend not in trends: valid = ",".join(trends) raise ValueError(f"Trend must by one of: {valid}") if not 1 <= num_x <= 12: raise ValueError( "The number of cross-sectional variables must be between 1 and " "12 (inclusive)" ) key = (trend, num_x) if stat > TAU_MAX[key]: return 1.0 elif stat < TAU_MIN[key]: return 0.0 if stat > TAU_STAR[key]: params = np.array(LARGE_PARAMETERS[key]) else: params = np.array(SMALL_PARAMETERS[key]) order = params.shape[0] x = stat ** np.arange(order) return stats.norm().cdf(params @ x)
|
{
"url": "https://arch.readthedocs.io/en/latest/_modules/arch/unitroot/_engle_granger.html",
"source_domain": "arch.readthedocs.io",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "45483",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EQLP4HPOS2UONE6YRMWYWFASG3YTCJNE",
"WARC-Concurrent-To": "<urn:uuid:714e128d-d149-4581-906e-4c0d73061ac2>",
"WARC-Date": "2021-09-22T03:07:31Z",
"WARC-IP-Address": "104.17.32.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LH22WSSTVGWLOCLVZRASXPNOLQFE53Z3",
"WARC-Record-ID": "<urn:uuid:0c705346-11d7-4496-acbe-a70c81bbd7f2>",
"WARC-Target-URI": "https://arch.readthedocs.io/en/latest/_modules/arch/unitroot/_engle_granger.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:223975b5-a0c0-48f4-8c74-ff798fbe72b5>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-22\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
45,
46,
81,
82,
110,
111,
130,
150,
174,
220,
268,
334,
335,
384,
420,
457,
494,
514,
516,
574,
593,
615,
637,
650,
663,
677,
679,
737,
738,
739,
3177,
5120,
6104
],
"line_end_idx": [
45,
46,
81,
82,
110,
111,
130,
150,
174,
220,
268,
334,
335,
384,
420,
457,
494,
514,
516,
574,
593,
615,
637,
650,
663,
677,
679,
737,
738,
739,
3177,
5120,
6104,
7906
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7906,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0.004553500097244978,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15116910636425018,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014681889675557613,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4219684600830078,
"rps_doc_frac_unique_words": 0.3484013080596924,
"rps_doc_mean_word_length": 6.265711307525635,
"rps_doc_num_sentences": 118,
"rps_doc_symbol_to_word_ratio": 0.001087549957446754,
"rps_doc_unigram_entropy": 5.172264099121094,
"rps_doc_word_count": 907,
"rps_doc_frac_chars_dupe_10grams": 0.11191271990537643,
"rps_doc_frac_chars_dupe_5grams": 0.14305824041366577,
"rps_doc_frac_chars_dupe_6grams": 0.11930318176746368,
"rps_doc_frac_chars_dupe_7grams": 0.11191271990537643,
"rps_doc_frac_chars_dupe_8grams": 0.11191271990537643,
"rps_doc_frac_chars_dupe_9grams": 0.11191271990537643,
"rps_doc_frac_chars_top_2gram": 0.014956889674067497,
"rps_doc_frac_chars_top_3gram": 0.01935596950352192,
"rps_doc_frac_chars_top_4gram": 0.018300190567970276,
"rps_doc_books_importance": -726.5660400390625,
"rps_doc_books_importance_length_correction": -726.5660400390625,
"rps_doc_openwebtext_importance": -471.9253845214844,
"rps_doc_openwebtext_importance_length_correction": -471.9253845214844,
"rps_doc_wikipedia_importance": -295.7142333984375,
"rps_doc_wikipedia_importance_length_correction": -295.7142333984375
},
"fasttext": {
"dclm": 0.2839679718017578,
"english": 0.5711682438850403,
"fineweb_edu_approx": 2.6004834175109863,
"eai_general_math": 0.989228367805481,
"eai_open_web_math": 0.1579962968826294,
"eai_web_code": 0.9806064367294312
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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,806,048,936,845,221,000 |
Erasing Tapes
If you do not need the contents stored on tape, you can erase tapes. Veeam Backup & Replication supports two options for erasing data:
• Short erase (fast) — use this option to speed up the erase process. The short erase operation does not physically erase data written on the tape. It simply loads the tape to the drive and wipes the tape header. Note that short erase is not supported by some tape devices.
• Long erase (slow) – use this option to clear all data written to tape. The long erase operation loads the tape to the drive, rewinds the tape and physically erases all data written to the tape.
To erase tapes:
1. Open the Tape Infrastructure view.
2. Navigate to the list of tapes either under Media Pools or under Libraries > LibraryName node > Media > Online.
3. Select tapes you want to erase and click Erase on the ribbon. Choose the type of erase and click OK.
Alternatively, you can right-click selected tapes and select Erase tape. Next, choose how the tape should be erased and click OK.
Important
You cannot erase protected tapes. To erase such tapes, you need to switch the protection off first.
|
{
"url": "https://helpcenter.veeam.com/docs/backup/hyperv/erasing_tapes.html",
"source_domain": "helpcenter.veeam.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "213344",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TWYU2AXQQ7ENGBVB5Q4OHSO7UP5XNVEY",
"WARC-Concurrent-To": "<urn:uuid:1d9c3833-0b48-4dd8-ae03-8063647eb17a>",
"WARC-Date": "2023-01-28T09:39:04Z",
"WARC-IP-Address": "52.203.66.248",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZXEP3HNKSS4AAR4I2YMYARKQSZSLFYAG",
"WARC-Record-ID": "<urn:uuid:b5afca44-e55f-4e1e-ad8e-5cd7db13de27>",
"WARC-Target-URI": "https://helpcenter.veeam.com/docs/backup/hyperv/erasing_tapes.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:afc19a16-7faf-4de8-a4cf-a53e08a6c3c8>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-56\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,
14,
15,
150,
151,
427,
625,
626,
642,
643,
683,
799,
905,
1039,
1040,
1050,
1051
],
"line_end_idx": [
14,
15,
150,
151,
427,
625,
626,
642,
643,
683,
799,
905,
1039,
1040,
1050,
1051,
1150
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1150,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3234042525291443,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008510639891028404,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17446808516979218,
"rps_doc_frac_unique_words": 0.4950000047683716,
"rps_doc_mean_word_length": 4.465000152587891,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.121598720550537,
"rps_doc_word_count": 200,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.049272119998931885,
"rps_doc_frac_chars_dupe_6grams": 0.049272119998931885,
"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.06270997226238251,
"rps_doc_frac_chars_top_3gram": 0.030235160142183304,
"rps_doc_frac_chars_top_4gram": 0.03359461948275566,
"rps_doc_books_importance": -118.49031066894531,
"rps_doc_books_importance_length_correction": -118.49031066894531,
"rps_doc_openwebtext_importance": -50.278560638427734,
"rps_doc_openwebtext_importance_length_correction": -47.46112060546875,
"rps_doc_wikipedia_importance": -24.92154312133789,
"rps_doc_wikipedia_importance_length_correction": -24.92154312133789
},
"fasttext": {
"dclm": 0.027891870588064194,
"english": 0.8294348120689392,
"fineweb_edu_approx": 2.0257298946380615,
"eai_general_math": 0.14669620990753174,
"eai_open_web_math": 0.1993875503540039,
"eai_web_code": 0.10890840739011765
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
172,890,461,883,920,600 |
In this video we are continuing on with our journey into Gulp, the awesome task runner that turns all our front end development chores into a one click wonder.
As we've already seen how the fundamentals of a Gulp task are created, in this video we build upon that knowledge by expanding our existing CSS pipe line, adding in a step to combine (or concatinate) all our many .css files into one single .css file.
There are multiple benefits for doing this.
Firstly, visitors to our web site no longer need to download many separate files. This speeds up the end user experience, which is good for both your visitors and Google with its pesky, ever changing and hard to please search ranking algorithm.
Secondly, as developers we don't lose any flexibility. We aren't having to switch to using one single monolithic CSS file or anything crazy like that. Far from it, in fact.
And thirdly, we can continue to keep our development files full of useful comments, but the end user will never see them - again helping with keeping that final file size to an absolute minimum.
There are other steps we can add into our Gulp tasks. I fully encourage you to take a look at the official Gulp plugins repository, and / or Google searching for 'best Gulp plugins' and what have you, because you will find handily curated lists like this that can narrow down the list of potential options.
Getting SASSy
Front end dev moves at a break neck pace, and it only seems to be getting faster.
CSS is a major pain in the backside as far as I'm concerned. Not so much writing CSS, but keeping your styles organised, modular, and avoiding duplication of effort is a real chore. This isn't helped by the fact that you can't use or extract common properties (background colours, font sizes, etc) into variables.
Enter SASS.
SASS describes itself as CSS with superpowers. I don't proclaim to be any sort of SASS whizz, but I do use it in all my projects now and I can tell you that in my experience, it really whoops CSS's ass (thanks for the paraphrased catchphrase, Winamp!)
At a very high level, SASS will allow you to use variables, nested elements, maths operators (e.g. font-size * 1.2 or similar), imports, and much more. Check out the very useful documentation for all the details.
What I really like about SASS is that it's very easy to get going.
Sort of.
It is actually not that easy to use - IF you don't use a tool like Gulp.
With Gulp, it's a synch.
With very little effort (copying and pasting from the docs) you can bring SASS into your project and immediately start benefiting.
Combine this with everything we have learned so far and I'm sure you will be amazed at how quickly you feel like your front end dev skills have come in a very short amount of time.
That's how I felt. I hope you do too.
Code For This Course
Get the code for this course.
Share This Episode
If you have found this video helpful, please consider sharing. I really appreciate it.
Episodes in this series
# Title Duration
1 Getting Started with Gulp 08:53
2 Gulp Watch Example 06:52
3 Concat and SASS 09:14
4 How to use Gulp with Symfony2 04:04
5 Gulp for bigger projects 08:08
|
{
"url": "https://codereviewvideos.com/course/how-to-use-gulp/video/concat-and-sass",
"source_domain": "codereviewvideos.com",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "25269",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ROOAGH6ZJH4OK62CNFHXZXHQJZET3O42",
"WARC-Concurrent-To": "<urn:uuid:9ea71610-0594-4c2f-99ce-4d3266208e3b>",
"WARC-Date": "2017-04-29T17:33:40Z",
"WARC-IP-Address": "88.80.188.245",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KNPHGNAW2XPSMBQCDTCJLZD7RMMHVKGL",
"WARC-Record-ID": "<urn:uuid:3a71038e-29aa-476e-934f-d975ed98ef47>",
"WARC-Target-URI": "https://codereviewvideos.com/course/how-to-use-gulp/video/concat-and-sass",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2845b417-27e3-49e1-a391-f34c338a8152>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-167-34.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-17\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 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,
1,
161,
162,
413,
414,
458,
459,
704,
705,
878,
879,
1074,
1075,
1382,
1383,
1397,
1398,
1480,
1481,
1795,
1796,
1808,
1809,
2061,
2062,
2275,
2276,
2343,
2344,
2353,
2354,
2427,
2428,
2453,
2454,
2585,
2586,
2767,
2768,
2806,
2807,
2808,
2829,
2830,
2860,
2861,
2880,
2881,
2968,
2969,
2970,
2994,
2995,
3012,
3046,
3073,
3097,
3135
],
"line_end_idx": [
1,
161,
162,
413,
414,
458,
459,
704,
705,
878,
879,
1074,
1075,
1382,
1383,
1397,
1398,
1480,
1481,
1795,
1796,
1808,
1809,
2061,
2062,
2275,
2276,
2343,
2344,
2353,
2354,
2427,
2428,
2453,
2454,
2585,
2586,
2767,
2768,
2806,
2807,
2808,
2829,
2830,
2860,
2861,
2880,
2881,
2968,
2969,
2970,
2994,
2995,
3012,
3046,
3073,
3097,
3135,
3167
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3167,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4364963471889496,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03503650054335594,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16788321733474731,
"rps_doc_frac_unique_words": 0.5212014317512512,
"rps_doc_mean_word_length": 4.3621907234191895,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.0014598499983549118,
"rps_doc_unigram_entropy": 5.285815715789795,
"rps_doc_word_count": 566,
"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.0072904000990092754,
"rps_doc_frac_chars_top_3gram": 0.008910490199923515,
"rps_doc_frac_chars_top_4gram": 0.010530579835176468,
"rps_doc_books_importance": -344.2958068847656,
"rps_doc_books_importance_length_correction": -344.2958068847656,
"rps_doc_openwebtext_importance": -184.1295928955078,
"rps_doc_openwebtext_importance_length_correction": -184.1295928955078,
"rps_doc_wikipedia_importance": -126.48648834228516,
"rps_doc_wikipedia_importance_length_correction": -126.48648834228516
},
"fasttext": {
"dclm": 0.02436273917555809,
"english": 0.952970027923584,
"fineweb_edu_approx": 1.1703636646270752,
"eai_general_math": 0.18953955173492432,
"eai_open_web_math": 0.23480403423309326,
"eai_web_code": 0.26941919326782227
}
}
|
{
"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": "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": "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,967,336,444,282,369,000 |
Glance accepts a model object and returns a tibble::tibble() with exactly one row of model summaries. The summaries are typically goodness of fit measures, p-values for hypothesis tests on residuals, or model convergence information.
Glance never returns information from the original call to the modelling function. This includes the name of the modelling function or any arguments passed to the modelling function.
Glance does not calculate summary measures. Rather, it farms out these computations to appropriate methods and gathers the results together. Sometimes a goodness of fit measure will be undefined. In these cases the measure will be reported as NA.
# S3 method for Arima
glance(x, ...)
Arguments
x
An object of class Arima created by stats::arima().
...
Additional arguments. Not used. Needed to match generic signature only. Cautionary note: Misspelled arguments will be absorbed in ..., where they will be ignored. If the misspelled argument has a default value, the default value will be used. For example, if you pass conf.lvel = 0.9, all computation will proceed using conf.level = 0.95. Additionally, if you pass newdata = my_tibble to an augment() method that does not accept a newdata argument, it will use the default value for the data argument.
See also
stats::arima()
Other Arima tidiers: tidy.Arima()
Value
A tibble::tibble() with exactly one row and columns:
AIC
Akaike's Information Criterion for the model.
BIC
Bayesian Information Criterion for the model.
logLik
The log-likelihood of the model. [stats::logLik()] may be a useful reference.
nobs
Number of observations used.
sigma
Estimated standard error of the residuals.
Examples
fit <- arima(lh, order = c(1, 0, 0)) tidy(fit)
#> # A tibble: 2 x 3 #> term estimate std.error #> <fct> <dbl> <dbl> #> 1 ar1 0.574 0.116 #> 2 intercept 2.41 0.147
glance(fit)
#> # A tibble: 1 x 5 #> sigma logLik AIC BIC nobs #> <dbl> <dbl> <dbl> <dbl> <int> #> 1 0.444 -29.4 64.8 70.4 48
|
{
"url": "https://broom.tidyverse.org/reference/glance.Arima.html",
"source_domain": "broom.tidyverse.org",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "12795",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SSRW5P37RDU2VMRHHJHQQYJA367KPFS6",
"WARC-Concurrent-To": "<urn:uuid:08323cb6-f357-411b-89be-cb9d8468ac16>",
"WARC-Date": "2020-01-18T13:04:37Z",
"WARC-IP-Address": "185.199.108.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZMYOCJTEKQ7HBWU2XN6CDWXNRLHFVJIR",
"WARC-Record-ID": "<urn:uuid:d225c11c-89be-4374-97db-9672c4ee7453>",
"WARC-Target-URI": "https://broom.tidyverse.org/reference/glance.Arima.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c19a8709-1dd6-48ac-bfbd-fa2249fdcd3c>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-158.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,
234,
235,
418,
419,
666,
667,
689,
704,
705,
715,
716,
718,
719,
771,
772,
776,
777,
1279,
1280,
1289,
1290,
1305,
1306,
1340,
1341,
1347,
1348,
1401,
1402,
1406,
1407,
1453,
1454,
1458,
1459,
1505,
1506,
1513,
1514,
1592,
1593,
1598,
1599,
1628,
1629,
1635,
1636,
1679,
1680,
1689,
1690,
1737,
1853,
1865
],
"line_end_idx": [
234,
235,
418,
419,
666,
667,
689,
704,
705,
715,
716,
718,
719,
771,
772,
776,
777,
1279,
1280,
1289,
1290,
1305,
1306,
1340,
1341,
1347,
1348,
1401,
1402,
1406,
1407,
1453,
1454,
1458,
1459,
1505,
1506,
1513,
1514,
1592,
1593,
1598,
1599,
1628,
1629,
1635,
1636,
1679,
1680,
1689,
1690,
1737,
1853,
1865,
1977
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1977,
"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.260869562625885,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020594969391822815,
"rps_doc_frac_lines_end_with_ellipsis": 0.01818181946873665,
"rps_doc_frac_no_alph_words": 0.32951945066452026,
"rps_doc_frac_unique_words": 0.5656565427780151,
"rps_doc_mean_word_length": 5.013467788696289,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.03432494029402733,
"rps_doc_unigram_entropy": 4.836913585662842,
"rps_doc_word_count": 297,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08193417638540268,
"rps_doc_frac_chars_dupe_6grams": 0.04029550030827522,
"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.02014775015413761,
"rps_doc_frac_chars_top_3gram": 0.04029550030827522,
"rps_doc_frac_chars_top_4gram": 0.03223640099167824,
"rps_doc_books_importance": -179.305419921875,
"rps_doc_books_importance_length_correction": -179.305419921875,
"rps_doc_openwebtext_importance": -98.29202270507812,
"rps_doc_openwebtext_importance_length_correction": -98.29202270507812,
"rps_doc_wikipedia_importance": -43.82048797607422,
"rps_doc_wikipedia_importance_length_correction": -43.82048797607422
},
"fasttext": {
"dclm": 0.07161551713943481,
"english": 0.6926312446594238,
"fineweb_edu_approx": 2.170846462249756,
"eai_general_math": 0.9694110155105591,
"eai_open_web_math": 0.026550589129328728,
"eai_web_code": 0.9978889226913452
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,330,762,686,360,662,000 |
Jakub Truhlář Jakub Truhlář - 8 months ago 64
iOS Question
Is the apple-app-site-association implementation safe?
By implementing universal links, you end up with an
apple-app-site-association
file that you put in the root of your server. The file contains both
bundleID
and
teamID
. Is this safe?
I can clearly download e.g. Google’s one and get their IDs since the scenario is always the same.
Answer
There is no security risk from displaying the bundle ID and team ID. It is not possible to use these two pieces of information for anything (either productive or dangerous) without also having access to your Apple Developer account password.
|
{
"url": "https://codedump.io/share/4kYjDtH7C6Y2/1/is-the-apple-app-site-association-implementation-safe",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "39108",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5PWEY3AU4ON6BBCFNPHUWMH5GGWKOUH6",
"WARC-Concurrent-To": "<urn:uuid:a5845888-f0df-4318-926b-9ffcb4fefc48>",
"WARC-Date": "2017-07-25T10:52:00Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IHL25KCG6BC5CDYCT5ZKRRSTMBPJRM4W",
"WARC-Record-ID": "<urn:uuid:0e00b7a4-b64f-4c6c-8cd3-40a673503008>",
"WARC-Target-URI": "https://codedump.io/share/4kYjDtH7C6Y2/1/is-the-apple-app-site-association-implementation-safe",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d9f08e2f-87a2-4c47-8dba-e41cb0feb149>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-148-41-166.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,
56,
69,
70,
125,
126,
178,
179,
206,
275,
284,
288,
295,
311,
312,
410,
411,
418,
419
],
"line_end_idx": [
56,
69,
70,
125,
126,
178,
179,
206,
275,
284,
288,
295,
311,
312,
410,
411,
418,
419,
660
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 660,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37142857909202576,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02142857015132904,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2142857164144516,
"rps_doc_frac_unique_words": 0.7980769276618958,
"rps_doc_mean_word_length": 5.057692527770996,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0.014285709708929062,
"rps_doc_unigram_entropy": 4.298655033111572,
"rps_doc_word_count": 104,
"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.057034220546483994,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -55.534767150878906,
"rps_doc_books_importance_length_correction": -63.77983856201172,
"rps_doc_openwebtext_importance": -34.973880767822266,
"rps_doc_openwebtext_importance_length_correction": -43.21894836425781,
"rps_doc_wikipedia_importance": -29.66438865661621,
"rps_doc_wikipedia_importance_length_correction": -37.90945816040039
},
"fasttext": {
"dclm": 0.07645363360643387,
"english": 0.8958181142807007,
"fineweb_edu_approx": 1.2468867301940918,
"eai_general_math": 0.3270082473754883,
"eai_open_web_math": 0.2556335926055908,
"eai_web_code": 0.0026123500429093838
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,224,915,989,389,784,300 |
HTML5 (Hyper Text Markup Language, version 5) is an umbrella term for recent web technologies. It is also the latest iteration of HTML Became a W3C Recommendation in October 2014, introducing new elements and APIs.
learn more… | top users | synonyms (2)
-2
votes
0answers
22 views
create a road map like timeline chart using html5, css3 and jqurey [on hold]
I need to create a road map like timeline chart, as shown in the figure some just suggest me the best plugin to develop this chart.
-1
votes
0answers
23 views
How to change pointing device effect into hover device effect [on hold]
I am Creating a responsive website, it work nice on desktop or laptop but device below 768px it get stretch by touching. I am giving the link of my website open that in mobile and check Click on ...
0
votes
0answers
24 views
Watch Face with additional styles in Gear S2 on Tizen SDK
I'm working on developing various watch faces for the Gears S2 under the Tizen Web SDK. I've noticed some of the preinstalled watch faces have a "Style" button at the bottom of the watch chooser ...
0
votes
0answers
8 views
Text scroll / marquee not working [jQuery]
I am using two jquery marquee plugins jQuery.Marquee and jquery.simplemarquee . But jquery.simplemarquee not working with jQuery 1.7.2 on opera. Now i am trying to do similar like ...
0
votes
1answer
20 views
How to set the google plus counter at left of the G+ share button
I want to set the counter in G+ share button at left of the button. I am using the following code segment: <div class="social-button-fixed" id="share-btn3"> <g:plus action="share" ...
0
votes
1answer
12 views
how to use a single modal for displaying multiple images
as per the database table rows. My page will be populated with multiple rows(currently 32) Each row has an image. I have created a button/link at the nd of each row. I need a popup (#modal) displaying ...
0
votes
1answer
6 views
Accessing pushState URL on page load
I'm trying to create a gallery that allow custom url rather than url prefix with hashtag. For example: http://www.myportfolio.com/gallery/3 rather than http://www.myportfolio.com/gallery#3 ...
1
vote
0answers
10 views
Save canvas as png automatically without clicking any button or link
I am using canvas for creating an image. I want to create multiple images using single click. So how to use for loop for calling canvas tag for multiple times? I also want those images to be stored ...
1
vote
0answers
7 views
Can we add putImageData to fabric canvas instead of fromURL
fabric.Image.fromURL(hc.toDataURL(), function(img) { // add image onto canvas Canvas.add(img); img.hasControls = false; img.hasBorders = false; ...
0
votes
0answers
15 views
iFrame on Javascript File
I am having problems with iframe tag. I want to load other html file inside a div container through an iframe. Here is my sample code from javascript file: $('#MenuOpen').live('click', function (e) ...
0
votes
0answers
23 views
How to implement checkbox list in selection box HTML?
how to implement the checkbox inside the selection box using html?. And to choose multiple checkbox in the selection field using html.
0
votes
1answer
8 views
How to find the display type of an html5 element?
My question might naive but I don't know where is the display default value of an html5 element on mdn. I read all the pages and it is not written.
0
votes
0answers
14 views
Where do I put the .htaccess file to enable html5 mode in AngularJS
To enable HTML5 mode in AngularJS, I understand from multiple sources that we need to add the following in the config: .config(function($locationProvider) { $locationProvider.html5Mode(true); }) ...
0
votes
0answers
15 views
aria-labelledby and aria-hidden tags meaning
I am building a website using Bootstrap 3. I wanted to implement modals in my website. I made them with the help of the documentation. Now, I have this code, which makes the modal window: <div ...
0
votes
0answers
11 views
HTML5 - Move subwindow to new window
I'm searching for a solution to detach a widget in my HTML5 window and open it in a new Window. Not just the html should be moved, but the whole context. So my approach is to use the local storage ...
1
vote
2answers
36 views
How to read local storage using Python?
I got to use Python to access (read) web-pages in an automatic way. Using Python I can easily access the content of the web-pages (HTML code) as well as cookies sent by the server. Now, in HTML5 we ...
0
votes
1answer
17 views
Referrer to get previous page it isn't working always [on hold]
My problem is Referrer to get previous page it is not working right for example if i open my PHP website from google document.referrer working right and i get google link but if i open my website ...
0
votes
2answers
20 views
Edit and save the json file data on the disk using Jquery Javascript
I want to edit and write the data into the file which is on the disk and I want to save changes back to the same file using jquery. For this i have a button and textarea where I have edited the data ...
-1
votes
1answer
15 views
option:hover style not working in Chrome browser
option:hover { background-color: #804000; color: #ffffff; } Style not reflecting on Chrome but working properly in Firefox and IE FIDDLE
0
votes
1answer
19 views
Nested expressions in angular js
I have an array $scope.colourname =['blue','green']; I have a json value item.color which has outputs of 0 and 1 I want to change a background color as per the json value as blue or green <div ...
-1
votes
1answer
11 views
Can only see first of two canvases (drawing using ionic framework)
I have a problem displaying two canvases on top of each other. I'm using the ionic framework and easeljs to draw on one canvas. Now I want to also be able to see a cursor of varying size and color ...
0
votes
0answers
10 views
HTML 5 scrolling video in a DIV with body overflow blocked and
This is my inspiration code // select video element var vid = document.getElementById('v0'); //var vid = $('#v0')[0]; // jquery option // pause video on load vid.pause(); // alternative ...
1
vote
1answer
10 views
How to get rowspan on Navbar, bootstrap
the code looks like this.. <div class="container"><!-- container--> <div class="row"> <div class="col-md-3" rowspan="2"><!-- brand logo--> <a ...
0
votes
1answer
13 views
I am using Bootstrap portfolio section, want to remove 'ALL' first tab and make the category selected
I am using this template You can scroll down to WORK section which is the portfolio section filterable. The already selected option is "ALL" and that shows all the items. I want to get rid of it and ...
0
votes
1answer
31 views
How to display table in onfocus event?
I designed one input text with label name.I used onfocus on text box it means i entering any name,some related names are displaying.Now my requirement is if i enter name it display one table under ...
-2
votes
1answer
40 views
Make the select option of HTML uncopyable
I have a select option in a td: <table> <tr> <th>company name </th> <th> amount </th> </tr> <tr> <td> company 1 </td> <td> $200 ...
0
votes
1answer
16 views
HTML5 Multiple File Upload: Set Filenames with JavaScript?
An HTML form that allows uploading multiple files looks like this: <form action="http://somehost.com/upload" method="post" enctype="multipart/form-data"> <input type="file" name="image" ...
0
votes
0answers
16 views
On Click of form elements in jQuery Mobile Screen Freezes
I Have designed a page using jQuery mobile, & in the data-role="main" section I have defined the form elements, when I open the page in mobile browser and as soon as I click to fill the input ...
0
votes
0answers
30 views
How to make a border in square box using css[Solved] [duplicate]
How to make border radius like the below using css
0
votes
0answers
20 views
How to make animated canvas shapes follow cursor
I've made some pacman-like shapes that are animated on an html5 canvas and currently only move back and forth in 1 dimension. The program currently has a feature for directional buttons that change ...
0
votes
0answers
16 views
Guidelines to develop aesthetic UI [on hold]
I want to develop a professional UI for a website. Is there any standard process that UI designers follow in getting things done quickly. If so can you please give me some example methodologies they ...
0
votes
1answer
21 views
position: relative; interrupts css opacity in web page
When adding position: relative; to the code the background popup window won't get any opacity - what is the reason for that? I don't understand why centering the web page should affect background ...
0
votes
0answers
16 views
Why isn't the autofocus taking effect in Bootstrapped Meteor app?
In my Meteor app, to which I've added the bootstrap package, I've got this html in a template: . . . <fieldset> <legend>A Leg End is either a foot or a Glutius Maximus</legend> ...
0
votes
2answers
39 views
Can't Center website
How do I center the body? I'm trying to build a 960px web, but when testing it sticks to the left all the time (attached a screenshot). How can I fix this? thanks for everyone that can help! ...
-1
votes
1answer
25 views
Pass Javascript Variable to HTML href?
I have the following code and want to pass Javascript variable (var_x) to the HTML href path inoder to be like this javascript:displaylightbox('./page1.php?name=var_x',{}) <a ...
0
votes
0answers
16 views
How is the size and opacity of a shadow proportionate to the altitude of the body by which it is cast?
I'm writing a game in Javascript/HTML5 and I'm using a shadow to indicate the distance between a floating body and the ground. My question is, is there a formula to determine how big and how opaque or ...
-1
votes
0answers
18 views
Transferring data for use in a different website
I am trying to enter non private data into my webpage and then use this data on a totally DIFFERENT website to get a result which I then want to bring back to my webpage. Although is is a free online ...
0
votes
2answers
27 views
Make Javascript Function then call it back?
I have the following code work successfully <script> $('img').click(function(){ var z = (this.id); document.getElementById("demo").innerHTML = z; }); ...
0
votes
1answer
13 views
Flexbox results in bootstrap columns not “stacking” on small window size/resize
I have a section of my website that I am using the following CSS on 2 divs, and one a tag in order to have the content vertically aligned in the center: .about-us-nav { display: flex; ...
-1
votes
2answers
18 views
Javascript ImageData: replace “data” field
So i have a javascript / html5 page that does some heavy manipulation of images. Because they are heavy, I want to do those in a thread, I extract the image data with getImageData().data to the core. ...
-3
votes
3answers
41 views
PHP Code inside HTML? [on hold]
what is wrong in following code as when I remove the php variable $var every thing work but I need to insert the id value which equals 5000 in a PHP variable $var echo '<div id="img1" ...
-4
votes
1answer
33 views
How do I add a full site search to a website in Javascript/jQuery?
I am creating a HTML5 website and I need to create a site search box that displays results in a results page with description and photo. How would I go about this. I have looked alot and only see ...
0
votes
1answer
29 views
Design a input box with extended lines
I am trying to code an input box like in the image below. However, I only end up with part of the lines with the current code. When it's a button rather than an edit, everything in fine. ...
0
votes
1answer
38 views
How can I pass a variable value from JavaScript to PHP
I've tried this and I do not know if it is the right way: HTML Code: <div class="container-fluid"> <form class="form-inline"> <div class="form-group"> ...
0
votes
1answer
25 views
article devided over multiple sections
I'm building a blog page. At the top we have a div which contains the header image, title, author and other meta. Underneath this section we have a sidebar and after that comes the content of the ...
0
votes
0answers
12 views
remove pause icon when video finished playing - iphone (jwplayer)
I am using jwplayer7 javascript version. On iphone when I am clicking on play icon it works, plays with iphone's native player, then when I click to pause and 'Done', it closes native player and still ...
0
votes
0answers
13 views
Get data from another web in to hybrid mobile app [on hold]
I am newbie to designing Hybrid mobile application using intel xdk(also, I know little about HTML5/Javascript ). I have one https link (for example https://xyz). This link contains one table. I want ...
1
vote
2answers
20 views
Python BeautifulSoupe4: How to get link from anchor tag without duplicate
<a href=”link” class=”link_to_img”> <img src=”dosen’t matter”></img> </a> <span> <a href=”link” class=”link_to_img”>Title Of Image</a> </span> As you ...
0
votes
1answer
36 views
KnockoutJs validation error message from .html file
I have a question regarding KnockoutJs html5 validation. If i wanted to include my error message on the page when it was loaded, like say i am doing a frontend module for my webshop and my error ...
-1
votes
3answers
30 views
querySelectorAll.style does not work
I am writing something in JavaScript that I need to use querySelectorAll.style but it always returns undefined, but it works perfectly with querySelector.style. How can I make it work properly so I ...
|
{
"url": "http://stackoverflow.com/questions/tagged/html5?page=2&sort=newest&pagesize=15",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "183599",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7YXJZRGZEY6HYVYJNKKBVAM2KCP5PP6W",
"WARC-Concurrent-To": "<urn:uuid:5520f14c-dfde-41d7-9e8d-213ab16c69a5>",
"WARC-Date": "2015-10-13T23:26:04Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VTD2RF7TX52NVN3K3VGAPHI4Z5HFWJ6A",
"WARC-Record-ID": "<urn:uuid:4baca50c-ca66-47e8-9a84-7c69681bc0ef>",
"WARC-Target-URI": "http://stackoverflow.com/questions/tagged/html5?page=2&sort=newest&pagesize=15",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d83f7853-9c30-49db-959b-49518ef5d208>"
},
"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,
215,
216,
255,
256,
259,
265,
274,
283,
284,
361,
362,
494,
497,
503,
512,
521,
522,
594,
595,
794,
796,
802,
811,
820,
821,
879,
880,
1079,
1081,
1087,
1096,
1104,
1105,
1148,
1149,
1333,
1335,
1341,
1349,
1358,
1359,
1425,
1426,
1610,
1612,
1618,
1626,
1635,
1636,
1693,
1694,
1899,
1901,
1907,
1915,
1923,
1924,
1961,
1962,
2155,
2157,
2162,
2171,
2180,
2181,
2250,
2251,
2453,
2455,
2460,
2469,
2477,
2478,
2538,
2539,
2687,
2689,
2695,
2704,
2713,
2714,
2740,
2741,
2943,
2945,
2951,
2960,
2969,
2970,
3024,
3025,
3160,
3162,
3168,
3176,
3184,
3185,
3235,
3236,
3384,
3386,
3392,
3401,
3410,
3411,
3479,
3480,
3679,
3681,
3687,
3696,
3705,
3706,
3751,
3752,
3949,
3951,
3957,
3966,
3975,
3976,
4013,
4014,
4215,
4217,
4222,
4231,
4240,
4241,
4281,
4282,
4484,
4486,
4492,
4500,
4509,
4510,
4574,
4575,
4775,
4777,
4783,
4792,
4801,
4802,
4871,
4872,
5075,
5078,
5084,
5092,
5101,
5102,
5151,
5152,
5289,
5291,
5297,
5305,
5314,
5315,
5348,
5349,
5546,
5549,
5555,
5563,
5572,
5573,
5640,
5641,
5842,
5844,
5850,
5859,
5868,
5869,
5932,
5933,
6123,
6125,
6130,
6138,
6147,
6148,
6188,
6189,
6335,
6337,
6343,
6351,
6360,
6361,
6463,
6464,
6667,
6669,
6675,
6683,
6692,
6693,
6732,
6733,
6934,
6937,
6943,
6951,
6960,
6961,
7003,
7004,
7136,
7138,
7144,
7152,
7161,
7162,
7221,
7222,
7412,
7414,
7420,
7429,
7438,
7439,
7497,
7498,
7694,
7696,
7702,
7711,
7720,
7721,
7786,
7787,
7838,
7840,
7846,
7855,
7864,
7865,
7914,
7915,
8117,
8119,
8125,
8134,
8143,
8144,
8189,
8190,
8393,
8395,
8401,
8409,
8418,
8419,
8474,
8475,
8675,
8677,
8683,
8692,
8701,
8702,
8768,
8769,
8950,
8952,
8958,
8967,
8976,
8977,
8998,
8999,
9194,
9197,
9203,
9211,
9220,
9221,
9260,
9261,
9440,
9442,
9448,
9457,
9466,
9467,
9570,
9571,
9776,
9779,
9785,
9794,
9803,
9804,
9853,
9854,
10058,
10060,
10066,
10075,
10084,
10085,
10129,
10130,
10284,
10286,
10292,
10300,
10309,
10310,
10390,
10391,
10579,
10582,
10588,
10597,
10606,
10607,
10650,
10651,
10855,
10858,
10864,
10873,
10882,
10883,
10915,
10916,
11104,
11107,
11113,
11121,
11130,
11131,
11198,
11199,
11399,
11401,
11407,
11415,
11424,
11425,
11464,
11465,
11656,
11658,
11664,
11672,
11681,
11682,
11737,
11738,
11893,
11895,
11901,
11909,
11918,
11919,
11958,
11959,
12159,
12161,
12167,
12176,
12185,
12186,
12252,
12253,
12458,
12460,
12466,
12475,
12484,
12485,
12545,
12546,
12749,
12751,
12756,
12765,
12774,
12775,
12849,
12850,
13004,
13006,
13012,
13020,
13029,
13030,
13082,
13083,
13282,
13285,
13291,
13300,
13309,
13310,
13347,
13348
],
"line_end_idx": [
215,
216,
255,
256,
259,
265,
274,
283,
284,
361,
362,
494,
497,
503,
512,
521,
522,
594,
595,
794,
796,
802,
811,
820,
821,
879,
880,
1079,
1081,
1087,
1096,
1104,
1105,
1148,
1149,
1333,
1335,
1341,
1349,
1358,
1359,
1425,
1426,
1610,
1612,
1618,
1626,
1635,
1636,
1693,
1694,
1899,
1901,
1907,
1915,
1923,
1924,
1961,
1962,
2155,
2157,
2162,
2171,
2180,
2181,
2250,
2251,
2453,
2455,
2460,
2469,
2477,
2478,
2538,
2539,
2687,
2689,
2695,
2704,
2713,
2714,
2740,
2741,
2943,
2945,
2951,
2960,
2969,
2970,
3024,
3025,
3160,
3162,
3168,
3176,
3184,
3185,
3235,
3236,
3384,
3386,
3392,
3401,
3410,
3411,
3479,
3480,
3679,
3681,
3687,
3696,
3705,
3706,
3751,
3752,
3949,
3951,
3957,
3966,
3975,
3976,
4013,
4014,
4215,
4217,
4222,
4231,
4240,
4241,
4281,
4282,
4484,
4486,
4492,
4500,
4509,
4510,
4574,
4575,
4775,
4777,
4783,
4792,
4801,
4802,
4871,
4872,
5075,
5078,
5084,
5092,
5101,
5102,
5151,
5152,
5289,
5291,
5297,
5305,
5314,
5315,
5348,
5349,
5546,
5549,
5555,
5563,
5572,
5573,
5640,
5641,
5842,
5844,
5850,
5859,
5868,
5869,
5932,
5933,
6123,
6125,
6130,
6138,
6147,
6148,
6188,
6189,
6335,
6337,
6343,
6351,
6360,
6361,
6463,
6464,
6667,
6669,
6675,
6683,
6692,
6693,
6732,
6733,
6934,
6937,
6943,
6951,
6960,
6961,
7003,
7004,
7136,
7138,
7144,
7152,
7161,
7162,
7221,
7222,
7412,
7414,
7420,
7429,
7438,
7439,
7497,
7498,
7694,
7696,
7702,
7711,
7720,
7721,
7786,
7787,
7838,
7840,
7846,
7855,
7864,
7865,
7914,
7915,
8117,
8119,
8125,
8134,
8143,
8144,
8189,
8190,
8393,
8395,
8401,
8409,
8418,
8419,
8474,
8475,
8675,
8677,
8683,
8692,
8701,
8702,
8768,
8769,
8950,
8952,
8958,
8967,
8976,
8977,
8998,
8999,
9194,
9197,
9203,
9211,
9220,
9221,
9260,
9261,
9440,
9442,
9448,
9457,
9466,
9467,
9570,
9571,
9776,
9779,
9785,
9794,
9803,
9804,
9853,
9854,
10058,
10060,
10066,
10075,
10084,
10085,
10129,
10130,
10284,
10286,
10292,
10300,
10309,
10310,
10390,
10391,
10579,
10582,
10588,
10597,
10606,
10607,
10650,
10651,
10855,
10858,
10864,
10873,
10882,
10883,
10915,
10916,
11104,
11107,
11113,
11121,
11130,
11131,
11198,
11199,
11399,
11401,
11407,
11415,
11424,
11425,
11464,
11465,
11656,
11658,
11664,
11672,
11681,
11682,
11737,
11738,
11893,
11895,
11901,
11909,
11918,
11919,
11958,
11959,
12159,
12161,
12167,
12176,
12185,
12186,
12252,
12253,
12458,
12460,
12466,
12475,
12484,
12485,
12545,
12546,
12749,
12751,
12756,
12765,
12774,
12775,
12849,
12850,
13004,
13006,
13012,
13020,
13029,
13030,
13082,
13083,
13282,
13285,
13291,
13300,
13309,
13310,
13347,
13348,
13549
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13549,
"ccnet_original_nlines": 403,
"rps_doc_curly_bracket": 0.0007380599854514003,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31830599904060364,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0450819693505764,
"rps_doc_frac_lines_end_with_ellipsis": 0.11138614267110825,
"rps_doc_frac_no_alph_words": 0.215846985578537,
"rps_doc_frac_unique_words": 0.31738367676734924,
"rps_doc_mean_word_length": 4.554872512817383,
"rps_doc_num_sentences": 155,
"rps_doc_symbol_to_word_ratio": 0.01775955967605114,
"rps_doc_unigram_entropy": 5.685720920562744,
"rps_doc_word_count": 2278,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.047320738434791565,
"rps_doc_frac_chars_dupe_6grams": 0.021395530551671982,
"rps_doc_frac_chars_dupe_7grams": 0.0059753297828137875,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01966075971722603,
"rps_doc_frac_chars_top_3gram": 0.0215882807970047,
"rps_doc_frac_chars_top_4gram": 0.006168080028146505,
"rps_doc_books_importance": -1384.10595703125,
"rps_doc_books_importance_length_correction": -1384.10595703125,
"rps_doc_openwebtext_importance": -829.3430786132812,
"rps_doc_openwebtext_importance_length_correction": -829.3430786132812,
"rps_doc_wikipedia_importance": -714.5134887695312,
"rps_doc_wikipedia_importance_length_correction": -714.5134887695312
},
"fasttext": {
"dclm": 0.049861129373311996,
"english": 0.8503760695457458,
"fineweb_edu_approx": 1.1907557249069214,
"eai_general_math": 0.005043449811637402,
"eai_open_web_math": 0.09767544269561768,
"eai_web_code": 0.005316670052707195
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,017,899,259,110,985,000 |
Expand my Community achievements bar.
SOLVED
Async Servlet not working as expected
Avatar
Former Community Member
Hi,
i want to use a asynchronous servlet to let the user be informed about resent events. So i create a async servlet and everything works got as long the user stays on the page. But when the user closes the page / browser curiously the session stays open and the servlet thread sends data to a not more existing client. I expected to get a IOException in this case, so i can react on the exception and shutdown everything in the backend, e.g. unregister the streamwriter, interrupt open threads and so on.
But no excpetion is thrown! As part of a plain J2EE application running on a tomcat it works as expected but not inside AEM 6. Is there something special i had not in mind? Doesn't support the embedded jetty asyncrounos servlets? What i have overlooked?
My servlet looks like the following:
@SlingServlet(name = "TestServlet", paths = { "/bin/servlet/test" }, methods = { "GET" }) public class TestServlet extends SlingAllMethodsServlet { protected void doGet(SlingHttpServletRequest request, SlingHttpServletResponse response) throws ServletException, IOException { handleRequest(request, response); } private void handleRequest(final SlingHttpServletRequest request, final SlingHttpServletResponse response) { // set ASYNC request.isAsyncSupported(); request.setAttribute("org.apache.catalina.ASYNC_SUPPORTED", true); AsyncContext asyncContext = request.startAsync(request, response); asyncContext.setTimeout(10000); // subscribe to the events service which starts a new thread for the user // and pushes data to the response... }
And the Thread which writes the data:
public void run() { try { response = asyncContext.getResponse(); response.setContentType("application/json"); response.setCharacterEncoding("UTF-8"); // write in stream ... response.getWriter().write(o.toString()); response.getWriter().flush(); response.flushBuffer(); } } catch (Exception e) { LOG.debug("Connection lost, maybe client is disconnected.", e); cancel(); } }
Best regards
Mike
1 Accepted Solution
Avatar
Correct answer by
Level 10
We talked about this use case today - in AEM, there does not appear to be a way of preventing the servlet from completing execution of code once it was invoked. The thread will stop once the servlet reached the end of the app logic. It will attempt to return a value as well.
View solution in original post
5 Replies
Avatar
Employee Advisor
Why can't you intercept the browser close event in the javascript and send an HTTP request to your servlet to close everything ?
Avatar
Former Community Member
Thanks kunal23 for your response.
Yes thats a possible solution. But what happens for example when the browser crashes? In this case i doesn't get any request form javascript and so i never get informed that i can do my cleanup. And at some point my AEM will be sticky with threads.
I hope you got my point. I don't want to be dependent on the client side. There can be happen many things form a crashing system to network interruption.
Best regards
Mike
Avatar
Correct answer by
Level 10
We talked about this use case today - in AEM, there does not appear to be a way of preventing the servlet from completing execution of code once it was invoked. The thread will stop once the servlet reached the end of the app logic. It will attempt to return a value as well.
Avatar
Level 2
Hi Mikes/Donald, We are stuck with similar situation and want to implement Async Sling servlet within AEM. Do you have any boilerplate code snippet which can be shared for this one ?
Avatar
Level 1
is it okay to have a sling job to do the task asynchronously even if the servlet has responded back ?
|
{
"url": "https://experienceleaguecommunities.adobe.com/t5/adobe-experience-manager/async-servlet-not-working-as-expected/td-p/193668",
"source_domain": "experienceleaguecommunities.adobe.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "410734",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UHV5UE72ZBJYPYGE46BCPOVXKFUDT7PV",
"WARC-Concurrent-To": "<urn:uuid:9dde9d3e-bfeb-4d5b-82a2-82f870457ef6>",
"WARC-Date": "2024-06-22T14:00:02Z",
"WARC-IP-Address": "13.32.208.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M7NR6KIHXQCC4WXZDTNQYA6GWJZYJTT7",
"WARC-Record-ID": "<urn:uuid:5514d76e-3789-4cfb-a47f-75e43678a45a>",
"WARC-Target-URI": "https://experienceleaguecommunities.adobe.com/t5/adobe-experience-manager/async-servlet-not-working-as-expected/td-p/193668",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fd9f722e-ac58-403e-b4db-fbda87d447ca>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-251\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
38,
39,
46,
47,
85,
86,
93,
94,
118,
119,
123,
124,
627,
628,
882,
883,
920,
921,
1663,
1664,
1702,
1703,
2076,
2077,
2090,
2091,
2096,
2097,
2117,
2118,
2125,
2126,
2144,
2153,
2154,
2431,
2432,
2463,
2464,
2474,
2475,
2482,
2483,
2500,
2501,
2630,
2631,
2638,
2639,
2663,
2664,
2698,
2699,
2949,
2950,
3104,
3105,
3118,
3119,
3124,
3125,
3132,
3133,
3151,
3160,
3161,
3438,
3439,
3446,
3447,
3455,
3456,
3639,
3640,
3647,
3648,
3656,
3657
],
"line_end_idx": [
38,
39,
46,
47,
85,
86,
93,
94,
118,
119,
123,
124,
627,
628,
882,
883,
920,
921,
1663,
1664,
1702,
1703,
2076,
2077,
2090,
2091,
2096,
2097,
2117,
2118,
2125,
2126,
2144,
2153,
2154,
2431,
2432,
2463,
2464,
2474,
2475,
2482,
2483,
2500,
2501,
2630,
2631,
2638,
2639,
2663,
2664,
2698,
2699,
2949,
2950,
3104,
3105,
3118,
3119,
3124,
3125,
3132,
3133,
3151,
3160,
3161,
3438,
3439,
3446,
3447,
3455,
3456,
3639,
3640,
3647,
3648,
3656,
3657,
3758
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3758,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0.004257579799741507,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3434065878391266,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021978020668029785,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2032967060804367,
"rps_doc_frac_unique_words": 0.4700544476509094,
"rps_doc_mean_word_length": 5.352087020874023,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.002747250022366643,
"rps_doc_unigram_entropy": 5.147218704223633,
"rps_doc_word_count": 551,
"rps_doc_frac_chars_dupe_10grams": 0.1661580204963684,
"rps_doc_frac_chars_dupe_5grams": 0.1661580204963684,
"rps_doc_frac_chars_dupe_6grams": 0.1661580204963684,
"rps_doc_frac_chars_dupe_7grams": 0.1661580204963684,
"rps_doc_frac_chars_dupe_8grams": 0.1661580204963684,
"rps_doc_frac_chars_dupe_9grams": 0.1661580204963684,
"rps_doc_frac_chars_top_2gram": 0.02034587971866131,
"rps_doc_frac_chars_top_3gram": 0.014242120087146759,
"rps_doc_frac_chars_top_4gram": 0.018311290070414543,
"rps_doc_books_importance": -303.61029052734375,
"rps_doc_books_importance_length_correction": -303.61029052734375,
"rps_doc_openwebtext_importance": -156.786865234375,
"rps_doc_openwebtext_importance_length_correction": -156.786865234375,
"rps_doc_wikipedia_importance": -97.04271697998047,
"rps_doc_wikipedia_importance_length_correction": -97.04271697998047
},
"fasttext": {
"dclm": 0.05595337972044945,
"english": 0.8124694228172302,
"fineweb_edu_approx": 1.0946837663650513,
"eai_general_math": 0.28549128770828247,
"eai_open_web_math": 0.13703292608261108,
"eai_web_code": 0.4861018657684326
}
}
|
{
"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": "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
|
7,427,727,673,698,982,000 |
Icono del sitio AranaCorp
Mejora tu programa Arduino
5
(1)
El espacio de memoria es limitado en una placa Arduino, puede ser importante mejorar su programa Arduino para evitar ciertos problemas. Cuanto más avanzamos en la programación, más llegamos a escribir programas largos y complejos. Es importante, lo antes posible, tomar los reflejos correctos. Se pueden tomar buenos hábitos para facilitar compartir y leer su trabajo; así como para mejorar su ejecución y el espacio ocupado en la memoria.
Veremos en este artículo algunos métodos para mejorar su programa Arduino.
Prerrequisito : Programación con Arduino
Nombres de variables y funciones
Utilice funciones claras y nombres de variables:
nombres explícitos en lugar de letras (Ej: » sensorValue » en lugar de » a «)
Creación de bucles y funciones
Cuando un código se repite varias veces en un programa, crea una función o un bucle.
Use bucles en vectores (matriz). Vamos a leer todas las entradas analógicas del Arduino.
int a,b,c,d,e,f;
void setup() {
Serial.begin(9600);
}
void loop() {
a=analogRead(A0);
b=analogRead(A1);
c=analogRead(A2);
d=analogRead(A3);
e=analogRead(A4);
f=analogRead(A5);
Serial.print(a);
Serial.print(b);
Serial.print(c);
Serial.print(d);
Serial.print(e);
Serial.print(f);
}
Resultado:
Le croquis utilise 1952 octets (6%) de l'espace de stockage de programmes. Le maximum est de 32256 octets.
Les variables globales utilisent 196 octets (9%) de mémoire dynamique, ce qui laisse 1852 octets pour les variables locales. Le maximum est de 2048 octets.
Introducción de un bucle for y una matriz
int a[6];
void setup() {
Serial.begin(9600);
}
void loop() {
for(int i=0;i<6;i++){
a[i]=analogRead(14+i);
Serial.print(a[i]);
}
}
Podemos ver que, además de ser más legible, el espacio de memoria que ocupa el código se reduce después de esta operación
Le croquis utilise 1746 octets (5%) de l'espace de stockage de programmes. Le maximum est de 32256 octets.
Les variables globales utilisent 184 octets (8%) de mémoire dynamique, ce qui laisse 1864 octets pour les variables locales. Le maximum est de 2048 octets.
Tipo de variables
Use los tipos correctos de variable. Los tipos variables ocupan espacios de memoria de diferentes tamaños en el microcontrolador.
Aquí hay una tabla resumen de tamaños variables.
Type Size Range
boolean 1 byte 0 to 1
char 1 byte -128 to 127
unsigned char 1 byte 0 to 255
int 2 bytes -32,768 to 32,767
unsigned int 2 bytes 0 to 65,535
word 2 bytes 0 to 65,535
long 4 bytes -2,147,483,648 to 2,147483,647
unsigned long 4 bytes 0 to 4,294,967,295
float 4 bytes 3.4028235E-38 to 3.4028235E+38
double 4 bytes 3.4028235E-38 to 3.4028235E+38
string 1 byte + # of chars N/A
array 1 byte + (sizeOfType * # of elements) N/A
enum N/A N/A
struct N/A N/A
pointer N/A N/A
void N/A N/A
Para elegir correctamente el tipo de variable, es bueno conocer sus valores extremos y saber qué tipos de operaciones se realizarán en esta variable. Debe elegir el tipo más pequeño para describir la variable y la operación.
Ejemplo: escribir flotante a = analogRead (A0); no tiene sentido porque la función analogRead () devuelve un valor entre 0 y 1023. Por lo tanto, la variable debe ser de tipo unsigned int
Definido como un float
float a;
void setup() {
Serial.begin(9600);
}
void loop() {
a=analogRead(A0);
Serial.print(a);
}
Le croquis utilise 2968 octets (9%) de l'espace de stockage de programmes. Le maximum est de 32256 octets.
Les variables globales utilisent 196 octets (9%) de mémoire dynamique, ce qui laisse 1852 octets pour les variables locales. Le maximum est de 2048 octets.
Definido como un int
int a;
void setup() {
Serial.begin(9600);
}
void loop() {
a=analogRead(A0);
Serial.print(a);
}
Le croquis utilise 1736 octets (5%) de l'espace de stockage de programmes. Le maximum est de 32256 octets.
Les variables globales utilisent 184 octets (8%) de mémoire dynamique, ce qui laisse 1864 octets pour les variables locales. Le maximum est de 2048 octets.
Tipo de variable constante
Cuando la variable no se mueva mientras el programa se está ejecutando, use «const» o #define para definir la variable
Variable global o local
Cuando la variable se usa en diferentes funciones, puede ser interesante definirla como global. Si es una variable que solo existe para mostrar un resultado intermedio, es mejor definirlo localmente.
Función F() para visualizar en el monitor serie
Al colocar las cadenas en la función F (), esto ahorra mucho espacio cuando se envía mucha información al monitor en serie.
Ejemplo: Encontré un código en Internet con una cantidad fenomenal de print () (incluso escribí un script de Python para modificar el código para incluir la función F ()). Aquí está el resultado de la compilación:
Le croquis utilise 36966 octets (14%) de l'espace de stockage de programmes. Le maximum est de 253952 octets.
Les variables globales utilisent 6500 octets (79%) de mémoire dynamique, ce qui laisse 1692 octets pour les variables locales. Le maximum est de 8192 octets.
La mémoire disponible faible, des problèmes de stabilité pourraient survenir.
Después de modificar todo Serial.print () y Serial.println () en el script .INO, aquí está el resultado de la compilación:
Le croquis utilise 36770 octets (14%) de l'espace de stockage de programmes. Le maximum est de 253952 octets.
Les variables globales utilisent 4830 octets (58%) de mémoire dynamique, ce qui laisse 3362 octets pour les variables locales. Le maximum est de 8192 octets.
Una reducción del 79 al 58% y más problemas de estabilidad. Más bien práctico.
Use la función millis ()
En principio, debe prohibir el uso de funciones que bloquean la ejecución de código como delay (). Para códigos simples, esto está bien, pero cuando tiene que intentar ejecutar múltiples tareas en paralelo, ya no puede permitírselo.
Existen varias soluciones para hacer sin demora (): millis (), Timer.h, Timer2.h, interupt. Te muestro en este artículo, la solución millis () que es suficiente en la mayoría de los casos, pero no dudes en preguntar sobre los demás.
Aquí hay un ejemplo de un código que lee la entrada analógica A0 cada 500 ms
int a;
void setup() {
Serial.begin(9600);
}
void loop() {
a=analogRead(A0);
Serial.print(a);
delay(500);
}
Cuando modificamos el código para integrar la función millis (), obtenemos el mismo resultado con, además, la capacidad de hacer algo más durante estos 500 ms
int a;
unsigned long previousTime=0;
void setup() {
Serial.begin(9600);
}
void loop() {
if(millis()-previousTime)>500{
previousTime=millis();
a=analogRead(A0);
Serial.print(a);
}
}
Si conoce otros métodos o mejores prácticas para escribir y mejorar su programa Arduino, no dude en dejar un comentario.
Sources
¿De cuánta utilidad te ha parecido este contenido?
¡Haz clic en una estrella para puntuar!
Promedio de puntuación 5 / 5. Recuento de votos: 1
Hasta ahora, ¡no hay votos!. Sé el primero en puntuar este contenido.
Salir de la versión móvil
|
{
"url": "https://www.aranacorp.com/es/mejora-tu-programa-arduino/amp/",
"source_domain": "www.aranacorp.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "51216",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RQBWCB7ZCGNI42YN3N5QIHQRTE5TQZI4",
"WARC-Concurrent-To": "<urn:uuid:91eb1409-f5db-47be-b8c4-ec856434f22a>",
"WARC-Date": "2021-10-23T18:08:52Z",
"WARC-IP-Address": "213.186.33.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5QQ4J6Z6GOKCP2H7XHXPXFZBAJOVZZ7W",
"WARC-Record-ID": "<urn:uuid:49f401c5-c8e6-4085-84ee-d76adab0e11b>",
"WARC-Target-URI": "https://www.aranacorp.com/es/mejora-tu-programa-arduino/amp/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:79aacbdd-d0db-4f6b-acf1-bea7a348e94e>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-206\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
26,
27,
54,
55,
57,
61,
62,
502,
503,
578,
579,
580,
621,
622,
623,
656,
657,
706,
707,
785,
786,
817,
818,
903,
904,
993,
994,
1011,
1026,
1048,
1050,
1051,
1065,
1086,
1107,
1128,
1149,
1170,
1191,
1194,
1213,
1232,
1251,
1270,
1289,
1308,
1310,
1311,
1322,
1323,
1430,
1586,
1587,
1629,
1630,
1640,
1655,
1677,
1679,
1680,
1694,
1718,
1745,
1769,
1773,
1775,
1776,
1898,
1899,
2006,
2162,
2163,
2164,
2165,
2183,
2184,
2314,
2315,
2364,
2365,
2381,
2403,
2427,
2457,
2487,
2520,
2545,
2589,
2630,
2675,
2721,
2752,
2800,
2813,
2828,
2844,
2857,
2858,
3083,
3084,
3271,
3272,
3295,
3296,
3305,
3320,
3342,
3344,
3345,
3359,
3380,
3399,
3401,
3402,
3509,
3665,
3666,
3687,
3688,
3695,
3710,
3732,
3734,
3735,
3749,
3770,
3789,
3791,
3792,
3899,
4055,
4056,
4083,
4084,
4203,
4204,
4205,
4229,
4230,
4430,
4431,
4432,
4433,
4481,
4482,
4606,
4607,
4821,
4822,
4932,
5090,
5168,
5169,
5292,
5293,
5403,
5561,
5562,
5641,
5642,
5643,
5644,
5669,
5670,
5903,
5904,
6137,
6138,
6215,
6216,
6223,
6238,
6260,
6262,
6263,
6277,
6297,
6316,
6330,
6332,
6333,
6492,
6493,
6500,
6530,
6545,
6567,
6569,
6570,
6584,
6617,
6644,
6666,
6687,
6691,
6693,
6694,
6815,
6816,
6817,
6825,
6826,
6877,
6878,
6918,
6919,
6970,
6971,
7041,
7042
],
"line_end_idx": [
26,
27,
54,
55,
57,
61,
62,
502,
503,
578,
579,
580,
621,
622,
623,
656,
657,
706,
707,
785,
786,
817,
818,
903,
904,
993,
994,
1011,
1026,
1048,
1050,
1051,
1065,
1086,
1107,
1128,
1149,
1170,
1191,
1194,
1213,
1232,
1251,
1270,
1289,
1308,
1310,
1311,
1322,
1323,
1430,
1586,
1587,
1629,
1630,
1640,
1655,
1677,
1679,
1680,
1694,
1718,
1745,
1769,
1773,
1775,
1776,
1898,
1899,
2006,
2162,
2163,
2164,
2165,
2183,
2184,
2314,
2315,
2364,
2365,
2381,
2403,
2427,
2457,
2487,
2520,
2545,
2589,
2630,
2675,
2721,
2752,
2800,
2813,
2828,
2844,
2857,
2858,
3083,
3084,
3271,
3272,
3295,
3296,
3305,
3320,
3342,
3344,
3345,
3359,
3380,
3399,
3401,
3402,
3509,
3665,
3666,
3687,
3688,
3695,
3710,
3732,
3734,
3735,
3749,
3770,
3789,
3791,
3792,
3899,
4055,
4056,
4083,
4084,
4203,
4204,
4205,
4229,
4230,
4430,
4431,
4432,
4433,
4481,
4482,
4606,
4607,
4821,
4822,
4932,
5090,
5168,
5169,
5292,
5293,
5403,
5561,
5562,
5641,
5642,
5643,
5644,
5669,
5670,
5903,
5904,
6137,
6138,
6215,
6216,
6223,
6238,
6260,
6262,
6263,
6277,
6297,
6316,
6330,
6332,
6333,
6492,
6493,
6500,
6530,
6545,
6567,
6569,
6570,
6584,
6617,
6644,
6666,
6687,
6691,
6693,
6694,
6815,
6816,
6817,
6825,
6826,
6877,
6878,
6918,
6919,
6970,
6971,
7041,
7042,
7067
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7067,
"ccnet_original_nlines": 210,
"rps_doc_curly_bracket": 0.003962079994380474,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07213114947080612,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026229510083794594,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3081967234611511,
"rps_doc_frac_unique_words": 0.37559130787849426,
"rps_doc_mean_word_length": 5.159886360168457,
"rps_doc_num_sentences": 82,
"rps_doc_symbol_to_word_ratio": 0.001967210089787841,
"rps_doc_unigram_entropy": 5.353945732116699,
"rps_doc_word_count": 1057,
"rps_doc_frac_chars_dupe_10grams": 0.23872387409210205,
"rps_doc_frac_chars_dupe_5grams": 0.2975797653198242,
"rps_doc_frac_chars_dupe_6grams": 0.2697103023529053,
"rps_doc_frac_chars_dupe_7grams": 0.25045838952064514,
"rps_doc_frac_chars_dupe_8grams": 0.25045838952064514,
"rps_doc_frac_chars_dupe_9grams": 0.25045838952064514,
"rps_doc_frac_chars_top_2gram": 0.019801979884505272,
"rps_doc_frac_chars_top_3gram": 0.026402639225125313,
"rps_doc_frac_chars_top_4gram": 0.030803080648183823,
"rps_doc_books_importance": -736.3960571289062,
"rps_doc_books_importance_length_correction": -736.3960571289062,
"rps_doc_openwebtext_importance": -384.19720458984375,
"rps_doc_openwebtext_importance_length_correction": -384.19720458984375,
"rps_doc_wikipedia_importance": -218.7061309814453,
"rps_doc_wikipedia_importance_length_correction": -218.7061309814453
},
"fasttext": {
"dclm": 0.7824721336364746,
"english": 0.004678649827837944,
"fineweb_edu_approx": 1.305493950843811,
"eai_general_math": 0.0033566399943083525,
"eai_open_web_math": 0.24106621742248535,
"eai_web_code": 0.6654822826385498
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
9,075,008,316,419,381,000 |
What happens if a user spends a long time in creating a static group of contacts/records only to discover that they made it private and it can't be shared with colleagues?
One little oddity in Sage CRM is that once a group has been created as a private group the interface doesn't provide a mechanism to make it public.
This is the point that you discover that Groups (target lists) are actually held as meta data in the custom_reports table.
The field in the custom_report table we need to access is the repo_privateuserid.
If repo_privateuserid is set to 0 then all users should be able to see it.
If it is set to -1 then only Info Admin and above could see it.
To make the field public we would have to run an SQL statement against the table:
e.g.
update custom_reports
set repo_privateuserid = 0
where repo_name = 'MyGroup'
|
{
"url": "https://community.sagecrm.com/partner_community/b/hints_tips_and_tricks/archive/2008/01/23/making-a-private-group-target-list-public.aspx",
"source_domain": "community.sagecrm.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "41156",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FMBXOWSOKAFG73CAYQZFUUOU3H7X5LLV",
"WARC-Concurrent-To": "<urn:uuid:f24713b7-b4ae-401e-a46b-569af5f2b08a>",
"WARC-Date": "2021-02-25T18:49:43Z",
"WARC-IP-Address": "104.17.1.48",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7C3LVMNZ7UOHH63ZKMN7N5DXJ2P4JTTW",
"WARC-Record-ID": "<urn:uuid:d210da73-ed33-4900-9925-9a0d03937e17>",
"WARC-Target-URI": "https://community.sagecrm.com/partner_community/b/hints_tips_and_tricks/archive/2008/01/23/making-a-private-group-target-list-public.aspx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2cc0d1cf-56f0-461b-813d-d9241578ce7b>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-39.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
172,
173,
321,
322,
445,
446,
528,
529,
604,
668,
669,
751,
752,
757,
758,
780,
807
],
"line_end_idx": [
172,
173,
321,
322,
445,
446,
528,
529,
604,
668,
669,
751,
752,
757,
758,
780,
807,
834
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 834,
"ccnet_original_nlines": 17,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4736842215061188,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01169591024518013,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12865497171878815,
"rps_doc_frac_unique_words": 0.6081081032752991,
"rps_doc_mean_word_length": 4.405405521392822,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.255340576171875,
"rps_doc_word_count": 148,
"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.03680982068181038,
"rps_doc_frac_chars_top_3gram": 0.021472390741109848,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -55.804443359375,
"rps_doc_books_importance_length_correction": -55.804443359375,
"rps_doc_openwebtext_importance": -27.47978401184082,
"rps_doc_openwebtext_importance_length_correction": -26.75347328186035,
"rps_doc_wikipedia_importance": -16.389461517333984,
"rps_doc_wikipedia_importance_length_correction": -16.389461517333984
},
"fasttext": {
"dclm": 0.9806123971939087,
"english": 0.9523653984069824,
"fineweb_edu_approx": 2.300156831741333,
"eai_general_math": 0.8605237603187561,
"eai_open_web_math": 0.2516822814941406,
"eai_web_code": 0.8791056871414185
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.446",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "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
|
-1,185,183,307,423,880,200 |
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
vec3d.h
Go to the documentation of this file.
1 //
2 // Copyright 2016 Pixar
3 //
4 // Licensed under the Apache License, Version 2.0 (the "Apache License")
5 // with the following modification; you may not use this file except in
6 // compliance with the Apache License and the following modification to it:
7 // Section 6. Trademarks. is deleted and replaced with:
8 //
9 // 6. Trademarks. This License does not grant permission to use the trade
10 // names, trademarks, service marks, or product names of the Licensor
11 // and its affiliates, except as required to comply with Section 4(c) of
12 // the License and to reproduce the content of the NOTICE file.
13 //
14 // You may obtain a copy of the Apache License at
15 //
16 // http://www.apache.org/licenses/LICENSE-2.0
17 //
18 // Unless required by applicable law or agreed to in writing, software
19 // distributed under the Apache License with the above modification is
20 // distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
21 // KIND, either express or implied. See the Apache License for the specific
22 // language governing permissions and limitations under the Apache License.
23 //
25 // This file is generated by a script. Do not edit directly. Edit the
26 // vec.template.h file to make changes.
27
28 #ifndef PXR_BASE_GF_VEC3D_H
29 #define PXR_BASE_GF_VEC3D_H
30
33
34 #include "pxr/pxr.h"
35 #include "pxr/base/tf/diagnostic.h"
36 #include "pxr/base/gf/api.h"
37 #include "pxr/base/gf/limits.h"
38 #include "pxr/base/gf/traits.h"
39 #include "pxr/base/gf/math.h"
40
41 #include <boost/functional/hash.hpp>
42
43 #include <cstddef>
44 #include <cmath>
45
46 #include <iosfwd>
47
48 PXR_NAMESPACE_OPEN_SCOPE
49
50 class GfVec3d;
51
52 template <>
53 struct GfIsGfVec<class GfVec3d> { static const bool value = true; };
54
63 class GfVec3d
64 {
65 public:
67 typedef double ScalarType;
68 static const size_t dimension = 3;
69
71 GfVec3d() = default;
72
74 constexpr explicit GfVec3d(double value)
75 : _data{ value, value, value }
76 {
77 }
78
80 constexpr GfVec3d(double s0, double s1, double s2)
81 : _data{ s0, s1, s2 }
82 {
83 }
84
86 template <class Scl>
87 constexpr explicit GfVec3d(Scl const *p)
88 : _data{ p[0], p[1], p[2] }
89 {
90 }
91
93 GfVec3d(class GfVec3f const &other);
94
96 GfVec3d(class GfVec3h const &other);
97
99 GfVec3d(class GfVec3i const &other);
100
102 static GfVec3d XAxis() {
103 GfVec3d result(0);
104 result[0] = 1;
105 return result;
106 }
108 static GfVec3d YAxis() {
109 GfVec3d result(0);
110 result[1] = 1;
111 return result;
112 }
114 static GfVec3d ZAxis() {
115 GfVec3d result(0);
116 result[2] = 1;
117 return result;
118 }
119
122 static GfVec3d Axis(size_t i) {
123 GfVec3d result(0);
124 if (i < 3)
125 result[i] = 1;
126 return result;
127 }
128
130 GfVec3d &Set(double s0, double s1, double s2) {
131 _data[0] = s0;
132 _data[1] = s1;
133 _data[2] = s2;
134 return *this;
135 }
136
138 GfVec3d &Set(double const *a) {
139 return Set(a[0], a[1], a[2]);
140 }
141
143 double const *data() const { return _data; }
144 double *data() { return _data; }
145 double const *GetArray() const { return data(); }
146
148 double const &operator[](size_t i) const { return _data[i]; }
149 double &operator[](size_t i) { return _data[i]; }
150
152 friend inline size_t hash_value(GfVec3d const &vec) {
153 size_t h = 0;
154 boost::hash_combine(h, vec[0]);
155 boost::hash_combine(h, vec[1]);
156 boost::hash_combine(h, vec[2]);
157 return h;
158 }
159
161 bool operator==(GfVec3d const &other) const {
162 return _data[0] == other[0] &&
163 _data[1] == other[1] &&
164 _data[2] == other[2];
165 }
166 bool operator!=(GfVec3d const &other) const {
167 return !(*this == other);
168 }
169
170 // TODO Add inequality for other vec types...
172 GF_API
173 bool operator==(class GfVec3f const &other) const;
175 GF_API
176 bool operator==(class GfVec3h const &other) const;
178 GF_API
179 bool operator==(class GfVec3i const &other) const;
180
182 GfVec3d operator-() const {
183 return GfVec3d(-_data[0], -_data[1], -_data[2]);
184 }
185
187 GfVec3d &operator+=(GfVec3d const &other) {
188 _data[0] += other[0];
189 _data[1] += other[1];
190 _data[2] += other[2];
191 return *this;
192 }
193 friend GfVec3d operator+(GfVec3d const &l, GfVec3d const &r) {
194 return GfVec3d(l) += r;
195 }
196
198 GfVec3d &operator-=(GfVec3d const &other) {
199 _data[0] -= other[0];
200 _data[1] -= other[1];
201 _data[2] -= other[2];
202 return *this;
203 }
204 friend GfVec3d operator-(GfVec3d const &l, GfVec3d const &r) {
205 return GfVec3d(l) -= r;
206 }
207
209 GfVec3d &operator*=(double s) {
210 _data[0] *= s;
211 _data[1] *= s;
212 _data[2] *= s;
213 return *this;
214 }
215 GfVec3d operator*(double s) const {
216 return GfVec3d(*this) *= s;
217 }
218 friend GfVec3d operator*(double s, GfVec3d const &v) {
219 return v * s;
220 }
221
223 // TODO should divide by the scalar type.
224 GfVec3d &operator/=(double s) {
225 // TODO This should not multiply by 1/s, it should do the division.
226 // Doing the division is more numerically stable when s is close to
227 // zero.
228 return *this *= (1.0 / s);
229 }
230 GfVec3d operator/(double s) const {
231 return *this * (1.0 / s);
232 }
233
235 double operator*(GfVec3d const &v) const {
236 return _data[0] * v[0] + _data[1] * v[1] + _data[2] * v[2];
237 }
238
243 GfVec3d GetProjection(GfVec3d const &v) const {
244 return v * (*this * v);
245 }
246
252 GfVec3d GetComplement(GfVec3d const &b) const {
253 return *this - this->GetProjection(b);
254 }
255
257 double GetLengthSq() const {
258 return *this * *this;
259 }
260
262 double GetLength() const {
263 // TODO should use GfSqrt.
264 return sqrt(GetLengthSq());
265 }
266
275 double Normalize(double eps = GF_MIN_VECTOR_LENGTH) {
276 // TODO this seems suspect... suggest dividing by length so long as
277 // length is not zero.
278 double length = GetLength();
279 *this /= (length > eps) ? length : eps;
280 return length;
281 }
282
283 GfVec3d GetNormalized(double eps = GF_MIN_VECTOR_LENGTH) const {
284 GfVec3d normalized(*this);
285 normalized.Normalize(eps);
286 return normalized;
287 }
288
298 GF_API
299 static bool OrthogonalizeBasis(
300 GfVec3d *tx, GfVec3d *ty, GfVec3d *tz,
301 const bool normalize,
302 double eps = GF_MIN_ORTHO_TOLERANCE);
303
308 GF_API
309 void BuildOrthonormalFrame(GfVec3d *v1, GfVec3d *v2,
310 double eps = GF_MIN_VECTOR_LENGTH) const;
311
312
313 private:
314 double _data[3];
315 };
316
319 GF_API std::ostream& operator<<(std::ostream &, GfVec3d const &);
320
321
322 PXR_NAMESPACE_CLOSE_SCOPE
323
324 #include "pxr/base/gf/vec3f.h"
325 #include "pxr/base/gf/vec3h.h"
326 #include "pxr/base/gf/vec3i.h"
327
328 PXR_NAMESPACE_OPEN_SCOPE
329
330 inline
331 GfVec3d::GfVec3d(class GfVec3f const &other)
332 {
333 _data[0] = other[0];
334 _data[1] = other[1];
335 _data[2] = other[2];
336 }
337 inline
338 GfVec3d::GfVec3d(class GfVec3h const &other)
339 {
340 _data[0] = other[0];
341 _data[1] = other[1];
342 _data[2] = other[2];
343 }
344 inline
345 GfVec3d::GfVec3d(class GfVec3i const &other)
346 {
347 _data[0] = other[0];
348 _data[1] = other[1];
349 _data[2] = other[2];
350 }
351
353 inline GfVec3d
354 GfCompMult(GfVec3d const &v1, GfVec3d const &v2) {
355 return GfVec3d(
356 v1[0] * v2[0],
357 v1[1] * v2[1],
358 v1[2] * v2[2]
359 );
360 }
361
363 inline GfVec3d
364 GfCompDiv(GfVec3d const &v1, GfVec3d const &v2) {
365 return GfVec3d(
366 v1[0] / v2[0],
367 v1[1] / v2[1],
368 v1[2] / v2[2]
369 );
370 }
371
373 inline double
374 GfDot(GfVec3d const &v1, GfVec3d const &v2) {
375 return v1 * v2;
376 }
377
378
380 inline double
382 {
383 return v.GetLength();
384 }
385
389 inline double
391 {
392 return v->Normalize(eps);
393 }
394
398 inline GfVec3d
400 {
401 return v.GetNormalized(eps);
402 }
403
408 inline GfVec3d
409 GfGetProjection(GfVec3d const &a, GfVec3d const &b)
410 {
411 return a.GetProjection(b);
412 }
413
418 inline GfVec3d
419 GfGetComplement(GfVec3d const &a, GfVec3d const &b)
420 {
421 return a.GetComplement(b);
422 }
423
426 inline bool
427 GfIsClose(GfVec3d const &v1, GfVec3d const &v2, double tolerance)
428 {
429 GfVec3d delta = v1 - v2;
430 return delta.GetLengthSq() <= tolerance * tolerance;
431 }
432
433
434 GF_API bool
435 GfOrthogonalizeBasis(GfVec3d *tx, GfVec3d *ty, GfVec3d *tz,
436 bool normalize, double eps = GF_MIN_ORTHO_TOLERANCE);
437
438 GF_API void
439 GfBuildOrthonormalFrame(GfVec3d const &v0,
440 GfVec3d* v1,
441 GfVec3d* v2,
442 double eps = GF_MIN_VECTOR_LENGTH);
443
445 inline GfVec3d
446 GfCross(GfVec3d const &v1, GfVec3d const &v2)
447 {
448 return GfVec3d(
449 v1[1] * v2[2] - v1[2] * v2[1],
450 v1[2] * v2[0] - v1[0] * v2[2],
451 v1[0] * v2[1] - v1[1] * v2[0]);
452 }
453
456 inline GfVec3d
457 operator^(GfVec3d const &v1, GfVec3d const &v2)
458 {
459 return GfCross(v1, v2);
460 }
461
463 GF_API GfVec3d
464 GfSlerp(double alpha, GfVec3d const &v0, GfVec3d const &v1);
465
466
467
468 PXR_NAMESPACE_CLOSE_SCOPE
469
470 #endif // PXR_BASE_GF_VEC3D_H
GF_API void BuildOrthonormalFrame(GfVec3d *v1, GfVec3d *v2, double eps=GF_MIN_VECTOR_LENGTH) const
Sets v1 and v2 to unit vectors such that v1, v2 and *this are mutually orthogonal.
constexpr GfVec3d(Scl const *p)
Construct with pointer to values.
Definition: vec3d.h:87
GfVec2d GfGetProjection(GfVec2d const &a, GfVec2d const &b)
Returns the projection of a onto b.
Definition: vec2d.h:369
GfVec3d GetComplement(GfVec3d const &b) const
Returns the orthogonal complement of this->GetProjection(b).
Definition: vec3d.h:252
double Normalize(double eps=GF_MIN_VECTOR_LENGTH)
Normalizes the vector in place to unit length, returning the length before normalization.
Definition: vec3d.h:275
static GfVec3d YAxis()
Create a unit vector along the Y-axis.
Definition: vec3d.h:108
bool GfIsClose(double a, double b, double epsilon)
Returns true if a and b are with epsilon of each other.
Definition: math.h:39
bool operator==(GfVec3d const &other) const
Equality comparison.
Definition: vec3d.h:161
GfVec3d operator^(GfVec3d const &v1, GfVec3d const &v2)
Returns the cross product of v1 and v2.
Definition: vec3d.h:457
GfVec3d & operator-=(GfVec3d const &other)
Subtraction.
Definition: vec3d.h:198
double ScalarType
Scalar element type and dimension.
Definition: vec3d.h:67
double GetLength() const
Length.
Definition: vec3d.h:262
Basic type for a vector of 3 float components.
Definition: vec3f.h:63
A metafunction with a static const bool member 'value' that is true for GfVec types, like GfVec2i, GfVec4d, etc and false for all other types.
Definition: traits.h:34
GfVec3d GfCross(GfVec3d const &v1, GfVec3d const &v2)
Returns the cross product of v1 and v2.
Definition: vec3d.h:446
GfVec3d & operator*=(double s)
Multiplication by scalar.
Definition: vec3d.h:209
GfVec3d GetProjection(GfVec3d const &v) const
Returns the projection of this onto v.
Definition: vec3d.h:243
GF_API GfQuatd GfSlerp(double alpha, const GfQuatd &q0, const GfQuatd &q1)
Spherically linearly interpolate between q0 and q1.
#define GF_MIN_ORTHO_TOLERANCE
This constant is used to determine when a set of basis vectors is close to orthogonal.
Definition: limits.h:39
GfVec3d & Set(double s0, double s1, double s2)
Set all elements with passed arguments.
Definition: vec3d.h:130
double operator*(GfVec3d const &v) const
See GfDot().
Definition: vec3d.h:235
GfVec2d GfGetNormalized(GfVec2d const &v, double eps=GF_MIN_VECTOR_LENGTH)
Returns a normalized (unit-length) vector with the same direction as v.
Definition: vec2d.h:359
static GfVec3d ZAxis()
Create a unit vector along the Z-axis.
Definition: vec3d.h:114
constexpr GfVec3d(double s0, double s1, double s2)
Initialize all elements with explicit arguments.
Definition: vec3d.h:80
double const & operator[](size_t i) const
Indexing.
Definition: vec3d.h:148
GfVec2d GfCompMult(GfVec2d const &v1, GfVec2d const &v2)
Returns component-wise multiplication of vectors v1 and v2.
Definition: vec2d.h:316
static GF_API bool OrthogonalizeBasis(GfVec3d *tx, GfVec3d *ty, GfVec3d *tz, const bool normalize, double eps=GF_MIN_ORTHO_TOLERANCE)
Orthogonalize and optionally normalize a set of basis vectors.
Basic type for a vector of 3 int components.
Definition: vec3i.h:61
double GfNormalize(GfVec2d *v, double eps=GF_MIN_VECTOR_LENGTH)
Normalizes *v in place to unit length, returning the length before normalization. ...
Definition: vec2d.h:350
GfVec3d & Set(double const *a)
Set all elements with a pointer to data.
Definition: vec3d.h:138
GF_API std::ostream & operator<<(std::ostream &, const GfBBox3d &)
Output a GfBBox3d using the format [(range) matrix zeroArea].
GfVec3d & operator/=(double s)
Division by scalar.
Definition: vec3d.h:224
GfVec3d operator-() const
Create a vec with negated elements.
Definition: vec3d.h:182
GfVec3d & operator+=(GfVec3d const &other)
Addition.
Definition: vec3d.h:187
double GetLengthSq() const
Squared length.
Definition: vec3d.h:257
Basic type for a vector of 3 double components.
Definition: vec3d.h:63
GfVec3d()=default
Default constructor does no initialization.
GfVec2d GfCompDiv(GfVec2d const &v1, GfVec2d const &v2)
Returns component-wise quotient of vectors v1 and v2.
Definition: vec2d.h:325
double GfGetLength(GfVec2d const &v)
Returns the geometric length of v.
Definition: vec2d.h:341
double const * data() const
Direct data access.
Definition: vec3d.h:143
friend size_t hash_value(GfVec3d const &vec)
Hash.
Definition: vec3d.h:152
GfVec2d GfGetComplement(GfVec2d const &a, GfVec2d const &b)
Returns the orthogonal complement of a.GetProjection(b).
Definition: vec2d.h:379
Basic type for a vector of 3 GfHalf components.
Definition: vec3h.h:64
constexpr GfVec3d(double value)
Initialize all elements to a single value.
Definition: vec3d.h:74
static GfVec3d Axis(size_t i)
Create a unit vector along the i-th axis, zero-based.
Definition: vec3d.h:122
static GfVec3d XAxis()
Create a unit vector along the X-axis.
Definition: vec3d.h:102
#define GF_MIN_VECTOR_LENGTH
This constant is used to determine whether the length of a vector is too small to handle accurately...
Definition: limits.h:34
GfHalf GfDot(GfHalf a, GfHalf b)
Returns the dot (inner) product of two vectors.
Definition: half.h:55
|
{
"url": "https://graphics.pixar.com/usd/docs/api/vec3d_8h_source.html",
"source_domain": "graphics.pixar.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "90389",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ASEWKTA4OFIETV52OJFZLI4P3TWA7NIZ",
"WARC-Concurrent-To": "<urn:uuid:2c16cb79-8bd1-44ac-bf49-62c0edeeb5f5>",
"WARC-Date": "2020-01-29T20:32:22Z",
"WARC-IP-Address": "139.104.180.102",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:KUKVDEYDW32J74DTG5TOWADSF6JRLA3G",
"WARC-Record-ID": "<urn:uuid:b7c7092e-c856-4ccd-9074-738ba5bf29cb>",
"WARC-Target-URI": "https://graphics.pixar.com/usd/docs/api/vec3d_8h_source.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:346cc94f-6022-4b22-ad3f-6e938e9178a3>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-103.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
111,
119,
157,
162,
188,
193,
268,
342,
420,
478,
483,
559,
632,
708,
775,
781,
834,
840,
889,
895,
969,
1043,
1122,
1201,
1280,
1286,
1359,
1402,
1406,
1437,
1468,
1472,
1476,
1500,
1539,
1571,
1606,
1641,
1674,
1678,
1718,
1722,
1744,
1764,
1768,
1789,
1793,
1821,
1825,
1843,
1847,
1862,
1934,
1938,
1955,
1960,
1971,
2002,
2041,
2045,
2070,
2074,
2119,
2154,
2160,
2166,
2170,
2225,
2251,
2257,
2263,
2267,
2292,
2337,
2369,
2375,
2381,
2385,
2426,
2430,
2471,
2475,
2516,
2521,
2551,
2575,
2595,
2615,
2622,
2652,
2676,
2696,
2716,
2723,
2753,
2777,
2797,
2817,
2824,
2829,
2866,
2890,
2906,
2926,
2946,
2953,
2958,
3011,
3031,
3051,
3071,
3090,
3097,
3102,
3139,
3174,
3181,
3186,
3236,
3274,
3329,
3334,
3401,
3456,
3461,
3520,
3539,
3576,
3613,
3650,
3665,
3672,
3677,
3728,
3764,
3793,
3820,
3827,
3878,
3909,
3916,
3921,
3972,
3984,
4040,
4052,
4108,
4120,
4176,
4181,
4214,
4268,
4275,
4280,
4329,
4356,
4383,
4410,
4429,
4436,
4504,
4533,
4540,
4545,
4594,
4621,
4648,
4675,
4694,
4701,
4769,
4798,
4805,
4810,
4847,
4867,
4887,
4907,
4926,
4933,
4974,
5007,
5014,
5074,
5093,
5100,
5105,
5152,
5189,
5262,
5335,
5349,
5381,
5388,
5429,
5460,
5467,
5472,
5520,
5585,
5592,
5597,
5650,
5679,
5686,
5691,
5744,
5788,
5795,
5800,
5834,
5861,
5868,
5873,
5905,
5937,
5970,
5977,
5982,
6041,
6114,
6142,
6176,
6221,
6241,
6248,
6253,
6323,
6355,
6387,
6411,
6418,
6423,
6435,
6472,
6516,
6543,
6586,
6591,
6603,
6661,
6708,
6713,
6718,
6731,
6753,
6760,
6765,
6835,
6840,
6845,
6875,
6880,
6915,
6950,
6985,
6990,
7019,
7024,
7035,
7084,
7090,
7116,
7142,
7168,
7174,
7185,
7234,
7240,
7266,
7292,
7318,
7324,
7335,
7384,
7390,
7416,
7442,
7468,
7474,
7479,
7498,
7553,
7574,
7594,
7614,
7633,
7641,
7647,
7652,
7671,
7725,
7746,
7766,
7786,
7805,
7813,
7819,
7824,
7842,
7892,
7913,
7919,
7924,
7929,
7947,
7953,
7980,
7986,
7991,
8009,
8015,
8046,
8052,
8057,
8076,
8082,
8116,
8122,
8127,
8146,
8202,
8208,
8240,
8246,
8251,
8270,
8326,
8332,
8364,
8370,
8375,
8391,
8461,
8467,
8497,
8555,
8561,
8566,
8571,
8587,
8651,
8710,
8715,
8731,
8778,
8796,
8814,
8855,
8860,
8879,
8929,
8935,
8956,
8992,
9028,
9065,
9071,
9076,
9095,
9147,
9153,
9182,
9188,
9193,
9212,
9277,
9282,
9287,
9292,
9322,
9327,
9361,
9460,
9543,
9575,
9609,
9632,
9692,
9728,
9752,
9798,
9862,
9886,
9936,
10026,
10050,
10073,
10112,
10136,
10187,
10243,
10265,
10309,
10330,
10354,
10410,
10450,
10474,
10517,
10530,
10554,
10572,
10607,
10630,
10655,
10663,
10687,
10734,
10757,
10908,
10932,
10986,
11026,
11050,
11081,
11107,
11131,
11177,
11216,
11240,
11315,
11367,
11398,
11485,
11509,
11556,
11596,
11620,
11661,
11674,
11698,
11773,
11845,
11869,
11892,
11931,
11955,
12006,
12055,
12078,
12120,
12130,
12154,
12211,
12271,
12295,
12429,
12492,
12537,
12560,
12624,
12710,
12734,
12765,
12806,
12830,
12897,
12959,
12990,
13010,
13034,
13060,
13096,
13120,
13163,
13173,
13197,
13224,
13240,
13264,
13312,
13335,
13353,
13397,
13453,
13507,
13531,
13568,
13603,
13627,
13655,
13675,
13699,
13744,
13750,
13774,
13834,
13891,
13915,
13963,
13986,
14018,
14061,
14084,
14114,
14168,
14192,
14215,
14254,
14278,
14307,
14410,
14434,
14467,
14515
],
"line_end_idx": [
111,
119,
157,
162,
188,
193,
268,
342,
420,
478,
483,
559,
632,
708,
775,
781,
834,
840,
889,
895,
969,
1043,
1122,
1201,
1280,
1286,
1359,
1402,
1406,
1437,
1468,
1472,
1476,
1500,
1539,
1571,
1606,
1641,
1674,
1678,
1718,
1722,
1744,
1764,
1768,
1789,
1793,
1821,
1825,
1843,
1847,
1862,
1934,
1938,
1955,
1960,
1971,
2002,
2041,
2045,
2070,
2074,
2119,
2154,
2160,
2166,
2170,
2225,
2251,
2257,
2263,
2267,
2292,
2337,
2369,
2375,
2381,
2385,
2426,
2430,
2471,
2475,
2516,
2521,
2551,
2575,
2595,
2615,
2622,
2652,
2676,
2696,
2716,
2723,
2753,
2777,
2797,
2817,
2824,
2829,
2866,
2890,
2906,
2926,
2946,
2953,
2958,
3011,
3031,
3051,
3071,
3090,
3097,
3102,
3139,
3174,
3181,
3186,
3236,
3274,
3329,
3334,
3401,
3456,
3461,
3520,
3539,
3576,
3613,
3650,
3665,
3672,
3677,
3728,
3764,
3793,
3820,
3827,
3878,
3909,
3916,
3921,
3972,
3984,
4040,
4052,
4108,
4120,
4176,
4181,
4214,
4268,
4275,
4280,
4329,
4356,
4383,
4410,
4429,
4436,
4504,
4533,
4540,
4545,
4594,
4621,
4648,
4675,
4694,
4701,
4769,
4798,
4805,
4810,
4847,
4867,
4887,
4907,
4926,
4933,
4974,
5007,
5014,
5074,
5093,
5100,
5105,
5152,
5189,
5262,
5335,
5349,
5381,
5388,
5429,
5460,
5467,
5472,
5520,
5585,
5592,
5597,
5650,
5679,
5686,
5691,
5744,
5788,
5795,
5800,
5834,
5861,
5868,
5873,
5905,
5937,
5970,
5977,
5982,
6041,
6114,
6142,
6176,
6221,
6241,
6248,
6253,
6323,
6355,
6387,
6411,
6418,
6423,
6435,
6472,
6516,
6543,
6586,
6591,
6603,
6661,
6708,
6713,
6718,
6731,
6753,
6760,
6765,
6835,
6840,
6845,
6875,
6880,
6915,
6950,
6985,
6990,
7019,
7024,
7035,
7084,
7090,
7116,
7142,
7168,
7174,
7185,
7234,
7240,
7266,
7292,
7318,
7324,
7335,
7384,
7390,
7416,
7442,
7468,
7474,
7479,
7498,
7553,
7574,
7594,
7614,
7633,
7641,
7647,
7652,
7671,
7725,
7746,
7766,
7786,
7805,
7813,
7819,
7824,
7842,
7892,
7913,
7919,
7924,
7929,
7947,
7953,
7980,
7986,
7991,
8009,
8015,
8046,
8052,
8057,
8076,
8082,
8116,
8122,
8127,
8146,
8202,
8208,
8240,
8246,
8251,
8270,
8326,
8332,
8364,
8370,
8375,
8391,
8461,
8467,
8497,
8555,
8561,
8566,
8571,
8587,
8651,
8710,
8715,
8731,
8778,
8796,
8814,
8855,
8860,
8879,
8929,
8935,
8956,
8992,
9028,
9065,
9071,
9076,
9095,
9147,
9153,
9182,
9188,
9193,
9212,
9277,
9282,
9287,
9292,
9322,
9327,
9361,
9460,
9543,
9575,
9609,
9632,
9692,
9728,
9752,
9798,
9862,
9886,
9936,
10026,
10050,
10073,
10112,
10136,
10187,
10243,
10265,
10309,
10330,
10354,
10410,
10450,
10474,
10517,
10530,
10554,
10572,
10607,
10630,
10655,
10663,
10687,
10734,
10757,
10908,
10932,
10986,
11026,
11050,
11081,
11107,
11131,
11177,
11216,
11240,
11315,
11367,
11398,
11485,
11509,
11556,
11596,
11620,
11661,
11674,
11698,
11773,
11845,
11869,
11892,
11931,
11955,
12006,
12055,
12078,
12120,
12130,
12154,
12211,
12271,
12295,
12429,
12492,
12537,
12560,
12624,
12710,
12734,
12765,
12806,
12830,
12897,
12959,
12990,
13010,
13034,
13060,
13096,
13120,
13163,
13173,
13197,
13224,
13240,
13264,
13312,
13335,
13353,
13397,
13453,
13507,
13531,
13568,
13603,
13627,
13655,
13675,
13699,
13744,
13750,
13774,
13834,
13891,
13915,
13963,
13986,
14018,
14061,
14084,
14114,
14168,
14192,
14215,
14254,
14278,
14307,
14410,
14434,
14467,
14515,
14536
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14536,
"ccnet_original_nlines": 506,
"rps_doc_curly_bracket": 0.007292239926755428,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1300397515296936,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01533219963312149,
"rps_doc_frac_lines_end_with_ellipsis": 0.005917159840464592,
"rps_doc_frac_no_alph_words": 0.5028393268585205,
"rps_doc_frac_unique_words": 0.42655515670776367,
"rps_doc_mean_word_length": 5.4918975830078125,
"rps_doc_num_sentences": 139,
"rps_doc_symbol_to_word_ratio": 0.006814309861510992,
"rps_doc_unigram_entropy": 5.82794713973999,
"rps_doc_word_count": 1913,
"rps_doc_frac_chars_dupe_10grams": 0.02436703070998192,
"rps_doc_frac_chars_dupe_5grams": 0.16866551339626312,
"rps_doc_frac_chars_dupe_6grams": 0.09861031919717789,
"rps_doc_frac_chars_dupe_7grams": 0.06910336762666702,
"rps_doc_frac_chars_dupe_8grams": 0.033314298838377,
"rps_doc_frac_chars_dupe_9grams": 0.02436703070998192,
"rps_doc_frac_chars_top_2gram": 0.015229390002787113,
"rps_doc_frac_chars_top_3gram": 0.010660570114850998,
"rps_doc_frac_chars_top_4gram": 0.014467920176684856,
"rps_doc_books_importance": -1758.6383056640625,
"rps_doc_books_importance_length_correction": -1758.6383056640625,
"rps_doc_openwebtext_importance": -904.1500854492188,
"rps_doc_openwebtext_importance_length_correction": -904.1500854492188,
"rps_doc_wikipedia_importance": -875.0791625976562,
"rps_doc_wikipedia_importance_length_correction": -875.0791625976562
},
"fasttext": {
"dclm": 0.8686579465866089,
"english": 0.32901477813720703,
"fineweb_edu_approx": 1.8041912317276,
"eai_general_math": 0.8018874526023865,
"eai_open_web_math": 0.07572782039642334,
"eai_web_code": 0.42060285806655884
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "516",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,826,495,377,728,818,700 |
Questions tagged [windows-search]
Windows Search is the functionality built into the Windows OS for finding files, folders and programs on a PC or in connected storage.
Filter by
Sorted by
Tagged with
0 votes
0 answers
11 views
How can the cartoon added to taskbar search in recent Windows 10 update be removed? [duplicate]
In the last few days an update to Windows 10 has altered the search box in the taskbar to add a daily cartoon to the search box, like this: I find this intrusion of a irrelevant, space wasting, ...
user avatar
0 votes
0 answers
25 views
If a windows folder has a dot/period in the name, file explorer search does not return results from that folder
Common in development environment, some of my folders contain dots in the name. like c:\src\project1.ui.help. I have set up the c:\src folder as indexed (with sub folders). When I try to search in c:...
user avatar
• 101
0 votes
0 answers
21 views
Windows 10 - Way to change default search mode in Windows Explorer to 'Current folder'
Has anyone found a way / hack to set the default search mode in Windows Explorer to 'Current folder'? I probably need to search for a folder, by partial name, in the current directory (no recursion) ...
user avatar
• 101
0 votes
1 answer
24 views
Windows Search issues
I have this weird issue with one of our Windows 10 PC... Search is no longer working. Here is what I have done: Stopped and restated Windows Search service. Rebuilt Indexing Options. Obviously ...
user avatar
• 88
1 vote
0 answers
15 views
search for a substring in file name with built in windows search on Windows 11 [duplicate]
am using windows 11 and I find that the built in search facility is not working as expected. I have a folder like this and when I search it like this, I get no result. I would like the search tool ...
user avatar
• 31
2 votes
1 answer
120 views
How to turn off search highlights in Windows 10?
After a recent Windows update, my search bar looks ugly: The "Yellowstone National Park" text and that image is annoying. How do I disable them? This is how it previously looked:
user avatar
1 vote
1 answer
46 views
Windows Search bar fills background with black color
Today I launched my laptop, and when I hit the 3-finger gesture to open the search box, it blacked out the whole screen and then popped in the left part of my screen, taking more space than usual. It ...
user avatar
0 votes
0 answers
22 views
Display folders first in File Explorer search
Whenever I search for something (in this case "*") in File Explorer, folders appear mixed in with files: Is there a way to make it display all folders at the top like it does outside of ...
user avatar
0 votes
0 answers
15 views
How to make Windows start menu search for Apps automatically
I don't like having apps on my desktop or pinned to my taskbar, so I open all my apps by pressing the Windows menu key, typing in the app name, then hitting enter once the specific app is selected as ...
user avatar
• 103
1 vote
0 answers
52 views
How to disable Windows 10 Pro Edition searching the web when typing in the start menu [duplicate]
I want to disable that windows 10 pro gives me web search results when typing something into the start menu bar: but i could not figure out how to do that. The only working method i knew and could ...
user avatar
• 123
0 votes
0 answers
60 views
Icons in windows Start Menu / Search are gone and replaced with another app
When I open Start Menu, I can scroll through the apps and the icons are fine. However, when I start typing (searching), many of the icons get replaced with IrfanView. Uninstalling IrfanView did not ...
user avatar
• 391
0 votes
1 answer
130 views
Find files by contents (Windows 11)
I'm trying to search through 15 years of bank statements (PDF) for a specific payment amount, $42.69. I used Windows explorer file search (bar in upper right corner of file explorer) in the folder ...
user avatar
• 11
0 votes
0 answers
21 views
"Exclude Directories from extended Search" fills automatically
My Problem is, the "Exclude Directories from extended Search" fills automatically and i dont know why. I prefer, that every Directory is indexed. How can i prevent Windows from doing that? ...
user avatar
• 101
0 votes
0 answers
13 views
Start menu closes after opening anything from search results
In Windows 10 I could search for something (e.g. photos) by typing partial filename in Start menu and in the list of results displayed there, I could click "Open file location" on the item ...
user avatar
• 245
0 votes
1 answer
45 views
Windows 10 Search to list every instance of search text
I've gotten the Windows search tool to work to find when various files contain a certain text (in this case, a server name). The list of results shows me each file. However, I know there are multiple ...
user avatar
0 votes
0 answers
14 views
How to create task bar search icon shortcut like for task view
I have centered my windows 10 start button like in windows 11 using a youtube video. So I would not be able to keep search and task view icons in the taskbar. I found the location of task view and ...
user avatar
0 votes
2 answers
92 views
Get Thunderbird email contents to show up in Windows 10/11 search
Has anyone successfully gotten the content of Thunderbird emails to show up in Windows 10/11 search? I have Enable Global Search and Indexer checked in Thunderbird settings and I have the Manage Store ...
user avatar
• 165
0 votes
0 answers
22 views
Resize Windows search windows Independent of start menu
My Problem is that i use the full screen option for the start menu in Windows. This works perfectly. I noticed when using this option that my search windows expands up to the top of my screen. image ...
user avatar
0 votes
1 answer
46 views
Win10 - Files associations in search results are broken
The last change I made to my PC was to install Node.js, although, this probably was not the cause, it is probably worth to mention. I haven't found any other person that reports this exact issue so I'...
user avatar
0 votes
2 answers
40 views
Most of the apps are not working after I did something on registry
I searched for how to change the name of the user in the directory and it told me to go to the registry and Computer\HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows NT\CurrentVersion\ProfileList. I went ...
user avatar
1 vote
0 answers
27 views
Search menu zoomed in
I have recently adjusted my setup (can't have enough monitors, right?). I changed my primary display to one of my external monitors, but now I have one small, but very challenging issue. My search ...
user avatar
• 111
0 votes
0 answers
16 views
Can you use Windows search to filter by number of hardlinks of a file?
I just read this question and I wondered if you could do Type:~~Hardlink. I know it can be done in Powershell, but can I do it in the Windows search box, or if there is an equivalent search command? I'...
user avatar
1 vote
0 answers
103 views
Ghost icons in taskbar and icons not showing in windows search
All of a sudden my icons for apps in my taskbar has disappeared but the apps are still there and when I go to search for some of the apps which have a ghost icon in taskbar it shows what appears to be ...
user avatar
0 votes
0 answers
51 views
How to search for underscore character in Windows Search?
I have Windows 10. I want to use Explorer Search to find file containing Arr__ It is important to have the 2 underscore. however, it returns Arr_SOMETHING So even those with one underscore are ...
user avatar
• 13
1 vote
1 answer
114 views
Windows 11 search UI looks like Windows 10 search UI - How to fix?
My Windows 11 search UI looks like Windows 10 search UI. (I tried to reset explorer.exe but it did not work) How do I fix it?
user avatar
0 votes
0 answers
69 views
How can I gracefully stop the Windows Search service via console?
I use the following PowerShell cmdlets to stop the Windows Search service: Set-Service -Name WSearch -StartupType Disabled Stop-Service -Name WSearch But if I do that while the Windows Search service ...
user avatar
0 votes
1 answer
21 views
Windows Search Function does not find existing folders (and files)
I am trying to find some folders using the search function in Windows 10. But it seemingly does not find folders even though they are definitely there. Suggestions are very much appreciated.
user avatar
• 103
0 votes
2 answers
55 views
Sort Windows Desktop search results by word frequency
On my Windows 10 system, if I search for a common word in a folder with many documents, I get a long list of results. I would like to be able to sort the results based on the number of hits in each ...
user avatar
2 votes
2 answers
5k views
How do I get Windows 10 to index mapped network drives?
I have three network drives (S:, U: and Z:) mapped to a Synology NAS. They are all online and read/write accessible. Without installing additional software or making the files available offline, how ...
user avatar
• 5,394
0 votes
1 answer
83 views
Windows 10: Limit Start Menu search Folders while indexing other folders
I have a weird situation I am in. I have this one folder which has a large number of subfolders and files inside of it that I need to be able to search through reasonably quickly. Because of this, I ...
user avatar
• 101
0 votes
0 answers
26 views
Windows 10 search issue
It seems kinda like bug, let me explain. I occasionally use search feature and don't like search bar, so I got used to Win+S hotkey combination. Normally, it would open Search box like small window on ...
user avatar
0 votes
0 answers
46 views
Windows File Explorer Search Results Extract
So I have a several thousand PDFs spread across many folders in a network drive. And I need a single piece of text data from them. Windows Search actually lets me find them all, and actually shows me ...
user avatar
0 votes
1 answer
60 views
A way to have Evernote notes indexed by the Windows Search Indexer?
As per title, I was wondering if there is a way to have the Windows Search Indexer index the Evernote database (and thus all the notes, their titles and content) so that hitting the Win key on the ...
user avatar
1 vote
1 answer
73 views
Start Menu and Search malfunctioning?
I noticed this randomly start happening on my laptop yesterday, where for some reason, when I open the start menu or search, it starts acting like the up arrow key is being help down: I have no ...
user avatar
• 1,876
0 votes
1 answer
151 views
How can I search Windows 10, excluding folders yet including zips?
I use a search string to generate statistics of documents processed, I used to use the -kind:folder but then realized it was blocking .zip files. Here are my requirements: YES include .zip files in ...
user avatar
0 votes
1 answer
254 views
Is there a way to list all excel files containing Macros in a Folder and Subfolders?
I would like to list all Excel Files containing Macros in a Folder and Subfolders. Is it possible to do it with Windows Search or Agent Ransack or Filesearch Pro?
user avatar
0 votes
0 answers
81 views
Windows 10 white search bar with black text
I have a new legion 5 pro running windows 10 home, and I am getting this issue where the search bar stays white, and the text inside is black after doing a search and then selecting a program. It ...
user avatar
• 282
-3 votes
1 answer
51 views
Windows 10 can't click on / unclickable apps links after searching in start menu
PROBLEM: clicking the link does nothing Does anyone know why? Here's a similar thread with similar issue but none of the proposed solutions worked... Windows 10: Can't click on apps after ...
user avatar
• 1
3 votes
2 answers
353 views
What is the keyword "type" in Windows Search advanced query syntax?
Windows 10 file explorer's search tools let you insert type: into the search box. I cannot figure out what this is, what the possible values are, and/or which files qualify for them. The Advanced ...
user avatar
-1 votes
1 answer
133 views
Powershell Error Re: M$ Advice Thread (Windows 10 Start Menu Suddenly very slow. Also Firefox (not other browsers) Fresh 'Reset' of Windows
I had to 'Reset' my Windows and I opted to 'keep my files'. I did Disk Cleanup to remove the old.windows files. Before I had the problem, Windows was extremely snappy and quick even after a year or ...
user avatar
0 votes
0 answers
13 views
Prevent Widows10 taskbar search to search in online resources [duplicate]
I don't want to see something like this: Let's say I would like to restrict the search only on applications. Or applications and local files, local documents. I conside it very dangerous. I have ...
user avatar
• 275
0 votes
1 answer
264 views
Windows 10 - some app icons in search results (win + s) are overlayed with a photoshop icon
I would be most grateful for any pointers which lead to resolving the following issue. The Problem When I use windows search (win + s) the icons for windows 10 related apps are shown with a photoshop ...
user avatar
3 votes
1 answer
460 views
Windows search not finding files on one drive - Drive missing from indexer search roots
Note: I have posted the same question a while ago on answers.microsoft.com, where I got no reply so far While trying to investigate issues with files not being found by the search indexer, I have ...
user avatar
0 votes
1 answer
66 views
Networked folder 'type to jump to folder' working sequentially on letters typed rather than searching for all letters typed
I'm using Windows 10 pro 20H2. If I search a folder on our file server, I usually type a few letters to bring up the folder I want, for example "LOR" to bring up "LOREM". However I ...
user avatar
• 2,397
1 vote
3 answers
44 views
Search for files by file name (not location)
I am trying to find any files or folders that match some name. This and only this. The problem is that in my search results I am also getting any file or folder that has the search text as part of its ...
user avatar
• 144
0 votes
0 answers
48 views
How to invoke the Windows Search window from command-line?
The Windows 10 Taskbar has a Search command: Clicking on this icon invokes the Windows Search window: How can I invoke this Windows Search window from a command-line?
user avatar
• 1,170
2 votes
2 answers
147 views
How to search for a file with a period in the name with Windows file search?
How can I search for all files that contain a period somewhere in the file name but not count the period that comes before the file extension? Examples I would want returned: sky.blue.jpg thesis.draft....
user avatar
1 vote
2 answers
440 views
Windows 10 search box loses focus after a second or two
The search box in the Windows task bar loses focus after a couple seconds. This sucks because it's the main way I use for launching programs. Is there a way to fix this? Edition Windows 10 Pro ...
user avatar
• 1,055
1 vote
0 answers
125 views
How do I make Windows 10 File Explorer search git repositories?
Windows released a new update that means that git repos are no longer searched on File Explorer. How do I disable it?
user avatar
• 629
0 votes
1 answer
42 views
Windows Search don't find any settings, and default softwares
After I moved most of folders from ProgramData to my D drive, and did a mklink, when I'm searching for something like "paint", "virtual keyboard", and any settings suggestion for ...
user avatar
1
2 3 4 5
12
|
{
"url": "https://superuser.com/questions/tagged/windows-search",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "371563",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SVL2CPKRC4ZNZRMY34QRFZURRTWKRD2P",
"WARC-Concurrent-To": "<urn:uuid:021db069-385f-4776-b552-8c23c474917b>",
"WARC-Date": "2022-05-16T19:02:17Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:B2D3H5V3SZYCD6K2GZG7OXJ3IEWX7S3P",
"WARC-Record-ID": "<urn:uuid:7dfb7997-9128-489e-a8a4-a06c98fce8f7>",
"WARC-Target-URI": "https://superuser.com/questions/tagged/windows-search",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ebbf9945-889e-4fd5-8c02-59baf5932701>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-190\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
34,
35,
170,
171,
181,
191,
203,
211,
221,
230,
231,
327,
328,
526,
538,
546,
556,
565,
566,
678,
679,
882,
894,
902,
910,
920,
929,
930,
1017,
1018,
1221,
1233,
1241,
1249,
1258,
1267,
1268,
1290,
1291,
1488,
1500,
1507,
1514,
1524,
1533,
1534,
1625,
1626,
1827,
1839,
1846,
1854,
1863,
1873,
1874,
1923,
1924,
2103,
2115,
2122,
2131,
2140,
2141,
2194,
2195,
2399,
2411,
2419,
2429,
2438,
2439,
2485,
2486,
2676,
2688,
2696,
2706,
2715,
2716,
2777,
2778,
2982,
2994,
3002,
3009,
3019,
3028,
3029,
3127,
3128,
3329,
3341,
3349,
3357,
3367,
3376,
3377,
3453,
3454,
3656,
3668,
3676,
3684,
3693,
3703,
3704,
3740,
3741,
3942,
3954,
3961,
3969,
3979,
3988,
3989,
4052,
4053,
4246,
4258,
4266,
4274,
4284,
4293,
4294,
4355,
4356,
4549,
4561,
4569,
4577,
4586,
4595,
4596,
4652,
4653,
4857,
4869,
4877,
4887,
4896,
4897,
4960,
4961,
5162,
5174,
5182,
5192,
5201,
5202,
5268,
5269,
5474,
5486,
5494,
5502,
5512,
5521,
5522,
5578,
5579,
5782,
5794,
5802,
5811,
5820,
5821,
5877,
5878,
6082,
6094,
6102,
6112,
6121,
6122,
6189,
6190,
6395,
6407,
6414,
6424,
6433,
6434,
6456,
6457,
6658,
6670,
6678,
6686,
6696,
6705,
6706,
6777,
6778,
6983,
6995,
7002,
7012,
7022,
7023,
7086,
7087,
7292,
7304,
7312,
7322,
7331,
7332,
7390,
7391,
7588,
7600,
7607,
7614,
7623,
7633,
7634,
7701,
7702,
7828,
7840,
7848,
7858,
7867,
7868,
7934,
7935,
8139,
8151,
8159,
8168,
8177,
8178,
8245,
8246,
8437,
8449,
8457,
8465,
8475,
8484,
8485,
8539,
8540,
8742,
8754,
8762,
8772,
8781,
8782,
8838,
8839,
9042,
9054,
9064,
9072,
9081,
9090,
9091,
9164,
9165,
9368,
9380,
9388,
9396,
9406,
9415,
9416,
9440,
9441,
9646,
9658,
9666,
9676,
9685,
9686,
9731,
9732,
9936,
9948,
9956,
9965,
9974,
9975,
10043,
10044,
10245,
10257,
10264,
10273,
10282,
10283,
10321,
10322,
10520,
10532,
10542,
10550,
10559,
10569,
10570,
10637,
10638,
10840,
10852,
10860,
10869,
10879,
10880,
10965,
10966,
11129,
11141,
11149,
11159,
11168,
11169,
11213,
11214,
11414,
11426,
11434,
11443,
11452,
11461,
11462,
11543,
11544,
11736,
11748,
11754,
11762,
11772,
11782,
11783,
11851,
11852,
12052,
12064,
12073,
12082,
12092,
12093,
12233,
12234,
12436,
12448,
12456,
12466,
12475,
12476,
12550,
12551,
12750,
12762,
12770,
12778,
12787,
12797,
12798,
12890,
12891,
13095,
13107,
13115,
13124,
13134,
13135,
13223,
13224,
13424,
13436,
13444,
13453,
13462,
13463,
13587,
13588,
13773,
13785,
13795,
13802,
13812,
13821,
13822,
13867,
13868,
14073,
14085,
14093,
14101,
14111,
14120,
14121,
14180,
14181,
14348,
14360,
14370,
14378,
14388,
14398,
14399,
14476,
14477,
14682,
14694,
14701,
14711,
14721,
14722,
14778,
14779,
14976,
14988,
14998,
15005,
15015,
15025,
15026,
15090,
15091,
15209,
15221,
15229,
15237,
15246,
15255,
15256,
15318,
15319,
15502,
15514,
15515,
15517,
15525,
15528
],
"line_end_idx": [
34,
35,
170,
171,
181,
191,
203,
211,
221,
230,
231,
327,
328,
526,
538,
546,
556,
565,
566,
678,
679,
882,
894,
902,
910,
920,
929,
930,
1017,
1018,
1221,
1233,
1241,
1249,
1258,
1267,
1268,
1290,
1291,
1488,
1500,
1507,
1514,
1524,
1533,
1534,
1625,
1626,
1827,
1839,
1846,
1854,
1863,
1873,
1874,
1923,
1924,
2103,
2115,
2122,
2131,
2140,
2141,
2194,
2195,
2399,
2411,
2419,
2429,
2438,
2439,
2485,
2486,
2676,
2688,
2696,
2706,
2715,
2716,
2777,
2778,
2982,
2994,
3002,
3009,
3019,
3028,
3029,
3127,
3128,
3329,
3341,
3349,
3357,
3367,
3376,
3377,
3453,
3454,
3656,
3668,
3676,
3684,
3693,
3703,
3704,
3740,
3741,
3942,
3954,
3961,
3969,
3979,
3988,
3989,
4052,
4053,
4246,
4258,
4266,
4274,
4284,
4293,
4294,
4355,
4356,
4549,
4561,
4569,
4577,
4586,
4595,
4596,
4652,
4653,
4857,
4869,
4877,
4887,
4896,
4897,
4960,
4961,
5162,
5174,
5182,
5192,
5201,
5202,
5268,
5269,
5474,
5486,
5494,
5502,
5512,
5521,
5522,
5578,
5579,
5782,
5794,
5802,
5811,
5820,
5821,
5877,
5878,
6082,
6094,
6102,
6112,
6121,
6122,
6189,
6190,
6395,
6407,
6414,
6424,
6433,
6434,
6456,
6457,
6658,
6670,
6678,
6686,
6696,
6705,
6706,
6777,
6778,
6983,
6995,
7002,
7012,
7022,
7023,
7086,
7087,
7292,
7304,
7312,
7322,
7331,
7332,
7390,
7391,
7588,
7600,
7607,
7614,
7623,
7633,
7634,
7701,
7702,
7828,
7840,
7848,
7858,
7867,
7868,
7934,
7935,
8139,
8151,
8159,
8168,
8177,
8178,
8245,
8246,
8437,
8449,
8457,
8465,
8475,
8484,
8485,
8539,
8540,
8742,
8754,
8762,
8772,
8781,
8782,
8838,
8839,
9042,
9054,
9064,
9072,
9081,
9090,
9091,
9164,
9165,
9368,
9380,
9388,
9396,
9406,
9415,
9416,
9440,
9441,
9646,
9658,
9666,
9676,
9685,
9686,
9731,
9732,
9936,
9948,
9956,
9965,
9974,
9975,
10043,
10044,
10245,
10257,
10264,
10273,
10282,
10283,
10321,
10322,
10520,
10532,
10542,
10550,
10559,
10569,
10570,
10637,
10638,
10840,
10852,
10860,
10869,
10879,
10880,
10965,
10966,
11129,
11141,
11149,
11159,
11168,
11169,
11213,
11214,
11414,
11426,
11434,
11443,
11452,
11461,
11462,
11543,
11544,
11736,
11748,
11754,
11762,
11772,
11782,
11783,
11851,
11852,
12052,
12064,
12073,
12082,
12092,
12093,
12233,
12234,
12436,
12448,
12456,
12466,
12475,
12476,
12550,
12551,
12750,
12762,
12770,
12778,
12787,
12797,
12798,
12890,
12891,
13095,
13107,
13115,
13124,
13134,
13135,
13223,
13224,
13424,
13436,
13444,
13453,
13462,
13463,
13587,
13588,
13773,
13785,
13795,
13802,
13812,
13821,
13822,
13867,
13868,
14073,
14085,
14093,
14101,
14111,
14120,
14121,
14180,
14181,
14348,
14360,
14370,
14378,
14388,
14398,
14399,
14476,
14477,
14682,
14694,
14701,
14711,
14721,
14722,
14778,
14779,
14976,
14988,
14998,
15005,
15015,
15025,
15026,
15090,
15091,
15209,
15221,
15229,
15237,
15246,
15255,
15256,
15318,
15319,
15502,
15514,
15515,
15517,
15525,
15528,
15529
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 15529,
"ccnet_original_nlines": 436,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3316754698753357,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.041964560747146606,
"rps_doc_frac_lines_end_with_ellipsis": 0.10068649798631668,
"rps_doc_frac_no_alph_words": 0.19428038597106934,
"rps_doc_frac_unique_words": 0.2523263990879059,
"rps_doc_mean_word_length": 4.31030797958374,
"rps_doc_num_sentences": 151,
"rps_doc_symbol_to_word_ratio": 0.014299039728939533,
"rps_doc_unigram_entropy": 5.446102142333984,
"rps_doc_word_count": 2794,
"rps_doc_frac_chars_dupe_10grams": 0.01660715974867344,
"rps_doc_frac_chars_dupe_5grams": 0.11126796156167984,
"rps_doc_frac_chars_dupe_6grams": 0.09192062169313431,
"rps_doc_frac_chars_dupe_7grams": 0.049489330500364304,
"rps_doc_frac_chars_dupe_8grams": 0.031719669699668884,
"rps_doc_frac_chars_dupe_9grams": 0.024744659662246704,
"rps_doc_frac_chars_top_2gram": 0.041517890989780426,
"rps_doc_frac_chars_top_3gram": 0.022834839299321175,
"rps_doc_frac_chars_top_4gram": 0.020925020799040794,
"rps_doc_books_importance": -1384.5611572265625,
"rps_doc_books_importance_length_correction": -1384.5611572265625,
"rps_doc_openwebtext_importance": -752.798828125,
"rps_doc_openwebtext_importance_length_correction": -752.798828125,
"rps_doc_wikipedia_importance": -506.15667724609375,
"rps_doc_wikipedia_importance_length_correction": -506.15667724609375
},
"fasttext": {
"dclm": 0.01857757940888405,
"english": 0.9078435897827148,
"fineweb_edu_approx": 1.3297497034072876,
"eai_general_math": 0.06437647342681885,
"eai_open_web_math": 0.23366427421569824,
"eai_web_code": 0.0038377600722014904
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "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
|
9,011,212,005,816,586,000 |
CHEMISTRYCLUB Archives
November 2006
[email protected]
Options: Use Monospaced Font
Show Text Part by Default
Condense Mail Headers
Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]
Print Reply
Sender:
Chemistry Club <[log in to unmask]>
Subject:
From:
XP Software <[log in to unmask]>
Date:
Tue, 7 Nov 2006 08:35:32 -0600
Content-Type:
text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit
Reply-To:
XP Software <[log in to unmask]>
Parts/Attachments:
text/plain (131 lines)
Christopher has uploaded some new software for you!
Click here to view available updated software:
http://propoem.com/?Christopher
In modern systems there are two types of Break signals. If the Break
Beware of multiple devices configured to use the same ID. Chaos
So what we used to call a NS16550AFN (DIP Package) is now called a
#
your login and password in this script , also you will need to change
7.4.2.1. Kernel Configuration
/compat/linux/lib/libc.so.4 -> libc.so.4.6.29
which indicates that this particular system's Ethernet MAC address is
working title for the project being "386BSD 0.5" or "386BSD Interim"
disk space a user or group may allocate, and how many files they may
The sender does not know when the receiver has "looked" at the value
o Zynx ZX342
To use the info(1) command, simply type:
In the following example, we start with a skeletal /etc/printcap that
Contact: ftpadminftp.nectec.or.th.
actually a gzip'd cpio file). You can create this floppy in the same
USA
If you want to run doom or other applications that need shared memory
How do you handle other file formats, though?
command line are treated as part of a single job. It is the currently
are suitable for 9-track tapes (6250 bpi), not the high-density media
device sd0
These keywords are required in every kernel you build.
compiled binaries either via ftp or CD-ROM. If in doubt, please
(symbolically) a temporary file name (one that ends in .dvi) to
# Quit answering ARP requests for the SLIP client
10.4.11. * Sound cards
To join this list, send mail to <majordomoFreeBSD> and say:
targets `pre-<something>' or `post-<something>', or put scripts with
ipfw -a l
SLIP or PPP
bin/oneko
FreeBSD audience, invariably assuring a better (or at least faster)
o BOCA IOAT66 6 port serial card using shared IRQ.
cvs-ports /usr/ports Ported software
you need only enough disk space to build the ports you want. (Almost)
o ftp.au.FreeBSD/pub/FreeBSD
in your kernel's config file. It is included in the GENERIC kernel,
Ethernet MAC address whenever a another IP node on the Ethernet asks
[then the special rules, in the order they are called]
speed of the interface is higher, 10 or 15 Mbits/second instead of the
the product will compare favorably in market comparisons even though
requirement for copying encrypted passwords from different hosts
ctm_rmail program directly from a entry in /etc/aliases if you want to
linux
room for more
lprm
CTM is a method for keeping a remote directory tree in sync with a
the tape at target ID 6 is wired down to unit number 1. Note that
its. Simply change the value you want updated to modify the quota
2. Installing FreeBSD
retrieve the ``tarball'' if it is not available on the local system.
# /etc/printcap for host rose - added text filter
options.
actually being sent over the media, not the amount of data that is
chmod 555 /mnt/sbin/fsck /mnt/sbin/mount /mnt/sbin/halt
RSA Data Security, Inc., MD4 secure hash function) iteration-count
parameters
memory.
freebsd-platforms Concerning ports to non-Intel architecture platforms
Update packet counters but do not allow/deny the packet based on
questionsFreeBSD> . This will keep you informed of build-
Reported by: J"org Wunsch joerg_wunschuriah.heep.sax.de
o Fix the syscons ALT-TAB/vt switching hangs. Coordinator: Soeren
sio3 at 0x2e8-0x2ef irq 9 on isa
o Enhanced Small Device Interface (ESDI) [X3.170-1990/X3.170a-1991]
Do not forget to add them to pkg/PLIST too! (Do not worry about
To add a /dev entry for a port:
It then loads the first 15 sectors at 0x10000 (segment BOOTSEG in the
If you're looking for high-speed serial networking solutions, then
additions to /etc/printcap:
power.
On FreeBSD-stable you need to add the following as well:
libraries.
(note the extra ``s'') as the results can be confusing.
importance.
win. This also means that the SCSI host adapter usually uses target ID
21:#11 0xf01932a1 in exception:calltrap ()
o Computer Systems Research Group, UC Berkeley. 4.4BSD Programmer's
how many bytes are to be transferred is decremented.
command to move it into place on the original system:
# ln -s /cdrom/ports/distfiles distfiles
Instead, the filter will make the symbolic link in the current working
lock up, first check the ``supported configurations'' section of
# cd /usr/ports/directory
input 1 {Username: }
o SMC Elite 16 WD8013 Ethernet interface, and most other WD8003E,
There is one other type of configuration that we should cover, and
``out of the box'', but this is unfortunately rather rare. With most
the received data.
program that LPD runs when it has a job to print. When LPD runs the
There are special terminators you can stick onto a flat cable bus.
that can evolve in the commercial use of GPL software, we do, however,
reasons IRQ 2 = IRQ 9) in order to access it from FreeBSD. If
For a variable-speed configuration, you will need to configure your
used to refer to a machine that sits on two local-area networks.
o FN: Fast Narrow
performed on all of the control signals so that each device will see
5.3.5. SCSI Device Support
your system at all. If you plan on installing via anonymous FTP, then
kernels.
host is allowed to control compression
times, once for each byte. Each time a byte is transferred, the
even to send an ICMP message back to the originator. Only the first
have not installed the system sources already (srcdist/srcsys.?? in
and general performance..
IP router, or install gated on your FreeBSD SLIP server and configure
bus. For wide buses this increases to the number of data lines.
7.4.1.2. Parallel Ports
drive, C35470A DDS format DAT drive, C1534A DDS format DAT drive, and
/dev directory before you can use them.
A shell script called MAKEDEV in the /dev directory manages the device
processes each of them will be running. One keyword
o Data Terminal Ready (DTR)
Reorganization of the source tree for multiple platform ports.
The command modifier (b/h/w) specifies the size of the data to be
non-``fly-by'' mode, but nobody in the PC industry uses this
1. Dial up, type "slip" at the prompt, enter your machine name and
archivers/unzip subdirectory of your ports tree to build and install
packages also make it highly useful to those who's primary interest
with the lpr command:
version), or one which just lets you send data to it as if you were
and 8-bit data words, 2 Stop Bits are
ATOM RSS1 RSS2
|
{
"url": "https://listserv.csufresno.edu/cgi-bin/wa?A2=CHEMISTRYCLUB;7543ab1d.0611&FT=&P=34616&H=A&S=",
"source_domain": "listserv.csufresno.edu",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "82636",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HH63NORO3CXPPRFT4ED6I4JXZQAYU7XZ",
"WARC-Concurrent-To": "<urn:uuid:b0cd9f64-4b52-49c4-b76a-f7c205b96542>",
"WARC-Date": "2022-05-19T08:23:47Z",
"WARC-IP-Address": "129.8.9.138",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TMUGOH76WB6WYTFXOLBVTHG2DMYFF6XV",
"WARC-Record-ID": "<urn:uuid:7bc742fd-76ae-43f1-b3c2-83e749e9130e>",
"WARC-Target-URI": "https://listserv.csufresno.edu/cgi-bin/wa?A2=CHEMISTRYCLUB;7543ab1d.0611&FT=&P=34616&H=A&S=",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7a21c434-504e-4687-8e2a-c0e4866c0870>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-55\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,
23,
24,
38,
39,
76,
77,
106,
132,
154,
155,
203,
249,
296,
297,
309,
317,
353,
362,
368,
401,
407,
438,
452,
515,
525,
558,
577,
600,
652,
653,
654,
701,
733,
734,
735,
805,
869,
936,
938,
1008,
1039,
1085,
1155,
1224,
1293,
1362,
1381,
1422,
1492,
1535,
1605,
1609,
1679,
1725,
1796,
1866,
1877,
1932,
1997,
2061,
2111,
2135,
2195,
2264,
2274,
2294,
2304,
2372,
2424,
2479,
2552,
2587,
2656,
2725,
2780,
2851,
2920,
2985,
3056,
3062,
3113,
3118,
3185,
3251,
3320,
3343,
3412,
3463,
3472,
3539,
3595,
3662,
3673,
3681,
3761,
3834,
3893,
3949,
4017,
4050,
4119,
4184,
4216,
4286,
4353,
4381,
4388,
4445,
4456,
4512,
4524,
4595,
4638,
4708,
4761,
4815,
4856,
4927,
5000,
5026,
5047,
5114,
5181,
5250,
5291,
5360,
5427,
5498,
5569,
5637,
5702,
5722,
5791,
5819,
5890,
5899,
5938,
6003,
6074,
6142,
6168,
6238,
6305,
6330,
6400,
6440,
6511,
6574,
6604,
6667,
6733,
6794,
6861,
6930,
6998,
7020,
7088,
7148,
7149
],
"line_end_idx": [
23,
24,
38,
39,
76,
77,
106,
132,
154,
155,
203,
249,
296,
297,
309,
317,
353,
362,
368,
401,
407,
438,
452,
515,
525,
558,
577,
600,
652,
653,
654,
701,
733,
734,
735,
805,
869,
936,
938,
1008,
1039,
1085,
1155,
1224,
1293,
1362,
1381,
1422,
1492,
1535,
1605,
1609,
1679,
1725,
1796,
1866,
1877,
1932,
1997,
2061,
2111,
2135,
2195,
2264,
2274,
2294,
2304,
2372,
2424,
2479,
2552,
2587,
2656,
2725,
2780,
2851,
2920,
2985,
3056,
3062,
3113,
3118,
3185,
3251,
3320,
3343,
3412,
3463,
3472,
3539,
3595,
3662,
3673,
3681,
3761,
3834,
3893,
3949,
4017,
4050,
4119,
4184,
4216,
4286,
4353,
4381,
4388,
4445,
4456,
4512,
4524,
4595,
4638,
4708,
4761,
4815,
4856,
4927,
5000,
5026,
5047,
5114,
5181,
5250,
5291,
5360,
5427,
5498,
5569,
5637,
5702,
5722,
5791,
5819,
5890,
5899,
5938,
6003,
6074,
6142,
6168,
6238,
6305,
6330,
6400,
6440,
6511,
6574,
6604,
6667,
6733,
6794,
6861,
6930,
6998,
7020,
7088,
7148,
7149,
7163
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7163,
"ccnet_original_nlines": 159,
"rps_doc_curly_bracket": 0.0002792100131046027,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3215433955192566,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.045016080141067505,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2501607835292816,
"rps_doc_frac_unique_words": 0.5134649872779846,
"rps_doc_mean_word_length": 4.856373310089111,
"rps_doc_num_sentences": 85,
"rps_doc_symbol_to_word_ratio": 0.0038585199508816004,
"rps_doc_unigram_entropy": 5.797210693359375,
"rps_doc_word_count": 1114,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.008502770215272903,
"rps_doc_frac_chars_dupe_6grams": 0.008502770215272903,
"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.008317929692566395,
"rps_doc_frac_chars_top_3gram": 0.007208869792521,
"rps_doc_frac_chars_top_4gram": 0.00942698959261179,
"rps_doc_books_importance": -642.051025390625,
"rps_doc_books_importance_length_correction": -642.051025390625,
"rps_doc_openwebtext_importance": -421.61517333984375,
"rps_doc_openwebtext_importance_length_correction": -421.61517333984375,
"rps_doc_wikipedia_importance": -265.4913024902344,
"rps_doc_wikipedia_importance_length_correction": -265.4913024902344
},
"fasttext": {
"dclm": 0.06548219919204712,
"english": 0.8541272878646851,
"fineweb_edu_approx": 2.092649221420288,
"eai_general_math": 0.6101691126823425,
"eai_open_web_math": 0.2670518159866333,
"eai_web_code": 0.3196218013763428
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02854",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,438,395,275,322,275,300 |
public abstract class
FileCacheBase
extends CustomizationsAwareCache
java.lang.Object
↳ com.microstrategy.utils.cache.CacheBase
↳ com.microstrategy.utils.cache.CustomizationsAwareCache
↳ com.microstrategy.utils.cache.FileCacheBase
Known Direct Subclasses
Class Overview
The FileCacheBase is the base class for cached objects that depend on a single file, that is, the file they depend on cannot be customized through the plug-ins infrastructure, nor can it internally depend on other configuration files.
It's load method will call the doLoad(CacheHint) and save the file's ModificationTime in a table. When reload is call it will compare the current file's ModificationTime against the value in the table and only if different will call load(CacheHint) again.
Summary
[Expand]
Inherited Constants
From class com.microstrategy.utils.cache.CacheBase
[Expand]
Inherited Fields
From class com.microstrategy.utils.cache.CacheBase
Protected Constructors
FileCacheBase(String cacheName)
Base constructor, it will register the Cache in the CacheRegistry and set is refresh time to DEFAULT_FILE_REFRESH_TIME
Protected Methods
abstract Object doLoad(CacheHint hint)
This abstract method is called by the load method to perform the actual loading.
Object getKey(CacheHint hint)
Returns the key of the cache element based on the hint.
String getPath(CacheHint hint)
Returns the path for the given hint.
Object load(CacheHint hint)
Loads an element from a file and keeps track of its last modification time.
Object reLoad(CacheHint hint, Object ob)
Checks if the file corresponding to the hint has changed (by comparing its last modification time with the value stored by the load method), and if the same, just returns the same object, otherwise it will call delegate tot he load(CacheHint) method.
[Expand]
Inherited Methods
From class com.microstrategy.utils.cache.CustomizationsAwareCache
From class com.microstrategy.utils.cache.CacheBase
From class java.lang.Object
From interface com.microstrategy.utils.cache.Cache
From interface java.util.Observer
Protected Constructors
protected FileCacheBase (String cacheName)
Base constructor, it will register the Cache in the CacheRegistry and set is refresh time to DEFAULT_FILE_REFRESH_TIME
Parameters
cacheName The name (id) of the Cache.
Protected Methods
protected abstract Object doLoad (CacheHint hint)
This abstract method is called by the load method to perform the actual loading. In this method, subclasses needs to load the file and parse it, and return the object they actually want cached.
protected Object getKey (CacheHint hint)
Returns the key of the cache element based on the hint. In this scenario, the hint itself is the key.
Parameters
hint the hint object.
Returns
• the key
protected String getPath (CacheHint hint)
Returns the path for the given hint. This implementation simply uses the hint value.
protected Object load (CacheHint hint)
Loads an element from a file and keeps track of its last modification time. The actual loading of the element is delegated to the doLoad(CacheHint) method.
Parameters
hint the hint object.
Returns
• the object or null.
protected Object reLoad (CacheHint hint, Object ob)
Checks if the file corresponding to the hint has changed (by comparing its last modification time with the value stored by the load method), and if the same, just returns the same object, otherwise it will call delegate tot he load(CacheHint) method.
Parameters
hint the hint object.
Returns
• the object or null.
|
{
"url": "https://lw.microstrategy.com/msdz/MSDL/GARelease_Current/_GARelease_Archives/106/docs/ReferenceFiles/reference/com/microstrategy/utils/cache/FileCacheBase.html",
"source_domain": "lw.microstrategy.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "74285",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LNKUDMXPESMIVXY43UKDG2CFXDKGZ62M",
"WARC-Concurrent-To": "<urn:uuid:58553100-4e3f-4dd8-b5e2-1f27fecdd348>",
"WARC-Date": "2022-09-30T23:12:01Z",
"WARC-IP-Address": "199.255.80.216",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MVTXQQD5SSJIH7C3C62WNTD7QQ7G62F7",
"WARC-Record-ID": "<urn:uuid:392d4ce4-4d07-4f02-92a1-b02e0747ec89>",
"WARC-Target-URI": "https://lw.microstrategy.com/msdz/MSDL/GARelease_Current/_GARelease_Archives/106/docs/ReferenceFiles/reference/com/microstrategy/utils/cache/FileCacheBase.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:22bb95b9-7ed2-4094-8d94-64e1c3af2a3d>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-88\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,
22,
23,
37,
38,
71,
88,
133,
195,
248,
272,
273,
288,
289,
524,
525,
781,
782,
790,
791,
800,
820,
871,
880,
897,
948,
971,
1003,
1122,
1140,
1179,
1260,
1290,
1346,
1377,
1414,
1442,
1518,
1559,
1810,
1819,
1837,
1903,
1954,
1982,
2033,
2067,
2068,
2091,
2092,
2135,
2136,
2255,
2256,
2267,
2305,
2306,
2324,
2325,
2375,
2376,
2570,
2571,
2612,
2613,
2715,
2716,
2727,
2749,
2757,
2769,
2770,
2812,
2813,
2898,
2899,
2938,
2939,
3095,
3096,
3107,
3129,
3137,
3161,
3162,
3214,
3215,
3466,
3467,
3478,
3500,
3508
],
"line_end_idx": [
22,
23,
37,
38,
71,
88,
133,
195,
248,
272,
273,
288,
289,
524,
525,
781,
782,
790,
791,
800,
820,
871,
880,
897,
948,
971,
1003,
1122,
1140,
1179,
1260,
1290,
1346,
1377,
1414,
1442,
1518,
1559,
1810,
1819,
1837,
1903,
1954,
1982,
2033,
2067,
2068,
2091,
2092,
2135,
2136,
2255,
2256,
2267,
2305,
2306,
2324,
2325,
2375,
2376,
2570,
2571,
2612,
2613,
2715,
2716,
2727,
2749,
2757,
2769,
2770,
2812,
2813,
2898,
2899,
2938,
2939,
3095,
3096,
3107,
3129,
3137,
3161,
3162,
3214,
3215,
3466,
3467,
3478,
3500,
3508,
3531
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3531,
"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.29758307337760925,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0030211498960852623,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.197885200381279,
"rps_doc_frac_unique_words": 0.3016528785228729,
"rps_doc_mean_word_length": 5.927685737609863,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.446914196014404,
"rps_doc_word_count": 484,
"rps_doc_frac_chars_dupe_10grams": 0.38759151101112366,
"rps_doc_frac_chars_dupe_5grams": 0.42384105920791626,
"rps_doc_frac_chars_dupe_6grams": 0.42384105920791626,
"rps_doc_frac_chars_dupe_7grams": 0.42384105920791626,
"rps_doc_frac_chars_dupe_8grams": 0.42384105920791626,
"rps_doc_frac_chars_dupe_9grams": 0.38759151101112366,
"rps_doc_frac_chars_top_2gram": 0.02195887081325054,
"rps_doc_frac_chars_top_3gram": 0.012547929771244526,
"rps_doc_frac_chars_top_4gram": 0.02091320976614952,
"rps_doc_books_importance": -295.0454406738281,
"rps_doc_books_importance_length_correction": -295.0454406738281,
"rps_doc_openwebtext_importance": -99.95563507080078,
"rps_doc_openwebtext_importance_length_correction": -99.95563507080078,
"rps_doc_wikipedia_importance": -81.35701751708984,
"rps_doc_wikipedia_importance_length_correction": -81.35701751708984
},
"fasttext": {
"dclm": 0.2875697612762451,
"english": 0.7186824083328247,
"fineweb_edu_approx": 2.5912654399871826,
"eai_general_math": 0.621597409248352,
"eai_open_web_math": 0.19633543491363525,
"eai_web_code": 0.8904910087585449
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,349,187,567,939,531,000 |
1 /*
2 * Copyright 2008 Sun Microsystems, Inc. All rights reserved.
3 * Use is subject to license terms.
4 */
5
6
7 /*
8 * Copyright 1993 by OpenVision Technologies, Inc.
9 *
10 * Permission to use, copy, modify, distribute, and sell this software
11 * and its documentation for any purpose is hereby granted without fee,
12 * provided that the above copyright notice appears in all copies and
13 * that both that copyright notice and this permission notice appear in
14 * supporting documentation, and that the name of OpenVision not be used
15 * in advertising or publicity pertaining to distribution of the software
16 * without specific, written prior permission. OpenVision makes no
17 * representations about the suitability of this software for any
18 * purpose. It is provided "as is" without express or implied warranty.
19 *
20 * OPENVISION DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
21 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
22 * EVENT SHALL OPENVISION BE LIABLE FOR ANY SPECIAL, INDIRECT OR
23 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
24 * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
25 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
26 * PERFORMANCE OF THIS SOFTWARE.
27 */
28
29 /*
30 * $Id: util_validate.c 18721 2006-10-16 16:18:29Z epeisach $
31 */
32
33 /*
34 * functions to validate name, credential, and context handles
35 */
36
37 #include "gssapiP_generic.h"
38 #ifndef _KERNEL
39 #include "gss_libinit.h"
40 #endif
41
42 #ifdef HAVE_SYS_TYPES_H
43 #include <sys/types.h>
44 #endif
45
46 #ifdef _KERNEL
47 #include <sys/fcntl.h>
48 #else
49 #include <fcntl.h>
50 #include <limits.h>
51 #endif
52
53 #ifdef HAVE_BSD_DB
54 #include <sys/file.h>
55 #include <db.h>
56
57 static const int one = 1;
58 static const DBT dbtone = { (void *) &one, sizeof(one) };
59
60 typedef struct _vkey {
61 int type;
62 void *ptr;
63 } vkey;
64 #endif
65
66 #define V_NAME 1
67 #define V_CRED_ID 2
68 #define V_CTX_ID 3
69 #define V_LCTX_ID 4
70
71 /* SUNW15resync
72 beware some of the uses below of type look dubious but seem
73 to have been working in Solaris for a long time */
74
75 /* All these functions return 0 on failure, and non-zero on success */
76
g_save(db,type,ptr)77 static int g_save(db, type, ptr)
78 g_set *db;
79 int type;
80 void *ptr;
81 {
82 int ret;
83 #ifdef HAVE_BSD_DB
84 DB **vdb;
85 vkey vk;
86 DBT key;
87
88 #ifndef _KERNEL
89 ret = gssint_initialize_library();
90 if (ret)
91 return 0;
92 #endif
93 ret = k5_mutex_lock(&db->mutex);
94 if (ret)
95 return 0;
96
97 vdb = (DB **) &db->data;
98
99 if (!*vdb)
100 *vdb = dbopen(NULL, O_CREAT|O_RDWR, O_CREAT|O_RDWR, DB_HASH, NULL);
101
102 vk.type = type;
103 vk.ptr = ptr;
104
105 key.data = &vk;
106 key.size = sizeof(vk);
107
108 ret = ((*((*vdb)->put))(*vdb, &key, &dbtone, 0) == 0);
109 (void) k5_mutex_unlock(&db->mutex);
110 return ret;
111 #else
112 g_set_elt *gs;
113
114 #ifndef _KERNEL
115 ret = gssint_initialize_library();
116 if (ret)
117 return 0;
118 #endif
119 ret = k5_mutex_lock(&db->mutex);
120 if (ret)
121 return 0;
122
123 gs = (g_set_elt *) &db->data;
124
125 if (!*gs)
126 if (g_set_init(gs)) {
127 (void) k5_mutex_unlock(&db->mutex);
128 return(0);
129 }
130
131 /* SUNW15resync */
132 ret = (g_set_entry_add(gs, ptr, (void *)(intptr_t)type) == 0);
133 (void) k5_mutex_unlock(&db->mutex);
134 return ret;
135 #endif
136 }
137
g_validate(db,type,ptr)138 static int g_validate(db, type, ptr)
139 g_set *db;
140 int type;
141 void *ptr;
142 {
143 int ret;
144 #ifdef HAVE_BSD_DB
145 DB **vdb;
146 vkey vk;
147 DBT key, value;
148
149 ret = k5_mutex_lock(&db->mutex);
150 if (ret)
151 return 0;
152
153 vdb = (DB **) &db->data;
154 if (!*vdb) {
155 (void) k5_mutex_unlock(&db->mutex);
156 return(0);
157 }
158
159 vk.type = type;
160 vk.ptr = ptr;
161
162 key.data = &vk;
163 key.size = sizeof(vk);
164
165 if ((*((*vdb)->get))(*vdb, &key, &value, 0)) {
166 (void) k5_mutex_unlock(&db->mutex);
167 return(0);
168 }
169
170 (void) k5_mutex_unlock(&db->mutex);
171 return((value.size == sizeof(one)) &&
172 (*((int *) value.data) == one));
173 #else
174 g_set_elt *gs;
175 void *value;
176
177 ret = k5_mutex_lock(&db->mutex);
178 if (ret)
179 return 0;
180
181 gs = (g_set_elt *) &db->data;
182 if (!*gs) {
183 (void) k5_mutex_unlock(&db->mutex);
184 return(0);
185 }
186
187 if (g_set_entry_get(gs, ptr, (void **) &value)) {
188 (void) k5_mutex_unlock(&db->mutex);
189 return(0);
190 }
191 (void) k5_mutex_unlock(&db->mutex);
192 return((intptr_t)value == (intptr_t)type); /* SUNW15resync */
193 #endif
194 }
195
196 /*ARGSUSED*/
g_delete(db,type,ptr)197 static int g_delete(db, type, ptr)
198 g_set *db;
199 int type;
200 void *ptr;
201 {
202 int ret;
203 #ifdef HAVE_BSD_DB
204 DB **vdb;
205 vkey vk;
206 DBT key;
207
208 ret = k5_mutex_lock(&db->mutex);
209 if (ret)
210 return 0;
211
212 vdb = (DB **) &db->data;
213 if (!*vdb) {
214 (void) k5_mutex_unlock(&db->mutex);
215 return(0);
216 }
217
218 vk.type = type;
219 vk.ptr = ptr;
220
221 key.data = &vk;
222 key.size = sizeof(vk);
223
224 ret = ((*((*vdb)->del))(*vdb, &key, 0) == 0);
225 (void) k5_mutex_unlock(&db->mutex);
226 return ret;
227 #else
228 g_set_elt *gs;
229
230 ret = k5_mutex_lock(&db->mutex);
231 if (ret)
232 return 0;
233
234 gs = (g_set_elt *) &db->data;
235 if (!*gs) {
236 (void) k5_mutex_unlock(&db->mutex);
237 return(0);
238 }
239
240 if (g_set_entry_delete(gs, ptr)) {
241 (void) k5_mutex_unlock(&db->mutex);
242 return(0);
243 }
244 (void) k5_mutex_unlock(&db->mutex);
245 return(1);
246 #endif
247 }
248
249 /* functions for each type */
250
251 /* save */
252
g_save_name(vdb,name)253 int g_save_name(vdb, name)
254 g_set *vdb;
255 gss_name_t name;
256 {
257 return(g_save(vdb, V_NAME, (void *) name));
258 }
g_save_cred_id(vdb,cred)259 int g_save_cred_id(vdb, cred)
260 g_set *vdb;
261 gss_cred_id_t cred;
262 {
263 return(g_save(vdb, V_CRED_ID, (void *) cred));
264 }
g_save_ctx_id(vdb,ctx)265 int g_save_ctx_id(vdb, ctx)
266 g_set *vdb;
267 gss_ctx_id_t ctx;
268 {
269 return(g_save(vdb, V_CTX_ID, (void *) ctx));
270 }
g_save_lucidctx_id(vdb,lctx)271 int g_save_lucidctx_id(vdb, lctx)
272 g_set *vdb;
273 void *lctx;
274 {
275 return(g_save(vdb, V_LCTX_ID, (void *) lctx));
276 }
277
278
279 /* validate */
280
g_validate_name(vdb,name)281 int g_validate_name(vdb, name)
282 g_set *vdb;
283 gss_name_t name;
284 {
285 return(g_validate(vdb, V_NAME, (void *) name));
286 }
g_validate_cred_id(vdb,cred)287 int g_validate_cred_id(vdb, cred)
288 g_set *vdb;
289 gss_cred_id_t cred;
290 {
291 return(g_validate(vdb, V_CRED_ID, (void *) cred));
292 }
g_validate_ctx_id(vdb,ctx)293 int g_validate_ctx_id(vdb, ctx)
294 g_set *vdb;
295 gss_ctx_id_t ctx;
296 {
297 return(g_validate(vdb, V_CTX_ID, (void *) ctx));
298 }
g_validate_lucidctx_id(vdb,lctx)299 int g_validate_lucidctx_id(vdb, lctx)
300 g_set *vdb;
301 void *lctx;
302 {
303 return(g_validate(vdb, V_LCTX_ID, (void *) lctx));
304 }
305
306 /* delete */
307
g_delete_name(vdb,name)308 int g_delete_name(vdb, name)
309 g_set *vdb;
310 gss_name_t name;
311 {
312 return(g_delete(vdb, V_NAME, (void *) name));
313 }
g_delete_cred_id(vdb,cred)314 int g_delete_cred_id(vdb, cred)
315 g_set *vdb;
316 gss_cred_id_t cred;
317 {
318 return(g_delete(vdb, V_CRED_ID, (void *) cred));
319 }
g_delete_ctx_id(vdb,ctx)320 int g_delete_ctx_id(vdb, ctx)
321 g_set *vdb;
322 gss_ctx_id_t ctx;
323 {
324 return(g_delete(vdb, V_CTX_ID, (void *) ctx));
325 }
g_delete_lucidctx_id(vdb,lctx)326 int g_delete_lucidctx_id(vdb, lctx)
327 g_set *vdb;
328 void *lctx;
329 {
330 return(g_delete(vdb, V_LCTX_ID, (void *) lctx));
331 }
332
333
|
{
"url": "https://src.illumos.org/source/xref/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/mech/util_validate.c?r=159d09a2",
"source_domain": "src.illumos.org",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "100970",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KHUESBCMM6642MH5MANZJAERGUVFN2OO",
"WARC-Concurrent-To": "<urn:uuid:abe7a318-de66-4836-b591-9163f5bbb402>",
"WARC-Date": "2022-11-28T19:43:20Z",
"WARC-IP-Address": "44.241.36.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DU7JO65L66U2O76OYWNJEBFKCGCKNIN6",
"WARC-Record-ID": "<urn:uuid:32066dfe-85fe-4d6f-97eb-9a018dabd3d6>",
"WARC-Target-URI": "https://src.illumos.org/source/xref/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/mech/util_validate.c?r=159d09a2",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:387e7d52-edc6-4117-ab9e-c195db239ae7>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-11\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,
5,
70,
108,
114,
117,
120,
125,
178,
183,
257,
332,
405,
480,
556,
633,
703,
772,
848,
854,
926,
1003,
1071,
1148,
1224,
1301,
1337,
1344,
1348,
1354,
1419,
1426,
1430,
1436,
1502,
1509,
1513,
1545,
1564,
1592,
1602,
1606,
1633,
1659,
1669,
1673,
1691,
1717,
1726,
1748,
1771,
1781,
1785,
1807,
1832,
1851,
1855,
1884,
1945,
1949,
1975,
1991,
2008,
2019,
2029,
2033,
2054,
2077,
2099,
2122,
2126,
2145,
2211,
2268,
2272,
2346,
2350,
2405,
2424,
2442,
2461,
2466,
2481,
2503,
2519,
2534,
2549,
2553,
2572,
2613,
2628,
2648,
2658,
2697,
2712,
2732,
2736,
2767,
2771,
2788,
2866,
2871,
2894,
2915,
2920,
2943,
2973,
2978,
3040,
3083,
3102,
3112,
3134,
3139,
3159,
3201,
3217,
3238,
3249,
3289,
3305,
3326,
3331,
3368,
3373,
3390,
3422,
3464,
3481,
3493,
3498,
3524,
3594,
3637,
3656,
3667,
3673,
3678,
3742,
3762,
3781,
3801,
3807,
3823,
3846,
3863,
3879,
3902,
3907,
3947,
3963,
3984,
3989,
4021,
4041,
4087,
4108,
4117,
4122,
4145,
4166,
4171,
4194,
4224,
4229,
4283,
4329,
4350,
4359,
4364,
4407,
4452,
4492,
4502,
4524,
4544,
4549,
4589,
4605,
4626,
4631,
4668,
4687,
4733,
4754,
4763,
4768,
4825,
4871,
4892,
4901,
4944,
5013,
5024,
5030,
5035,
5052,
5112,
5132,
5151,
5171,
5177,
5193,
5216,
5233,
5249,
5265,
5270,
5310,
5326,
5347,
5352,
5384,
5404,
5450,
5471,
5480,
5485,
5508,
5529,
5534,
5557,
5587,
5592,
5645,
5688,
5707,
5717,
5739,
5744,
5784,
5800,
5821,
5826,
5863,
5882,
5928,
5949,
5958,
5963,
6005,
6051,
6072,
6081,
6124,
6142,
6153,
6159,
6164,
6198,
6203,
6218,
6223,
6275,
6296,
6322,
6328,
6379,
6385,
6443,
6464,
6493,
6499,
6553,
6559,
6613,
6634,
6661,
6667,
6719,
6725,
6791,
6812,
6833,
6839,
6893,
6899,
6904,
6909,
6928,
6933,
6993,
7014,
7040,
7046,
7101,
7107,
7173,
7194,
7223,
7229,
7287,
7293,
7355,
7376,
7403,
7409,
7465,
7471,
7545,
7566,
7587,
7593,
7651,
7657,
7662,
7679,
7684,
7740,
7761,
7787,
7793,
7846,
7852,
7914,
7935,
7964,
7970,
8026,
8032,
8090,
8111,
8138,
8144,
8198,
8204,
8274,
8295,
8316,
8322,
8378,
8384,
8389
],
"line_end_idx": [
5,
70,
108,
114,
117,
120,
125,
178,
183,
257,
332,
405,
480,
556,
633,
703,
772,
848,
854,
926,
1003,
1071,
1148,
1224,
1301,
1337,
1344,
1348,
1354,
1419,
1426,
1430,
1436,
1502,
1509,
1513,
1545,
1564,
1592,
1602,
1606,
1633,
1659,
1669,
1673,
1691,
1717,
1726,
1748,
1771,
1781,
1785,
1807,
1832,
1851,
1855,
1884,
1945,
1949,
1975,
1991,
2008,
2019,
2029,
2033,
2054,
2077,
2099,
2122,
2126,
2145,
2211,
2268,
2272,
2346,
2350,
2405,
2424,
2442,
2461,
2466,
2481,
2503,
2519,
2534,
2549,
2553,
2572,
2613,
2628,
2648,
2658,
2697,
2712,
2732,
2736,
2767,
2771,
2788,
2866,
2871,
2894,
2915,
2920,
2943,
2973,
2978,
3040,
3083,
3102,
3112,
3134,
3139,
3159,
3201,
3217,
3238,
3249,
3289,
3305,
3326,
3331,
3368,
3373,
3390,
3422,
3464,
3481,
3493,
3498,
3524,
3594,
3637,
3656,
3667,
3673,
3678,
3742,
3762,
3781,
3801,
3807,
3823,
3846,
3863,
3879,
3902,
3907,
3947,
3963,
3984,
3989,
4021,
4041,
4087,
4108,
4117,
4122,
4145,
4166,
4171,
4194,
4224,
4229,
4283,
4329,
4350,
4359,
4364,
4407,
4452,
4492,
4502,
4524,
4544,
4549,
4589,
4605,
4626,
4631,
4668,
4687,
4733,
4754,
4763,
4768,
4825,
4871,
4892,
4901,
4944,
5013,
5024,
5030,
5035,
5052,
5112,
5132,
5151,
5171,
5177,
5193,
5216,
5233,
5249,
5265,
5270,
5310,
5326,
5347,
5352,
5384,
5404,
5450,
5471,
5480,
5485,
5508,
5529,
5534,
5557,
5587,
5592,
5645,
5688,
5707,
5717,
5739,
5744,
5784,
5800,
5821,
5826,
5863,
5882,
5928,
5949,
5958,
5963,
6005,
6051,
6072,
6081,
6124,
6142,
6153,
6159,
6164,
6198,
6203,
6218,
6223,
6275,
6296,
6322,
6328,
6379,
6385,
6443,
6464,
6493,
6499,
6553,
6559,
6613,
6634,
6661,
6667,
6719,
6725,
6791,
6812,
6833,
6839,
6893,
6899,
6904,
6909,
6928,
6933,
6993,
7014,
7040,
7046,
7101,
7107,
7173,
7194,
7223,
7229,
7287,
7293,
7355,
7376,
7403,
7409,
7465,
7471,
7545,
7566,
7587,
7593,
7651,
7657,
7662,
7679,
7684,
7740,
7761,
7787,
7793,
7846,
7852,
7914,
7935,
7964,
7970,
8026,
8032,
8090,
8111,
8138,
8144,
8198,
8204,
8274,
8295,
8316,
8322,
8378,
8384,
8389,
8393
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8393,
"ccnet_original_nlines": 332,
"rps_doc_curly_bracket": 0.005957350134849548,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0667986124753952,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05541811138391495,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5724888443946838,
"rps_doc_frac_unique_words": 0.5443159937858582,
"rps_doc_mean_word_length": 5.0385355949401855,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0.01682334952056408,
"rps_doc_unigram_entropy": 5.79365873336792,
"rps_doc_word_count": 1038,
"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.06424473971128464,
"rps_doc_frac_chars_top_3gram": 0.006309750024229288,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -844.815185546875,
"rps_doc_books_importance_length_correction": -844.815185546875,
"rps_doc_openwebtext_importance": -500.45623779296875,
"rps_doc_openwebtext_importance_length_correction": -500.45623779296875,
"rps_doc_wikipedia_importance": -346.94525146484375,
"rps_doc_wikipedia_importance_length_correction": -346.94525146484375
},
"fasttext": {
"dclm": 0.6779624223709106,
"english": 0.13126076757907867,
"fineweb_edu_approx": 1.9590473175048828,
"eai_general_math": 0.2563707232475281,
"eai_open_web_math": 0.29220062494277954,
"eai_web_code": 0.3038485050201416
}
}
|
{
"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": "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": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,019,649,839,554,723,000 |
TPG Community
Get online support
VR1600v v2 Android random MAC address sometimes have no Internet connectivity
jaylong
Level 2
Hi there,
Seems like the TPLink VR1600v router has problem with privacy/random MAC address. Whenever my Android phone connects to the wifi, there will be wifi connection but no Internet access. It will only work after I disable random MAC address. Is there any firmware fix for this? I'm running on 0.1.0 0.9.1 v5006.0 Build 220518 Rel.32480n
Thanks.
2 REPLIES 2
david64
Master
Hi @jaylong . Your firmware is latest.
Can you check the VR1600 System Log for DHCPD messages when your random MAC wifi device connects. There should be DISCOVER, OFFER, REQUEST, ACK.
Compare messages when you connect using the device's real MAC.
Are there any settings with specific MAC addresses?
jaylong
Level 2
Hi David,
I was checking on the settings and realised it could be due to me being confused and mixing up the settings between LAN DHCP allocation (allocate MAC to IP address) with the Security's IP & MAC Binding (Only allowing specific MAC to use specific IP). Will continue to observe.
|
{
"url": "https://community.tpg.com.au/t5/Modems-and-Devices/VR1600v-v2-Android-random-MAC-address-sometimes-have-no-Internet/m-p/142115/highlight/true",
"source_domain": "community.tpg.com.au",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "146355",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FQLEFTDAE3WDQATA3PDDOXB6RE5V2T7L",
"WARC-Concurrent-To": "<urn:uuid:3144b473-6848-4e39-882b-73366ee658d1>",
"WARC-Date": "2024-07-23T12:11:44Z",
"WARC-IP-Address": "3.162.103.127",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:44GCSKOGPPWTI5D5Z6C4IOQLXOLMLWQQ",
"WARC-Record-ID": "<urn:uuid:a47384f9-5f17-42ac-a905-443233ac8d3e>",
"WARC-Target-URI": "https://community.tpg.com.au/t5/Modems-and-Devices/VR1600v-v2-Android-random-MAC-address-sometimes-have-no-Internet/m-p/142115/highlight/true",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bfaf7143-88b4-4d51-bd4b-5716dacaa5dc>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-168\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,
14,
15,
34,
35,
113,
114,
122,
130,
131,
141,
142,
475,
476,
478,
479,
487,
488,
500,
508,
515,
516,
555,
556,
702,
703,
766,
767,
819,
820,
828,
836,
837,
847,
848
],
"line_end_idx": [
14,
15,
34,
35,
113,
114,
122,
130,
131,
141,
142,
475,
476,
478,
479,
487,
488,
500,
508,
515,
516,
555,
556,
702,
703,
766,
767,
819,
820,
828,
836,
837,
847,
848,
1124
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1124,
"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.2731277644634247,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.11013215780258179,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20264317095279694,
"rps_doc_frac_unique_words": 0.6338797807693481,
"rps_doc_mean_word_length": 4.846994400024414,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.554409027099609,
"rps_doc_word_count": 183,
"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.030439680442214012,
"rps_doc_frac_chars_top_3gram": 0.036076661199331284,
"rps_doc_frac_chars_top_4gram": 0.033821869641542435,
"rps_doc_books_importance": -102.63420104980469,
"rps_doc_books_importance_length_correction": -102.63420104980469,
"rps_doc_openwebtext_importance": -57.18207931518555,
"rps_doc_openwebtext_importance_length_correction": -50.99009704589844,
"rps_doc_wikipedia_importance": -44.018104553222656,
"rps_doc_wikipedia_importance_length_correction": -44.018104553222656
},
"fasttext": {
"dclm": 0.10161423683166504,
"english": 0.8771501183509827,
"fineweb_edu_approx": 1.0006998777389526,
"eai_general_math": 0.05750269070267677,
"eai_open_web_math": 0.09352827072143555,
"eai_web_code": 0.02277803048491478
}
}
|
{
"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": "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": "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,793,810,341,375,052,000 |
Home: » Backup And Restore Guides » How to backup your iPhone 15, 15 Plus, 15 Pro, & 15 Pro Max
How to backup your iPhone 15, 15 Plus, 15 Pro, & 15 Pro Max
In this guide, we will provide comprehensive instructions on how to backup your iPhone 15, as well as tips on different methods and tools you can use.
Whether you are backing up your photos, contacts, music, videos, documents, or other content, this guide will give you step-by-step directions for a secure backup.
We will also include techniques that are not as widely known, such as using third-party tools, so that you can protect your data no matter which type of computer you own, what kind of data cables you have, or what service you subscribe to.
Remember, backing up your iPhone 15, 15 Plus, 15 Pro, and 15 Pro Max is an important step to safeguard your device’s data.
How to backup iPhone 15
Advertisement
This backup guide is designed for the following iPhone models:
Find out more about iPhone backups.
If you would like to restore a backup you have already taken, see How to restore iPhone 15.
Which back up location should you use?
Your iPhone 15 backup can be and kept on your computer, or remotely on Apples iCloud servers.
Each location has its benefits and drawbacks so you should use the method that suits your requirement.
Pros and cons of iCloud backup
iCloud backup
• Stores backups in iCloud on Apple servers.
• You rely on Apples security and policies.
• Offers 5GB of space for free.
• Paid plans can provide up to 2TB of storage (with an Apple One Premier plan, you can get up to 4TB).
• Backups are always encrypted
• Lets you create and use backups from anywhere via a Wi-Fi connection.
Find out how to backup iPhone 15 on iCloud.
Pros and cons of computer backup
computer backup
• Stores backups locally on your Mac or PC.
• Security of the backups are completely in your control.
• Offers encrypted backups, if required.
• Lets you create and use backups from your Mac or PC.
• If your computer breaks, you lose your backups.
• You can only create and use backups on your own Wi-Fi.
Advertisement
Find out how to do an iPhone 15 Mac backup, and an iPhone 15 PC backup.
Backup iPhone 15 to Mac
how to backup iPhone to your Mac
How to backup iPhone 15 on iTunes (using macOS Mojave 10.14 or older)
To backup your iPhone 15 to iTunes on a Mac do the following:
1. Connect your iPhone 15 and your Mac using a suitable USB C cable.
2. Open iTunes on your Mac.
3. Click the device icon in the top left of iTunes, just below the play button.
4. If this is the first time you have connected your device to your Mac click the trust button.
5. Tap trust on your device when prompted and enter your device passcode to confirm.
6. If you want to save sensitive information such as passwords then tick the Encrypt Local Back Up checkbox in the iTunes summary window.
7. If this is the first time you have done a local backup then enter a password when prompted. Then click the Set Password button.
8. To start a back up click the Back Up Now button near the bottom of the iTunes summary window.
9. Enter your device passcode to begin the back up. It should take around 5 minutes to complete but the exact time depends on what’s installed and stored on your device.
10. Once the backup is complete you will see the date and time it was made on the iTunes summary screen.
If you want to include Activity, Health, and Keychain data (password, passkey and credit card information) you’ll need to use an Encrypted Backup.
How to backup iPhone 15 on Finder (using macOS Catalina 10.15 or newer)
To backup your iPhone 15 on a Mac with the Music App, do the following:
1. Plug your iOS device into your Mac using a suitable USB C cable.
2. Open Finder on your Mac.
3. Click your device name in the sidebar.
4. If this is the first time you have connected your device to your Mac click the trust button.
5. Tap trust on your device when prompted and enter your device passcode to confirm.
6. If you want to save sensitive information such as passwords then tick the Encrypt Local Back Up checkbox in the Finder summary window.
7. If this is the first time you have done a local backup then enter a password when prompted. Then click the Set Password button.
8. To start a back up click the Back Up Now button near the bottom of the Finder summary window.
If you want to include Activity, Health, and Keychain data (password, passkey and credit card information) you’ll need to use an Encrypted Backup.
For more information, see our Guide to backing up iPhone on computer.
Backup iPhone 15 to Windows PC
Backup and restore
How to backup iPhone 15 on iTunes
To backup your iPhone 15 to iTunes on a Windows PC do the following:
1. Plug your phone into your PC with a USB or USB-C cable.
2. Start iTunes on your PC.
3. Click the device icon in the top left of iTunes, just below the play button.
4. If this is the first time you have connected your device to your Mac click the trust button.
5. Tap trust on your device when prompted and enter your device passcode to confirm.
6. Click Summary under the device setting in iTunes.
7. If you want to save sensitive information such as passwords then tick the Encrypt [device] Back Up checkbox in the iTunes summary window.
8. If this is the first time you have done a local backup then enter a password when prompted. Then click the Set Password button.
9. To start a back up click the Back Up Now button near the bottom of the iTunes summary window.
10. Enter your device passcode to begin the back up. It should take around 5 minutes to complete but the exact time depends on what’s installed and stored on your device.
11. Once the backup is complete you will see the date and time it was made on the iTunes summary screen.
12. To see the backups stored on your PC, choose Edit > Preferences, then click Devices. Encrypted backups have a lock icon in the list of backups.
If you want to include Activity, Health, and Keychain data (password, passkey and credit card information) you’ll need to use an Encrypted Backup.
Backup iPhone 15 to iTunes without cable
• With Wi-Fi sync you can backup your iPhone 15 to iTunes wirelessly.
• You can also backup your iPhone 15 wirelessly using a WI-Fi connection to your iCloud account.
• Finally, you can also connect your iPhone 15 to your Mac or PC wirelessly over Wi-Fi without using a cable and sync your data to keep the content up to date.
To backup iPhone 15 to iTunes without using cable, do the following:
1. Connect your iPhone and computer with a cable.
2. Open iTunes.
3. Within iTunes, click on the device icon and select Summary.
4. Scroll down from the right side and select the checkbox Sync with this iPhone over Wi-Fi.
5. Next, click Apply to save changes.
6. Once iTunes Wi-Fi Sync is enabled, you can go to Settings > General > iTunes Wi-Fi Sync to manually start sync files from iPhone to PC.
7. When your iPhone 15 is connected to a power source and is on the same Wi-Fi network as your computer, it automatically starts to backup iPhone to iTunes without a cable.
Syncing keeps supported content up to date between your iPhone and computer. For example, when you add a movie to your iPhone, you can sync so that the movie also appears on your computer.
However, syncing your device is not the same as taking a backup as it doesn’t allow you to restore your device. You can only perform a restore from a backup.
Backup iPhone 15 to iCloud
You can backup your iPhone 15 to iCloud using Wi-Fi without needing to plug your device into a computer.
To use iCloud backup:
1. Turn on iCloud Backup:
• Tap Settings > [your name] > iCloud > iCloud Backup.
• On iOS 10.2 or earlier, go to Settings > iCloud > Backup.
2. Connect your device to a power source.
3. Connect your device to a Wi-Fi network.
4. Make sure your device’s screen is locked.
5. Your device will automatically be backed up, as long as you have enough available space in iCloud.
If you haven’t configured your device to use iCloud yet, find out how to setup and use your iCloud Account.
When you backup to iCloud some data is not saved:
• Contacts, Calendars, Notes, iCloud Photos, iMessages, Voice Memos, text (SMS) and multimedia (MMS) messages, and Health data.
• Data stored in other cloud services, like Gmail and Exchange mail.
• Apple Mail data.
• Apple Pay information and settings.
• Face ID or Touch ID settings.
• iCloud Music Library and App Store content.
When you create an iCloud account, you automatically get 5 GB of storage. This storage space can be utilized for iCloud backups, iCloud Photos (for photos and videos), and iCloud Drive (for documents).
If your backup and content exceed the 5 GB of free space, you can buy more storage or delete content to make room.
How to back up iPhone 15 automatically using iCloud Backup
If you would like your device to be backed up automatically to iCloud without having to remember to do it manually, do the following:
1. Make sure iCloud Backup is turned on in Settings > [your name] > iCloud > iCloud Backup.
2. Connect your iPhone 15 to a power source.
3. Check your device is connected to a Wi-Fi network.
4. Make sure your phone’s screen is locked.
5. A backup will be done automatically.
If you receive an alert that states you don’t have enough iCloud storage space to complete the backup, then your data has not been saved. You need to buy more space or clear out unused data from your iCloud account.
Backup iPhone 15 without iTunes
If you would like to backup your iPhone 15 without iTunes, you have the following options:
1. Use iCloud.
2. If you have a Mac computer using macOS Catalina 10.15 or newer, use Finder.
3. You can also backup specific files from your iPhone using 3rd party backup tools.
Backup iPhone 15 without iCloud
If you would like to backup your iPhone 15 without using iCloud, you have the following options:
1. If you have a Mac computer using macOS Mojave 10.14 or older, use iTunes.
2. If you have a Mac computer using macOS Catalina 10.15 or newer, use Finder.
3. If you have a Windows PC, use iTunes.
4. You can also backup specific files from your iPhone using 3rd party backup tools.
Backup iPhone 15 using 3rd party tool
There are many 3rd party tools on the market that allow you to backup data from your iPhone 15. They have some advantages, such as:
• Being more selective, so you can choose specific files to backup to your computer.
• Support more kinds of files, including WhatsApp, Contacts, Photos, Music, Messages and more.
However, they also has some disadvantages, including:
• Backups can only be done to a computer.
• You can’t use Wi-Fi backup, your iPhone needs to be connected to a computer using a cable.
• You have to buy a license to gain full access to all of the tools included.
• Tools only back up some files, not the entire device, so you can’t do a full restore.
I suggest 3rd party tools are not a replacement for Apple’s backup, but with the ability to backup specific kinds of files they can compliment it.
They give you more control over specific files you want to keep safe, such as WhatsApp messages, that standard backups doesn’t include. This may be useful for some users.
However, I recommend that you still use the Apple backup methods, even if it means you have to pay a small fee for additional iCloud storage space. This is because it is reliable, secure, and can be done from anywhere.
If you are paranoid and you want an additional backup tool for specific file types it is worth considering using 3rd party backup tools.
About iPhone 15
The iPhone 15, iPhone 15 PlusiPhone 15 Pro, and iPhone 15 Pro Max phone models were released with iOS 17 pre-installed. iPhone 15 was available for sale on September 22, 2023.
Storage options for iPhone 15 and iPhone 15 Plus are 128 GB, 256 GB, and 512 GB.
The iPhone 15 Pro and Pro Max options are 256 GB, 512 GB, and 1 TB storage space.
It is worth noting that you only get 5GB of free iCloud storage from Apple to backup your iPhone 15 – which is far smaller than the data the phone is capable of storing. This means most owners are forced to subscribe to a paid iCloud plan to have enough space to do a full backup. Or they have to find alternative ways to back up their data such as saving it to Mac, Windows PC, or iTunes.
To find out more about backup and restore options on iPhone, see how to restore iPhone and how to restore deleted pictures on iPhone.
How to backup other iPhone models
If you would like detailed instructions on how to backup other iPhones in the range, see:
If you have an iPad, you can see our iPad backup instructions.
FAQ
How do I manually backup my iPhone 15?
To manually backup your iPhone 15 to iTunes, do the following:
1. Connect your device to your computer using a suitable cable.
2. Open iTunes on your computer.
3. Click the device icon in the top left of iTunes, just below
How do I manually backup my iPhone 15 to iCloud?
On your iPhone 15, do the following to manually back it up to iCloud:
• Tap Settings > [your name] > iCloud > iCloud Backup > Back Up Now.
Why won't my iPhone 15 back up?
There are a number of things that can cause your device to not backup, including:
• You don’t have enough iCloud storage.
• Your Wi-Fi is not working properly.
• Your phone wasn’t connected to a power source when doing an automatic update.
How do I transfer everything from my iPhone 15 to a new iPhone?
To transfer your data to a new phone, do the following:
1. Backup up your old iPhone to iCloud.
2. Turn on your new iPhone and proceed with the setup process.
3. Connect the new phone to WiFi.
4. On the Apps & Data screen, select Restore from iCloud Backup.
5. Sign in to iCloud.
6. Choose the backup you want to restore.
7. Wait for the backup to complete.
Does iCloud backup include photos?
No, an iCloud backup does not include photos. However, when you set up iCloud you automatically get 5GB of storage. You can use that storage space to keep your photos and videos stored in iCloud Photos.
You can also use 3rd party backup tools to selectively backup your pictures.
Affiliate statement
If you click a link to go through to a provider, we may get paid. This only happens if you buy a service. This is what funds us, and keeps us free to use. For a more detailed explanation see our affiliate disclosure.
Leave a Comment
Your email address will not be published. Required fields are marked *
Scroll to Top
|
{
"url": "https://www.netchimp.co.uk/webdesign/backup-restore-iphone/backup-iphone-15/",
"source_domain": "www.netchimp.co.uk",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "525926",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FY7Q3S5VBCDSZ7TPUMHOA6JP3BTZD647",
"WARC-Concurrent-To": "<urn:uuid:d94c6c61-e7ac-44dd-a9f5-df50599d5526>",
"WARC-Date": "2024-03-02T22:16:07Z",
"WARC-IP-Address": "104.21.20.180",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z2DFBQ3BCMHYELRDIC2SQSJWABBKTXO5",
"WARC-Record-ID": "<urn:uuid:c45eeb71-3985-46d5-ae4b-08731075c2f4>",
"WARC-Target-URI": "https://www.netchimp.co.uk/webdesign/backup-restore-iphone/backup-iphone-15/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4817ec1c-b644-44e6-a872-0ba6d50c7579>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-145\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,
96,
97,
157,
158,
309,
310,
474,
475,
715,
716,
839,
840,
864,
865,
879,
880,
943,
944,
980,
981,
1073,
1074,
1113,
1114,
1208,
1209,
1312,
1313,
1344,
1345,
1359,
1360,
1407,
1453,
1487,
1592,
1625,
1699,
1700,
1744,
1745,
1778,
1779,
1795,
1796,
1842,
1902,
1945,
2002,
2054,
2113,
2114,
2128,
2129,
2201,
2202,
2226,
2227,
2260,
2261,
2331,
2332,
2394,
2395,
2466,
2496,
2578,
2676,
2763,
2903,
3036,
3135,
3307,
3414,
3415,
3562,
3563,
3635,
3636,
3708,
3709,
3779,
3809,
3853,
3951,
4038,
4178,
4311,
4410,
4411,
4558,
4559,
4629,
4630,
4661,
4662,
4681,
4682,
4716,
4717,
4786,
4787,
4848,
4878,
4960,
5058,
5145,
5200,
5343,
5476,
5575,
5748,
5855,
6005,
6006,
6153,
6154,
6195,
6196,
6268,
6367,
6529,
6530,
6599,
6600,
6652,
6670,
6735,
6830,
6870,
7011,
7186,
7187,
7376,
7377,
7535,
7536,
7563,
7564,
7669,
7670,
7692,
7693,
7721,
7780,
7844,
7888,
7933,
7980,
8084,
8085,
8193,
8194,
8244,
8245,
8375,
8446,
8467,
8507,
8541,
8589,
8590,
8792,
8793,
8908,
8909,
8968,
8969,
9103,
9104,
9198,
9245,
9301,
9347,
9389,
9390,
9606,
9607,
9639,
9640,
9731,
9732,
9749,
9830,
9917,
9918,
9950,
9951,
10048,
10049,
10128,
10209,
10252,
10339,
10340,
10378,
10379,
10511,
10512,
10599,
10696,
10697,
10751,
10752,
10796,
10891,
10971,
11061,
11062,
11209,
11210,
11381,
11382,
11601,
11602,
11739,
11740,
11756,
11757,
11934,
11935,
12016,
12017,
12099,
12100,
12491,
12492,
12626,
12627,
12661,
12662,
12752,
12753,
12816,
12817,
12821,
12822,
12861,
12862,
12925,
12926,
12993,
13028,
13093,
13094,
13143,
13144,
13214,
13215,
13286,
13287,
13319,
13320,
13402,
13403,
13445,
13485,
13567,
13568,
13632,
13633,
13689,
13690,
13732,
13797,
13833,
13900,
13924,
13968,
14006,
14007,
14042,
14043,
14246,
14247,
14324,
14325,
14345,
14346,
14563,
14564,
14580,
14581,
14652,
14653
],
"line_end_idx": [
96,
97,
157,
158,
309,
310,
474,
475,
715,
716,
839,
840,
864,
865,
879,
880,
943,
944,
980,
981,
1073,
1074,
1113,
1114,
1208,
1209,
1312,
1313,
1344,
1345,
1359,
1360,
1407,
1453,
1487,
1592,
1625,
1699,
1700,
1744,
1745,
1778,
1779,
1795,
1796,
1842,
1902,
1945,
2002,
2054,
2113,
2114,
2128,
2129,
2201,
2202,
2226,
2227,
2260,
2261,
2331,
2332,
2394,
2395,
2466,
2496,
2578,
2676,
2763,
2903,
3036,
3135,
3307,
3414,
3415,
3562,
3563,
3635,
3636,
3708,
3709,
3779,
3809,
3853,
3951,
4038,
4178,
4311,
4410,
4411,
4558,
4559,
4629,
4630,
4661,
4662,
4681,
4682,
4716,
4717,
4786,
4787,
4848,
4878,
4960,
5058,
5145,
5200,
5343,
5476,
5575,
5748,
5855,
6005,
6006,
6153,
6154,
6195,
6196,
6268,
6367,
6529,
6530,
6599,
6600,
6652,
6670,
6735,
6830,
6870,
7011,
7186,
7187,
7376,
7377,
7535,
7536,
7563,
7564,
7669,
7670,
7692,
7693,
7721,
7780,
7844,
7888,
7933,
7980,
8084,
8085,
8193,
8194,
8244,
8245,
8375,
8446,
8467,
8507,
8541,
8589,
8590,
8792,
8793,
8908,
8909,
8968,
8969,
9103,
9104,
9198,
9245,
9301,
9347,
9389,
9390,
9606,
9607,
9639,
9640,
9731,
9732,
9749,
9830,
9917,
9918,
9950,
9951,
10048,
10049,
10128,
10209,
10252,
10339,
10340,
10378,
10379,
10511,
10512,
10599,
10696,
10697,
10751,
10752,
10796,
10891,
10971,
11061,
11062,
11209,
11210,
11381,
11382,
11601,
11602,
11739,
11740,
11756,
11757,
11934,
11935,
12016,
12017,
12099,
12100,
12491,
12492,
12626,
12627,
12661,
12662,
12752,
12753,
12816,
12817,
12821,
12822,
12861,
12862,
12925,
12926,
12993,
13028,
13093,
13094,
13143,
13144,
13214,
13215,
13286,
13287,
13319,
13320,
13402,
13403,
13445,
13485,
13567,
13568,
13632,
13633,
13689,
13690,
13732,
13797,
13833,
13900,
13924,
13968,
14006,
14007,
14042,
14043,
14246,
14247,
14324,
14325,
14345,
14346,
14563,
14564,
14580,
14581,
14652,
14653,
14666
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14666,
"ccnet_original_nlines": 285,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37392139434814453,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014062000438570976,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2003835141658783,
"rps_doc_frac_unique_words": 0.18419061601161957,
"rps_doc_mean_word_length": 4.263237476348877,
"rps_doc_num_sentences": 227,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.197642803192139,
"rps_doc_word_count": 2644,
"rps_doc_frac_chars_dupe_10grams": 0.23926544189453125,
"rps_doc_frac_chars_dupe_5grams": 0.3743789792060852,
"rps_doc_frac_chars_dupe_6grams": 0.3341909348964691,
"rps_doc_frac_chars_dupe_7grams": 0.29125267267227173,
"rps_doc_frac_chars_dupe_8grams": 0.27413058280944824,
"rps_doc_frac_chars_dupe_9grams": 0.25044357776641846,
"rps_doc_frac_chars_top_2gram": 0.03548616170883179,
"rps_doc_frac_chars_top_3gram": 0.02235627919435501,
"rps_doc_frac_chars_top_4gram": 0.020759399980306625,
"rps_doc_books_importance": -1130.33837890625,
"rps_doc_books_importance_length_correction": -1130.33837890625,
"rps_doc_openwebtext_importance": -679.016845703125,
"rps_doc_openwebtext_importance_length_correction": -679.016845703125,
"rps_doc_wikipedia_importance": -428.7084045410156,
"rps_doc_wikipedia_importance_length_correction": -428.7084045410156
},
"fasttext": {
"dclm": 0.06311315298080444,
"english": 0.8789763450622559,
"fineweb_edu_approx": 1.7369892597198486,
"eai_general_math": 0.009431839920580387,
"eai_open_web_math": 0.1717420220375061,
"eai_web_code": 0.005556880030781031
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,650,967,681,356,833,000 |
https://bugs.freebsd.org/bugzilla/show_bug.cgi?id=221445
--- Comment #3 from Andrey V. Elsukov <[email protected]> ---
(In reply to Vladislav V. Prodan from comment #2)
> Read the description of the bug again.
> I described how I managed to get the ipv6 to work.
It is wrong, and this is why it doesn't work.
> ifconfig_em0_ipv6="inet6 2001:41d0:e:XXX::1/128"
What is the reason of /128 prefix length?
> ipv6_static_routes="ipv6gw"
> ipv6_route_ipv6gw="-host 2001:41d0:000e:03ff:ff:ff:ff:ff -iface em0"
This will not work on FreeBSD due to implementation specificity.
> ipv6_defaultrouter="2001:41d0:000e:03ff:ff:ff:ff:ff"
When the kernel is going to send IPv6 packet, it does L2 lookup to determine L2
address. ND6 code does lookup for destination address only when an address is
considered as neighbor. When you have not configured the correct prefix, the
ND6 has not any interfaces where the destination address can be considered as
neighbor. In your case even the L2 address of default router can not be found.
--
You are receiving this mail because:
You are the assignee for the bug.
_______________________________________________
[email protected] mailing list
https://lists.freebsd.org/mailman/listinfo/freebsd-bugs
To unsubscribe, send any mail to "[email protected]"
Reply via email to
|
{
"url": "https://www.mail-archive.com/[email protected]/msg35985.html",
"source_domain": "www.mail-archive.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "9132",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EBFHEAVUJBJVFPU4UPU7RCF3C7W3YUFX",
"WARC-Concurrent-To": "<urn:uuid:8fa2905d-d559-48f3-8016-0023c0956d7c>",
"WARC-Date": "2017-08-21T23:02:44Z",
"WARC-IP-Address": "72.52.77.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JHMGL532D3S7UAIHFDWUGWMI6Y4B5SZD",
"WARC-Record-ID": "<urn:uuid:2beeb659-b0db-485a-a344-7de0f620f25c>",
"WARC-Target-URI": "https://www.mail-archive.com/[email protected]/msg35985.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:63ddfb88-14e0-48af-b705-a4b1d80ccf18>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-178-28-12.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,
57,
58,
119,
169,
210,
263,
264,
310,
311,
362,
363,
405,
406,
436,
507,
508,
574,
575,
630,
631,
711,
789,
866,
944,
1023,
1024,
1028,
1065,
1099,
1147,
1185,
1241,
1313,
1314
],
"line_end_idx": [
57,
58,
119,
169,
210,
263,
264,
310,
311,
362,
363,
405,
406,
436,
507,
508,
574,
575,
630,
631,
711,
789,
866,
944,
1023,
1024,
1028,
1065,
1099,
1147,
1185,
1241,
1313,
1314,
1332
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1332,
"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.2426229566335678,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03278689086437225,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32131147384643555,
"rps_doc_frac_unique_words": 0.6071428656578064,
"rps_doc_mean_word_length": 5.827381134033203,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.013114750385284424,
"rps_doc_unigram_entropy": 4.393326759338379,
"rps_doc_word_count": 168,
"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.01225741021335125,
"rps_doc_frac_chars_top_3gram": 0.04085801914334297,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -124.99897766113281,
"rps_doc_books_importance_length_correction": -124.99897766113281,
"rps_doc_openwebtext_importance": -70.11983489990234,
"rps_doc_openwebtext_importance_length_correction": -70.11983489990234,
"rps_doc_wikipedia_importance": -58.01651382446289,
"rps_doc_wikipedia_importance_length_correction": -58.014892578125
},
"fasttext": {
"dclm": 0.1396111249923706,
"english": 0.8186534643173218,
"fineweb_edu_approx": 1.7909512519836426,
"eai_general_math": 0.008497299626469612,
"eai_open_web_math": 0.0913882926106453,
"eai_web_code": 0.012594399973750114
}
}
|
{
"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.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,850,525,268,163,810,000 |
7-2n=n-143
Simple and best practice solution for 7-2n=n-143 equation. Check how easy it is, and learn it for the future. Our solution is simple, and easy to understand, so don`t hesitate to use it as a solution of your homework.
If it's not what You are looking for type in the equation solver your own equation and let us solve it.
Solution for 7-2n=n-143 equation:
Simplifying
7 + -2n = n + -143
Reorder the terms:
7 + -2n = -143 + n
Solving
7 + -2n = -143 + n
Solving for variable 'n'.
Move all terms containing n to the left, all other terms to the right.
Add '-1n' to each side of the equation.
7 + -2n + -1n = -143 + n + -1n
Combine like terms: -2n + -1n = -3n
7 + -3n = -143 + n + -1n
Combine like terms: n + -1n = 0
7 + -3n = -143 + 0
7 + -3n = -143
Add '-7' to each side of the equation.
7 + -7 + -3n = -143 + -7
Combine like terms: 7 + -7 = 0
0 + -3n = -143 + -7
-3n = -143 + -7
Combine like terms: -143 + -7 = -150
-3n = -150
Divide each side by '-3'.
n = 50
Simplifying
n = 50
You can always share this solution
See similar equations:
| 2a+6=35 | | 8(x+2)=64 | | 12-6w=10-5w | | 4(3x+5)=10x+2 | | 9x-55+3x+35=180 | | 2(x+10)-6=2 | | 25x-1=9 | | -8m+1-m=12+7 | | 40=64t-16t^2 | | 2y+3+2y=y+6 | | 0=x^4+8x^3-9x^2 | | (3x+7+3x+7)+(4x-2+4x-2)= | | 0.5= | | 2.5+1.3=1.3h-2.3 | | 0.75(8+2y)=3 | | -7(x+2)-43=6-14 | | 12x-3(-4x+3)+5=13 | | -5w+2=15w-10 | | 2x-2=24 | | 6x+152+3x+91=180 | | 3x+10+x-30=180 | | x^2-3x-150=0 | | .07x+.08(4x+32000)=46630 | | 4w*3w+2w=24 | | 25x+6-27x=4-6 | | 2(2b-4)=10-2b | | 11x+9=13(11-x) | | 10y=12-4x | | .5x+10=20 | | (36x^2)-120x=-70 | | -31y=434 | | 14=7x-4+2x | | 5+2(x+8)=-3 | | 19.72+6.5z=4.8z | | 32x+3=40x-3 | | 4x-16=24 | | 15-4x=x-5 | | (8x-10+8x-10)+(6x+6x)= | | 250+16x=210+18x | | 15d-8=2d | | (36x^2)-120=-70 | | 5h+2g=23 | | -14.8+0.2s=-16.4s+19.85+18.7s | | 8-5(2a+3)= | | y=-9-2x | | 8z-1=3z+6 | | |3-2b|=-7 | | |3-2b|=7 | | 8-y=5 | | 70x-35=245 | | 5x+12-2x=36+6x-7x | | -4(x+2)-11=2(-2x-3)-14 | | -15.73-9.3b=16.82-7.2b | | x-3x-150=0 | | 3y+48y=0 | | 3.9k=2.1k+17.1 | | 8=3x+4x-6 | | 11(p-5)-10(6p+22)=-32+38 | | -4y-15=0 | | -2.6r=1.7r+18.92 | | n-9=162 | | (5x+5x)+(3x+6+3x+6)= | | t^2+3t-40=0 | | a+17=4 | | 3*y-7=27 |
Related pages
360-268sec 5xmulti step equation calculator with fractionsroman numerals x1gcf of 26whats the prime factorization of 901800-13006x-2y 4lcm of 144greatest common factor of 120gcf of 69 and 922.6 as a fraction in simplest formwhat is the prime factorization for 92what is prime factorization of 482x-5y 0 find slopeeasy 97.2solve for h v lwhgraph y 2x 75x 2y 224-101common multiples of 2 and 3356.9factors of72lcm and gcf calculatorsimplify sin 2xcotx6x 5ygcf of 63 and 84secxtanxcommon multiples of 6 and 122x2-3x-56x-2y 43x 5y 19cos150find the prime factorization of 120find the prime factorization of 300prime factorization calculator with steps250 in roman numeralsadding three fractions calculatorthe prime factorization of 65prime factorization of 624prime factorization 39solve 2x 6 10square root of 7200prime factorization of 4322x 5y 16sec2x 1502 in roman numeralsprime factorization of 34516 qt to galx 5y graphprime factorization of 245what are factors of 2x2 9x 950 prime factorizationderivative of 2x 12x 5y 10 graph630-10solve 2sinx 1 0math problem solver step by stepprime factorization of 78systems of equations calculator 2x2prime factorization of 61prime factorization of 58solving equation calculatory rootxquad solver3x 3y 15gcf of 263ln x-2105.7xfactor 3x 2 2x 5
|
{
"url": "http://experiment-ufa.ru/7-2n=n-143",
"source_domain": "experiment-ufa.ru",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "25334",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TVQB7KLWSYBO6CSM2NEJBNFABVX4W72B",
"WARC-Concurrent-To": "<urn:uuid:74415cee-9bf7-4ec8-a842-c30e9a342759>",
"WARC-Date": "2018-01-20T10:54:11Z",
"WARC-IP-Address": "104.28.17.110",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TDK4CLA7JYZ4XVKIO7ARM37TSO22SVKL",
"WARC-Record-ID": "<urn:uuid:5e7063c6-fa34-4500-bda9-2c123005b952>",
"WARC-Target-URI": "http://experiment-ufa.ru/7-2n=n-143",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:73522206-92da-43bd-8c9b-a1f133d53dbc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-181-179-14.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,
11,
12,
230,
231,
335,
336,
370,
371,
372,
384,
403,
422,
441,
449,
468,
494,
565,
605,
636,
672,
697,
729,
748,
763,
802,
827,
858,
878,
894,
931,
942,
968,
975,
987,
994,
995,
1030,
1031,
1054,
1055,
2190,
2191,
2192,
2206,
2207,
2208
],
"line_end_idx": [
11,
12,
230,
231,
335,
336,
370,
371,
372,
384,
403,
422,
441,
449,
468,
494,
565,
605,
636,
672,
697,
729,
748,
763,
802,
827,
858,
878,
894,
931,
942,
968,
975,
987,
994,
995,
1030,
1031,
1054,
1055,
2190,
2191,
2192,
2206,
2207,
2208,
3489
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3489,
"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.12377049028873444,
"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.6254098415374756,
"rps_doc_frac_unique_words": 0.5497737526893616,
"rps_doc_mean_word_length": 5.208144664764404,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.014256954193115,
"rps_doc_word_count": 442,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07211121171712875,
"rps_doc_frac_chars_dupe_6grams": 0.059947870671749115,
"rps_doc_frac_chars_dupe_7grams": 0.04083406180143356,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.07819288223981857,
"rps_doc_frac_chars_top_3gram": 0.013032150454819202,
"rps_doc_frac_chars_top_4gram": 0.029973940923810005,
"rps_doc_books_importance": -583.1670532226562,
"rps_doc_books_importance_length_correction": -583.1670532226562,
"rps_doc_openwebtext_importance": -236.43556213378906,
"rps_doc_openwebtext_importance_length_correction": -236.43556213378906,
"rps_doc_wikipedia_importance": -143.2583465576172,
"rps_doc_wikipedia_importance_length_correction": -143.2583465576172
},
"fasttext": {
"dclm": 1.0000100135803223,
"english": 0.7082717418670654,
"fineweb_edu_approx": 1.6000748872756958,
"eai_general_math": 0.942584216594696,
"eai_open_web_math": 0.34659814834594727,
"eai_web_code": 0.9936541318893433
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,058,333,050,717,642,000 |
1
\$\begingroup\$
So, I read that camera = new OrthographicCamera(1, h/w); creates a camera with an appropriate width and height for the field view.. However, I can't understand that value 1 for the viewport width, does a value 1 means full width?
\$\endgroup\$
1 Answer 1
1
\$\begingroup\$
You need to distinguish between the gl-viewport and the cameras viewport. The GL-viewport somehow defines the area on the Display, while the cameras viewport defines the area in the game world.
So a camera with a viewport of (1/1) can see 1 unit of your world in width and height and projects it to the gl-viewport.
For example: You have a Camera with a viewport of (16,9) and it's center is at (8, 4.5), the middle. Now you can see all objects form P(0,0) to P(16,9). Objects outside this area are not visible to you.
You may ask, which values you should use. That depends on the game, but to find a good value, you may think about them like meters. How many meters of your gameworld you want to see at once? For example if you have a 1m tall character. How much space should he take on screen? If it's 1/9 of the screen, your viewport hight should be 9.
One important note: You should definitly use Viewports, they have some additional functions, which are usefull in many cases.
\$\endgroup\$
2
• \$\begingroup\$ I'm new to game dev so please don't judge me, I'm still kind of confused with all this concepts.. Tell me if I'm wrong.. We have our device display, what our viewport does is like selecting what part of our game world we see in the display, right? Also, our game world size isn't directly connected to the display size, right? It can be whatever the size we want for our game.. \$\endgroup\$
– yat0
May 7, 2015 at 22:55
• \$\begingroup\$ @polska Exactly. The camera just "selects" the part of your gameworld and projects it to the display. It is independend of the resolution and display size. The glViewport instead defines the "drawable" area on screen. \$\endgroup\$
– Robert P
May 8, 2015 at 6:04
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
{
"url": "https://gamedev.stackexchange.com/questions/100598/why-value-1-in-orthographiccamera-viewport-width",
"source_domain": "gamedev.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "211117",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KC24NIMYUY5QF4BGTH7736DQGD556FGI",
"WARC-Concurrent-To": "<urn:uuid:65303e02-f209-42cd-954f-8ca0e44f4754>",
"WARC-Date": "2022-06-28T15:32:58Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OU2ISYCURKKTNQ2ANBYPIGUQVXZ72FII",
"WARC-Record-ID": "<urn:uuid:b3350db1-5de5-44bd-b095-a00f88bab441>",
"WARC-Target-URI": "https://gamedev.stackexchange.com/questions/100598/why-value-1-in-orthographiccamera-viewport-width",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6f48ba52-9d50-4801-93a2-d8cf97f442c7>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-103\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,
2,
18,
19,
249,
250,
264,
265,
276,
277,
279,
295,
296,
490,
491,
613,
614,
817,
818,
1155,
1281,
1282,
1296,
1298,
1710,
1721,
1746,
1998,
2013,
2037,
2038,
2079,
2080
],
"line_end_idx": [
2,
18,
19,
249,
250,
264,
265,
276,
277,
279,
295,
296,
490,
491,
613,
614,
817,
818,
1155,
1281,
1282,
1296,
1298,
1710,
1721,
1746,
1998,
2013,
2037,
2038,
2079,
2080,
2146
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2146,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3904382586479187,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017928289249539375,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27290835976600647,
"rps_doc_frac_unique_words": 0.46010637283325195,
"rps_doc_mean_word_length": 4.268617153167725,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.79177188873291,
"rps_doc_word_count": 376,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04984423890709877,
"rps_doc_frac_chars_dupe_6grams": 0.02741432934999466,
"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.03239874914288521,
"rps_doc_frac_chars_top_3gram": 0.020560750737786293,
"rps_doc_frac_chars_top_4gram": 0.014953269623219967,
"rps_doc_books_importance": -211.9119873046875,
"rps_doc_books_importance_length_correction": -211.9119873046875,
"rps_doc_openwebtext_importance": -128.05609130859375,
"rps_doc_openwebtext_importance_length_correction": -128.05609130859375,
"rps_doc_wikipedia_importance": -90.38675689697266,
"rps_doc_wikipedia_importance_length_correction": -90.38675689697266
},
"fasttext": {
"dclm": 0.13017743825912476,
"english": 0.9194011688232422,
"fineweb_edu_approx": 1.4600586891174316,
"eai_general_math": 0.10320407152175903,
"eai_open_web_math": 0.1705363392829895,
"eai_web_code": 0.026065770536661148
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,232,869,958,540,105,000 |
Want
Overview
Related Modules:
AbilityKit
Description:
Defines the abstract description of an operation, including information about the ability and the extra data to carry.
Summary
Data Fields
Variable Name
Description
element
ElementName
sid
SvcIdentity
data
void *
dataLength
uint16_t
Details
Field Documentation
data
1. void*Want::data
Description:
Pointer to the carried data
dataLength
1. uint16_tWant::dataLength
Description:
Data length
element
1. [ElementName]($api-api-SmartVision-Devices-ElementName.md)*Want::element
Description:
Pointer to the ability information, including the device ID, bundle name, and class name.
sid
1. SvcIdentity*Want::sid
Description:
Pointer to the ID of the server that listens for ability startup. After the ability is started, the callback function corresponding to the server will be invoked.
|
{
"url": "https://www.bookstack.cn/read/openharmony-1.0-zh-cn/api-api-SmartVision-Devices-Want.md",
"source_domain": "www.bookstack.cn",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "196513",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LUXRLWN3PXM77OPAESIK3JQDPZU2H5G3",
"WARC-Concurrent-To": "<urn:uuid:21240f08-1b33-4bb2-8df1-5acb1866d61b>",
"WARC-Date": "2021-09-23T17:47:24Z",
"WARC-IP-Address": "94.74.104.125",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HWMLPYEZVFBX6GDPIHPJR62U6E2MP3RW",
"WARC-Record-ID": "<urn:uuid:790232f4-b3ef-414a-ba0b-a673521fe48b>",
"WARC-Target-URI": "https://www.bookstack.cn/read/openharmony-1.0-zh-cn/api-api-SmartVision-Devices-Want.md",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5ca7f716-8f68-4500-98ec-87079c72fe16>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-112\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,
5,
6,
15,
16,
33,
34,
45,
46,
59,
60,
179,
180,
188,
189,
201,
202,
216,
217,
229,
230,
238,
239,
252,
253,
257,
258,
272,
273,
278,
279,
287,
288,
299,
300,
310,
311,
319,
320,
340,
341,
346,
347,
368,
369,
382,
383,
411,
412,
423,
424,
454,
455,
468,
469,
481,
482,
490,
491,
569,
570,
583,
584,
674,
675,
679,
680,
707,
708,
721,
722
],
"line_end_idx": [
5,
6,
15,
16,
33,
34,
45,
46,
59,
60,
179,
180,
188,
189,
201,
202,
216,
217,
229,
230,
238,
239,
252,
253,
257,
258,
272,
273,
278,
279,
287,
288,
299,
300,
310,
311,
319,
320,
340,
341,
346,
347,
368,
369,
382,
383,
411,
412,
423,
424,
454,
455,
468,
469,
481,
482,
490,
491,
569,
570,
583,
584,
674,
675,
679,
680,
707,
708,
721,
722,
884
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 884,
"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.19736841320991516,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013157890178263187,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25,
"rps_doc_frac_unique_words": 0.5809524059295654,
"rps_doc_mean_word_length": 6.5523810386657715,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.8067731857299805,
"rps_doc_word_count": 105,
"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.029069770127534866,
"rps_doc_frac_chars_top_3gram": 0.0872092992067337,
"rps_doc_frac_chars_top_4gram": 0.1002907007932663,
"rps_doc_books_importance": -79.8503189086914,
"rps_doc_books_importance_length_correction": -79.8503189086914,
"rps_doc_openwebtext_importance": -34.67744827270508,
"rps_doc_openwebtext_importance_length_correction": -27.197853088378906,
"rps_doc_wikipedia_importance": -26.339685440063477,
"rps_doc_wikipedia_importance_length_correction": -26.339685440063477
},
"fasttext": {
"dclm": 0.022272229194641113,
"english": 0.6045055389404297,
"fineweb_edu_approx": 2.603102445602417,
"eai_general_math": 0.0008351799915544689,
"eai_open_web_math": 0.4238826632499695,
"eai_web_code": 0.0003235299955122173
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,157,250,994,421,927,000 |
Click here to Skip to main content
11,798,280 members (77,886 online)
Click here to Skip to main content
PolyStar - WPF Polygons and Stars
, 27 Sep 2008 CPOL 49.3K 1.1K 39
Rate this:
Please Sign up or sign in to vote.
Control and tool for the creation of various stars and polygons.
Application Image
Introduction
This article is comprised of a Shape class for generating polygons and stars as well as a designer that enables us to preview these objects. This started when I found myself in need of a “Spinny Thingy” to display during a long process. A geometric shape evolved, and a designer application along with it.
Most of this article will cover the implementing of the geometrical transformations to create the stars and polygons (Polystars, henceforth). Along the way, I ran afoul of some oddities in the implementation of the DependencyProperty class. Hopefully, my experience can be of help.
Although understanding is a great and wonderful thing, the PolyStar class and the design application can be used prior to examining their inner workings. You can put a reference to PolygonImageLib in you project, construct the polygon with the Generator tool, and then get the XAML and paste it in, either as a PolyStar or as a Polygon.
Assemblies
The code consists of three assemblies. PolygonBuilder contains the code for displaying the PolyStars, PolygonImageLib contains the classes for the PolyStar, and PointTransformations contains the basic classes for manipulating the points in the polygons. The classes in PointTransformations have mostly come from my last article.
Polygons and Stars
Polygons can be thought of as an equiangular set of points along a circle specified by a radius and a number of points/sides. The code to generate both stars and polygons is in PolyMatrixBuilder.
if (mShapeType == EShapeType.Polygon)
{
Matrix mat = new Matrix(2);
for (int i = 0; i < mSides; i++)
{
double x = mRadius * Math.Cos((2 * Math.PI / mSides) * i);
double y = mRadius * Math.Sin((2 * Math.PI / mSides) * i);
mat.AddRow(new Double[] { x, y });
}
Stars are a bit more complicated. One of the ways of defining a star is to think of it as two polygons with the same number of sides and the same origin but different radii, but with the inner one rotated.
To create the star, we clones the matrix of points, rotate them, and interleave the two matrices. Note that the inner radius can be negative, which makes an interesting effect, especially when the negative inner radius number is just a little smaller, absolute value wise, than the radius. The interface is set up so that negative values need to be typed rather than come from the slider.
Angular Offset
The angular offset can be thought of as the amount that the inner polygon is rotated away from where it would be in a normal star.
Note that it can be either positive or negative. Also, if the offset is greater than 360/(number of sides) in degrees, the geometry changes significantly.
Bevel
A Bevel is usually thought of as lopping off the corners of a shape. Technically, I should speak of chamfers, but that is not common usage. There is another way to think of a bevel. We could make a copy of the set of points, rotate it slightly, and then interleave the two sets of points. This is the approach that I took.
We get interesting effects when the bevel angle is negative, or when the angle is larger than 360/(number of sides) degrees for a polygon, or 180/(number of sides) degrees for a star.
Star Generation Code
Combining all of the geometrical notions in the code, we get the following for a star:
Matrix innerMat = (Matrix)outerMat.Clone();
// Will work because centered about origin
innerMat.Multiply(mInnerRadius / mRadius);
PointTransformations.RotationalTransformation rot =
new RotationalTransformation() { Matrix = innerMat };
rot.RotateRadiansAroundOrigin(Math.PI / mSides); //Circle is 2PI radians
if (mIsAngularlyOffset)
{
rot.RotateDegreesAroundOrigin(mAngularOffset);
}
outerMat.Interleave(innerMat, false);
if (mIsBeveled )
{
Matrix bevelmat = (Matrix)outerMat.Clone();
rot.Matrix = bevelmat;
rot.RotateDegreesAroundOrigin(mBevelOffset);
outerMat.Interleave(bevelmat, false);
rot.Matrix = outerMat;
//Remove appearance of rotation
rot.RotateDegreesAroundOrigin(-mBevelOffset / 2);
}
After this, invoke some overall transformations contained in OverallTransformations to rotate the shape, or flatten it in either the vertical or horizontal directions. This was done to ease maintenance.
Dependency Properties
My motivation for creating the PolyStar was to animate it. That requires that most of the properties be dependency properties. All went well with a few minor irritations. Please note that if you have a double property, you need to set the default to 0.0 rather than 0 for the value of zero. It will not cast it for you, and will also crash in the XAML where the object is created, rather than at the point of the faulty assignment.
Problems occurred when I decided that it would be better if setting IsRotated to false would also set the value of Rotation to 0. Naively, I thought the following code would work:
set
{
SetValue(IsRotatedProperty, value);
Rotation= 0;
}
The Rotation is not changed, but IRotated is modified just fine. After a while, I tried the following:
set
{
double[] x = { 0 };
double y = x[4];
SetValue(IsRotatedProperty, value);
double z = x[4];
}
This should generate a runtime error, but does not. Apparently, the compiler just ignores everything in the set statement, except SetValue. However, if there is a syntax error, it will fail to compile. If you want to do something when the property is set, you will need to use a callback. Putting code in the set area will not work.
Here is a version of the property that works.
Static Helper Functions
private static DependencyProperty DependencyProp
(string name, System.Type type,object defaultValue){
FrameworkPropertyMetadata fpm = new FrameworkPropertyMetadata
( defaultValue, FrameworkPropertyMetadataOptions.AffectsRender);
DependencyProperty dp = DependencyProperty.Register
(name, type , typeof(PolyStar), fpm);
return dp;
}
private static DependencyProperty DependencyProp
(string name, System.Type type, object defaultValue,
PropertyChangedCallback callback)
{
FrameworkPropertyMetadata fpm = new FrameworkPropertyMetadata
(defaultValue, FrameworkPropertyMetadataOptions.AffectsRender,callback);
DependencyProperty dp = DependencyProperty.Register
(name, type, typeof(PolyStar), fpm );
return dp;
}
Property Definition
public static DependencyProperty IsRotatedProperty =
DependencyProp("IsRotated", typeof(bool), false, IsRotatedCallBack);
public bool IsRotated
{
get { return (bool)GetValue(IsRotatedProperty ); }
set
{
SetValue(IsRotatedProperty, value);
}
}
And Finally, the Callback
static void IsRotatedCallBack(DependencyObject property,
DependencyPropertyChangedEventArgs args)
{
if (!(bool)args.NewValue)
{
PolyStar pTemp = (PolyStar)property;
pTemp.Rotation = 0;
}
}
Conclusion
There are other details about the technical implementation that might be interesting. IValueConverter<t> is worth looking at. MainWindow.xaml uses the VisualBrush in a productive way, something I had doubts that I would ever do. My purpose in writing this article was to make a tool so that people could easily add interesting polygons and stars to their applications. I hope to have succeeded.
History
• 27th September, 2008: Initial post
License
This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)
Share
About the Author
KenJohnson
Software Developer (Senior)
United States United States
Written software for what seems like forever. I'm currenly infatuated with WPF. Hopefully my affections are returned.
You may also be interested in...
Comments and Discussions
QuestionThanks! Pin
gardnerp7-Mar-13 9:45
membergardnerp7-Mar-13 9:45
General5 PolyStars! Pin
mikkojay24-Aug-09 11:39
membermikkojay24-Aug-09 11:39
QuestionPossible project? Pin
Noemata4-Aug-09 4:18
memberNoemata4-Aug-09 4:18
AnswerRe: Possible project? Pin
KenJohnson4-Aug-09 19:48
memberKenJohnson4-Aug-09 19:48
GeneralExcelent! Pin
Dragoljub18-Feb-09 23:59
memberDragoljub18-Feb-09 23:59
GeneralVery pretty :-) Pin
Colin Eberhardt29-Sep-08 0:37
memberColin Eberhardt29-Sep-08 0:37
GeneralAn idea for you Pin
Sacha Barber27-Sep-08 20:56
mvpSacha Barber27-Sep-08 20:56
GeneralRe: An idea for you Pin
mtonsager28-Sep-08 2:07
membermtonsager28-Sep-08 2:07
GeneralRe: An idea for you Pin
Leblanc Meneses29-Sep-08 19:02
memberLeblanc Meneses29-Sep-08 19:02
GeneralCool Pin
The Dogcow Farmer27-Sep-08 9:58
memberThe Dogcow Farmer27-Sep-08 9:58
Looks very nice. Could be useful for, say, a vector graphics editor?
Think about that next time you're illegally downloading music; you're not only killing Metallica, you're killing forests and bald eagles and crap. And Smokey Bear's band. - Jake Vinson, of Daily WTF fame
GeneralVery cool but Pin
Sacha Barber27-Sep-08 9:13
mvpSacha Barber27-Sep-08 9:13
AnswerRe: Very cool but Pin
KenJohnson27-Sep-08 16:02
memberKenJohnson27-Sep-08 16:02
GeneralRe: Very cool but Pin
Sacha Barber27-Sep-08 20:54
mvpSacha Barber27-Sep-08 20:54
General General News News Suggestion Suggestion Question Question Bug Bug Answer Answer Joke Joke Rant Rant Admin Admin
Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.
| Advertise | Privacy | Terms of Use | Mobile
Web02 | 2.8.151002.1 | Last Updated 27 Sep 2008
Article Copyright 2008 by KenJohnson
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid
|
{
"url": "http://www.codeproject.com/Articles/29733/PolyStar-WPF-Polygons-and-Stars?msg=2742294",
"source_domain": "www.codeproject.com",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "110258",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZJ4FZ7BNH6QKLBNIH7YY4NTTFNIISWQU",
"WARC-Concurrent-To": "<urn:uuid:3dd9e232-e6e4-4351-8e33-6f2a13dbf4a4>",
"WARC-Date": "2015-10-07T13:46:14Z",
"WARC-IP-Address": "76.74.234.210",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SZ7LKUZX53QPX2DTKNMYIEX7GF6PQQPE",
"WARC-Record-ID": "<urn:uuid:3f0cacc1-9fda-40a7-9236-de74af963a83>",
"WARC-Target-URI": "http://www.codeproject.com/Articles/29733/PolyStar-WPF-Polygons-and-Stars?msg=2742294",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9b97857f-dbc9-4115-9fd5-b9c4053155cb>"
},
"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,
35,
70,
105,
106,
140,
141,
174,
185,
220,
285,
286,
304,
305,
318,
319,
625,
626,
908,
909,
1246,
1247,
1258,
1259,
1588,
1589,
1608,
1609,
1805,
1806,
1844,
1846,
1878,
1915,
1921,
1988,
2055,
2098,
2104,
2105,
2311,
2312,
2701,
2702,
2717,
2718,
2849,
2850,
3005,
3006,
3012,
3013,
3336,
3337,
3521,
3522,
3543,
3544,
3631,
3632,
3676,
3719,
3763,
3816,
3874,
3948,
3972,
3974,
4025,
4027,
4065,
4066,
4083,
4085,
4133,
4160,
4209,
4251,
4278,
4315,
4369,
4371,
4372,
4575,
4576,
4598,
4599,
5031,
5032,
5212,
5213,
5217,
5219,
5259,
5276,
5278,
5279,
5382,
5383,
5387,
5389,
5413,
5434,
5474,
5495,
5497,
5498,
5831,
5832,
5878,
5879,
5903,
5904,
5953,
6010,
6076,
6145,
6201,
6243,
6258,
6260,
6261,
6310,
6367,
6405,
6407,
6473,
6553,
6609,
6655,
6670,
6672,
6673,
6693,
6694,
6748,
6824,
6846,
6848,
6903,
6911,
6917,
6961,
6967,
6969,
6970,
6996,
6997,
7055,
7103,
7105,
7135,
7141,
7186,
7215,
7221,
7223,
7224,
7235,
7236,
7631,
7632,
7640,
7641,
7680,
7681,
7689,
7690,
7808,
7809,
7815,
7816,
7833,
7834,
7845,
7873,
7901,
8019,
8020,
8053,
8054,
8079,
8080,
8082,
8102,
8124,
8153,
8177,
8201,
8232,
8262,
8283,
8311,
8343,
8368,
8400,
8421,
8446,
8478,
8505,
8535,
8572,
8599,
8627,
8659,
8690,
8714,
8745,
8776,
8807,
8845,
8861,
8893,
8932,
9001,
9002,
9206,
9207,
9232,
9259,
9290,
9318,
9344,
9377,
9406,
9434,
9466,
9467,
9614,
9615,
9726,
9727,
9773,
9821,
9858,
9909
],
"line_end_idx": [
35,
70,
105,
106,
140,
141,
174,
185,
220,
285,
286,
304,
305,
318,
319,
625,
626,
908,
909,
1246,
1247,
1258,
1259,
1588,
1589,
1608,
1609,
1805,
1806,
1844,
1846,
1878,
1915,
1921,
1988,
2055,
2098,
2104,
2105,
2311,
2312,
2701,
2702,
2717,
2718,
2849,
2850,
3005,
3006,
3012,
3013,
3336,
3337,
3521,
3522,
3543,
3544,
3631,
3632,
3676,
3719,
3763,
3816,
3874,
3948,
3972,
3974,
4025,
4027,
4065,
4066,
4083,
4085,
4133,
4160,
4209,
4251,
4278,
4315,
4369,
4371,
4372,
4575,
4576,
4598,
4599,
5031,
5032,
5212,
5213,
5217,
5219,
5259,
5276,
5278,
5279,
5382,
5383,
5387,
5389,
5413,
5434,
5474,
5495,
5497,
5498,
5831,
5832,
5878,
5879,
5903,
5904,
5953,
6010,
6076,
6145,
6201,
6243,
6258,
6260,
6261,
6310,
6367,
6405,
6407,
6473,
6553,
6609,
6655,
6670,
6672,
6673,
6693,
6694,
6748,
6824,
6846,
6848,
6903,
6911,
6917,
6961,
6967,
6969,
6970,
6996,
6997,
7055,
7103,
7105,
7135,
7141,
7186,
7215,
7221,
7223,
7224,
7235,
7236,
7631,
7632,
7640,
7641,
7680,
7681,
7689,
7690,
7808,
7809,
7815,
7816,
7833,
7834,
7845,
7873,
7901,
8019,
8020,
8053,
8054,
8079,
8080,
8082,
8102,
8124,
8153,
8177,
8201,
8232,
8262,
8283,
8311,
8343,
8368,
8400,
8421,
8446,
8478,
8505,
8535,
8572,
8599,
8627,
8659,
8690,
8714,
8745,
8776,
8807,
8845,
8861,
8893,
8932,
9001,
9002,
9206,
9207,
9232,
9259,
9290,
9318,
9344,
9377,
9406,
9434,
9466,
9467,
9614,
9615,
9726,
9727,
9773,
9821,
9858,
9909,
9930
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9930,
"ccnet_original_nlines": 235,
"rps_doc_curly_bracket": 0.0031218500807881355,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2898772954940796,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013292429968714714,
"rps_doc_frac_lines_end_with_ellipsis": 0.004237290006130934,
"rps_doc_frac_no_alph_words": 0.2965235114097595,
"rps_doc_frac_unique_words": 0.42524418234825134,
"rps_doc_mean_word_length": 5.761833190917969,
"rps_doc_num_sentences": 99,
"rps_doc_symbol_to_word_ratio": 0.0005112499929964542,
"rps_doc_unigram_entropy": 5.720095634460449,
"rps_doc_word_count": 1331,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0850175991654396,
"rps_doc_frac_chars_dupe_6grams": 0.05111487954854965,
"rps_doc_frac_chars_dupe_7grams": 0.044855911284685135,
"rps_doc_frac_chars_dupe_8grams": 0.020602429285645485,
"rps_doc_frac_chars_dupe_9grams": 0.020602429285645485,
"rps_doc_frac_chars_top_2gram": 0.005215799901634455,
"rps_doc_frac_chars_top_3gram": 0.008345290087163448,
"rps_doc_frac_chars_top_4gram": 0.005085410084575415,
"rps_doc_books_importance": -734.699462890625,
"rps_doc_books_importance_length_correction": -734.699462890625,
"rps_doc_openwebtext_importance": -457.0580749511719,
"rps_doc_openwebtext_importance_length_correction": -457.0580749511719,
"rps_doc_wikipedia_importance": -393.6861877441406,
"rps_doc_wikipedia_importance_length_correction": -393.6861877441406
},
"fasttext": {
"dclm": 0.12216628342866898,
"english": 0.8008778095245361,
"fineweb_edu_approx": 2.130413293838501,
"eai_general_math": 0.2649490237236023,
"eai_open_web_math": 0.27606791257858276,
"eai_web_code": 0.004186210222542286
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.367",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,979,195,224,270,610,400 |
[ESX] Kuana_Garage 3.0 (make your garage system more realistic)
Someone fix for errors?
Screenshot_1
ESX.UI.Menu.Open(
'default', GetCurrentResourceName(), 'spawn_vehiclereload',
{
title = _U('garage'),
align = 'top-left',
elements = elements,
},
function(data, menu)
-- Citizen.Wait(50)
for i=1, #veh, 1 do
if veh then
local vehiclePropsn = ESX.Game.GetVehicleProperties(veh[i])
-- do whatever threw the err
if vehiclePropsn ~= nil and data.current.value.plate ~= nil then
if vehiclePropsn.plate == data.current.value.plate then
podespawn = false
break
else
podespawn = true
end
else
podespawn = true
end
tend
-- return nil
end
Hey @KUANA do you know anything about make this work with this extended?
boas desculpa o mau ingles , mas ja sabes alguma coisa me colocar isto a funcionar com o novo extended , sem utilizar o essentialmode?
é que estou com um problema , quando faco o /garagem nao aparece os carros e esta tudo correcto , sao meus (estao na BD) nao da erros ao comprar
Help. I have no vehicles in my garage when i open the garage. there are 2 vehicles in the database but can’t see them in my garage
Where is the player deleted the vehicle when he leaves the game to function?
The /procarro command does not work. As shown in the video, the menu does not appear. I have a police job, but the menu does not appear and there are no errors on the console. Other functions will work. Help.
hello guys! so if i want to trigger the garage menu in a interact menu. how would i go to make it?
im kinda noobie to lua so i would love and highly appreciate the help!
regards jakob
‘scrollIntoView’ error should be fixed with this Pull Request
Hey, I managed to make everything work so i’ll try to help you guys.
The first thing i did was to modify the sql file “kuana.sql”
CREATE TABLE IF NOT EXISTS owned_vehicles (
owner varchar(40) NOT NULL,
plate varchar(12) NOT NULL,
vehicle longtext,
type VARCHAR(20) NOT NULL DEFAULT ‘car’,
job VARCHAR(20) NULL DEFAULT NULL,
stored TINYINT NOT NULL DEFAULT ‘0’,
state tinyint(1) NOT NULL DEFAULT ‘0’ COMMENT ‘State of the car’,
x varchar(255) CHARACTER SET utf8mb4 COLLATE utf8mb4_bin DEFAULT ‘0’,
y varchar(255) CHARACTER SET utf8mb4 COLLATE utf8mb4_bin DEFAULT ‘0’,
z varchar(255) CHARACTER SET utf8mb4 COLLATE utf8mb4_bin DEFAULT ‘0’,
h varchar(255) CHARACTER SET utf8mb4 COLLATE utf8mb4_bin DEFAULT ‘0’,
health int(11) DEFAULT ‘0’,
nitro varchar(50) NOT NULL DEFAULT ‘nao’,
lockcheck varchar(50) NOT NULL DEFAULT ‘nao’,
lastid int(20) DEFAULT NULL,
PRIMARY KEY (plate)
) ENGINE=InnoDB DEFAULT CHARSET=latin1;
This is how mine looks. You’re gonna have to import it in your database and delete the previous “owned_vehicles” (in your database) if you have one. (You probably do if you installed ESX_Vehicleshop)
I’ve done this cos I think the original SQL file messes up the order of the columns, resulting in the vehicleshop script acting weird.
The second thing i did was to replace the ESX.UI.Menu.Open code so it looks like this:(You can find it on Kuana_Garage/client.lua Line: 749)
ESX.UI.Menu.Open(
‘default’, GetCurrentResourceName(), ‘spawn_vehiclereload’,
{
title = _U('Veicoli'),
align = 'top-left',
elements = elements,
},
function(data, menu)
-- Citizen.Wait(50)
for i=1, #veh, 1 do
if veh then
local vehiclePropsn = ESX.Game.GetVehicleProperties(veh[i])
-- do whatever threw the err
if vehiclePropsn ~= nil and data.current.value.plate ~= nil then
if vehiclePropsn.plate == data.current.value.plate then
podespawn = false
break
else
podespawn = true
end
else
podespawn = true
end
end
-- return nil
end
It continues with if podespawn == true then
ESX.TriggerServerCallback… and so on (so you get a reference on where to put it)
The last thing i did, I went on the Server/main.lua of ESX_VehicleShop and added this
RegisterServerEvent(‘carshop:setVehicleOwned’)
AddEventHandler(‘carshop:setVehicleOwned’, function (vehicleProps)
local _source = source
local xPlayer = ESX.GetPlayerFromId(_source)
MySQL.Async.execute('INSERT INTO owned_vehicles (owner, plate, vehicle, x, y, z, h, health) VALUES (@owner, @plate, @vehicle, @xx, @yy, @zz, @hh, @vida)',
{
['@owner'] = xPlayer.identifier,
['@plate'] = vehicleProps.plate,
['@vehicle'] = json.encode(vehicleProps),
["@xx"] = -245.86,
["@yy"] = 6257.2,
["@zz"] = 31.09,
["@hh"] = 223.97,
["@vida"] = 1000
}, function (rowsChanged)
TriggerClientEvent('esx:showNotification', _source, "O Carro com a matricula ~y~"..vehicleProps.plate.."~w~ foi lhe ~g~entregue~w~.")
end)
end)
Right before the function “Pay Rent”
For me these steps worked, and the script is running like a champ.
If you have any issues feel free to message me or reply here, i’ll try my best to help.
NOTE: Im not a scripter/programmer of any sort, im just a normal dude that tries things with a bit of logic to make them work, so don’t expect me to know everything!
1 Like
My only problem with this script is with the search command … I typed the plate number correctly and it wont show me the menu … I even fixed the menu wont scroll\opens right, and i still cant search for car
can someone help me with this problem ?
The only thing i could think of is: It only works with purchased vehicles from the vehicleshop. Are you sure you input the correct plate (and by correct i mean adding spaces and caps letters)?
Cos it works fine for me
Also you could try to see if any errors display in the F8 menu (after you search for the plate)
|
{
"url": "https://forum.cfx.re/t/esx-kuana-garage-3-0-make-your-garage-system-more-realistic/996140?page=5",
"source_domain": "forum.cfx.re",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "39786",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5GTHZCXY2JQSXGRBPDVRF7XRKKIHPDQM",
"WARC-Concurrent-To": "<urn:uuid:50580188-407f-450d-8f66-d26e5b93afbb>",
"WARC-Date": "2020-11-24T16:01:35Z",
"WARC-IP-Address": "104.18.26.120",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CMFGHE6EY5L7LCDHHZZK4PCPAYZIW262",
"WARC-Record-ID": "<urn:uuid:4d9fa2c6-cdd8-4054-9246-50fcac78bbe7>",
"WARC-Target-URI": "https://forum.cfx.re/t/esx-kuana-garage-3-0-make-your-garage-system-more-realistic/996140?page=5",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f5659f93-05e6-4ee2-abbe-7c3b89beb7d1>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-27.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
64,
65,
89,
102,
103,
121,
122,
190,
191,
201,
202,
239,
240,
275,
276,
309,
310,
321,
322,
331,
332,
361,
362,
391,
392,
428,
429,
461,
462,
547,
548,
569,
570,
627,
628,
713,
714,
794,
795,
841,
842,
876,
877,
906,
907,
952,
953,
981,
982,
1007,
1008,
1049,
1050,
1074,
1075,
1096,
1097,
1124,
1125,
1137,
1138,
1211,
1212,
1347,
1492,
1493,
1624,
1625,
1702,
1703,
1912,
1913,
2012,
2013,
2084,
2085,
2099,
2100,
2162,
2163,
2232,
2233,
2294,
2295,
2339,
2367,
2395,
2413,
2454,
2489,
2526,
2592,
2662,
2732,
2802,
2872,
2900,
2942,
2988,
3017,
3037,
3077,
3078,
3278,
3279,
3414,
3415,
3556,
3557,
3575,
3635,
3636,
3642,
3643,
3677,
3678,
3709,
3710,
3739,
3740,
3747,
3748,
3753,
3754,
3779,
3780,
3805,
3806,
3838,
3839,
3867,
3868,
3949,
3950,
3967,
3968,
4021,
4022,
4103,
4104,
4180,
4181,
4223,
4224,
4254,
4255,
4280,
4281,
4322,
4323,
4347,
4348,
4369,
4370,
4407,
4408,
4428,
4429,
4445,
4446,
4469,
4470,
4478,
4479,
4523,
4604,
4605,
4691,
4692,
4739,
4806,
4829,
4874,
4875,
5030,
5032,
5068,
5104,
5147,
5167,
5186,
5204,
5223,
5241,
5267,
5402,
5407,
5408,
5413,
5414,
5451,
5452,
5519,
5607,
5608,
5774,
5775,
5782,
5783,
5990,
5991,
6031,
6032,
6225,
6226,
6251,
6252
],
"line_end_idx": [
64,
65,
89,
102,
103,
121,
122,
190,
191,
201,
202,
239,
240,
275,
276,
309,
310,
321,
322,
331,
332,
361,
362,
391,
392,
428,
429,
461,
462,
547,
548,
569,
570,
627,
628,
713,
714,
794,
795,
841,
842,
876,
877,
906,
907,
952,
953,
981,
982,
1007,
1008,
1049,
1050,
1074,
1075,
1096,
1097,
1124,
1125,
1137,
1138,
1211,
1212,
1347,
1492,
1493,
1624,
1625,
1702,
1703,
1912,
1913,
2012,
2013,
2084,
2085,
2099,
2100,
2162,
2163,
2232,
2233,
2294,
2295,
2339,
2367,
2395,
2413,
2454,
2489,
2526,
2592,
2662,
2732,
2802,
2872,
2900,
2942,
2988,
3017,
3037,
3077,
3078,
3278,
3279,
3414,
3415,
3556,
3557,
3575,
3635,
3636,
3642,
3643,
3677,
3678,
3709,
3710,
3739,
3740,
3747,
3748,
3753,
3754,
3779,
3780,
3805,
3806,
3838,
3839,
3867,
3868,
3949,
3950,
3967,
3968,
4021,
4022,
4103,
4104,
4180,
4181,
4223,
4224,
4254,
4255,
4280,
4281,
4322,
4323,
4347,
4348,
4369,
4370,
4407,
4408,
4428,
4429,
4445,
4446,
4469,
4470,
4478,
4479,
4523,
4604,
4605,
4691,
4692,
4739,
4806,
4829,
4874,
4875,
5030,
5032,
5068,
5104,
5147,
5167,
5186,
5204,
5223,
5241,
5267,
5402,
5407,
5408,
5413,
5414,
5451,
5452,
5519,
5607,
5608,
5774,
5775,
5782,
5783,
5990,
5991,
6031,
6032,
6225,
6226,
6251,
6252,
6347
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6347,
"ccnet_original_nlines": 207,
"rps_doc_curly_bracket": 0.0009453300153836608,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2629070580005646,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06751389801502228,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.316123902797699,
"rps_doc_frac_unique_words": 0.46029776334762573,
"rps_doc_mean_word_length": 5.124069690704346,
"rps_doc_num_sentences": 74,
"rps_doc_symbol_to_word_ratio": 0.003971409983932972,
"rps_doc_unigram_entropy": 5.467268466949463,
"rps_doc_word_count": 806,
"rps_doc_frac_chars_dupe_10grams": 0.1452784538269043,
"rps_doc_frac_chars_dupe_5grams": 0.22953994572162628,
"rps_doc_frac_chars_dupe_6grams": 0.19951574504375458,
"rps_doc_frac_chars_dupe_7grams": 0.19951574504375458,
"rps_doc_frac_chars_dupe_8grams": 0.19951574504375458,
"rps_doc_frac_chars_dupe_9grams": 0.1452784538269043,
"rps_doc_frac_chars_top_2gram": 0.011864409781992435,
"rps_doc_frac_chars_top_3gram": 0.01694915071129799,
"rps_doc_frac_chars_top_4gram": 0.019370460882782936,
"rps_doc_books_importance": -629.0132446289062,
"rps_doc_books_importance_length_correction": -629.0132446289062,
"rps_doc_openwebtext_importance": -339.5185546875,
"rps_doc_openwebtext_importance_length_correction": -339.5185546875,
"rps_doc_wikipedia_importance": -223.29571533203125,
"rps_doc_wikipedia_importance_length_correction": -223.29571533203125
},
"fasttext": {
"dclm": 0.29799920320510864,
"english": 0.693426251411438,
"fineweb_edu_approx": 1.293312668800354,
"eai_general_math": 0.7510387301445007,
"eai_open_web_math": 0.5038173794746399,
"eai_web_code": 0.520974338054657
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,803,801,644,048,244,000 |
How to Ping a Phone And Find It Easily in 2023
Pinging a phone is a useful technique for determining the location of a mobile phone.
Whether you’ve misplaced your own device or want to keep tabs on a loved one, knowing how to ping a phone can be invaluable. In this article, we’ll explore various methods to achieve this.
How To Ping A Phone iPhone Android Mobile
We’ll discuss built in features, third party applications, and command prompt techniques to locate a cell phone. Keep in mind the legal and privacy considerations when attempting to ping someone else’s phone.
Using Built in Phone Features
To ping a phone and determine its location, you can use the built in features of mobile devices. Both Android and iOS have native tools that can help you locate a lost or stolen phone.
Let’s explore these features for each operating system.
Android devices
Using the built in features of Android devices can help you locate your phone when it’s misplaced or lost.
Android offers a few different ways to ping a phone, including Google maps and Android Device Manager.
a. Google Maps
Google Maps is a popular application for finding directions and exploring new places. However, it can also be used to locate your Android phone.
To do this, sign it to the same Google account on both your phone and a computer or another device.
Use Google Maps to find your Android phone
Open Google maps and click on the profile icon in the top right corner.
Select Your Timeline to see the last known location of your device.
b. Android Device Manager
The Android Device Manager is another useful tool for finding lost Android phone.
This feature allows you to remotely locate, lock, or erase your device.
To use it, sign in to the same Google account on another device or computer and visit the Android Device Manager website.
Google Find My Device - Android Device Manager
From there, you can view the phone’s location on a map and take appropriate actions to secure or recover it.
iOS devices
Apple iOS devices also come with built in features that can help you locate your missing iPhone or iPad.
a. Find My iPhone
Find My iPhone is a native app available on iOS devices, allowing you to track the location of your iPhone or iPad.
To use this feature, you need to have Find My iPhone enabled on our device and be signed in to your iCloud account.
iOS Find My iPhone app
From another iOS device or computer, sign in to iCloud.com/find or use Find My app to locate your device on a map.
You can remotely lock or erase your iPhone if needed.
b. Location services
This is a feature on iOS devices that enables various apps, including Find my iPhone, to access the device’s location.
To ensure that you can locate your lost iPhone, make sure Location Services is enabled in the Settings menu under Privacy.
this will allow the Find My iPhone app to access your device’s location and help you recover it if it goes missing.
Third Part Applications and Services
Apart from using built in features on your mobile devices, there are numerous third party applications and services that can help you ping a cell phone and determine its location.
These range from GPS tracking software to ping apps and websites.
GPS tracking software
GPS tracking software can assist in locating a lost or stolen phone by using the location and gps data provided by the device.
There are several apps available for both Android and iOS devices.
Installing and using tracking apps
To use a tracking app, you’ll need to download and install it on the mobile phone you wish to track.
most apps require access to the device’s cell phone location data and may need additional permissions, such as access to contacts and other phone features.
Always check the app’s privacy policy and user reviews before installing to ensure it’s safe and reliable.
Once installed, you can use the app to ping the phone remotely and view its location on a map.
Service provider limitations
Keep in mind that some tracking apps may only work with specific cell phone providers or in certain regions.
Additionally, using a tracking app without the owner’s consent may be illegal in some jurisdictions.
It’s essential to respect privacy laws and only use tracking apps for legitimate purposes, such as locating a lost or stolen phone.
Ping apps and websites
Ping apps and websites offer another way to locate a cell phone using the device’s network connection.
These services can help you find a phone by sending a ping request to its network interface.
Using a ping app
A ping app typically works by sending data packets to a mobile phone user’s device, causing it to respond with its location.
To use an app, you’ll need to install it on the device you wish to track or enter the phone number into the app or website.
Once the app sends a ping to the target phone, it will display the cell phone location on a map.
Keep in mind that the accuracy of these apps may vary, and the cell phone provider or mobile phone towers may affect the results.
Websites for pinging phones
Some websites allow you to ping a phone by simply entering the phone number.
These sites use similar methods to ping apps, sending a request to the phone’s network interface and returning the location information.
While these services can be helpful in finding a lost or stolen phone, they may not always provide accurate location data.
Additionally, using such websites without the owner’s consent could be considered a violation of privacy laws.
When using third party applications and services, always prioritize the privacy and security of the device owner.
These tools can be helpful in recovering lost or stolen phones, but it’s essential to use them responsibly and legally.
Command Prompt and Network Utility
Command prompt and Network utilities offer alternative methods for pinging a phone.
Keep in mind that these methods might not be as accurate as using a built in phone features or third party apps.
Windows command prompt
Windows command prompt allows you to send a ping to a cell phone using its IP address.
However, this method has some limitations and might not always provide the person’s exact location.
Pinging using IP address
To ping a phone using its IP address, opent he Command Prompt and type “ping” followed by the phone’s IP address.
Pres Enter and the command will send data packets to the phone, requesting a response.
Limitations and considerations
It’s essential to know that pinging a phone using its IP address requires the cell phone to be connected to the same IP network as your computer.
In addition, this method might not work if the phone carrier or internet provider has implemented firewalls or restrictions.
Network utilities for Mac and Linux
For Mac and Linux users, similar tools are available, such as Terminal commands and utility tools.
Terminal commands
Mac and Linux users can use the Terminal application to send a ping request to a mobile device.
Similar to the Windows Command Prompt, type “ping” followed by the phone’s IP address and press Enter.
Network utility tools
Various network utilities can help you ping a phone on Mack and Linux systems.
However, these tools also have limitations, and you might need the phone connects to the same network as your computer for them to work effectively.
When attempting to ping a phone, it’s crucial to consider the legal and privacy aspects of it all.
From legal access and restrictions to privacy and security, understanding these factors is essential to avoid potential legal issues or unintended privacy breaches.
Pinging a phone involves accessing location data, which is subject to legal restrictions and varies depending on the jurisdiction and involves parties.
Law enforcement agencies
Law enforcement agencies often have the authority to ping a phone when investigating a crime, searching for a missing phone, or responding to emergencies.
they typically have access to tools and resources unavailable to general public and work closely with phone companies and service providers to access cell phone location data.
In some cases, they may even have the ability to remotely activate a phone’s GPS to track its location.
Service provider policies
Service provider policies vary when it comes to switching providers and accessing location data.
Some providers may allow access under specific circumstances, such as emergencies or when legally required.
Phone company cooperation is often required wen law enforcement needs to locate a phone.
As a mobile phone user, it’s essential to understand your service provider’s policies regarding location data.
Privacy and security
Privacy and security concerns are paramount when attempting to ping a phone.
Protecting personal data and avoiding unauthorized access are essential steps to safeguard against potential abuse or misuse of location information.
Protecting personal data
Location software can track and store sensitive information, such as location history and personal details.
It’s crucial to use reputable and secure software to ensure that your data remains protected.
If you’re using Android phones or iOS devices, only grant android or ios credentials to trusted apps and services.
Mobile Phone Privacy and Security
Regularly reviewing your device’s privacy settings ad disabling unnecessary location access can also help protect your personal data.
Avoiding unauthorized access
Unauthorized access to a phone’s location can have severe consequences, ranging from privacy invasion to stalking or theft.
To prevent unauthorized access, ensure that your wireless router and devices are secure and use strong passwords.
Be cautious when sharing your machine’s ip address or other identifying information.
Additionally, be aware of service station operators of third parties offering to help locate your phone, as they may not have the legal authority or necessary safeguards in place to protect your data.
Rely on your phone provider, company or authorized apps and services to assist with locating a lost or stolen device.
It’s important to remember that pinging a phone should be done responsibly and within the confines of the law.
As a mobile phone user, be aware of the legal and privacy considerations involved and take the necessary precautions to protect your own phone and the phones of others.
Final Word
In summary, pinging a phone can be a valuable tool for locating devices and ensuring the safety of loved ones.
However, it’s crucial to consider the legal and privacy implications before using this technique.
By understanding the laws, adhering to service policies, and prioritizing data security, you can utilize phone pinging responsibly and ethically while safeguarding personal information and privacy.
Share on Social Media
|
{
"url": "https://www.melodyloops.com/blog/ping-a-phone/",
"source_domain": "www.melodyloops.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "79300",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HPWCLAGEQLVWHXIDMNILYDMWJTKHOIHL",
"WARC-Concurrent-To": "<urn:uuid:99d7dd63-959c-4cb9-9ee9-d34401cbd8ee>",
"WARC-Date": "2023-05-30T15:21:14Z",
"WARC-IP-Address": "104.254.130.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X6MUI2JK3IYRA47JSFIKBHRO4SPO3BUG",
"WARC-Record-ID": "<urn:uuid:79add5cc-3ecb-4917-9b84-012bb56a064f>",
"WARC-Target-URI": "https://www.melodyloops.com/blog/ping-a-phone/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3caca13b-3574-4038-aa73-cd06afaa4390>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-180\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,
134,
135,
324,
325,
367,
368,
577,
578,
608,
609,
794,
795,
851,
852,
868,
869,
976,
977,
1080,
1081,
1096,
1097,
1242,
1243,
1343,
1344,
1387,
1388,
1460,
1461,
1529,
1530,
1556,
1557,
1639,
1640,
1712,
1713,
1835,
1836,
1883,
1884,
1993,
1994,
2006,
2007,
2112,
2113,
2131,
2132,
2248,
2249,
2365,
2366,
2389,
2390,
2505,
2506,
2560,
2561,
2582,
2583,
2702,
2703,
2826,
2827,
2943,
2944,
2981,
2982,
3162,
3163,
3229,
3230,
3252,
3253,
3380,
3381,
3448,
3449,
3484,
3485,
3586,
3587,
3743,
3744,
3851,
3852,
3947,
3948,
3977,
3978,
4087,
4088,
4189,
4190,
4322,
4323,
4346,
4347,
4450,
4451,
4544,
4545,
4562,
4563,
4688,
4689,
4813,
4814,
4911,
4912,
5042,
5043,
5071,
5072,
5149,
5150,
5287,
5288,
5411,
5412,
5523,
5524,
5638,
5639,
5759,
5760,
5795,
5796,
5880,
5881,
5994,
5995,
6018,
6019,
6106,
6107,
6207,
6208,
6233,
6234,
6348,
6349,
6436,
6437,
6468,
6469,
6615,
6616,
6741,
6742,
6778,
6779,
6878,
6879,
6897,
6898,
6994,
6995,
7098,
7099,
7121,
7122,
7201,
7202,
7351,
7352,
7451,
7452,
7617,
7618,
7770,
7771,
7796,
7797,
7952,
7953,
8129,
8130,
8234,
8235,
8261,
8262,
8359,
8360,
8468,
8469,
8558,
8559,
8670,
8671,
8692,
8693,
8770,
8771,
8921,
8922,
8947,
8948,
9056,
9057,
9151,
9152,
9267,
9268,
9302,
9303,
9437,
9438,
9467,
9468,
9592,
9593,
9707,
9708,
9793,
9794,
9995,
9996,
10114,
10115,
10226,
10227,
10396,
10397,
10408,
10409,
10520,
10521,
10619,
10620,
10818,
10819
],
"line_end_idx": [
47,
48,
134,
135,
324,
325,
367,
368,
577,
578,
608,
609,
794,
795,
851,
852,
868,
869,
976,
977,
1080,
1081,
1096,
1097,
1242,
1243,
1343,
1344,
1387,
1388,
1460,
1461,
1529,
1530,
1556,
1557,
1639,
1640,
1712,
1713,
1835,
1836,
1883,
1884,
1993,
1994,
2006,
2007,
2112,
2113,
2131,
2132,
2248,
2249,
2365,
2366,
2389,
2390,
2505,
2506,
2560,
2561,
2582,
2583,
2702,
2703,
2826,
2827,
2943,
2944,
2981,
2982,
3162,
3163,
3229,
3230,
3252,
3253,
3380,
3381,
3448,
3449,
3484,
3485,
3586,
3587,
3743,
3744,
3851,
3852,
3947,
3948,
3977,
3978,
4087,
4088,
4189,
4190,
4322,
4323,
4346,
4347,
4450,
4451,
4544,
4545,
4562,
4563,
4688,
4689,
4813,
4814,
4911,
4912,
5042,
5043,
5071,
5072,
5149,
5150,
5287,
5288,
5411,
5412,
5523,
5524,
5638,
5639,
5759,
5760,
5795,
5796,
5880,
5881,
5994,
5995,
6018,
6019,
6106,
6107,
6207,
6208,
6233,
6234,
6348,
6349,
6436,
6437,
6468,
6469,
6615,
6616,
6741,
6742,
6778,
6779,
6878,
6879,
6897,
6898,
6994,
6995,
7098,
7099,
7121,
7122,
7201,
7202,
7351,
7352,
7451,
7452,
7617,
7618,
7770,
7771,
7796,
7797,
7952,
7953,
8129,
8130,
8234,
8235,
8261,
8262,
8359,
8360,
8468,
8469,
8558,
8559,
8670,
8671,
8692,
8693,
8770,
8771,
8921,
8922,
8947,
8948,
9056,
9057,
9151,
9152,
9267,
9268,
9302,
9303,
9437,
9438,
9467,
9468,
9592,
9593,
9707,
9708,
9793,
9794,
9995,
9996,
10114,
10115,
10226,
10227,
10396,
10397,
10408,
10409,
10520,
10521,
10619,
10620,
10818,
10819,
10840
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10840,
"ccnet_original_nlines": 236,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39722636342048645,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0064388299360871315,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09905894100666046,
"rps_doc_frac_unique_words": 0.2530864179134369,
"rps_doc_mean_word_length": 4.927609443664551,
"rps_doc_num_sentences": 95,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.246030330657959,
"rps_doc_word_count": 1782,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10021638125181198,
"rps_doc_frac_chars_dupe_6grams": 0.04031430929899216,
"rps_doc_frac_chars_dupe_7grams": 0.017765630036592484,
"rps_doc_frac_chars_dupe_8grams": 0.017765630036592484,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012982579879462719,
"rps_doc_frac_chars_top_3gram": 0.012527050450444221,
"rps_doc_frac_chars_top_4gram": 0.01366586983203888,
"rps_doc_books_importance": -964.5625610351562,
"rps_doc_books_importance_length_correction": -964.5625610351562,
"rps_doc_openwebtext_importance": -452.0278625488281,
"rps_doc_openwebtext_importance_length_correction": -452.0278625488281,
"rps_doc_wikipedia_importance": -444.987548828125,
"rps_doc_wikipedia_importance_length_correction": -444.987548828125
},
"fasttext": {
"dclm": 0.2563208341598511,
"english": 0.9134342074394226,
"fineweb_edu_approx": 2.261669874191284,
"eai_general_math": 0.0016950999852269888,
"eai_open_web_math": 0.015884580090641975,
"eai_web_code": 0.14084774255752563
}
}
|
{
"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": "343.73",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Criminal law"
}
}
},
"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": "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
|
6,527,516,144,491,113,000 |
Skip to main content
Python extension wrapping the ICU C++ API
Project description
README file for PyICU
---------------------
Contents
--------
- Welcome
- Building PyICU
- Running PyICU
- What's available
- API Documentation
Welcome
-------
Welcome to PyICU, a Python extension wrapping IBM's International
Components for Unicode C++ library (ICU).
PyICU is a project maintained by the Open Source Applications Foundation.
IBM's ICU homepage is: http://www-306.ibm.com/software/globalization/icu/
Building PyICU
--------------
Before building PyICU the ICU 3.6 or 3.8 libraries must be built and
installed. Refer to each system's instructions for more information.
As of version 0.5 PyICU no longer uses SWIG.
As of version 0.8 PyICU is built with distutils or setuptools:
- verify that the INCLUDES, LFLAGS, CFLAGS and LIBRARIES dictionaries in
setup.py contain correct values for your platform
- python setup.py build
- sudo python setup.py install
Running PyICU
-------------
. Mac OS X
Make sure that DYLD_LIBRARY_PATH contains paths to the directory(ies)
containing the ICU libs.
. Linux
Make sure that LD_LIBRARY_PATH contains paths to the directory(ies)
containing the ICU libs or that you added the corresponding -rpath
argument to LFLAGS.
. Windows
Make sure that PATH contains paths to the directory(ies)
containing the ICU DLLs.
What's available
----------------
PyICU is under active development. Currently, the string, locale, format,
calendar, timezone, charset and various iterator classes are available.
See the CHANGES file for an up to date log of changes and additions.
API Documentation
-----------------
At the moment, there is no API documentation for PyICU. The API for ICU is
documented at http://icu.sourceforge.net/apiref/icu4c/ and the following
patterns can be used to translate from the C++ APIs to the corresponding
Python APIs.
- strings
The ICU string type, UnicodeString, is a type pointing at a mutable
array of UChar Unicode 16-bit wide characters. The Python unicode type
is an immutable string of 16-bit or 32-bit wide Unicode characters.
Because of these differences, UnicodeString and Python's unicode type
are not merged into the same type when crossing the C++ boundary.
ICU APIs taking UnicodeString arguments have been overloaded to also
accept Python str or unicode type arguments. In the case of str objects,
utf-8 encoding is assumed when converting them to UnicodeString
objects.
To convert a Python str encoded in a encoding other than utf-8 to an ICU
UnicodeString use the UnicodeString(str, encodingName) constructor.
ICU's C++ APIs accept and return UnicodeString arguments in several
ways: by value, by pointer or by reference.
When an ICU C++ API is documented to accept a UnicodeString & parameter,
it is safe to assume that there are several corresponding PyICU python
APIs making it accessible in simpler ways:
For example, the 'UnicodeString &Locale::getDisplayName(UnicodeString &)'
API, documented here:
http://icu.sourceforge.net/apiref/icu4c/classLocale.html#a19
can be invoked from Python in several ways:
1. The ICU way
>>> from PyICU import UnicodeString, Locale
>>> locale = Locale('pt_BR')
>>> string = UnicodeString()
>>> name = locale.getDisplayName(string)
>>> name
<UnicodeString: Portuguese (Brazil)>
>>> name is string
True <-- string arg was returned, modified in place
2. The Python way
>>> from PyICU import Locale
>>> locale = Locale('pt_BR')
>>> name = locale.getDisplayName()
>>> name
<UnicodeString: Portuguese (Brazil)>
A UnicodeString object was allocated for Python and returned.
A UnicodeString can be coerced to a Python unicode string with Python's
unicode() constructor. The usual len(), str(), comparison, [] and [:]
operators are all available, with the additional twists that slicing is
not read-only and that += is also available since a UnicodeString is
mutable. For example:
>>> name = locale.getDisplayName()
<UnicodeString: Portuguese (Brazil)>
>>> unicode(name)
u'Portuguese (Brazil)'
>>> len(name)
19
>>> str(name) <-- works when chars fit with default encoding
'Portuguese (Brazil)'
>>> name[3]
u't'
>>> name[12:18]
<UnicodeString: Brazil>
>>> name[12:18] = 'the country of Brasil'
>>> name
<UnicodeString: Portuguese (the country of Brasil)>
>>> name += ' oh joy'
>>> name
<UnicodeString: Portuguese (the country of Brasil) oh joy>
- error reporting
The C++ ICU library does not use C++ exceptions to report errors. ICU
C++ APIs return errors via a UErrorCode reference argument. All such
APIs are wrapped by Python APIs that omit this argument and throw an
ICUError Python exception instead. The same is true for ICU APIs taking
both a ParseError and a UErrorCode, they are both to be omitted.
For example, the 'UnicodeString &DateFormat::format(const Formattable &,
UnicodeString &, UErrorCode &)' API, documented here
http://icu.sourceforge.net/apiref/icu4c/classDateFormat.html#a6
is invoked from Python with:
>>> from PyICU import DateFormat, Formattable
>>> df = DateFormat.createInstance()
>>> df
<SimpleDateFormat: M/d/yy h:mm a>
>>> f = Formattable(940284258.0, Formattable.kIsDate)
>>> df.format(f)
<UnicodeString: 10/18/99 3:04 PM>
Of course, the simpler 'UnicodeString &DateFormat::format(UDate,
UnicodeString &)' documented here:
http://icu.sourceforge.net/apiref/icu4c/classDateFormat.html#a5
can be used too:
>>> from PyICU import DateFormat
>>> df = DateFormat.createInstance()
>>> df
<SimpleDateFormat: M/d/yy h:mm a>
>>> df.format(940284258.0)
<UnicodeString: 10/18/99 3:04 PM>
- dates
ICU uses a double floating point type called UDate that represents the
number of milliseconds elapsed since 1970-jan-01 UTC for dates.
In Python, the value returned by the time module's time() function is
the number of seconds since 1970-jan-01 UTC. Because of this difference,
floating point values are multiplied by 1000 when passed to APIs taking
UDate and divided by 1000 when returned as UDate.
Python's datetime objects, with or without timezone information, can
also be used with APIs taking UDate arguments. The datetime objects get
converted to UDate when crossing into the C++ layer.
- arrays
Many ICU API take array arguments. A list of elements of the array
element types is to be passed from Python.
- StringEnumeration
An ICU StringEnumeration has three 'next' methods: next() which returns
a 'str' objects, unext() which returns 'unicode' objects and snext()
which returns 'UnicodeString' objects.
Any of these methods can be used as an iterator, using the Python
built-in 'iter' function.
For example, let e be a StringEnumeration instance:
[s for s in e] is a list of 'str' objects
[s for s in iter(e.unext, None)] is a list of 'unicode' objects
[s for s in iter(e.snext, None)] is a list of 'UnicodeString' objects
- timezones
The ICU TimeZone type may be wrapped with an ICUtzinfo type for usage
with Python's datetime type. For example:
tz = ICUtzinfo(TimeZone.createTimeZone('US/Mountain'))
datetime.now(tz)
or, even simpler:
tz = ICUtzinfo.getInstance('Pacific/Fiji')
datetime.now(tz)
To get the default time zone use:
defaultTZ = ICUtzinfo.getDefault()
To get the time zone's id, use the 'tzid' attribute or coerce the time
zone to a string:
ICUtzinfo.getInstance('Pacific/Fiji').tzid -> 'Pacific/Fiji'
str(ICUtzinfo.getInstance('Pacific/Fiji')) -> 'Pacific/Fiji'
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Filename, size & hash SHA256 hash help File type Python version Upload date
PyICU-0.8.1.tar.gz (66.8 kB) Copy SHA256 hash SHA256 Source None
Supported by
Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN SignalFx SignalFx Supporter DigiCert DigiCert EV certificate StatusPage StatusPage Status page
|
{
"url": "https://pypi.org/project/PyICU/0.8.1/",
"source_domain": "pypi.org",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "67336",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KTNPZ7AFKTARS7SLNQH5OBCV27CRPZ3V",
"WARC-Concurrent-To": "<urn:uuid:8c5ab08b-beac-481c-ae9e-5df789410e06>",
"WARC-Date": "2019-03-21T20:58:06Z",
"WARC-IP-Address": "151.101.64.223",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:L352FNBOZPFFAZMDITOFBOIRPYOH44MW",
"WARC-Record-ID": "<urn:uuid:e63305f2-5617-4157-af30-bd8fc71c3a57>",
"WARC-Target-URI": "https://pypi.org/project/PyICU/0.8.1/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:93dc0ae0-dca9-4069-9e5b-edbb92c4228d>"
},
"warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-186-104-161.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
22,
64,
65,
85,
86,
108,
130,
131,
140,
149,
150,
160,
177,
193,
212,
232,
233,
234,
242,
250,
251,
317,
359,
360,
434,
435,
509,
510,
511,
526,
541,
542,
611,
680,
681,
726,
727,
790,
863,
913,
937,
968,
969,
970,
984,
998,
999,
1010,
1080,
1105,
1106,
1114,
1182,
1249,
1269,
1270,
1280,
1337,
1362,
1363,
1364,
1381,
1398,
1399,
1473,
1545,
1614,
1615,
1616,
1634,
1652,
1653,
1728,
1801,
1874,
1887,
1888,
1898,
1899,
1967,
2038,
2106,
2107,
2177,
2243,
2312,
2385,
2449,
2458,
2459,
2532,
2600,
2601,
2669,
2713,
2786,
2857,
2900,
2974,
2996,
3057,
3101,
3102,
3117,
3118,
3162,
3191,
3220,
3261,
3270,
3307,
3326,
3378,
3379,
3397,
3398,
3427,
3456,
3491,
3500,
3537,
3538,
3600,
3601,
3673,
3743,
3815,
3884,
3906,
3907,
3942,
3979,
3997,
4020,
4034,
4037,
4098,
4120,
4132,
4137,
4153,
4177,
4219,
4228,
4280,
4302,
4311,
4370,
4371,
4389,
4390,
4460,
4529,
4598,
4670,
4735,
4736,
4809,
4862,
4926,
4955,
4956,
5002,
5039,
5046,
5080,
5134,
5151,
5185,
5186,
5251,
5286,
5350,
5367,
5368,
5401,
5438,
5445,
5479,
5506,
5540,
5541,
5549,
5550,
5621,
5685,
5686,
5756,
5829,
5901,
5951,
5952,
6021,
6093,
6146,
6147,
6156,
6157,
6224,
6267,
6268,
6288,
6289,
6361,
6430,
6469,
6535,
6561,
6562,
6614,
6615,
6657,
6721,
6791,
6792,
6804,
6805,
6875,
6917,
6918,
6973,
6990,
6991,
7009,
7010,
7053,
7070,
7071,
7105,
7106,
7141,
7142,
7213,
7231,
7232,
7293,
7354,
7355,
7371,
7372,
7373,
7388,
7389,
7500,
7501,
7577,
7642,
7643,
7656,
7657
],
"line_end_idx": [
21,
22,
64,
65,
85,
86,
108,
130,
131,
140,
149,
150,
160,
177,
193,
212,
232,
233,
234,
242,
250,
251,
317,
359,
360,
434,
435,
509,
510,
511,
526,
541,
542,
611,
680,
681,
726,
727,
790,
863,
913,
937,
968,
969,
970,
984,
998,
999,
1010,
1080,
1105,
1106,
1114,
1182,
1249,
1269,
1270,
1280,
1337,
1362,
1363,
1364,
1381,
1398,
1399,
1473,
1545,
1614,
1615,
1616,
1634,
1652,
1653,
1728,
1801,
1874,
1887,
1888,
1898,
1899,
1967,
2038,
2106,
2107,
2177,
2243,
2312,
2385,
2449,
2458,
2459,
2532,
2600,
2601,
2669,
2713,
2786,
2857,
2900,
2974,
2996,
3057,
3101,
3102,
3117,
3118,
3162,
3191,
3220,
3261,
3270,
3307,
3326,
3378,
3379,
3397,
3398,
3427,
3456,
3491,
3500,
3537,
3538,
3600,
3601,
3673,
3743,
3815,
3884,
3906,
3907,
3942,
3979,
3997,
4020,
4034,
4037,
4098,
4120,
4132,
4137,
4153,
4177,
4219,
4228,
4280,
4302,
4311,
4370,
4371,
4389,
4390,
4460,
4529,
4598,
4670,
4735,
4736,
4809,
4862,
4926,
4955,
4956,
5002,
5039,
5046,
5080,
5134,
5151,
5185,
5186,
5251,
5286,
5350,
5367,
5368,
5401,
5438,
5445,
5479,
5506,
5540,
5541,
5549,
5550,
5621,
5685,
5686,
5756,
5829,
5901,
5951,
5952,
6021,
6093,
6146,
6147,
6156,
6157,
6224,
6267,
6268,
6288,
6289,
6361,
6430,
6469,
6535,
6561,
6562,
6614,
6615,
6657,
6721,
6791,
6792,
6804,
6805,
6875,
6917,
6918,
6973,
6990,
6991,
7009,
7010,
7053,
7070,
7071,
7105,
7106,
7141,
7142,
7213,
7231,
7232,
7293,
7354,
7355,
7371,
7372,
7373,
7388,
7389,
7500,
7501,
7577,
7642,
7643,
7656,
7657,
7921
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7921,
"ccnet_original_nlines": 251,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25347012281417847,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04345202073454857,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3047676384449005,
"rps_doc_frac_unique_words": 0.38403043150901794,
"rps_doc_mean_word_length": 5.728137016296387,
"rps_doc_num_sentences": 88,
"rps_doc_symbol_to_word_ratio": 0.001810500049032271,
"rps_doc_unigram_entropy": 5.408091068267822,
"rps_doc_word_count": 1052,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06903418898582458,
"rps_doc_frac_chars_dupe_6grams": 0.056422170251607895,
"rps_doc_frac_chars_dupe_7grams": 0.056422170251607895,
"rps_doc_frac_chars_dupe_8grams": 0.02422834001481533,
"rps_doc_frac_chars_dupe_9grams": 0.01659476011991501,
"rps_doc_frac_chars_top_2gram": 0.007965479977428913,
"rps_doc_frac_chars_top_3gram": 0.009956849738955498,
"rps_doc_frac_chars_top_4gram": 0.008961169980466366,
"rps_doc_books_importance": -693.9351806640625,
"rps_doc_books_importance_length_correction": -693.9351806640625,
"rps_doc_openwebtext_importance": -461.81732177734375,
"rps_doc_openwebtext_importance_length_correction": -461.81732177734375,
"rps_doc_wikipedia_importance": -350.31683349609375,
"rps_doc_wikipedia_importance_length_correction": -350.31683349609375
},
"fasttext": {
"dclm": 0.490697979927063,
"english": 0.6739231944084167,
"fineweb_edu_approx": 2.967339277267456,
"eai_general_math": 0.485629677772522,
"eai_open_web_math": 0.10280919075012207,
"eai_web_code": 0.9649704098701477
}
}
|
{
"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.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": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
168,494,339,528,804,220 |
How to count number of leap years between two dates in Excel?
In Excel, to count the number of years between two given dates may be easy for most of users, but, can you only count the number of leap years also called intercalary year between two dates? Here I introduce a formula can help you to quickly calculate the number of leap years between a date range in Excel.
Count leap years in a date range with formula
Add Years/Months/Days to Date
To quickly add a specific number of days to a given date, Kutools for Excel's Add Years/Months/Days to Date utilities can give you a favor.
doc add year month day
Office Tab Enable Tabbed Editing and Browsing in Office, and Make Your Work Much Easier...
Kutools for Excel Solves Most of Your Problems, and Increases Your Productivity by 80%
• Reuse Anything: Add the most used or complex formulas, charts and anything else to your favorites, and quickly reuse them in the future.
• More than 20 text features: Extract Number from Text String; Extract or Remove Part of Texts; Convert Numbers and Currencies to English Words.
• Merge Tools: Multiple Workbooks and Sheets into One; Merge Multiple Cells/Rows/Columns Without Losing Data; Merge Duplicate Rows and Sum.
• Split Tools: Split Data into Multiple Sheets Based on Value; One Workbook to Multiple Excel, PDF or CSV Files; One Column to Multiple Columns.
• Paste Skipping Hidden/Filtered Rows; Count And Sum by Background Color; Send Personalized Emails to Multiple Recipients in Bulk.
• Super Filter: Create advanced filter schemes and apply to any sheets; Sort by week, day, frequency and more; Filter by bold, formulas, comment...
• More than 300 powerful features; Works with Office 2007-2019 and 365; Supports all languages; Easy deploying in your enterprise or organization.
arrow blue right bubble Count leap years in a date range with formula
To count leap years between two dates, you just need to do as this:
Select a blank cell that you will place the counted result at, C2 for instance, and enter this formula
=DATE(YEAR(B2),1,1)-DATE(YEAR(A2),1,1)-((YEAR(B2)-YEAR(A2))*365)+AND(MONTH(DATE(YEAR(A2),2,29))=2,MONTH(DATE(YEAR(B2),2,29))=2)*1
then press Enter key to get the result. See screenshot:
doc count leap year 1
Tip: In the formula, A2 is the start date and B2 is the end date, you can change them as you need.
doc download 1
Say something here...
symbols left.
You are guest ( Sign Up? )
or post as a guest, but your post won't be published automatically.
Loading comment... The comment will be refreshed after 00:00.
• To post as a guest, your comment is unpublished.
Tom Moore · 2 months ago
A more useful function would be to calculate the number of times Feb 29 occurs between 2 dates.
• To post as a guest, your comment is unpublished.
[email protected] · 7 months ago
Tentei a fórmula acima, mas ainda gerava erro no numero de anos bissextos, então fiz uma função em VBA que faz a verificação ano a ano no intervalo.
Após incluir esta macro abaixo, para utilizar use a função =ContBissexto(A1;B1), o resultado é a quantidade de anos bissextos no período: Espero ter ajudado:
Function ContBissexto(Ini As Date, Fim As Date) As Integer
On Error Resume Next
Dim AnoIni As Integer
Dim AnoFim As Integer
Dim contB As Integer
contB = 0
'DEFINE O ANO DE INICIO DA CONTAGEM DO PERÍODO BISEXTO
If Ini <= DateSerial(Year(Ini), 3, 1) - 1 Then
AnoIni = Year(Ini)
Else
AnoIni = Year(Ini) + 1
End If
'DEFINE O ANO DE FIM DA CONTAGEM DO PERÍODO BISEXTO
If Fim > DateSerial(Year(Fim), 2, 28) Then
AnoFim = Year(Fim)
Else
AnoIni = Year(Fim) - 1
End If
For i = AnoIni To AnoFim
If Day(DateSerial(i, 3, 1) - 1) = 29 Then contB = contB + 1
Next
ContBissexto = contB
End Function
• To post as a guest, your comment is unpublished.
Antônio Cravo · 7 months ago
A contagem gerava erro no numero de anos bissextos, então fiz uma função em VBA que faz a verificação ano a ano no intervalo.
Após incluir esta macro abaixo, para utilizar use a função =ContBissexto(A1;B1), o resultado é a quantidade de anos bissextos no período:
Function ContBissexto(Ini As Date, Fim As Date) As Integer
On Error Resume Next
Dim AnoIni As Integer
Dim AnoFim As Integer
Dim contB As Integer
contB = 0
'DEFINE O ANO DE INICIO DA CONTAGEM DO PERÍODO BISSEXTO
If Ini <= DateSerial(Year(Ini), 3, 1) - 1 Then
AnoIni = Year(Ini)
Else
AnoIni = Year(Ini) + 1
End If
'DEFINE O ANO DE FIM DA CONTAGEM DO PERÍODO BISSEXTO
If Fim > DateSerial(Year(Fim), 2, 28) Then
AnoFim = Year(Fim)
Else
AnoIni = Year(Fim) - 1
End If
For i = AnoIni To AnoFim
If Day(DateSerial(i, 3, 1) - 1) = 29 Then contB = contB + 1
Next
ContBissexto = contB
End Function
• To post as a guest, your comment is unpublished.
Fabian Ries · 1 years ago
Oi amigo,
Excelente fórmula!
Trabalhei com ela e percebi que há uma divergência quando o primeiro e/ou o segundo intervalo são anos bissextos. Tomei a liberdade de corrigir (em português):
=DATA(ANO(B2);1;1)-DATA(ANO(A2);1;1)-((ANO(B2)-ANO(A2))*365)+E(ANO(A2)=ANO(B2);MÊS(DATA(ANO(A2);2;29))=2;A2<=DATA(ANO(A2);2;29);B2>=DATA(ANO(B2);2;29))+E(ANO(A2)
|
{
"url": "https://www.extendoffice.com/documents/excel/3744-excel-count-leap-years.html",
"source_domain": "www.extendoffice.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "47479",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ROGFXTTNQIMBFMGRS6P7FPBQ5YPNJ244",
"WARC-Concurrent-To": "<urn:uuid:76669cef-0368-4c1c-90de-8a0dc01e43e7>",
"WARC-Date": "2020-08-14T23:10:34Z",
"WARC-IP-Address": "3.22.206.175",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5UNEELXJI724EDXB6FLTEN372S46QD5A",
"WARC-Record-ID": "<urn:uuid:3c736803-5dea-4829-830a-77486f871f3c>",
"WARC-Target-URI": "https://www.extendoffice.com/documents/excel/3744-excel-count-leap-years.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6ee83ff7-2ee2-4e9e-8614-470b0a5ae137>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-28.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
62,
63,
371,
372,
418,
419,
420,
450,
451,
591,
614,
705,
792,
933,
1080,
1222,
1369,
1502,
1652,
1801,
1802,
1872,
1873,
1874,
1942,
1943,
2046,
2176,
2232,
2254,
2255,
2354,
2355,
2370,
2371,
2393,
2407,
2434,
2502,
2564,
2617,
2646,
2746,
2799,
2837,
2990,
3152,
3153,
3216,
3241,
3242,
3268,
3294,
3319,
3333,
3392,
3443,
3466,
3475,
3502,
3513,
3569,
3616,
3639,
3648,
3675,
3686,
3687,
3716,
3780,
3789,
3790,
3815,
3816,
3833,
3886,
3919,
4049,
4191,
4192,
4193,
4256,
4281,
4282,
4308,
4334,
4359,
4373,
4433,
4484,
4507,
4516,
4543,
4554,
4611,
4658,
4681,
4690,
4717,
4728,
4729,
4758,
4822,
4831,
4832,
4857,
4858,
4875,
4928,
4958,
4972,
4973,
4996,
4997,
5161,
5162,
5163
],
"line_end_idx": [
62,
63,
371,
372,
418,
419,
420,
450,
451,
591,
614,
705,
792,
933,
1080,
1222,
1369,
1502,
1652,
1801,
1802,
1872,
1873,
1874,
1942,
1943,
2046,
2176,
2232,
2254,
2255,
2354,
2355,
2370,
2371,
2393,
2407,
2434,
2502,
2564,
2617,
2646,
2746,
2799,
2837,
2990,
3152,
3153,
3216,
3241,
3242,
3268,
3294,
3319,
3333,
3392,
3443,
3466,
3475,
3502,
3513,
3569,
3616,
3639,
3648,
3675,
3686,
3687,
3716,
3780,
3789,
3790,
3815,
3816,
3833,
3886,
3919,
4049,
4191,
4192,
4193,
4256,
4281,
4282,
4308,
4334,
4359,
4373,
4433,
4484,
4507,
4516,
4543,
4554,
4611,
4658,
4681,
4690,
4717,
4728,
4729,
4758,
4822,
4831,
4832,
4857,
4858,
4875,
4928,
4958,
4972,
4973,
4996,
4997,
5161,
5162,
5163,
5328
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5328,
"ccnet_original_nlines": 117,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17373234033584595,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08561929315328598,
"rps_doc_frac_lines_end_with_ellipsis": 0.025423729792237282,
"rps_doc_frac_no_alph_words": 0.2959268391132355,
"rps_doc_frac_unique_words": 0.38339439034461975,
"rps_doc_mean_word_length": 4.754578590393066,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.0033250199630856514,
"rps_doc_unigram_entropy": 5.308417320251465,
"rps_doc_word_count": 819,
"rps_doc_frac_chars_dupe_10grams": 0.360041081905365,
"rps_doc_frac_chars_dupe_5grams": 0.413199782371521,
"rps_doc_frac_chars_dupe_6grams": 0.3867488503456116,
"rps_doc_frac_chars_dupe_7grams": 0.37904468178749084,
"rps_doc_frac_chars_dupe_8grams": 0.37904468178749084,
"rps_doc_frac_chars_dupe_9grams": 0.37904468178749084,
"rps_doc_frac_chars_top_2gram": 0.018489979207515717,
"rps_doc_frac_chars_top_3gram": 0.008988190442323685,
"rps_doc_frac_chars_top_4gram": 0.015408320352435112,
"rps_doc_books_importance": -552.427001953125,
"rps_doc_books_importance_length_correction": -552.427001953125,
"rps_doc_openwebtext_importance": -322.871826171875,
"rps_doc_openwebtext_importance_length_correction": -322.871826171875,
"rps_doc_wikipedia_importance": -222.92523193359375,
"rps_doc_wikipedia_importance_length_correction": -222.92523193359375
},
"fasttext": {
"dclm": 0.09205347299575806,
"english": 0.5668748021125793,
"fineweb_edu_approx": 1.931778073310852,
"eai_general_math": 0.3284880518913269,
"eai_open_web_math": 0.4096234440803528,
"eai_web_code": 0.05624419078230858
}
}
|
{
"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": "529.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Astronomy",
"level_3": "Chronology"
}
}
},
"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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,880,483,059,209,013,000 |
Printing User Information on Documents
Printing User Information on Documents
You can configure the machine to forcibly print user information such as the name of the logged in user on printed or copied documents. This function enables you to identify who output each document simply by checking the printed information, which can discourage unauthorized copying. Administrator or DeviceAdmin privileges are required in order to configure these settings.
1
Press .
2
Press <Function Settings> <Common> <Print Settings> <Forced Print of Recognition Information>.
3
Press <On> and select the functions that forcibly print the user information.
In <Target Function>, press <On> for each function that you want to apply this setting to.
4
Specify the print position and press <OK>.
Press the arrow buttons to select the print position. To precisely adjust the position, press <Set Details> and specify the location.
40K3-0AJ
|
{
"url": "https://oip.manual.canon/USRMA-3911-zz-CS-715-enUS/contents/devu-mcn_mng-doc_sec-prt_user_info.html",
"source_domain": "oip.manual.canon",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "6133",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LKVOD4KFAM7QASGYGD2NVPLTHQ6GGQOV",
"WARC-Concurrent-To": "<urn:uuid:67ee111b-6c25-4387-bdf7-f85ee247d54e>",
"WARC-Date": "2019-04-18T16:18:45Z",
"WARC-IP-Address": "54.230.193.99",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:E4BNAD3UHQGK67UBAK2E3GSAQCRO6AXH",
"WARC-Record-ID": "<urn:uuid:ae0668e5-39e0-4226-b0bb-2ece385324f5>",
"WARC-Target-URI": "https://oip.manual.canon/USRMA-3911-zz-CS-715-enUS/contents/devu-mcn_mng-doc_sec-prt_user_info.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f0468c0d-e27d-4385-9592-635b046948c9>"
},
"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 ([email protected])\r\nhostname: ip-10-97-181-44.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,
40,
41,
80,
81,
458,
460,
468,
470,
568,
570,
648,
739,
741,
784,
918
],
"line_end_idx": [
40,
41,
80,
81,
458,
460,
468,
470,
568,
570,
648,
739,
741,
784,
918,
926
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 926,
"ccnet_original_nlines": 15,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28654971718788147,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017543859779834747,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19883041083812714,
"rps_doc_frac_unique_words": 0.5285714268684387,
"rps_doc_mean_word_length": 5.349999904632568,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.000324249267578,
"rps_doc_word_count": 140,
"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.08010680973529816,
"rps_doc_frac_chars_top_3gram": 0.04539386183023453,
"rps_doc_frac_chars_top_4gram": 0.06942590326070786,
"rps_doc_books_importance": -66.88837432861328,
"rps_doc_books_importance_length_correction": -66.88837432861328,
"rps_doc_openwebtext_importance": -40.72617721557617,
"rps_doc_openwebtext_importance_length_correction": -29.21146011352539,
"rps_doc_wikipedia_importance": -41.0344123840332,
"rps_doc_wikipedia_importance_length_correction": -41.0344123840332
},
"fasttext": {
"dclm": 0.02756720967590809,
"english": 0.7521174550056458,
"fineweb_edu_approx": 1.3143439292907715,
"eai_general_math": 0.1472005844116211,
"eai_open_web_math": 0.05214447155594826,
"eai_web_code": 0.03464126959443092
}
}
|
{
"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.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,287,954,344,102,778,000 |
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ /* * This file is part of the LibreOffice project. * * This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. * * This file incorporates work covered by the following license notice: * * Licensed to the Apache Software Foundation (ASF) under one or more * contributor license agreements. See the NOTICE file distributed * with this work for additional information regarding copyright * ownership. The ASF licenses this file to you under the Apache * License, Version 2.0 (the "License"); you may not use this file * except in compliance with the License. You may obtain a copy of * the License at http://www.apache.org/licenses/LICENSE-2.0 . */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace ::com::sun::star; using namespace ::com::sun::star::uno; using namespace ::com::sun::star::lang; using namespace ::com::sun::star::beans; using namespace ::com::sun::star::text; using namespace ::com::sun::star::style; namespace { inline SvtBroadcaster& GetPageDescNotifier(SwDoc* pDoc) { return pDoc->getIDocumentStylePoolAccess().GetPageDescFromPool(RES_POOLPAGE_STANDARD)->GetNotifier(); } } // Constants for the css::text::ColumnSeparatorStyle #define API_COL_LINE_NONE 0 #define API_COL_LINE_SOLID 1 #define API_COL_LINE_DOTTED 2 #define API_COL_LINE_DASHED 3 #define WID_PREFIX 0 #define WID_SUFFIX 1 #define WID_NUMBERING_TYPE 2 #define WID_START_AT 3 #define WID_FOOTNOTE_COUNTING 4 #define WID_PARAGRAPH_STYLE 5 #define WID_PAGE_STYLE 6 #define WID_CHARACTER_STYLE 7 #define WID_POSITION_END_OF_DOC 8 #define WID_END_NOTICE 9 #define WID_BEGIN_NOTICE 10 #define WID_ANCHOR_CHARACTER_STYLE 11 const SfxItemPropertySet* GetFootnoteSet() { static const SfxItemPropertyMapEntry aFootnoteMap_Impl[] = { { OUString(UNO_NAME_ANCHOR_CHAR_STYLE_NAME),WID_ANCHOR_CHARACTER_STYLE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_BEGIN_NOTICE), WID_BEGIN_NOTICE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_CHAR_STYLE_NAME), WID_CHARACTER_STYLE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_END_NOTICE), WID_END_NOTICE , ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_FOOTNOTE_COUNTING), WID_FOOTNOTE_COUNTING, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_NUMBERING_TYPE), WID_NUMBERING_TYPE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_PAGE_STYLE_NAME), WID_PAGE_STYLE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_PARA_STYLE_NAME), WID_PARAGRAPH_STYLE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_POSITION_END_OF_DOC), WID_POSITION_END_OF_DOC,cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_PREFIX), WID_PREFIX, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_START_AT), WID_START_AT , ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_SUFFIX), WID_SUFFIX, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(), 0, css::uno::Type(), 0, 0 } }; static const SfxItemPropertySet aFootnoteSet_Impl(aFootnoteMap_Impl); return &aFootnoteSet_Impl; } const SfxItemPropertySet* GetEndnoteSet() { static const SfxItemPropertyMapEntry aEndnoteMap_Impl[] = { { OUString(UNO_NAME_ANCHOR_CHAR_STYLE_NAME),WID_ANCHOR_CHARACTER_STYLE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_CHAR_STYLE_NAME), WID_CHARACTER_STYLE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_NUMBERING_TYPE), WID_NUMBERING_TYPE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_PAGE_STYLE_NAME), WID_PAGE_STYLE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_PARA_STYLE_NAME), WID_PARAGRAPH_STYLE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_PREFIX), WID_PREFIX, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_START_AT), WID_START_AT , ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_SUFFIX), WID_SUFFIX, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(), 0, css::uno::Type(), 0, 0 } }; static const SfxItemPropertySet aEndnoteSet_Impl(aEndnoteMap_Impl); return &aEndnoteSet_Impl; } const SfxItemPropertySet* GetNumberingRulesSet() { static const SfxItemPropertyMapEntry aNumberingRulesMap_Impl[] = { { OUString(UNO_NAME_IS_ABSOLUTE_MARGINS), WID_IS_ABS_MARGINS, cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_IS_AUTOMATIC), WID_IS_AUTOMATIC, cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_IS_CONTINUOUS_NUMBERING), WID_CONTINUOUS, cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_NAME), WID_RULE_NAME , ::cppu::UnoType::get(), PropertyAttribute::READONLY, 0}, { OUString(UNO_NAME_NUMBERING_IS_OUTLINE), WID_IS_OUTLINE, cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_DEFAULT_LIST_ID), WID_DEFAULT_LIST_ID, ::cppu::UnoType::get(), PropertyAttribute::READONLY, 0}, { OUString(), 0, css::uno::Type(), 0, 0 } }; static const SfxItemPropertySet aNumberingRulesSet_Impl( aNumberingRulesMap_Impl ); return &aNumberingRulesSet_Impl; } #define WID_NUM_ON 0 #define WID_SEPARATOR_INTERVAL 1 #define WID_NUMBERING_TYPE 2 #define WID_NUMBER_POSITION 3 #define WID_DISTANCE 4 #define WID_INTERVAL 5 #define WID_SEPARATOR_TEXT 6 #define WID_COUNT_EMPTY_LINES 8 #define WID_COUNT_LINES_IN_FRAMES 9 #define WID_RESTART_AT_EACH_PAGE 10 const SfxItemPropertySet* GetLineNumberingSet() { static const SfxItemPropertyMapEntry aLineNumberingMap_Impl[] = { { OUString(UNO_NAME_CHAR_STYLE_NAME), WID_CHARACTER_STYLE, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_COUNT_EMPTY_LINES), WID_COUNT_EMPTY_LINES , cppu::UnoType::get(),PROPERTY_NONE, 0}, { OUString(UNO_NAME_COUNT_LINES_IN_FRAMES), WID_COUNT_LINES_IN_FRAMES, cppu::UnoType::get(),PROPERTY_NONE, 0}, { OUString(UNO_NAME_DISTANCE), WID_DISTANCE , ::cppu::UnoType::get(),PROPERTY_NONE, 0}, { OUString(UNO_NAME_IS_ON), WID_NUM_ON, cppu::UnoType::get() , PROPERTY_NONE, 0}, { OUString(UNO_NAME_INTERVAL), WID_INTERVAL , ::cppu::UnoType::get(),PROPERTY_NONE, 0}, { OUString(UNO_NAME_SEPARATOR_TEXT), WID_SEPARATOR_TEXT, ::cppu::UnoType::get(), PROPERTY_NONE, 0}, { OUString(UNO_NAME_NUMBER_POSITION), WID_NUMBER_POSITION, ::cppu::UnoType::get(),PROPERTY_NONE, 0}, { OUString(UNO_NAME_NUMBERING_TYPE), WID_NUMBERING_TYPE , ::cppu::UnoType::get(),PROPERTY_NONE, 0}, { OUString(UNO_NAME_RESTART_AT_EACH_PAGE), WID_RESTART_AT_EACH_PAGE, cppu::UnoType::get() , PROPERTY_NONE, 0}, { OUString(UNO_NAME_SEPARATOR_INTERVAL), WID_SEPARATOR_INTERVAL, ::cppu::UnoType::get(),PROPERTY_NONE, 0}, { OUString(), 0, css::uno::Type(), 0, 0 } }; static const SfxItemPropertySet aLineNumberingSet_Impl(aLineNumberingMap_Impl); return &aLineNumberingSet_Impl; } static SwCharFormat* lcl_getCharFormat(SwDoc* pDoc, const uno::Any& aValue) { SwCharFormat* pRet = nullptr; OUString uTmp; aValue >>= uTmp; OUString sCharFormat; SwStyleNameMapper::FillUIName(uTmp, sCharFormat, SwGetPoolIdFromName::ChrFmt); if (sCharFormat != SwResId(STR_POOLCOLL_STANDARD)) { pRet = pDoc->FindCharFormatByName( sCharFormat ); } if(!pRet) { const sal_uInt16 nId = SwStyleNameMapper::GetPoolIdFromUIName(sCharFormat, SwGetPoolIdFromName::ChrFmt); if(USHRT_MAX != nId) pRet = pDoc->getIDocumentStylePoolAccess().GetCharFormatFromPool( nId ); } return pRet; } static SwTextFormatColl* lcl_GetParaStyle(SwDoc* pDoc, const uno::Any& aValue) { OUString uTmp; aValue >>= uTmp; OUString sParaStyle; SwStyleNameMapper::FillUIName(uTmp, sParaStyle, SwGetPoolIdFromName::TxtColl ); SwTextFormatColl* pRet = pDoc->FindTextFormatCollByName( sParaStyle ); if( !pRet ) { const sal_uInt16 nId = SwStyleNameMapper::GetPoolIdFromUIName( sParaStyle, SwGetPoolIdFromName::TxtColl ); if( USHRT_MAX != nId ) pRet = pDoc->getIDocumentStylePoolAccess().GetTextCollFromPool( nId ); } return pRet; } static SwPageDesc* lcl_GetPageDesc(SwDoc* pDoc, const uno::Any& aValue) { OUString uTmp; aValue >>= uTmp; OUString sPageDesc; SwStyleNameMapper::FillUIName(uTmp, sPageDesc, SwGetPoolIdFromName::PageDesc ); SwPageDesc* pRet = pDoc->FindPageDesc( sPageDesc ); if(!pRet) { const sal_uInt16 nId = SwStyleNameMapper::GetPoolIdFromUIName(sPageDesc, SwGetPoolIdFromName::PageDesc); if(USHRT_MAX != nId) pRet = pDoc->getIDocumentStylePoolAccess().GetPageDescFromPool( nId ); } return pRet; } // Numbering const o3tl::enumarray aSvxToUnoAdjust { text::HoriOrientation::LEFT, //3 text::HoriOrientation::RIGHT, //1 USHRT_MAX, text::HoriOrientation::CENTER, //2 USHRT_MAX, USHRT_MAX }; const unsigned short aUnoToSvxAdjust[] = { USHRT_MAX, static_cast(SvxAdjust::Right), // 1 static_cast(SvxAdjust::Center), // 3 static_cast(SvxAdjust::Left), // 0 USHRT_MAX, USHRT_MAX }; OUString SwXFootnoteProperties::getImplementationName() { return OUString("SwXFootnoteProperties"); } sal_Bool SwXFootnoteProperties::supportsService(const OUString& rServiceName) { return cppu::supportsService(this, rServiceName); } Sequence< OUString > SwXFootnoteProperties::getSupportedServiceNames() { Sequence aRet { "com.sun.star.text.FootnoteSettings" }; return aRet; } SwXFootnoteProperties::SwXFootnoteProperties(SwDoc* pDc) : pDoc(pDc), m_pPropertySet(GetFootnoteSet()) { } SwXFootnoteProperties::~SwXFootnoteProperties() { } uno::Reference< beans::XPropertySetInfo > SwXFootnoteProperties::getPropertySetInfo() { static uno::Reference< beans::XPropertySetInfo > aRef = m_pPropertySet->getPropertySetInfo(); return aRef; } void SwXFootnoteProperties::setPropertyValue(const OUString& rPropertyName, const uno::Any& aValue) { SolarMutexGuard aGuard; if(!pDoc) throw uno::RuntimeException(); const SfxItemPropertySimpleEntry* pEntry = m_pPropertySet->getPropertyMap().getByName( rPropertyName ); if(!pEntry) throw beans::UnknownPropertyException("Unknown property: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); if ( pEntry->nFlags & PropertyAttribute::READONLY) throw PropertyVetoException("Property is read-only: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); SwFootnoteInfo aFootnoteInfo(pDoc->GetFootnoteInfo()); switch(pEntry->nWID) { case WID_PREFIX: { OUString uTmp; aValue >>= uTmp; aFootnoteInfo.SetPrefix(uTmp); } break; case WID_SUFFIX: { OUString uTmp; aValue >>= uTmp; aFootnoteInfo.SetSuffix(uTmp); } break; case WID_NUMBERING_TYPE: { sal_Int16 nTmp = 0; aValue >>= nTmp; if(!(nTmp >= 0 && (nTmp <= SVX_NUM_ARABIC || nTmp > SVX_NUM_BITMAP))) throw lang::IllegalArgumentException(); aFootnoteInfo.aFormat.SetNumberingType(static_cast(nTmp)); } break; case WID_START_AT: { sal_Int16 nTmp = 0; aValue >>= nTmp; aFootnoteInfo.nFootnoteOffset = nTmp; } break; case WID_FOOTNOTE_COUNTING: { sal_Int16 nTmp = 0; aValue >>= nTmp; switch(nTmp) { case FootnoteNumbering::PER_PAGE: aFootnoteInfo.eNum = FTNNUM_PAGE; break; case FootnoteNumbering::PER_CHAPTER: aFootnoteInfo.eNum = FTNNUM_CHAPTER; break; case FootnoteNumbering::PER_DOCUMENT: aFootnoteInfo.eNum = FTNNUM_DOC; break; } } break; case WID_PARAGRAPH_STYLE: { SwTextFormatColl* pColl = lcl_GetParaStyle(pDoc, aValue); if(pColl) aFootnoteInfo.SetFootnoteTextColl(*pColl); } break; case WID_PAGE_STYLE: { SwPageDesc* pDesc = lcl_GetPageDesc(pDoc, aValue); if(pDesc) aFootnoteInfo.ChgPageDesc( pDesc ); } break; case WID_ANCHOR_CHARACTER_STYLE: case WID_CHARACTER_STYLE: { SwCharFormat* pFormat = lcl_getCharFormat(pDoc, aValue); if(pFormat) { if(pEntry->nWID == WID_ANCHOR_CHARACTER_STYLE) aFootnoteInfo.SetAnchorCharFormat(pFormat); else aFootnoteInfo.SetCharFormat(pFormat); } } break; case WID_POSITION_END_OF_DOC: { bool bVal = *o3tl::doAccess(aValue); aFootnoteInfo.ePos = bVal ? FTNPOS_CHAPTER : FTNPOS_PAGE; } break; case WID_END_NOTICE: { OUString uTmp; aValue >>= uTmp; aFootnoteInfo.aQuoVadis = uTmp; } break; case WID_BEGIN_NOTICE: { OUString uTmp; aValue >>= uTmp; aFootnoteInfo.aErgoSum = uTmp; } break; } pDoc->SetFootnoteInfo(aFootnoteInfo); } uno::Any SwXFootnoteProperties::getPropertyValue(const OUString& rPropertyName) { SolarMutexGuard aGuard; uno::Any aRet; if(!pDoc) throw uno::RuntimeException(); const SfxItemPropertySimpleEntry* pEntry = m_pPropertySet->getPropertyMap().getByName( rPropertyName ); if(!pEntry) throw UnknownPropertyException("Unknown property: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); const SwFootnoteInfo& rFootnoteInfo = pDoc->GetFootnoteInfo(); switch(pEntry->nWID) { case WID_PREFIX: { aRet <<= rFootnoteInfo.GetPrefix(); } break; case WID_SUFFIX: { aRet <<= rFootnoteInfo.GetSuffix(); } break; case WID_NUMBERING_TYPE : { aRet <<= static_cast(rFootnoteInfo.aFormat.GetNumberingType()); } break; case WID_START_AT: aRet <<= static_cast(rFootnoteInfo.nFootnoteOffset); break; case WID_FOOTNOTE_COUNTING : { sal_Int16 nRet = 0; switch(rFootnoteInfo.eNum) { case FTNNUM_PAGE: nRet = FootnoteNumbering::PER_PAGE; break; case FTNNUM_CHAPTER: nRet = FootnoteNumbering::PER_CHAPTER; break; case FTNNUM_DOC: nRet = FootnoteNumbering::PER_DOCUMENT; break; } aRet <<= nRet; } break; case WID_PARAGRAPH_STYLE : { SwTextFormatColl* pColl = rFootnoteInfo.GetFootnoteTextColl(); OUString aString; if(pColl) aString = pColl->GetName(); SwStyleNameMapper::FillProgName(aString, aString, SwGetPoolIdFromName::TxtColl); aRet <<= aString; } break; case WID_PAGE_STYLE : { OUString aString; if( rFootnoteInfo.KnowsPageDesc() ) { SwStyleNameMapper::FillProgName( rFootnoteInfo.GetPageDesc( *pDoc )->GetName(), aString, SwGetPoolIdFromName::PageDesc); } aRet <<= aString; } break; case WID_ANCHOR_CHARACTER_STYLE: case WID_CHARACTER_STYLE: { OUString aString; const SwCharFormat* pCharFormat = rFootnoteInfo.GetCurrentCharFormat(pEntry->nWID == WID_ANCHOR_CHARACTER_STYLE); if( pCharFormat ) { SwStyleNameMapper::FillProgName( pCharFormat->GetName(), aString, SwGetPoolIdFromName::ChrFmt); } aRet <<= aString; } break; case WID_POSITION_END_OF_DOC: aRet <<= FTNPOS_CHAPTER == rFootnoteInfo.ePos; break; case WID_END_NOTICE : aRet <<= rFootnoteInfo.aQuoVadis; break; case WID_BEGIN_NOTICE : aRet <<= rFootnoteInfo.aErgoSum; break; } return aRet; } void SwXFootnoteProperties::addPropertyChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< beans::XPropertyChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } void SwXFootnoteProperties::removePropertyChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< beans::XPropertyChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } void SwXFootnoteProperties::addVetoableChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< beans::XVetoableChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } void SwXFootnoteProperties::removeVetoableChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< beans::XVetoableChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } OUString SwXEndnoteProperties::getImplementationName() { return OUString("SwXEndnoteProperties"); } sal_Bool SwXEndnoteProperties::supportsService(const OUString& rServiceName) { return cppu::supportsService(this, rServiceName); } Sequence< OUString > SwXEndnoteProperties::getSupportedServiceNames() { Sequence aRet { "com.sun.star.text.FootnoteSettings" }; return aRet; } SwXEndnoteProperties::SwXEndnoteProperties(SwDoc* pDc) : pDoc(pDc), m_pPropertySet(GetEndnoteSet()) { } SwXEndnoteProperties::~SwXEndnoteProperties() { } uno::Reference< beans::XPropertySetInfo > SwXEndnoteProperties::getPropertySetInfo() { static uno::Reference< beans::XPropertySetInfo > aRef = m_pPropertySet->getPropertySetInfo(); return aRef; } void SwXEndnoteProperties::setPropertyValue(const OUString& rPropertyName, const uno::Any& aValue) { SolarMutexGuard aGuard; if(pDoc) { const SfxItemPropertySimpleEntry* pEntry = m_pPropertySet->getPropertyMap().getByName( rPropertyName ); if(!pEntry) throw UnknownPropertyException("Unknown property: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); if ( pEntry->nFlags & PropertyAttribute::READONLY) throw PropertyVetoException("Property is read-only: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); SwEndNoteInfo aEndInfo(pDoc->GetEndNoteInfo()); switch(pEntry->nWID) { case WID_PREFIX: { OUString uTmp; aValue >>= uTmp; aEndInfo.SetPrefix(uTmp); } break; case WID_SUFFIX: { OUString uTmp; aValue >>= uTmp; aEndInfo.SetSuffix(uTmp); } break; case WID_NUMBERING_TYPE : { sal_Int16 nTmp = 0; aValue >>= nTmp; aEndInfo.aFormat.SetNumberingType(static_cast(nTmp)); } break; case WID_START_AT: { sal_Int16 nTmp = 0; aValue >>= nTmp; aEndInfo.nFootnoteOffset = nTmp; } break; case WID_PARAGRAPH_STYLE : { SwTextFormatColl* pColl = lcl_GetParaStyle(pDoc, aValue); if(pColl) aEndInfo.SetFootnoteTextColl(*pColl); } break; case WID_PAGE_STYLE : { SwPageDesc* pDesc = lcl_GetPageDesc(pDoc, aValue); if(pDesc) aEndInfo.ChgPageDesc( pDesc ); } break; case WID_ANCHOR_CHARACTER_STYLE: case WID_CHARACTER_STYLE : { SwCharFormat* pFormat = lcl_getCharFormat(pDoc, aValue); if(pFormat) { if(pEntry->nWID == WID_ANCHOR_CHARACTER_STYLE) aEndInfo.SetAnchorCharFormat(pFormat); else aEndInfo.SetCharFormat(pFormat); } } break; } pDoc->SetEndNoteInfo(aEndInfo); } } uno::Any SwXEndnoteProperties::getPropertyValue(const OUString& rPropertyName) { SolarMutexGuard aGuard; uno::Any aRet; if(pDoc) { const SfxItemPropertySimpleEntry* pEntry = m_pPropertySet->getPropertyMap().getByName( rPropertyName ); if(!pEntry) throw UnknownPropertyException("Unknown property: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); const SwEndNoteInfo& rEndInfo = pDoc->GetEndNoteInfo(); switch(pEntry->nWID) { case WID_PREFIX: aRet <<= rEndInfo.GetPrefix(); break; case WID_SUFFIX: aRet <<= rEndInfo.GetSuffix(); break; case WID_NUMBERING_TYPE : aRet <<= static_cast(rEndInfo.aFormat.GetNumberingType()); break; case WID_START_AT: aRet <<= static_cast(rEndInfo.nFootnoteOffset); break; case WID_PARAGRAPH_STYLE : { SwTextFormatColl* pColl = rEndInfo.GetFootnoteTextColl(); OUString aString; if(pColl) aString = pColl->GetName(); SwStyleNameMapper::FillProgName( aString, aString, SwGetPoolIdFromName::TxtColl); aRet <<= aString; } break; case WID_PAGE_STYLE : { OUString aString; if( rEndInfo.KnowsPageDesc() ) { SwStyleNameMapper::FillProgName( rEndInfo.GetPageDesc( *pDoc )->GetName(), aString, SwGetPoolIdFromName::PageDesc); } aRet <<= aString; } break; case WID_ANCHOR_CHARACTER_STYLE: case WID_CHARACTER_STYLE: { OUString aString; const SwCharFormat* pCharFormat = rEndInfo.GetCurrentCharFormat( pEntry->nWID == WID_ANCHOR_CHARACTER_STYLE ); if( pCharFormat ) { SwStyleNameMapper::FillProgName( pCharFormat->GetName(), aString, SwGetPoolIdFromName::ChrFmt); } aRet <<= aString; } break; } } return aRet; } void SwXEndnoteProperties::addPropertyChangeListener( const OUString& /*PropertyName*/, const uno::Reference< beans::XPropertyChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } void SwXEndnoteProperties::removePropertyChangeListener(const OUString& /*PropertyName*/, const uno:: Reference< beans::XPropertyChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } void SwXEndnoteProperties::addVetoableChangeListener(const OUString& /*PropertyName*/, const uno:: Reference< beans::XVetoableChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } void SwXEndnoteProperties::removeVetoableChangeListener(const OUString& /*PropertyName*/, const uno:: Reference< beans::XVetoableChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } OUString SwXLineNumberingProperties::getImplementationName() { return OUString("SwXLineNumberingProperties"); } sal_Bool SwXLineNumberingProperties::supportsService(const OUString& rServiceName) { return cppu::supportsService(this, rServiceName); } Sequence< OUString > SwXLineNumberingProperties::getSupportedServiceNames() { Sequence aRet { "com.sun.star.text.LineNumberingProperties" }; return aRet; } SwXLineNumberingProperties::SwXLineNumberingProperties(SwDoc* pDc) : pDoc(pDc), m_pPropertySet(GetLineNumberingSet()) { } SwXLineNumberingProperties::~SwXLineNumberingProperties() { } uno::Reference< beans::XPropertySetInfo > SwXLineNumberingProperties::getPropertySetInfo() { static uno::Reference< beans::XPropertySetInfo > aRef = m_pPropertySet->getPropertySetInfo(); return aRef; } void SwXLineNumberingProperties::setPropertyValue( const OUString& rPropertyName, const Any& aValue) { SolarMutexGuard aGuard; if(!pDoc) throw uno::RuntimeException(); const SfxItemPropertySimpleEntry* pEntry = m_pPropertySet->getPropertyMap().getByName( rPropertyName ); if(!pEntry) throw UnknownPropertyException("Unknown property: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); if ( pEntry->nFlags & PropertyAttribute::READONLY) throw PropertyVetoException("Property is read-only: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); SwLineNumberInfo aFontMetric(pDoc->GetLineNumberInfo()); switch(pEntry->nWID) { case WID_NUM_ON: { bool bVal = *o3tl::doAccess(aValue); aFontMetric.SetPaintLineNumbers(bVal); } break; case WID_CHARACTER_STYLE : { SwCharFormat* pFormat = lcl_getCharFormat(pDoc, aValue); if(pFormat) aFontMetric.SetCharFormat(pFormat); } break; case WID_NUMBERING_TYPE : { SvxNumberType aNumType(aFontMetric.GetNumType()); sal_Int16 nTmp = 0; aValue >>= nTmp; aNumType.SetNumberingType(static_cast(nTmp)); aFontMetric.SetNumType(aNumType); } break; case WID_NUMBER_POSITION : { sal_Int16 nTmp = 0; aValue >>= nTmp; switch(nTmp) { case style::LineNumberPosition::LEFT: aFontMetric.SetPos(LINENUMBER_POS_LEFT); break; case style::LineNumberPosition::RIGHT : aFontMetric.SetPos(LINENUMBER_POS_RIGHT); break; case style::LineNumberPosition::INSIDE: aFontMetric.SetPos(LINENUMBER_POS_INSIDE); break; case style::LineNumberPosition::OUTSIDE: aFontMetric.SetPos(LINENUMBER_POS_OUTSIDE); break; } } break; case WID_DISTANCE : { sal_Int32 nVal = 0; aValue >>= nVal; sal_Int32 nTmp = convertMm100ToTwip(nVal); if (nTmp > SAL_MAX_UINT16) nTmp = SAL_MAX_UINT16; aFontMetric.SetPosFromLeft( static_cast< sal_uInt16 >(nTmp) ); } break; case WID_INTERVAL : { sal_Int16 nTmp = 0; aValue >>= nTmp; if( nTmp > 0) aFontMetric.SetCountBy(nTmp); } break; case WID_SEPARATOR_TEXT : { OUString uTmp; aValue >>= uTmp; aFontMetric.SetDivider(uTmp); } break; case WID_SEPARATOR_INTERVAL: { sal_Int16 nTmp = 0; aValue >>= nTmp; if( nTmp >= 0) aFontMetric.SetDividerCountBy(nTmp); } break; case WID_COUNT_EMPTY_LINES : { bool bVal = *o3tl::doAccess(aValue); aFontMetric.SetCountBlankLines(bVal); } break; case WID_COUNT_LINES_IN_FRAMES : { bool bVal = *o3tl::doAccess(aValue); aFontMetric.SetCountInFlys(bVal); } break; case WID_RESTART_AT_EACH_PAGE : { bool bVal = *o3tl::doAccess(aValue); aFontMetric.SetRestartEachPage(bVal); } break; } pDoc->SetLineNumberInfo(aFontMetric); } Any SwXLineNumberingProperties::getPropertyValue(const OUString& rPropertyName) { SolarMutexGuard aGuard; Any aRet; if(!pDoc) throw uno::RuntimeException(); const SfxItemPropertySimpleEntry* pEntry = m_pPropertySet->getPropertyMap().getByName( rPropertyName ); if(!pEntry) throw UnknownPropertyException("Unknown property: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); const SwLineNumberInfo& rInfo = pDoc->GetLineNumberInfo(); switch(pEntry->nWID) { case WID_NUM_ON: aRet <<= rInfo.IsPaintLineNumbers(); break; case WID_CHARACTER_STYLE : { OUString aString; // return empty string if no char format is set // otherwise it would be created here if(rInfo.HasCharFormat()) { SwStyleNameMapper::FillProgName( rInfo.GetCharFormat(pDoc->getIDocumentStylePoolAccess())->GetName(), aString, SwGetPoolIdFromName::ChrFmt); } aRet <<= aString; } break; case WID_NUMBERING_TYPE : aRet <<= static_cast(rInfo.GetNumType().GetNumberingType()); break; case WID_NUMBER_POSITION : { sal_Int16 nRet = 0; switch(rInfo.GetPos()) { case LINENUMBER_POS_LEFT: nRet = style::LineNumberPosition::LEFT; break; case LINENUMBER_POS_RIGHT : nRet = style::LineNumberPosition::RIGHT ; break; case LINENUMBER_POS_INSIDE: nRet = style::LineNumberPosition::INSIDE ; break; case LINENUMBER_POS_OUTSIDE : nRet = style::LineNumberPosition::OUTSIDE ; break; } aRet <<= nRet; } break; case WID_DISTANCE : { sal_uInt32 nPos = rInfo.GetPosFromLeft(); if(USHRT_MAX == nPos) nPos = 0; aRet <<= static_cast < sal_Int32 >(convertTwipToMm100(nPos)); } break; case WID_INTERVAL : aRet <<= static_cast(rInfo.GetCountBy()); break; case WID_SEPARATOR_TEXT : aRet <<= rInfo.GetDivider(); break; case WID_SEPARATOR_INTERVAL: aRet <<= static_cast(rInfo.GetDividerCountBy()); break; case WID_COUNT_EMPTY_LINES : aRet <<= rInfo.IsCountBlankLines(); break; case WID_COUNT_LINES_IN_FRAMES : aRet <<= rInfo.IsCountInFlys(); break; case WID_RESTART_AT_EACH_PAGE : aRet <<= rInfo.IsRestartEachPage(); break; } return aRet; } void SwXLineNumberingProperties::addPropertyChangeListener(const OUString& /*rPropertyName*/, const uno:: Reference< beans::XPropertyChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } void SwXLineNumberingProperties::removePropertyChangeListener(const OUString& /*rPropertyName*/, const uno:: Reference< beans::XPropertyChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } void SwXLineNumberingProperties::addVetoableChangeListener(const OUString& /*rPropertyName*/, const uno:: Reference< beans::XVetoableChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } void SwXLineNumberingProperties::removeVetoableChangeListener(const OUString& /*rPropertyName*/, const uno:: Reference< beans::XVetoableChangeListener > & /*xListener*/) { OSL_FAIL("not implemented"); } static const char aInvalidStyle[] = "__XXX___invalid"; class SwXNumberingRules::Impl : public SvtListener { SwXNumberingRules& m_rParent; virtual void Notify(const SfxHint&) override; public: explicit Impl(SwXNumberingRules& rParent) : m_rParent(rParent) {} }; bool SwXNumberingRules::isInvalidStyle(const OUString &rName) { return rName == aInvalidStyle; } namespace { class theSwXNumberingRulesUnoTunnelId : public rtl::Static< UnoTunnelIdInit, theSwXNumberingRulesUnoTunnelId > {}; } const uno::Sequence< sal_Int8 > & SwXNumberingRules::getUnoTunnelId() { return theSwXNumberingRulesUnoTunnelId::get().getSeq(); } // return implementation specific data sal_Int64 SwXNumberingRules::getSomething( const uno::Sequence< sal_Int8 > & rId ) { if( rId.getLength() == 16 && 0 == memcmp( getUnoTunnelId().getConstArray(), rId.getConstArray(), 16 ) ) { return sal::static_int_cast< sal_Int64 >( reinterpret_cast< sal_IntPtr >(this) ); } return 0; } OUString SwXNumberingRules::getImplementationName() { return OUString("SwXNumberingRules"); } sal_Bool SwXNumberingRules::supportsService(const OUString& rServiceName) { return cppu::supportsService(this, rServiceName); } Sequence< OUString > SwXNumberingRules::getSupportedServiceNames() { Sequence aRet { "com.sun.star.text.NumberingRules" }; return aRet; } SwXNumberingRules::SwXNumberingRules(const SwNumRule& rRule, SwDoc* doc) : m_pImpl(new SwXNumberingRules::Impl(*this)), pDoc(doc), pDocShell(nullptr), pNumRule(new SwNumRule(rRule)), m_pPropertySet(GetNumberingRulesSet()), bOwnNumRuleCreated(true) { // first organize the document - it is dependent on the set character formats // if no format is set, it should work as well for( sal_uInt16 i = 0; i < MAXLEVEL; ++i) { SwNumFormat rFormat(pNumRule->Get(i)); SwCharFormat* pCharFormat = rFormat.GetCharFormat(); if(pCharFormat) { pDoc = pCharFormat->GetDoc(); break; } } if(pDoc) m_pImpl->StartListening(GetPageDescNotifier(pDoc)); for(sal_uInt16 i = 0; i < MAXLEVEL; ++i) { m_sNewCharStyleNames[i] = aInvalidStyle; m_sNewBulletFontNames[i] = aInvalidStyle; } } SwXNumberingRules::SwXNumberingRules(SwDocShell& rDocSh) : m_pImpl(new SwXNumberingRules::Impl(*this)), pDoc(nullptr), pDocShell(&rDocSh), pNumRule(nullptr), m_pPropertySet(GetNumberingRulesSet()), bOwnNumRuleCreated(false) { m_pImpl->StartListening(GetPageDescNotifier(pDocShell->GetDoc())); } SwXNumberingRules::SwXNumberingRules(SwDoc& rDoc) : m_pImpl(new SwXNumberingRules::Impl(*this)), pDoc(&rDoc), pDocShell(nullptr), pNumRule(nullptr), m_pPropertySet(GetNumberingRulesSet()), bOwnNumRuleCreated(false) { m_pImpl->StartListening(GetPageDescNotifier(&rDoc)); m_sCreatedNumRuleName = rDoc.GetUniqueNumRuleName(); rDoc.MakeNumRule( m_sCreatedNumRuleName, nullptr, false, // #i89178# numfunc::GetDefaultPositionAndSpaceMode() ); } SwXNumberingRules::~SwXNumberingRules() { SolarMutexGuard aGuard; if(pDoc && !m_sCreatedNumRuleName.isEmpty()) pDoc->DelNumRule( m_sCreatedNumRuleName ); if( bOwnNumRuleCreated ) delete pNumRule; } void SwXNumberingRules::replaceByIndex(sal_Int32 nIndex, const uno::Any& rElement) { SolarMutexGuard aGuard; if(nIndex < 0 || MAXLEVEL <= nIndex) throw lang::IndexOutOfBoundsException(); auto rProperties = o3tl::tryAccess>( rElement); if(!rProperties) throw lang::IllegalArgumentException(); SwNumRule* pRule = nullptr; if(pNumRule) SwXNumberingRules::SetNumberingRuleByIndex( *pNumRule, *rProperties, nIndex); else if(pDocShell) { // #i87650# - correction of cws warnings: SwNumRule aNumRule( *(pDocShell->GetDoc()->GetOutlineNumRule()) ); SwXNumberingRules::SetNumberingRuleByIndex( aNumRule, *rProperties, nIndex); // set character format if needed const SwCharFormats* pFormats = pDocShell->GetDoc()->GetCharFormats(); const size_t nChCount = pFormats->size(); for(sal_uInt16 i = 0; i < MAXLEVEL;i++) { SwNumFormat aFormat(aNumRule.Get( i )); if (!m_sNewCharStyleNames[i].isEmpty() && m_sNewCharStyleNames[i] != UNO_NAME_CHARACTER_FORMAT_NONE && (!aFormat.GetCharFormat() || aFormat.GetCharFormat()->GetName()!= m_sNewCharStyleNames[i])) { SwCharFormat* pCharFormat = nullptr; for(size_t j = 0; j< nChCount; ++j) { SwCharFormat* pTmp = (*pFormats)[j]; if(pTmp->GetName() == m_sNewCharStyleNames[i]) { pCharFormat = pTmp; break; } } if(!pCharFormat) { SfxStyleSheetBase* pBase; pBase = pDocShell->GetStyleSheetPool()->Find(m_sNewCharStyleNames[i], SfxStyleFamily::Char); if(!pBase) pBase = &pDocShell->GetStyleSheetPool()->Make(m_sNewCharStyleNames[i], SfxStyleFamily::Char); pCharFormat = static_cast(pBase)->GetCharFormat(); } aFormat.SetCharFormat( pCharFormat ); aNumRule.Set( i, aFormat ); } } pDocShell->GetDoc()->SetOutlineNumRule( aNumRule ); } else if(!pNumRule && pDoc && !m_sCreatedNumRuleName.isEmpty() && nullptr != (pRule = pDoc->FindNumRulePtr( m_sCreatedNumRuleName ))) { SwXNumberingRules::SetNumberingRuleByIndex( *pRule, *rProperties, nIndex); pRule->Validate(); } else throw uno::RuntimeException(); } sal_Int32 SwXNumberingRules::getCount() { return MAXLEVEL; } uno::Any SwXNumberingRules::getByIndex(sal_Int32 nIndex) { SolarMutexGuard aGuard; if(nIndex < 0 || MAXLEVEL <= nIndex) throw lang::IndexOutOfBoundsException(); uno::Any aVal; const SwNumRule* pRule = pNumRule; if(!pRule && pDoc && !m_sCreatedNumRuleName.isEmpty()) pRule = pDoc->FindNumRulePtr( m_sCreatedNumRuleName ); if(pRule) { uno::Sequence aRet = GetNumberingRuleByIndex( *pRule, nIndex); aVal <<= aRet; } else if(pDocShell) { uno::Sequence aRet = GetNumberingRuleByIndex( *pDocShell->GetDoc()->GetOutlineNumRule(), nIndex); aVal <<= aRet; } else throw uno::RuntimeException(); return aVal; } uno::Type SwXNumberingRules::getElementType() { return cppu::UnoType>::get(); } sal_Bool SwXNumberingRules::hasElements() { return true; } static const char* STR_POOLCOLL_HEADLINE_ARY[] { STR_POOLCOLL_HEADLINE1, STR_POOLCOLL_HEADLINE2, STR_POOLCOLL_HEADLINE3, STR_POOLCOLL_HEADLINE4, STR_POOLCOLL_HEADLINE5, STR_POOLCOLL_HEADLINE6, STR_POOLCOLL_HEADLINE7, STR_POOLCOLL_HEADLINE8, STR_POOLCOLL_HEADLINE9, STR_POOLCOLL_HEADLINE10 }; uno::Sequence SwXNumberingRules::GetNumberingRuleByIndex( const SwNumRule& rNumRule, sal_Int32 nIndex) const { SolarMutexGuard aGuard; OSL_ENSURE( 0 <= nIndex && nIndex < MAXLEVEL, "index out of range" ); const SwNumFormat& rFormat = rNumRule.Get( static_cast(nIndex) ); SwCharFormat* pCharFormat = rFormat.GetCharFormat(); OUString CharStyleName; if (pCharFormat) CharStyleName = pCharFormat->GetName(); // Whether or not a style is present: the array entry overwrites this string if (!m_sNewCharStyleNames[nIndex].isEmpty() && !SwXNumberingRules::isInvalidStyle(m_sNewCharStyleNames[nIndex])) { CharStyleName = m_sNewCharStyleNames[nIndex]; } OUString aUString; if (pDocShell) // -> Chapter Numbering { // template name OUString sValue(SwResId(STR_POOLCOLL_HEADLINE_ARY[nIndex])); const SwTextFormatColls* pColls = pDocShell->GetDoc()->GetTextFormatColls(); const size_t nCount = pColls->size(); for(size_t i = 0; i < nCount; ++i) { SwTextFormatColl &rTextColl = *pColls->operator[](i); if(rTextColl.IsDefault()) continue; const sal_Int16 nOutLevel = rTextColl.IsAssignedToListLevelOfOutlineStyle() ? static_cast(rTextColl.GetAssignedOutlineStyleLevel()) : MAXLEVEL; if ( nOutLevel == nIndex ) { sValue = rTextColl.GetName(); break; // the style for the level in question has been found } else if( sValue==rTextColl.GetName() ) { // if the default for the level is existing, but its // level is different, then it cannot be the default. sValue.clear(); } } SwStyleNameMapper::FillProgName(sValue, aUString, SwGetPoolIdFromName::TxtColl); } return GetPropertiesForNumFormat(rFormat, CharStyleName, (pDocShell) ? & aUString : nullptr); } uno::Sequence SwXNumberingRules::GetPropertiesForNumFormat( const SwNumFormat& rFormat, OUString const& rCharFormatName, OUString const*const pHeadingStyleName) { bool bChapterNum = pHeadingStyleName != nullptr; std::vector aPropertyValues; aPropertyValues.reserve(32); //fill all properties into the array //adjust SvxAdjust eAdj = rFormat.GetNumAdjust(); sal_Int16 nINT16 = aSvxToUnoAdjust[eAdj]; aPropertyValues.push_back(comphelper::makePropertyValue("Adjust", nINT16)); //parentnumbering nINT16 = rFormat.GetIncludeUpperLevels(); aPropertyValues.push_back(comphelper::makePropertyValue("ParentNumbering", nINT16)); //prefix OUString aUString = rFormat.GetPrefix(); aPropertyValues.push_back(comphelper::makePropertyValue("Prefix", aUString)); //suffix aUString = rFormat.GetSuffix(); aPropertyValues.push_back(comphelper::makePropertyValue("Suffix", aUString)); //char style name aUString.clear(); SwStyleNameMapper::FillProgName( rCharFormatName, aUString, SwGetPoolIdFromName::ChrFmt); aPropertyValues.push_back(comphelper::makePropertyValue("CharStyleName", aUString)); //startvalue nINT16 = rFormat.GetStart(); aPropertyValues.push_back(comphelper::makePropertyValue("StartWith", nINT16)); if ( rFormat.GetPositionAndSpaceMode() == SvxNumberFormat::LABEL_WIDTH_AND_POSITION ) { //leftmargin sal_Int32 nINT32 = convertTwipToMm100(rFormat.GetAbsLSpace()); aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_LEFT_MARGIN, nINT32)); //chartextoffset nINT32 = convertTwipToMm100(rFormat.GetCharTextDistance()); aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_SYMBOL_TEXT_DISTANCE, nINT32)); //firstlineoffset nINT32 = convertTwipToMm100(rFormat.GetFirstLineOffset()); aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_FIRST_LINE_OFFSET, nINT32)); } // PositionAndSpaceMode nINT16 = PositionAndSpaceMode::LABEL_WIDTH_AND_POSITION; if ( rFormat.GetPositionAndSpaceMode() == SvxNumberFormat::LABEL_ALIGNMENT ) { nINT16 = PositionAndSpaceMode::LABEL_ALIGNMENT; } aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_POSITION_AND_SPACE_MODE, nINT16)); if ( rFormat.GetPositionAndSpaceMode() == SvxNumberFormat::LABEL_ALIGNMENT ) { // LabelFollowedBy nINT16 = LabelFollow::LISTTAB; if ( rFormat.GetLabelFollowedBy() == SvxNumberFormat::SPACE ) { nINT16 = LabelFollow::SPACE; } else if ( rFormat.GetLabelFollowedBy() == SvxNumberFormat::NOTHING ) { nINT16 = LabelFollow::NOTHING; } else if ( rFormat.GetLabelFollowedBy() == SvxNumberFormat::NEWLINE ) { nINT16 = LabelFollow::NEWLINE; } aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_LABEL_FOLLOWED_BY, nINT16)); // ListtabStopPosition sal_Int32 nINT32 = convertTwipToMm100(rFormat.GetListtabPos()); aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_LISTTAB_STOP_POSITION, nINT32)); // FirstLineIndent nINT32 = convertTwipToMm100(rFormat.GetFirstLineIndent()); aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_FIRST_LINE_INDENT, nINT32)); // IndentAt nINT32 = convertTwipToMm100(rFormat.GetIndentAt()); aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_INDENT_AT, nINT32)); } //numberingtype nINT16 = rFormat.GetNumberingType(); aPropertyValues.push_back(comphelper::makePropertyValue("NumberingType", nINT16)); if(!bChapterNum) { if(SVX_NUM_CHAR_SPECIAL == rFormat.GetNumberingType()) { //BulletId nINT16 = rFormat.GetBulletChar(); aPropertyValues.push_back(comphelper::makePropertyValue("BulletId", nINT16)); const vcl::Font* pFont = rFormat.GetBulletFont(); //BulletChar aUString = OUString(rFormat.GetBulletChar()); aPropertyValues.push_back(comphelper::makePropertyValue("BulletChar", aUString)); //BulletFontName aUString = pFont ? pFont->GetStyleName() : OUString(); aPropertyValues.push_back(comphelper::makePropertyValue("BulletFontName", aUString)); //BulletFont if(pFont) { awt::FontDescriptor aDesc; SvxUnoFontDescriptor::ConvertFromFont( *pFont, aDesc ); aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_BULLET_FONT, aDesc)); } } if (SVX_NUM_BITMAP == rFormat.GetNumberingType()) { const SvxBrushItem* pBrush = rFormat.GetBrush(); const Graphic* pGraphic = pBrush ? pBrush->GetGraphic() : nullptr; if (pGraphic) { //GraphicBitmap uno::Reference xBitmap(pGraphic->GetXGraphic(), uno::UNO_QUERY); aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_GRAPHIC_BITMAP, xBitmap)); } Size aSize = rFormat.GetGraphicSize(); // #i101131# // adjust conversion due to type mismatch between and awt::Size aAwtSize(convertTwipToMm100(aSize.Width()), convertTwipToMm100(aSize.Height())); aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_GRAPHIC_SIZE, aAwtSize)); const SwFormatVertOrient* pOrient = rFormat.GetGraphicOrientation(); if(pOrient) { uno::Any any; pOrient->QueryValue(any); aPropertyValues.emplace_back( UNO_NAME_VERT_ORIENT, -1, any, PropertyState_DIRECT_VALUE); } } } else { aUString = *pHeadingStyleName; aPropertyValues.push_back(comphelper::makePropertyValue(UNO_NAME_HEADING_STYLE_NAME, aUString)); } return ::comphelper::containerToSequence(aPropertyValues); } static PropertyValue const* lcl_FindProperty( const char* cName, std::vector const& rPropertyValues) { const OUString sCmp = OUString::createFromAscii(cName); for(const PropertyValue* pTemp : rPropertyValues) { if (sCmp == pTemp->Name) return pTemp; } return nullptr; } void SwXNumberingRules::SetNumberingRuleByIndex( SwNumRule& rNumRule, const uno::Sequence& rProperties, sal_Int32 nIndex) { SolarMutexGuard aGuard; OSL_ENSURE( 0 <= nIndex && nIndex < MAXLEVEL, "index out of range" ); SwNumFormat aFormat(rNumRule.Get( static_cast(nIndex) )); OUString sHeadingStyleName; OUString sParagraphStyleName; SetPropertiesToNumFormat(aFormat, m_sNewCharStyleNames[nIndex], &m_sNewBulletFontNames[nIndex], &sHeadingStyleName, &sParagraphStyleName, pDoc, pDocShell, rProperties); if (pDoc && !sParagraphStyleName.isEmpty()) { const SwTextFormatColls* pColls = pDoc->GetTextFormatColls(); const size_t nCount = pColls->size(); for (size_t k = 0; k < nCount; ++k) { SwTextFormatColl &rTextColl = *((*pColls)[k]); if (rTextColl.GetName() == sParagraphStyleName) rTextColl.SetFormatAttr( SwNumRuleItem( rNumRule.GetName())); } } if (!sHeadingStyleName.isEmpty()) { assert(pDocShell); const SwTextFormatColls* pColls = pDocShell->GetDoc()->GetTextFormatColls(); const size_t nCount = pColls->size(); for (size_t k = 0; k < nCount; ++k) { SwTextFormatColl &rTextColl = *((*pColls)[k]); if (rTextColl.IsDefault()) continue; if (rTextColl.IsAssignedToListLevelOfOutlineStyle() && rTextColl.GetAssignedOutlineStyleLevel() == nIndex && rTextColl.GetName() != sHeadingStyleName) { rTextColl.DeleteAssignmentToListLevelOfOutlineStyle(); } else if (rTextColl.GetName() == sHeadingStyleName) { rTextColl.AssignToListLevelOfOutlineStyle( nIndex ); } } } rNumRule.Set(static_cast(nIndex), aFormat); } void SwXNumberingRules::SetPropertiesToNumFormat( SwNumFormat & aFormat, OUString & rCharStyleName, OUString *const pBulletFontName, OUString *const pHeadingStyleName, OUString *const pParagraphStyleName, SwDoc *const pDoc, SwDocShell *const pDocShell, const uno::Sequence& rProperties) { // the order of the names is important! static const char* aNumPropertyNames[] = { UNO_NAME_ADJUST, // 0 UNO_NAME_PARENT_NUMBERING, // 1 UNO_NAME_PREFIX, // 2 UNO_NAME_SUFFIX, // 3 UNO_NAME_CHAR_STYLE_NAME, // 4 UNO_NAME_START_WITH, // 5 UNO_NAME_LEFT_MARGIN, // 6 UNO_NAME_SYMBOL_TEXT_DISTANCE, // 7 UNO_NAME_FIRST_LINE_OFFSET, // 8 UNO_NAME_POSITION_AND_SPACE_MODE, // 9 UNO_NAME_LABEL_FOLLOWED_BY, // 10 UNO_NAME_LISTTAB_STOP_POSITION, // 11 UNO_NAME_FIRST_LINE_INDENT, // 12 UNO_NAME_INDENT_AT, // 13 UNO_NAME_NUMBERING_TYPE, // 14 UNO_NAME_PARAGRAPH_STYLE_NAME, // 15 // these are not in chapter numbering UNO_NAME_BULLET_ID, // 16 UNO_NAME_BULLET_FONT, // 17 UNO_NAME_BULLET_FONT_NAME, // 18 UNO_NAME_BULLET_CHAR, // 19 UNO_NAME_GRAPHIC, // 20 UNO_NAME_GRAPHIC_BITMAP, // 21 UNO_NAME_GRAPHIC_SIZE, // 22 UNO_NAME_VERT_ORIENT, // 23 // these are only in chapter numbering UNO_NAME_HEADING_STYLE_NAME, // 24 // these two are accepted but ignored for some reason UNO_NAME_BULLET_REL_SIZE, // 25 UNO_NAME_BULLET_COLOR, // 26 UNO_NAME_GRAPHIC_URL // 27 }; enum { NotInChapterFirst = 16, NotInChapterLast = 23, InChapterFirst = 24, InChapterLast = 24 }; const beans::PropertyValue* pPropArray = rProperties.getConstArray(); std::vector aPropertyValues; bool bExcept = false; for(sal_Int32 i = 0; i < rProperties.getLength() && !bExcept; i++) { const beans::PropertyValue& rProp = pPropArray[i]; bExcept = true; for(size_t j = 0; j < SAL_N_ELEMENTS( aNumPropertyNames ); j++) { if (pDocShell && j >= static_cast(NotInChapterFirst) && j <= static_cast(NotInChapterLast)) continue; if (!pDocShell && j >= static_cast(InChapterFirst) && j <= static_cast(InChapterLast)) continue; if (rProp.Name.equalsAscii(aNumPropertyNames[j])) { bExcept = false; break; } } SAL_WARN_IF( bExcept, "sw.uno", "Unknown/incorrect property " << rProp.Name << ", failing" ); aPropertyValues.push_back(& rProp); } bool bWrongArg = false; if(!bExcept) { SvxBrushItem* pSetBrush = nullptr; Size* pSetSize = nullptr; SwFormatVertOrient* pSetVOrient = nullptr; bool bCharStyleNameSet = false; for(size_t i = 0; i < SAL_N_ELEMENTS( aNumPropertyNames ) && !bExcept && !bWrongArg; ++i) { PropertyValue const*const pProp( lcl_FindProperty(aNumPropertyNames[i], aPropertyValues)); if (!pProp) continue; switch(i) { case 0: //"Adjust" { sal_Int16 nValue = text::HoriOrientation::NONE; pProp->Value >>= nValue; if (nValue > text::HoriOrientation::NONE && nValue <= text::HoriOrientation::LEFT && USHRT_MAX != aUnoToSvxAdjust[nValue]) { aFormat.SetNumAdjust(static_cast(aUnoToSvxAdjust[nValue])); } else bWrongArg = true; } break; case 1: //"ParentNumbering", { sal_Int16 nSet = 0; pProp->Value >>= nSet; if(nSet >= 0 && MAXLEVEL >= nSet) aFormat.SetIncludeUpperLevels( static_cast< sal_uInt8 >(nSet) ); } break; case 2: //"Prefix", { OUString uTmp; pProp->Value >>= uTmp; aFormat.SetPrefix(uTmp); } break; case 3: //"Suffix", { OUString uTmp; pProp->Value >>= uTmp; aFormat.SetSuffix(uTmp); } break; case 4: //"CharStyleName", { bCharStyleNameSet = true; OUString uTmp; pProp->Value >>= uTmp; OUString sCharFormatName; SwStyleNameMapper::FillUIName( uTmp, sCharFormatName, SwGetPoolIdFromName::ChrFmt ); if (sCharFormatName == UNO_NAME_CHARACTER_FORMAT_NONE) { rCharStyleName = aInvalidStyle; aFormat.SetCharFormat(nullptr); } else if(pDocShell || pDoc) { SwDoc* pLocalDoc = pDoc ? pDoc : pDocShell->GetDoc(); const SwCharFormats* pFormats = pLocalDoc->GetCharFormats(); const size_t nChCount = pFormats->size(); SwCharFormat* pCharFormat = nullptr; if (!sCharFormatName.isEmpty()) { for(size_t j = 0; j< nChCount; ++j) { SwCharFormat* pTmp = (*pFormats)[j]; if(pTmp->GetName() == sCharFormatName) { pCharFormat = pTmp; break; } } if(!pCharFormat) { SfxStyleSheetBase* pBase; SfxStyleSheetBasePool* pPool = pLocalDoc->GetDocShell()->GetStyleSheetPool(); pBase = pPool->Find(sCharFormatName, SfxStyleFamily::Char); if(!pBase) pBase = &pPool->Make(sCharFormatName, SfxStyleFamily::Char); pCharFormat = static_cast(pBase)->GetCharFormat(); } } aFormat.SetCharFormat( pCharFormat ); // #i51842# // If the character format has been found its name should not be in the // char style names array rCharStyleName.clear(); } else rCharStyleName = sCharFormatName; } break; case 5: //"StartWith", { sal_Int16 nVal = 0; pProp->Value >>= nVal; aFormat.SetStart(nVal); } break; case 6: //UNO_NAME_LEFT_MARGIN, { sal_Int32 nValue = 0; pProp->Value >>= nValue; // #i23727# nValue can be negative aFormat.SetAbsLSpace(static_cast(convertMm100ToTwip(nValue))); } break; case 7: //UNO_NAME_SYMBOL_TEXT_DISTANCE, { sal_Int32 nValue = 0; pProp->Value >>= nValue; if(nValue >= 0) aFormat.SetCharTextDistance(static_cast(convertMm100ToTwip(nValue))); else bWrongArg = true; } break; case 8: //UNO_NAME_FIRST_LINE_OFFSET, { sal_Int32 nValue = 0; pProp->Value >>= nValue; // #i23727# nValue can be positive nValue = convertMm100ToTwip(nValue); aFormat.SetFirstLineOffset(static_cast(nValue)); } break; case 9: // UNO_NAME_POSITION_AND_SPACE_MODE { sal_Int16 nValue = 0; pProp->Value >>= nValue; if ( nValue == 0 ) { aFormat.SetPositionAndSpaceMode( SvxNumberFormat::LABEL_WIDTH_AND_POSITION ); } else if ( nValue == 1 ) { aFormat.SetPositionAndSpaceMode( SvxNumberFormat::LABEL_ALIGNMENT ); } else { bWrongArg = true; } } break; case 10: // UNO_NAME_LABEL_FOLLOWED_BY { sal_Int16 nValue = 0; pProp->Value >>= nValue; if ( nValue == LabelFollow::LISTTAB ) { aFormat.SetLabelFollowedBy( SvxNumberFormat::LISTTAB ); } else if ( nValue == LabelFollow::SPACE ) { aFormat.SetLabelFollowedBy( SvxNumberFormat::SPACE ); } else if ( nValue == LabelFollow::NOTHING ) { aFormat.SetLabelFollowedBy( SvxNumberFormat::NOTHING ); } else if ( nValue == LabelFollow::NEWLINE ) { aFormat.SetLabelFollowedBy( SvxNumberFormat::NEWLINE ); } else { bWrongArg = true; } } break; case 11: // UNO_NAME_LISTTAB_STOP_POSITION { sal_Int32 nValue = 0; pProp->Value >>= nValue; nValue = convertMm100ToTwip(nValue); if ( nValue >= 0 ) { aFormat.SetListtabPos( nValue ); } else { bWrongArg = true; } } break; case 12: // UNO_NAME_FIRST_LINE_INDENT { sal_Int32 nValue = 0; pProp->Value >>= nValue; nValue = convertMm100ToTwip(nValue); aFormat.SetFirstLineIndent( nValue ); } break; case 13: // UNO_NAME_INDENT_AT { sal_Int32 nValue = 0; pProp->Value >>= nValue; nValue = convertMm100ToTwip(nValue); aFormat.SetIndentAt( nValue ); } break; case 14: //"NumberingType" { sal_Int16 nSet = 0; pProp->Value >>= nSet; if(nSet >= 0) aFormat.SetNumberingType(static_cast(nSet)); else bWrongArg = true; } break; case 15: //"ParagraphStyleName" { if (pParagraphStyleName) { OUString uTmp; pProp->Value >>= uTmp; OUString sStyleName; SwStyleNameMapper::FillUIName(uTmp, sStyleName, SwGetPoolIdFromName::TxtColl ); *pParagraphStyleName = sStyleName; } } break; case 16: //"BulletId", { assert( !pDocShell ); sal_Int16 nSet = 0; if( pProp->Value >>= nSet ) aFormat.SetBulletChar(nSet); else bWrongArg = true; } break; case 17: //UNO_NAME_BULLET_FONT, { assert( !pDocShell ); awt::FontDescriptor desc; if (pProp->Value >>= desc) { // #i93725# // do not accept "empty" font if (!desc.Name.isEmpty()) { vcl::Font aFont; SvxUnoFontDescriptor::ConvertToFont(desc, aFont); aFormat.SetBulletFont(&aFont); } } else bWrongArg = true; } break; case 18: //"BulletFontName", { assert( !pDocShell ); OUString sBulletFontName; pProp->Value >>= sBulletFontName; SwDocShell* pLclDocShell = pDocShell ? pDocShell : pDoc ? pDoc->GetDocShell() : nullptr; if( !sBulletFontName.isEmpty() && pLclDocShell ) { const SvxFontListItem* pFontListItem = static_cast(pLclDocShell ->GetItem( SID_ATTR_CHAR_FONTLIST )); const FontList* pList = pFontListItem->GetFontList(); FontMetric aFontMetric = pList->Get( sBulletFontName, WEIGHT_NORMAL, ITALIC_NONE); vcl::Font aFont(aFontMetric); aFormat.SetBulletFont(&aFont); } else if (pBulletFontName) *pBulletFontName = sBulletFontName; } break; case 19: //"BulletChar", { assert( !pDocShell ); OUString aChar; pProp->Value >>= aChar; if(aChar.getLength() == 1) { aFormat.SetBulletChar(aChar.toChar()); } else if(aChar.isEmpty()) { // If w:lvlText's value is null - set bullet char to zero aFormat.SetBulletChar(u'\0'); } else { bWrongArg = true; } } break; case 20: //UNO_NAME_GRAPHIC, { assert( !pDocShell ); uno::Reference xGraphic; if (pProp->Value >>= xGraphic) { if (!pSetBrush) { const SvxBrushItem* pOrigBrush = aFormat.GetBrush(); if(pOrigBrush) { pSetBrush = new SvxBrushItem(*pOrigBrush); } else pSetBrush = new SvxBrushItem(OUString(), OUString(), GPOS_AREA, RES_BACKGROUND); } Graphic aGraphic(xGraphic); pSetBrush->SetGraphic(aGraphic); } else bWrongArg = true; } break; case 21: //UNO_NAME_GRAPHIC_BITMAP, { assert( !pDocShell ); uno::Reference xBitmap; if (pProp->Value >>= xBitmap) { if(!pSetBrush) { const SvxBrushItem* pOrigBrush = aFormat.GetBrush(); if(pOrigBrush) { pSetBrush = new SvxBrushItem(*pOrigBrush); } else pSetBrush = new SvxBrushItem(OUString(), OUString(), GPOS_AREA, RES_BACKGROUND); } uno::Reference xGraphic(xBitmap, uno::UNO_QUERY); Graphic aGraphic(xGraphic); pSetBrush->SetGraphic(aGraphic); } else bWrongArg = true; } break; case 22: //UNO_NAME_GRAPHIC_SIZE, { assert( !pDocShell ); if(!pSetSize) pSetSize = new Size; awt::Size size; if (pProp->Value >>= size) { size.Width = convertMm100ToTwip(size.Width); size.Height = convertMm100ToTwip(size.Height); pSetSize->setWidth( size.Width ); pSetSize->setHeight( size.Height ); } else bWrongArg = true; } break; case 23: //VertOrient { assert( !pDocShell ); if(!pSetVOrient) { if(aFormat.GetGraphicOrientation()) pSetVOrient = static_cast(aFormat.GetGraphicOrientation()->Clone()); else pSetVOrient = new SwFormatVertOrient; } pSetVOrient->PutValue(pProp->Value, MID_VERTORIENT_ORIENT); } break; case 24: //"HeadingStyleName" { if (pHeadingStyleName) { OUString uTmp; pProp->Value >>= uTmp; OUString sStyleName; SwStyleNameMapper::FillUIName(uTmp, sStyleName, SwGetPoolIdFromName::TxtColl ); *pHeadingStyleName = sStyleName; } } break; case 25: // BulletRelSize - unsupported - only available in Impress break; case 26: // BulletColor - ignored too break; case 27: // UNO_NAME_GRAPHIC_URL { assert( !pDocShell ); OUString aURL; if (pProp->Value >>= aURL) { if(!pSetBrush) { const SvxBrushItem* pOrigBrush = aFormat.GetBrush(); if(pOrigBrush) { pSetBrush = new SvxBrushItem(*pOrigBrush); } else pSetBrush = new SvxBrushItem(OUString(), OUString(), GPOS_AREA, RES_BACKGROUND); } Graphic aGraphic = vcl::graphic::loadFromURL(aURL); if (aGraphic) pSetBrush->SetGraphic(aGraphic); } else bWrongArg = true; } break; } } if(!bExcept && !bWrongArg && (pSetBrush || pSetSize || pSetVOrient)) { if(!pSetBrush && aFormat.GetBrush()) pSetBrush = new SvxBrushItem(*aFormat.GetBrush()); if(pSetBrush) { if(!pSetVOrient && aFormat.GetGraphicOrientation()) pSetVOrient = new SwFormatVertOrient(*aFormat.GetGraphicOrientation()); if(!pSetSize) { pSetSize = new Size(aFormat.GetGraphicSize()); if(!pSetSize->Width() || !pSetSize->Height()) { const Graphic* pGraphic = pSetBrush->GetGraphic(); if(pGraphic) *pSetSize = ::GetGraphicSizeTwip(*pGraphic, nullptr); } } sal_Int16 eOrient = pSetVOrient ? pSetVOrient->GetVertOrient() : text::VertOrientation::NONE; aFormat.SetGraphicBrush( pSetBrush, pSetSize, text::VertOrientation::NONE == eOrient ? nullptr : &eOrient ); } } if ((!bCharStyleNameSet || rCharStyleName.isEmpty()) && aFormat.GetNumberingType() == NumberingType::BITMAP && !aFormat.GetCharFormat() && !SwXNumberingRules::isInvalidStyle(rCharStyleName)) { OUString tmp; SwStyleNameMapper::FillProgName(RES_POOLCHR_BUL_LEVEL, tmp); rCharStyleName = tmp; } delete pSetBrush; delete pSetSize; delete pSetVOrient; } if(bWrongArg) throw lang::IllegalArgumentException(); else if(bExcept) throw uno::RuntimeException(); } uno::Reference< XPropertySetInfo > SwXNumberingRules::getPropertySetInfo() { static uno::Reference< beans::XPropertySetInfo > aRef = m_pPropertySet->getPropertySetInfo(); return aRef; } void SwXNumberingRules::setPropertyValue( const OUString& rPropertyName, const Any& rValue ) { SolarMutexGuard aGuard; SwNumRule* pDocRule = nullptr; SwNumRule* pCreatedRule = nullptr; if(!pNumRule) { if(!pNumRule && pDocShell) { pDocRule = new SwNumRule(*pDocShell->GetDoc()->GetOutlineNumRule()); } else if(pDoc && !m_sCreatedNumRuleName.isEmpty()) { pCreatedRule = pDoc->FindNumRulePtr(m_sCreatedNumRuleName); } } if(!pNumRule && !pDocRule && !pCreatedRule) throw RuntimeException(); if(rPropertyName == UNO_NAME_IS_AUTOMATIC) { bool bVal = *o3tl::doAccess(rValue); if(!pCreatedRule) pDocRule ? pDocRule->SetAutoRule(bVal) : pNumRule->SetAutoRule(bVal); } else if(rPropertyName == UNO_NAME_IS_CONTINUOUS_NUMBERING) { bool bVal = *o3tl::doAccess(rValue); pDocRule ? pDocRule->SetContinusNum(bVal) : pCreatedRule ? pCreatedRule->SetContinusNum(bVal) : pNumRule->SetContinusNum(bVal); } else if(rPropertyName == UNO_NAME_NAME) { delete pDocRule; throw IllegalArgumentException(); } else if(rPropertyName == UNO_NAME_IS_ABSOLUTE_MARGINS) { bool bVal = *o3tl::doAccess(rValue); pDocRule ? pDocRule->SetAbsSpaces(bVal) : pCreatedRule ? pCreatedRule->SetAbsSpaces(bVal) : pNumRule->SetAbsSpaces(bVal); } else if(rPropertyName == UNO_NAME_NUMBERING_IS_OUTLINE) { bool bVal = *o3tl::doAccess(rValue); SwNumRuleType eNumRuleType = bVal ? OUTLINE_RULE : NUM_RULE; pDocRule ? pDocRule->SetRuleType(eNumRuleType) : pCreatedRule ? pCreatedRule->SetRuleType(eNumRuleType) : pNumRule->SetRuleType(eNumRuleType); } else if(rPropertyName == UNO_NAME_DEFAULT_LIST_ID) { delete pDocRule; throw IllegalArgumentException(); } else throw UnknownPropertyException(); if(pDocRule) { pDocShell->GetDoc()->SetOutlineNumRule(*pDocRule); delete pDocRule; } else if(pCreatedRule) { pCreatedRule->Validate(); } } Any SwXNumberingRules::getPropertyValue( const OUString& rPropertyName ) { Any aRet; const SwNumRule* pRule = pNumRule; if(!pRule && pDocShell) pRule = pDocShell->GetDoc()->GetOutlineNumRule(); else if(pDoc && !m_sCreatedNumRuleName.isEmpty()) pRule = pDoc->FindNumRulePtr( m_sCreatedNumRuleName ); if(!pRule) throw RuntimeException(); if(rPropertyName == UNO_NAME_IS_AUTOMATIC) { aRet <<= pRule->IsAutoRule(); } else if(rPropertyName == UNO_NAME_IS_CONTINUOUS_NUMBERING) { aRet <<= pRule->IsContinusNum(); } else if(rPropertyName == UNO_NAME_NAME) aRet <<= pRule->GetName(); else if(rPropertyName == UNO_NAME_IS_ABSOLUTE_MARGINS) { aRet <<= pRule->IsAbsSpaces(); } else if(rPropertyName == UNO_NAME_NUMBERING_IS_OUTLINE) { aRet <<= pRule->IsOutlineRule(); } else if(rPropertyName == UNO_NAME_DEFAULT_LIST_ID) { OSL_ENSURE( !pRule->GetDefaultListId().isEmpty(), " - no default list id found. Serious defect." ); aRet <<= pRule->GetDefaultListId(); } else throw UnknownPropertyException(); return aRet; } void SwXNumberingRules::addPropertyChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< XPropertyChangeListener >& /*xListener*/ ) { } void SwXNumberingRules::removePropertyChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< XPropertyChangeListener >& /*xListener*/ ) { } void SwXNumberingRules::addVetoableChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< XVetoableChangeListener >& /*xListener*/ ) { } void SwXNumberingRules::removeVetoableChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< XVetoableChangeListener >& /*xListener*/ ) { } OUString SwXNumberingRules::getName() { if(pNumRule) { OUString aString; SwStyleNameMapper::FillProgName(pNumRule->GetName(), aString, SwGetPoolIdFromName::NumRule ); return aString; } // consider chapter numbering if ( pDocShell ) { OUString aString; SwStyleNameMapper::FillProgName( pDocShell->GetDoc()->GetOutlineNumRule()->GetName(), aString, SwGetPoolIdFromName::NumRule ); return aString; } return m_sCreatedNumRuleName; } void SwXNumberingRules::setName(const OUString& /*rName*/) { RuntimeException aExcept; aExcept.Message = "readonly"; throw aExcept; } void SwXNumberingRules::Impl::Notify(const SfxHint& rHint) { if(rHint.GetId() == SfxHintId::Dying) { if(m_rParent.bOwnNumRuleCreated) delete m_rParent.pNumRule; m_rParent.pNumRule = nullptr; m_rParent.pDoc = nullptr; } } OUString SwXChapterNumbering::getImplementationName() { return OUString("SwXChapterNumbering"); } sal_Bool SwXChapterNumbering::supportsService(const OUString& rServiceName) { return cppu::supportsService(this, rServiceName); } Sequence< OUString > SwXChapterNumbering::getSupportedServiceNames() { Sequence< OUString > aRet(2); OUString* pArray = aRet.getArray(); pArray[0] = "com.sun.star.text.ChapterNumbering"; pArray[1] = "com.sun.star.text.NumberingRules"; return aRet; } SwXChapterNumbering::SwXChapterNumbering(SwDocShell& rDocSh) : SwXNumberingRules(rDocSh) { } SwXChapterNumbering::~SwXChapterNumbering() { } OUString SwXTextColumns::getImplementationName() { return OUString("SwXTextColumns"); } sal_Bool SwXTextColumns::supportsService(const OUString& rServiceName) { return cppu::supportsService(this, rServiceName); } Sequence< OUString > SwXTextColumns::getSupportedServiceNames() { Sequence aRet { "com.sun.star.text.TextColumns" }; return aRet; } SwXTextColumns::SwXTextColumns() : nReference(0), bIsAutomaticWidth(true), nAutoDistance(0), m_pPropSet(aSwMapProvider.GetPropertySet(PROPERTY_MAP_TEXT_COLUMS)), nSepLineWidth(0), nSepLineColor(0), //black nSepLineHeightRelative(100),//full height nSepLineVertAlign(style::VerticalAlignment_MIDDLE), bSepLineIsOn(false), nSepLineStyle(API_COL_LINE_NONE) // None { } SwXTextColumns::SwXTextColumns(const SwFormatCol& rFormatCol) : nReference(0), aTextColumns(rFormatCol.GetNumCols()), bIsAutomaticWidth(rFormatCol.IsOrtho()), m_pPropSet(aSwMapProvider.GetPropertySet(PROPERTY_MAP_TEXT_COLUMS)) { const sal_uInt16 nItemGutterWidth = rFormatCol.GetGutterWidth(); nAutoDistance = bIsAutomaticWidth ? USHRT_MAX == nItemGutterWidth ? DEF_GUTTER_WIDTH : static_cast(nItemGutterWidth) : 0; nAutoDistance = convertTwipToMm100(nAutoDistance); TextColumn* pColumns = aTextColumns.getArray(); const SwColumns& rCols = rFormatCol.GetColumns(); for(sal_Int32 i = 0; i < aTextColumns.getLength(); ++i) { const SwColumn* pCol = &rCols[i]; pColumns[i].Width = pCol->GetWishWidth(); nReference += pColumns[i].Width; pColumns[i].LeftMargin = convertTwipToMm100(pCol->GetLeft ()); pColumns[i].RightMargin = convertTwipToMm100(pCol->GetRight()); } if(!aTextColumns.getLength()) nReference = USHRT_MAX; nSepLineWidth = rFormatCol.GetLineWidth(); nSepLineColor = rFormatCol.GetLineColor(); nSepLineHeightRelative = rFormatCol.GetLineHeight(); bSepLineIsOn = rFormatCol.GetLineAdj() != COLADJ_NONE; sal_Int8 nStyle = API_COL_LINE_NONE; switch (rFormatCol.GetLineStyle()) { case SvxBorderLineStyle::SOLID: nStyle = API_COL_LINE_SOLID; break; case SvxBorderLineStyle::DOTTED: nStyle= API_COL_LINE_DOTTED; break; case SvxBorderLineStyle::DASHED: nStyle= API_COL_LINE_DASHED; break; default: break; } nSepLineStyle = nStyle; switch(rFormatCol.GetLineAdj()) { case COLADJ_TOP: nSepLineVertAlign = style::VerticalAlignment_TOP; break; case COLADJ_BOTTOM: nSepLineVertAlign = style::VerticalAlignment_BOTTOM; break; case COLADJ_CENTER: case COLADJ_NONE: nSepLineVertAlign = style::VerticalAlignment_MIDDLE; } } SwXTextColumns::~SwXTextColumns() { } sal_Int32 SwXTextColumns::getReferenceValue() { SolarMutexGuard aGuard; return nReference; } sal_Int16 SwXTextColumns::getColumnCount() { SolarMutexGuard aGuard; return static_cast< sal_Int16>( aTextColumns.getLength() ); } void SwXTextColumns::setColumnCount(sal_Int16 nColumns) { SolarMutexGuard aGuard; if(nColumns <= 0) throw uno::RuntimeException(); bIsAutomaticWidth = true; aTextColumns.realloc(nColumns); TextColumn* pCols = aTextColumns.getArray(); nReference = USHRT_MAX; sal_Int32 nWidth = nReference / nColumns; sal_Int32 nDiff = nReference - nWidth * nColumns; sal_Int32 nDist = nAutoDistance / 2; for(sal_Int16 i = 0; i < nColumns; i++) { pCols[i].Width = nWidth; pCols[i].LeftMargin = i == 0 ? 0 : nDist; pCols[i].RightMargin = i == nColumns - 1 ? 0 : nDist; } pCols[nColumns - 1].Width += nDiff; } uno::Sequence< TextColumn > SwXTextColumns::getColumns() { SolarMutexGuard aGuard; return aTextColumns; } void SwXTextColumns::setColumns(const uno::Sequence< TextColumn >& rColumns) { SolarMutexGuard aGuard; sal_Int32 nReferenceTemp = 0; const TextColumn* prCols = rColumns.getConstArray(); for(long i = 0; i < rColumns.getLength(); i++) { nReferenceTemp += prCols[i].Width; } bIsAutomaticWidth = false; nReference = !nReferenceTemp ? USHRT_MAX : nReferenceTemp; aTextColumns = rColumns; } uno::Reference< XPropertySetInfo > SwXTextColumns::getPropertySetInfo( ) { static uno::Reference< beans::XPropertySetInfo > aRef = m_pPropSet->getPropertySetInfo(); return aRef; } void SwXTextColumns::setPropertyValue( const OUString& rPropertyName, const Any& aValue ) { const SfxItemPropertySimpleEntry* pEntry = m_pPropSet->getPropertyMap().getByName( rPropertyName ); if (!pEntry) throw UnknownPropertyException("Unknown property: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); if ( pEntry->nFlags & PropertyAttribute::READONLY) throw PropertyVetoException("Property is read-only: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); switch(pEntry->nWID) { case WID_TXTCOL_LINE_WIDTH: { sal_Int32 nTmp = 0; aValue >>= nTmp; if(nTmp < 0) throw IllegalArgumentException(); nSepLineWidth = convertMm100ToTwip(nTmp); } break; case WID_TXTCOL_LINE_COLOR: aValue >>= nSepLineColor; break; case WID_TXTCOL_LINE_STYLE: { aValue >>= nSepLineStyle; } break; case WID_TXTCOL_LINE_REL_HGT: { sal_Int8 nTmp = 0; aValue >>= nTmp; if(nTmp < 0) throw IllegalArgumentException(); nSepLineHeightRelative = nTmp; } break; case WID_TXTCOL_LINE_ALIGN: { style::VerticalAlignment eAlign; if(!(aValue >>= eAlign) ) { sal_Int8 nTmp = 0; if (! ( aValue >>= nTmp ) ) throw IllegalArgumentException(); nSepLineVertAlign = static_cast(nTmp); } else nSepLineVertAlign = eAlign; } break; case WID_TXTCOL_LINE_IS_ON: bSepLineIsOn = *o3tl::doAccess(aValue); break; case WID_TXTCOL_AUTO_DISTANCE: { sal_Int32 nTmp = 0; aValue >>= nTmp; if(nTmp < 0 || nTmp >= nReference) throw IllegalArgumentException(); nAutoDistance = nTmp; sal_Int32 nColumns = aTextColumns.getLength(); TextColumn* pCols = aTextColumns.getArray(); sal_Int32 nDist = nAutoDistance / 2; for(sal_Int32 i = 0; i < nColumns; i++) { pCols[i].LeftMargin = i == 0 ? 0 : nDist; pCols[i].RightMargin = i == nColumns - 1 ? 0 : nDist; } } break; } } Any SwXTextColumns::getPropertyValue( const OUString& rPropertyName ) { const SfxItemPropertySimpleEntry* pEntry = m_pPropSet->getPropertyMap().getByName( rPropertyName ); if (!pEntry) throw UnknownPropertyException("Unknown property: " + rPropertyName, static_cast < cppu::OWeakObject * > ( this ) ); Any aRet; switch(pEntry->nWID) { case WID_TXTCOL_LINE_WIDTH: aRet <<= static_cast < sal_Int32 >(convertTwipToMm100(nSepLineWidth)); break; case WID_TXTCOL_LINE_COLOR: aRet <<= nSepLineColor; break; case WID_TXTCOL_LINE_STYLE: aRet <<= nSepLineStyle; break; case WID_TXTCOL_LINE_REL_HGT: aRet <<= nSepLineHeightRelative; break; case WID_TXTCOL_LINE_ALIGN: aRet <<= nSepLineVertAlign; break; case WID_TXTCOL_LINE_IS_ON: aRet <<= bSepLineIsOn; break; case WID_TXTCOL_IS_AUTOMATIC : aRet <<= bIsAutomaticWidth; break; case WID_TXTCOL_AUTO_DISTANCE: aRet <<= nAutoDistance; break; } return aRet; } void SwXTextColumns::addPropertyChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< XPropertyChangeListener >& /*xListener*/ ) { } void SwXTextColumns::removePropertyChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< XPropertyChangeListener >& /*xListener*/ ) { } void SwXTextColumns::addVetoableChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< XVetoableChangeListener >& /*xListener*/ ) { } void SwXTextColumns::removeVetoableChangeListener( const OUString& /*rPropertyName*/, const uno::Reference< XVetoableChangeListener >& /*xListener*/ ) { } namespace { class theSwXTextColumnsUnoTunnelId : public rtl::Static< UnoTunnelIdInit, theSwXTextColumnsUnoTunnelId > {}; } const uno::Sequence< sal_Int8 > & SwXTextColumns::getUnoTunnelId() { return theSwXTextColumnsUnoTunnelId::get().getSeq(); } sal_Int64 SAL_CALL SwXTextColumns::getSomething( const uno::Sequence< sal_Int8 >& rId ) { if( rId.getLength() == 16 && 0 == memcmp( getUnoTunnelId().getConstArray(), rId.getConstArray(), 16 ) ) { return sal::static_int_cast< sal_Int64 >( reinterpret_cast< sal_IntPtr >(this) ); } return 0; } /* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
{
"url": "https://cgit.freedesktop.org/libreoffice/core/plain/sw/source/core/unocore/unosett.cxx?h=libreoffice-6-1&id=fd373f5f584d9de82cce76b98bd21f7dfe38844c",
"source_domain": "cgit.freedesktop.org",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "92920",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DBB7GUVGNRCZYRMRRN7PPZGJHZFIUJOK",
"WARC-Concurrent-To": "<urn:uuid:9eb6db2c-0b6f-4f4a-b6d5-b002bedd84cd>",
"WARC-Date": "2021-01-26T00:11:21Z",
"WARC-IP-Address": "131.252.210.161",
"WARC-Identified-Payload-Type": "text/x-c++src",
"WARC-Payload-Digest": "sha1:YPJJE44OYTAGQP6VR442IGRMKX3KSPIA",
"WARC-Record-ID": "<urn:uuid:7080b1cf-698b-44c1-8b96-bfe42b04262f>",
"WARC-Target-URI": "https://cgit.freedesktop.org/libreoffice/core/plain/sw/source/core/unocore/unosett.cxx?h=libreoffice-6-1&id=fd373f5f584d9de82cce76b98bd21f7dfe38844c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0218733c-8db0-4565-a2d3-ec80934f3a23>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-90.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
65366
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 65366,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.011351469904184341,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0520605593919754,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03818335011601448,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5201009511947632,
"rps_doc_frac_unique_words": 0.2970547676086426,
"rps_doc_mean_word_length": 11.365853309631348,
"rps_doc_num_sentences": 451,
"rps_doc_symbol_to_word_ratio": 0.008242219686508179,
"rps_doc_unigram_entropy": 6.133996963500977,
"rps_doc_word_count": 4346,
"rps_doc_frac_chars_dupe_10grams": 0.12579965591430664,
"rps_doc_frac_chars_dupe_5grams": 0.2593327462673187,
"rps_doc_frac_chars_dupe_6grams": 0.229208841919899,
"rps_doc_frac_chars_dupe_7grams": 0.22435015439987183,
"rps_doc_frac_chars_dupe_8grams": 0.19390234351158142,
"rps_doc_frac_chars_dupe_9grams": 0.14819014072418213,
"rps_doc_frac_chars_top_2gram": 0.019313300028443336,
"rps_doc_frac_chars_top_3gram": 0.023807600140571594,
"rps_doc_frac_chars_top_4gram": 0.03117660991847515,
"rps_doc_books_importance": -4709.29345703125,
"rps_doc_books_importance_length_correction": -4709.29345703125,
"rps_doc_openwebtext_importance": -3308.719482421875,
"rps_doc_openwebtext_importance_length_correction": -3308.719482421875,
"rps_doc_wikipedia_importance": -2678.701171875,
"rps_doc_wikipedia_importance_length_correction": -2678.701171875
},
"fasttext": {
"dclm": 0.9884126782417297,
"english": 0.1662621647119522,
"fineweb_edu_approx": 2.49731183052063,
"eai_general_math": 0.8834917545318604,
"eai_open_web_math": 0.23501533269882202,
"eai_web_code": 0.69212406873703
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "22",
"label": "Truncated"
}
},
"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
|
853,098,737,366,368,600 |
How Mobile Games Are Profiting from Micro Transactions
The Mobile Industry is filled with games these days and all of them are unique and fun in their own way. The number of free games on the app stores is incredible and it’s only growing larger as time goes on.
Most of these free games have in game purchases called Micro-Transactions. Purchases you can make to further yourself with real money or buy little extras for the game.
There are tons of benefits for having Micro-Transactions both for the games themselves and the gamers. So let’s look at a few of these benefits in better detail.
The Benefits of Micro-Transactions
Freedom
Micro-Transactions have been around for a long time and started mostly in MMO PC games back in the early to mid-2000s. Having games that played mostly for free, or even had a fee at some points, while having in game things you can buy was always an interesting thing to mess around with.
In the mobile scene with a lot of the games being free, Micro-Transactions are how the gaming companies behind the game make their money. And by making money they can make the game better with updates and more content within them.
Now the best thing about these in game purchases is that they are completely optional. You can pretty much play the entire game to the fullest with out ever spending a dime or dealing with a pay wall.
But playing completely free, as possible as it is, basically, makes it so some things will take longer for you to do. Where if you bought something in the game it could potentially speed up the process or further you in a good way depending on the game.
What they offer
In a lot of cases, Micro0-Transactions are just for simple things. More in game currency, more time currency to keep playing, or items to upgrade something within the game.
These things are all things that can be gotten in a game just by playing but it takes longer. Having the option to buy these to free up your time is entirely okay to do.
Money is valuable but replaceable, time is valuable and is nonrefundable. That’s not to say you should go out and spend all your money so you free up your time to play more it’s just a matter of opinion.
Micro-Transactions offer a lot, especially in character collector games that involved dozens of different characters to play as. In some games Micro-Transactions allow you to get more ways to obtain these characters.
Where as others flat out let you buy the characters you want with real money instead of taking cases in the random summons or lotto pulls. So it’s extremely helpful and a viable way to play a game if you can afford it and choose to do so.
How Mobile Games really profit
The big thing about Micro-Transactions is how much they help the game they’re in. As stated before, many mobile games are completely free to play and make no initial revenue where most games you pay for often do.
Free mobile games make their funding from Micro-Transactions and these are what give developers the means to make their games better and all around more fun. By giving you the option to support them by paying a little bit of money is a really good way to make you feel like you got the best bang for your buck.
Everything is optional and everything has its purpose and uses. There is no kind of Micro-Transaction in games that are useless in anyway or tries to scam you by paying for it.
Mobile games take time and money to make from developers and by putting your money in a little bit at a time helps them spend that time and money even better. Keeping Micro-Transactions alive is a good idea for everyone involved.
Keep the freedom and ability to choose to have the transactions and keep the benefits they give to both players and the developers making the game. They are a good system and should be around in all Mobile games for years to come, especially the free ones.
About Shital 172 Articles
Shital regularly contributes on current health articles and healthy living ideas to health blogs around the web. When she’s not busy working with the jobs, you will find her undertaking many of her own health-related topics and healthy living ideas! She has a lot of dreams. She works hard to fulfill her dreams. She loves to share her ideas, tricks, tips and information by blogging. She also works at Creativejasmin.com, a company that committed to helping businesses with online marketing.
Leave a Reply
Your email address will not be published.
*
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
{
"url": "http://vinagecko.net/how-mobile-games-are-profiting-from-micro-transactions/",
"source_domain": "vinagecko.net",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "48716",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QUHQ7QJAEIQ7VJNJ5XARFCR5IBWTCMFZ",
"WARC-Concurrent-To": "<urn:uuid:4af26b19-9cd7-4d9f-a138-86ccf7d721f6>",
"WARC-Date": "2019-02-17T20:21:22Z",
"WARC-IP-Address": "104.244.126.91",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WCPISQHMX45SNP6TKTB2PVYEI2M3WDFO",
"WARC-Record-ID": "<urn:uuid:c903a640-e0ea-4fbe-9928-2e52f6092983>",
"WARC-Target-URI": "http://vinagecko.net/how-mobile-games-are-profiting-from-micro-transactions/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:de681b54-2227-42f4-b0bb-a6c0be3ec65c>"
},
"warc_info": "isPartOf: CC-MAIN-2019-09\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-154-78-3.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,
55,
56,
264,
265,
434,
435,
597,
598,
633,
634,
642,
643,
931,
932,
1163,
1164,
1365,
1366,
1620,
1621,
1637,
1638,
1811,
1812,
1982,
1983,
2187,
2188,
2405,
2406,
2645,
2646,
2677,
2678,
2891,
2892,
3203,
3204,
3381,
3382,
3612,
3613,
3870,
3871,
3897,
4390,
4391,
4405,
4406,
4448,
4449,
4450,
4452,
4453,
4454
],
"line_end_idx": [
55,
56,
264,
265,
434,
435,
597,
598,
633,
634,
642,
643,
931,
932,
1163,
1164,
1365,
1366,
1620,
1621,
1637,
1638,
1811,
1812,
1982,
1983,
2187,
2188,
2405,
2406,
2645,
2646,
2677,
2678,
2891,
2892,
3203,
3204,
3381,
3382,
3612,
3613,
3870,
3871,
3897,
4390,
4391,
4405,
4406,
4448,
4449,
4450,
4452,
4453,
4454,
4534
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4534,
"ccnet_original_nlines": 55,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4917672872543335,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0021953899413347244,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09220636636018753,
"rps_doc_frac_unique_words": 0.37965261936187744,
"rps_doc_mean_word_length": 4.496277809143066,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.116419315338135,
"rps_doc_word_count": 806,
"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.015452539548277855,
"rps_doc_frac_chars_top_3gram": 0.004966889973729849,
"rps_doc_frac_chars_top_4gram": 0.0077262697741389275,
"rps_doc_books_importance": -418.4242858886719,
"rps_doc_books_importance_length_correction": -418.4242858886719,
"rps_doc_openwebtext_importance": -304.7549743652344,
"rps_doc_openwebtext_importance_length_correction": -304.7549743652344,
"rps_doc_wikipedia_importance": -197.66526794433594,
"rps_doc_wikipedia_importance_length_correction": -197.66526794433594
},
"fasttext": {
"dclm": 0.13924431800842285,
"english": 0.9716113805770874,
"fineweb_edu_approx": 1.238227128982544,
"eai_general_math": 0.0014691899996250868,
"eai_open_web_math": 0.04398370161652565,
"eai_web_code": 0.00020260000019334257
}
}
|
{
"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": "338.4",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"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": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,761,154,658,678,173,000 |
7
I have an event site with dates in the future and past.
I know how to display future entries as a listing:
{% set entries = craft.entries.section('mySection').status('pending') %}
But how do you display an entry with status "pending" on the "_entry" template?
In my case nothing displays?
2 Answers 2
13
I'm assuming that when you defined your section, you checked the box which says this:
Entries in this section have their own URLs
... and then filled out the relevant Entry URL Format and Entry Template values. The great thing about this technique is that it automatically populates the entry variable in your target template. Typically, this is the best way to go!
But there are occasions where this isn't the suitable solution. There are certain circumstances in Craft which, by default, can prevent non-active entries from being included. I suspect this is one of those situations.
Here is what I would suggest instead...
1. Uncheck the box which says "Entries in this section have their own URLs", and save.
2. Setup a dynamic route. This is basically what the aforementioned checkbox was doing for you.
3. Declare your route using the same pattern that you had previously setup in your section definition.
4. Within your template, manually set the entry value, based on the parameters passed through in the URL.
{% set slug = craft.request.getSegment(2) %}
{% set entry = craft.entries.slug(slug).status(null).first %}
Here's where this manual method differs from the automatic method... Specifying null as the status will return that entry regardless of what its status is. Otherwise, only an active entry could be returned.
Because you are now manually setting the entry value, you have enough control to specify that you really do want this entry, despite the fact that it's not currently active.
5
• Lindsey, can't you leave out steps 1-3 and only overwrite the automatically set entry var with step 4?
– carlcs
Aug 6, 2014 at 7:32
• 1
OK, you probably suggest 1-3 because of performance reasons, so that there's no DB queries for an entry model not used at all, right?
– carlcs
Aug 6, 2014 at 7:39
• @carlcs Yeah, no need to confuse Craft. If you're going to manually set the route, you should turn off the automated route settings.
– Lindsey D
Aug 6, 2014 at 7:40
• wow - this was more than I expected and very easy to do so! It works perfectly! thanks a lot!!!
– outline4
Aug 6, 2014 at 10:08
• @outline4 Great, glad to help!
– Lindsey D
Aug 6, 2014 at 18:30
1
I know Lindsey's answer is the accepted answer from like 4 years ago, but it's worth pointing out that it only applies if your events use postDate for when each event starts/ends. But you don't need to do all that! Just use a custom datetime field for setting event start/end dates.
Create custom date/time fields in your entries. Then you grab your event entries on the listing page like normal but you order by your custom field:
{% set upcomingEvents = craft.entries.section('mySection').order('customStartDate')
Then control them in the loop:
{% for event in upcomingEvents if event.customStartDateField >= now %}
// event html
{% else %}
<p>There are currently no upcoming events at this time.</p>
{% endfor %}
Then on the details _entry page, you go about it like normal; the entry variable is auto populated for you.
There's also a more complex example on Craft Cookbook if you need something more complicated.
There are multiple reasons and benefits for using custom date fields rather than going with postDate:
1. You don't need to uncheck the box that says "Entries in this section have their own URLs". Instead, let Craft generate the entries' urls as usual.
2. No wonky custom routing for what is really just a straight up typical channel of entries.
3. You don't have to deal with the status; just leave it on the default "live" status and control the entry's visibility in the template based on if its start/end date is in the future or past related to the current date.
4. The UX of having a custom date/time field in the entry's tab (when editing the entry) rather than off to the side is arguably far better for the user/client.
I get that the accepted answer answers the question in the title, but I found myself rethinking my approach to listing out events on a project I'm doing and realized the better way is to avoid using postDate altogether for this instead of trying to force it. Hope it helps someone else too.
2
• 1
You are absolutely right! Using custom dates is the way to go!
– outline4
Dec 5, 2017 at 15:57
• 1
I still leave the other answer as correct, since the answer is correct. But when dealing with future dates, or custom dates in general, I'd suggest you go down that route.
– outline4
Dec 5, 2017 at 15:58
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://craftcms.stackexchange.com/questions/1639/how-can-i-display-a-pending-entry-in-my-entry-template?noredirect=1",
"source_domain": "craftcms.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "180445",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IPR7SIRR4YOQYECCOT3FKQUSU2BZ7GDW",
"WARC-Concurrent-To": "<urn:uuid:3b3efe1e-6c74-46fe-9b5e-faa7a27218ce>",
"WARC-Date": "2024-05-23T07:15:44Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZHM42LTM4BPBX7VBBYXLLIEKPWR5RMLA",
"WARC-Record-ID": "<urn:uuid:8abef7cc-c251-4087-9ae5-55da962d1258>",
"WARC-Target-URI": "https://craftcms.stackexchange.com/questions/1639/how-can-i-display-a-pending-entry-in-my-entry-template?noredirect=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e2742f17-796d-42fc-b524-dda7bf7cc276>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-27\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
59,
60,
111,
112,
185,
186,
266,
295,
296,
308,
309,
312,
313,
399,
400,
444,
445,
681,
682,
901,
902,
942,
943,
1032,
1130,
1235,
1343,
1344,
1393,
1459,
1464,
1465,
1672,
1673,
1847,
1848,
1850,
1957,
1970,
1994,
2000,
2138,
2151,
2175,
2312,
2328,
2352,
2452,
2467,
2492,
2527,
2543,
2568,
2570,
2571,
2854,
2855,
3004,
3005,
3089,
3090,
3121,
3122,
3193,
3211,
3222,
3286,
3299,
3300,
3408,
3409,
3503,
3504,
3505,
3607,
3608,
3760,
3855,
4079,
4242,
4243,
4534,
4535,
4537,
4543,
4610,
4625,
4650,
4656,
4832,
4847,
4872,
4873,
4885,
4886,
5002,
5003
],
"line_end_idx": [
2,
3,
59,
60,
111,
112,
185,
186,
266,
295,
296,
308,
309,
312,
313,
399,
400,
444,
445,
681,
682,
901,
902,
942,
943,
1032,
1130,
1235,
1343,
1344,
1393,
1459,
1464,
1465,
1672,
1673,
1847,
1848,
1850,
1957,
1970,
1994,
2000,
2138,
2151,
2175,
2312,
2328,
2352,
2452,
2467,
2492,
2527,
2543,
2568,
2570,
2571,
2854,
2855,
3004,
3005,
3089,
3090,
3121,
3122,
3193,
3211,
3222,
3286,
3299,
3300,
3408,
3409,
3503,
3504,
3505,
3607,
3608,
3760,
3855,
4079,
4242,
4243,
4534,
4535,
4537,
4543,
4610,
4625,
4650,
4656,
4832,
4847,
4872,
4873,
4885,
4886,
5002,
5003,
5093
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5093,
"ccnet_original_nlines": 99,
"rps_doc_curly_bracket": 0.002552520018070936,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3961573839187622,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017383350059390068,
"rps_doc_frac_lines_end_with_ellipsis": 0.009999999776482582,
"rps_doc_frac_no_alph_words": 0.23513266444206238,
"rps_doc_frac_unique_words": 0.4025973975658417,
"rps_doc_mean_word_length": 4.540731906890869,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0.0027447401080280542,
"rps_doc_unigram_entropy": 5.326742649078369,
"rps_doc_word_count": 847,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.060322411358356476,
"rps_doc_frac_chars_dupe_6grams": 0.060322411358356476,
"rps_doc_frac_chars_dupe_7grams": 0.04160166159272194,
"rps_doc_frac_chars_dupe_8grams": 0.03172127157449722,
"rps_doc_frac_chars_dupe_9grams": 0.03172127157449722,
"rps_doc_frac_chars_top_2gram": 0.009100359864532948,
"rps_doc_frac_chars_top_3gram": 0.010400420054793358,
"rps_doc_frac_chars_top_4gram": 0.013000519946217537,
"rps_doc_books_importance": -423.2716064453125,
"rps_doc_books_importance_length_correction": -423.2716064453125,
"rps_doc_openwebtext_importance": -232.97605895996094,
"rps_doc_openwebtext_importance_length_correction": -232.97605895996094,
"rps_doc_wikipedia_importance": -214.78567504882812,
"rps_doc_wikipedia_importance_length_correction": -214.78567504882812
},
"fasttext": {
"dclm": 0.07131999731063843,
"english": 0.9230712652206421,
"fineweb_edu_approx": 1.1323230266571045,
"eai_general_math": 0.1188589334487915,
"eai_open_web_math": 0.18444311618804932,
"eai_web_code": 0.13761931657791138
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,012,066,674,948,143,000 |
Library iris.base_logic.lib.gen_heap
From stdpp Require Export namespaces.
From iris.bi.lib Require Import fractional.
From iris.proofmode Require Import tactics.
From iris.algebra Require Import auth gmap frac agree namespace_map.
From iris.base_logic.lib Require Export own.
Set Default Proof Using "Type".
Import uPred.
This file provides a generic mechanism for a point-to connective l ↦{q} v with fractional permissions (where l : L and v : V over some abstract type L for locations and V for values). This mechanism can be plugged into a language by using the heap invariant gen_heap_ctx σ where σ : gmap L V. See heap-lang for an example.
Next to the point-to connective l ↦{q} v, which keeps track of the value v of a location l, this mechanism allows one to attach "meta" or "ghost" data to locations. This is done as follows:
• When one allocates a location, in addition to the point-to connective l v, one also obtains the token meta_token l. This token is an exclusive resource that denotes that no meta data has been associated with the namespaces in the mask for the location l.
• Meta data tokens can be split w.r.t. namespace masks, i.e. meta_token l (E1 E2) ⊣⊢ meta_token l E1 meta_token l E2 if E1 ## E2.
• Meta data can be set using the update meta_token l E ==∗ meta l N x provided N E, and x : A for any countable A. The meta l N x connective is persistent and denotes the knowledge that the meta data x has been associated with namespace N to the location l.
To make the mechanism as flexible as possible, the x : A in meta l N x can be of any countable type A. This means that you can associate e.g. single ghost names, but also tuples of ghost names, etc.
To further increase flexibility, the meta l N x and meta_token l E connectives are annotated with a namespace N and mask E. That way, one can assign a map of meta information to a location. This is particularly useful when building abstractions, then one can gradually assign more ghost information to a location instead of having to do all of this at once. We use namespaces so that these can be matched up with the invariant namespaces.
To implement this mechanism, we use three resource algebras:
• An authoritative RA over gmap L (fracR × agreeR V), which keeps track of the values of locations.
• An authoritative RA over gmap L (agree gname), which keeps track of the meta information of locations. This RA introduces an indirection, it keeps track of a ghost name for each location.
• The ghost names in the aforementioned authoritative RA refer to namespace maps namespace_map (agree positive), which store the actual meta information. This indirection is needed because we cannot perform frame preserving updates in an authoritative fragment without owning the full authoritative element (in other words, without the indirection meta_set would need gen_heap_ctx as a premise).
Note that in principle we could have used one big authoritative RA to keep track of both values and ghost names for meta information, for example: gmap L (option (fracR × agreeR V) option (agree gname). Due to the options, this RA would be quite inconvenient to deal with.
Definition gen_heapUR (L V : Type) `{Countable L} : ucmraT :=
gmapUR L (prodR fracR (agreeR (leibnizO V))).
Definition gen_metaUR (L : Type) `{Countable L} : ucmraT :=
gmapUR L (agreeR gnameO).
Definition to_gen_heap {L V} `{Countable L} : gmap L V gen_heapUR L V :=
fmap (λ v, (1%Qp, to_agree (v : leibnizO V))).
Definition to_gen_meta `{Countable L} : gmap L gname gen_metaUR L :=
fmap to_agree.
The CMRA we need.
Class gen_heapG (L V : Type) (Σ : gFunctors) `{Countable L} := GenHeapG {
gen_heap_inG :> inG Σ (authR (gen_heapUR L V));
gen_meta_inG :> inG Σ (authR (gen_metaUR L));
gen_meta_data_inG :> inG Σ (namespace_mapR (agreeR positiveO));
gen_heap_name : gname;
gen_meta_name : gname
}.
Arguments gen_heap_name {_ _ _ _ _} _ : assert.
Arguments gen_meta_name {_ _ _ _ _} _ : assert.
Class gen_heapPreG (L V : Type) (Σ : gFunctors) `{Countable L} := {
gen_heap_preG_inG :> inG Σ (authR (gen_heapUR L V));
gen_meta_preG_inG :> inG Σ (authR (gen_metaUR L));
gen_meta_data_preG_inG :> inG Σ (namespace_mapR (agreeR positiveO));
}.
Definition gen_heapΣ (L V : Type) `{Countable L} : gFunctors := #[
GFunctor (authR (gen_heapUR L V));
GFunctor (authR (gen_metaUR L));
GFunctor (namespace_mapR (agreeR positiveO))
].
Instance subG_gen_heapPreG {Σ L V} `{Countable L} :
subG (gen_heapΣ L V) Σ gen_heapPreG L V Σ.
Proof. solve_inG. Qed.
Section definitions.
Context `{Countable L, hG : !gen_heapG L V Σ}.
Definition gen_heap_ctx (σ : gmap L V) : iProp Σ := m,
dom _ m dom (gset L) σ
own (gen_heap_name hG) ( (to_gen_heap σ))
own (gen_meta_name hG) ( (to_gen_meta m)).
Definition mapsto_def (l : L) (q : Qp) (v: V) : iProp Σ :=
own (gen_heap_name hG) ( {[ l := (q, to_agree (v : leibnizO V)) ]}).
Definition mapsto_aux : seal (@mapsto_def). Proof. by eexists. Qed.
Definition mapsto := mapsto_aux.(unseal).
Definition mapsto_eq : @mapsto = @mapsto_def := mapsto_aux.(seal_eq).
Definition meta_token_def (l : L) (E : coPset) : iProp Σ :=
γm, own (gen_meta_name hG) ( {[ l := to_agree γm ]})
own γm (namespace_map_token E).
Definition meta_token_aux : seal (@meta_token_def). Proof. by eexists. Qed.
Definition meta_token := meta_token_aux.(unseal).
Definition meta_token_eq : @meta_token = @meta_token_def := meta_token_aux.(seal_eq).
Definition meta_def `{Countable A} (l : L) (N : namespace) (x : A) : iProp Σ :=
γm, own (gen_meta_name hG) ( {[ l := to_agree γm ]})
own γm (namespace_map_data N (to_agree (encode x))).
Definition meta_aux : seal (@meta_def). Proof. by eexists. Qed.
Definition meta {A dA cA} := meta_aux.(unseal) A dA cA.
Definition meta_eq : @meta = @meta_def := meta_aux.(seal_eq).
End definitions.
Local Notation "l ↦{ q } v" := (mapsto l q v)
(at level 20, q at level 50, format "l ↦{ q } v") : bi_scope.
Local Notation "l ↦ v" := (mapsto l 1 v) (at level 20) : bi_scope.
Local Notation "l ↦{ q } -" := ( v, l ↦{q} v)%I
(at level 20, q at level 50, format "l ↦{ q } -") : bi_scope.
Local Notation "l ↦ -" := (l ↦{1} -)%I (at level 20) : bi_scope.
Section to_gen_heap.
Context (L V : Type) `{Countable L}.
Implicit Types σ : gmap L V.
Implicit Types m : gmap L gname.
Conversion to heaps and back
Lemma to_gen_heap_valid σ : to_gen_heap σ.
Proof. intros l. rewrite lookup_fmap. by case!! l). Qed.
Lemma lookup_to_gen_heap_None σ l : σ !! l = None to_gen_heap σ !! l = None.
Proof. by rewrite /to_gen_heap lookup_fmap⇒ →. Qed.
Lemma gen_heap_singleton_included σ l q v :
{[l := (q, to_agree v)]} to_gen_heap σ σ !! l = Some v.
Proof.
rewrite singleton_included_l⇒ -[[q' av] []].
rewrite /to_gen_heap lookup_fmap fmap_Some_equiv ⇒ -[v' [Hl [/= → ->]]].
move⇒ /Some_pair_included_total_2 [_] /to_agree_included /leibniz_equiv_iff → //.
Qed.
Lemma to_gen_heap_insert l v σ :
to_gen_heap (<[l:=v]> σ) = <[l:=(1%Qp, to_agree (v:leibnizO V))]> (to_gen_heap σ).
Proof. by rewrite /to_gen_heap fmap_insert. Qed.
Lemma to_gen_meta_valid m : to_gen_meta m.
Proof. intros l. rewrite lookup_fmap. by case (m !! l). Qed.
Lemma lookup_to_gen_meta_None m l : m !! l = None to_gen_meta m !! l = None.
Proof. by rewrite /to_gen_meta lookup_fmap⇒ →. Qed.
Lemma to_gen_meta_insert l m γm :
to_gen_meta (<[l:=γm]> m) = <[l:=to_agree γm]> (to_gen_meta m).
Proof. by rewrite /to_gen_meta fmap_insert. Qed.
End to_gen_heap.
Lemma gen_heap_init `{Countable L, !gen_heapPreG L V Σ} σ :
|==> _ : gen_heapG L V Σ, gen_heap_ctx σ.
Proof.
iMod (own_alloc ( to_gen_heap σ)) as (γh) "Hh".
{ rewrite auth_auth_valid. exact: to_gen_heap_valid. }
iMod (own_alloc ( to_gen_meta )) as (γm) "Hm".
{ rewrite auth_auth_valid. exact: to_gen_meta_valid. }
iModIntro. iExists (GenHeapG L V Σ _ _ _ _ _ γh γm).
iExists ; simpl. iFrame "Hh Hm". by rewrite dom_empty_L.
Qed.
Section gen_heap.
Context {L V} `{Countable L, !gen_heapG L V Σ}.
Implicit Types P Q : iProp Σ.
Implicit Types Φ : V iProp Σ.
Implicit Types σ : gmap L V.
Implicit Types m : gmap L gname.
Implicit Types h g : gen_heapUR L V.
Implicit Types l : L.
Implicit Types v : V.
General properties of mapsto
Global Instance mapsto_timeless l q v : Timeless (l ↦{q} v).
Proof. rewrite mapsto_eq /mapsto_def. apply _. Qed.
Global Instance mapsto_fractional l v : Fractional (λ q, l ↦{q} v)%I.
Proof.
intros p q. by rewrite mapsto_eq /mapsto_def -own_op -auth_frag_op
singleton_op -pair_op agree_idemp.
Qed.
Global Instance mapsto_as_fractional l q v :
AsFractional (l ↦{q} v) (λ q, l ↦{q} v)%I q.
Proof. split. done. apply _. Qed.
Lemma mapsto_agree l q1 q2 v1 v2 : l ↦{q1} v1 -∗ l ↦{q2} v2 -∗ v1 = v2.
Proof.
apply wand_intro_r.
rewrite mapsto_eq /mapsto_def -own_op -auth_frag_op own_valid discrete_valid.
f_equiv. rewrite auth_frag_valid singleton_op singleton_valid -pair_op.
by intros [_ ?%agree_op_invL'].
Qed.
Lemma mapsto_combine l q1 q2 v1 v2 :
l ↦{q1} v1 -∗ l ↦{q2} v2 -∗ l ↦{q1 + q2} v1 v1 = v2.
Proof.
iIntros "Hl1 Hl2". iDestruct (mapsto_agree with "Hl1 Hl2") as %->.
iCombine "Hl1 Hl2" as "Hl". eauto with iFrame.
Qed.
Global Instance ex_mapsto_fractional l : Fractional (λ q, l ↦{q} -)%I.
Proof.
intros p q. iSplit.
- iDestruct 1 as (v) "[H1 H2]". iSplitL "H1"; eauto.
- iIntros "[H1 H2]". iDestruct "H1" as (v1) "H1". iDestruct "H2" as (v2) "H2".
iDestruct (mapsto_agree with "H1 H2") as %->. iExists v2. by iFrame.
Qed.
Global Instance ex_mapsto_as_fractional l q :
AsFractional (l ↦{q} -) (λ q, l ↦{q} -)%I q.
Proof. split. done. apply _. Qed.
Lemma mapsto_valid l q v : l ↦{q} v -∗ q.
Proof.
rewrite mapsto_eq /mapsto_def own_valid !discrete_valid -auth_frag_valid.
by apply pure_mono⇒ /singleton_valid [??].
Qed.
Lemma mapsto_valid_2 l q1 q2 v1 v2 : l ↦{q1} v1 -∗ l ↦{q2} v2 -∗ (q1 + q2)%Qp.
Proof.
iIntros "H1 H2". iDestruct (mapsto_agree with "H1 H2") as %->.
iApply (mapsto_valid l _ v2). by iFrame.
Qed.
Lemma mapsto_mapsto_ne l1 l2 q1 q2 v1 v2 :
¬ (q1 + q2)%Qp l1 ↦{q1} v1 -∗ l2 ↦{q2} v2 -∗ l1 l2.
Proof.
iIntros (?) "Hl1 Hl2"; iIntros (->).
by iDestruct (mapsto_valid_2 with "Hl1 Hl2") as %?.
Qed.
General properties of meta and meta_token
Global Instance meta_token_timeless l N : Timeless (meta_token l N).
Proof. rewrite meta_token_eq /meta_token_def. apply _. Qed.
Global Instance meta_timeless `{Countable A} l N (x : A) : Timeless (meta l N x).
Proof. rewrite meta_eq /meta_def. apply _. Qed.
Global Instance meta_persistent `{Countable A} l N (x : A) : Persistent (meta l N x).
Proof. rewrite meta_eq /meta_def. apply _. Qed.
Lemma meta_token_union_1 l E1 E2 :
E1 ## E2 meta_token l (E1 E2) -∗ meta_token l E1 meta_token l E2.
Proof.
rewrite meta_token_eq /meta_token_def. intros ?. iDestruct 1 as (γm1) "[#Hγm Hm]".
rewrite namespace_map_token_union //. iDestruct "Hm" as "[Hm1 Hm2]".
iSplitL "Hm1"; eauto.
Qed.
Lemma meta_token_union_2 l E1 E2 :
meta_token l E1 -∗ meta_token l E2 -∗ meta_token l (E1 E2).
Proof.
rewrite meta_token_eq /meta_token_def.
iDestruct 1 as (γm1) "[#Hγm1 Hm1]". iDestruct 1 as (γm2) "[#Hγm2 Hm2]".
iAssert γm1 = γm2 %I as %->.
{ iDestruct (own_valid_2 with "Hγm1 Hγm2") as %; iPureIntro.
move: . rewrite -auth_frag_op singleton_op⇒ /auth_frag_valid /=.
rewrite singleton_valid. apply: agree_op_invL'. }
iDestruct (own_valid_2 with "Hm1 Hm2") as %?%namespace_map_token_valid_op.
iExists γm2. iFrame "Hγm2". rewrite namespace_map_token_union //. by iSplitL "Hm1".
Qed.
Lemma meta_token_union l E1 E2 :
E1 ## E2 meta_token l (E1 E2) ⊣⊢ meta_token l E1 meta_token l E2.
Proof.
intros; iSplit; first by iApply meta_token_union_1.
iIntros "[Hm1 Hm2]". by iApply (meta_token_union_2 with "Hm1 Hm2").
Qed.
Lemma meta_token_difference l E1 E2 :
E1 E2 meta_token l E2 ⊣⊢ meta_token l E1 meta_token l (E2 E1).
Proof.
intros. rewrite {1}(union_difference_L E1 E2) //.
by rewrite meta_token_union; last set_solver.
Qed.
Lemma meta_agree `{Countable A} l i (x1 x2 : A) :
meta l i x1 -∗ meta l i x2 -∗ x1 = x2.
Proof.
rewrite meta_eq /meta_def.
iDestruct 1 as (γm1) "[Hγm1 Hm1]"; iDestruct 1 as (γm2) "[Hγm2 Hm2]".
iAssert γm1 = γm2 %I as %->.
{ iDestruct (own_valid_2 with "Hγm1 Hγm2") as %; iPureIntro.
move: . rewrite -auth_frag_op singleton_op⇒ /auth_frag_valid /=.
rewrite singleton_valid. apply: agree_op_invL'. }
iDestruct (own_valid_2 with "Hm1 Hm2") as %; iPureIntro.
move: . rewrite -namespace_map_data_op namespace_map_data_valid.
move⇒ /agree_op_invL'. naive_solver.
Qed.
Lemma meta_set `{Countable A} E l (x : A) N :
N E meta_token l E ==∗ meta l N x.
Proof.
rewrite meta_token_eq meta_eq /meta_token_def /meta_def.
iDestruct 1 as (γm) "[Hγm Hm]". iExists γm. iFrame "Hγm".
iApply (own_update with "Hm"). by apply namespace_map_alloc_update.
Qed.
Update lemmas
Lemma gen_heap_alloc σ l v :
σ !! l = None
gen_heap_ctx σ ==∗ gen_heap_ctx (<[l:=v]>σ) l v meta_token l .
Proof.
iIntros (Hσl). rewrite /gen_heap_ctx mapsto_eq /mapsto_def meta_token_eq /meta_token_def /=.
iDestruct 1 as (m Hσm) "[Hσ Hm]".
iMod (own_update with "Hσ") as "[Hσ Hl]".
{ eapply auth_update_alloc,
(alloc_singleton_local_update _ _ (1%Qp, to_agree (v:leibnizO _)))=> //.
by apply lookup_to_gen_heap_None. }
iMod (own_alloc (namespace_map_token )) as (γm) "Hγm".
{ apply namespace_map_token_valid. }
iMod (own_update with "Hm") as "[Hm Hlm]".
{ eapply auth_update_alloc.
eapply (alloc_singleton_local_update _ l (to_agree γm))=> //.
apply lookup_to_gen_meta_None.
move: Hσl. rewrite -!(not_elem_of_dom (D:=gset L)). set_solver. }
iModIntro. iFrame "Hl". iSplitL "Hσ Hm"; last by eauto with iFrame.
iExists (<[l:=γm]> m).
rewrite to_gen_heap_insert to_gen_meta_insert !dom_insert_L. iFrame.
iPureIntro. set_solver.
Qed.
Lemma gen_heap_alloc_gen σ σ' :
σ' ##ₘ σ
gen_heap_ctx σ ==∗
gen_heap_ctx (σ' σ) ([∗ map] l v σ', l v) ([∗ map] l _ σ', meta_token l ).
Proof.
revert σ; induction σ' as [| l v σ' Hl IH] using map_ind; iIntrosHdisj) "Hσ".
{ rewrite left_id_L. auto. }
iMod (IH with "Hσ") as "[Hσ'σ Hσ']"; first by eapply map_disjoint_insert_l.
decompose_map_disjoint.
rewrite !big_opM_insert // -insert_union_l //.
by iMod (gen_heap_alloc with "Hσ'σ") as "($ & $ & $)";
first by apply lookup_union_None.
Qed.
Lemma gen_heap_valid σ l q v : gen_heap_ctx σ -∗ l ↦{q} v -∗ σ !! l = Some v.
Proof.
iDestruct 1 as (m Hσm) "[Hσ _]". iIntros "Hl".
rewrite /gen_heap_ctx mapsto_eq /mapsto_def.
iDestruct (own_valid_2 with "Hσ Hl")
as %[Hl%gen_heap_singleton_included _]%auth_both_valid; auto.
Qed.
Lemma gen_heap_update σ l v1 v2 :
gen_heap_ctx σ -∗ l v1 ==∗ gen_heap_ctx (<[l:=v2]>σ) l v2.
Proof.
iDestruct 1 as (m Hσm) "[Hσ Hm]".
iIntros "Hl". rewrite /gen_heap_ctx mapsto_eq /mapsto_def.
iDestruct (own_valid_2 with "Hσ Hl")
as %[Hl%gen_heap_singleton_included _]%auth_both_valid.
iMod (own_update_2 with "Hσ Hl") as "[Hσ Hl]".
{ eapply auth_update, singleton_local_update,
(exclusive_local_update _ (1%Qp, to_agree (v2:leibnizO _)))=> //.
by rewrite /to_gen_heap lookup_fmap Hl. }
iModIntro. iFrame "Hl". iExists m. rewrite to_gen_heap_insert. iFrame.
iPureIntro. apply (elem_of_dom_2 (D:=gset L)) in Hl.
rewrite dom_insert_L. set_solver.
Qed.
End gen_heap.
|
{
"url": "https://plv.mpi-sws.org/coqdoc/iris/iris.base_logic.lib.gen_heap.html",
"source_domain": "plv.mpi-sws.org",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "192957",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TBRNK3LZUVSAKTX7AIVT77MXCUSJMYEV",
"WARC-Concurrent-To": "<urn:uuid:2a09a392-3806-457c-8b3f-8f758853db70>",
"WARC-Date": "2020-08-11T12:45:37Z",
"WARC-IP-Address": "139.19.206.152",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:N4ZKZG5FQBFO6UHLFMCMX4DZBHPUWDEV",
"WARC-Record-ID": "<urn:uuid:5b60ee85-137d-4e1d-b253-4b3c7a6a246c>",
"WARC-Target-URI": "https://plv.mpi-sws.org/coqdoc/iris/iris.base_logic.lib.gen_heap.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5aa553e9-0e51-40c5-b4b3-6fd404d592e1>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-28.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,
37,
38,
76,
120,
164,
233,
278,
310,
324,
325,
648,
838,
1097,
1229,
1489,
1688,
2127,
2188,
2290,
2482,
2880,
3153,
3154,
3216,
3264,
3324,
3352,
3353,
3426,
3475,
3544,
3561,
3562,
3580,
3654,
3704,
3752,
3818,
3843,
3867,
3870,
3918,
3966,
3967,
4035,
4090,
4143,
4214,
4217,
4218,
4285,
4322,
4357,
4404,
4407,
4408,
4460,
4505,
4528,
4529,
4550,
4599,
4600,
4657,
4662,
4690,
4736,
4783,
4784,
4845,
4918,
4988,
5032,
5104,
5105,
5167,
5225,
5267,
5345,
5397,
5485,
5486,
5568,
5626,
5689,
5755,
5813,
5877,
5894,
5895,
5941,
6005,
6072,
6073,
6121,
6185,
6250,
6251,
6272,
6311,
6342,
6377,
6378,
6407,
6452,
6511,
6590,
6644,
6690,
6750,
6759,
6808,
6885,
6971,
6978,
7013,
7100,
7151,
7152,
7197,
7260,
7339,
7393,
7429,
7497,
7548,
7565,
7566,
7626,
7671,
7678,
7728,
7785,
7834,
7891,
7946,
8005,
8010,
8011,
8029,
8079,
8111,
8143,
8174,
8209,
8248,
8272,
8296,
8297,
8326,
8389,
8443,
8515,
8524,
8595,
8636,
8643,
8690,
8739,
8775,
8776,
8850,
8859,
8883,
8965,
9041,
9077,
9084,
9085,
9124,
9181,
9190,
9261,
9312,
9319,
9320,
9393,
9402,
9426,
9483,
9566,
9641,
9648,
9696,
9745,
9781,
9782,
9826,
9835,
9913,
9960,
9967,
10048,
10057,
10124,
10169,
10176,
10177,
10222,
10278,
10287,
10328,
10384,
10391,
10392,
10434,
10505,
10567,
10651,
10701,
10789,
10839,
10840,
10877,
10947,
10956,
11043,
11116,
11142,
11149,
11186,
11250,
11259,
11302,
11378,
11411,
11476,
11547,
11603,
11682,
11770,
11777,
11812,
11882,
11891,
11947,
12019,
12026,
12027,
12067,
12134,
12143,
12197,
12247,
12254,
12255,
12307,
12350,
12359,
12390,
12464,
12497,
12562,
12633,
12689,
12750,
12819,
12860,
12867,
12915,
12955,
12964,
13025,
13087,
13159,
13166,
13167,
13181,
13212,
13230,
13297,
13306,
13403,
13441,
13487,
13519,
13600,
13642,
13701,
13742,
13789,
13821,
13889,
13926,
13998,
14070,
14097,
14170,
14198,
14205,
14206,
14240,
14253,
14276,
14355,
14364,
14446,
14479,
14559,
14587,
14638,
14697,
14737,
14744,
14745,
14825,
14834,
14885,
14934,
14975,
15043,
15050,
15051,
15087,
15150,
15159,
15197,
15260,
15301,
15363,
15414,
15464,
15538,
15586,
15661,
15718,
15756,
15763
],
"line_end_idx": [
37,
38,
76,
120,
164,
233,
278,
310,
324,
325,
648,
838,
1097,
1229,
1489,
1688,
2127,
2188,
2290,
2482,
2880,
3153,
3154,
3216,
3264,
3324,
3352,
3353,
3426,
3475,
3544,
3561,
3562,
3580,
3654,
3704,
3752,
3818,
3843,
3867,
3870,
3918,
3966,
3967,
4035,
4090,
4143,
4214,
4217,
4218,
4285,
4322,
4357,
4404,
4407,
4408,
4460,
4505,
4528,
4529,
4550,
4599,
4600,
4657,
4662,
4690,
4736,
4783,
4784,
4845,
4918,
4988,
5032,
5104,
5105,
5167,
5225,
5267,
5345,
5397,
5485,
5486,
5568,
5626,
5689,
5755,
5813,
5877,
5894,
5895,
5941,
6005,
6072,
6073,
6121,
6185,
6250,
6251,
6272,
6311,
6342,
6377,
6378,
6407,
6452,
6511,
6590,
6644,
6690,
6750,
6759,
6808,
6885,
6971,
6978,
7013,
7100,
7151,
7152,
7197,
7260,
7339,
7393,
7429,
7497,
7548,
7565,
7566,
7626,
7671,
7678,
7728,
7785,
7834,
7891,
7946,
8005,
8010,
8011,
8029,
8079,
8111,
8143,
8174,
8209,
8248,
8272,
8296,
8297,
8326,
8389,
8443,
8515,
8524,
8595,
8636,
8643,
8690,
8739,
8775,
8776,
8850,
8859,
8883,
8965,
9041,
9077,
9084,
9085,
9124,
9181,
9190,
9261,
9312,
9319,
9320,
9393,
9402,
9426,
9483,
9566,
9641,
9648,
9696,
9745,
9781,
9782,
9826,
9835,
9913,
9960,
9967,
10048,
10057,
10124,
10169,
10176,
10177,
10222,
10278,
10287,
10328,
10384,
10391,
10392,
10434,
10505,
10567,
10651,
10701,
10789,
10839,
10840,
10877,
10947,
10956,
11043,
11116,
11142,
11149,
11186,
11250,
11259,
11302,
11378,
11411,
11476,
11547,
11603,
11682,
11770,
11777,
11812,
11882,
11891,
11947,
12019,
12026,
12027,
12067,
12134,
12143,
12197,
12247,
12254,
12255,
12307,
12350,
12359,
12390,
12464,
12497,
12562,
12633,
12689,
12750,
12819,
12860,
12867,
12915,
12955,
12964,
13025,
13087,
13159,
13166,
13167,
13181,
13212,
13230,
13297,
13306,
13403,
13441,
13487,
13519,
13600,
13642,
13701,
13742,
13789,
13821,
13889,
13926,
13998,
14070,
14097,
14170,
14198,
14205,
14206,
14240,
14253,
14276,
14355,
14364,
14446,
14479,
14559,
14587,
14638,
14697,
14737,
14744,
14745,
14825,
14834,
14885,
14934,
14975,
15043,
15050,
15051,
15087,
15150,
15159,
15197,
15260,
15301,
15363,
15414,
15464,
15538,
15586,
15661,
15718,
15756,
15763,
15776
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 15776,
"ccnet_original_nlines": 328,
"rps_doc_curly_bracket": 0.008240370079874992,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16943231225013733,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0684133917093277,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4020378589630127,
"rps_doc_frac_unique_words": 0.22170470654964447,
"rps_doc_mean_word_length": 4.80856990814209,
"rps_doc_num_sentences": 383,
"rps_doc_symbol_to_word_ratio": 0.003493450116366148,
"rps_doc_unigram_entropy": 5.29795503616333,
"rps_doc_word_count": 2147,
"rps_doc_frac_chars_dupe_10grams": 0.10664471238851547,
"rps_doc_frac_chars_dupe_5grams": 0.24796590209007263,
"rps_doc_frac_chars_dupe_6grams": 0.1768694370985031,
"rps_doc_frac_chars_dupe_7grams": 0.15652847290039062,
"rps_doc_frac_chars_dupe_8grams": 0.11613716185092926,
"rps_doc_frac_chars_dupe_9grams": 0.10974428802728653,
"rps_doc_frac_chars_top_2gram": 0.006392870098352432,
"rps_doc_frac_chars_top_3gram": 0.003196439938619733,
"rps_doc_frac_chars_top_4gram": 0.004746220074594021,
"rps_doc_books_importance": -1668.3531494140625,
"rps_doc_books_importance_length_correction": -1668.3531494140625,
"rps_doc_openwebtext_importance": -980.8851318359375,
"rps_doc_openwebtext_importance_length_correction": -980.8851318359375,
"rps_doc_wikipedia_importance": -786.2173461914062,
"rps_doc_wikipedia_importance_length_correction": -786.2173461914062
},
"fasttext": {
"dclm": 0.030843079090118408,
"english": 0.38504719734191895,
"fineweb_edu_approx": 1.5671756267547607,
"eai_general_math": 0.9092313647270203,
"eai_open_web_math": 0.7609149813652039,
"eai_web_code": 0.20001137256622314
}
}
|
{
"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": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "2",
"label": "Academic/Research"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,241,730,757,970,249,700 |
Treehouse: Grow your CSS skills. Land your dream job.
CMS problem
• # February 16, 2013 at 2:45 pm
I have this cms : http://css-tricks.com/php-for-beginners-building-your-first-simple-cms/
And i want to create a delete function for the entrys can anyone help me?
# February 17, 2013 at 9:29 am
First of all, I would really strongly advise against using this CMS. I can almost guarantee that it doesn’t have the usage of something larger like [Drupal](http://www.drupal.org “Drupal”) or [WordPress](http://wordpress.org). This means you’re leaving your site far more open to security breaches than you would be with a more widely used system – I know that Drupal for instance has a large and very skilled community entirety focussed on finding vulnerabilities and fixing them. Quite apart from security, all these systems will have some “plug and play” architecture for adding functionality like this.
Indeed the very author of that post provided the same causation:
> This code is written for demonstration purposes only. Several security holes have been pointed out in the comments, which I have addressed in Part Two of this tutorial series Editor’s note: There is no part two of this series anymore. Jason recommends his book PHP for Absolute Beginners as a resource for best practices. Still, I would strongly advise not using it for production websites without further testing.
To answer your original question, you are going to want to add a method to the class that takes a parameter of the post ID to be deleted and runs an SQL query to delete the row in the post table that has the same primary key as the one passed in when the method was called.
public function remove_entry($p) {
$query = “DELETE * FROM posts WHERE id=$p”;
$result = mysql_query($query);
if(!$result) {
echo “You’re data wasn’t removed for some reason”;
} else {
echo “data was removed”;
}
}
In order to make use of that, you would then have to call it somewhere where the class file is already included. You also need somehow to be able to get the ID of the post to be deleted into the function when you run it. One easy way to do that is to have an administration screen that pulls the post data and feeds it in to the query string of a “delete” link. So, when the user clicks the link beside any given post they are taken to the delete.php but with the information of the content to be deleted (based on the post’s ID in the database). This could result in a link like:
Delete post 1
The deletion script would than have to be ready to figure out the id of the post to be removed by looking at the URL and then give this to our previously written `remove_entry` method. As this is part of the main class, the class would need to be included at the top of the file. Then you could execute:
$post_to_be_removed = $_GET; // retrieved the post id passed in the URL
remove_entry($post_to_be_removed) // actually try to remove the data
This would do the main task but doesn’t include any of the uber-critcal validation to make sure the value in the URL is indeed a correct post ID nor does it check that there is even a value there at all.
On a side note, [the mysql_* functions used in that tutorial are outdated](http://www.php.net/manual/en/function.mysql-connect.php “”) and should be replaced by their faster more modern mysqli counterparts.
As you can see, there would be **a lot** of work in using this and trying to maintain it yourself – I’ve barely even scratched the surface where security is concerned!
# February 17, 2013 at 10:42 am
I think you didn’t stress nearly enough how important it is that you validate any user input like $_GET, and that you make sure the delete function can only get called by a user with the right… rights.
That said, if you’re interested in learning php you might wanna read up on something like [PHP Data Objects](http://php.net/manual/en/book.pdo.php). If you’re not, your better off using a different CMS.
# February 17, 2013 at 12:41 pm
@CrocoDillon Obviously, input validation is crucial for security and I did acknowledge that:
> I’ve barely even scratched the surface where security is concerned!
One of first things I said addressed your comment about being better off using a different CMS:
> I would really strongly advise against using this CMS. I can almost guarantee that it doesn’t have the usage of something larger like Drupal or WordPress.
I just figured that it was better to give some useful stuff as the post had no responses a while after being posted :). Nice catch about PHP data objects as well.
Viewing 4 posts - 1 through 4 (of 4 total)
You must be logged in to reply to this topic.
|
{
"url": "http://css-tricks.com/forums/topic/cms-problem/",
"source_domain": "css-tricks.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "42644",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6FBUR2LXZT2VRXE6H3BMCB2XPM2HWV3N",
"WARC-Concurrent-To": "<urn:uuid:c05cec1d-9eec-48c2-967f-7c71c0dec018>",
"WARC-Date": "2015-01-29T06:37:03Z",
"WARC-IP-Address": "199.83.128.152",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:E6Q4GZSENFI7FU3HVSUMI7DQYQQRICTD",
"WARC-Record-ID": "<urn:uuid:f75f3ab5-429f-49ee-8b85-69f79aeceed1>",
"WARC-Target-URI": "http://css-tricks.com/forums/topic/cms-problem/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dc7d7fc7-b849-4a7d-93b3-efce1eef807a>"
},
"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,
54,
55,
67,
68,
103,
104,
198,
199,
277,
278,
313,
314,
925,
926,
995,
996,
1417,
1418,
1696,
1697,
1736,
1737,
1785,
1820,
1821,
1840,
1895,
1908,
1937,
1943,
1949,
1950,
2535,
2536,
2554,
2555,
2863,
2864,
2940,
2941,
3014,
3015,
3223,
3224,
3435,
3436,
3608,
3609,
3645,
3646,
3852,
3853,
4060,
4061,
4097,
4098,
4195,
4196,
4270,
4271,
4371,
4372,
4533,
4534,
4701,
4702,
4745,
4746
],
"line_end_idx": [
54,
55,
67,
68,
103,
104,
198,
199,
277,
278,
313,
314,
925,
926,
995,
996,
1417,
1418,
1696,
1697,
1736,
1737,
1785,
1820,
1821,
1840,
1895,
1908,
1937,
1943,
1949,
1950,
2535,
2536,
2554,
2555,
2863,
2864,
2940,
2941,
3014,
3015,
3223,
3224,
3435,
3436,
3608,
3609,
3645,
3646,
3852,
3853,
4060,
4061,
4097,
4098,
4195,
4196,
4270,
4271,
4371,
4372,
4533,
4534,
4701,
4702,
4745,
4746,
4791
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4791,
"ccnet_original_nlines": 68,
"rps_doc_curly_bracket": 0.001252350048162043,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4372549057006836,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03529411926865578,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19411765038967133,
"rps_doc_frac_unique_words": 0.44218552112579346,
"rps_doc_mean_word_length": 4.603557586669922,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.004901960026472807,
"rps_doc_unigram_entropy": 5.29396915435791,
"rps_doc_word_count": 787,
"rps_doc_frac_chars_dupe_10grams": 0.09218879044055939,
"rps_doc_frac_chars_dupe_5grams": 0.11703009158372879,
"rps_doc_frac_chars_dupe_6grams": 0.11703009158372879,
"rps_doc_frac_chars_dupe_7grams": 0.10212530940771103,
"rps_doc_frac_chars_dupe_8grams": 0.09218879044055939,
"rps_doc_frac_chars_dupe_9grams": 0.09218879044055939,
"rps_doc_frac_chars_top_2gram": 0.009660500101745129,
"rps_doc_frac_chars_top_3gram": 0.01159259956330061,
"rps_doc_frac_chars_top_4gram": 0.013248690403997898,
"rps_doc_books_importance": -411.8034362792969,
"rps_doc_books_importance_length_correction": -411.8034362792969,
"rps_doc_openwebtext_importance": -224.0739288330078,
"rps_doc_openwebtext_importance_length_correction": -224.0739288330078,
"rps_doc_wikipedia_importance": -157.72174072265625,
"rps_doc_wikipedia_importance_length_correction": -157.72174072265625
},
"fasttext": {
"dclm": 0.019516469910740852,
"english": 0.9572532176971436,
"fineweb_edu_approx": 1.6798019409179688,
"eai_general_math": 0.7293248176574707,
"eai_open_web_math": 0.2677690386772156,
"eai_web_code": 0.38210242986679077
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-875,843,564,008,353,000 |
question
PeterSharp-4330 avatar image
0 Votes"
PeterSharp-4330 asked KranthiPakala-MSFT commented
Can we get a selector to choose trigger values which can be passed to a pipeline when triggered?
I have a blob creation trigger set and I wanted to be able to move the triggering file once it was processed. After a bit of hunting around, I found that we can pass the name of the file which triggered the storage event to the pipeline.
1. Create a parameter on the pipeline
2. Attach a storage trigger to the pipeline
3. When prompted for 'Trigger run parameters', set the pipeline parameter created in step 1 to '@trigger().outputs.body.fileName'
4. For pipeline tasks which you want to work with the triggering file, set the file of the dataset to the parameter from step 1
All well and good. So long as you set the container and directory appropriately, you can now work specifically with the triggering file.
My question here is, would it be possible to get a dropdown list of available variables here?
141175-image.png
It would really help make this obvious, and who knows what else might be exposed which could be useful for our pipelines.
That is a little more long term though, so in the interim, is there a resource somewhere that shows exactly what is available to use here?
Thanks,
azure-data-factory
image.png (16.7 KiB)
5 |1600 characters needed characters left characters exceeded
Up to 10 attachments (including images) can be used with a maximum of 3.0 MiB each and 30.0 MiB total.
1 Answer
KranthiPakala-MSFT avatar image
0 Votes"
KranthiPakala-MSFT answered KranthiPakala-MSFT commented
Hi @PeterSharp-4330,
Welcome to Microsoft Q&A forum and thanks for posting your query.
Here is a public document where we have a list of System Variable that are supported by Azure Data Factory and Azure Synapse. You can use these variables in expressions when defining entities within either service.
Here is the reference document: System variables supported by Azure Data Factory and Azure Synapse Analytics
141549-image.png
141632-image.png
Please note that for Storage event trigger scope, if you are creating your pipeline and trigger in Azure Synapse Analytics, you must use @trigger().outputs.body.fileName and @trigger().outputs.body.folderPath as parameters. Those two properties capture blob information. Use those properties instead of using @triggerBody().fileName and @triggerBody().folderPath.
If you have any feedback regarding product feature request, we encourage you to please log a feedback directly from ADF UI as shown below:
141633-image.png
Hope this info helps. Do let us know if you have further query
• Please don't forget to click on 130616-image.png and upvote 130671-image.png button whenever the information provided helps you. Original posters help the community find answers faster by identifying the correct answer. Here is how
• Want a reminder to come back and check responses? Here is how to subscribe to a notification
• If you are interested in joining the VM program and help shape the future of Q&A: Here is how you can be part of Q&A Volunteer Moderators
image.png (64.7 KiB)
image.png (86.9 KiB)
image.png (67.2 KiB)
· 2
5 |1600 characters needed characters left characters exceeded
Up to 10 attachments (including images) can be used with a maximum of 3.0 MiB each and 30.0 MiB total.
Hi @PeterSharp-4330,
Just checking to see if the above answer was helpful. If it answers your query, please do consider to click 130616-image.png and upvote 130671-image.png for the same as it can be beneficial for other community members. And, if you have any further query do let us know.
Thank you
0 Votes 0 ·
Hi @PeterSharp-4330,
We still have not heard back from you. Just wanted to check if the above info was helpful? If it answers your query, please do click “Accept Answer” and/or Up-Vote, as it might be beneficial to other community members reading this thread. And, if you have any further query do let us know.
0 Votes 0 ·
|
{
"url": "https://learn.microsoft.com/en-us/answers/questions/593488/can-we-get-a-selector-to-choose-trigger-values-whi.html",
"source_domain": "learn.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "147189",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6JIJ2VLJYQXB3WN2K4BU6OADCPO4MXFD",
"WARC-Concurrent-To": "<urn:uuid:0b38e51a-d94f-4bb7-97ce-62a28e50a75a>",
"WARC-Date": "2022-11-28T23:02:55Z",
"WARC-IP-Address": "104.106.239.83",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FG57U3S3LDQQVCEQFCRFBX6QVTCVI2LG",
"WARC-Record-ID": "<urn:uuid:81295cbf-5d35-4649-843c-655f1f9f0861>",
"WARC-Target-URI": "https://learn.microsoft.com/en-us/answers/questions/593488/can-we-get-a-selector-to-choose-trigger-values-whi.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0654c8dc-b56e-4f1b-b41a-e293d232aa2f>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-149\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,
39,
48,
99,
100,
197,
198,
436,
437,
477,
478,
524,
525,
657,
658,
788,
789,
926,
927,
1021,
1022,
1039,
1040,
1162,
1163,
1302,
1303,
1311,
1312,
1331,
1352,
1414,
1415,
1518,
1519,
1528,
1529,
1561,
1570,
1627,
1628,
1649,
1650,
1716,
1717,
1932,
1933,
2042,
2043,
2060,
2061,
2078,
2079,
2080,
2444,
2445,
2584,
2585,
2602,
2603,
2666,
2667,
2668,
2904,
2905,
3002,
3003,
3145,
3146,
3147,
3168,
3189,
3210,
3214,
3276,
3277,
3380,
3381,
3402,
3403,
3673,
3674,
3684,
3685,
3686,
3698,
3699,
3720,
3721,
4011,
4012
],
"line_end_idx": [
9,
10,
39,
48,
99,
100,
197,
198,
436,
437,
477,
478,
524,
525,
657,
658,
788,
789,
926,
927,
1021,
1022,
1039,
1040,
1162,
1163,
1302,
1303,
1311,
1312,
1331,
1352,
1414,
1415,
1518,
1519,
1528,
1529,
1561,
1570,
1627,
1628,
1649,
1650,
1716,
1717,
1932,
1933,
2042,
2043,
2060,
2061,
2078,
2079,
2080,
2444,
2445,
2584,
2585,
2602,
2603,
2666,
2667,
2668,
2904,
2905,
3002,
3003,
3145,
3146,
3147,
3168,
3189,
3210,
3214,
3276,
3277,
3380,
3381,
3402,
3403,
3673,
3674,
3684,
3685,
3686,
3698,
3699,
3720,
3721,
4011,
4012,
4023
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4023,
"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.3583333194255829,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01904761977493763,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22976189851760864,
"rps_doc_frac_unique_words": 0.4226006269454956,
"rps_doc_mean_word_length": 4.911764621734619,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.1959614753723145,
"rps_doc_word_count": 646,
"rps_doc_frac_chars_dupe_10grams": 0.1065237894654274,
"rps_doc_frac_chars_dupe_5grams": 0.1569492667913437,
"rps_doc_frac_chars_dupe_6grams": 0.1569492667913437,
"rps_doc_frac_chars_dupe_7grams": 0.1569492667913437,
"rps_doc_frac_chars_dupe_8grams": 0.1569492667913437,
"rps_doc_frac_chars_dupe_9grams": 0.13047589361667633,
"rps_doc_frac_chars_top_2gram": 0.011345730163156986,
"rps_doc_frac_chars_top_3gram": 0.011345730163156986,
"rps_doc_frac_chars_top_4gram": 0.011345730163156986,
"rps_doc_books_importance": -310.22125244140625,
"rps_doc_books_importance_length_correction": -310.22125244140625,
"rps_doc_openwebtext_importance": -157.23707580566406,
"rps_doc_openwebtext_importance_length_correction": -157.23707580566406,
"rps_doc_wikipedia_importance": -193.52774047851562,
"rps_doc_wikipedia_importance_length_correction": -193.52774047851562
},
"fasttext": {
"dclm": 0.19554448127746582,
"english": 0.8747402429580688,
"fineweb_edu_approx": 1.5643998384475708,
"eai_general_math": 0.35955047607421875,
"eai_open_web_math": 0.2437124252319336,
"eai_web_code": 0.12829351425170898
}
}
|
{
"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.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,710,430,419,287,797,800 |
While on my way in to work this morning on the bus, I was trying to get a few extra minutes work done on my laptop and found myself contemplating software design. We've all seen examples of good design - things that work really well and solve problems simply and completely. Have you ever stopped to think what made those designs good?
One example of a good design is my Logitech V220 mouse. I love this mouse because:
1. It just works every time in every environment. I've had laptops that hated other mice that I've owned. Often they would fail to recognize the mouse receiver when I would plug them into the laptops USB ports. Sometimes it would take 3 or 4 tries and often I would have to try 2 or 3 different USB ports to make them work. I had one mouse that would refuse to work on those cheap plastic Costco fold up tables - not sure why. The tables weren't even shiny. It's a good thing I didn't have to use those mice to dial 911.
2. It has all the features that I want in a mouse. Those features include two mouse buttons, a scroll wheel and rubberized sides so I can keep a good grip on it and that's about it. I know there those who see feature richness as a good thing, and in many circumstances, features are good. After all, it is often the number of features that allow us to solve a wide range of problems but in my experience, feature richness does not necessarily correlate to greatness. If you don't believe me, consider Google's user interface.
3. It strikes the right balance between portability and usability. I've had portable mice and they are either too small and cause my hand to cramp or too large and weigh as much as my laptop. I know there are other solutions to portability such as my laptop's built in track pad but I've but never got the hang of track pad drag and drop even after using the track pad exclusively for more than a year.
4. It solves 2 common cordless mouse problems really well: loss of the mini wireless receiver and dead mouse batteries. The clever Logitech engineers came up with a slot in the bottom of the mouse to attach the receiver to. When I remove the receiver, it turns the mouse on and when I store the receiver, it turns the mouse off. The mouse and receiver are never separated in storage. Simple solution. Nice!
5. It's durable. I see all sorts of dents and suspicious marks all over it from where it has been dropped out of my bag but it keeps on working despite the abuse.
6. It's a reasonable price. At $30. It's a bargain.
I think there are important parallel lessons in software design that can be learned from my mouse. I often wonder if sometimes we spend too much effort trying to pack features into our software products rather than trying to make the software work well and solve fundamental problems. Maybe we should take that extra time and really consider what it is our users are really trying to accomplish and work on solutions to those problems. It would also be interesting to know if one designer designed the mouse or a committee. I suspect that the design of the V220 was from the mind of a single talented industrial engineer.
Just some thoughts
|
{
"url": "http://www.geocortex.com/about/blog/archive/lessons-learned-from-my-mouse/",
"source_domain": "www.geocortex.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "309062",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6QKU2ZZW3Q2IXWWVN3YFRYO455IL7DQD",
"WARC-Concurrent-To": "<urn:uuid:2059970f-fb8f-4746-9ff7-68f52f615853>",
"WARC-Date": "2017-10-21T10:31:49Z",
"WARC-IP-Address": "23.100.15.180",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XGR6LLPFKNP3ZAQK6BRG74J44RFIG35N",
"WARC-Record-ID": "<urn:uuid:9cd0cfe8-a4ad-4f7d-be37-892c06f41874>",
"WARC-Target-URI": "http://www.geocortex.com/about/blog/archive/lessons-learned-from-my-mouse/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:974fccef-e4c0-4790-bf80-a9365bebc735>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-170-22-195.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,
336,
337,
420,
421,
944,
1472,
1877,
2286,
2451,
2505,
2506,
3128,
3129
],
"line_end_idx": [
336,
337,
420,
421,
944,
1472,
1877,
2286,
2451,
2505,
2506,
3128,
3129,
3147
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3147,
"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.47669172286987305,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03609022870659828,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12481202930212021,
"rps_doc_frac_unique_words": 0.4637930989265442,
"rps_doc_mean_word_length": 4.275862216949463,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.106441497802734,
"rps_doc_word_count": 580,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.020967740565538406,
"rps_doc_frac_chars_dupe_6grams": 0.020967740565538406,
"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.019354840740561485,
"rps_doc_frac_chars_top_3gram": 0.009677420370280743,
"rps_doc_frac_chars_top_4gram": 0.014516130089759827,
"rps_doc_books_importance": -297.03814697265625,
"rps_doc_books_importance_length_correction": -297.03814697265625,
"rps_doc_openwebtext_importance": -152.99351501464844,
"rps_doc_openwebtext_importance_length_correction": -152.99351501464844,
"rps_doc_wikipedia_importance": -130.8058319091797,
"rps_doc_wikipedia_importance_length_correction": -130.8058319091797
},
"fasttext": {
"dclm": 0.028075460344552994,
"english": 0.9834359884262085,
"fineweb_edu_approx": 1.3329195976257324,
"eai_general_math": 0.5424478054046631,
"eai_open_web_math": 0.1606544852256775,
"eai_web_code": 0.21899861097335815
}
}
|
{
"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": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-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": "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
|
-8,117,207,362,048,706,000 |
Pull to refresh
Использование Razor за пределами ASP.NET
.NET *
Итак, вчера Microsoft выпустила ASP.NET MVC3 RTM, который включает в себя новый движок представлений Razor. Как вы наверняка уже знаете, Razor не содержит каких-то компонентов, специфичных для web, а значит, его можно использовать и в других приложениях. Ну, а если вы этого еще не знаете – то самое время узнать!
В этом посте я покажу, как использовать Razor в качестве движка шаблонов для ваших нужд. Источником для него послужил блог-пост Andrew Nurse «Hosting Razor outside of ASP.Net», но это не прямой перевод.
Для примера я создам текст письма, который содержит информацию о сделанном заказе.
Заказ описывается двумя классами, OrderModel и OrderItemModel:
public class OrderModel
{
public string FirstName { get; set; }
public string LastName { get; set; }
public List<OrderItemModel> Items { get; set; }
}
public class OrderItemModel
{
public string ProductName { get; set; }
public Decimal Price { get; set; }
public int Qty { get; set; }
}
Шаблон, который я буду использовать для создания e-mail, показан ниже. Более подробную информацию о синтаксисе Razor вы можете получить, например, в блог-посте Андрея Тарицына «Краткий справочник по синтаксису Razor [Перевод]».
Здравствуйте, @Model.FirstName @Model.LastName!
# Продукт Цена Кол-во Итог
- ---------- ------ ------ ------
@for (var i = 0; i < Model.Items.Count; i++)
{
var item = Model.Items[i];
@String.Format(
"{0} {1,-10} {2,6} {3,6} {4,6}\r\n",
i + 1,
@item.ProductName,
@item.Price,
@item.Qty,
item.Price * item.Qty)
}
Всего: @(((OrderModel)Model).Items.Sum(x => x.Price * x.Qty))
WBR,
ACME team
Мне потребуется класс, который будет использоваться как базовый для моего шаблона:
public abstract class TemplateBase
{
public TextWriter Output { get; set; }
public dynamic Model { get; set; }
public abstract void Execute();
public virtual void Write(object value)
{
this.Output.Write(value);
}
public virtual void WriteLiteral(object value)
{
this.Output.Write(value);
}
}
Свойство Output задает TextWriter, который получает результат выполнения шаблона.
Свойство Model используется для передачи в шаблон параметров.
Метод Execute() в унаследованном классе будет содержать код шаблона.
Методы Write() и WriteLiteral() используются для вывода, соответственно, результатов вычисления выражений и текстовых строк. Т.к. мне не нужна дополнительная обработка ни для результатов вычислений, ни для строк, код этих методов совпадает.
Примечание: имена Execute(), Write() и WriteLiteral() используются по умолчанию, при необходимости вы можете указать другие имена используя свойство GeneratedClassContext экземпляра класса RazorEngineHost.
Теперь я создам хост для Razor, указав при этом, что в моем шаблоне используется C# (Razor поддерживает C# и VB, при необходимости вы можете использовать VB, передав к конструктор RazorEngineHost экземпляр VBRazorCodeLanguage):
var razorHost = new RazorEngineHost(new CSharpRazorCodeLanguage());
Далее я указываю имя базового класса, пространство имен, в котором будет находиться код шаблона, и имя класса-шаблона:
razorHost.DefaultBaseClass = typeof(TemplateBase).FullName;
razorHost.DefaultNamespace = "StandaloneRazorDemo";
razorHost.DefaultClassName = "Template";
Добавляю набор пространств имен, которые будут доступны в коде класса-шаблона:
razorHost.NamespaceImports.Add("System");
razorHost.NamespaceImports.Add("System.Collections.Generic");
razorHost.NamespaceImports.Add("System.Linq");
razorHost.NamespaceImports.Add("System.Text");
И, наконец, создаю движок шаблонов:
var razorEngine = new RazorTemplateEngine(razorHost);
Теперь я попробую разобрать свой шаблон:
var templateText = File.ReadAllText("template.txt");
GeneratorResults generatorResults = null;
using (var reader = new StringReader(templateText))
{
generatorResults = razorEngine.GenerateCode(reader);
}
Свойство Success класса GeneratorResults показывает, насколько успешно прошел разбор. Если при разборе возникли проблемы, я показываю список ошибок:
if (!generatorResults.Success)
{
foreach (var error in generatorResults.ParserErrors)
{
Console.WriteLine(
"Razor error: ({0}, {1}) {2}",
error.Location.LineIndex + 1,
error.Location.CharacterIndex + 1,
error.Message);
}
throw new ApplicationException();
}
Если разбор завершился успешно, свойство GeneratedCode содержит DOM tree, который далее можно использовать для генерации кода:
return generatorResults.GeneratedCode;
Теперь мне нужно скомпилировать шаблон:
private static string CompileTemplate(CodeCompileUnit generatedCode)
{
var codeProvider = new CSharpCodeProvider();
#if DEBUG
using (var writer = new StreamWriter("out.cs", false, Encoding.UTF8))
{
codeProvider.GenerateCodeFromCompileUnit(
generatedCode, writer, new CodeGeneratorOptions());
}
#endif
var outDirectory = "temp";
Directory.CreateDirectory(outDirectory);
var outAssemblyName = Path.Combine(outDirectory,
String.Format("{0}.dll", Guid.NewGuid().ToString("N")));
var refAssemblyNames = new List<string>();
refAssemblyNames.Add(new Uri(typeof(TemplateBase).Assembly.CodeBase).AbsolutePath);
refAssemblyNames.Add("System.Core.dll");
refAssemblyNames.Add("Microsoft.CSharp.dll");
var compilerResults = codeProvider.CompileAssemblyFromDom(
new CompilerParameters(refAssemblyNames.ToArray(), outAssemblyName),
generatedCode);
if (compilerResults.Errors.HasErrors)
{
var errors = compilerResults
.Errors
.OfType<CompilerError>()
.Where(x => !x.IsWarning);
foreach (var error in errors)
{
Console.WriteLine("Compiler error: ({0}, {1}) {2}",
error.Line, error.Column, error.ErrorText);
}
throw new ApplicationException();
}
return outAssemblyName;
}
Приведенный выше метод возвращает имя сборки, которая содержит скомпилированный шаблон.
Код, заключенный в #if DEBUG … #endif используется для отладки и позволяет посмотреть, во что же превратился шаблон после всех проведенных над ним манипуляций.
Все, что теперь мне нужно сделать, это загрузить сборку, создать экземпляр класса-шаблона и «выполнить» его:
var assembly = Assembly.LoadFrom(outAssemblyName);
var type = assembly.GetType("StandaloneRazorDemo.Template", true);
var template = Activator.CreateInstance(type) as TemplateBase;
using (var writer = new StringWriter())
{
template.Output = writer;
template.Model = GetModel();
template.Execute();
File.WriteAllText("out.txt", writer.ToString(), Encoding.UTF8);
}
Метод GetModel() определяется следующим образом:
private static OrderModel GetModel()
{
var model = new OrderModel { FirstName = "Джеймс", LastName = "Бонд" };
model.Items = new List<OrderItemModel>();
model.Items.Add(new OrderItemModel { ProductName = "Apple", Price = 4.95m, Qty = 1 });
model.Items.Add(new OrderItemModel { ProductName = "Kiwi", Price = 9.95m, Qty = 2 });
return model;
}
Теперь в файле «out.txt» содержится результат «выполнения» шаблона:
Здравствуйте, Джеймс Бонд!
# Продукт Цена Кол-во Итог
- ---------- ------ ------ ------
1 Apple 4,95 1 4,95
2 Kiwi 9,95 2 19,90
Всего: 24,85
WBR,
ACME team
Вот и все!
Код примера:
StandaloneRazorDemo.zip
Tags:
Hubs:
Total votes 62: ↑53 and ↓9 +44
Views 5.3K
Comments Comments 20
|
{
"url": "https://habr.com/en/post/111837/",
"source_domain": "habr.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "76615",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MF7XGLWBPC4OC5BR3MC6E3KX32R45CFR",
"WARC-Concurrent-To": "<urn:uuid:ee4510f2-2a16-4cbe-9a06-6b49afd21448>",
"WARC-Date": "2022-08-18T20:51:09Z",
"WARC-IP-Address": "178.248.237.68",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WRRAKXIFAEB7DN5I764EREKOYU2CXSFO",
"WARC-Record-ID": "<urn:uuid:39c67228-ba01-4699-80dd-bb09b47a6d1c>",
"WARC-Target-URI": "https://habr.com/en/post/111837/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aef6183f-837c-4628-904f-098d148694b8>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-65\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,
16,
17,
58,
59,
66,
380,
381,
584,
585,
586,
587,
670,
671,
734,
735,
759,
761,
803,
804,
845,
846,
898,
900,
901,
929,
931,
975,
976,
1015,
1016,
1049,
1051,
1052,
1053,
1281,
1282,
1330,
1331,
1363,
1397,
1442,
1444,
1475,
1495,
1540,
1555,
1582,
1603,
1622,
1653,
1655,
1656,
1718,
1719,
1724,
1734,
1735,
1736,
1819,
1820,
1855,
1857,
1900,
1901,
1940,
1941,
1977,
1978,
2022,
2028,
2062,
2068,
2069,
2120,
2126,
2160,
2166,
2168,
2169,
2170,
2252,
2253,
2315,
2316,
2385,
2386,
2627,
2628,
2834,
2835,
3063,
3064,
3132,
3133,
3134,
3253,
3254,
3314,
3366,
3407,
3408,
3409,
3488,
3489,
3531,
3593,
3640,
3687,
3688,
3689,
3725,
3726,
3780,
3781,
3782,
3823,
3824,
3825,
3878,
3879,
3921,
3973,
3975,
4032,
4034,
4035,
4036,
4185,
4186,
4217,
4219,
4276,
4282,
4309,
4352,
4394,
4441,
4469,
4475,
4476,
4514,
4516,
4517,
4518,
4645,
4646,
4685,
4686,
4687,
4727,
4728,
4797,
4799,
4848,
4849,
4859,
4933,
4939,
4989,
5053,
5059,
5066,
5067,
5098,
5143,
5144,
5197,
5262,
5263,
5310,
5398,
5443,
5493,
5494,
5557,
5634,
5658,
5659,
5701,
5707,
5744,
5764,
5801,
5840,
5841,
5879,
5889,
5953,
6013,
6023,
6024,
6066,
6072,
6073,
6101,
6103,
6104,
6105,
6193,
6194,
6354,
6355,
6464,
6465,
6516,
6583,
6646,
6647,
6687,
6689,
6719,
6752,
6753,
6777,
6778,
6846,
6848,
6849,
6850,
6899,
6900,
6937,
6939,
7015,
7016,
7062,
7153,
7243,
7244,
7262,
7264,
7265,
7266,
7334,
7335,
7362,
7363,
7395,
7429,
7463,
7497,
7498,
7511,
7512,
7517,
7527,
7528,
7529,
7540,
7541,
7554,
7578,
7584,
7590,
7621,
7632
],
"line_end_idx": [
16,
17,
58,
59,
66,
380,
381,
584,
585,
586,
587,
670,
671,
734,
735,
759,
761,
803,
804,
845,
846,
898,
900,
901,
929,
931,
975,
976,
1015,
1016,
1049,
1051,
1052,
1053,
1281,
1282,
1330,
1331,
1363,
1397,
1442,
1444,
1475,
1495,
1540,
1555,
1582,
1603,
1622,
1653,
1655,
1656,
1718,
1719,
1724,
1734,
1735,
1736,
1819,
1820,
1855,
1857,
1900,
1901,
1940,
1941,
1977,
1978,
2022,
2028,
2062,
2068,
2069,
2120,
2126,
2160,
2166,
2168,
2169,
2170,
2252,
2253,
2315,
2316,
2385,
2386,
2627,
2628,
2834,
2835,
3063,
3064,
3132,
3133,
3134,
3253,
3254,
3314,
3366,
3407,
3408,
3409,
3488,
3489,
3531,
3593,
3640,
3687,
3688,
3689,
3725,
3726,
3780,
3781,
3782,
3823,
3824,
3825,
3878,
3879,
3921,
3973,
3975,
4032,
4034,
4035,
4036,
4185,
4186,
4217,
4219,
4276,
4282,
4309,
4352,
4394,
4441,
4469,
4475,
4476,
4514,
4516,
4517,
4518,
4645,
4646,
4685,
4686,
4687,
4727,
4728,
4797,
4799,
4848,
4849,
4859,
4933,
4939,
4989,
5053,
5059,
5066,
5067,
5098,
5143,
5144,
5197,
5262,
5263,
5310,
5398,
5443,
5493,
5494,
5557,
5634,
5658,
5659,
5701,
5707,
5744,
5764,
5801,
5840,
5841,
5879,
5889,
5953,
6013,
6023,
6024,
6066,
6072,
6073,
6101,
6103,
6104,
6105,
6193,
6194,
6354,
6355,
6464,
6465,
6516,
6583,
6646,
6647,
6687,
6689,
6719,
6752,
6753,
6777,
6778,
6846,
6848,
6849,
6850,
6899,
6900,
6937,
6939,
7015,
7016,
7062,
7153,
7243,
7244,
7262,
7264,
7265,
7266,
7334,
7335,
7362,
7363,
7395,
7429,
7463,
7497,
7498,
7511,
7512,
7517,
7527,
7528,
7529,
7540,
7541,
7554,
7578,
7584,
7590,
7621,
7632,
7652
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7652,
"ccnet_original_nlines": 256,
"rps_doc_curly_bracket": 0.009932040236890316,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04320557042956352,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018118470907211304,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6689895391464233,
"rps_doc_frac_unique_words": 0.5776566863059998,
"rps_doc_mean_word_length": 7.550408840179443,
"rps_doc_num_sentences": 128,
"rps_doc_symbol_to_word_ratio": 0.006271780002862215,
"rps_doc_unigram_entropy": 5.731568336486816,
"rps_doc_word_count": 734,
"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.00866113044321537,
"rps_doc_frac_chars_top_3gram": 0.01515697967261076,
"rps_doc_frac_chars_top_4gram": 0.007217609789222479,
"rps_doc_books_importance": -651.2604370117188,
"rps_doc_books_importance_length_correction": -651.2604370117188,
"rps_doc_openwebtext_importance": -423.4829406738281,
"rps_doc_openwebtext_importance_length_correction": -423.4829406738281,
"rps_doc_wikipedia_importance": -264.45733642578125,
"rps_doc_wikipedia_importance_length_correction": -264.45733642578125
},
"fasttext": {
"dclm": 0.9480943083763123,
"english": 0.005394080188125372,
"fineweb_edu_approx": 3.1294045448303223,
"eai_general_math": 0.0004045400128234178,
"eai_open_web_math": 0.056178271770477295,
"eai_web_code": 0.9442323446273804
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-228,988,114,957,571,940 |
Version
Quick search
Table Of Contents
Spinner
New in version 1.4.0.
_images/spinner.jpg
Spinner is a widget that provides a quick way to select one value from a set. In the default state, a spinner shows its currently selected value. Touching the spinner displays a dropdown menu with all the other available values from which the user can select a new one.
Example:
from kivy.base import runTouchApp
from kivy.uix.spinner import Spinner
spinner = Spinner(
# default value shown
text='Home',
# available values
values=('Home', 'Work', 'Other', 'Custom'),
# just for positioning in our example
size_hint=(None, None),
size=(100, 44),
pos_hint={'center_x': .5, 'center_y': .5})
def show_selected_value(spinner, text):
print('The spinner', spinner, 'has text', text)
spinner.bind(text=show_selected_value)
runTouchApp(spinner)
Kv Example:
FloatLayout:
Spinner:
size_hint: None, none
size: 100, 44
pos_hint: {'center': (.5, .5)}
text: 'Home'
values: 'Home', 'Work', 'Other', 'Custom'
on_value:
print: "The spinner {} has text {}".format(self, self.value)
class kivy.uix.spinner.Spinner(**kwargs)[source]
Bases: kivy.uix.button.Button
Spinner class, see module documentation for more information.
dropdown_cls
Class used to display the dropdown list when the Spinner is pressed.
dropdown_cls is an ObjectProperty and defaults to DropDown.
Changed in version 1.8.0: If set to a string, the Factory will be used to resolve the class name.
is_open
By default, the spinner is not open. Set to True to open it.
is_open is a BooleanProperty and defaults to False.
New in version 1.4.0.
option_cls
Class used to display the options within the dropdown list displayed under the Spinner. The text property of the class will be used to represent the value.
The option class requires:
• a text property, used to display the value.
• an on_release event, used to trigger the option when pressed/touched.
• a size_hint_y of None.
• the height to be set.
option_cls is an ObjectProperty and defaults to SpinnerOption.
Changed in version 1.8.0: If you set a string, the Factory will be used to resolve the class.
sync_height
Each element in a dropdown list uses a default/user-supplied height. Set to True to propagate the Spinner’s height value to each dropdown list element.
New in version 1.10.0.
sync_height is a BooleanProperty and defaults to False.
text_autoupdate
Indicates if the spinner’s text should be automatically updated with the first value of the values property. Setting it to True will cause the spinner to update its text property every time attr:values are changed.
New in version 1.10.0.
text_autoupdate is a BooleanProperty and defaults to False.
values
Values that can be selected by the user. It must be a list of strings.
values is a ListProperty and defaults to [].
class kivy.uix.spinner.SpinnerOption(**kwargs)[source]
Bases: kivy.uix.button.Button
Special button used in the Spinner dropdown list. By default, this is just a Button with a size_hint_y of None and a height of 48dp.
|
{
"url": "https://kivy.org/doc/stable/api-kivy.uix.spinner.html",
"source_domain": "kivy.org",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "50446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:72IFB23NPBZO6VSLDHYHDBJFFKN4QZAT",
"WARC-Concurrent-To": "<urn:uuid:7e0dc0c4-3003-40d0-bb98-71b4552ca97c>",
"WARC-Date": "2020-04-05T10:25:43Z",
"WARC-IP-Address": "159.203.106.198",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:ZRSF7JISMD4PJXUSZ7LYD2MO6UZ5ZD5W",
"WARC-Record-ID": "<urn:uuid:b87d768e-d323-4c51-8497-3adb2a0a7357>",
"WARC-Target-URI": "https://kivy.org/doc/stable/api-kivy.uix.spinner.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9b8d40e1-de2e-4ae5-9a6d-8458244ff8ec>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
22,
23,
41,
42,
50,
51,
73,
74,
94,
95,
365,
366,
375,
376,
410,
447,
448,
467,
493,
510,
533,
581,
623,
651,
671,
718,
719,
759,
811,
812,
851,
852,
873,
874,
886,
887,
900,
913,
943,
965,
1004,
1025,
1075,
1093,
1166,
1215,
1216,
1246,
1247,
1309,
1310,
1323,
1324,
1393,
1394,
1454,
1455,
1553,
1554,
1562,
1563,
1624,
1625,
1677,
1678,
1700,
1701,
1712,
1713,
1869,
1870,
1897,
1898,
1946,
2020,
2047,
2073,
2074,
2137,
2138,
2232,
2233,
2245,
2246,
2398,
2399,
2422,
2423,
2479,
2480,
2496,
2497,
2712,
2713,
2736,
2737,
2797,
2798,
2805,
2806,
2877,
2878,
2923,
2924,
2979,
2980,
3010,
3011
],
"line_end_idx": [
8,
9,
22,
23,
41,
42,
50,
51,
73,
74,
94,
95,
365,
366,
375,
376,
410,
447,
448,
467,
493,
510,
533,
581,
623,
651,
671,
718,
719,
759,
811,
812,
851,
852,
873,
874,
886,
887,
900,
913,
943,
965,
1004,
1025,
1075,
1093,
1166,
1215,
1216,
1246,
1247,
1309,
1310,
1323,
1324,
1393,
1394,
1454,
1455,
1553,
1554,
1562,
1563,
1624,
1625,
1677,
1678,
1700,
1701,
1712,
1713,
1869,
1870,
1897,
1898,
1946,
2020,
2047,
2073,
2074,
2137,
2138,
2232,
2233,
2245,
2246,
2398,
2399,
2422,
2423,
2479,
2480,
2496,
2497,
2712,
2713,
2736,
2737,
2797,
2798,
2805,
2806,
2877,
2878,
2923,
2924,
2979,
2980,
3010,
3011,
3143
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3143,
"ccnet_original_nlines": 110,
"rps_doc_curly_bracket": 0.002545339986681938,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28831562399864197,
"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.29893776774406433,
"rps_doc_frac_unique_words": 0.375,
"rps_doc_mean_word_length": 5.2568182945251465,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0.004552349913865328,
"rps_doc_unigram_entropy": 4.595384120941162,
"rps_doc_word_count": 440,
"rps_doc_frac_chars_dupe_10grams": 0.03804583102464676,
"rps_doc_frac_chars_dupe_5grams": 0.14785991609096527,
"rps_doc_frac_chars_dupe_6grams": 0.1115434467792511,
"rps_doc_frac_chars_dupe_7grams": 0.08473843336105347,
"rps_doc_frac_chars_dupe_8grams": 0.03804583102464676,
"rps_doc_frac_chars_dupe_9grams": 0.03804583102464676,
"rps_doc_frac_chars_top_2gram": 0.030263729393482208,
"rps_doc_frac_chars_top_3gram": 0.033722441643476486,
"rps_doc_frac_chars_top_4gram": 0.02075226977467537,
"rps_doc_books_importance": -197.72605895996094,
"rps_doc_books_importance_length_correction": -197.72605895996094,
"rps_doc_openwebtext_importance": -144.0988311767578,
"rps_doc_openwebtext_importance_length_correction": -144.0988311767578,
"rps_doc_wikipedia_importance": -119.81273651123047,
"rps_doc_wikipedia_importance_length_correction": -119.81273651123047
},
"fasttext": {
"dclm": 0.08338004350662231,
"english": 0.591331958770752,
"fineweb_edu_approx": 1.831329584121704,
"eai_general_math": 0.8288013339042664,
"eai_open_web_math": 0.12027441710233688,
"eai_web_code": 0.9913643002510071
}
}
|
{
"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": "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": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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,986,014,864,953,289,000 |
Waste less time on Facebook — follow Brilliant.
×
Back to all chapters
Combinatorial Games
Whether you’re a master of games or just playing around, learn how combinatorial ideas can be used to analyze and solve games such as Nim.
Concept Quizzes
Combinatorial Games: Level 2 Challenges
You are playing a game of Tic-tac-toe. You are playing as \(O\) while your opponent plays as \(X\). The game plays as shown:
Where should you put your next \(O\) in order to save yourself from losing?
Andy and Bob are playing a game on a \( 9 \times 9 \) checkerboard. They take turns to move a move: on his turn, Andy places an X in an empty square while Bob places an O. When the entire checkerboard is filled, Andy scores a point for each row or column that contains more X's than O's, while Bob scores a point for each row or column that contains more O's than X's. The winner of the game is the person with (strictly) more points.
Given that Andy makes the first move, who has the winning strategy?
Note: If they both scored 9 points, then it is considered a draw.
Daniel and Cody are playing a game on an infinite unit square grid. Daniel places unit square sticky notes with a letter \(D\), while Cody places unit square sticky notes with a letter \(C\). They take turns placing sticky notes on squares in the grid, with Daniel going first. Cody wants to have four of his sticky notes form the corners of a perfect square with sides parallel to the grid lines, while Daniel wants to prevent him from doing so.
Can Daniel succeed?
Assume that both players make optimal moves.
Alice and Carla are playing a game often learned in elementary school known as Say 16. The rules for the game are as follows:
• Each player takes turns saying between 1 and 3 consecutive numbers, with the first player starting with the number 1. For example, Player 1 could say the numbers 1 and 2, then Player 2 can say "3, 4, 5", then Player 1 can say "6" and so on.
• The goal of the game is to be the one to say "16".
Carla decides that she'll go first and that Alice will go second. Is there a way to tell which player is going to win before the game even starts?
Details and Assumptions:
• Assume that each player plays "perfectly", meaning that if there was an optimal way of playing, both players would be playing the best that the game allows them to play.
You're playing tic tac toe with an opponent who is \(X\) while you are \(O\).
The initial gameplay is as shown below:
Assuming that your opponent will play optimally from now on, where must you place your next mark in order to obtain a winning position?
×
Problem Loading...
Note Loading...
Set Loading...
|
{
"url": "https://brilliant.org/practice/combinatorial-games-level-1-2-challenges/",
"source_domain": "brilliant.org",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "152383",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4MB4W3DA3OIYQ4Y73TZPLVNVPQ6BK6UE",
"WARC-Concurrent-To": "<urn:uuid:32bfe2f6-3f3c-4b22-80da-08980d71fc06>",
"WARC-Date": "2017-03-26T07:26:26Z",
"WARC-IP-Address": "54.213.229.196",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:PE444LT5LKONDLDV7VGGMSLTC2HJHTOH",
"WARC-Record-ID": "<urn:uuid:a01af4c0-70ce-47e8-984d-d337fb2f6fe4>",
"WARC-Target-URI": "https://brilliant.org/practice/combinatorial-games-level-1-2-challenges/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1fbc123e-b76a-487b-9fe7-2c00d23d6d42>"
},
"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,
48,
50,
71,
72,
92,
93,
232,
233,
249,
250,
290,
291,
301,
302,
427,
428,
504,
505,
940,
941,
1009,
1010,
1076,
1077,
1524,
1525,
1545,
1546,
1591,
1592,
1718,
1719,
1964,
1965,
2020,
2021,
2168,
2169,
2194,
2195,
2369,
2370,
2448,
2449,
2489,
2490,
2626,
2627,
2629,
2630,
2649,
2650,
2666,
2667
],
"line_end_idx": [
48,
50,
71,
72,
92,
93,
232,
233,
249,
250,
290,
291,
301,
302,
427,
428,
504,
505,
940,
941,
1009,
1010,
1076,
1077,
1524,
1525,
1545,
1546,
1591,
1592,
1718,
1719,
1964,
1965,
2020,
2021,
2168,
2169,
2194,
2195,
2369,
2370,
2448,
2449,
2489,
2490,
2626,
2627,
2629,
2630,
2649,
2650,
2666,
2667,
2681
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2681,
"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.4120689630508423,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022413790225982666,
"rps_doc_frac_lines_end_with_ellipsis": 0.05454545095562935,
"rps_doc_frac_no_alph_words": 0.18448275327682495,
"rps_doc_frac_unique_words": 0.44262295961380005,
"rps_doc_mean_word_length": 4.178278923034668,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.005172410048544407,
"rps_doc_unigram_entropy": 4.998469829559326,
"rps_doc_word_count": 488,
"rps_doc_frac_chars_dupe_10grams": 0.04512016102671623,
"rps_doc_frac_chars_dupe_5grams": 0.09906817227602005,
"rps_doc_frac_chars_dupe_6grams": 0.0823933333158493,
"rps_doc_frac_chars_dupe_7grams": 0.0823933333158493,
"rps_doc_frac_chars_dupe_8grams": 0.0823933333158493,
"rps_doc_frac_chars_dupe_9grams": 0.04512016102671623,
"rps_doc_frac_chars_top_2gram": 0.020598329603672028,
"rps_doc_frac_chars_top_3gram": 0.021579209715127945,
"rps_doc_frac_chars_top_4gram": 0.02942618913948536,
"rps_doc_books_importance": -291.1441650390625,
"rps_doc_books_importance_length_correction": -291.1441650390625,
"rps_doc_openwebtext_importance": -155.46652221679688,
"rps_doc_openwebtext_importance_length_correction": -155.46652221679688,
"rps_doc_wikipedia_importance": -103.25982666015625,
"rps_doc_wikipedia_importance_length_correction": -103.25982666015625
},
"fasttext": {
"dclm": 0.5680601596832275,
"english": 0.9649486541748047,
"fineweb_edu_approx": 2.1786696910858154,
"eai_general_math": 0.5513173341751099,
"eai_open_web_math": 0.31150585412979126,
"eai_web_code": 0.05814218893647194
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "511.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,170,222,816,007,282,000 |
Results 1 to 5 of 5
Like Tree5Thanks
• 2 Post By chiro
• 2 Post By Deveno
• 1 Post By Deveno
Math Help - Find matrix representation? (linear algebra)
1. #1
Newbie
Joined
Oct 2012
From
montreal
Posts
3
Find matrix representation? (linear algebra)
Consider F: R^2 -> R^2 where F(1,1) = (3,-2) and F(3,-2) = (4,8). Find the matrix representation of F in the standard basis. Assuming B{(1,1),(1,-1)} is a basis, find the matrix representation of F from B to the standard basis.
Follow Math Help Forum on Facebook and Google+
2. #2
MHF Contributor
Joined
Sep 2012
From
Australia
Posts
5,028
Thanks
1106
Re: Find matrix representation? (linear algebra)
Hey lisa92.
Hint: Remember that your matrix is 2x2 [a b; c d] and F(1,1) = (3,-2) means <a*1 + b*1, c*1 + d*1> = <3,-2> so a + b = 3 and c + d = -2.
Now you have another relationship which will give you two more equations which means four equations in four unknowns which is enough to solve for these four unknowns if the matrix is non-singular (i.e. has non-zero determinant).
Thanks from heyhey and lisa92
Follow Math Help Forum on Facebook and Google+
3. #3
MHF Contributor
Joined
Mar 2011
From
Tejas
Posts
3,450
Thanks
790
Re: Find matrix representation? (linear algebra)
suppose the matrix for F (in the standard basis) is T, where:
T = \begin{bmatrix}a&b\\c&d \end{bmatrix}.
we are given that:
\begin{bmatrix}a&b\\c&d \end{bmatrix} \begin{bmatrix}1\\1 \end{bmatrix} = \begin{bmatrix}3\\-2 \end{bmatrix}
and:
\begin{bmatrix}a&b\\c&d \end{bmatrix} \begin{bmatrix}3\\-2 \end{bmatrix} = \begin{bmatrix}4\\8 \end{bmatrix}
this gives us:
a + b = 3
3a - 2b = 4
and
c + d = -2
3c - 2d = 8
these 2 systems of two equations in two unknowns are simple enough to solve by elimination and substitution (the "high-school method"), mutliply the first equation in each system by 3 and subtract the second from the first:
3a + 3b = 9
3a - 2b = 4
3c + 3d = -6
3c - 2d = 8
so
5b = 5 --> b = 1, so a = 2
5d = -14 --> d = -14/5, so c = 4/5
thus
T = \begin{bmatrix}2&1\\ \frac{4}{5}&-\frac{14}{5}\end{bmatrix}
now finding the representation of T from the basis B = {(1,1),(1,-1)} to the standard basis is a bit of a chore. what we need is a "change of basis" matrix, P.
the idea is: P turns "B-coordinates" into "standard coordinates", and one we have THOSE, we can apply T to them.
now in "B-coordinates" (1,1) is [1,0]B, which is short-hand for: 1(1,1) + 0(1,-1). so the matrix P should take (1,0) to (1,1) = 1(1,0) + 1(0,1)
((1,0) and (0,1) are the "standard basis vectors"). that is: the first COLUMN of P should be (1,1)T.
similarly, P should take [0,1]B to (1,-1) so the second column of P should be (1,-1)T, that is:
P = \begin{bmatrix}1&1\\1&-1 \end{bmatrix}.
so the representation of F from B to the standard basis, should be:
T' = TP = \begin{bmatrix}2&1\\ \frac{4}{5}&-\frac{14}{5}\end{bmatrix}\begin{bmatrix}1&1\\1&-1 \end{bmatrix} = \begin{bmatrix}3&1\\-2&\frac{18}{5} \end{bmatrix}
let's verify that T' does what we want it to.
first, we need to express (1,1) and (3,-2) in "B-coordinates". well, (1,1) is easy: (1,1) = [1,0]B.
to express (3,-2) in "B-coordinates", we COULD find P-1 (which is a bit of a pain), or just solve:
u(1,1) + v(1,-1) = (3,-2) for u and v (which i think is easier). this gives:
u + v = 3
u - v = -2
so 2u = 1, thus u = 1/2 and so v = 5/2. so in "B-coordinates" we have (3,-2) = [1/2,5/2]B.
so we want to show that:
T'([1,0]B) = (3,-2), which is obvious because that's the first column of T'.
and:
\begin{bmatrix}3&1\\-2&\frac{18}{5} \end{bmatrix} \begin{bmatrix}\frac{1}{2}\\ \frac{5}{2} \end{bmatrix} = \begin{bmatrix}4\\8 \end{bmatrix}
which means T' maps the B-coordinate versions of (1,1) and (-3,2) to what they should be (as determined by F): (3,-2) and (4,8).
Thanks from heyhey and lisa92
Follow Math Help Forum on Facebook and Google+
4. #4
Newbie
Joined
Oct 2012
From
montreal
Posts
3
Re: Find matrix representation? (linear algebra)
wow thank you so much for taking the time to explain this!
any if I want the matrix representation from B to B I do:
Tb,b = (Tst,b)P =
(3 1 ) * P
(-2 18/5)
?
Follow Math Help Forum on Facebook and Google+
5. #5
MHF Contributor
Joined
Mar 2011
From
Tejas
Posts
3,450
Thanks
790
Re: Find matrix representation? (linear algebra)
to get the matrix of F from B TO B, we need to do the following:
first we use the change of basis matrix P (which turns B-coordinates into "standard" coordinates (what we're used to)).
in the standard basis, we know the matrix that works is T. so we take T of P([v]B).
this is TP applied to [v]B.
now that answer is in "standard coordinates", and we want out answer in B-coordinates, so we need to "undo what P does".
this means we need to use the matrix P-1, and apply that to TP([v]B).
so the matrix we're looking for is:
P-1TP.
the change from T to P-1TP is sometimes called a "similarity transform", it turns "standard basis matrix representations" into "B-coordinate matrix representations".
this rule actually holds for any 2 bases B and C, and any linear transformation T, with matrix representations [T]B,[T]C:
if P([v]B) = [v]C,
[T]B = P-1[T]CP.
often, to make things "easier on the mind", textbook exercises use the standard basis for B or C. the thing about bases is: vector spaces don't care, any basis is as good as any other.
we, on the other hand, with our desire for "easy calculation" often have a preference. but that preference is a CHOICE, vector spaces don't always come with "a tailor-made basis".
Thanks from lisa92
Follow Math Help Forum on Facebook and Google+
Similar Math Help Forum Discussions
1. matrix representation of the linear transformation
Posted in the Advanced Algebra Forum
Replies: 2
Last Post: April 11th 2011, 04:30 PM
2. Linear Algebra - Find a matrix P that diagonalizes A
Posted in the Advanced Algebra Forum
Replies: 4
Last Post: November 30th 2010, 10:06 PM
3. Matrix Representation of Linear Transformations (2)
Posted in the Advanced Algebra Forum
Replies: 1
Last Post: October 4th 2008, 08:59 PM
4. Matrix Representation of Linear Transformations
Posted in the Advanced Algebra Forum
Replies: 1
Last Post: October 4th 2008, 08:55 PM
5. matrix representation of linear algebra
Posted in the Advanced Algebra Forum
Replies: 2
Last Post: June 30th 2008, 03:55 PM
Search Tags
/mathhelpforum @mathhelpforum
|
{
"url": "http://mathhelpforum.com/advanced-algebra/205327-find-matrix-representation-linear-algebra.html",
"source_domain": "mathhelpforum.com",
"snapshot_id": "crawl=CC-MAIN-2015-27",
"warc_metadata": {
"Content-Length": "53692",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3U7SFTH54KS46J6K6NDHXPH42YEYBIHP",
"WARC-Concurrent-To": "<urn:uuid:b4b0ad5e-a673-4dc9-8698-e48512cfd5c4>",
"WARC-Date": "2015-07-05T22:16:55Z",
"WARC-IP-Address": "66.114.149.59",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LE5WXSOUTTPHCIHFDA25LEFWYN7YVMD4",
"WARC-Record-ID": "<urn:uuid:1dedf4ec-249f-42a0-b6f5-e1f4c1a4ad90>",
"WARC-Target-URI": "http://mathhelpforum.com/advanced-algebra/205327-find-matrix-representation-linear-algebra.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:caeaa3df-ba4d-49dd-a755-796fffd0187f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-179-60-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-27\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
1,
2,
22,
39,
59,
80,
101,
102,
159,
160,
168,
179,
190,
203,
212,
225,
235,
241,
242,
291,
292,
524,
575,
576,
584,
604,
615,
628,
637,
651,
661,
671,
682,
691,
692,
745,
746,
762,
763,
904,
905,
1138,
1172,
1223,
1224,
1232,
1252,
1253,
1264,
1277,
1286,
1296,
1306,
1316,
1327,
1335,
1336,
1389,
1390,
1456,
1457,
1504,
1505,
1528,
1529,
1642,
1643,
1652,
1653,
1766,
1767,
1786,
1787,
1801,
1817,
1818,
1826,
1827,
1842,
1858,
1859,
2087,
2088,
2104,
2120,
2121,
2138,
2154,
2155,
2162,
2163,
2194,
2195,
2234,
2235,
2244,
2245,
2313,
2314,
2478,
2479,
2596,
2597,
2745,
2746,
2851,
2852,
2952,
2953,
3001,
3002,
3074,
3075,
3239,
3240,
3290,
3291,
3395,
3396,
3499,
3500,
3581,
3582,
3596,
3611,
3612,
3707,
3708,
3737,
3738,
3819,
3820,
3829,
3830,
3975,
3976,
4109,
4143,
4194,
4195,
4203,
4214,
4225,
4238,
4247,
4260,
4270,
4276,
4277,
4330,
4331,
4394,
4395,
4457,
4458,
4480,
4481,
4496,
4510,
4511,
4517,
4568,
4569,
4577,
4597,
4598,
4609,
4622,
4631,
4641,
4651,
4661,
4672,
4680,
4681,
4734,
4735,
4804,
4805,
4929,
4930,
5018,
5019,
5051,
5052,
5177,
5178,
5252,
5253,
5293,
5294,
5305,
5306,
5476,
5477,
5603,
5604,
5627,
5628,
5649,
5650,
5839,
5840,
6024,
6047,
6098,
6099,
6135,
6136,
6192,
6233,
6248,
6289,
6347,
6388,
6403,
6447,
6504,
6545,
6560,
6602,
6655,
6696,
6711,
6753,
6798,
6839,
6854,
6894,
6895,
6907,
6908,
6909
],
"line_end_idx": [
1,
2,
22,
39,
59,
80,
101,
102,
159,
160,
168,
179,
190,
203,
212,
225,
235,
241,
242,
291,
292,
524,
575,
576,
584,
604,
615,
628,
637,
651,
661,
671,
682,
691,
692,
745,
746,
762,
763,
904,
905,
1138,
1172,
1223,
1224,
1232,
1252,
1253,
1264,
1277,
1286,
1296,
1306,
1316,
1327,
1335,
1336,
1389,
1390,
1456,
1457,
1504,
1505,
1528,
1529,
1642,
1643,
1652,
1653,
1766,
1767,
1786,
1787,
1801,
1817,
1818,
1826,
1827,
1842,
1858,
1859,
2087,
2088,
2104,
2120,
2121,
2138,
2154,
2155,
2162,
2163,
2194,
2195,
2234,
2235,
2244,
2245,
2313,
2314,
2478,
2479,
2596,
2597,
2745,
2746,
2851,
2852,
2952,
2953,
3001,
3002,
3074,
3075,
3239,
3240,
3290,
3291,
3395,
3396,
3499,
3500,
3581,
3582,
3596,
3611,
3612,
3707,
3708,
3737,
3738,
3819,
3820,
3829,
3830,
3975,
3976,
4109,
4143,
4194,
4195,
4203,
4214,
4225,
4238,
4247,
4260,
4270,
4276,
4277,
4330,
4331,
4394,
4395,
4457,
4458,
4480,
4481,
4496,
4510,
4511,
4517,
4568,
4569,
4577,
4597,
4598,
4609,
4622,
4631,
4641,
4651,
4661,
4672,
4680,
4681,
4734,
4735,
4804,
4805,
4929,
4930,
5018,
5019,
5051,
5052,
5177,
5178,
5252,
5253,
5293,
5294,
5305,
5306,
5476,
5477,
5603,
5604,
5627,
5628,
5649,
5650,
5839,
5840,
6024,
6047,
6098,
6099,
6135,
6136,
6192,
6233,
6248,
6289,
6347,
6388,
6403,
6447,
6504,
6545,
6560,
6602,
6655,
6696,
6711,
6753,
6798,
6839,
6854,
6894,
6895,
6907,
6908,
6909,
6938
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6938,
"ccnet_original_nlines": 233,
"rps_doc_curly_bracket": 0.01383684016764164,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2405405342578888,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0578378401696682,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4567567706108093,
"rps_doc_frac_unique_words": 0.30821919441223145,
"rps_doc_mean_word_length": 4.389432430267334,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.002702699974179268,
"rps_doc_unigram_entropy": 5.1490302085876465,
"rps_doc_word_count": 1022,
"rps_doc_frac_chars_dupe_10grams": 0.1176995113492012,
"rps_doc_frac_chars_dupe_5grams": 0.30004456639289856,
"rps_doc_frac_chars_dupe_6grams": 0.22313864529132843,
"rps_doc_frac_chars_dupe_7grams": 0.18724921345710754,
"rps_doc_frac_chars_dupe_8grams": 0.17877842485904694,
"rps_doc_frac_chars_dupe_9grams": 0.14534105360507965,
"rps_doc_frac_chars_top_2gram": 0.05795808881521225,
"rps_doc_frac_chars_top_3gram": 0.0285332091152668,
"rps_doc_frac_chars_top_4gram": 0.04012482985854149,
"rps_doc_books_importance": -750.8661499023438,
"rps_doc_books_importance_length_correction": -750.8661499023438,
"rps_doc_openwebtext_importance": -490.52392578125,
"rps_doc_openwebtext_importance_length_correction": -490.52392578125,
"rps_doc_wikipedia_importance": -350.2703857421875,
"rps_doc_wikipedia_importance_length_correction": -350.2703857421875
},
"fasttext": {
"dclm": 0.21008968353271484,
"english": 0.8597187399864197,
"fineweb_edu_approx": 2.5839221477508545,
"eai_general_math": 0.9553750157356262,
"eai_open_web_math": 0.8799610137939453,
"eai_web_code": 0.005522250197827816
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "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": "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
|
-3,947,877,910,234,822,000 |
Tuesday, March 30, 2010
EversionMod 1.2 bug fixes
I've fixed the gem counting problem for levels before level 8. Also, the HUD is not drawn for level 8; place a 0xDB tile anywhere in the area8.map to force drawing of the HUD for that map. Conversely, place a 0xDA anywhere in a map to hide the HUD for that map. In addition to these tiles, there's also a 0xDC tile which forces the 7-8 gem warp to update according to how many gems the player has collected. This allows the player to collect all the gems on the last level and return to the 7-8 gem warp and eversion. In the original Eversion, you would need to restart the level in order for the 7-8 gem warp to update.
You can't reach these tiles normally, you'll have to turn off "Available tiles only" from the edit menu to get to them, or you can edit "./data/tileLayout.txt" and "./data/tiles.png" and add the 0xDA to 0xDC tiles manually. Closing all the windows in EversionEditor and then opening another window will force the reloading of tileLayout.txt and tiles.png.
Requirements:
EversionMod 1.0
Download:
EversionMod 1.2
4 comments:
1. Too bad the EversionMod doesn't work with the HD version of Eversion. XD I was all set to make my own HD levels too.
I guess I'll have to stick with the vanilla version for that. (I would do it myself but scripting is way over my head.)
(Also, in your documentation, the install instructions for EMod are backward. >.>; It says to overwrite the EMod files with the default Eversion files, even though you do the opposite in the video.)
Still, epic work. n_n
ReplyDelete
2. Hello Fastcall22, is there a way to contact you ? I am working on a fully extended meta version of Eversion and basicly, making longer levels thank to your help and editor. I would love to explain you the project in detail. you can contact me on [email protected] if you ever read this message.
best regard.
ReplyDelete
3. This comment has been removed by the author.
ReplyDelete
4. Hello, I'm intersted in these files, but they seem out of reach since they're down. Are these from the HD version? Would there be a way to put them back up?
ReplyDelete
|
{
"url": "http://fastcall22.blogspot.com/2010/03/eversionmod-12-bug-fixes.html",
"source_domain": "fastcall22.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "45484",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6QVLVR6FSYAVGIJGD6HUSMDNFVNXJMMS",
"WARC-Concurrent-To": "<urn:uuid:2b746574-5df4-406d-8985-a2b92084ff12>",
"WARC-Date": "2017-05-29T11:21:35Z",
"WARC-IP-Address": "172.217.7.161",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LESF5Q3ZTH3DA7N47B7ZJBPL5ZZJ4CSU",
"WARC-Record-ID": "<urn:uuid:a5aa33d4-94d9-482b-ae99-d6970451aa17>",
"WARC-Target-URI": "http://fastcall22.blogspot.com/2010/03/eversionmod-12-bug-fixes.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c90fafab-6d67-4a3f-beda-ff1265eb4cc2>"
},
"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,
24,
25,
51,
52,
673,
674,
1030,
1031,
1045,
1061,
1062,
1072,
1088,
1089,
1101,
1102,
1224,
1225,
1349,
1350,
1553,
1554,
1580,
1581,
1597,
1896,
1897,
1914,
1915,
1931,
1981,
1982,
1998,
2160,
2161,
2177,
2178
],
"line_end_idx": [
24,
25,
51,
52,
673,
674,
1030,
1031,
1045,
1061,
1062,
1072,
1088,
1089,
1101,
1102,
1224,
1225,
1349,
1350,
1553,
1554,
1580,
1581,
1597,
1896,
1897,
1914,
1915,
1931,
1981,
1982,
1998,
2160,
2161,
2177,
2178,
2179
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2179,
"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.40041494369506836,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031120330095291138,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20954357087612152,
"rps_doc_frac_unique_words": 0.5277044773101807,
"rps_doc_mean_word_length": 4.356200695037842,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.876793384552002,
"rps_doc_word_count": 379,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04360992833971977,
"rps_doc_frac_chars_dupe_6grams": 0.024227740243077278,
"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.010902480222284794,
"rps_doc_frac_chars_top_3gram": 0.014536639675498009,
"rps_doc_frac_chars_top_4gram": 0.021804969757795334,
"rps_doc_books_importance": -168.31716918945312,
"rps_doc_books_importance_length_correction": -168.31716918945312,
"rps_doc_openwebtext_importance": -87.07258605957031,
"rps_doc_openwebtext_importance_length_correction": -87.07258605957031,
"rps_doc_wikipedia_importance": -10.705174446105957,
"rps_doc_wikipedia_importance_length_correction": -10.705174446105957
},
"fasttext": {
"dclm": 0.02969128079712391,
"english": 0.9404431581497192,
"fineweb_edu_approx": 1.1096137762069702,
"eai_general_math": 0.2213575839996338,
"eai_open_web_math": 0.17905139923095703,
"eai_web_code": 0.06669890880584717
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,042,791,883,049,573,000 |
Introduction
Recently, Microsoft has released the new version of Python Azure IoT SDK (V2.0) (refer to this page on IoT blog: New version of the Python SDK released). According to the release announcement, we should upgrade SDK from V1 to V2 since the v2 SDK aims to provide a simplified, more natural experience for developers. It’s designed in native Python.
In the previous tutorials, we first Installed the new Python Azure IoT SDK on Windows 10 and made a demo Python project with Visual Studio to send simulation date to the Azure IoTHub. Then we showed how to invoke Direct Methods from Backend App. For more details, please refer to the pervious toturials:
In this article, we will walk you through the steps required to build a sample application for sending and receiving device twins from IoT Hub with Python Azure IoT SDK.
Device twins in IoT Hub
Device twins are JSON documents that store device state information including metadata, configurations, and conditions. Azure IoT Hub maintains a device twin for each device that you connect to IoT Hub. Device twins are very useful to store device-specific metadata in the cloud, report current state information from your device app, and synchronize the state between device app and back-end app. The overview of the device twins is shown in Fig. 1.
Fig. 1 Overview of device twins
A device twin is a JSON document that includes:
• Tags. A section of the JSON document that the solution back end can read from and write to. Tags are not visible to device apps.
• Desired properties. Used along with reported properties to synchronize device configuration or conditions. The solution back end can set desired properties, and the device app can read them. The device app can also receive notifications of changes in the desired properties.
• Reported properties. Used along with desired properties to synchronize device configuration or conditions. The device app can set reported properties, and the solution back end can read and query them.
• Device identity properties. The root of the device twin JSON document contains the read-only properties from the corresponding device identity stored in the identity registry.
For more information about device twins, please refer to this page “Understand and use device twins in IoT Hub”.
Prerequisites
1. Windows 10 with Visual Studio 2019 Community (“Python development” workload required)
2. Python Azure IoT SDK: https://github.com/Azure/azure-iot-sdk-python/tree/master/azure-iot-device/samples
Reported properties of the device twins
First, we will demonstrate how to use reported properties of the device twins. Create a Python project with “Python Application” project temple, give a name such as “PythonIoTDemo”. Copy and paste the following code to “PythonIoTDemo.py”. Make sure that you substitute with your own connection string in the code.
import os
import asyncio
import random
from azure.iot.device.aio import IoTHubDeviceClient
async def main():
conn_str = "HostName=***.azure-devices.net;DeviceId=***;SharedAccessKey=***"
device_client = IoTHubDeviceClient.create_from_connection_string(conn_str)
# connect the client.
await device_client.connect()
# update the reported properties
reported_properties = {"temperature": random.randint(320, 800) / 10}
print("Setting reported temperature to {}".format(reported_properties["temperature"]))
await device_client.patch_twin_reported_properties(reported_properties)
# Finally, disconnect
await device_client.disconnect()
if __name__ == "__main__":
asyncio.run(main())
# If using Python 3.6 or below, use the following code instead of asyncio.run(main()):
# loop = asyncio.get_event_loop()
# loop.run_until_complete(main())
# loop.close()
In this application, we will report the temperature with a random value between 32.0 and 80.0. Once the device twin is sent, we will see the output message as shown in Fig. 2.
Fig. 2 Debug output in Visual Studio
Now, as soon as the Azure IoTHub receive the device twin, we can see the instant value on Azure Portal as presented in Fig. 3.
Fig. 3 Device twin on Azure portal
Desire properties of the device twins
Now, if we want to update the configurations in the device, we can use desire properties of the device twins. Create a Python project with “Python Application” project temple, give a name such as “PythonIoTDemo”. Copy and paste the following code to “PythonIoTDemo.py”. Make sure that you substitute with your own connection string in the code.
import os
import asyncio
import random
from azure.iot.device.aio import IoTHubDeviceClient
async def main():
conn_str = "HostName=***.azure-devices.net;DeviceId=***;SharedAccessKey=***"
device_client = IoTHubDeviceClient.create_from_connection_string(conn_str)
# connect the client.
await device_client.connect()
# define behavior for receiving a twin patch
async def twin_patch_listener(device_client):
while True:
patch = await device_client.receive_twin_desired_properties_patch() # blocking call
print("the data in the desired properties patch was: {}".format(patch))
# define behavior for halting the application
def stdin_listener():
while True:
selection = input("Press Q to quit\n")
if selection == "Q" or selection == "q":
print("Quitting...")
break
# Schedule task for twin patch
asyncio.create_task(twin_patch_listener(device_client))
# Run the stdin listener in the event loop
loop = asyncio.get_running_loop()
user_finished = loop.run_in_executor(None, stdin_listener)
# Wait for user to indicate they are done listening for messages
await user_finished
# Finally, disconnect
await device_client.disconnect()
if __name__ == "__main__":
asyncio.run(main())
# If using Python 3.6 or below, use the following code instead of asyncio.run(main()):
# loop = asyncio.get_event_loop()
# loop.run_until_complete(main())
# loop.close()
Run the application. Then, we add the following “desired” JSON code to the Device twin on Azure Portal
"desired": {
"temperature": 40.1,
"telemetryConfig": {
"sendFrequency": "1m"
},
"$metadata": {}
},
Which is shown in Fig. 4.
Fig. 4 Add desired properties to the device twin
Now, as soon as the device receives the desired properties, it will print the settings in the output windows as shown in Fig. 5
Fig. 5 The received desired properties of the device twin
We can see that not only the device twins are received, but also the version of the message is added automatically.
Summary
In this tutorial, we have presented the process to use device twins of Azure IoT Python SDK, including “reported properties of the device twin” and “desired properties of the device twin”.
Resources
See Also
|
{
"url": "https://social.technet.microsoft.com/wiki/contents/articles/53674.python-azure-iot-sdk-how-to-use-device-twins-in-iot-hub.aspx",
"source_domain": "social.technet.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "1049584",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MJXACJXM72IORWYZPY4OSZLXIZ3OMVWQ",
"WARC-Concurrent-To": "<urn:uuid:1793e492-99f5-46bf-be2e-cae8d588509c>",
"WARC-Date": "2022-05-17T18:36:04Z",
"WARC-IP-Address": "173.223.188.213",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:CGZO3TAV3TYEVAMNSDLD6ROV6LWFXINB",
"WARC-Record-ID": "<urn:uuid:0728c020-2c6f-4990-b5c7-1a623aece789>",
"WARC-Target-URI": "https://social.technet.microsoft.com/wiki/contents/articles/53674.python-azure-iot-sdk-how-to-use-device-twins-in-iot-hub.aspx",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3bd0634c-0fa2-4ba9-9807-2333013b2fc5>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-28\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
1,
2,
15,
16,
17,
366,
671,
841,
842,
866,
867,
868,
1319,
1320,
1352,
1353,
1354,
1402,
1403,
1536,
1815,
2021,
2201,
2202,
2315,
2316,
2317,
2331,
2332,
2421,
2529,
2530,
2531,
2571,
2572,
2886,
2896,
2911,
2925,
2977,
2979,
2997,
2999,
3080,
3159,
3161,
3187,
3221,
3223,
3260,
3333,
3424,
3496,
3498,
3522,
3559,
3561,
3588,
3612,
3614,
3705,
3743,
3781,
3796,
3797,
3973,
4011,
4012,
4139,
4140,
4175,
4176,
4214,
4215,
4560,
4561,
4571,
4586,
4600,
4652,
4654,
4672,
4674,
4755,
4834,
4836,
4862,
4896,
4898,
4948,
4998,
5017,
5114,
5198,
5200,
5250,
5276,
5296,
5347,
5400,
5437,
5459,
5461,
5496,
5556,
5558,
5605,
5643,
5706,
5708,
5777,
5801,
5803,
5829,
5866,
5868,
5895,
5919,
5921,
6012,
6050,
6088,
6103,
6104,
6207,
6208,
6221,
6244,
6267,
6293,
6298,
6316,
6319,
6345,
6394,
6523,
6581,
6697,
6698,
6706,
6707,
6896,
6897,
6907,
6908,
6910,
6911
],
"line_end_idx": [
1,
2,
15,
16,
17,
366,
671,
841,
842,
866,
867,
868,
1319,
1320,
1352,
1353,
1354,
1402,
1403,
1536,
1815,
2021,
2201,
2202,
2315,
2316,
2317,
2331,
2332,
2421,
2529,
2530,
2531,
2571,
2572,
2886,
2896,
2911,
2925,
2977,
2979,
2997,
2999,
3080,
3159,
3161,
3187,
3221,
3223,
3260,
3333,
3424,
3496,
3498,
3522,
3559,
3561,
3588,
3612,
3614,
3705,
3743,
3781,
3796,
3797,
3973,
4011,
4012,
4139,
4140,
4175,
4176,
4214,
4215,
4560,
4561,
4571,
4586,
4600,
4652,
4654,
4672,
4674,
4755,
4834,
4836,
4862,
4896,
4898,
4948,
4998,
5017,
5114,
5198,
5200,
5250,
5276,
5296,
5347,
5400,
5437,
5459,
5461,
5496,
5556,
5558,
5605,
5643,
5706,
5708,
5777,
5801,
5803,
5829,
5866,
5868,
5895,
5919,
5921,
6012,
6050,
6088,
6103,
6104,
6207,
6208,
6221,
6244,
6267,
6293,
6298,
6316,
6319,
6345,
6394,
6523,
6581,
6697,
6698,
6706,
6707,
6896,
6897,
6907,
6908,
6910,
6911,
6919
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6919,
"ccnet_original_nlines": 147,
"rps_doc_curly_bracket": 0.001734349993057549,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25793957710266113,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015491870231926441,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25639039278030396,
"rps_doc_frac_unique_words": 0.33039647340774536,
"rps_doc_mean_word_length": 5.729074954986572,
"rps_doc_num_sentences": 97,
"rps_doc_symbol_to_word_ratio": 0.015491870231926441,
"rps_doc_unigram_entropy": 5.084835529327393,
"rps_doc_word_count": 908,
"rps_doc_frac_chars_dupe_10grams": 0.25144174695014954,
"rps_doc_frac_chars_dupe_5grams": 0.34179162979125977,
"rps_doc_frac_chars_dupe_6grams": 0.30642062425613403,
"rps_doc_frac_chars_dupe_7grams": 0.2733564078807831,
"rps_doc_frac_chars_dupe_8grams": 0.2733564078807831,
"rps_doc_frac_chars_dupe_9grams": 0.25144174695014954,
"rps_doc_frac_chars_top_2gram": 0.03287196904420853,
"rps_doc_frac_chars_top_3gram": 0.019031139090657234,
"rps_doc_frac_chars_top_4gram": 0.02825836092233658,
"rps_doc_books_importance": -566.080322265625,
"rps_doc_books_importance_length_correction": -566.080322265625,
"rps_doc_openwebtext_importance": -355.3847351074219,
"rps_doc_openwebtext_importance_length_correction": -355.3847351074219,
"rps_doc_wikipedia_importance": -253.64297485351562,
"rps_doc_wikipedia_importance_length_correction": -253.64297485351562
},
"fasttext": {
"dclm": 0.8061149716377258,
"english": 0.772024393081665,
"fineweb_edu_approx": 2.5065009593963623,
"eai_general_math": 0.5526059865951538,
"eai_open_web_math": 0.07415174692869186,
"eai_web_code": 0.4138241410255432
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285636",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,985,857,643,132,263,000 |
python 中的 random 模块中的 randint 模块和 numpy 中 random 模块的 randint 的区别
今天看了一份力扣的代码，结果发现运行结果不一样，最后才发现是随机数的问题。在这里 Mark 一下、
在 Python 中，通过 import random，然后调用 random.randomint（a,b）的到的数为 (a<=x<=b),
在 numpy 中的 random 模块中，调用 random.randint(a,b) 得到的是 (a<= x < b)。
有点绕，直接看代码比较直观。
>>> from numpy import random
for i in range(20):
print random.randint(0,1)
#输出
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
>>> import random
>>> for i in range(20):
print(random.randint(0,1))
# 输出
1
1
1
0
1
1
1
0
1
1
0
0
0
0
1
0
1
1
1
0
1
好了，懂了，结束了。
|
{
"url": "http://support.i-search.com.cn/article/1562894726344",
"source_domain": "support.i-search.com.cn",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "25102",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BXRBHR3PJWNU6JNACIOESQQQ3TSLDNBS",
"WARC-Concurrent-To": "<urn:uuid:a0318c2d-c54b-41db-8562-b8520a8a4597>",
"WARC-Date": "2019-09-19T15:16:33Z",
"WARC-IP-Address": "140.143.132.91",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z3ABGXAD24GPOT7X37E37SLE6J3Q34JF",
"WARC-Record-ID": "<urn:uuid:bdd2aca5-7338-40ce-bb24-eec3c1abb51d>",
"WARC-Target-URI": "http://support.i-search.com.cn/article/1562894726344",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ddc1aff7-528b-45ac-9846-7c35a867526d>"
},
"warc_info": "isPartOf: CC-MAIN-2019-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-52.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
65,
66,
116,
117,
188,
251,
252,
267,
268,
297,
318,
351,
355,
357,
359,
361,
363,
365,
367,
369,
371,
373,
375,
377,
379,
381,
383,
385,
387,
389,
391,
393,
395,
396,
414,
438,
469,
478,
480,
482,
484,
486,
488,
490,
492,
494,
496,
498,
500,
502,
504,
506,
508,
510,
512,
514,
516,
518,
520,
521
],
"line_end_idx": [
65,
66,
116,
117,
188,
251,
252,
267,
268,
297,
318,
351,
355,
357,
359,
361,
363,
365,
367,
369,
371,
373,
375,
377,
379,
381,
383,
385,
387,
389,
391,
393,
395,
396,
414,
438,
469,
478,
480,
482,
484,
486,
488,
490,
492,
494,
496,
498,
500,
502,
504,
506,
508,
510,
512,
514,
516,
518,
520,
521,
531
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 531,
"ccnet_original_nlines": 60,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10179641097784042,
"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.7245509028434753,
"rps_doc_frac_unique_words": 0.40425533056259155,
"rps_doc_mean_word_length": 3.8936169147491455,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0.011976050212979317,
"rps_doc_unigram_entropy": 2.9075334072113037,
"rps_doc_word_count": 94,
"rps_doc_frac_chars_dupe_10grams": 0.054644808173179626,
"rps_doc_frac_chars_dupe_5grams": 0.23770491778850555,
"rps_doc_frac_chars_dupe_6grams": 0.23770491778850555,
"rps_doc_frac_chars_dupe_7grams": 0.09289617091417313,
"rps_doc_frac_chars_dupe_8grams": 0.054644808173179626,
"rps_doc_frac_chars_dupe_9grams": 0.054644808173179626,
"rps_doc_frac_chars_top_2gram": 0.12021858245134354,
"rps_doc_frac_chars_top_3gram": 0.16393442451953888,
"rps_doc_frac_chars_top_4gram": 0.19672131538391113,
"rps_doc_books_importance": -73.4791488647461,
"rps_doc_books_importance_length_correction": -86.12380981445312,
"rps_doc_openwebtext_importance": -36.60658264160156,
"rps_doc_openwebtext_importance_length_correction": -49.25123977661133,
"rps_doc_wikipedia_importance": -12.509825706481934,
"rps_doc_wikipedia_importance_length_correction": -25.154481887817383
},
"fasttext": {
"dclm": 0.9279274940490723,
"english": 0.01715111918747425,
"fineweb_edu_approx": 1.8839088678359985,
"eai_general_math": 0.9910857677459717,
"eai_open_web_math": 0.09616153687238693,
"eai_web_code": 0.8421486616134644
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "16",
"label": "Personal Blog"
}
},
"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
|
-3,775,227,707,730,885,000 |
Nota
¡Ayúdanos a traducir la documentación oficial de Python al Español! Puedes encontrar más información en Como contribuir. Ayuda a acercar Python a más personas de habla hispana.
Analizando argumentos y construyendo valores
Estas funciones son útiles al crear sus propias funciones y métodos de extensiones. Información y ejemplos adicionales están disponibles en Ampliación e incrustación del intérprete de Python.
Las tres primeras de estas funciones descritas, PyArg_ParseTuple(), PyArg_ParseTupleAndKeywords(), y PyArg_Parse(), todas usan cadenas de caracteres de formato que se utilizan para contarle a la función sobre los argumentos esperados. Las cadenas de caracteres de formato utilizan la misma sintaxis para cada una de estas funciones.
Analizando argumentos
Una cadena de formato consta de cero o más «unidades de formato.» Una unidad de formato describe un objeto Python; por lo general es un solo carácter o una secuencia de unidades formato entre paréntesis. Con unas pocas excepciones, una unidad de formato que no es una secuencia entre paréntesis normalmente corresponde a un único argumento de dirección de estas funciones. En la siguiente descripción, la forma citada es la unidad de formato; la entrada en paréntesis (redondos) es el tipo de objeto Python que coincida con la unidad de formato; y la entrada entre corchetes [cuadrados] es el tipo de la variable(s) C cuya dirección debe ser pasada.
Cadena de caracteres y búferes
Estos formatos permiten acceder a un objeto como un bloque contiguo de memoria. Usted no tiene que proporcionar almacenamiento en bruto para el Unicode o área de bytes retornada.
En general, cuando un formato establece un puntero a un búfer, el búfer es gestionado por el objeto de Python correspondiente, y el búfer comparte la vida útil de este objeto. Usted no tendrá que liberar cualquier memoria usted mismo. Las únicas excepciones son es, es#, et y et#.
Sin embargo, cuando una estructura Py_buffer se llena, la memoria intermedia subyacente está bloqueada de manera que la persona que llama puede posteriormente utilizar la memoria intermedia incluso dentro de un bloque Py_BEGIN_ALLOW_THREADS sin el riesgo de que los datos mutables sean redimensionados o destruidos. Como resultado, usted tiene que llamar PyBuffer_Release() después de haber terminado de procesar los datos (o en caso de aborto temprano).
A menos que se indique lo contrario, los búferes no son terminados en NULL (NUL-terminated).
Algunos formatos requieren bytes-like object de sólo lectura, y establecen un puntero en lugar de una estructura de búfer. Trabajan comprobando que el campo del objeto PyBufferProcs.bf_releasebuffer es NULL, que no permite objetos mutables como bytearray.
Nota
Para todas las variantes de formatos # (s#, y#, etc.), la macro PY_SSIZE_T_CLEAN tiene que estar definida antes de incluir Python.h. En Python 3.9 y versiones anteriores, el tipo del argumento length es Py_ssize_t si la macro PY_SSIZE_T_CLEAN está definida, o int si no lo está.
s (str) [const char *]
Convierte un objeto Unicode a un puntero C a una cadena de caracteres. Un puntero a una cadena de caracteres existente se almacena en la variable puntero del carácter cuya dirección se pasa. La cadena de caracteres en C es terminada en NULL. La cadena de caracteres de Python no debe contener puntos de código incrustado nulos; si lo hace, se lanza una excepción ValueError. Los objetos Unicode se convierten en cadenas de caracteres de C utilizando codificación 'utf-8'. Si esta conversión fallase lanza un UnicodeError.
Nota
Este formato no acepta objetos de tipo bytes. Si desea aceptar los caminos del sistema de archivos y convertirlos en cadenas de caracteres C, es preferible utilizar el formato O& con PyUnicode_FSConverter() como convertidor.
Distinto en la versión 3.5: Anteriormente, TypeError se lanzó cuando se encontraron puntos de código nulos incrustados en la cadena de caracteres de Python.
s* (str o bytes-like object) [Py_buffer]
Este formato acepta objetos Unicode, así como objetos de tipo bytes. Llena una estructura Py_buffer proporcionada por la persona que llama. En este caso la cadena de caracteres de C resultante puede contener bytes NUL embebidos. Los objetos Unicode se convierten en cadenas de caracteres C utilizando codificación 'utf-8'.
s# (str, bytes-like object de sólo lectura) [const char *, Py_ssize_t]
Como s*, excepto que no acepta los objetos mutables. El resultado se almacena en dos variables de C, la primera un puntero a una cadena de caracteres C, el segundo es su longitud. La cadena de caracteres puede contener caracteres nulos incrustados. Los objetos Unicode se convierten en cadenas de caracteres C utilizando codificación 'utf-8'.
z (str o None) [const char *]
Como s, pero el objeto Python también puede ser None, en cuyo caso el puntero C se establece en NULL.
z* (str, bytes-like object o None) [Py_buffer]
Como s*, pero el objeto Python también puede ser None, en cuyo caso el miembro de buf de la estructura Py_buffer se establece en NULL.
z# (str, bytes-like object de sólo lectura o None) [const char *, Py_ssize_t]
Como s#, pero el objeto Python también puede ser None, en cuyo caso el puntero C se establece en NULL.
y (bytes-like object de sólo lectura) [const char *]
Este formato convierte un objeto de tipo bytes a un puntero C a una cadena de caracteres; no acepta objetos Unicode. El búfer de bytes no debe contener bytes nulos incrustados; si lo hace, se lanza una excepción ValueError.
Distinto en la versión 3.5: Anteriormente, TypeError se lanzó cuando bytes nulos incrustados se encontraron en el buffer de bytes.
y* (bytes-like object) [Py_buffer]
Esta variante de s* no acepta objetos Unicode, solamente los objetos de tipo bytes. Esta es la forma recomendada para aceptar datos binarios.
y# (bytes-like object de sólo lectura) [const char *, Py_ssize_t]
Esta variante en s# no acepta objetos Unicode, solo objetos similares a bytes.
S (bytes) [PyBytesObject *]
Requires that the Python object is a bytes object, without attempting any conversion. Raises TypeError if the object is not a bytes object. The C variable may also be declared as PyObject*.
Y (bytearray) [PyByteArrayObject *]
Requires that the Python object is a bytearray object, without attempting any conversion. Raises TypeError if the object is not a bytearray object. The C variable may also be declared as PyObject*.
u (str) [const Py_UNICODE *]
Convierte un objeto Unicode de Python a un puntero a un búfer C NUL terminado de caracteres Unicode. Debe pasar la dirección de una variable de puntero Py_UNICODE, que se llena con el puntero a un búfer Unicode existente. Tenga en cuenta que el ancho de un carácter Py_UNICODE depende de las opciones de compilación (que es 16 o 32 bits). La cadena de Python no debe contener puntos de código incrustado nulos; si lo hace, se lanza una excepción ValueError.
Distinto en la versión 3.5: Anteriormente, TypeError se lanzó cuando se encontraron puntos de código nulos incrustados en la cadena de caracteres de Python.
Deprecated since version 3.3, will be removed in version 3.12: Parte de la API de viejo estilo Py_UNICODE; favor migrar al uso de PyUnicode_AsWideCharString().
u# (str) [const Py_UNICODE *, Py_ssize_t]
Esta variante en u almacena en dos variables de C, el primero un puntero a un búfer de datos Unicode, el segundo de su longitud. Esta variante permite puntos de código nulos.
Deprecated since version 3.3, will be removed in version 3.12: Parte de la API de viejo estilo Py_UNICODE; favor migrar al uso de PyUnicode_AsWideCharString().
Z (str o None) [const Py_UNICODE *]
Como u, pero el objeto Python también puede ser None, en cuyo caso el puntero Py_UNICODE se establece en NULL.
Deprecated since version 3.3, will be removed in version 3.12: Parte de la API de viejo estilo Py_UNICODE; favor migrar al uso de PyUnicode_AsWideCharString().
z# (str o None) [const Py_UNICODE *, Py_ssize_t]
Al igual que u#, pero el objeto Python también puede ser None, en cuyo caso el puntero Py_UNICODE se establece en NULL.
Deprecated since version 3.3, will be removed in version 3.12: Parte de la API de viejo estilo Py_UNICODE; favor migrar al uso de PyUnicode_AsWideCharString().
U (str) [PyObject *]
Requires that the Python object is a Unicode object, without attempting any conversion. Raises TypeError if the object is not a Unicode object. The C variable may also be declared as PyObject*.
w* (bytes-like object de lectura y escritura) [Py_buffer]
Este formato acepta cualquier objeto que implemente la interfaz del búfer de lectura-escritura. Llena la estructura Py_buffer proporcionada por quien llama. El búfer puede contener bytes nulos incrustados. Quien llama tiene que llamar PyBuffer_Release() cuando termina con el búfer.
es (str) [const char *encoding, char **buffer]
Esta variante en s se usa para codificar Unicode en un búfer de caracteres. Solo funciona para datos codificados sin bytes NUL integrados.
This format requires two arguments. The first is only used as input, and must be a const char* which points to the name of an encoding as a NUL-terminated string, or NULL, in which case 'utf-8' encoding is used. An exception is raised if the named encoding is not known to Python. The second argument must be a char**; the value of the pointer it references will be set to a buffer with the contents of the argument text. The text will be encoded in the encoding specified by the first argument.
PyArg_ParseTuple() asignará un búfer del tamaño necesitado, copiará los datos codificados en este búfer y ajustará *buffer para referenciar el nuevo almacenamiento asignado. Quien llama es responsable para llamar PyMem_Free() para liberar el búfer asignado después de su uso.
et (str, bytes o bytearray) [const char *encoding, char **buffer]
Igual que es, excepto que los objetos de cadena de caracteres de bytes se pasan sin recodificarlos. En cambio, la implementación supone que el objeto de cadena de caracteres de bytes utiliza la codificación que se pasa como parámetro.
es# (str) [const char *encoding, char **buffer, Py_ssize_t *buffer_length]
Esta variante en s# se usa para codificar Unicode en un búfer de caracteres. A diferencia del formato es, esta variante permite datos de entrada que contienen caracteres NUL.
It requires three arguments. The first is only used as input, and must be a const char* which points to the name of an encoding as a NUL-terminated string, or NULL, in which case 'utf-8' encoding is used. An exception is raised if the named encoding is not known to Python. The second argument must be a char**; the value of the pointer it references will be set to a buffer with the contents of the argument text. The text will be encoded in the encoding specified by the first argument. The third argument must be a pointer to an integer; the referenced integer will be set to the number of bytes in the output buffer.
Hay dos modos de operación:
Si *buffer señala un puntero NULL, la función asignará un búfer del tamaño necesario, copiará los datos codificados en este búfer y configurará *buffer para hacer referencia al almacenamiento recién asignado. Quien llama es responsable de llamar a PyMem_Free() para liberar el búfer asignado después del uso.
Si *buffer apunta a un puntero no NULL (un búfer ya asignado), PyArg_ParseTuple() usará esta ubicación como el búfer e interpretará el valor inicial de *buffer_length como el tamaño del búfer. Luego copiará los datos codificados en el búfer y los terminará en NUL. Si el búfer no es lo suficientemente grande, se establecerá a ValueError.
En ambos casos, *buffer_length se establece a la longitud de los datos codificados sin el byte NUL final.
et# (str, bytes o bytearray) [const char *encoding, char **buffer, Py_ssize_t *buffer_length]
Igual que es#, excepto que los objetos de cadena de caracteres de bytes se pasan sin recodificarlos. En cambio, la implementación supone que el objeto de cadena de caracteres de bytes utiliza la codificación que se pasa como parámetro.
Números
b (int) [unsigned char]
Convert a nonnegative Python integer to an unsigned tiny int, stored in a C unsigned char.
B (int) [unsigned char]
Convert a Python integer to a tiny int without overflow checking, stored in a C unsigned char.
h (int) [short int]
Convert a Python integer to a C short int.
H (int) [unsigned short int]
Convert a Python integer to a C unsigned short int, without overflow checking.
i (int) [int]
Convert a Python integer to a plain C int.
I (int) [unsigned int]
Convert a Python integer to a C unsigned int, without overflow checking.
l (int) [long int]
Convert a Python integer to a C long int.
k (int) [unsigned long]
Convert a Python integer to a C unsigned long without overflow checking.
L (int) [long long]
Convert a Python integer to a C long long.
K (int) [unsigned long long]
Convert a Python integer to a C unsigned long long without overflow checking.
n (int) [Py_ssize_t]
Convierte un entero de Python a un Py_ssize_t de C.
c (bytes o bytearray de largo 1) [char]
Convert a Python byte, represented as a bytes or bytearray object of length 1, to a C char.
Distinto en la versión 3.3: Permite objetos bytearray.
C (str de largo 1) [int]
Convert a Python character, represented as a str object of length 1, to a C int.
f (float) [float]
Convert a Python floating point number to a C float.
d (float) [double]
Convert a Python floating point number to a C double.
D (complex) [Py_complex]
Convierte un número complejo de Python en una estructura Py_complex de C.
Otros objetos
O (object) [PyObject *]
Almacena un objeto Python (sin ninguna conversión) en un puntero de objeto C. El programa C recibe así el objeto real que se pasó. El recuento de referencia del objeto no aumenta. El puntero almacenado no es NULL.
O! (object) [typeobject, PyObject *]
Store a Python object in a C object pointer. This is similar to O, but takes two C arguments: the first is the address of a Python type object, the second is the address of the C variable (of type PyObject*) into which the object pointer is stored. If the Python object does not have the required type, TypeError is raised.
O& (object) [converter, anything]
Convert a Python object to a C variable through a converter function. This takes two arguments: the first is a function, the second is the address of a C variable (of arbitrary type), converted to void*. The converter function in turn is called as follows:
status = converter(object, address);
where object is the Python object to be converted and address is the void* argument that was passed to the PyArg_Parse* function. The returned status should be 1 for a successful conversion and 0 if the conversion has failed. When the conversion fails, the converter function should raise an exception and leave the content of address unmodified.
Si el converter retorna Py_CLEANUP_SUPPORTED, se puede llamar por segunda vez si el análisis del argumento finalmente falla, dando al convertidor la oportunidad de liberar cualquier memoria que ya haya asignado. En esta segunda llamada, el parámetro object será NULL; address tendrá el mismo valor que en la llamada original.
Distinto en la versión 3.1: Py_CLEANUP_SUPPORTED fue agregada.
p (bool) [int]
Prueba el valor pasado por verdad (un booleano predicado p) y convierte el resultado a su valor entero C verdadero/falso entero equivalente. Establece int en 1 si la expresión era verdadera y 0 si era falsa. Esto acepta cualquier valor válido de Python. Consulte Evaluar como valor verdadero/falso para obtener más información sobre cómo Python prueba los valores por verdad.
Nuevo en la versión 3.3.
(items) (tuple) [matching-items]
El objeto debe ser una secuencia de Python cuya longitud es el número de unidades de formato en items. Los argumentos C deben corresponder a las unidades de formato individuales en items. Las unidades de formato para secuencias pueden estar anidadas.
Es posible pasar enteros «largos» (enteros cuyo valor excede el de la plataforma LONG_MAX), sin embargo, no se realiza una verificación de rango adecuada — los bits más significativos se truncan silenciosamente cuando el campo receptor es demasiado pequeño para recibir el valor (en realidad, la semántica se hereda de las descargas en C — su kilometraje puede variar).
Algunos otros caracteres tienen un significado en una cadena de formato. Esto puede no ocurrir dentro de paréntesis anidados. Son:
|
Indica que los argumentos restantes en la lista de argumentos de Python son opcionales. Las variables C correspondientes a argumentos opcionales deben inicializarse a su valor predeterminado — cuando no se especifica un argumento opcional, PyArg_ParseTuple() no toca el contenido de las variables C correspondientes.
$
PyArg_ParseTupleAndKeywords() solamente: indica que los argumentos restantes en la lista de argumentos de Python son solo palabras clave. Actualmente, todos los argumentos de solo palabras clave también deben ser argumentos opcionales, por lo que | siempre debe especificarse antes de $ en la cadena de formato.
Nuevo en la versión 3.3.
:
La lista de unidades de formato termina aquí; la cadena después de los dos puntos se usa como el nombre de la función en los mensajes de error (el «valor asociado» de la excepción que PyArg_ParseTuple() lanza).
;
La lista de unidades de formato termina aquí; la cadena después del punto y coma se usa como mensaje de error en lugar de del mensaje de error predeterminado. : y ; se excluyen mutuamente.
Tenga en cuenta que las referencias de objetos de Python que se proporcionan a la persona que llama son referencias prestadas (borrowed); ¡no disminuya su conteo de referencias!
Los argumentos adicionales pasados a estas funciones deben ser direcciones de variables cuyo tipo está determinado por la cadena de formato; Estos se utilizan para almacenar valores de la tupla de entrada. Hay algunos casos, como se describe en la lista de unidades de formato anterior, donde estos parámetros se utilizan como valores de entrada; deben coincidir con lo especificado para la unidad de formato correspondiente en ese caso.
For the conversion to succeed, the arg object must match the format and the format must be exhausted. On success, the PyArg_Parse* functions return true, otherwise they return false and raise an appropriate exception. When the PyArg_Parse* functions fail due to conversion failure in one of the format units, the variables at the addresses corresponding to that and the following format units are left untouched.
Funciones API
int PyArg_ParseTuple(PyObject *args, const char *format, ...)
Part of the Stable ABI.
Analiza los parámetros de una función que solo toma parámetros posicionales en variables locales. Retorna verdadero en el éxito; en caso de fallo, retorna falso y lanza la excepción apropiada.
int PyArg_VaParse(PyObject *args, const char *format, va_list vargs)
Part of the Stable ABI.
Idéntico a PyArg_ParseTuple(), excepto que acepta una va_list en lugar de un número variable de argumentos .
int PyArg_ParseTupleAndKeywords(PyObject *args, PyObject *kw, const char *format, char *keywords[], ...)
Part of the Stable ABI.
Analiza los parámetros de una función que toma parámetros posicionales y de palabras clave en variables locales. El argumento keywords es un arreglo terminado en NULL de nombres de parámetros de palabras clave. Los nombres vacíos denotan parámetros solo posicionales. Retorna verdadero cuando hay éxito; en caso de fallo, retorna falso y lanza la excepción apropiada.
Distinto en la versión 3.6: Soporte agregado para sólo parámetros posicionales.
int PyArg_VaParseTupleAndKeywords(PyObject *args, PyObject *kw, const char *format, char *keywords[], va_list vargs)
Part of the Stable ABI.
Idéntico a PyArg_ParseTupleAndKeywords(), excepto que acepta una va_list en lugar de un número variable de argumentos.
int PyArg_ValidateKeywordArguments(PyObject*)
Part of the Stable ABI.
Asegúrese de que las claves en el diccionario de argumentos de palabras clave son cadenas. Esto solo es necesario si PyArg_ParseTupleAndKeywords() no se utiliza, ya que este último ya hace esta comprobación.
Nuevo en la versión 3.2.
int PyArg_Parse(PyObject *args, const char *format, ...)
Part of the Stable ABI.
Función utilizada para deconstruir las listas de argumentos de las funciones de «estilo antiguo» — estas son funciones que usan el método de análisis de parámetros METH_OLDARGS, que se ha eliminado en Python 3. No se recomienda su uso en el análisis de parámetros en código nuevo, y la mayoría del código en el intérprete estándar se ha modificado para que ya no se use para ese propósito. Sin embargo, sigue siendo una forma conveniente de descomponer otras tuplas, y puede continuar usándose para ese propósito.
int PyArg_UnpackTuple(PyObject *args, const char *name, Py_ssize_t min, Py_ssize_t max, ...)
Part of the Stable ABI.
A simpler form of parameter retrieval which does not use a format string to specify the types of the arguments. Functions which use this method to retrieve their parameters should be declared as METH_VARARGS in function or method tables. The tuple containing the actual parameters should be passed as args; it must actually be a tuple. The length of the tuple must be at least min and no more than max; min and max may be equal. Additional arguments must be passed to the function, each of which should be a pointer to a PyObject* variable; these will be filled in with the values from args; they will contain borrowed references. The variables which correspond to optional parameters not given by args will not be filled in; these should be initialized by the caller. This function returns true on success and false if args is not a tuple or contains the wrong number of elements; an exception will be set if there was a failure.
Este es un ejemplo del uso de esta función, tomado de las fuentes del módulo auxiliar _weakref para referencias débiles:
static PyObject *
weakref_ref(PyObject *self, PyObject *args)
{
PyObject *object;
PyObject *callback = NULL;
PyObject *result = NULL;
if (PyArg_UnpackTuple(args, "ref", 1, 2, &object, &callback)) {
result = PyWeakref_NewRef(object, callback);
}
return result;
}
La llamada a PyArg_UnpackTuple() en este ejemplo es completamente equivalente a esta llamada a PyArg_ParseTuple():
PyArg_ParseTuple(args, "O|O:ref", &object, &callback)
Construyendo valores
PyObject *Py_BuildValue(const char *format, ...)
Return value: New reference. Part of the Stable ABI.
Create a new value based on a format string similar to those accepted by the PyArg_Parse* family of functions and a sequence of values. Returns the value or NULL in the case of an error; an exception will be raised if NULL is returned.
Py_BuildValue() no siempre genera una tupla. Construye una tupla solo si su cadena de formato contiene dos o más unidades de formato. Si la cadena de formato está vacía, retorna None; si contiene exactamente una unidad de formato, retorna el objeto que describa esa unidad de formato. Para forzarlo a retornar una tupla de tamaño 0 o uno, paréntesis la cadena de formato.
Cuando los búfer de memoria se pasan como parámetros para suministrar datos para construir objetos, como para los formatos s y s#, los datos requeridos se copian. Las memorias intermedias proporcionadas por quien llama nunca son referenciadas por los objetos creados por Py_BuildValue(). En otras palabras, si su código invoca malloc() y pasa la memoria asignada a Py_BuildValue(), su código es responsable de llamar a free() para esa memoria una vez retorna Py_BuildValue().
En la siguiente descripción, la cadena de caracteres entre comillas, así, es la unidad de formato; la entrada entre paréntesis (redondos) es el tipo de objeto Python que retornará la unidad de formato; y la entrada entre corchetes [cuadrados] es el tipo de los valores C que se pasarán.
Los caracteres espacio, tabulación, dos puntos y coma se ignoran en las cadenas de formato (pero no dentro de las unidades de formato como s#). Esto se puede usar para hacer que las cadenas de formato largo sean un poco más legibles.
s (str o None) [const char *]
Convierte una cadena de caracteres C terminada en nulo en un objeto Python str usando la codificación 'utf-8'. Si el puntero de la cadena de caracteres C es NULL, se usa None.
s# (str o None) [const char *, Py_ssize_t]
Convierte una cadena de caracteres de C y su longitud en un objeto Python str utilizando la codificación 'utf-8'. Si el puntero de la cadena de caracteres de C es NULL, la longitud se ignora y se retorna None.
y (bytes) [const char *]
Esto convierte una cadena de caracteres de C en un objeto Python bytes. Si el puntero de la cadena de caracteres de C es NULL, se retorna None.
y# (bytes) [const char *, Py_ssize_t]
Esto convierte una cadena de caracteres de C y sus longitudes en un objeto Python. Si el puntero de la cadena de caracteres de C es NULL, se retorna None.
z (str o None) [const char *]
Igual que s.
z# (str o None) [const char *, Py_ssize_t]
Igual que s#.
u (str) [const wchar_t *]
Convert a null-terminated wchar_t buffer of Unicode (UTF-16 or UCS-4) data to a Python Unicode object. If the Unicode buffer pointer is NULL, None is returned.
u# (str) [const wchar_t *, Py_ssize_t]
Convierte un búfer de datos Unicode (UTF-16 o UCS-4) y su longitud en un objeto Python Unicode. Si el puntero del búfer Unicode es NULL, la longitud se ignora y se retorna None.
U (str o None) [const char *]
Igual que s.
z# (str o None) [const char *, Py_ssize_t]
Igual que s#.
i (int) [int]
Convert a plain C int to a Python integer object.
b (int) [char]
Convert a plain C char to a Python integer object.
h (int) [short int]
Convert a plain C short int to a Python integer object.
l (int) [long int]
Convert a C long int to a Python integer object.
B (int) [unsigned char]
Convert a C unsigned char to a Python integer object.
H (int) [unsigned short int]
Convert a C unsigned short int to a Python integer object.
I (int) [unsigned int]
Convert a C unsigned int to a Python integer object.
k (int) [unsigned long]
Convert a C unsigned long to a Python integer object.
L (int) [long long]
Convert a C long long to a Python integer object.
K (int) [unsigned long long]
Convert a C unsigned long long to a Python integer object.
n (int) [Py_ssize_t]
Convierte un Py_ssize_t de C a un entero de Python.
c (bytes de largo 1) [char]
Convert a C int representing a byte to a Python bytes object of length 1.
C (str de largo 1) [int]
Convert a C int representing a character to Python str object of length 1.
d (float) [double]
Convert a C double to a Python floating point number.
f (float) [float]
Convert a C float to a Python floating point number.
D (complex) [Py_complex *]
Convierte una estructura Py_complex de C en un número complejo de Python.
O (object) [PyObject *]
Pasa un objeto Python sin tocarlo (excepto por su recuento de referencia, que se incrementa en uno). Si el objeto pasado es un puntero NULL, se supone que esto fue causado porque la llamada que produjo el argumento encontró un error y estableció una excepción. Por lo tanto, Py_BuildValue() retornará NULL pero no lanzará una excepción. Si aún no se ha producido ninguna excepción, se establece SystemError.
S (object) [PyObject *]
Igual que O.
N (object) [PyObject *]
Igual que O, excepto que no incrementa el recuento de referencia en el objeto. Útil cuando el objeto se crea mediante una llamada a un constructor de objetos en la lista de argumentos.
O& (object) [converter, anything]
Convert anything to a Python object through a converter function. The function is called with anything (which should be compatible with void*) as its argument and should return a «new» Python object, or NULL if an error occurred.
(items) (tuple) [matching-items]
Convierta una secuencia de valores C en una tupla de Python con el mismo número de elementos.
[items] (list) [matching-items]
Convierte una secuencia de valores C en una lista de Python con el mismo número de elementos.
{items} (dict) [matching-items]
Convierte una secuencia de valores C en un diccionario Python. Cada par de valores C consecutivos agrega un elemento al diccionario, que sirve como clave y valor, respectivamente.
Si hay un error en la cadena de formato, se establece la excepción SystemError y se retorna NULL.
PyObject *Py_VaBuildValue(const char *format, va_list vargs)
Return value: New reference. Part of the Stable ABI.
Idéntico a Py_BuildValue(), excepto que acepta una va_list en lugar de un número variable de argumentos.
|
{
"url": "https://python-docs-es.readthedocs.io/es/3.11/c-api/arg.html",
"source_domain": "python-docs-es.readthedocs.io",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "112214",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WWBSVCYZWDJ3LXYDCW2EZFA5J7NR6HX3",
"WARC-Concurrent-To": "<urn:uuid:81440ba5-d438-4ac5-a565-072cd604fd09>",
"WARC-Date": "2022-11-27T09:53:19Z",
"WARC-IP-Address": "104.17.33.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZXZOBEKJOITKG5X2KLWR463T2WYPE3JH",
"WARC-Record-ID": "<urn:uuid:db77f135-f2ce-4954-8c5c-1d5399bf0283>",
"WARC-Target-URI": "https://python-docs-es.readthedocs.io/es/3.11/c-api/arg.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:47ca6866-bd62-489c-a3a9-b3eef875fc1e>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-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,
5,
6,
183,
184,
229,
230,
422,
423,
756,
757,
779,
780,
1430,
1431,
1462,
1463,
1642,
1643,
1924,
1925,
2380,
2381,
2474,
2475,
2731,
2732,
2737,
2738,
3017,
3018,
3041,
3042,
3564,
3565,
3570,
3571,
3796,
3797,
3954,
3955,
3996,
3997,
4320,
4321,
4392,
4393,
4736,
4737,
4767,
4768,
4870,
4871,
4918,
4919,
5054,
5055,
5133,
5134,
5237,
5238,
5291,
5292,
5516,
5517,
5648,
5649,
5684,
5685,
5827,
5828,
5894,
5895,
5974,
5975,
6003,
6004,
6194,
6195,
6231,
6232,
6430,
6431,
6460,
6461,
6919,
6920,
7077,
7078,
7238,
7239,
7281,
7282,
7457,
7458,
7618,
7619,
7655,
7656,
7767,
7768,
7928,
7929,
7978,
7979,
8099,
8100,
8260,
8261,
8282,
8283,
8477,
8478,
8536,
8537,
8820,
8821,
8868,
8869,
9008,
9009,
9505,
9506,
9782,
9783,
9849,
9850,
10085,
10086,
10161,
10162,
10337,
10338,
10959,
10960,
10988,
10989,
11298,
11299,
11638,
11639,
11745,
11746,
11840,
11841,
12077,
12078,
12086,
12087,
12111,
12112,
12203,
12204,
12228,
12229,
12324,
12325,
12345,
12346,
12389,
12390,
12419,
12420,
12499,
12500,
12514,
12515,
12558,
12559,
12582,
12583,
12656,
12657,
12676,
12677,
12719,
12720,
12744,
12745,
12818,
12819,
12839,
12840,
12883,
12884,
12913,
12914,
12992,
12993,
13014,
13015,
13067,
13068,
13108,
13109,
13201,
13202,
13257,
13258,
13283,
13284,
13365,
13366,
13384,
13385,
13438,
13439,
13458,
13459,
13513,
13514,
13539,
13540,
13614,
13615,
13629,
13630,
13654,
13655,
13869,
13870,
13907,
13908,
14232,
14233,
14267,
14268,
14525,
14526,
14563,
14564,
14911,
14912,
15238,
15239,
15302,
15303,
15318,
15319,
15695,
15696,
15721,
15722,
15755,
15756,
16007,
16008,
16378,
16379,
16510,
16511,
16513,
16514,
16831,
16832,
16834,
16835,
17147,
17148,
17173,
17174,
17176,
17177,
17388,
17389,
17391,
17392,
17581,
17582,
17760,
17761,
18199,
18200,
18613,
18614,
18628,
18629,
18691,
18715,
18716,
18909,
18910,
18979,
19003,
19004,
19113,
19114,
19219,
19243,
19244,
19612,
19613,
19693,
19694,
19811,
19835,
19836,
19955,
19956,
20002,
20026,
20027,
20235,
20236,
20261,
20262,
20319,
20343,
20344,
20858,
20859,
20952,
20976,
20977,
21908,
21909,
22030,
22031,
22049,
22093,
22095,
22117,
22148,
22177,
22178,
22246,
22299,
22305,
22324,
22326,
22327,
22442,
22443,
22497,
22498,
22519,
22520,
22569,
22622,
22623,
22859,
22860,
23232,
23233,
23709,
23710,
23997,
23998,
24232,
24233,
24263,
24264,
24440,
24441,
24484,
24485,
24695,
24696,
24721,
24722,
24866,
24867,
24905,
24906,
25061,
25062,
25092,
25093,
25106,
25107,
25150,
25151,
25165,
25166,
25192,
25193,
25353,
25354,
25393,
25394,
25572,
25573,
25603,
25604,
25617,
25618,
25661,
25662,
25676,
25677,
25691,
25692,
25742,
25743,
25758,
25759,
25810,
25811,
25831,
25832,
25888,
25889,
25908,
25909,
25958,
25959,
25983,
25984,
26038,
26039,
26068,
26069,
26128,
26129,
26152,
26153,
26206,
26207,
26231,
26232,
26286,
26287,
26307,
26308,
26358,
26359,
26388,
26389,
26448,
26449,
26470,
26471,
26523,
26524,
26552,
26553,
26627,
26628,
26653,
26654,
26729,
26730,
26749,
26750,
26804,
26805,
26823,
26824,
26877,
26878,
26905,
26906,
26980,
26981,
27005,
27006,
27414,
27415,
27439,
27440,
27453,
27454,
27478,
27479,
27664,
27665,
27699,
27700,
27930,
27931,
27964,
27965,
28059,
28060,
28092,
28093,
28187,
28188,
28220,
28221,
28401,
28402,
28500,
28501,
28562,
28615,
28616
],
"line_end_idx": [
5,
6,
183,
184,
229,
230,
422,
423,
756,
757,
779,
780,
1430,
1431,
1462,
1463,
1642,
1643,
1924,
1925,
2380,
2381,
2474,
2475,
2731,
2732,
2737,
2738,
3017,
3018,
3041,
3042,
3564,
3565,
3570,
3571,
3796,
3797,
3954,
3955,
3996,
3997,
4320,
4321,
4392,
4393,
4736,
4737,
4767,
4768,
4870,
4871,
4918,
4919,
5054,
5055,
5133,
5134,
5237,
5238,
5291,
5292,
5516,
5517,
5648,
5649,
5684,
5685,
5827,
5828,
5894,
5895,
5974,
5975,
6003,
6004,
6194,
6195,
6231,
6232,
6430,
6431,
6460,
6461,
6919,
6920,
7077,
7078,
7238,
7239,
7281,
7282,
7457,
7458,
7618,
7619,
7655,
7656,
7767,
7768,
7928,
7929,
7978,
7979,
8099,
8100,
8260,
8261,
8282,
8283,
8477,
8478,
8536,
8537,
8820,
8821,
8868,
8869,
9008,
9009,
9505,
9506,
9782,
9783,
9849,
9850,
10085,
10086,
10161,
10162,
10337,
10338,
10959,
10960,
10988,
10989,
11298,
11299,
11638,
11639,
11745,
11746,
11840,
11841,
12077,
12078,
12086,
12087,
12111,
12112,
12203,
12204,
12228,
12229,
12324,
12325,
12345,
12346,
12389,
12390,
12419,
12420,
12499,
12500,
12514,
12515,
12558,
12559,
12582,
12583,
12656,
12657,
12676,
12677,
12719,
12720,
12744,
12745,
12818,
12819,
12839,
12840,
12883,
12884,
12913,
12914,
12992,
12993,
13014,
13015,
13067,
13068,
13108,
13109,
13201,
13202,
13257,
13258,
13283,
13284,
13365,
13366,
13384,
13385,
13438,
13439,
13458,
13459,
13513,
13514,
13539,
13540,
13614,
13615,
13629,
13630,
13654,
13655,
13869,
13870,
13907,
13908,
14232,
14233,
14267,
14268,
14525,
14526,
14563,
14564,
14911,
14912,
15238,
15239,
15302,
15303,
15318,
15319,
15695,
15696,
15721,
15722,
15755,
15756,
16007,
16008,
16378,
16379,
16510,
16511,
16513,
16514,
16831,
16832,
16834,
16835,
17147,
17148,
17173,
17174,
17176,
17177,
17388,
17389,
17391,
17392,
17581,
17582,
17760,
17761,
18199,
18200,
18613,
18614,
18628,
18629,
18691,
18715,
18716,
18909,
18910,
18979,
19003,
19004,
19113,
19114,
19219,
19243,
19244,
19612,
19613,
19693,
19694,
19811,
19835,
19836,
19955,
19956,
20002,
20026,
20027,
20235,
20236,
20261,
20262,
20319,
20343,
20344,
20858,
20859,
20952,
20976,
20977,
21908,
21909,
22030,
22031,
22049,
22093,
22095,
22117,
22148,
22177,
22178,
22246,
22299,
22305,
22324,
22326,
22327,
22442,
22443,
22497,
22498,
22519,
22520,
22569,
22622,
22623,
22859,
22860,
23232,
23233,
23709,
23710,
23997,
23998,
24232,
24233,
24263,
24264,
24440,
24441,
24484,
24485,
24695,
24696,
24721,
24722,
24866,
24867,
24905,
24906,
25061,
25062,
25092,
25093,
25106,
25107,
25150,
25151,
25165,
25166,
25192,
25193,
25353,
25354,
25393,
25394,
25572,
25573,
25603,
25604,
25617,
25618,
25661,
25662,
25676,
25677,
25691,
25692,
25742,
25743,
25758,
25759,
25810,
25811,
25831,
25832,
25888,
25889,
25908,
25909,
25958,
25959,
25983,
25984,
26038,
26039,
26068,
26069,
26128,
26129,
26152,
26153,
26206,
26207,
26231,
26232,
26286,
26287,
26307,
26308,
26358,
26359,
26388,
26389,
26448,
26449,
26470,
26471,
26523,
26524,
26552,
26553,
26627,
26628,
26653,
26654,
26729,
26730,
26749,
26750,
26804,
26805,
26823,
26824,
26877,
26878,
26905,
26906,
26980,
26981,
27005,
27006,
27414,
27415,
27439,
27440,
27453,
27454,
27478,
27479,
27664,
27665,
27699,
27700,
27930,
27931,
27964,
27965,
28059,
28060,
28092,
28093,
28187,
28188,
28220,
28221,
28401,
28402,
28500,
28501,
28562,
28615,
28616,
28720
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 28720,
"ccnet_original_nlines": 486,
"rps_doc_curly_bracket": 0.000208910001674667,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15857267379760742,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029765009880065918,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19617058336734772,
"rps_doc_frac_unique_words": 0.18726997077465057,
"rps_doc_mean_word_length": 4.910586833953857,
"rps_doc_num_sentences": 278,
"rps_doc_symbol_to_word_ratio": 0.005396000109612942,
"rps_doc_unigram_entropy": 5.6673760414123535,
"rps_doc_word_count": 4619,
"rps_doc_frac_chars_dupe_10grams": 0.20236310362815857,
"rps_doc_frac_chars_dupe_5grams": 0.3850630521774292,
"rps_doc_frac_chars_dupe_6grams": 0.3353760838508606,
"rps_doc_frac_chars_dupe_7grams": 0.30522000789642334,
"rps_doc_frac_chars_dupe_8grams": 0.2733004093170166,
"rps_doc_frac_chars_dupe_9grams": 0.2375892847776413,
"rps_doc_frac_chars_top_2gram": 0.017458779737353325,
"rps_doc_frac_chars_top_3gram": 0.019045939669013023,
"rps_doc_frac_chars_top_4gram": 0.01234459038823843,
"rps_doc_books_importance": -2784.961181640625,
"rps_doc_books_importance_length_correction": -2784.961181640625,
"rps_doc_openwebtext_importance": -1127.7276611328125,
"rps_doc_openwebtext_importance_length_correction": -1127.7276611328125,
"rps_doc_wikipedia_importance": -1021.9201049804688,
"rps_doc_wikipedia_importance_length_correction": -1021.9201049804688
},
"fasttext": {
"dclm": 0.9746273159980774,
"english": 0.02332286909222603,
"fineweb_edu_approx": 2.0326554775238037,
"eai_general_math": 0.010769669897854328,
"eai_open_web_math": 0.25224339962005615,
"eai_web_code": 0.9942264556884766
}
}
|
{
"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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,924,343,683,320,924,000 |
Posted in: Uncategorized
How To Secure Your Company With A Pix Firewall
Tip: Give preference to narrowly defined niche markets where your service solves a unique need of your customers. Focus your marketing on them instead of trying to reach a broadly defined general market. You’ll generate more sales and revel in a better return on a advertising financial strain.
Check the actual salon that does Brazilian waxing beforehand to makes it hygienic and the aesthetician is licensed. The license is normally provided.
The saying, “You for you to spend money to earn money,” generally holds true for Any company! An Internet-based business ‘s no exception,whether your are promoting your own products or someone else’s.
Invite pals along! Create Activity Groups, go on group dates, try Express Dating, enjoy travel events, and just enjoy since together. After all, im alone isn’t enough construct solid relationships.
Fairness and ethical behavior goes for both. Due towards the fact that online e-books and downloadable software easy to to copy and “keep” while also obtaining a refund, the customer kind of has a distinctive “burden of honor” as well ,. I have enquired refunds whenever a product was totally misrepresented and poorly done. A single instance the video cartoon boils and audio courses were sold like a “convenient and viewable anytime and anyplace”. รีวิวการ์ตูนเดือด Turns out it any convenience for your marketer a person had at the same time them from his site, and you guessed it, the site was very, very S-L-O-W. The Cartoon Bodies If I purchase something costly and you sell me like that, I want to download and OWN the game.
You ain’t ever gonna get rich selling $20 items. Seriously, include some higher priced goods and services in your marketing. You may get less sales, but more profits. You might not know that they sell unless you try! Attempt not to fall in the trap of promoting any old thing anyone get a very high commission. Integrity is important, too.
When you should stop and think about it, so what can you think your new friend’s reaction is to be able to be if when you meet for the first time it’s obvious you’re not the person they thought they would be hanging out with? “Oh . hey handsome. I see you been dishonest with me from the get-go here, but hey, I’m still thinking offering a great shot at having an open, trusting relationship for that long-term” Obviously not.
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://emoceanlabs.com/2020/09/29/how-to-secure-your-company-with-a-pix-firewall/",
"source_domain": "emoceanlabs.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "19118",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U3A7UDIFFOIAKJVIUPRPUBAHSPJMB7RO",
"WARC-Concurrent-To": "<urn:uuid:b8bb4436-06c7-474c-8441-4da7c5e1a9dd>",
"WARC-Date": "2020-11-26T23:10:55Z",
"WARC-IP-Address": "87.98.237.219",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UQDJBNDG6JQ3ME47BHBMOOSLWGGRQK64",
"WARC-Record-ID": "<urn:uuid:7d423f74-af87-431d-809b-cbce47f9689f>",
"WARC-Target-URI": "https://emoceanlabs.com/2020/09/29/how-to-secure-your-company-with-a-pix-firewall/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:17ad600d-0068-438f-94b8-3fd5275eaa6c>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-31.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
25,
26,
73,
74,
369,
370,
520,
521,
722,
723,
921,
922,
1654,
1655,
1995,
1996,
2423,
2424,
2438,
2439
],
"line_end_idx": [
25,
26,
73,
74,
369,
370,
520,
521,
722,
723,
921,
922,
1654,
1655,
1995,
1996,
2423,
2424,
2438,
2439,
2509
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2509,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4293892979621887,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022900760173797607,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16603052616119385,
"rps_doc_frac_unique_words": 0.6619385480880737,
"rps_doc_mean_word_length": 4.7635931968688965,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.294135570526123,
"rps_doc_word_count": 423,
"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.012903230264782906,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -215.3510284423828,
"rps_doc_books_importance_length_correction": -215.3510284423828,
"rps_doc_openwebtext_importance": -136.57669067382812,
"rps_doc_openwebtext_importance_length_correction": -136.57669067382812,
"rps_doc_wikipedia_importance": -73.95913696289062,
"rps_doc_wikipedia_importance_length_correction": -73.95913696289062
},
"fasttext": {
"dclm": 0.0821259617805481,
"english": 0.9480684399604797,
"fineweb_edu_approx": 0.8573651313781738,
"eai_general_math": 0.0007518500206060708,
"eai_open_web_math": 0.1472601294517517,
"eai_web_code": 0.00006091999966884032
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "3",
"label": "Incoherent Flow"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,994,076,998,671,806,000 |
PHP Classes
elePHPant
Icontem
Flow Chart: Generate help desk questions work flow
Recommend this page to a friend!
Stumble It! Stumble It! Bookmark in del.icio.us Bookmark in del.icio.us
Info View files View files (7) DownloadInstall with Composer Download .zip Reputation Support forum (2) Blog
Last Updated Ratings Unique User Downloads Download Rankings
2006-03-30 (9 years ago) RSS 2.0 feedStarStarStarStar 69%Total: 3,253 This week: 1All time: 1,018 This week: 1,058Down
Version License Categories
flowchart 1.0.0Freely DistributableDatabases, Content management
Description Author
This class can be used to generate questions for an help desk support service work flow.
The class uses a MySQL database pre-loaded with questions to ask users requesting support in an help desk service. The database also contains the possible answers that are expected.
Depending on the answers provided by the users, the class determines the next step, which can be asking the user another question.
The class uses Smarty templates to generate the pages of each step. The template file name is also stored in the questions database.
This class can be used in other kinds of applications besides help desk services . It could also be used for e-learning applications, surveys, tests, etc..
Innovation Award
PHP Programming Innovation award nominee
April 2006
Number 6
Help desk is an important activity for businesses that need to provide support to the clients that buy their products or services.
Usually the help desk support people need to follow a predefined series of steps that depend on what kind of request the clients are asking for.
This class provides a solution for defining the steps that help desk support attendant needs to follow.
It consists on a serious of screens that can be presented to the attendant using a Web browser connected to a support site.
The screens present the questions that the attendant needs to ask to the client asking for support, and what to do next depending on the client answers.
Manuel Lemos
Picture of Shannon Wynter
Name: Shannon Wynter is available for providing paid consulting. Contact Shannon Wynter .
Classes: 9 packages by
Country: Australia Australia
Age: 34
All time rank: 1262 in Australia Australia
Week rank: 325 Down3 in Australia Australia Down
Innovation award
Innovation award
Nominee: 3x
Details
Flowchart Engine v0.1
-----------------------------------------------------
Written by Shannon Wynter (AKA: Freman)
Contact: http://fremnet.net/contact
-----------------------------------------------------
I'm sorry I'm not overly good at documentation folks
but I'll outline the class and it's function for you.
Description:
-------------------
A basic and simple engine for following a flowchart.
It handles Processes, and Descision making.
Features:
-------------------
Can follow multi-step questions
Can work with 1 to n responses
Supports 'goto' questions
Can end in multipul ways
Requirements:
-------------------
Built for PHP4 and MySQL, requires Smarty
Limitations:
-------------------
I started implementing support for back button and
refresh but it never got finished so, there's no
back/refresh support.
Other notes:
-------------------
Was written for an in-house helpdesk appliation
then adapted for open source distribution - if I
get the time I'll re-write it from scratch.
History:
-------------------
Where I work we had a flow chart that we followed
for helpdesk calls to get the users back online.
I was tasked with digitizing this flowchart so they
could outsource the helpdesk to a bunch of trained
monkeys.
Files:
-------------------
readme.txt - This file
FlowChart.class.php - Flowchart engine
example.php - Limited example of usage
sample.sql - The data for example.php
Data structire:
-------------------
The data structure is relativly simple...
FlowChartQuestions:
Level, Type, Step, Question, Template, Endpoint.
The Level field just grows like a tree, based on
the Options in the FlowChartOptions table (see below)
The Type field represents the type of question it
is. There are 3 supported types 'Goto', 'Next',
and 'Step'. These types can be changed and adjusted
by extending the FlowChart class
By default Goto's are 5 or 6, Next's are 0 or 3
and Step's are 2.
Type's flexable mostly for your reference.
EG: In the sample data I've provided Next0 is
used to step through the normal data, Next3 is
used as the last entry in a 'Step' sequence
EG: In the sample data I've provided Goto5 is
used in normal flow of data to jump to another
point in the flow. Goto6 is used as the last
entry in a sequence of 'Step's
There is no reason to use 3 or 6 accept for your own
reference.
The Step field is used to index the steps required
to complete a task. Type must be 'Step' to start with
and so long as type stays a 'Step' the steps will
progress through the index. Each step must be +1
the step before it.
The Question field is mostly for your reference,
but in the examplezs provided I use display it in
the template.
The Template field tells the script which template
to load and display for the question.
The EndPoint field is used to signify that this
is the end of the flowchart. When endpoint is flagged
'Type' is returned to the script for refrence.
I use type 1 to tell the calling script that the
issue was resolved and type 4 to tell it that the
issue needs to be looked into further.
FlowChartOptions:
Level, OptionNumber, OptionCaption, FlagLog
The Level field is used to associate the options
with a question from FlowChartQuestions.
The OptionNumber field should be unique for each
level and the number used here will be appended to
the current level to form the next level - I know
I could have used 'parent' and 'children' but this
is easier to follow and quicker to implement.
The OptionCaption field the the label of the button
that will be displayed.
The FlagLog field is completely unused by the
FlowChartOptions but it is used in our system for
other reasons - so I figured you might use it.
Files folder image Files
File Role Description
Accessible without login Plain text file cansurfgoogle.tpl Data Referenced template from sample.sql
Accessible without login Plain text file example.php Example A basic example
Plain text file FlowChart.class.php Class The FlowChart class
Accessible without login Plain text file footer.tpl Data Referenced template from cansurfgoogle.tpl
Accessible without login Plain text file header.tpl Data Referenced template from cansurfgoogle.tpl
Accessible without login Plain text file readme.txt Doc. Basic Documentation
Accessible without login Plain text file sample.sql Data A sample dataset
Version Control Unique User Downloads Download Rankings
0%Total:3,253All time:1,018
This week:1This week:1,058Down
User Ratings User Comments (1)
All time
Utility:91%StarStarStarStarStar
Consistency:75%StarStarStarStar
Documentation:83%StarStarStarStarStar
Examples:75%StarStarStarStar
Tests:-
Videos:-
Overall:69%StarStarStarStar
Rank:283
it's quite good idea
6 years ago (pio11)
67%StarStarStarStar
|
{
"url": "http://www.phpclasses.org/package/3009-PHP-Generate-help-desk-questions-work-flow.html",
"source_domain": "www.phpclasses.org",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "59366",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L3WBNW4PTJ2NLRSLD3KZT5P337A5TJZ4",
"WARC-Concurrent-To": "<urn:uuid:b430eead-5b16-4f16-8faa-43004d85add4>",
"WARC-Date": "2015-10-13T18:29:03Z",
"WARC-IP-Address": "216.240.132.150",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WYXRVU4OG3ED53PSOHQR5PI57B2475KT",
"WARC-Record-ID": "<urn:uuid:e83dffb0-3ffa-42d7-8d95-e2459a10917d>",
"WARC-Target-URI": "http://www.phpclasses.org/package/3009-PHP-Generate-help-desk-questions-work-flow.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:11c162ac-c38e-4f2a-985d-20e999179e6b>"
},
"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,
12,
22,
30,
31,
82,
83,
116,
188,
313,
376,
495,
524,
589,
610,
611,
700,
701,
883,
884,
1015,
1016,
1149,
1150,
1306,
1307,
1326,
1367,
1378,
1387,
1518,
1519,
1664,
1665,
1769,
1770,
1894,
1895,
2048,
2049,
2062,
2088,
2178,
2201,
2230,
2238,
2281,
2330,
2347,
2364,
2376,
2377,
2387,
2441,
2495,
2535,
2571,
2625,
2678,
2732,
2733,
2746,
2766,
2819,
2863,
2864,
2874,
2894,
2926,
2957,
2983,
3008,
3009,
3023,
3043,
3085,
3086,
3099,
3119,
3171,
3221,
3243,
3244,
3257,
3277,
3325,
3374,
3418,
3419,
3428,
3448,
3498,
3547,
3548,
3600,
3651,
3660,
3661,
3668,
3688,
3712,
3751,
3791,
3830,
3831,
3847,
3867,
3909,
3910,
3930,
3979,
3980,
4029,
4083,
4084,
4134,
4182,
4234,
4267,
4268,
4316,
4334,
4335,
4378,
4424,
4471,
4515,
4516,
4562,
4609,
4654,
4685,
4686,
4739,
4750,
4751,
4802,
4856,
4906,
4955,
4975,
4976,
5025,
5075,
5089,
5090,
5141,
5179,
5180,
5228,
5282,
5329,
5330,
5379,
5429,
5468,
5469,
5487,
5531,
5532,
5581,
5622,
5623,
5672,
5723,
5773,
5824,
5870,
5871,
5923,
5947,
5948,
5994,
6044,
6091,
6092,
6121,
6143,
6243,
6320,
6382,
6482,
6582,
6659,
6733,
6734,
6793,
6822,
6854,
6887,
6897,
6929,
6961,
6999,
7028,
7036,
7045,
7073,
7082,
7084,
7105,
7125,
7145
],
"line_end_idx": [
12,
22,
30,
31,
82,
83,
116,
188,
313,
376,
495,
524,
589,
610,
611,
700,
701,
883,
884,
1015,
1016,
1149,
1150,
1306,
1307,
1326,
1367,
1378,
1387,
1518,
1519,
1664,
1665,
1769,
1770,
1894,
1895,
2048,
2049,
2062,
2088,
2178,
2201,
2230,
2238,
2281,
2330,
2347,
2364,
2376,
2377,
2387,
2441,
2495,
2535,
2571,
2625,
2678,
2732,
2733,
2746,
2766,
2819,
2863,
2864,
2874,
2894,
2926,
2957,
2983,
3008,
3009,
3023,
3043,
3085,
3086,
3099,
3119,
3171,
3221,
3243,
3244,
3257,
3277,
3325,
3374,
3418,
3419,
3428,
3448,
3498,
3547,
3548,
3600,
3651,
3660,
3661,
3668,
3688,
3712,
3751,
3791,
3830,
3831,
3847,
3867,
3909,
3910,
3930,
3979,
3980,
4029,
4083,
4084,
4134,
4182,
4234,
4267,
4268,
4316,
4334,
4335,
4378,
4424,
4471,
4515,
4516,
4562,
4609,
4654,
4685,
4686,
4739,
4750,
4751,
4802,
4856,
4906,
4955,
4975,
4976,
5025,
5075,
5089,
5090,
5141,
5179,
5180,
5228,
5282,
5329,
5330,
5379,
5429,
5468,
5469,
5487,
5531,
5532,
5581,
5622,
5623,
5672,
5723,
5773,
5824,
5870,
5871,
5923,
5947,
5948,
5994,
6044,
6091,
6092,
6121,
6143,
6243,
6320,
6382,
6482,
6582,
6659,
6733,
6734,
6793,
6822,
6854,
6887,
6897,
6929,
6961,
6999,
7028,
7036,
7045,
7073,
7082,
7084,
7105,
7125,
7145,
7146
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7146,
"ccnet_original_nlines": 202,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.311306893825531,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018355360254645348,
"rps_doc_frac_lines_end_with_ellipsis": 0.004926110152155161,
"rps_doc_frac_no_alph_words": 0.1997063159942627,
"rps_doc_frac_unique_words": 0.39436620473861694,
"rps_doc_mean_word_length": 5.127699375152588,
"rps_doc_num_sentences": 74,
"rps_doc_symbol_to_word_ratio": 0.0007342100143432617,
"rps_doc_unigram_entropy": 5.426980972290039,
"rps_doc_word_count": 1065,
"rps_doc_frac_chars_dupe_10grams": 0.02819995954632759,
"rps_doc_frac_chars_dupe_5grams": 0.09192456305027008,
"rps_doc_frac_chars_dupe_6grams": 0.07251419126987457,
"rps_doc_frac_chars_dupe_7grams": 0.04687786102294922,
"rps_doc_frac_chars_dupe_8grams": 0.03662332892417908,
"rps_doc_frac_chars_dupe_9grams": 0.02819995954632759,
"rps_doc_frac_chars_top_2gram": 0.008789599873125553,
"rps_doc_frac_chars_top_3gram": 0.016663609072566032,
"rps_doc_frac_chars_top_4gram": 0.02966490015387535,
"rps_doc_books_importance": -612.1039428710938,
"rps_doc_books_importance_length_correction": -612.1039428710938,
"rps_doc_openwebtext_importance": -360.9646911621094,
"rps_doc_openwebtext_importance_length_correction": -360.9646911621094,
"rps_doc_wikipedia_importance": -262.7232971191406,
"rps_doc_wikipedia_importance_length_correction": -262.7232971191406
},
"fasttext": {
"dclm": 0.029298419132828712,
"english": 0.8313168883323669,
"fineweb_edu_approx": 2.411449670791626,
"eai_general_math": 0.18256103992462158,
"eai_open_web_math": 0.16099125146865845,
"eai_web_code": 0.07270556688308716
}
}
|
{
"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.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,986,754,665,503,059,000 |
1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.
2. Greetings Guest!!
In order to combat SPAM on the forums, all users are required to have a minimum of 2 posts before they can submit links in any post or thread.
Dismiss Notice
3. Greetings Guest, Having Login Issues? Check this thread!
Dismiss Notice
4. Hail Guest!,
Please take a moment to read this post reminding you all of the importance of Account Security.
Dismiss Notice
5. Author Wes Locher has teamed up with Stratics for a giveaway of his new book Braving Britannia. This book explores the history and impact of Ultima Online and includes interviews from current and past dev team members as well as many UO and Stratics community members. Click here for more details!
Dismiss Notice
[Price Check] Rares Questions. Please Help!
Discussion in 'UO Rares Collector' started by Cruxshadow, Nov 2, 2009.
1. Cruxshadow
Cruxshadow Guest
I have been searching the boards and uo guide for answers, but havent been able to find out. I know that broken chairs can now be gotten from heritage tokens, but these can only be moved by redeeding correct? If so, does this mean that the broken chair that I have in my backpack is a non heritage token chair? If so, how rare is it? Where these server birth? And lastly, if so, is it still worth anything? Thanks in advance guys,
2. blueturtle
blueturtle Lore Keeper
Stratics Veteran
Joined:
Dec 8, 2007
Messages:
824
Likes Received:
0
if its the one thats tipped on its back those are like 20-50k
3. Cruxshadow
Cruxshadow Guest
damn, lol. that sucks. why so little?
4. blueturtle
blueturtle Lore Keeper
Stratics Veteran
Joined:
Dec 8, 2007
Messages:
824
Likes Received:
0
if i remember it was a daily spawn for a while in ilshlander
5. Sarsmi
Sarsmi Grand Poobah
Stratics Veteran
Joined:
Apr 25, 2001
Messages:
5,788
Likes Received:
9
It still is. Last time i went to the kirins during the middle of the day it was still there for the taking. They really don't sell off vendors very often.
6. Cruxshadow
Cruxshadow Guest
ah, lame. Thanks alot for you help guys. Really know how to crush some dreams... lol jk. thanks for the quick replies
|
{
"url": "https://stratics.com/threads/rares-questions-please-help.166167/",
"source_domain": "stratics.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "73896",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KVKTNS5WEMRR6RVIMH4RLJQKG6ZOMEOH",
"WARC-Concurrent-To": "<urn:uuid:6fdff6a3-d9b2-4e9e-bb1b-7644fee486b2>",
"WARC-Date": "2018-07-19T08:47:18Z",
"WARC-IP-Address": "104.31.92.40",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RRW35BI2X5245UVKIQFWNVOSGBTYOORP",
"WARC-Record-ID": "<urn:uuid:705fbd33-d9db-4a8b-8be6-622607526837>",
"WARC-Target-URI": "https://stratics.com/threads/rares-questions-please-help.166167/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c66bab15-73c5-4f64-967b-64a813a91e6b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-152-30-25.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,
113,
136,
137,
284,
285,
304,
366,
385,
403,
503,
522,
825,
844,
845,
889,
890,
961,
962,
978,
979,
1000,
1001,
1436,
1442,
1458,
1459,
1486,
1507,
1508,
1520,
1536,
1550,
1558,
1578,
1584,
1650,
1656,
1672,
1673,
1694,
1695,
1737,
1743,
1759,
1760,
1787,
1808,
1809,
1821,
1837,
1851,
1859,
1879,
1885,
1950,
1956,
1968,
1969,
1993,
2014,
2015,
2027,
2044,
2058,
2068,
2088,
2094,
2253,
2259,
2275,
2276,
2297,
2298,
2420
],
"line_end_idx": [
113,
136,
137,
284,
285,
304,
366,
385,
403,
503,
522,
825,
844,
845,
889,
890,
961,
962,
978,
979,
1000,
1001,
1436,
1442,
1458,
1459,
1486,
1507,
1508,
1520,
1536,
1550,
1558,
1578,
1584,
1650,
1656,
1672,
1673,
1694,
1695,
1737,
1743,
1759,
1760,
1787,
1808,
1809,
1821,
1837,
1851,
1859,
1879,
1885,
1950,
1956,
1968,
1969,
1993,
2014,
2015,
2027,
2044,
2058,
2068,
2088,
2094,
2253,
2259,
2275,
2276,
2297,
2298,
2420,
2425
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2425,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3454935550689697,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012875540181994438,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22103004157543182,
"rps_doc_frac_unique_words": 0.5695876479148865,
"rps_doc_mean_word_length": 4.45360803604126,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.0021459199488162994,
"rps_doc_unigram_entropy": 5.155652046203613,
"rps_doc_word_count": 388,
"rps_doc_frac_chars_dupe_10grams": 0.09953703731298447,
"rps_doc_frac_chars_dupe_5grams": 0.09953703731298447,
"rps_doc_frac_chars_dupe_6grams": 0.09953703731298447,
"rps_doc_frac_chars_dupe_7grams": 0.09953703731298447,
"rps_doc_frac_chars_dupe_8grams": 0.09953703731298447,
"rps_doc_frac_chars_dupe_9grams": 0.09953703731298447,
"rps_doc_frac_chars_top_2gram": 0.030092589557170868,
"rps_doc_frac_chars_top_3gram": 0.0434027798473835,
"rps_doc_frac_chars_top_4gram": 0.0347222201526165,
"rps_doc_books_importance": -256.8136291503906,
"rps_doc_books_importance_length_correction": -256.8136291503906,
"rps_doc_openwebtext_importance": -145.54856872558594,
"rps_doc_openwebtext_importance_length_correction": -145.54856872558594,
"rps_doc_wikipedia_importance": -103.9346923828125,
"rps_doc_wikipedia_importance_length_correction": -103.9346923828125
},
"fasttext": {
"dclm": 0.030657410621643066,
"english": 0.9340345859527588,
"fineweb_edu_approx": 1.1495897769927979,
"eai_general_math": 0.0008638500003144145,
"eai_open_web_math": 0.14428532123565674,
"eai_web_code": 0.000025510000341455452
}
}
|
{
"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": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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
|
1,614,381,442,422,786,300 |
tsocks (8) - Linux Manuals
tsocks: Library for intercepting outgoing network connections and
NAME
tsocks - Library for intercepting outgoing network connections and redirecting them through a SOCKS server.
SYNOPSIS
Set LD_PRELOAD to load the library then use applications as normal
The syntax to force preload of the library for different shells is specified below:
Bash, Ksh and Bourne shell -
export LD_PRELOAD=libtsocks.so
C Shell -
setenv LD_PRELOAD=libtsocks.so
This process can be automated (for Bash, Bourne and Korn shell users) for a single command or for all commands in a shell session by using the tsocks(1) script
You can also setup tsocks in such a way that all processes automatically use it, a very useful configuration. For more information on this configuration see the CAVEATS section of this manual page.
DESCRIPTION
tsocks is a library to allow transparent SOCKS proxying. It wraps the normal connect() function. When a connection is attempted, it consults the configuration file (which is defined at configure time but defaults to /etc/tsocks.conf) and determines if the IP address specified is local. If it is not, the library redirects the connection to a SOCKS server specified in the configuration file. It then negotiates that connection with the SOCKS server and passes the connection back to the calling program.
tsocks is designed for use in machines which are firewalled from then internet. It avoids the need to recompile applications like lynx or telnet so they can use SOCKS to reach the internet. It behaves much like the SOCKSified TCP/IP stacks seen on other platforms.
ARGUMENTS
Most arguments to tsocks are provided in the configuration file (the location of which is defined at configure time by the --with-conf=<file> argument but defaults to /etc/tsocks.conf). The structure of this file is documented in tsocks.conf(8)
Some configuration options can be specified at run time using environment variables as follows:
TSOCKS_CONF_FILE
This environment variable overrides the default location of the tsocks configuration file. This variable is not honored if the program tsocks is embedded in is setuid. In addition this environment variable can be compiled out of tsocks with the --disable-envconf argument to configure at build time
TSOCKS_DEBUG
This environment variable sets the level of debug output that should be generated by tsocks (debug output is generated in the form of output to standard error). If this variable is not present by default the logging level is set to 0 which indicates that only error messages should be output. Setting it to higher values will cause tsocks to generate more messages describing what it is doing. If set to -1 tsocks will output absolutely no error or debugging messages. This is only needed if tsocks output interferes with a program it is embedded in. Message output can be permanently compiled out of tsocks by specifying the --disable-debug option to configure at build time
TSOCKS_DEBUG_FILE
This option can be used to redirect the tsocks output (which would normally be sent to standard error) to a file. This variable is not honored if the program tsocks is embedded in is setuid. For programs where tsocks output interferes with normal operation this option is generally better than disabling messages (with TSOCKS_DEBUG = -1)
TSOCKS_USERNAME
This environment variable can be used to specify the username to be used when version 5 SOCKS servers request username/password authentication. This overrides the default username that can be specified in the configuration file using 'default_user', see tsocks.conf(8) for more information. This variable is ignored for version 4 SOCKS servers.
TSOCKS_PASSWORD
This environment variable can be used to specify the password to be used when version 5 SOCKS servers request username/password authentication. This overrides the default password that can be specified in the configuration file using 'default_pass', see tsocks.conf(8) for more information. This variable is ignored for version 4 SOCKS servers.
DNS ISSUES
tsocks will normally not be able to send DNS queries through a SOCKS server since SOCKS V4 works on TCP and DNS normally uses UDP. Version 1.5 and up do however provide a method to force DNS lookups to use TCP, which then makes them proxyable. This option can only enabled at compile time, please consult the INSTALL file for more information.
ERRORS
tsocks will generate error messages and print them to stderr when there are problems with the configuration file or the SOCKS negotiation with the server if the TSOCKS_DEBUG environment variable is not set to -1 or and --disable-debug was not specified at compile time. This output may cause some problems with programs that redirect standard error.
CAVEATS
tsocks will not in the above configuration be able to provide SOCKS proxying to setuid applications or applications that are not run from a shell. You can force all applications to LD_PRELOAD the library by placing the path to libtsocks in /etc/ld.so.preload. Please make sure you correctly enter the full path to the library in this file if you do this. If you get it wrong, you will be UNABLE TO DO ANYTHING with the machine and will have to boot it with a rescue disk and remove the file (or try the saveme program, see the INSTALL file for more info). THIS IS A ***WARNING***, please be careful. Also be sure the library is in the root filesystem as all hell will break loose if the directory it is in is not available at boot time.
BUGS
tsocks can only proxy outgoing TCP connections
tsocks does NOT work correctly with asynchronous sockets (though it does work with non blocking sockets). This bug would be very difficult to fix and there appears to be no demand for it (I know of no major application that uses asynchronous sockets)
tsocks is NOT fully RFC compliant in its implementation of version 5 of SOCKS, it only supports the 'username and password' or 'no authentication' authentication methods. The RFC specifies GSSAPI must be supported by any compliant implementation. I haven't done this, anyone want to help?
tsocks can force the libc resolver to use TCP for name queries, if it does this it does it regardless of whether or not the DNS to be queried is local or not. This introduces overhead and should only be used when needed.
tsocks uses ELF dynamic loader features to intercept dynamic function calls from programs in which it is embedded. As a result, it cannot trace the actions of statically linked executables, non-ELF executables, or executables that make system calls directly with the system call trap or through the syscall() routine.
FILES
/etc/tsocks.conf - default tsocks configuration file
AUTHOR
Shaun Clowes (delius [at] progsoc.uts.edu.au)
COPYRIGHT
Copyright 2000 Shaun Clowes
tsocks and its documentation may be freely copied under the terms and conditions of version 2 of the GNU General Public License, as published by the Free Software Foundation (Cambridge, Massachusetts, United States of America).
This documentation is based on the documentation for logwrites, another shared library interceptor. One line of code from it was used in tsocks and a lot of the documentation :) logwrites is by adam [at] yggdrasil.com (Adam J. Richter) and can be had from ftp.yggdrasil.com pub/dist/pkg
SEE ALSO
tsocks.conf(5) tsocks(1)
|
{
"url": "https://www.systutorials.com/docs/linux/man/docs/linux/man/8-tsocks/",
"source_domain": "www.systutorials.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "14146",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LKVSUJOFLRHYNKRMBSRJTNIN47YZCDYZ",
"WARC-Concurrent-To": "<urn:uuid:38873ac3-c928-45bc-94db-545c8ccd006f>",
"WARC-Date": "2024-08-15T08:08:11Z",
"WARC-IP-Address": "172.67.167.219",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:I2Q5A5MQNPY2CVAXF6UDTQ3J6FKLWNDU",
"WARC-Record-ID": "<urn:uuid:c52b1841-56ef-4094-a882-29050584b7a7>",
"WARC-Target-URI": "https://www.systutorials.com/docs/linux/man/docs/linux/man/8-tsocks/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:684b8e90-cd52-4fee-a127-c968183f1791>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-250\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,
27,
28,
94,
95,
100,
101,
209,
210,
219,
220,
287,
288,
372,
403,
404,
435,
436,
446,
447,
478,
479,
639,
640,
838,
839,
851,
852,
1357,
1358,
1623,
1624,
1634,
1635,
1880,
1881,
1977,
1978,
1995,
2294,
2295,
2308,
2984,
2985,
3003,
3341,
3342,
3358,
3703,
3704,
3720,
4065,
4067,
4068,
4079,
4080,
4424,
4425,
4432,
4433,
4783,
4784,
4792,
4793,
5530,
5531,
5536,
5537,
5584,
5585,
5836,
5837,
6126,
6127,
6348,
6349,
6667,
6668,
6674,
6675,
6728,
6729,
6736,
6737,
6783,
6784,
6794,
6795,
6823,
6824,
7052,
7053,
7340,
7341,
7350,
7351
],
"line_end_idx": [
27,
28,
94,
95,
100,
101,
209,
210,
219,
220,
287,
288,
372,
403,
404,
435,
436,
446,
447,
478,
479,
639,
640,
838,
839,
851,
852,
1357,
1358,
1623,
1624,
1634,
1635,
1880,
1881,
1977,
1978,
1995,
2294,
2295,
2308,
2984,
2985,
3003,
3341,
3342,
3358,
3703,
3704,
3720,
4065,
4067,
4068,
4079,
4080,
4424,
4425,
4432,
4433,
4783,
4784,
4792,
4793,
5530,
5531,
5536,
5537,
5584,
5585,
5836,
5837,
6126,
6127,
6348,
6349,
6667,
6668,
6674,
6675,
6728,
6729,
6736,
6737,
6783,
6784,
6794,
6795,
6823,
6824,
7052,
7053,
7340,
7341,
7350,
7351,
7375
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7375,
"ccnet_original_nlines": 95,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41324692964553833,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.053995680063962936,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14038877189159393,
"rps_doc_frac_unique_words": 0.34385666251182556,
"rps_doc_mean_word_length": 5.067406177520752,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.262136459350586,
"rps_doc_word_count": 1172,
"rps_doc_frac_chars_dupe_10grams": 0.07880114018917084,
"rps_doc_frac_chars_dupe_5grams": 0.16214850544929504,
"rps_doc_frac_chars_dupe_6grams": 0.13773362338542938,
"rps_doc_frac_chars_dupe_7grams": 0.12796767055988312,
"rps_doc_frac_chars_dupe_8grams": 0.12796767055988312,
"rps_doc_frac_chars_dupe_9grams": 0.10877252370119095,
"rps_doc_frac_chars_top_2gram": 0.008418929763138294,
"rps_doc_frac_chars_top_3gram": 0.02020541951060295,
"rps_doc_frac_chars_top_4gram": 0.014817309565842152,
"rps_doc_books_importance": -675.7804565429688,
"rps_doc_books_importance_length_correction": -675.7804565429688,
"rps_doc_openwebtext_importance": -401.2176208496094,
"rps_doc_openwebtext_importance_length_correction": -401.2176208496094,
"rps_doc_wikipedia_importance": -368.62188720703125,
"rps_doc_wikipedia_importance_length_correction": -368.62188720703125
},
"fasttext": {
"dclm": 0.10310549288988113,
"english": 0.8474563956260681,
"fineweb_edu_approx": 2.4518465995788574,
"eai_general_math": 0.9034087061882019,
"eai_open_web_math": 0.3526410460472107,
"eai_web_code": 0.831017792224884
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
525,802,995,556,110,400 |
11
$\begingroup$
I have stumbled across a related question asking which large cardinal properties can hold for $\aleph_1$. This question is probably also related, asking in what ways $\aleph_0$ is a "large" cardinal.
To state my question:
For which large cardinal properties is it consistent with ZFC that $\frak{c}$, the cardinality of continuum, has this property? How does the answer change if we abandon choice?
Here are results I'm aware of:
• $\frak{c}$ can be real-valued measurable (relative to existence of a measurable cardinal), which apparently implies it's weakly Mahlo. I believe all of these hold in ZFC.
• Possibility of $\frak{c}$ being weakly inaccessible and weakly Mahlo (or, I believe, weakly 1-inaccessible or whatever intermediate condition we put on it) is also consistent relative to existence of respective cardinals, which can be established by forcing which doesn't disrupt in any way structure of ordinals, only the size of continuum.
• Clearly $\frak{c}$ can't be strongly inaccessible or strongly Mahlo, because these directly require a cardinal to be strongly limit.
• In ZFC, every measurable is strongly limit, so $\frak{c}$ can't be measurable. But it is also true in ZF, because we have $\aleph_0<\frak{c}$ and $2^{\aleph_0}\geq\frak{c}$, and standard proof that this can't happen for measurable goes through.
• By same means, $\frak{c}$ can't be the critical point of any elementary embedding, so it can't land in any of the higher entries of large cardinals list.
• Continuum can't be weakly compact since weak compactness implies strong limitness. I'm sure this is true in ZFC, but not sure about ZF.
What other properties can or can't continuum have? I believe axiom of choice disallows it to be in anywhere above weakly compact (correct me if I'm wrong), but I have hopes for ZF itself giving $\frak{c}$ more possibilites to be large.
Thank you in advance.
$\endgroup$
• $\begingroup$ I find this question to be a bit too broad, especially in the choiceless context where there is too much to say, and not nearly enough known, as to "how do you formulate largeness" of certain types (just "inaccessible" has a handful of different inequivalent formulations in ZF). $\endgroup$ – Asaf Karagila Jan 1 '16 at 23:08
• $\begingroup$ @Asaf Then doesn't one offer an answer detailing what formulation of inaccessibility one uses? Perhaps this should be CW in any case... $\endgroup$ – David Roberts Jan 2 '16 at 0:15
• 1
$\begingroup$ @Asaf: But I'm pretty sure Wojowu didn't know how well-researched the question was before asking it. $\endgroup$ – Deedlit Jan 2 '16 at 1:26
• 1
$\begingroup$ If you start with $\kappa$ large, say for example supercompact and add $\kappa$ many Cohen reals, $\kappa$ becomes generically supercompact in the extension. $\endgroup$ – Mohammad Golshani Jan 2 '16 at 5:25
• 3
$\begingroup$ Also it is possible for the continuum to be weakly inaccessible and satisfies the tree property. $\endgroup$ – Mohammad Golshani Jan 2 '16 at 5:26
7
$\begingroup$
Let me add a few examples:
(1) If we start with a supercompact cardinal $\kappa$, and force with $Add(\omega, \kappa)$, then in the extension the cardinal $\kappa=2^\omega$ becomes generically supercompact. The same holds for many other large cardinals.
(2) If we start with a weakly compact cardinal, we can find a generic extension in which $2^\omega=\kappa$ is (the least) weakly Mahlo, and tree property holds at $\kappa.$ This result is due to Boos ``Boolean extensions which efface the Mahlo property''.
(3) The consistency of the theory $ZFC$+ "there is a supercompact cardinal'' implies the consistency of the theory $ZFC$ + "there exist a uniform measure $μ$ on the cardinal $2^ω$ and a set $X⊆2^ω$ of positive $μ$-measure such that for every $y∈X$ there is a uniform measure on $y$ which is $|y|$-additive.''
(4) The consistency of the theory $ZFC$+ "there is a measure concentrating on compact cardinals'' implies the consistency of the theory $ZFC$ + "there exist a uniform measure $μ$ on the cardinal $2^ω$ and a set $X⊆2^ω$ of positive $μ$-measure such that for every $y∈X$ there is a uniform measure on $2^ω$ which is $|y|$-additive.''
For (3) and (4) see Some combinatorial properties of measures
(5) Under $PFA, 2^\omega=\aleph_2$ has some large cardinal properties.
| cite | improve this answer | |
$\endgroup$
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://mathoverflow.net/questions/227457/what-sort-of-large-cardinal-can-continuum-be",
"source_domain": "mathoverflow.net",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "134116",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7H4RZ2ZRSZROD2JS4SS63VP6GDVVY7HT",
"WARC-Concurrent-To": "<urn:uuid:16ee4b65-d01d-49f7-9cc4-f411c1c03a64>",
"WARC-Date": "2020-10-29T03:31:07Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2KSYTTCF27P7RVAX37MYDRKAVAAHSMET",
"WARC-Record-ID": "<urn:uuid:e328f942-76fe-4b1d-8f39-e284c0d85809>",
"WARC-Target-URI": "https://mathoverflow.net/questions/227457/what-sort-of-large-cardinal-can-continuum-be",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5182a36a-15c0-44d6-a7b0-d889d1968ee5>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-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,
3,
17,
18,
218,
219,
241,
242,
419,
420,
451,
452,
627,
628,
974,
975,
1112,
1113,
1362,
1363,
1521,
1522,
1662,
1663,
1899,
1900,
1922,
1923,
1935,
2280,
2480,
2486,
2645,
2651,
2877,
2883,
3048,
3050,
3064,
3065,
3092,
3093,
3320,
3321,
3577,
3578,
3887,
3888,
4220,
4221,
4283,
4284,
4355,
4356,
4389,
4401,
4402,
4414,
4415,
4515,
4516
],
"line_end_idx": [
3,
17,
18,
218,
219,
241,
242,
419,
420,
451,
452,
627,
628,
974,
975,
1112,
1113,
1362,
1363,
1521,
1522,
1662,
1663,
1899,
1900,
1922,
1923,
1935,
2280,
2480,
2486,
2645,
2651,
2877,
2883,
3048,
3050,
3064,
3065,
3092,
3093,
3320,
3321,
3577,
3578,
3887,
3888,
4220,
4221,
4283,
4284,
4355,
4356,
4389,
4401,
4402,
4414,
4415,
4515,
4516,
4606
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4606,
"ccnet_original_nlines": 60,
"rps_doc_curly_bracket": 0.004342160187661648,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3396584391593933,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026565460488200188,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3149905204772949,
"rps_doc_frac_unique_words": 0.39071038365364075,
"rps_doc_mean_word_length": 4.7349724769592285,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.0009487699717283249,
"rps_doc_unigram_entropy": 5.185020446777344,
"rps_doc_word_count": 732,
"rps_doc_frac_chars_dupe_10grams": 0.08540104329586029,
"rps_doc_frac_chars_dupe_5grams": 0.13329486548900604,
"rps_doc_frac_chars_dupe_6grams": 0.12521639466285706,
"rps_doc_frac_chars_dupe_7grams": 0.12521639466285706,
"rps_doc_frac_chars_dupe_8grams": 0.12521639466285706,
"rps_doc_frac_chars_dupe_9grams": 0.10617426037788391,
"rps_doc_frac_chars_top_2gram": 0.004327760078012943,
"rps_doc_frac_chars_top_3gram": 0.006924409884959459,
"rps_doc_frac_chars_top_4gram": 0.009232539683580399,
"rps_doc_books_importance": -395.0462951660156,
"rps_doc_books_importance_length_correction": -395.0462951660156,
"rps_doc_openwebtext_importance": -247.92657470703125,
"rps_doc_openwebtext_importance_length_correction": -247.92657470703125,
"rps_doc_wikipedia_importance": -177.50265502929688,
"rps_doc_wikipedia_importance_length_correction": -177.50265502929688
},
"fasttext": {
"dclm": 0.22363263368606567,
"english": 0.9115006923675537,
"fineweb_edu_approx": 1.5442918539047241,
"eai_general_math": 0.7116387486457825,
"eai_open_web_math": 0.7173576354980469,
"eai_web_code": 0.00827283039689064
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "511.322",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
},
"secondary": {
"code": "511.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"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": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "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,662,803,788,959,545,000 |
language.module 31.7 KB
Newer Older
1 2 3 4 5 6 7
<?php
/**
* @file
* Add language handling functionality to Drupal.
*/
8
use Drupal\node\NodeTypeInterface;
9 10
use Drupal\Core\Language\Language;
11 12 13 14 15 16 17 18
/**
* Implements hook_help().
*/
function language_help($path, $arg) {
switch ($path) {
case 'admin/help#language':
$output = '';
$output .= '<h3>' . t('About') . '</h3>';
19
$output .= '<p>' . t('The Language module allows you to maintain a list of languages used on your Drupal site for providing language information for content and for interface translation (using the Locale module). For more information, see the online handbook entry for <a href="@language">Language module</a>.', array('@language' => 'http://drupal.org/documentation/modules/language')) . '</p>';
20 21 22 23
$output .= '<h3>' . t('Uses') . '</h3>';
$output .= '<dl>';
$output .= '<dt>' . t('Configuring the list of languages') . '</dt>';
$output .= '<dd>' . t('<a href="@configure-languages">Configure the list of languages</a> either using the built-in language list or providing any custom languages you wish.', array('@configure-languages' => url('admin/config/regional/language'))) . '</dd>';
24 25
$output .= '<dt>' . t('Configuring a multilingual site') . '</dt>';
$output .= '<dd>' . t("Language negotiation allows your site to automatically change language based on the domain or path used for each request. Users may (optionally) select their preferred language on their <em>My account</em> page, and your site can be configured to honor a web browser's preferred language settings. Site content can be translated using the <a href='@content-help'>Content Translation module</a>.", array('@content-help' => url('admin/help/translation'))) . '</dd>';
26 27 28 29
$output .= '</dl>';
return $output;
case 'admin/config/regional/language':
30
return '<p>' . t('With multiple languages enabled, registered users may select their preferred language and authors can assign a specific language to content. The selection of what language is used to display page elements is made depending on the detection menthod settings in the <a href="@detection">Detection and Selection</a> tab.', array('@detection' => url('admin/config/regional/language/detection'))) . '</p>';
31 32 33
case 'admin/config/regional/language/add':
return '<p>' . t('Add a language to be supported by your site. If your desired language is not available, pick <em>Custom language...</em> at the end and provide a language code and other details manually.') . '</p>';
34 35
case 'admin/config/regional/language/detection':
36
$output = '<p>' . t('Define how to decide which language is used to display page elements (primarily text provided by Drupal and modules, such as field labels and help text). This decision is made by evaluating a series of detection methods for languages; the first detection method that gets a result will determine which language is used for that type of text. Be aware that some language negotiation methods are unreliable under certain conditions, such as browser detection when page-caching is enabled and a user is not currently logged in. Define the order of evaluation of language detection methods on this page. Default language can be changed at the <a href="@region-settings">Regional settings</a> page.', array('@region-settings' => url('admin/config/regional/settings'))) . '</p>';
37 38 39 40 41 42
return $output;
case 'admin/config/regional/language/detection/session':
$output = '<p>' . t('Determine the language from a request/session parameter. Example: "http://example.com?language=de" sets language to German based on the use of "de" within the "language" parameter.') . '</p>';
return $output;
43 44 45 46
case 'admin/config/regional/language/detection/browser':
$output = '<p>' . t('Browsers use different language codes to refer to the same languages. You can add and edit mappings from browser language codes to the <a href="@configure-languages">languages used by Drupal</a>.', array('@configure-languages' => url('admin/config/regional/language'))) . '</p>';
return $output;
47 48 49 50 51 52
case 'admin/config/regional/language/detection/selected':
$output = '<p>' . t('Changing the selected language here (and leaving this option as the last among the detection and selection options) is the easiest way to change the fallback language for the website, if you need to change how your site works by default (eg. when using an empty path prefix or using the default domain). <a href="@admin-change-language">Changing the site\'s default language</a> itself might have other undesired side effects.
', array('@admin-change-language' => url('admin/config/regional/language'))) . '</p>';
return $output;
53 54
case 'admin/structure/block/manage/%':
case 'admin/structure/block/add/%/%':
55
if ($arg[4] == 'language' && $arg[5] == 'language_interface') {
56
return '<p>' . t('With multiple languages enabled, registered users can select their preferred language and authors can assign a specific language to content.') . '</p>';
57 58
}
break;
59 60 61
case 'admin/config/regional/content-language':
return t('Change language settings for <em>content types</em>, <em>taxonomy vocabularies</em>, <em>user profiles</em>, or any other supported element on your site. By default, language settings hide the language selector and the language is the site\'s default language.');
62 63 64 65 66 67 68
}
}
/**
* Implements hook_menu().
*/
function language_menu() {
69
// Base language management and configuration.
70 71 72
$items['admin/config/regional/language'] = array(
'title' => 'Languages',
'description' => 'Configure languages for content and the user interface.',
73
'route_name' => 'language.admin_overview',
74 75 76 77 78 79 80
'weight' => -10,
);
$items['admin/config/regional/language/list'] = array(
'title' => 'List',
'type' => MENU_DEFAULT_LOCAL_TASK,
);
$items['admin/config/regional/language/add'] = array(
81
'route_name' => 'language.add',
82
'type' => MENU_SIBLING_LOCAL_TASK,
83 84 85
);
$items['admin/config/regional/language/edit/%language'] = array(
'title' => 'Edit language',
86
'route_name' => 'language.edit',
87
);
88 89 90 91 92
$items['admin/config/regional/language/edit/%language/edit'] = array(
'title' => 'Edit',
'type' => MENU_DEFAULT_LOCAL_TASK,
'weight' => -10,
);
93 94 95 96 97 98 99 100 101 102 103 104 105
// Language negotiation.
$items['admin/config/regional/language/detection'] = array(
'title' => 'Detection and selection',
'page callback' => 'drupal_get_form',
'page arguments' => array('language_negotiation_configure_form'),
'access arguments' => array('administer languages'),
'weight' => 10,
'file' => 'language.admin.inc',
'type' => MENU_LOCAL_TASK,
);
$items['admin/config/regional/language/detection/url'] = array(
'title' => 'URL language detection configuration',
106
'route_name' => 'language.negotiation_url',
107 108 109 110
'type' => MENU_VISIBLE_IN_BREADCRUMB,
);
$items['admin/config/regional/language/detection/session'] = array(
'title' => 'Session language detection configuration',
111
'route_name' => 'language.negotiation_session',
112 113
'type' => MENU_VISIBLE_IN_BREADCRUMB,
);
114 115
$items['admin/config/regional/language/detection/browser'] = array(
'title' => 'Browser language detection configuration',
116
'route_name' => 'language.negotiation_browser',
117 118
'type' => MENU_VISIBLE_IN_BREADCRUMB,
);
119 120
$items['admin/config/regional/language/detection/selected'] = array(
'title' => 'Selected language detection configuration',
121
'route_name' => 'language.negotiation_selected',
122 123
'type' => MENU_VISIBLE_IN_BREADCRUMB,
);
124
125 126 127 128 129 130 131 132 133
// Content language settings.
$items['admin/config/regional/content-language'] = array(
'title' => 'Content language settings',
'description' => 'Configure content language support for any multilingual element.',
'page callback' => 'language_content_settings_page',
'access arguments' => array('administer languages'),
'file' => 'language.admin.inc',
);
134 135 136
return $items;
}
137 138
/**
* Editing or deleting locked languages should not be possible.
139 140
*
* @deprecated Use \Drupal\language\LanguageAccessController instead.
141 142 143 144 145
*/
function language_access_language_edit_or_delete($language) {
return !$language->locked && user_access('administer languages');
}
146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161
/**
* Implements hook_permission().
*/
function language_permission() {
return array(
'administer languages' => array(
'title' => t('Administer languages'),
),
);
}
/**
* Implements hook_theme().
*/
function language_theme() {
return array(
162 163 164
'language_negotiation_configure_form' => array(
'render element' => 'form',
),
165 166 167 168
'language_negotiation_configure_browser_form_table' => array(
'render element' => 'form',
'file' => 'language.admin.inc',
),
169 170 171 172
'language_content_settings_table' => array(
'render element' => 'element',
'file' => 'language.admin.inc',
),
173 174 175
);
}
176 177 178 179 180 181 182 183 184
/**
* Returns a list of supported entity types.
*
* @return array
* An array of entity type names.
*/
function language_entity_supported() {
$supported = array();
foreach (entity_get_info() as $entity_type => $info) {
185
if (!empty($info['translatable'])) {
186 187 188 189 190 191
$supported[$entity_type] = $entity_type;
}
}
return $supported;
}
192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207
/**
* Implements hook_element_info_alter().
*/
function language_element_info_alter(&$type) {
// Alter the language_select element so that it will be rendered like a select
// field.
if (isset($type['language_select'])) {
if (!isset($type['language_select']['#process'])) {
$type['language_select']['#process'] = array();
}
if (!isset($type['language_select']['#theme_wrappers'])) {
$type['language_select']['#theme_wrappers'] = array();
}
$type['language_select']['#process'] = array_merge($type['language_select']['#process'], array('language_process_language_select', 'form_process_select', 'ajax_process_form'));
$type['language_select']['#theme'] = 'select';
$type['language_select']['#theme_wrappers'] = array_merge($type['language_select']['#theme_wrappers'], array('form_element'));
208
$type['language_select']['#languages'] = Language::STATE_CONFIGURABLE;
209 210 211 212 213 214 215 216 217 218 219 220 221 222
$type['language_select']['#multiple'] = FALSE;
}
}
/**
* Processes a language select list form element.
*
* @param array $element
* The form element to process.
*
* @return array $element
* The processed form element.
*/
function language_process_language_select($element) {
223
// Don't set the options if another module (translation for example) already
224 225 226 227 228 229 230 231 232 233
// set the options.
if (!isset($element['#options'])) {
$element['#options'] = array();
foreach (language_list($element['#languages']) as $langcode => $language) {
$element['#options'][$langcode] = $language->locked ? t('- @name -', array('@name' => $language->name)) : $language->name;
}
}
return $element;
}
234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254
/**
* Implements hook_element_info().
*/
function language_element_info() {
$types['language_configuration'] = array(
'#input' => TRUE,
'#tree' => TRUE,
'#process' => array('language_configuration_element_process'),
);
return $types;
}
/**
* Returns the default options for the language configuration form element.
*
* @return array
* An array containing the default options.
*/
function language_configuration_element_default_options() {
$language_options = array();
255
$languages = language_list(Language::STATE_ALL);
256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283
foreach ($languages as $langcode => $language) {
$language_options[$langcode] = $language->locked ? t('- @name -', array('@name' => $language->name)) : $language->name;
}
$language_options += array(
'site_default' => t("Site's default language (!language)", array('!language' => language_default()->name)),
'current_interface' => t('Current interface language'),
'authors_default' => t("Author's preferred language"),
);
return $language_options;
}
/**
* Process handler for the language_configuration form element.
*/
function language_configuration_element_process($element, &$form_state, &$form) {
$options = isset($element['#options']) ? $element['#options'] : array();
// Avoid validation failure since we are moving the '#options' key in the
// nested 'language' select element.
unset($element['#options']);
$element['langcode'] = array(
'#type' => 'select',
'#title' => t('Default language'),
'#options' => $options + language_configuration_element_default_options(),
'#description' => t('Explanation of the language options is found on the <a href="@languages_list_page">languages list page</a>.', array('@languages_list_page' => url('admin/config/regional/language'))),
'#default_value' => isset($element['#default_value']['langcode']) ? $element['#default_value']['langcode'] : NULL,
);
284
$element['language_show'] = array(
285
'#type' => 'checkbox',
286 287
'#title' => t('Show language selector on create and edit pages'),
'#default_value' => isset($element['#default_value']['language_show']) ? $element['#default_value']['language_show'] : NULL,
288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303
);
// Add the entity type and bundle information to the form if they are set.
// They will be used, in the submit handler, to generate the names of the
// variables that will store the settings and are a way to uniquely identify
// the entity.
if (!isset($form_state['language'])) {
$form_state['language'] = array();
}
$form_state['language'] += array(
$element['#name'] => array(
'entity_type' => $element['#entity_information']['entity_type'],
'bundle' => $element['#entity_information']['bundle'],
),
);
304 305 306 307 308 309 310 311 312 313 314 315
// Do not add the submit callback for the language content settings page,
// which is handled separately.
if (array_search('language_content_settings_form_submit', $form['#submit']) === FALSE) {
// Determine where to attach the language_configuration element submit handler.
// @todo Form API: Allow form widgets/sections to declare #submit handlers.
if (isset($form['actions']['submit']['#submit']) && array_search('language_configuration_element_submit', $form['actions']['submit']['#submit']) === FALSE) {
$form['actions']['submit']['#submit'][] = 'language_configuration_element_submit';
}
elseif (array_search('language_configuration_element_submit', $form['#submit']) === FALSE) {
$form['#submit'][] = 'language_configuration_element_submit';
}
}
316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341
return $element;
}
/**
* Submit handler for the forms that have a language_configuration element.
*/
function language_configuration_element_submit(&$form, &$form_state) {
// Iterate through all the language_configuration elements and save their
// values.
if (isset($form_state['language'])) {
foreach ($form_state['language'] as $element_name => $values) {
language_save_default_configuration($values['entity_type'], $values['bundle'], $form_state['values'][$element_name]);
}
}
}
/**
* Saves a language configuration that is attached to an entity type and bundle.
*
* @param string $entity_type
* A string representing the entity type.
* @param string $bundle
* A string representing the bundle.
* @param array $values
* An array holding the values to be saved having the following keys:
* - langcode: the language code.
342
* - language_show: if the language element should be hidden or not.
343 344
*/
function language_save_default_configuration($entity_type, $bundle, $values = array()) {
345
\Drupal::config('language.settings')->set(language_get_default_configuration_settings_key($entity_type, $bundle), array('langcode' => $values['langcode'], 'language_show' => $values['language_show']))->save();
346 347 348 349 350 351 352 353 354 355 356 357 358
}
/**
* Returns the language configuration stored for an entity type and bundle.
*
* @param string $entity_type
* A string representing the entity type.
* @param string $bundle
* A string representing the bundle.
*
* @return array
* An array with the following keys:
* - langcode: the language code.
359
* - language_show: if the language element is hidden or not.
360 361
*/
function language_get_default_configuration($entity_type, $bundle) {
362
$configuration = \Drupal::config('language.settings')->get(language_get_default_configuration_settings_key($entity_type, $bundle));
363 364 365
if (is_null($configuration)) {
$configuration = array();
}
366
$configuration += array('langcode' => 'site_default', 'language_show' => FALSE);
367 368 369 370 371 372 373 374 375 376 377 378
return $configuration;
}
/**
* Clears the default language configuration for an entity type and bundle.
*
* @param string $entity_type
* A string representing the entity type.
* @param string $bundle
* A string representing the bundle.
*/
function language_clear_default_configuration($entity_type, $bundle) {
379
\Drupal::config('language.settings')->clear(language_get_default_configuration_settings_key($entity_type, $bundle))->save();
380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405
}
/**
* Returns the root name of the variables used to store the configuration.
*
* Based on the entity type and bundle, the variables used to store the
* configuration will have a common root name.
*
* @param string $entity_type
* A string representing the entity type.
* @param string $bundle
* A string representing the bundle.
*
* @return string
* The root name of the variables.
*/
function language_get_default_configuration_settings_key($entity_type, $bundle) {
// Replace all the characters that are not letters, numbers or "_" with "_".
$entity_type = preg_replace('/[^0-9a-zA-Z_]/', "_", $entity_type);
$bundle = preg_replace('/[^0-9a-zA-Z_]/', "_", $bundle);
return $entity_type . '.' . $bundle . '.language.default_configuration';
}
/**
* Implements hook_node_type_update().
*/
406 407 408 409
function language_node_type_update(NodeTypeInterface $type) {
if ($type->original->id() != $type->id()) {
language_save_default_configuration('node', $type->id(), language_get_default_configuration('node', $type->original->id()));
language_clear_default_configuration('node', $type->original->id());
410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431
}
}
/**
* Returns the default language code assigned to an entity type and a bundle.
*
* @param string $entity_type
* The entity type.
* @param string $bundle
* The bundle name.
*
* @return string
* The language code.
*/
function language_get_default_langcode($entity_type, $bundle) {
$configuration = language_get_default_configuration($entity_type, $bundle);
if (!isset($configuration['langcode'])) {
$configuration['langcode'] = 'site_default';
}
$default_value = NULL;
432
$language_interface = language(Language::TYPE_INTERFACE);
433 434
switch ($configuration['langcode']) {
case 'site_default':
435
$default_value = language_default()->id;
436 437 438
break;
case 'current_interface':
439
$default_value = $language_interface->id;
440 441 442 443
break;
case 'authors_default':
global $user;
444 445 446
$language_code = $user->getPreferredLangcode();
if (!empty($language_code)) {
$default_value = $language_code;
447 448
}
else {
449
$default_value = $language_interface->id;
450 451 452 453 454 455 456 457 458 459 460 461
}
break;
}
if ($default_value) {
return $default_value;
}
// If we still do not have a default value, just return the value stored in
// the configuration; it has to be an actual language code.
return $configuration['langcode'];
}
462 463 464 465
/**
* API function to add or update a language.
*
* @param $language
466 467
* Language object with properties corresponding to the 'language'
* configuration properties.
468 469
*/
function language_save($language) {
470 471 472 473 474 475 476
$language_entity = entity_load('language_entity', $language->id);
if (!$language_entity) {
$language_entity = entity_create('language_entity', array(
'id' => $language->id,
));
}
$language->is_new = $language_entity->isNew();
477 478
// Let other modules modify $language before saved.
479
\Drupal::moduleHandler()->invokeAll('language_presave', array($language));
480
481 482 483 484 485 486
// Assign language properties to language entity.
$language_entity->label = isset($language->name) ? $language->name : '';
$language_entity->direction = isset($language->direction) ? $language->direction : '0';
$language_entity->locked = isset($language->locked) ? $language->locked : '0';
$language_entity->weight = isset($language->weight) ? $language->weight : '0';
487
// Save the record and inform others about the change.
488 489
$language_entity->save();
$t_args = array('%language' => $language->name, '%langcode' => $language->id);
490
if ($language->is_new) {
491
\Drupal::moduleHandler()->invokeAll('language_insert', array($language));
492 493 494
watchdog('language', 'The %language (%langcode) language has been created.', $t_args);
}
else {
495
\Drupal::moduleHandler()->invokeAll('language_update', array($language));
496 497 498 499 500
watchdog('language', 'The %language (%langcode) language has been updated.', $t_args);
}
if (!empty($language->default)) {
// Set the new version of this language as default in a variable.
501
variable_set('language_default', (array) $language);
502 503
}
504 505 506
// Kill the static cache in language_list().
drupal_static_reset('language_list');
507
// Update language count based on unlocked language count.
508
language_update_count();
509
510 511 512
// Update weight of locked system languages.
language_update_locked_weights();
513 514
language_negotiation_include();
515 516 517 518
// Update URL Prefixes for all languages after the new default language is
// propagated and the language_list() cache is flushed.
language_negotiation_url_prefixes_update();
519 520 521
return $language;
}
522
/**
523
* Updates the language_count state.
524 525 526 527 528 529
*
* This is used to check if a site is multilingual or not.
*
* @see language_multilingual()
*/
function language_update_count() {
530 531 532 533 534 535
$count = 0;
foreach (entity_load_multiple('language_entity') as $language) {
if (!$language->locked) {
$count++;
}
}
536
\Drupal::state()->set('language_count', $count);
537 538
}
539 540 541 542 543
/**
* Delete a language.
*
* @param $langcode
* Language code of the language to be deleted.
544
*
545 546 547 548
* @return
* TRUE if language is successfully deleted. Otherwise FALSE.
*/
function language_delete($langcode) {
549
$languages = language_list(Language::STATE_ALL);
550
if (isset($languages[$langcode]) && !$languages[$langcode]->locked) {
551 552
$language = $languages[$langcode];
553
\Drupal::moduleHandler()->invokeAll('language_delete', array($language));
554 555
// Remove the language.
556
entity_delete_multiple('language_entity', array($language->id));
557
558 559
drupal_static_reset('language_list');
560
language_update_count();
561
562 563 564
// Update weight of locked system languages.
language_update_locked_weights();
565
$t_args = array('%language' => $language->name, '%langcode' => $language->id);
566 567 568 569 570
watchdog('language', 'The %language (%langcode) language has been removed.', $t_args);
return TRUE;
}
return FALSE;
}
571
572 573 574 575 576 577
/**
* Implements hook_library_info().
*/
function language_library_info() {
$libraries['language.admin'] = array(
'title' => 'Language detection admin',
578
'version' => \Drupal::VERSION,
579 580 581 582 583 584 585 586 587 588 589 590 591
'js' => array(
drupal_get_path('module', 'language') . '/language.admin.js' => array(),
),
'dependencies' => array(
array('system', 'jquery'),
array('system', 'drupal'),
array('system', 'jquery.once'),
),
);
return $libraries;
}
592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609
/**
* Implements hook_language_types_info().
*
* Defines the three core language types:
* - Interface language is the only configurable language type in core. It is
* used by t() as the default language if none is specified.
* - Content language is by default non-configurable and inherits the interface
* language negotiated value. It is used by the Field API to determine the
* display language for fields if no explicit value is specified.
* - URL language is by default non-configurable and is determined through the
* URL language negotiation method or the URL fallback language negotiation
* method if no language can be detected. It is used by l() as the default
* language if none is specified.
*/
function language_language_types_info() {
language_negotiation_include();
return array(
610
Language::TYPE_INTERFACE => array(
611 612
'name' => t('User interface text'),
'description' => t('Order of language detection methods for user interface text. If a translation of user interface text is available in the detected language, it will be displayed.'),
613
'locked' => TRUE,
614
),
615
Language::TYPE_CONTENT => array(
616 617 618
'name' => t('Content'),
'description' => t('Order of language detection methods for content. If a version of content is available in the detected language, it will be displayed.'),
'fixed' => array(LANGUAGE_NEGOTIATION_INTERFACE),
619
'locked' => TRUE,
620
),
621
Language::TYPE_URL => array(
622
'fixed' => array(LANGUAGE_NEGOTIATION_URL, LANGUAGE_NEGOTIATION_URL_FALLBACK),
623
'locked' => TRUE,
624 625 626 627 628 629 630 631 632 633 634 635 636
),
);
}
/**
* Implements hook_language_negotiation_info().
*/
function language_language_negotiation_info() {
language_negotiation_include();
$file = drupal_get_path('module', 'language') . '/language.negotiation.inc';
$negotiation_info = array();
$negotiation_info[LANGUAGE_NEGOTIATION_URL] = array(
637
'types' => array(Language::TYPE_CONTENT, Language::TYPE_INTERFACE, Language::TYPE_URL),
638 639 640 641 642 643 644
'callbacks' => array(
'negotiation' => 'language_from_url',
'language_switch' => 'language_switcher_url',
),
'file' => $file,
'weight' => -8,
'name' => t('URL'),
645
'description' => t('Language from the URL (Path prefix or domain).'),
646 647 648 649 650 651 652 653 654 655 656 657
'config' => 'admin/config/regional/language/detection/url',
);
$negotiation_info[LANGUAGE_NEGOTIATION_SESSION] = array(
'callbacks' => array(
'negotiation' => 'language_from_session',
'language_switch' => 'language_switcher_session',
'url_rewrite' => 'language_url_rewrite_session',
),
'file' => $file,
'weight' => -6,
'name' => t('Session'),
658
'description' => t('Language from a request/session parameter.'),
659 660 661 662 663 664 665
'config' => 'admin/config/regional/language/detection/session',
);
$negotiation_info[LANGUAGE_NEGOTIATION_USER] = array(
'callbacks' => array('negotiation' => 'language_from_user'),
'file' => $file,
'weight' => -4,
666 667
'name' => t('Account preference for site'),
'description' => t("The language setting for the site in the user's account."),
668 669 670 671 672 673 674 675
);
$negotiation_info[LANGUAGE_NEGOTIATION_BROWSER] = array(
'callbacks' => array('negotiation' => 'language_from_browser'),
'file' => $file,
'weight' => -2,
'cache' => 0,
'name' => t('Browser'),
676
'description' => t("Language from the browser's language settings."),
677
'config' => 'admin/config/regional/language/detection/browser',
678 679 680
);
$negotiation_info[LANGUAGE_NEGOTIATION_INTERFACE] = array(
681
'types' => array(Language::TYPE_CONTENT),
682 683 684 685 686 687 688 689
'callbacks' => array('negotiation' => 'language_from_interface'),
'file' => $file,
'weight' => 8,
'name' => t('Interface'),
'description' => t('Use the detected interface language.'),
);
$negotiation_info[LANGUAGE_NEGOTIATION_URL_FALLBACK] = array(
690
'types' => array(Language::TYPE_URL),
691 692 693 694 695 696 697
'callbacks' => array('negotiation' => 'language_url_fallback'),
'file' => $file,
'weight' => 8,
'name' => t('URL fallback'),
'description' => t('Use an already detected language for URLs if none is found.'),
);
698
$negotiation_info[LANGUAGE_NEGOTIATION_USER_ADMIN] = array(
699
'types' => array(Language::TYPE_INTERFACE),
700 701 702
'callbacks' => array('negotiation' => 'language_from_user_admin'),
'file' => $file,
'weight' => 10,
703 704
'name' => t('Account preference for administration pages'),
'description' => t("The language setting for account administration pages in the user's account."),
705 706
);
707 708 709 710 711 712 713 714
return $negotiation_info;
}
/**
* Include negotiation backend functionality.
*/
function language_negotiation_include() {
include_once DRUPAL_ROOT . '/core/includes/language.inc';
715
include_once __DIR__ . '/language.negotiation.inc';
716 717 718 719 720 721
}
/**
* Implements hook_modules_enabled().
*/
function language_modules_enabled($modules) {
722 723 724
include_once DRUPAL_ROOT . '/core/includes/language.inc';
// Load configurability options from configuration.
language_types_set(array());
725 726 727 728 729 730 731 732 733 734 735 736 737 738
language_negotiation_purge();
}
/**
* Implements hook_modules_disabled().
*/
function language_modules_disabled($modules) {
language_modules_enabled($modules);
}
/**
* Implements hook_language_insert().
*/
function language_language_insert($language) {
739 740 741 742
if (!empty($language->locked)) {
return;
}
743 744 745 746
language_negotiation_include();
// Add language to the list of language domains.
$domains = language_negotiation_url_domains();
747
$domains[$language->id] = '';
748 749 750 751 752 753 754 755 756 757 758
language_negotiation_url_domains_save($domains);
}
/**
* Implements hook_language_delete().
*/
function language_language_delete($language) {
language_negotiation_include();
// Remove language from language prefix list.
$prefixes = language_negotiation_url_prefixes();
759
unset($prefixes[$language->id]);
760 761 762 763
language_negotiation_url_prefixes_save($prefixes);
// Remove language from language domain list.
$domains = language_negotiation_url_domains();
764
unset($domains[$language->id]);
765 766 767 768
language_negotiation_url_domains_save($domains);
}
/**
769
* Implements hook_preprocess_HOOK() for block.html.twig.
770 771
*/
function language_preprocess_block(&$variables) {
772
if ($variables['configuration']['module'] == 'language') {
773
$variables['attributes']['role'] = 'navigation';
774 775 776
}
}
777 778 779 780 781 782 783 784
/**
* Returns language mappings between browser and Drupal language codes.
*
* @return array
* An array containing browser language codes as keys with corresponding
* Drupal language codes as values.
*/
function language_get_browser_drupal_langcode_mappings() {
785
$config = \Drupal::config('language.mappings');
786 787 788 789 790 791 792 793 794 795 796 797 798 799
if ($config->isNew()) {
return array();
}
return $config->get();
}
/**
* Stores language mappings between browser and Drupal language codes.
*
* @param array $mappings
* An array containing browser language codes as keys with corresponding
* Drupal language codes as values.
*/
function language_set_browser_drupal_langcode_mappings($mappings) {
800
$config = \Drupal::config('language.mappings');
801 802 803
$config->setData($mappings);
$config->save();
}
804 805 806 807 808
/**
* Updates locked system language weights.
*/
function language_update_locked_weights() {
809 810
$max_weight = 0;
811
// Get maximum weight to update the system languages to keep them on bottom.
812 813 814 815 816 817
foreach (language_list(Language::STATE_CONFIGURABLE) as $language) {
if (!$language->locked && $language->weight > $max_weight) {
$max_weight = $language->weight;
}
}
818
// Loop locked languages to maintain the existing order.
819
foreach (language_list(Language::STATE_LOCKED) as $language) {
820 821
$max_weight++;
// Update system languages weight.
822
\Drupal::config('language.entity.' . $language->id)
823 824
->set('weight', $max_weight)
->save();
825 826
}
}
827 828 829 830 831 832 833 834 835 836 837 838 839 840 841
/**
* Implements hook_form_FORM_ID_alter for system_regional_settings().
*
* @see language_system_regional_settings_form_submit()
*/
function language_form_system_regional_settings_alter(&$form, &$form_state) {
$languages = language_list();
$default = language_default();
foreach ($languages as $key => $language) {
$language_options[$key] = $language->name;
}
$form['locale']['site_default_language'] = array(
'#type' => 'select',
'#title' => t('Default language'),
842
'#default_value' => $default->id,
843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861
'#options' => $language_options,
'#description' => t('It is not recommended to change the default language on a working site. <a href="@language-detection">Configure the Selected language</a> setting on the detection and selection page to change the fallback language for language selection.', array('@language-detection' => url('admin/config/regional/language/detection'))),
'#weight' => -1,
);
// Add submit handler to save default language.
$form['#submit'][] = 'language_system_regional_settings_form_submit';
}
/**
* Form submission handler for system_regional_settings().
*
* @see language_form_system_regional_settings_alter()
*/
function language_system_regional_settings_form_submit($form, &$form_state) {
$languages = language_list();
$language = $languages[$form_state['values']['site_default_language']];
$language->default = TRUE;
language_save($language);
}
|
{
"url": "https://git.drupalcode.org/project/drupal/-/blame/61fcb6fc0140f5fbcd8fda0a070bf85b29b87f83/core/modules/language/language.module",
"source_domain": "git.drupalcode.org",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "794061",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CHZ7UOM3Y2EE6MRQT4DSDE2BQWZPSXJ2",
"WARC-Concurrent-To": "<urn:uuid:03010b6b-c5d8-4ff2-8437-2c7a4ad4d067>",
"WARC-Date": "2021-06-15T19:43:03Z",
"WARC-IP-Address": "151.101.202.217",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZI62YNE4TJTZV55IANOGTXTYI5SG53GW",
"WARC-Record-ID": "<urn:uuid:3c165b7f-f4f2-4780-add1-e781ad281d6f>",
"WARC-Target-URI": "https://git.drupalcode.org/project/drupal/-/blame/61fcb6fc0140f5fbcd8fda0a070bf85b29b87f83/core/modules/language/language.module",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7a40f862-d267-4638-953d-3a4199dc29ca>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-70.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,
24,
36,
50,
56,
57,
61,
70,
120,
124,
125,
127,
162,
167,
202,
203,
227,
231,
258,
262,
300,
319,
351,
371,
419,
422,
825,
837,
884,
909,
985,
1250,
1256,
1330,
1824,
1836,
1862,
1884,
1885,
1928,
1931,
2357,
2366,
2367,
2414,
2638,
2644,
2645,
2698,
2701,
3502,
3520,
3542,
3543,
3604,
3824,
3846,
3847,
3859,
3920,
4227,
4249,
4250,
4268,
4330,
4784,
4871,
4872,
4894,
4895,
4901,
4944,
4986,
4989,
5059,
5062,
5241,
5247,
5255,
5268,
5277,
5278,
5329,
5609,
5630,
5634,
5636,
5637,
5641,
5668,
5672,
5699,
5702,
5751,
5760,
5812,
5840,
5920,
5923,
5970,
5991,
6012,
6017,
6074,
6097,
6136,
6141,
6197,
6200,
6236,
6239,
6278,
6287,
6292,
6359,
6391,
6394,
6431,
6434,
6439,
6454,
6526,
6549,
6588,
6609,
6615,
6660,
6661,
6688,
6750,
6792,
6834,
6904,
6961,
6981,
7017,
7048,
7053,
7119,
7174,
7178,
7226,
7242,
7284,
7289,
7359,
7418,
7422,
7474,
7482,
7524,
7529,
7537,
7607,
7666,
7670,
7722,
7730,
7772,
7777,
7785,
7856,
7916,
7920,
7973,
7981,
8023,
8028,
8032,
8033,
8069,
8101,
8161,
8205,
8294,
8351,
8408,
8444,
8449,
8450,
8462,
8479,
8481,
8482,
8490,
8494,
8558,
8566,
8569,
8639,
8659,
8663,
8725,
8793,
8795,
8796,
8860,
8864,
8897,
8901,
8934,
8950,
8987,
9031,
9038,
9043,
9045,
9046,
9050,
9078,
9082,
9110,
9126,
9138,
9190,
9224,
9231,
9247,
9313,
9347,
9385,
9392,
9408,
9456,
9493,
9531,
9538,
9550,
9555,
9557,
9558,
9594,
9598,
9643,
9646,
9663,
9699,
9703,
9742,
9766,
9823,
9827,
9868,
9892,
9939,
9945,
9949,
9970,
9972,
9973,
10037,
10041,
10082,
10086,
10133,
10214,
10226,
10267,
10323,
10377,
10383,
10446,
10507,
10513,
10694,
10745,
10876,
10880,
10955,
11011,
11062,
11066,
11068,
11069,
11073,
11123,
11126,
11151,
11185,
11188,
11214,
11247,
11251,
11305,
11309,
11388,
11428,
11450,
11488,
11524,
11604,
11733,
11739,
11743,
11762,
11764,
11765,
11849,
11853,
11888,
11892,
11927,
11971,
11993,
12014,
12081,
12086,
12103,
12105,
12106,
12110,
12186,
12189,
12206,
12252,
12256,
12316,
12347,
12348,
12352,
12403,
12515,
12566,
12690,
12694,
12695,
12725,
12837,
12897,
12956,
12961,
12989,
12991,
12992,
12996,
13060,
13064,
13146,
13221,
13297,
13336,
13367,
13399,
13424,
13463,
13542,
13750,
13869,
13874,
13875,
13879,
13916,
13920,
13947,
13955,
14025,
14154,
14218,
14223,
14224,
14301,
14377,
14456,
14473,
14514,
14553,
14557,
14593,
14625,
14696,
14757,
14764,
14769,
14770,
14818,
14894,
14928,
15019,
15103,
15183,
15345,
15434,
15440,
15537,
15605,
15611,
15615,
15719,
15738,
15740,
15741,
15745,
15821,
15825,
15896,
15972,
15985,
16025,
16093,
16218,
16224,
16228,
16230,
16231,
16235,
16316,
16319,
16349,
16393,
16418,
16457,
16481,
16553,
16589,
16593,
16664,
16672,
16676,
16765,
16769,
16981,
17033,
17035,
17036,
17040,
17116,
17119,
17149,
17193,
17218,
17257,
17260,
17277,
17316,
17352,
17356,
17420,
17428,
17432,
17501,
17505,
17639,
17651,
17684,
17714,
17718,
17722,
17805,
17853,
17878,
17880,
17881,
17885,
17961,
17964,
17994,
18038,
18063,
18102,
18106,
18177,
18181,
18308,
18412,
18414,
18415,
18419,
18494,
18497,
18569,
18616,
18619,
18649,
18693,
18718,
18757,
18760,
18778,
18815,
18819,
18901,
18980,
19049,
19108,
19183,
19185,
19186,
19190,
19229,
19233,
19249,
19311,
19357,
19486,
19559,
19647,
19651,
19653,
19654,
19658,
19736,
19739,
19769,
19791,
19816,
19838,
19841,
19859,
19883,
19887,
19951,
20029,
20030,
20074,
20123,
20127,
20128,
20153,
20157,
20217,
20225,
20265,
20290,
20294,
20341,
20353,
20366,
20367,
20397,
20401,
20449,
20465,
20478,
20479,
20507,
20527,
20539,
20593,
20629,
20670,
20678,
20686,
20699,
20703,
20753,
20801,
20809,
20822,
20826,
20850,
20877,
20881,
20882,
20960,
21022,
21059,
21061,
21062,
21078,
21082,
21127,
21130,
21150,
21158,
21227,
21258,
21266,
21270,
21306,
21334,
21402,
21429,
21492,
21521,
21529,
21533,
21582,
21590,
21591,
21645,
21649,
21726,
21730,
21731,
21755,
21807,
21882,
21972,
22053,
22134,
22135,
22139,
22196,
22204,
22232,
22313,
22317,
22344,
22348,
22426,
22438,
22529,
22533,
22542,
22546,
22624,
22644,
22735,
22739,
22740,
22776,
22846,
22850,
22907,
22915,
22919,
22920,
22932,
22979,
23019,
23020,
23024,
23085,
23089,
23116,
23120,
23121,
23133,
23180,
23216,
23217,
23225,
23259,
23260,
23276,
23353,
23411,
23457,
23458,
23470,
23490,
23492,
23493,
23497,
23501,
23505,
23542,
23566,
23569,
23628,
23631,
23663,
23667,
23702,
23726,
23740,
23807,
23837,
23853,
23859,
23863,
23867,
23918,
23926,
23928,
23929,
23949,
23953,
23975,
23978,
23998,
24048,
24052,
24055,
24071,
24082,
24146,
24150,
24188,
24192,
24243,
24247,
24319,
24327,
24366,
24367,
24371,
24449,
24457,
24458,
24486,
24490,
24559,
24563,
24564,
24572,
24614,
24615,
24619,
24648,
24652,
24653,
24665,
24714,
24752,
24753,
24757,
24840,
24860,
24951,
24968,
24972,
24988,
24990,
24994,
24995,
25019,
25023,
25058,
25062,
25097,
25137,
25180,
25184,
25219,
25271,
25290,
25369,
25376,
25405,
25438,
25471,
25509,
25516,
25521,
25522,
25543,
25545,
25546,
25618,
25622,
25664,
25667,
25709,
25787,
25850,
25930,
26007,
26075,
26154,
26232,
26309,
26345,
26349,
26391,
26425,
26426,
26442,
26446,
26485,
26493,
26535,
26726,
26730,
26754,
26758,
26765,
26769,
26806,
26818,
26848,
27011,
27067,
27071,
27095,
27099,
27106,
27110,
27143,
27147,
27232,
27236,
27260,
27312,
27319,
27324,
27326,
27327,
27331,
27379,
27383,
27431,
27465,
27544,
27545,
27576,
27631,
27635,
27727,
27755,
27781,
27825,
27877,
27884,
27905,
27925,
27949,
27953,
28027,
28075,
28139,
28144,
28145,
28204,
28230,
28278,
28334,
28389,
28396,
28417,
28437,
28465,
28469,
28539,
28567,
28635,
28640,
28641,
28697,
28762,
28783,
28803,
28811,
28859,
28943,
28975,
28980,
28981,
29040,
29108,
29129,
29149,
29167,
29195,
29199,
29273,
29277,
29345,
29357,
29362,
29363,
29424,
29428,
29474,
29506,
29576,
29597,
29616,
29646,
29710,
29715,
29716,
29780,
29784,
29826,
29854,
29922,
29943,
29962,
29995,
30082,
30087,
30088,
30092,
30154,
30158,
30206,
30218,
30289,
30310,
30330,
30338,
30402,
30506,
30514,
30519,
30520,
30552,
30580,
30582,
30583,
30587,
30633,
30637,
30679,
30739,
30743,
30797,
30821,
30823,
30824,
30828,
30866,
30870,
30916,
30928,
30988,
31042,
31073,
31129,
31161,
31163,
31164,
31168,
31207,
31211,
31258,
31296,
31298,
31299,
31303,
31341,
31345,
31392,
31408,
31443,
31455,
31459,
31460,
31476,
31510,
31511,
31562,
31611,
31615,
31647,
31691,
31742,
31744,
31745,
31749,
31787,
31791,
31838,
31872,
31873,
31921,
31972,
31976,
32011,
32027,
32080,
32081,
32129,
32178,
32182,
32216,
32232,
32283,
32285,
32286,
32290,
32294,
32352,
32360,
32364,
32414,
32418,
32479,
32483,
32536,
32548,
32552,
32554,
32555,
32587,
32591,
32663,
32666,
32683,
32758,
32796,
32800,
32859,
32863,
32913,
32969,
32995,
33015,
33019,
33044,
33046,
33047,
33051,
33122,
33125,
33151,
33226,
33264,
33268,
33336,
33340,
33390,
33402,
33433,
33452,
33454,
33474,
33475,
33479,
33522,
33526,
33570,
33578,
33597,
33598,
33602,
33681,
33705,
33776,
33841,
33880,
33886,
33890,
33891,
33895,
33954,
33958,
34023,
34031,
34050,
34089,
34093,
34149,
34157,
34192,
34208,
34216,
34220,
34222,
34282,
34283,
34287,
34357,
34360,
34416,
34420,
34498,
34530,
34563,
34609,
34656,
34660,
34712,
34737,
34776,
34780,
34818,
34894,
34931,
35278,
35299,
35304,
35354,
35426,
35428,
35429,
35433,
35492,
35495,
35550,
35554,
35632,
35664,
35738,
35767,
35795
],
"line_end_idx": [
24,
36,
50,
56,
57,
61,
70,
120,
124,
125,
127,
162,
167,
202,
203,
227,
231,
258,
262,
300,
319,
351,
371,
419,
422,
825,
837,
884,
909,
985,
1250,
1256,
1330,
1824,
1836,
1862,
1884,
1885,
1928,
1931,
2357,
2366,
2367,
2414,
2638,
2644,
2645,
2698,
2701,
3502,
3520,
3542,
3543,
3604,
3824,
3846,
3847,
3859,
3920,
4227,
4249,
4250,
4268,
4330,
4784,
4871,
4872,
4894,
4895,
4901,
4944,
4986,
4989,
5059,
5062,
5241,
5247,
5255,
5268,
5277,
5278,
5329,
5609,
5630,
5634,
5636,
5637,
5641,
5668,
5672,
5699,
5702,
5751,
5760,
5812,
5840,
5920,
5923,
5970,
5991,
6012,
6017,
6074,
6097,
6136,
6141,
6197,
6200,
6236,
6239,
6278,
6287,
6292,
6359,
6391,
6394,
6431,
6434,
6439,
6454,
6526,
6549,
6588,
6609,
6615,
6660,
6661,
6688,
6750,
6792,
6834,
6904,
6961,
6981,
7017,
7048,
7053,
7119,
7174,
7178,
7226,
7242,
7284,
7289,
7359,
7418,
7422,
7474,
7482,
7524,
7529,
7537,
7607,
7666,
7670,
7722,
7730,
7772,
7777,
7785,
7856,
7916,
7920,
7973,
7981,
8023,
8028,
8032,
8033,
8069,
8101,
8161,
8205,
8294,
8351,
8408,
8444,
8449,
8450,
8462,
8479,
8481,
8482,
8490,
8494,
8558,
8566,
8569,
8639,
8659,
8663,
8725,
8793,
8795,
8796,
8860,
8864,
8897,
8901,
8934,
8950,
8987,
9031,
9038,
9043,
9045,
9046,
9050,
9078,
9082,
9110,
9126,
9138,
9190,
9224,
9231,
9247,
9313,
9347,
9385,
9392,
9408,
9456,
9493,
9531,
9538,
9550,
9555,
9557,
9558,
9594,
9598,
9643,
9646,
9663,
9699,
9703,
9742,
9766,
9823,
9827,
9868,
9892,
9939,
9945,
9949,
9970,
9972,
9973,
10037,
10041,
10082,
10086,
10133,
10214,
10226,
10267,
10323,
10377,
10383,
10446,
10507,
10513,
10694,
10745,
10876,
10880,
10955,
11011,
11062,
11066,
11068,
11069,
11073,
11123,
11126,
11151,
11185,
11188,
11214,
11247,
11251,
11305,
11309,
11388,
11428,
11450,
11488,
11524,
11604,
11733,
11739,
11743,
11762,
11764,
11765,
11849,
11853,
11888,
11892,
11927,
11971,
11993,
12014,
12081,
12086,
12103,
12105,
12106,
12110,
12186,
12189,
12206,
12252,
12256,
12316,
12347,
12348,
12352,
12403,
12515,
12566,
12690,
12694,
12695,
12725,
12837,
12897,
12956,
12961,
12989,
12991,
12992,
12996,
13060,
13064,
13146,
13221,
13297,
13336,
13367,
13399,
13424,
13463,
13542,
13750,
13869,
13874,
13875,
13879,
13916,
13920,
13947,
13955,
14025,
14154,
14218,
14223,
14224,
14301,
14377,
14456,
14473,
14514,
14553,
14557,
14593,
14625,
14696,
14757,
14764,
14769,
14770,
14818,
14894,
14928,
15019,
15103,
15183,
15345,
15434,
15440,
15537,
15605,
15611,
15615,
15719,
15738,
15740,
15741,
15745,
15821,
15825,
15896,
15972,
15985,
16025,
16093,
16218,
16224,
16228,
16230,
16231,
16235,
16316,
16319,
16349,
16393,
16418,
16457,
16481,
16553,
16589,
16593,
16664,
16672,
16676,
16765,
16769,
16981,
17033,
17035,
17036,
17040,
17116,
17119,
17149,
17193,
17218,
17257,
17260,
17277,
17316,
17352,
17356,
17420,
17428,
17432,
17501,
17505,
17639,
17651,
17684,
17714,
17718,
17722,
17805,
17853,
17878,
17880,
17881,
17885,
17961,
17964,
17994,
18038,
18063,
18102,
18106,
18177,
18181,
18308,
18412,
18414,
18415,
18419,
18494,
18497,
18569,
18616,
18619,
18649,
18693,
18718,
18757,
18760,
18778,
18815,
18819,
18901,
18980,
19049,
19108,
19183,
19185,
19186,
19190,
19229,
19233,
19249,
19311,
19357,
19486,
19559,
19647,
19651,
19653,
19654,
19658,
19736,
19739,
19769,
19791,
19816,
19838,
19841,
19859,
19883,
19887,
19951,
20029,
20030,
20074,
20123,
20127,
20128,
20153,
20157,
20217,
20225,
20265,
20290,
20294,
20341,
20353,
20366,
20367,
20397,
20401,
20449,
20465,
20478,
20479,
20507,
20527,
20539,
20593,
20629,
20670,
20678,
20686,
20699,
20703,
20753,
20801,
20809,
20822,
20826,
20850,
20877,
20881,
20882,
20960,
21022,
21059,
21061,
21062,
21078,
21082,
21127,
21130,
21150,
21158,
21227,
21258,
21266,
21270,
21306,
21334,
21402,
21429,
21492,
21521,
21529,
21533,
21582,
21590,
21591,
21645,
21649,
21726,
21730,
21731,
21755,
21807,
21882,
21972,
22053,
22134,
22135,
22139,
22196,
22204,
22232,
22313,
22317,
22344,
22348,
22426,
22438,
22529,
22533,
22542,
22546,
22624,
22644,
22735,
22739,
22740,
22776,
22846,
22850,
22907,
22915,
22919,
22920,
22932,
22979,
23019,
23020,
23024,
23085,
23089,
23116,
23120,
23121,
23133,
23180,
23216,
23217,
23225,
23259,
23260,
23276,
23353,
23411,
23457,
23458,
23470,
23490,
23492,
23493,
23497,
23501,
23505,
23542,
23566,
23569,
23628,
23631,
23663,
23667,
23702,
23726,
23740,
23807,
23837,
23853,
23859,
23863,
23867,
23918,
23926,
23928,
23929,
23949,
23953,
23975,
23978,
23998,
24048,
24052,
24055,
24071,
24082,
24146,
24150,
24188,
24192,
24243,
24247,
24319,
24327,
24366,
24367,
24371,
24449,
24457,
24458,
24486,
24490,
24559,
24563,
24564,
24572,
24614,
24615,
24619,
24648,
24652,
24653,
24665,
24714,
24752,
24753,
24757,
24840,
24860,
24951,
24968,
24972,
24988,
24990,
24994,
24995,
25019,
25023,
25058,
25062,
25097,
25137,
25180,
25184,
25219,
25271,
25290,
25369,
25376,
25405,
25438,
25471,
25509,
25516,
25521,
25522,
25543,
25545,
25546,
25618,
25622,
25664,
25667,
25709,
25787,
25850,
25930,
26007,
26075,
26154,
26232,
26309,
26345,
26349,
26391,
26425,
26426,
26442,
26446,
26485,
26493,
26535,
26726,
26730,
26754,
26758,
26765,
26769,
26806,
26818,
26848,
27011,
27067,
27071,
27095,
27099,
27106,
27110,
27143,
27147,
27232,
27236,
27260,
27312,
27319,
27324,
27326,
27327,
27331,
27379,
27383,
27431,
27465,
27544,
27545,
27576,
27631,
27635,
27727,
27755,
27781,
27825,
27877,
27884,
27905,
27925,
27949,
27953,
28027,
28075,
28139,
28144,
28145,
28204,
28230,
28278,
28334,
28389,
28396,
28417,
28437,
28465,
28469,
28539,
28567,
28635,
28640,
28641,
28697,
28762,
28783,
28803,
28811,
28859,
28943,
28975,
28980,
28981,
29040,
29108,
29129,
29149,
29167,
29195,
29199,
29273,
29277,
29345,
29357,
29362,
29363,
29424,
29428,
29474,
29506,
29576,
29597,
29616,
29646,
29710,
29715,
29716,
29780,
29784,
29826,
29854,
29922,
29943,
29962,
29995,
30082,
30087,
30088,
30092,
30154,
30158,
30206,
30218,
30289,
30310,
30330,
30338,
30402,
30506,
30514,
30519,
30520,
30552,
30580,
30582,
30583,
30587,
30633,
30637,
30679,
30739,
30743,
30797,
30821,
30823,
30824,
30828,
30866,
30870,
30916,
30928,
30988,
31042,
31073,
31129,
31161,
31163,
31164,
31168,
31207,
31211,
31258,
31296,
31298,
31299,
31303,
31341,
31345,
31392,
31408,
31443,
31455,
31459,
31460,
31476,
31510,
31511,
31562,
31611,
31615,
31647,
31691,
31742,
31744,
31745,
31749,
31787,
31791,
31838,
31872,
31873,
31921,
31972,
31976,
32011,
32027,
32080,
32081,
32129,
32178,
32182,
32216,
32232,
32283,
32285,
32286,
32290,
32294,
32352,
32360,
32364,
32414,
32418,
32479,
32483,
32536,
32548,
32552,
32554,
32555,
32587,
32591,
32663,
32666,
32683,
32758,
32796,
32800,
32859,
32863,
32913,
32969,
32995,
33015,
33019,
33044,
33046,
33047,
33051,
33122,
33125,
33151,
33226,
33264,
33268,
33336,
33340,
33390,
33402,
33433,
33452,
33454,
33474,
33475,
33479,
33522,
33526,
33570,
33578,
33597,
33598,
33602,
33681,
33705,
33776,
33841,
33880,
33886,
33890,
33891,
33895,
33954,
33958,
34023,
34031,
34050,
34089,
34093,
34149,
34157,
34192,
34208,
34216,
34220,
34222,
34282,
34283,
34287,
34357,
34360,
34416,
34420,
34498,
34530,
34563,
34609,
34656,
34660,
34712,
34737,
34776,
34780,
34818,
34894,
34931,
35278,
35299,
35304,
35354,
35426,
35428,
35429,
35433,
35492,
35495,
35550,
35554,
35632,
35664,
35738,
35767,
35795,
35796
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 35796,
"ccnet_original_nlines": 1076,
"rps_doc_curly_bracket": 0.004022799897938967,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11054565757513046,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01088493037968874,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5473565459251404,
"rps_doc_frac_unique_words": 0.47560620307922363,
"rps_doc_mean_word_length": 7.086181640625,
"rps_doc_num_sentences": 257,
"rps_doc_symbol_to_word_ratio": 0.00749222980812192,
"rps_doc_unigram_entropy": 6.527866363525391,
"rps_doc_word_count": 3423,
"rps_doc_frac_chars_dupe_10grams": 0.037392809987068176,
"rps_doc_frac_chars_dupe_5grams": 0.10512863099575043,
"rps_doc_frac_chars_dupe_6grams": 0.09082289040088654,
"rps_doc_frac_chars_dupe_7grams": 0.07334268093109131,
"rps_doc_frac_chars_dupe_8grams": 0.04893634840846062,
"rps_doc_frac_chars_dupe_9grams": 0.037392809987068176,
"rps_doc_frac_chars_top_2gram": 0.008616420440375805,
"rps_doc_frac_chars_top_3gram": 0.006266490090638399,
"rps_doc_frac_chars_top_4gram": 0.007255940232425928,
"rps_doc_books_importance": -3512.4814453125,
"rps_doc_books_importance_length_correction": -3512.4814453125,
"rps_doc_openwebtext_importance": -1608.1856689453125,
"rps_doc_openwebtext_importance_length_correction": -1608.1856689453125,
"rps_doc_wikipedia_importance": -1759.292236328125,
"rps_doc_wikipedia_importance_length_correction": -1759.292236328125
},
"fasttext": {
"dclm": 0.9602499604225159,
"english": 0.3506361246109009,
"fineweb_edu_approx": 2.892303705215454,
"eai_general_math": 0.4133983850479126,
"eai_open_web_math": 0.21609395742416382,
"eai_web_code": 0.7864691019058228
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,102,224,527,587,323,400 |
aboutsummaryrefslogtreecommitdiffstats
path: root/com32/lib/MCONFIG
blob: 781292ba13e4cc2a6c84b587e259553f88d8056a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
# -*- makefile -*-
TMPFILE = $(shell mktemp /tmp/gcc_ok.XXXXXX)
gcc_ok = $(shell tmpf=$(TMPFILE); if gcc $(1) -c -x c /dev/null -o $$tmpf 2>/dev/null; \
then echo $(1); else echo $(2); fi; rm -f $$tmpf)
GCCOPT := $(call gcc_ok,-m32,) $(call gcc_ok,-fno-stack-protector,)
CC = gcc
LD = ld
INCLUDE = -I.
AR = ar
RANLIB = ranlib
NM = nm
PERL = perl
STRIP = strip --strip-all -R .comment -R .note
OBJCOPY = objcopy
# zlib and libpng configuration flags
LIBFLAGS = -DDYNAMIC_CRC_TABLE -DPNG_NO_CONSOLE_IO \
-DPNG_NO_WRITE_SUPPORTED \
-DPNG_NO_MNG_FEATURES \
-DPNG_NO_READ_tIME -DPNG_NO_WRITE_tIME
# We need some features in libpng which apparently aren't available in the
# fixed-point versions. It's OK, because we have to have a non-graphical
# fallback anyway, just use that on old machines...
# LIBFLAGS += -DPNG_NO_FLOATING_POINT_SUPPORTED
REQFLAGS = $(GCCOPT) -g -mregparm=3 -DREGPARM=3 -D__COM32__ -I. -I./sys -I../include
OPTFLAGS = -Os -march=i386 -falign-functions=0 -falign-jumps=0 \
-falign-labels=0 -ffast-math -fomit-frame-pointer
WARNFLAGS = -W -Wall -Wpointer-arith -Wwrite-strings -Wstrict-prototypes -Winline
CFLAGS = -Wp,-MT,$@,-MD,$(dir $@).$(notdir $@).d $(OPTFLAGS) \
$(REQFLAGS) $(WARNFLAGS) $(LIBFLAGS)
LDFLAGS = -m elf32_i386
.SUFFIXES: .c .o .a .so .lo .i .S .s .ls .ss .lss
% : %.c # Cancel default rule
% : %.S
.c.o:
$(CC) $(CFLAGS) -c -o $@ $<
.c.i:
$(CC) $(CFLAGS) -E -o $@ $<
.c.s:
$(CC) $(CFLAGS) -S -o $@ $<
.S.o:
$(CC) $(CFLAGS) -D__ASSEMBLY__ -c -o $@ $<
.S.s:
$(CC) $(CFLAGS) -D__ASSEMBLY__ -E -o $@ $<
.S.lo:
$(CC) $(CFLAGS) $(SOFLAGS) -D__ASSEMBLY__ -c -o $@ $<
.S.ls:
$(CC) $(CFLAGS) $(SOFLAGS) -D__ASSEMBLY__ -E -o $@ $<
.s.o:
$(CC) $(CFLAGS) -x assembler -c -o $@ $<
.ls.lo:
$(CC) $(CFLAGS) $(SOFLAGS) -x assembler -c -o $@ $<
.c.lo:
$(CC) $(CFLAGS) $(SOFLAGS) -c -o $@ $<
.c.ls:
$(CC) $(CFLAGS) $(SOFLAGS) -S -o $@ $<
|
{
"url": "https://git.zytor.com/users/alekdu/syslinux.git/.git/tree/com32/lib/MCONFIG?id=1d81d5e3944dd5ac912150bc705fa7259eade541",
"source_domain": "git.zytor.com",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "13378",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5CJM3FUNRM2XGHLIFSSI67Q3FVIAWGXH",
"WARC-Concurrent-To": "<urn:uuid:0b49d411-dc96-4d01-9652-d3266ba626ba>",
"WARC-Date": "2021-06-12T21:24:55Z",
"WARC-IP-Address": "198.137.202.136",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YQ6X45GORF64AWAECKZCEWKGDYKNICRF",
"WARC-Record-ID": "<urn:uuid:c6c08b0a-2ccc-4f6c-b2e1-12addc6529b8>",
"WARC-Target-URI": "https://git.zytor.com/users/alekdu/syslinux.git/.git/tree/com32/lib/MCONFIG?id=1d81d5e3944dd5ac912150bc705fa7259eade541",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8b528242-5ec1-4859-921f-d50e713a0fb0>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-234.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,
39,
68,
123,
125,
127,
129,
131,
133,
135,
137,
139,
141,
144,
147,
150,
153,
156,
159,
162,
165,
168,
171,
174,
177,
180,
183,
186,
189,
192,
195,
198,
201,
204,
207,
210,
213,
216,
219,
222,
225,
228,
231,
234,
237,
240,
243,
246,
249,
252,
255,
258,
261,
264,
267,
270,
273,
276,
279,
282,
285,
288,
291,
294,
297,
300,
303,
306,
309,
312,
315,
318,
321,
324,
327,
330,
333,
336,
339,
342,
345,
364,
365,
410,
411,
501,
554,
555,
623,
624,
633,
641,
655,
663,
679,
687,
699,
746,
764,
765,
803,
856,
887,
915,
958,
959,
1034,
1108,
1160,
1208,
1209,
1295,
1361,
1416,
1498,
1499,
1563,
1603,
1627,
1628,
1678,
1679,
1709,
1710,
1718,
1719,
1725,
1754,
1755,
1761,
1790,
1791,
1797,
1826,
1827,
1833,
1877,
1878,
1884,
1928,
1929,
1936,
1991,
1992,
1999,
2054,
2055,
2061,
2103,
2104,
2112,
2165,
2166,
2173,
2213,
2214,
2221
],
"line_end_idx": [
39,
68,
123,
125,
127,
129,
131,
133,
135,
137,
139,
141,
144,
147,
150,
153,
156,
159,
162,
165,
168,
171,
174,
177,
180,
183,
186,
189,
192,
195,
198,
201,
204,
207,
210,
213,
216,
219,
222,
225,
228,
231,
234,
237,
240,
243,
246,
249,
252,
255,
258,
261,
264,
267,
270,
273,
276,
279,
282,
285,
288,
291,
294,
297,
300,
303,
306,
309,
312,
315,
318,
321,
324,
327,
330,
333,
336,
339,
342,
345,
364,
365,
410,
411,
501,
554,
555,
623,
624,
633,
641,
655,
663,
679,
687,
699,
746,
764,
765,
803,
856,
887,
915,
958,
959,
1034,
1108,
1160,
1208,
1209,
1295,
1361,
1416,
1498,
1499,
1563,
1603,
1627,
1628,
1678,
1679,
1709,
1710,
1718,
1719,
1725,
1754,
1755,
1761,
1790,
1791,
1797,
1826,
1827,
1833,
1877,
1878,
1884,
1928,
1929,
1936,
1991,
1992,
1999,
2054,
2055,
2061,
2103,
2104,
2112,
2165,
2166,
2173,
2213,
2214,
2221,
2260
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2260,
"ccnet_original_nlines": 156,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11010558158159256,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.12971341609954834,
"rps_doc_frac_lines_end_with_ellipsis": 0.006369430106133223,
"rps_doc_frac_no_alph_words": 0.5972850918769836,
"rps_doc_frac_unique_words": 0.7006579041481018,
"rps_doc_mean_word_length": 4.532894611358643,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0.012066369876265526,
"rps_doc_unigram_entropy": 5.085186004638672,
"rps_doc_word_count": 304,
"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.06386066973209381,
"rps_doc_frac_chars_top_3gram": 0.054426711052656174,
"rps_doc_frac_chars_top_4gram": 0.015965169295668602,
"rps_doc_books_importance": -280.9070129394531,
"rps_doc_books_importance_length_correction": -280.9070129394531,
"rps_doc_openwebtext_importance": -143.00047302246094,
"rps_doc_openwebtext_importance_length_correction": -143.00047302246094,
"rps_doc_wikipedia_importance": -170.7676239013672,
"rps_doc_wikipedia_importance_length_correction": -170.7676239013672
},
"fasttext": {
"dclm": 0.6964308023452759,
"english": 0.27171221375465393,
"fineweb_edu_approx": 2.2482352256774902,
"eai_general_math": 0.5953815579414368,
"eai_open_web_math": 0.4224655032157898,
"eai_web_code": 0.16489994525909424
}
}
|
{
"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": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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
|
7,534,355,401,038,130,000 |
Custom Rescue Templates for Rails
• Posted by Mike Naberezny in Ruby
Ruby on Rails provides a nice feature for development that displays neatly formatted error screens when an exception is raised. This screen is very convenient because it can usually show the line number where the error occurred, different views of the backtrace, and other useful troubleshooting data including the environment, session, and request/response objects. Having this information is not only useful but provides a feeling of stability and more graceful error handling compared to something like PHP’s raw errors (enhanceable by xdebug).
The default Ruby on Rails error screens are very functional but are also quite plain. Some Rails developers, particularly those working on teams, may wish to tailor them to provide consistent styling with their application or to display additional application-specific information for the development environment.
The Rails error screens are generated by views bundled inside ActionController called rescue templates. David recently committed my first patch to Edge Rails in changeset 5243. Now, creating your own custom rescue templates is very straightforward.
Begin by copying the default rescue templates to a new directory under app/views in your Rails project. I recommend app/views/rescues. The rescue templates are found in ActionController, which is under vendor/rails for projects on Edge Rails or that have frozen Rails.
$ mkdir app/views/rescues
$ cp vendor/rails/actionpack/lib/action_controller/templates/rescues/* \
app/views/rescues
Next, add the following snippet to your ApplicationController:
protected
def rescues_path(template_name)
"#{template_root}/rescues/#{template_name}.rhtml"
end
The templates will now be taken from your app/views/rescues directory and can be modified to taste. To test, browse to any action that will raise an exception.
As of Rails 1.1.6, the instructions above will only work on Edge Rails but will work in the next stable version. See the ticket for more information to patch 1.1.6 and earlier versions.
You are encouraged to read the API documentation for ActionController::Rescue to understand how and when the rescue templates are rendered. It is important to note that for security, the rescue templates should never be shown to the public and thus only ever rendered when a request is considered local.
Update: This tutorial was featured on Riding Rails, the Ruby on Rails weblog.
Update: These instructions work with the stable release of Rails since 1.2.
Update: As of changeset 6120, template_root is now view_paths.first
2 comments
• comment by Mats Lindblad 12 Oct 07
Thank you for the write-up, I have a question though.
How do I select a layout?
The reason I ask is that we have an admin space as well as a public space and at the moment the error page has the admin theme which really isn’t the best choice.
Can I just do render :layout => “public” in rescues_path?
• comment by Michael Whittaker 14 Dec 07
Thanks a lot, I was searching google for something totally different but am glad I landed here :-)
Sorry, the comment form is closed at this time.
|
{
"url": "http://mikenaberezny.com/2006/10/09/custom-rescue-templates/",
"source_domain": "mikenaberezny.com",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "18070",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LQ6RETORNAIHKH27PQGFU4TXGLVJGQGY",
"WARC-Concurrent-To": "<urn:uuid:2aacec44-d6e0-4099-abe5-b51f51c814a8>",
"WARC-Date": "2020-02-27T05:54:02Z",
"WARC-IP-Address": "167.71.99.13",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:26CX6PV56PGHHYXWXWTXUCFXYK7FQRVM",
"WARC-Record-ID": "<urn:uuid:fe09580e-166f-439c-843b-a2db23a0e9d5>",
"WARC-Target-URI": "http://mikenaberezny.com/2006/10/09/custom-rescue-templates/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bcdaec44-35af-4377-8f52-83a9f01bb275>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-77.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,
35,
36,
73,
74,
626,
627,
945,
946,
1199,
1200,
1473,
1474,
1504,
1581,
1607,
1608,
1675,
1676,
1690,
1728,
1786,
1796,
1797,
1961,
1962,
2152,
2153,
2461,
2462,
2544,
2545,
2625,
2626,
2698,
2699,
2710,
2711,
2750,
2751,
2809,
2839,
3006,
3007,
3069,
3070,
3113,
3114,
3217,
3218
],
"line_end_idx": [
1,
35,
36,
73,
74,
626,
627,
945,
946,
1199,
1200,
1473,
1474,
1504,
1581,
1607,
1608,
1675,
1676,
1690,
1728,
1786,
1796,
1797,
1961,
1962,
2152,
2153,
2461,
2462,
2544,
2545,
2625,
2626,
2698,
2699,
2710,
2711,
2750,
2751,
2809,
2839,
3006,
3007,
3069,
3070,
3113,
3114,
3217,
3218,
3265
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3265,
"ccnet_original_nlines": 50,
"rps_doc_curly_bracket": 0.0012251100270077586,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35548174381256104,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014950170181691647,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17940199375152588,
"rps_doc_frac_unique_words": 0.5333333015441895,
"rps_doc_mean_word_length": 5.297916889190674,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.0033222599886357784,
"rps_doc_unigram_entropy": 5.137569904327393,
"rps_doc_word_count": 480,
"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.04128982126712799,
"rps_doc_frac_chars_top_3gram": 0.012976800091564655,
"rps_doc_frac_chars_top_4gram": 0.015729449689388275,
"rps_doc_books_importance": -228.21995544433594,
"rps_doc_books_importance_length_correction": -228.21995544433594,
"rps_doc_openwebtext_importance": -143.27052307128906,
"rps_doc_openwebtext_importance_length_correction": -143.27052307128906,
"rps_doc_wikipedia_importance": -147.77224731445312,
"rps_doc_wikipedia_importance_length_correction": -147.77224731445312
},
"fasttext": {
"dclm": 0.026321109384298325,
"english": 0.8984403014183044,
"fineweb_edu_approx": 1.3467375040054321,
"eai_general_math": 0.21884924173355103,
"eai_open_web_math": 0.23819899559020996,
"eai_web_code": 0.1375245451927185
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.