id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
-7,054,865,488,965,721,000 |
Why pureXML Still Matters
It is pretty clear that one of the key technologies of the moment is JSON. And this is reflected in many of the latest advances associated with DB2. Among the JSON-related developments in the DB2 space we have seen the RESTful web service support in DB2 for z/OS, the IBM Data Server Gateway for OData and the recent resurgence in JSON support in DB2 for LUW. And if you read large parts of the trade press you’d think that XML had been consigned to the history books : XML is “old and boring” and if you are a “cool kid” then JSON is all you need.
So, if you have spent time acquiring pureXML skills has all the effort been worthwhile? And if you haven’t yet gotten into XML, is there any point in learning it now? If you are involved in discussions with IBM on the future development of DB2, for example via a DB2 Technical Advisory Board or Customer Advisory Council, would there be any sense in asking IBM to fill in the remaining gaps in their support for the various XML standards? My answer to all three questions would be “YES” – XML still has a massive part to play and the capability of DB2 to support it will be critical for a long time to come. Let me try to explain why I believe this is the case.
JSON and XML are not just slightly different ways of doing the same thing. This is a common misunderstanding, probably caused by the superficial similarities between the text representation of JSON and XML. Folks who have this viewpoint normally then go on to point out that the JSON representation has less characters than the XML representation, and therefore JSON is better. There is a lot more to XML than just this textual representation, and only when you understand this will you start to realise its power. Here are some important aspects of XML which bear thinking about –
• XML Schemas – the ability to validate that XML conforms to a certain structure is useful in a wide variety of situations. In the simplest form, simply being able to check that the XML has arrived undamaged is a benefit. But much more significant is the use of XML Schema as a means of defining data interchange standards which all providers and consumers of services can follow. In some ways, this can be thought of as a contract between the parties – as long as the consumer follows the standard defined in the XML schema the service provider will be able to respond to their requests in a way they can understand. The fact that there are XML Schema based standards for every conceivable business sector shows both the importance and the relevance of this part of the XML standard
• XML Namespaces – the capability to combine different elements from different XML Schemas into other documents while providing a means of differentiating between them is critical to the success of data interchangeability in complex situations, particularly when building interfaces between different business domains. For example, a “page” means a totally different thing to a DB2 DBA and an author of a book – everything is fine until someone writes a book on DB2 memory management and he refers to both in equal measure. By applying a namespace (giving context) to the use of the term the confusion disappears.
• XPath – having a query language whcih succinctly allows you to access any part of an XML is a very powerful feature. And when multi-document access using languages such as XQuery and SQL/XML, which rely on XPath as their basis, are added to the mix then the power becomes even greater. Many people are not aware of the full power of XPath, with its many built-in functions and the concept of axes (referring to one component based on its relationship to others), but time spent exploring this is extremely worthwhile.
• XSL – being able to transform an XML into another format (XML and non-XML) using the XML Stylesheet Language is a part of the XML ecosystem that is underestimated in terms of its usefulness.
It is interesting to see that as JSON has evolved, there has been efforts to (or at least talk of) providing features similar to all of the above XML capabilities. It is also noticeable that most of these efforts are not progressing very rapidly. I believe that this is because the principal use cases for JSON are different from those for XML in most cases, and the additional of XML-like functionality actually detracts from the JSON-specific benefits. Also the main advocates of JSON use are very different from those of XML, with JSON being largely driven by application developer requirements whereas XML has a wider following in the data management and standards communities.
Probably the biggest benefit of JSON is that it has a structure which is directly useable by most common programming languages, built around arrays (simple and associative). So for application-to-application, and particularly for intra-application (e.g. AJAX), data transfers it is ideal. But when it comes to complex interactions, particularly involving multiple parties, the additional features of XML soon become invaluable. Also when it comes to long term storage, XML features are beneficial, particularly in terms of the ability to validate the XML and to perform queries across XML document sets.
So should I be focusing my learning efforts on JSON or on XML? I would suggest that the answer to this is very dependent on your use cases. If you are supporting developers who are producing dynamic web or mobile applications then having a knowledge of JSON and what support DB2 provides in this space will be critical. If your focus is more on B2B applications, or applications where conforming to an industry standard is important them XML is going to be your tool of choice.
It will be interesting to see where the two technologies go in the years ahead. I would expect that once the current JSON hype dies down we will find both technologies being used to their strengths. I would be surprised if JSON ever acquired all the additional features that XML has, because this would introduce overheads that would lessen its usefulness in its principal intra-application use case.
What I think we can expect is much more native support for JSON inside all the DB2 products. If I were to give a priority to the requirements then it would be –
• Functionality within SQL to both construct and consume JSON. This is because JSON is typically used as the method of choice for AJAX operations, where both the request and response is in JSON format. I believe there is a lot to be gained by pushing more of the processing down into the data layer. I’ve always been a big advocate of the use of stored procedures as “data services” and have had good success with using them in XML-based service environments. Being able to build JSON services in the same way would, I believe, make integrating AJAX toolkits with DB2 much easier. The focus of DB2 development in this space at the moment seems to be largely on JSON consumption, at the expense of JSON construction. I believe that both are needed to make this a viable pattern
• Closer integration between middleware and DB2 to provide the speedy response that microservices need. We are already seeing this integration happening on both platforms, with facilities becoming available to provide microservices on top of both DB2 tables and stored procedures appearing in both DB2 for z/OS and DB2 for LUW. In my opinion the ability to expose stored procedures as microservices will become more important than tables, since there are only a small number of use cases that can be satisfied by single table access (although this can be extended in some types of service by the use of views).
• Support for a native JSON data type within procedural SQL languages. In light of the fact that I believe there will be a need to expose stored procedures as microservices, having direct support for JSON structures, via their component arrays, in procedural languages is going to be necessary for performance. Note that because the underlying structure of JSON is based on arrays, the support for the various array types in SQL is really a prerequisite to this. In other words, it isn’t simply a different form of the parsed and modified DOM tree that is used by pureXML.
• Support for a native JSON data type in DB2 tables. You’ll notice that I’ve separated this out from the support in procedural languages. This is deliberate since I believe that the need to store JSON when it is being used as an intra-application data interchange method is not as common as when XML is being used in a B2B setting. However, over time I expect there will be more occasions where JSON storage will be required, as regulation continues to tighten the requirement for audit. If some of the features of XML which make it more appropriate for B2B solutions were to find their way into JSON then this also would be more likely to require JSON storage. It is also becoming common for JSON to be used as a storage format for Big Data solutions, and again this would be a situation where storage of JSON in a native format in DB2 would make sense.
I would hope that the focus on adding JSON support to DB2 will not be at the expense of continuing to enhance the pureXML support. Admittedly JSON support needs the most work, and I am pleased to see IBM taking this seriously. But there are still some aspects of the XML standard which are not supported by pureXML, and also a need to standardize the offering across the DB2 family.
Hopefully this article will encourage learning both pureXML and JSON, and that thought will be given as to what is the best solution for any particular use case, rather than be caught up in the latest hype for one particular technology.
1 Like
Recent Stories
Pattern Matching using Regular Expression and Utilizing Services outside Db2 for z/OS
How to get started with Db2 for z/OS and Apache Spark on a distributed platform
Db2 12 for z/OS – Two Highly Requested SQL Enhancements – Part 2
|
{
"url": "http://www.idug.org/p/bl/et/blogid=278&blogaid=637",
"source_domain": "www.idug.org",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "28337",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IK4UL535JSAUMNLO7QPCGLI7MFIPNU7N",
"WARC-Concurrent-To": "<urn:uuid:451e5f1d-4825-46be-9220-d0ba2e485e6e>",
"WARC-Date": "2017-09-22T09:39:36Z",
"WARC-IP-Address": "173.203.62.98",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PC6YBAAL627A2JXVY5X6YSJT3JUFQPOR",
"WARC-Record-ID": "<urn:uuid:1e01fcfe-981e-4c40-9573-6201cd5eb4f9>",
"WARC-Target-URI": "http://www.idug.org/p/bl/et/blogid=278&blogaid=637",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9bf91500-7eee-4d4d-9133-9d820a34678f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-148-78-95.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
26,
27,
576,
577,
1242,
1243,
1825,
1826,
2612,
3228,
3750,
3945,
3946,
4628,
4629,
5233,
5234,
5712,
5713,
6114,
6115,
6276,
6277,
7056,
7669,
8244,
9101,
9102,
9485,
9486,
9723,
9724,
9731,
9746,
9832,
9833,
9913,
9914
],
"line_end_idx": [
26,
27,
576,
577,
1242,
1243,
1825,
1826,
2612,
3228,
3750,
3945,
3946,
4628,
4629,
5233,
5234,
5712,
5713,
6114,
6115,
6276,
6277,
7056,
7669,
8244,
9101,
9102,
9485,
9486,
9723,
9724,
9731,
9746,
9832,
9833,
9913,
9914,
9978
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9978,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4973958432674408,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0755208283662796,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09270832687616348,
"rps_doc_frac_unique_words": 0.3375503122806549,
"rps_doc_mean_word_length": 4.635422706604004,
"rps_doc_num_sentences": 66,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.477907180786133,
"rps_doc_word_count": 1739,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.017119459807872772,
"rps_doc_frac_chars_dupe_6grams": 0.017119459807872772,
"rps_doc_frac_chars_dupe_7grams": 0.00744325015693903,
"rps_doc_frac_chars_dupe_8grams": 0.00744325015693903,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009924329817295074,
"rps_doc_frac_chars_top_3gram": 0.004465950187295675,
"rps_doc_frac_chars_top_4gram": 0.0037216199561953545,
"rps_doc_books_importance": -962.254638671875,
"rps_doc_books_importance_length_correction": -962.254638671875,
"rps_doc_openwebtext_importance": -624.672607421875,
"rps_doc_openwebtext_importance_length_correction": -624.672607421875,
"rps_doc_wikipedia_importance": -448.36322021484375,
"rps_doc_wikipedia_importance_length_correction": -448.36322021484375
},
"fasttext": {
"dclm": 0.02045661024749279,
"english": 0.9637027978897095,
"fineweb_edu_approx": 1.99468994140625,
"eai_general_math": 0.6884588003158569,
"eai_open_web_math": 0.36877763271331787,
"eai_web_code": 0.5230609178543091
}
}
|
{
"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": "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": "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": "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
|
-3,512,612,696,482,747,000 |
I was hoping by now to share some thoughts on a new MacBook Pro line as we're almost at the end of the back to school buying season, however, there is nothing to share. While we wait to see when, how or even if the MacBook Pro line gets an update, I could speculate as to why the delays or discuss upgrade cycles, and, speculate on future product designs or features.
Instead, I thought I'd talk about a book by a different author. I've been using a Microsoft Surface Book for a little over a week now as my primary computing device. My quick, quick take? Surface Book is arguably one of the very best laptops on the market today, on par with the best of Apple's current line — with a few interesting tricks.
The Surface product line always had a clear, if controversial, message. It was the tablet that could also be your computer. (Of course today Apple markets the iPad Pro as a computer so is that a tablet that's also a computer? Just what is a computer?) Surface Book has a different philosophy, it's a traditional laptop form factor, with Microsoft's equivalent of a Retina display (and a higher pixel density than a MacBook Pro). The display is also touch sensitive, comes with a pen capable of 1024 levels of pressure, and runs the full version of Windows Anniversary edition. Oh, the screen also detaches to become an independent tablet, sort of like the saucer separation from the rest of the Enterprise. The Surface Book is definitely a PC first, a tablet second, and that's an interesting combination.
The Surface Book is roughly the size and weight of a 13" MacBook Pro. The screen is a somewhat unusual 3:2 aspect ratio. Design, and build quality are excellent, the keyboard has a nice feel. Most importantly, this is a Windows PC with a really great trackpad. It took forever, but it's here.
My unit is an i5 with a 256GB SSD. There are various configurations with and without a dedicated GPU, with prices that go up and down accordingly. I don't think I'd want to play heavy duty games on this thing, but I wouldn't on a MacBook Pro either. Microsoft claims around 13 hours of battery life. I didn't do a specific battery test, but I easily worked through a long day with power to spare.
So it's a pretty great Windows machine. The magic happens when you press a button on the keyboard, wait a moment for the light to turn green, and off comes the screen turning it into a 1.6-pound tablet (or, as Microsoft calls it, a clipboard). Battery life in tablet mode is around three to four hours. Not good enough for a dedicated device, but more than acceptable for a companion tool. Windows Anniversary is quite adept at switching from a UI optimized for a traditional form factor to a UI optimized for a tablet. WAE also has some nice support for pen apps integrated directly into the OS. The pen also is held magnetically to the side of the tablet, therefore it's a lot harder to lose. Battery life is rated at one year with replaceable batteries instead of charging. I could make a case for both philosophies but the Microsoft Pen doesn't have a cap easily lost when charging. (Apple Pencil team, are you listening?) There are also different pen tips available for different writing experiences, although I did not get a chance to try them.
I'm not trying to compare Surface Books to MacBooks. They're written for different audiences, albeit with some overlapping use cases. Depending on how you use a traditional PC relative to a tablet, and your desire to care — and feed — two devices makes the cost/benefit different for everyone.
The beauty of Surface Book that I found was that if offered a fresh take on traditional laptop design, with features that aren't gratuitous but are well thought out. Surface Book isn't a Toaster/Fridge. I think of it more a refrigerator freezer, or clock radio. Two different functions living together in a single device, each delivering the appropriate experience (this is the last time I make a kitchen appliance metaphor … ever).
I doubt we'll see an equivalent product from Apple. A MacBook with a detachable screen that turned it into an iPad doesn't seem like it would be part of Apple's design philosophy. Nor would it make a whole lot of sense. That's not the point.
It's nice to see a major vendor taking a different spin on personal computing. It shows there's more than just thinner, lighter, faster or gratuitous differentiators. In short, it's cool to see Microsoft think different.
|
{
"url": "https://www.imore.com/judging-surfacebook-different-cover",
"source_domain": "www.imore.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "147915",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KLWIXPJZQUEMK75BIR6ENBUEROCZMMCT",
"WARC-Concurrent-To": "<urn:uuid:73f12795-7bab-43aa-a87a-9da9176625ec>",
"WARC-Date": "2022-01-16T19:05:10Z",
"WARC-IP-Address": "104.18.14.41",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EBZMXKINVR4DIP5CUFGHRLTSTEGN4LW7",
"WARC-Record-ID": "<urn:uuid:2f854a53-f260-4ed7-8283-5699b33ff747>",
"WARC-Target-URI": "https://www.imore.com/judging-surfacebook-different-cover",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8eb23b28-afa2-4874-9f12-e011e8769da5>"
},
"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-243\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
368,
369,
710,
711,
1517,
1518,
1811,
1812,
2209,
2210,
3261,
3262,
3556,
3557,
3990,
3991,
4233,
4234
],
"line_end_idx": [
368,
369,
710,
711,
1517,
1518,
1811,
1812,
2209,
2210,
3261,
3262,
3556,
3557,
3990,
3991,
4233,
4234,
4454
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4454,
"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.440463662147522,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029504740610718727,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14752371609210968,
"rps_doc_frac_unique_words": 0.4708121716976166,
"rps_doc_mean_word_length": 4.472081184387207,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.0010537400376051664,
"rps_doc_unigram_entropy": 5.3105268478393555,
"rps_doc_word_count": 788,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.00908058974891901,
"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.02185017056763172,
"rps_doc_frac_chars_top_3gram": 0.01106697041541338,
"rps_doc_frac_chars_top_4gram": 0.00908058974891901,
"rps_doc_books_importance": -410.93304443359375,
"rps_doc_books_importance_length_correction": -410.93304443359375,
"rps_doc_openwebtext_importance": -222.1282958984375,
"rps_doc_openwebtext_importance_length_correction": -222.1282958984375,
"rps_doc_wikipedia_importance": -160.06336975097656,
"rps_doc_wikipedia_importance_length_correction": -160.06336975097656
},
"fasttext": {
"dclm": 0.05289303883910179,
"english": 0.9651457667350769,
"fineweb_edu_approx": 1.2958226203918457,
"eai_general_math": 0.22542119026184082,
"eai_open_web_math": 0.1801764965057373,
"eai_web_code": 0.031790319830179214
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "14",
"label": "Reviews/Critiques"
},
"secondary": {
"code": "1",
"label": "News/Editorial"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,897,460,791,842,737,000 |
EJB : Java Glossary
*0-9ABCDEFGHIJKLMNOPQRSTUVWXYZ (all)
EJB
EJB (Enterprise Java Beans). EJBs (Enterprise Java Beanses) are used mainly by large corporations. They are not something to concern the fledgling Java programmer. They are complicated. I can only give an arm waving overview that won’t enlighten much. You have to study them in detail before you even begin to understand what they are for. EJBs are probably the most difficult part of Java.
Here is a rule of thumb. If your application is so complicated that it will have to be distributed over several servers, have a look at EJB. If not, use a simpler technology.
Enterprise beans don’t have a GUI (Graphic User Interface) interface. Enterprise Java Beans speak CORBA (Common Object Request Broker Architecture) IIOP (Invocation over Internet Inter-Orb Protocol) for their RMI (Remote Method Invocation). Session Beans maintain conversational context for one client. Entity beans cache data for one row of a database. Entity beans also provide a simple persistent object database, indexed by a primary key. The Entity bean learns its primary key at create time and may persist indefinitely. Beans make it easier to implement transaction logic with commit/rollback. The transaction processing logic helps keeps beans from interfering with each other. EJBs use JNDI to find objects. They use RMI (regular or IIOP Corba) to communicate between servers. They use JTA (Java Transaction Application programming interface) for transaction management.
The point of EJB is to fob much of the work of concurrency, transaction handling and persistence off on the container so the beans can concentrate on business logic.
There are several types of beans. This diagram outlines them:
bean types
Beans communicate via two proxy objects, one that implements the bean’s home (bean-finding) interface and one that implements its remote (business-logic) interface. The indirection allows the EJB container to intercept the calls and add functionality such as persistence.
Bean Flavours
EJBs come in a number of flavors.
1. Entity beans
Entity beans are used to represent data in a database. There are two flavors of entity beans, BMP (Bitmap) and ( CMP (Container Managed Persistence)). With CMP the container handles generating all the SQL (Standard Query Language). With BMP you have to write the SQL. A typical simple use-case is that a single instance of an entity bean represents a row in a database. Many people have soured on entity beans and prefer a simpler approach like Hibernate. In fact, the new EJB specifications endeavor to make entity beans more like Hibernate.
2. Session beans
Session beans are essentially service providers. A typical use-case is to encapsulate high-level business logic. For example, a session bean for a bank might implement an electronic transfer. Session beans can be stateful or stateless. A stateful session bean maintains a conversational state between itself and the client. A stateless session bean does not; a client might get completely different bean instances from one call to the next, even with the same handle.
3. MDB (Message-Driven Bean) ( MDB)
Message driven beans are capable of responding to JMS (Java Messaging Service) messages. (The other types of beans are not able to do this do to the restrictions of the bean container.) MDB work asynchronously, the other bean types are synchronous. MDB can post JMS messages and that can be used as a return value of sorts.
Advantages of EJB s
Using EJBs gives you a number of things. The biggest thing is the server environment. You do not need to implement all the things that go with a server, like threading, polling, security, etc.
Using EJBs also takes away a number of things. You are not allowed to do certain things within the EJB container, e. g., you should not create threads, do file IO, listen on a socket, etc.
Books
book cover recommend book⇒Enterprise JavaBeans 3.1, sixth editionto book home
by Bill Burke, Richard Monson-Haefel 978-0-596-15802-6 paperback
birth 1971 age:45 978-1-4493-9696-1 eBook
publisher O’Reilly recommended B0046RERXO kindle
published 2010-09-17
covers JBOSS. Also high level information for managers and tips on design.
Australian flag abe books anz abe books.ca Canadian flag
German flag abe books.de amazon.ca Canadian flag
German flag amazon.de Chapters Indigo Canadian flag
Spanish flag amazon.es Chapters Indigo eBooks Canadian flag
Spanish flag iberlibro.com abe books.com American flag
French flag abe books.fr amazon.com American flag
French flag amazon.fr Barnes & Noble American flag
Italian flag abe books.it Nook at Barnes & Noble American flag
Italian flag amazon.it Kobo American flag
India flag junglee.com Google play American flag
UK flag abe books.co.uk O’Reilly Safari American flag
UK flag amazon.co.uk Powells American flag
UN flag other stores
Greyed out stores probably do not have the item in stock. Try looking for it with a bookfinder.
book cover recommend book⇒Building Java Enterprise Applications Volume I: Architectureto book home
by Brett McLaughlin 978-0-596-00123-0 paperback
publisher O’Reilly recommended
published 2002-03
Aimed at experienced developers. Filled with particularly good advice on using EJBs and LDAP directory services Highly recommended. First volume of a three volume set on EE.
Australian flag abe books anz abe books.ca Canadian flag
German flag abe books.de amazon.ca Canadian flag
German flag amazon.de Chapters Indigo Canadian flag
Spanish flag amazon.es Chapters Indigo eBooks Canadian flag
Spanish flag iberlibro.com abe books.com American flag
French flag abe books.fr amazon.com American flag
French flag amazon.fr Barnes & Noble American flag
Italian flag abe books.it Nook at Barnes & Noble American flag
Italian flag amazon.it Kobo American flag
India flag junglee.com Google play American flag
UK flag abe books.co.uk O’Reilly Safari American flag
UK flag amazon.co.uk Powells American flag
UN flag other stores
Greyed out stores probably do not have the item in stock. Try looking for it with a bookfinder.
There are many different ways of using EJB s, sometimes called idioms.
This page is posted
on the web at:
http://mindprod.com/jgloss/ejb.html
Optional Replicator mirror
of mindprod.com
on local hard disk J:
J:\mindprod\jgloss\ejb.html
Canadian Mind Products
Please the feedback from other visitors, or your own feedback about the site.
Contact Roedy. Please feel free to link to this page without explicit permission.
IP:[65.110.21.43]
Your face IP:[54.205.13.200]
You are visitor number
|
{
"url": "http://mindprod.com/jgloss/ejb.html",
"source_domain": "mindprod.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "41181",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CO7V6QBI6FBFR2RQJNU6JSBPF4QJL2CO",
"WARC-Concurrent-To": "<urn:uuid:54b9564b-e990-4f04-aa8d-f26430eacc41>",
"WARC-Date": "2017-01-21T17:25:37Z",
"WARC-IP-Address": "65.110.21.43",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:Y5T3VECMHONRQQPMN2JNDQNBT2RYV6WJ",
"WARC-Record-ID": "<urn:uuid:f10fa489-49ee-4cc3-a645-c860a7a080bd>",
"WARC-Target-URI": "http://mindprod.com/jgloss/ejb.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cff60e20-0c7f-4e2c-9cc2-630c5574ef4f>"
},
"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,
20,
21,
58,
59,
63,
454,
455,
630,
631,
1511,
1512,
1678,
1679,
1741,
1742,
1753,
1754,
2026,
2027,
2041,
2042,
2076,
2094,
2095,
2642,
2661,
2662,
3134,
3172,
3173,
3501,
3502,
3522,
3523,
3716,
3717,
3906,
3907,
3913,
3914,
3992,
4057,
4099,
4148,
4169,
4244,
4301,
4350,
4402,
4462,
4517,
4567,
4618,
4681,
4723,
4772,
4826,
4869,
4890,
4986,
5085,
5133,
5164,
5182,
5356,
5413,
5462,
5514,
5574,
5629,
5679,
5730,
5793,
5835,
5884,
5938,
5981,
6002,
6098,
6169,
6170,
6190,
6205,
6206,
6242,
6243,
6270,
6286,
6308,
6309,
6337,
6360,
6438,
6520,
6521,
6539,
6568
],
"line_end_idx": [
20,
21,
58,
59,
63,
454,
455,
630,
631,
1511,
1512,
1678,
1679,
1741,
1742,
1753,
1754,
2026,
2027,
2041,
2042,
2076,
2094,
2095,
2642,
2661,
2662,
3134,
3172,
3173,
3501,
3502,
3522,
3523,
3716,
3717,
3906,
3907,
3913,
3914,
3992,
4057,
4099,
4148,
4169,
4244,
4301,
4350,
4402,
4462,
4517,
4567,
4618,
4681,
4723,
4772,
4826,
4869,
4890,
4986,
5085,
5133,
5164,
5182,
5356,
5413,
5462,
5514,
5574,
5629,
5679,
5730,
5793,
5835,
5884,
5938,
5981,
6002,
6098,
6169,
6170,
6190,
6205,
6206,
6242,
6243,
6270,
6286,
6308,
6309,
6337,
6360,
6438,
6520,
6521,
6539,
6568,
6590
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6590,
"ccnet_original_nlines": 97,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2695520222187042,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.042520880699157715,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19514046609401703,
"rps_doc_frac_unique_words": 0.4226190447807312,
"rps_doc_mean_word_length": 5.2688493728637695,
"rps_doc_num_sentences": 112,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.486473083496094,
"rps_doc_word_count": 1008,
"rps_doc_frac_chars_dupe_10grams": 0.22895875573158264,
"rps_doc_frac_chars_dupe_5grams": 0.22895875573158264,
"rps_doc_frac_chars_dupe_6grams": 0.22895875573158264,
"rps_doc_frac_chars_dupe_7grams": 0.22895875573158264,
"rps_doc_frac_chars_dupe_8grams": 0.22895875573158264,
"rps_doc_frac_chars_dupe_9grams": 0.22895875573158264,
"rps_doc_frac_chars_top_2gram": 0.036151379346847534,
"rps_doc_frac_chars_top_3gram": 0.01355677004903555,
"rps_doc_frac_chars_top_4gram": 0.016569379717111588,
"rps_doc_books_importance": -623.0607299804688,
"rps_doc_books_importance_length_correction": -623.0607299804688,
"rps_doc_openwebtext_importance": -393.49078369140625,
"rps_doc_openwebtext_importance_length_correction": -393.49078369140625,
"rps_doc_wikipedia_importance": -306.8334655761719,
"rps_doc_wikipedia_importance_length_correction": -306.8334655761719
},
"fasttext": {
"dclm": 0.41965246200561523,
"english": 0.831909716129303,
"fineweb_edu_approx": 3.1241111755371094,
"eai_general_math": 0.02108157053589821,
"eai_open_web_math": 0.038915399461984634,
"eai_web_code": 0.1356966495513916
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,160,513,479,541,023,500 |
blob: a14dd7a45e7072254efe9b25af5ae59b6619c006 [file] [log] [blame]
/* ----------------------------------------------------------------------
* Project: CMSIS DSP Library
* Title: arm_iir_lattice_q31.c
* Description: Q31 IIR lattice filter processing function
*
* $Date: 27. January 2017
* $Revision: V.1.5.1
*
* Target Processor: Cortex-M cores
* -------------------------------------------------------------------- */
/*
* Copyright (C) 2010-2017 ARM Limited or its affiliates. All rights reserved.
*
* SPDX-License-Identifier: Apache-2.0
*
* Licensed 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
*
* www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an AS IS BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "arm_math.h"
/**
* @ingroup groupFilters
*/
/**
* @addtogroup IIR_Lattice
* @{
*/
/**
* @brief Processing function for the Q31 IIR lattice filter.
* @param[in] *S points to an instance of the Q31 IIR lattice structure.
* @param[in] *pSrc points to the block of input data.
* @param[out] *pDst points to the block of output data.
* @param[in] blockSize number of samples to process.
* @return none.
*
* @details
* <b>Scaling and Overflow Behavior:</b>
* \par
* The function is implemented using an internal 64-bit accumulator.
* The accumulator has a 2.62 format and maintains full precision of the intermediate multiplication results but provides only a single guard bit.
* Thus, if the accumulator result overflows it wraps around rather than clip.
* In order to avoid overflows completely the input signal must be scaled down by 2*log2(numStages) bits.
* After all multiply-accumulates are performed, the 2.62 accumulator is saturated to 1.32 format and then truncated to 1.31 format.
*/
void arm_iir_lattice_q31(
const arm_iir_lattice_instance_q31 * S,
q31_t * pSrc,
q31_t * pDst,
uint32_t blockSize)
{
q31_t fcurr, fnext = 0, gcurr = 0, gnext; /* Temporary variables for lattice stages */
q63_t acc; /* Accumlator */
uint32_t blkCnt, tapCnt; /* Temporary variables for counts */
q31_t *px1, *px2, *pk, *pv; /* Temporary pointers for state and coef */
uint32_t numStages = S->numStages; /* number of stages */
q31_t *pState; /* State pointer */
q31_t *pStateCurnt; /* State current pointer */
blkCnt = blockSize;
pState = &S->pState[0];
#if defined (ARM_MATH_DSP)
/* Run the below code for Cortex-M4 and Cortex-M3 */
/* Sample processing */
while (blkCnt > 0U)
{
/* Read Sample from input buffer */
/* fN(n) = x(n) */
fcurr = *pSrc++;
/* Initialize state read pointer */
px1 = pState;
/* Initialize state write pointer */
px2 = pState;
/* Set accumulator to zero */
acc = 0;
/* Initialize Ladder coeff pointer */
pv = &S->pvCoeffs[0];
/* Initialize Reflection coeff pointer */
pk = &S->pkCoeffs[0];
/* Process sample for first tap */
gcurr = *px1++;
/* fN-1(n) = fN(n) - kN * gN-1(n-1) */
fnext = __QSUB(fcurr, (q31_t) (((q63_t) gcurr * (*pk)) >> 31));
/* gN(n) = kN * fN-1(n) + gN-1(n-1) */
gnext = __QADD(gcurr, (q31_t) (((q63_t) fnext * (*pk++)) >> 31));
/* write gN-1(n-1) into state for next sample processing */
*px2++ = gnext;
/* y(n) += gN(n) * vN */
acc += ((q63_t) gnext * *pv++);
/* Update f values for next coefficient processing */
fcurr = fnext;
/* Loop unrolling. Process 4 taps at a time. */
tapCnt = (numStages - 1U) >> 2;
while (tapCnt > 0U)
{
/* Process sample for 2nd, 6th .. taps */
/* Read gN-2(n-1) from state buffer */
gcurr = *px1++;
/* fN-2(n) = fN-1(n) - kN-1 * gN-2(n-1) */
fnext = __QSUB(fcurr, (q31_t) (((q63_t) gcurr * (*pk)) >> 31));
/* gN-1(n) = kN-1 * fN-2(n) + gN-2(n-1) */
gnext = __QADD(gcurr, (q31_t) (((q63_t) fnext * (*pk++)) >> 31));
/* y(n) += gN-1(n) * vN-1 */
/* process for gN-5(n) * vN-5, gN-9(n) * vN-9 ... */
acc += ((q63_t) gnext * *pv++);
/* write gN-1(n) into state for next sample processing */
*px2++ = gnext;
/* Process sample for 3nd, 7th ...taps */
/* Read gN-3(n-1) from state buffer */
gcurr = *px1++;
/* Process sample for 3rd, 7th .. taps */
/* fN-3(n) = fN-2(n) - kN-2 * gN-3(n-1) */
fcurr = __QSUB(fnext, (q31_t) (((q63_t) gcurr * (*pk)) >> 31));
/* gN-2(n) = kN-2 * fN-3(n) + gN-3(n-1) */
gnext = __QADD(gcurr, (q31_t) (((q63_t) fcurr * (*pk++)) >> 31));
/* y(n) += gN-2(n) * vN-2 */
/* process for gN-6(n) * vN-6, gN-10(n) * vN-10 ... */
acc += ((q63_t) gnext * *pv++);
/* write gN-2(n) into state for next sample processing */
*px2++ = gnext;
/* Process sample for 4th, 8th ...taps */
/* Read gN-4(n-1) from state buffer */
gcurr = *px1++;
/* Process sample for 4th, 8th .. taps */
/* fN-4(n) = fN-3(n) - kN-3 * gN-4(n-1) */
fnext = __QSUB(fcurr, (q31_t) (((q63_t) gcurr * (*pk)) >> 31));
/* gN-3(n) = kN-3 * fN-4(n) + gN-4(n-1) */
gnext = __QADD(gcurr, (q31_t) (((q63_t) fnext * (*pk++)) >> 31));
/* y(n) += gN-3(n) * vN-3 */
/* process for gN-7(n) * vN-7, gN-11(n) * vN-11 ... */
acc += ((q63_t) gnext * *pv++);
/* write gN-3(n) into state for next sample processing */
*px2++ = gnext;
/* Process sample for 5th, 9th ...taps */
/* Read gN-5(n-1) from state buffer */
gcurr = *px1++;
/* Process sample for 5th, 9th .. taps */
/* fN-5(n) = fN-4(n) - kN-4 * gN-1(n-1) */
fcurr = __QSUB(fnext, (q31_t) (((q63_t) gcurr * (*pk)) >> 31));
/* gN-4(n) = kN-4 * fN-5(n) + gN-5(n-1) */
gnext = __QADD(gcurr, (q31_t) (((q63_t) fcurr * (*pk++)) >> 31));
/* y(n) += gN-4(n) * vN-4 */
/* process for gN-8(n) * vN-8, gN-12(n) * vN-12 ... */
acc += ((q63_t) gnext * *pv++);
/* write gN-4(n) into state for next sample processing */
*px2++ = gnext;
tapCnt--;
}
fnext = fcurr;
/* If the filter length is not a multiple of 4, compute the remaining filter taps */
tapCnt = (numStages - 1U) % 0x4U;
while (tapCnt > 0U)
{
gcurr = *px1++;
/* Process sample for last taps */
fnext = __QSUB(fcurr, (q31_t) (((q63_t) gcurr * (*pk)) >> 31));
gnext = __QADD(gcurr, (q31_t) (((q63_t) fnext * (*pk++)) >> 31));
/* Output samples for last taps */
acc += ((q63_t) gnext * *pv++);
*px2++ = gnext;
fcurr = fnext;
tapCnt--;
}
/* y(n) += g0(n) * v0 */
acc += (q63_t) fnext *(
*pv++);
*px2++ = fnext;
/* write out into pDst */
*pDst++ = (q31_t) (acc >> 31U);
/* Advance the state pointer by 4 to process the next group of 4 samples */
pState = pState + 1U;
blkCnt--;
}
/* Processing is complete. Now copy last S->numStages samples to start of the buffer
for the preperation of next frame process */
/* Points to the start of the state buffer */
pStateCurnt = &S->pState[0];
pState = &S->pState[blockSize];
tapCnt = numStages >> 2U;
/* copy data */
while (tapCnt > 0U)
{
*pStateCurnt++ = *pState++;
*pStateCurnt++ = *pState++;
*pStateCurnt++ = *pState++;
*pStateCurnt++ = *pState++;
/* Decrement the loop counter */
tapCnt--;
}
/* Calculate remaining number of copies */
tapCnt = (numStages) % 0x4U;
/* Copy the remaining q31_t data */
while (tapCnt > 0U)
{
*pStateCurnt++ = *pState++;
/* Decrement the loop counter */
tapCnt--;
};
#else
/* Run the below code for Cortex-M0 */
/* Sample processing */
while (blkCnt > 0U)
{
/* Read Sample from input buffer */
/* fN(n) = x(n) */
fcurr = *pSrc++;
/* Initialize state read pointer */
px1 = pState;
/* Initialize state write pointer */
px2 = pState;
/* Set accumulator to zero */
acc = 0;
/* Initialize Ladder coeff pointer */
pv = &S->pvCoeffs[0];
/* Initialize Reflection coeff pointer */
pk = &S->pkCoeffs[0];
tapCnt = numStages;
while (tapCnt > 0U)
{
gcurr = *px1++;
/* Process sample */
/* fN-1(n) = fN(n) - kN * gN-1(n-1) */
fnext =
clip_q63_to_q31(((q63_t) fcurr -
((q31_t) (((q63_t) gcurr * (*pk)) >> 31))));
/* gN(n) = kN * fN-1(n) + gN-1(n-1) */
gnext =
clip_q63_to_q31(((q63_t) gcurr +
((q31_t) (((q63_t) fnext * (*pk++)) >> 31))));
/* Output samples */
/* y(n) += gN(n) * vN */
acc += ((q63_t) gnext * *pv++);
/* write gN-1(n-1) into state for next sample processing */
*px2++ = gnext;
/* Update f values for next coefficient processing */
fcurr = fnext;
tapCnt--;
}
/* y(n) += g0(n) * v0 */
acc += (q63_t) fnext *(
*pv++);
*px2++ = fnext;
/* write out into pDst */
*pDst++ = (q31_t) (acc >> 31U);
/* Advance the state pointer by 1 to process the next group of samples */
pState = pState + 1U;
blkCnt--;
}
/* Processing is complete. Now copy last S->numStages samples to start of the buffer
for the preperation of next frame process */
/* Points to the start of the state buffer */
pStateCurnt = &S->pState[0];
pState = &S->pState[blockSize];
tapCnt = numStages;
/* Copy the remaining q31_t data */
while (tapCnt > 0U)
{
*pStateCurnt++ = *pState++;
/* Decrement the loop counter */
tapCnt--;
}
#endif /* #if defined (ARM_MATH_DSP) */
}
/**
* @} end of IIR_Lattice group
*/
|
{
"url": "https://pigweed.googlesource.com/third_party/github/STMicroelectronics/cmsis_core/+/cb6d9400754e6c9050487dfa573949b61152ac99/DSP/Source/FilteringFunctions/arm_iir_lattice_q31.c",
"source_domain": "pigweed.googlesource.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "123456",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LVATB2N7IEWXW53ALYCXFOTKKM6BFGD5",
"WARC-Concurrent-To": "<urn:uuid:71ae337a-7dc8-4868-9017-2c55d74627f4>",
"WARC-Date": "2021-09-27T10:52:16Z",
"WARC-IP-Address": "173.194.205.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HSWXT5C23KHEI6XHF3FELITPW6JPRO3Y",
"WARC-Record-ID": "<urn:uuid:e435d4b2-5673-45b8-8a5f-c5626b14a7cc>",
"WARC-Target-URI": "https://pigweed.googlesource.com/third_party/github/STMicroelectronics/cmsis_core/+/cb6d9400754e6c9050487dfa573949b61152ac99/DSP/Source/FilteringFunctions/arm_iir_lattice_q31.c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3f91fbf5-e8a1-4c26-85bd-f173701aa28c>"
},
"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-142\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
68,
142,
171,
202,
260,
262,
288,
309,
311,
346,
420,
423,
501,
503,
541,
543,
615,
674,
716,
718,
756,
758,
828,
902,
969,
1039,
1072,
1075,
1097,
1101,
1125,
1128,
1132,
1158,
1163,
1166,
1170,
1231,
1303,
1357,
1413,
1466,
1482,
1484,
1495,
1535,
1542,
1610,
1756,
1834,
1939,
2071,
2074,
2100,
2140,
2154,
2168,
2188,
2190,
2277,
2305,
2367,
2439,
2497,
2532,
2580,
2600,
2624,
2651,
2704,
2728,
2748,
2750,
2786,
2805,
2822,
2858,
2872,
2909,
2923,
2953,
2962,
3000,
3022,
3064,
3086,
3121,
3137,
3176,
3240,
3279,
3345,
3405,
3421,
3446,
3478,
3532,
3547,
3595,
3627,
3647,
3649,
3691,
3730,
3746,
3789,
3853,
3896,
3962,
3991,
4044,
4076,
4134,
4150,
4192,
4231,
4247,
4289,
4332,
4396,
4439,
4505,
4534,
4589,
4621,
4679,
4695,
4737,
4776,
4792,
4834,
4877,
4941,
4984,
5050,
5079,
5134,
5166,
5224,
5240,
5282,
5321,
5337,
5379,
5422,
5486,
5529,
5595,
5624,
5679,
5711,
5769,
5785,
5795,
5797,
5812,
5897,
5931,
5951,
5953,
5969,
6004,
6068,
6134,
6169,
6201,
6217,
6232,
6242,
6244,
6269,
6293,
6301,
6317,
6343,
6375,
6451,
6473,
6483,
6485,
6570,
6615,
6661,
6690,
6722,
6748,
6764,
6784,
6786,
6814,
6842,
6870,
6898,
6931,
6941,
6943,
6986,
7015,
7051,
7071,
7073,
7101,
7134,
7144,
7147,
7153,
7192,
7216,
7236,
7238,
7274,
7293,
7310,
7346,
7360,
7397,
7411,
7441,
7450,
7488,
7510,
7552,
7574,
7594,
7614,
7616,
7632,
7653,
7692,
7700,
7733,
7778,
7817,
7825,
7858,
7905,
7926,
7951,
7983,
8043,
8059,
8113,
8128,
8138,
8140,
8165,
8189,
8197,
8213,
8239,
8271,
8345,
8367,
8377,
8379,
8464,
8509,
8555,
8584,
8616,
8636,
8672,
8692,
8694,
8722,
8755,
8765,
8767,
8807,
8809,
8813,
8843
],
"line_end_idx": [
68,
142,
171,
202,
260,
262,
288,
309,
311,
346,
420,
423,
501,
503,
541,
543,
615,
674,
716,
718,
756,
758,
828,
902,
969,
1039,
1072,
1075,
1097,
1101,
1125,
1128,
1132,
1158,
1163,
1166,
1170,
1231,
1303,
1357,
1413,
1466,
1482,
1484,
1495,
1535,
1542,
1610,
1756,
1834,
1939,
2071,
2074,
2100,
2140,
2154,
2168,
2188,
2190,
2277,
2305,
2367,
2439,
2497,
2532,
2580,
2600,
2624,
2651,
2704,
2728,
2748,
2750,
2786,
2805,
2822,
2858,
2872,
2909,
2923,
2953,
2962,
3000,
3022,
3064,
3086,
3121,
3137,
3176,
3240,
3279,
3345,
3405,
3421,
3446,
3478,
3532,
3547,
3595,
3627,
3647,
3649,
3691,
3730,
3746,
3789,
3853,
3896,
3962,
3991,
4044,
4076,
4134,
4150,
4192,
4231,
4247,
4289,
4332,
4396,
4439,
4505,
4534,
4589,
4621,
4679,
4695,
4737,
4776,
4792,
4834,
4877,
4941,
4984,
5050,
5079,
5134,
5166,
5224,
5240,
5282,
5321,
5337,
5379,
5422,
5486,
5529,
5595,
5624,
5679,
5711,
5769,
5785,
5795,
5797,
5812,
5897,
5931,
5951,
5953,
5969,
6004,
6068,
6134,
6169,
6201,
6217,
6232,
6242,
6244,
6269,
6293,
6301,
6317,
6343,
6375,
6451,
6473,
6483,
6485,
6570,
6615,
6661,
6690,
6722,
6748,
6764,
6784,
6786,
6814,
6842,
6870,
6898,
6931,
6941,
6943,
6986,
7015,
7051,
7071,
7073,
7101,
7134,
7144,
7147,
7153,
7192,
7216,
7236,
7238,
7274,
7293,
7310,
7346,
7360,
7397,
7411,
7441,
7450,
7488,
7510,
7552,
7574,
7594,
7614,
7616,
7632,
7653,
7692,
7700,
7733,
7778,
7817,
7825,
7858,
7905,
7926,
7951,
7983,
8043,
8059,
8113,
8128,
8138,
8140,
8165,
8189,
8197,
8213,
8239,
8271,
8345,
8367,
8377,
8379,
8464,
8509,
8555,
8584,
8616,
8636,
8672,
8692,
8694,
8722,
8755,
8765,
8767,
8807,
8809,
8813,
8843,
8845
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8845,
"ccnet_original_nlines": 272,
"rps_doc_curly_bracket": 0.0022611599415540695,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12324929982423782,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028011199086904526,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5358143448829651,
"rps_doc_frac_unique_words": 0.30841121077537537,
"rps_doc_mean_word_length": 5.038317680358887,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.004801920149475336,
"rps_doc_unigram_entropy": 5.167181968688965,
"rps_doc_word_count": 1070,
"rps_doc_frac_chars_dupe_10grams": 0.3023557662963867,
"rps_doc_frac_chars_dupe_5grams": 0.5188276767730713,
"rps_doc_frac_chars_dupe_6grams": 0.48043036460876465,
"rps_doc_frac_chars_dupe_7grams": 0.45186421275138855,
"rps_doc_frac_chars_dupe_8grams": 0.37302911281585693,
"rps_doc_frac_chars_dupe_9grams": 0.31942126154899597,
"rps_doc_frac_chars_top_2gram": 0.02077537029981613,
"rps_doc_frac_chars_top_3gram": 0.02671119011938572,
"rps_doc_frac_chars_top_4gram": 0.019476909190416336,
"rps_doc_books_importance": -728.362548828125,
"rps_doc_books_importance_length_correction": -728.362548828125,
"rps_doc_openwebtext_importance": -589.11865234375,
"rps_doc_openwebtext_importance_length_correction": -589.11865234375,
"rps_doc_wikipedia_importance": -417.4695739746094,
"rps_doc_wikipedia_importance_length_correction": -417.4695739746094
},
"fasttext": {
"dclm": 0.7153917551040649,
"english": 0.5875347852706909,
"fineweb_edu_approx": 3.123173475265503,
"eai_general_math": 0.47354376316070557,
"eai_open_web_math": 0.9260987639427185,
"eai_web_code": 0.9372922778129578
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "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
|
1,452,912,297,353,368,600 |
O'Reilly logo
CDO & MAPI Programming with Visual Basic: by Dave Grundgeiger
Stay ahead with the world's most comprehensive technology and business learning platform.
With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.
Start Free Trial
No credit card required
Formatted Text
Formatted text is text that can specify its own attributes, such as typeface, style, size, and color, and perhaps other features, such as paragraph spacing, bullets, and numbering. Text that is not formatted is called plain text. MAPI supports both plain text and formatted text.
Programs that wish to exchange formatted text must agree on how the formatting information is to be communicated between them. MAPI clients typically use Microsoft’s RTF specification for this purpose. RTF encodes formatting information as plain-text keywords mixed in with the actual text of the message. For example, a formatted sentence such as, “I like to use different styles,” can be encoded into plain text as:
{\rtf1\ansi\ansicpg1252\deff0\deftab720{\fonttbl{\f0\fswissMS Sans Serif;}{\f1\
froman\fcharset2 Symbol;}{\f2\froman Times New Roman;}{\f3\fswiss MS Sans
Serif;}}{\colortbl\red0\green0\blue0;}\deflang1033\pard\plain\f2\fs20 Ilike to
use \plain\f2\fs20\i different\plain\f2\ fs20 \plain\f2\
fs20\b styles\plain\f2\fs20 ,\plain\f3\fs17 \par }
(The line breaks in this example are for printing this book only. The actual RTF for this example contained no line breaks.)
It isn’t necessary to learn RTF in order to use it in a messaging application. Visual Basic provides a very flexible RichTextBox control. The RichTextBox control has all the features of a standard TextBox control, plus the ability to work with formatted text. The control has methods for selecting portions of the text and ...
With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.
Start Free Trial
No credit card required
|
{
"url": "https://www.oreilly.com/library/view/cdo-mapi/156592665X/ch06s14.html",
"source_domain": "www.oreilly.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "27655",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I7FFJ76MOLQB6AVX2KAXPQPOQNQDGU5I",
"WARC-Concurrent-To": "<urn:uuid:f7534ed0-cd66-4ea7-b3ae-1d3e4cfa7a41>",
"WARC-Date": "2019-07-15T18:22:33Z",
"WARC-IP-Address": "23.196.116.202",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K3WQNFSHJHPJBF7DJQZNCHLBKTAAQDZI",
"WARC-Record-ID": "<urn:uuid:07441342-cbcc-40fe-82e1-061f7bba26d3>",
"WARC-Target-URI": "https://www.oreilly.com/library/view/cdo-mapi/156592665X/ch06s14.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f9299cec-c5e8-42a3-8fe7-c42feec5834f>"
},
"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-164-217-227.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
14,
15,
77,
78,
168,
169,
314,
315,
332,
333,
357,
358,
373,
374,
654,
655,
1073,
1074,
1154,
1229,
1309,
1367,
1418,
1419,
1544,
1545,
1872,
1873,
2030,
2031,
2048,
2049
],
"line_end_idx": [
14,
15,
77,
78,
168,
169,
314,
315,
332,
333,
357,
358,
373,
374,
654,
655,
1073,
1074,
1154,
1229,
1309,
1367,
1418,
1419,
1544,
1545,
1872,
1873,
2030,
2031,
2048,
2049,
2072
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2072,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0.0067567601799964905,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28037384152412415,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025700930505990982,
"rps_doc_frac_lines_end_with_ellipsis": 0.030303029343485832,
"rps_doc_frac_no_alph_words": 0.21962617337703705,
"rps_doc_frac_unique_words": 0.5423728823661804,
"rps_doc_mean_word_length": 5.576271057128906,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.002336449921131134,
"rps_doc_unigram_entropy": 4.785451889038086,
"rps_doc_word_count": 295,
"rps_doc_frac_chars_dupe_10grams": 0.17993921041488647,
"rps_doc_frac_chars_dupe_5grams": 0.17993921041488647,
"rps_doc_frac_chars_dupe_6grams": 0.17993921041488647,
"rps_doc_frac_chars_dupe_7grams": 0.17993921041488647,
"rps_doc_frac_chars_dupe_8grams": 0.17993921041488647,
"rps_doc_frac_chars_dupe_9grams": 0.17993921041488647,
"rps_doc_frac_chars_top_2gram": 0.03951368108391762,
"rps_doc_frac_chars_top_3gram": 0.015805469825863838,
"rps_doc_frac_chars_top_4gram": 0.021884499117732048,
"rps_doc_books_importance": -133.34689331054688,
"rps_doc_books_importance_length_correction": -133.34689331054688,
"rps_doc_openwebtext_importance": -93.6205825805664,
"rps_doc_openwebtext_importance_length_correction": -93.6205825805664,
"rps_doc_wikipedia_importance": -54.24976348876953,
"rps_doc_wikipedia_importance_length_correction": -54.24976348876953
},
"fasttext": {
"dclm": 0.08223772048950195,
"english": 0.8272002339363098,
"fineweb_edu_approx": 2.636214256286621,
"eai_general_math": 0.2813083529472351,
"eai_open_web_math": 0.2011357545852661,
"eai_web_code": 0.019413890317082405
}
}
|
{
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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
|
-4,413,855,040,947,402,000 |
New and faster version of MUDI
A question for the GL.Inet team: do you plan to develop the MUDI router/modem to make it faster, have slightly better components and the ability to remove the battery and work without it?
You could just as easily have a romance between SLATE_AX and MUDI, and in this form a router with a Quectel EP06-E/A or faster card would be nice.
Hi
How about the GL-X750V2 Spitz? There is a module which is the Quectel EP06-E.
hello, thank you very much for your reply. The GL-X750V2 router you mention is nice, but certainly not as convenient to use as MUDI or Slate_AX, all because of the protruding antennas which can potentially be damaged when carried or used. I tested MUDIV2 but I was not satisfied with its performance and the fact that it has a built-in battery. In my opinion, the battery can be good, but it would be nice if it was easily replaceable and a standard one, and it would be great if the router could work without a battery, powered by a power bank or the network.
Thanks for your information about user scenarios and suggestions, I will note to products team.
1 Like
|
{
"url": "https://forum.gl-inet.com/t/new-and-faster-version-of-mudi/43054",
"source_domain": "forum.gl-inet.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "20442",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZC6WKYMFDG5NWWOS5I4R6XI4E7XWV4HX",
"WARC-Concurrent-To": "<urn:uuid:43a39128-86e1-4dbe-9a9d-cfe7d614bf58>",
"WARC-Date": "2024-06-17T16:50:06Z",
"WARC-IP-Address": "44.235.104.247",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VMP2LXIMNSQKO4FV7RJC76JT3DS4EZDS",
"WARC-Record-ID": "<urn:uuid:c8c0eb73-4de2-489b-add1-647c2894a53f>",
"WARC-Target-URI": "https://forum.gl-inet.com/t/new-and-faster-version-of-mudi/43054",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:924a8130-3958-476e-9691-8c773cf67ab3>"
},
"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-67\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,
31,
32,
220,
221,
368,
369,
372,
373,
451,
452,
1013,
1014,
1110,
1111
],
"line_end_idx": [
31,
32,
220,
221,
368,
369,
372,
373,
451,
452,
1013,
1014,
1110,
1111,
1117
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1117,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.47698745131492615,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08368200808763504,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12133891135454178,
"rps_doc_frac_unique_words": 0.5615763664245605,
"rps_doc_mean_word_length": 4.325123310089111,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.454109191894531,
"rps_doc_word_count": 203,
"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.023917999118566513,
"rps_doc_frac_chars_top_3gram": 0.025056950747966766,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -97.4744873046875,
"rps_doc_books_importance_length_correction": -97.4744873046875,
"rps_doc_openwebtext_importance": -49.24858856201172,
"rps_doc_openwebtext_importance_length_correction": -42.23532485961914,
"rps_doc_wikipedia_importance": -48.6954460144043,
"rps_doc_wikipedia_importance_length_correction": -48.6954460144043
},
"fasttext": {
"dclm": 0.028762519359588623,
"english": 0.9737783074378967,
"fineweb_edu_approx": 1.3934247493743896,
"eai_general_math": 0.7350212931632996,
"eai_open_web_math": 0.3261744976043701,
"eai_web_code": 0.007813160307705402
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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": "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,547,726,483,056,733,000 |
[Newbies] A do with ONLY index? (plus,. a style question)
Blake blake at kingdomrpg.com
Sun Feb 4 01:44:12 UTC 2007
In a Sequencable collection, doWithIndex seems to just call withIndexDo.
Is there a "do" that passes just the index, not the object?
My son is working on a roguelike, and we're looking at various ways of
creating the map. This is a two-dimensional map that would fit in a
character-mode, and we have this so far:
| map xBound yBound |
xBound := 80.
yBound := 24.
map := Array new: xBound.
i := 1.
[i <= xBound] whileTrue: [
map at:i put: (Array new:yBound).
i := i + 1
].
map do: [ :col|
col withIndexDo: [:obj :y|
col at:y put:#stone.
]
].
This seems to lack elegance. Better would be:
map := 2DArray new: 80 at 25.
map doXY: [:xy| map atXY:xy put:#stone].
Or even:
grid := Grid new: 80 at 25 fill: #stone.
Marcus has his 2DArray but it's peppered with caveats.
Thoughts?
===Blake===
More information about the Beginners mailing list
|
{
"url": "http://lists.squeakfoundation.org/pipermail/beginners/2007-February/001878.html",
"source_domain": "lists.squeakfoundation.org",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "3602",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4EQ2VDGRTLGVUV2BWBJKPXQDY6EFRHLE",
"WARC-Concurrent-To": "<urn:uuid:68788b88-1200-4768-be08-df25e383ad99>",
"WARC-Date": "2020-12-05T09:23:43Z",
"WARC-IP-Address": "104.239.229.92",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QASALDGNV4SOUXWAIYVQCJWZKJHGC5MW",
"WARC-Record-ID": "<urn:uuid:3a6b9913-17a7-4696-b1c0-739f57efe675>",
"WARC-Target-URI": "http://lists.squeakfoundation.org/pipermail/beginners/2007-February/001878.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3dfb37d7-ed70-4e12-bac0-2124ceb69e7a>"
},
"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-10.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,
58,
59,
89,
117,
118,
119,
194,
254,
255,
328,
398,
439,
440,
462,
476,
490,
516,
524,
551,
586,
598,
602,
603,
619,
647,
670,
674,
678,
679,
725,
726,
756,
797,
798,
807,
808,
849,
850,
905,
906,
917,
918,
931,
932,
933
],
"line_end_idx": [
58,
59,
89,
117,
118,
119,
194,
254,
255,
328,
398,
439,
440,
462,
476,
490,
516,
524,
551,
586,
598,
602,
603,
619,
647,
670,
674,
678,
679,
725,
726,
756,
797,
798,
807,
808,
849,
850,
905,
906,
917,
918,
931,
932,
933,
982
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 982,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2817460298538208,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011904760263860226,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3730158805847168,
"rps_doc_frac_unique_words": 0.6392405033111572,
"rps_doc_mean_word_length": 4.272151947021484,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0.011904760263860226,
"rps_doc_unigram_entropy": 4.4156646728515625,
"rps_doc_word_count": 158,
"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.008888890035450459,
"rps_doc_frac_chars_top_3gram": 0.02074074000120163,
"rps_doc_frac_chars_top_4gram": 0.0266666691750288,
"rps_doc_books_importance": -105.90849304199219,
"rps_doc_books_importance_length_correction": -105.90849304199219,
"rps_doc_openwebtext_importance": -46.5859260559082,
"rps_doc_openwebtext_importance_length_correction": -32.63852310180664,
"rps_doc_wikipedia_importance": -49.757354736328125,
"rps_doc_wikipedia_importance_length_correction": -49.757354736328125
},
"fasttext": {
"dclm": 0.11478585004806519,
"english": 0.8855393528938293,
"fineweb_edu_approx": 1.291905403137207,
"eai_general_math": 0.5478644371032715,
"eai_open_web_math": 0.5355141758918762,
"eai_web_code": 0.019345760345458984
}
}
|
{
"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": "-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
|
-1,324,670,018,347,310,600 |
The Brave New World of Text Analytics Applications
Attensity Corporation announced today that it is joining forces with two other text analytics/information management companies, Living e and Empolis, to form a new company called Attensity Group focused on creating business user applications on top of sophisticated data and semantic analytics technology. According to Michelle de Haaff, CMO, the new combined company has software deployed in more than 500 installations worldwide and is in 250 of the Fortune 1000 companies.
The combined company offerings include the following applications:
· Voice of the Customer/Market Intelligence: analysis of unstructured information from internal and external sources in order to understand customer sentiment, root cause and issues. This helps to answer questions such as: What are the top three complaints about my service? How do I stack up against the competition?
· E-service: creates portals for online service content and includes guided search and escalation paths for both end customers and service agents. This helps to answer questions such as: How do I change my password? What workarounds have helped other customers?
· Automated Response Management: allows timely and accurate responses to incoming communications. This helps companies to answer inbound customer inquiries leveraging the same knowledge base used for E-Service.
· Research and Discovery: provides advanced search and classification of internal and external data, enabling early detection of issues in corporate and legal processes. This helps to answer questions such as: What pending legislation could affect our launch? Is my patent unique?
· Intelligence Analysis: analyzes human intelligence and public intelligence for the purpose of identifying and preventing criminal activity. This helps to answer question such as: Who is the leader of this cell? How is money being moved?
Attensity Group will also provide custom applications. It will sell in the Americas under the banner: Attensity, An Attensity Group Company and in Europe under the banner: Empolis, An Attensity Group Company.
Does it make sense?
In a nutshell, the combination of these companies elevates Attensity Group out of niche application provider status to $40M to $50M mid-sized company. The combined company is backed by Aeris Holdings.
Is this a viable move? Attensity Group claims that companies want applications, not platforms that they don’t know what to do with. I think that the move makes sense because companies do want specific, straight-forward solutions to their problems. Look at how popular the SaaS model has been for Voice of the Customer solutions that utilize text analytics. And, the traction that Attensity has gotten with its VoC solutions. Additionally, small companies have a hard time making it as platform providers. Text Analytics platforms are best left to substantially larger companies such as IBM or EMC that offer text analytics in conjunction with platforms (or as part of it). These companies have built a sustainable ecosystem around their platforms.
It also doesn’t hurt that Attensity Group has some solid legs to stand on.
IBM Business Analytics and Optimization – The Dawn of New Era
I attended the IBM Business Analytics and Optimization (BAO) briefing yesterday at the IBM Research facility in Hawthorne, NY. At the meeting, IBM executives from Software, Global Business Services, and Research (yes, Research) announced its new consulting organization, which will be led by Fred Balboni. The initiative includes 4000 GBS consultants working together with the Software Group and Research to deliver solutions to customers dedicated to advanced business analytics and business optimization. The initiative builds off of IBM’s Smarter Planet .
IBM believes that there is a great opportunity for companies that can take all of the information they are being inundated with and use it effectively. According to IBM (based on a recent study), only 13% of companies are utilizing analytics to their advantage. The business drivers behind the new practice include the fact that companies are being pressured to make decisions smarter and faster. Optimization is key as well as the ability for organizations to become more predictive. In fact, the word predictive was used a lot yesterday.
According to IBM, with an instrumented data explosion, powerful software will be needed to manage this information, analyze it, and act on it. This goes beyond business intelligence and business process management, to what IBM terms business analytics and optimization. BAO operationalizes this information via advanced analytics and optimization. This means that advanced analytics operating on lots of data will be part of solutions that are sold to customers. BAO will go to market with industry specific applications
‘Been doing this for years
IBM was quick to point out that they have been delivering solutions like this to customers for a number of years Here are a few examples:
· The Sentinel Group , an organization that provides healthcare anti-fraud and abuse services, uses IBM software and advanced analytics to predict insurance fraud.
· The Fire Department of New York is using IBM software and advanced analytics to “ build a state of the art system for collecting and sharing data in real-time that can potentially prevent fires and protect firefighters and other first responders when a fire occurs”.
· The Operational Risk data exchange (ORX) is using IBM to help its 35 member banks better analyze operational loss data from across the banking industry. This work is being done in conjunction with IBM Research.
These solutions were built in conjunction with the members of IBM Research who have been pioneering new techniques for analyzing data. This is a group of 200 mathematicians and other quantitative scientists. In fact, according to IBM, IBM research has been part of a very large number of client engagements. A few years back, the company formalized the bridge between GBS and Research via the Center for Business Optimization. The new consulting organization is yet a further outgrowth of this.
The Dawn of a New Era
The new organization will provide consulting services in the following areas:
· Strategy
· Biz Intelligence and Business Performance Management
· Advanced Analytics and Optimization
· Enterprise info management
· Enterprise Content management
It was significant that the meeting was held at the Research Labs. We lunched with researchers, met with Brenda Dietrich, VP of Research, and saw a number of solution demos that utilized intellectual property from Research. IBM believes that its research strength will help to differentiate it from competitors.
The research organization is doing some interesting work in many areas of data analysis including mining blogs, sentiment analysis, and machine learning and predictive analysis. While there are researchers on the team that are more traditional and measure success based on how many papers they publish, there are a large number that get excited about solving real problems for real customers. Brenda Dietrich requires that each lab participate in real-world work.
Look, I get excited about business analytics, it’s in my blood. I agree that world of data is changing and companies that make the most effective use of information will come out ahead. I’ve been saying this for years. I’m glad that IBM is taking the bull by the horns. I like that Research is involved.
It will be interesting to see how effectively IBM can take its IP and reuse it and make it scale across different customers in different industries in order to solve complex problems. According to IBM, once a specific piece of IP is used several times, they can effectively make it work across other solutions. On a side note, it will also be interesting to see how this IP might make its way into the Cognos Platform. That is not the thrust of this announcement (which is more GBS centric), but is worth mentioning.
Redefining Innovation?
Can people learn to innovate? It may depend on how you define innovation. When most people think of innovation, they think invention – like developing a post-it note. But, innovation can be something different. Innovation can be as simple as using something old in a new way or as complex as inventing something… well really complex. In the technology world, innovation can be about taking a product to market and extending its life. Or, about finding new markets for technology that you already have.
The folks at Invention Machine believe that you can learn to innovate, regardless of the type of innovation. In fact, they believe that innovation can be injected everywhere in the product life cycle – from planning and research to design to preventing and fixing defects. The goal is to make innovation “repeatable and sustainable”. They have crafted an interesting solution that blends best practices in innovation with text analytics software so that the software can actually act as a subject matter expert.
Best practices in innovation include text analytics
How does it work? The solution- called Goldfire- provides an innovation framework with a semantic engine that allows you to mine internal documents, patents, and external literature to find answers to questions. It supports the following innovation categories:
· Analyze a market: enables the user to cull through the literature, extracting relevant information in order to understand a technology better
· Develop a Product: enables the user to design a new or hybrid system, providing best practices frameworks for this along with the ability to analyze patents and other documents relevant to the functionality of the product.
· Improve a System: enables users to diagnose and fix a problem and resolve contradictions in an existing system.
· Risk Management: provides predictive failure analysis
· Leverage Intellectual property: enables users to cull through patents
Right now, the company is focused on the manufacturing sector only. For example, assume you are interested in developing a new product. You would log into the Invention Machine solution and select the task (on the left hand tool bar) design a system. You would see some steps involved with designing a new system. These are illustrated in the diagram below.
slide12
Here, you can see some best practices concerning what is involved in designing a system and then the steps you would take to do this. One step is to explore the opportunity space. The company uses Natural Language Processing techniques to rank concept retrieval requests relative to the question being asked. For example, say you’re interested in designing a new coffee maker and you need a component to heat water. If you ask, “What heats water?” the result “The anode heats water” would be ranked higher than “Water is heated on a stove” because semantically, the first answer is more accurate. Note that here the user is interested in the function of heating water and the anode is a component that can help to do this. The text analytics engine will make use of selective substations for accurate extended concept retrieval. Selective means only the words that are precise substitutes are used for automatic rephrasing.
The order of words makes a difference in what would come back in a search query. Using the coffee maker example, assume the user is interested in getting power to the switch on the machine. If the user asks, “How to power the switch?” and “How to switch the power?” the software recognizes the difference in concepts expressed by the different word orders. This is because the semantic approach used by Invention Machine looks at the word roles and the relationships implied by the structure of language rather than a simple keyword or Bayesian approach.
Can you learn to innovate?
I have to say that I have not seen anything quite like this before. I’ve seen text analytics used in R&D to search the literature and patents, but not wrapped in best practices.
Invention Machine’s semantic approach is interesting because it helps users focus on components and functions and, at one level, this is a part of what innovation is all about. You could argue that components and functions are relevant to any industry. If I am building something or even delivering a service, I am interested in what components I would need to meet a specific function. Right now Invention Machines is focused on manufacturing, but you could certainly see how the application could be extended to other domains.
Follow
Get every new post delivered to your Inbox.
Join 1,188 other followers
|
{
"url": "http://fbhalper.wordpress.com/2009/04/",
"source_domain": "fbhalper.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "53260",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5GS2TC6Y46GRMG7RY2SWDYIPQER3X2II",
"WARC-Concurrent-To": "<urn:uuid:2b9ca86b-33e2-404f-97e8-be441e453346>",
"WARC-Date": "2014-03-07T12:08:32Z",
"WARC-IP-Address": "192.0.80.250",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:U3CKEALVULHHFXACNP5EPUA2UBEGXC75",
"WARC-Record-ID": "<urn:uuid:a7916391-b706-47d6-8fd3-80951b91edce>",
"WARC-Target-URI": "http://fbhalper.wordpress.com/2009/04/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0e11b935-5e11-4f38-8749-04996d407c90>"
},
"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,
51,
52,
531,
532,
534,
535,
602,
603,
605,
606,
935,
936,
1209,
1210,
1428,
1429,
1721,
1722,
1972,
1973,
1975,
1976,
2186,
2187,
2189,
2190,
2192,
2193,
2213,
2214,
2216,
2217,
2419,
2420,
2422,
2423,
3182,
3183,
3185,
3186,
3262,
3263,
3325,
3326,
3890,
3891,
3893,
3894,
4439,
4440,
4442,
4443,
4968,
4969,
4971,
4972,
4999,
5000,
5002,
5003,
5141,
5142,
5144,
5145,
5316,
5317,
5593,
5594,
5815,
5816,
5818,
5819,
6319,
6320,
6322,
6323,
6345,
6346,
6348,
6349,
6427,
6428,
6446,
6447,
6509,
6510,
6555,
6556,
6592,
6593,
6632,
6633,
6635,
6636,
6950,
6951,
6953,
6954,
7422,
7423,
7425,
7426,
7735,
7736,
7738,
7739,
8261,
8262,
8264,
8265,
8288,
8289,
8798,
8799,
8801,
8802,
8804,
8805,
9321,
9322,
9324,
9325,
9377,
9378,
9380,
9381,
9644,
9645,
9647,
9648,
9799,
9800,
10033,
10034,
10156,
10157,
10220,
10221,
10300,
10301,
10303,
10304,
10666,
10667,
10675,
10676,
11607,
11608,
11610,
11611,
11613,
11614,
12176,
12177,
12179,
12180,
12207,
12208,
12210,
12211,
12391,
12392,
12925,
12926,
12933,
12934,
12978,
12979
],
"line_end_idx": [
51,
52,
531,
532,
534,
535,
602,
603,
605,
606,
935,
936,
1209,
1210,
1428,
1429,
1721,
1722,
1972,
1973,
1975,
1976,
2186,
2187,
2189,
2190,
2192,
2193,
2213,
2214,
2216,
2217,
2419,
2420,
2422,
2423,
3182,
3183,
3185,
3186,
3262,
3263,
3325,
3326,
3890,
3891,
3893,
3894,
4439,
4440,
4442,
4443,
4968,
4969,
4971,
4972,
4999,
5000,
5002,
5003,
5141,
5142,
5144,
5145,
5316,
5317,
5593,
5594,
5815,
5816,
5818,
5819,
6319,
6320,
6322,
6323,
6345,
6346,
6348,
6349,
6427,
6428,
6446,
6447,
6509,
6510,
6555,
6556,
6592,
6593,
6632,
6633,
6635,
6636,
6950,
6951,
6953,
6954,
7422,
7423,
7425,
7426,
7735,
7736,
7738,
7739,
8261,
8262,
8264,
8265,
8288,
8289,
8798,
8799,
8801,
8802,
8804,
8805,
9321,
9322,
9324,
9325,
9377,
9378,
9380,
9381,
9644,
9645,
9647,
9648,
9799,
9800,
10033,
10034,
10156,
10157,
10220,
10221,
10300,
10301,
10303,
10304,
10666,
10667,
10675,
10676,
11607,
11608,
11610,
11611,
11613,
11614,
12176,
12177,
12179,
12180,
12207,
12208,
12210,
12211,
12391,
12392,
12925,
12926,
12933,
12934,
12978,
12979,
13005
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13005,
"ccnet_original_nlines": 168,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40017473697662354,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025338580831885338,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12013980001211166,
"rps_doc_frac_unique_words": 0.34733203053474426,
"rps_doc_mean_word_length": 5.124505996704102,
"rps_doc_num_sentences": 112,
"rps_doc_symbol_to_word_ratio": 0.0004368700028862804,
"rps_doc_unigram_entropy": 5.719509601593018,
"rps_doc_word_count": 2024,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.034901659935712814,
"rps_doc_frac_chars_dupe_6grams": 0.016390280798077583,
"rps_doc_frac_chars_dupe_7grams": 0.01002699974924326,
"rps_doc_frac_chars_dupe_8grams": 0.006941770203411579,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01002699974924326,
"rps_doc_frac_chars_top_3gram": 0.011569609865546227,
"rps_doc_frac_chars_top_4gram": 0.006556109990924597,
"rps_doc_books_importance": -1092.732421875,
"rps_doc_books_importance_length_correction": -1092.732421875,
"rps_doc_openwebtext_importance": -652.5905151367188,
"rps_doc_openwebtext_importance_length_correction": -652.5905151367188,
"rps_doc_wikipedia_importance": -453.7586364746094,
"rps_doc_wikipedia_importance_length_correction": -453.7586364746094
},
"fasttext": {
"dclm": 0.07000690698623657,
"english": 0.9230059385299683,
"fineweb_edu_approx": 1.8045990467071533,
"eai_general_math": 0.05969756841659546,
"eai_open_web_math": 0.19205516576766968,
"eai_web_code": 0.01564658060669899
}
}
|
{
"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.40385",
"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": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"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": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,525,261,550,338,665,000 |
Справочник функций
Ваш аккаунт
Войти через:
Забыли пароль?
Регистрация
Информацию о новых материалах можно получать и без регистрации:
Почтовая рассылка
Подписчиков: -1
Последний выпуск: 19.06.2015
Создание прогресс бара.
1.8K
26 июля 2013 года
Nadezda
62 / / 31.05.2004
Для загрузки диалога необходимо собрать (прочитать) некоторые данные. Иногда процесс сбора данных может затянуться. Поэтому надо перед загрузкой диалога показывать окошко с прогрес-баром, либо просто сообщением пользователю, чтобы он подождал.
Однако ничего не выходит. Почему-то диалог с прогресс баром показывается только в виде серого прямоугольника без какого либо изображения. Изображение на этом диалоге появляется в лучшем случае в конце процесса загрузки данных, когда практически уже и не нужно.
Что делать?
7
26 июля 2013 года
@pixo $oft
3.4K / / 20.09.2006
Надо обрабатывать события в отдельном потоке. Естественно, что прогресс-бар отрисовывается только после того, как всё загрузится.
1.8K
30 июля 2013 года
Nadezda
62 / / 31.05.2004
Цитата: @pixo $oft
Надо обрабатывать события в отдельном потоке. Естественно, что прогресс-бар отрисовывается только после того, как всё загрузится.
К сожалению я не очень понимаю, как работать с потоками и как применять их к диалогам. Может есть какой-нибуть пример?
7
30 июля 2013 года
@pixo $oft
3.4K / / 20.09.2006
Примеров масса. Про потоки можно прочитать в MSDN. Для большей информативности желательно указать язык, а то вдруг речь про C♯ идёт.
327
31 июля 2013 года
UserNet2008
748 / / 03.04.2010
Цитата: @pixo $oft
Примеров масса. Про потоки можно прочитать в MSDN. Для большей информативности желательно указать язык, а то вдруг речь про C♯ идёт.
Это точно!!!
Цитата:
а то вдруг речь про C♯ идёт.
чё так . Вроде C# and VB-net в потоках нормально.
И ещё не очень понятен механизм сбора данных.
Цитата:
Для загрузки диалога необходимо собрать (прочитать) некоторые данные.
1.8K
31 июля 2013 года
Nadezda
62 / / 31.05.2004
В общем, привожу кусок кода:
Код:
ImportWatingForm waitForm = new ImportWatingForm();
waitForm.Show();
ImportModelUtils.ImportModel(path, ind, ref members, ref plates, sectManager);
waitForm.Hide();
ImportPreviewForm prevForm = new ImportPreviewForm(path, members, plates, sectManager);
prevForm.Show();
В общем, мне надо чтобы сначала появилась форма waitForm (нормально показалась со всеми контролами), потом прочитать данные из файла- функция
ImportModelUtils.ImportModel, а потом убрать waitForm и показать prevForm.
Читаю разные примеры и хелпы, пытаюсь химичить, но ничего не выходит. Либо waitForm нормально не показывается, либо показывется, но не выключается, либо вовсе не загружается.
С потоками столько всего разного, что никак не могу понять, как надо действовать в этой ситуации. Примеры чаще всего для консольных аппликаций.
1.8K
31 июля 2013 года
Nadezda
62 / / 31.05.2004
ImportModel- Это и есть процесс считывания данных. В общем, его можно перекинуть в любое место.
И в общем не обязательно прогресс бар- достаточно окошка с надписью "Пожалуйста подождите, идёт процесс чтения файла".
Просто я хочу, чтобы пользователь видел, что процесс идёт.
ImportWatingForm должна появляться в центре экрана. В ней нет ни рамочек, ни кнопочек, поэтому она должна появиться и убраться сама.
Код:
List<ImportedMemberData> members = new List<ImportedMemberData>();
List<ImportPlateData> plates = new List<ImportPlateData>();
- это и есть получаемые данные.
Когда все данные загрузятся, должна выскочить форма ImportPreviewForm, которая их обрабатывает, то есть показывает результат считывания.
327
31 июля 2013 года
UserNet2008
748 / / 03.04.2010
Самый простой способ это менять курсор
Код:
this.Cursor = Cursors.WaitCursor;
this.Current = Cursors.Default;
1.8K
31 июля 2013 года
Nadezda
62 / / 31.05.2004
Ну, если ничего не выйдет с окном, придётся влиять на курсор. Хотя окошко с предупреждением для пользоателя было бы предпочтительнее.
7
31 июля 2013 года
@pixo $oft
3.4K / / 20.09.2006
Цитата: UserNet2008
Вроде C# and VB-net в потоках нормально
Да я не к тому, что C♯ плохо дружит с потоками, просто надо было язык узнать.
Итак, C♯, отлично. В нём я не эксперт, но алгоритм, я думаю, сработает везде:
• создаёшь новый поток, в методе потока начинаешь загрузку данных,
• в текущем потоке создаёшь окно,
• если метод загрузки данных собственный, а не сторонний, то наверняка можно узнать прогресс получения оных, который будет передаваться в 1-й поток и выводиться на форме прогресса.
1.8K
01 августа 2013 года
Nadezda
62 / / 31.05.2004
Код:
class ImportProcess
{
List<ImportedMemberData> members = new List<ImportedMemberData>();
List<ImportPlateData> plates = new List<ImportPlateData>();
SectionManager sectManager = new SectionManager();
string mPath;
int mInd;
bool bImported = false;
public ImportProcess(string strPath, int ind)
{
mPath = strPath;
mInd = ind;
}
public void Import()
{
Thread myThread = new Thread(func);
myThread.Start();
//members = waitForm.Members;
//plates = waitForm.Plates;
ImportWatingForm waitForm = new ImportWatingForm(mPath, mInd, sectManager);
waitForm.Show();
ImportPreviewForm prevForm = new ImportPreviewForm(mPath, members, plates, sectManager);
prevForm.Show();
}
void func()
{
ImportModelUtils.ImportModel(mPath, mInd, ref members, ref plates, sectManager);
bImported = true;
}
}
Так что ли? Только я не могу понять, как определить, что импорт завершился и закрыть окно ImportWatingForm .
85K
06 августа 2013 года
Алексей Иевенко
16 / / 06.08.2013
А зачем в данном случае использовать потоки? Не лучше ли использовать события на начало считывания и на конец считывания. Если начало считывания — запускаем прогресс-бар. Когда уже нет ничего считывать — закрываем его. Нужно лишь продумать увеличение значения прогресс-бара со считыванием данных, либо привязку сделать все же объекту таймера и к событию Tick.....
1.8K
07 августа 2013 года
Nadezda
62 / / 31.05.2004
А зачем в данном случае использовать потоки? Не лучше ли использовать события на начало считывания и на конец считывания. Если начало считывания — запускаем прогресс-бар. Когда уже нет ничего считывать — закрываем его. Нужно лишь продумать увеличение значения прогресс-бара со считыванием данных, либо привязку сделать все же объекту таймера и к событию Tick.....
Ничего не получается. В этом случае прогресс бар просто не отображается. Его не видно. В лучшем случае показывается, когда уже поздно и не нужно.
Реклама на сайте | Обмен ссылками | Ссылки | Экспорт (RSS) | Контакты
Добавить статью | Добавить исходник | Добавить хостинг-провайдера | Добавить сайт в каталог
|
{
"url": "https://forum.codenet.ru/q73755/%D0%A1%D0%BE%D0%B7%D0%B4%D0%B0%D0%BD%D0%B8%D0%B5+%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B5%D1%81%D1%81+%D0%B1%D0%B0%D1%80%D0%B0.?s=0",
"source_domain": "forum.codenet.ru",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "75022",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y6EQ7YHEJSEMUC2RTYQYQDO5XNDJYGAI",
"WARC-Concurrent-To": "<urn:uuid:a3046ef9-7dc7-452b-aaae-edff5b08bf31>",
"WARC-Date": "2021-07-30T04:04:40Z",
"WARC-IP-Address": "85.142.116.225",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:45HKPYEL3VH6D23SFOWMD5RZUBA5DBVH",
"WARC-Record-ID": "<urn:uuid:0a282ef5-cb54-42c2-accf-9b1cff58962c>",
"WARC-Target-URI": "https://forum.codenet.ru/q73755/%D0%A1%D0%BE%D0%B7%D0%B4%D0%B0%D0%BD%D0%B8%D0%B5+%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B5%D1%81%D1%81+%D0%B1%D0%B0%D1%80%D0%B0.?s=0",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e4c67ae7-f5c0-44d7-acc8-a9c3b43631e3>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-148.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
19,
20,
32,
33,
47,
62,
74,
138,
139,
157,
158,
174,
203,
204,
228,
229,
234,
252,
260,
278,
522,
783,
795,
797,
815,
826,
846,
976,
981,
999,
1007,
1025,
1044,
1174,
1175,
1176,
1295,
1296,
1298,
1316,
1327,
1347,
1480,
1484,
1502,
1514,
1533,
1552,
1685,
1686,
1687,
1700,
1701,
1709,
1738,
1739,
1789,
1790,
1836,
1837,
1845,
1915,
1916,
1921,
1939,
1947,
1965,
1994,
1995,
1996,
1998,
2003,
2055,
2072,
2092,
2171,
2188,
2189,
2277,
2294,
2436,
2511,
2512,
2687,
2688,
2832,
2837,
2855,
2863,
2881,
2977,
3096,
3097,
3156,
3289,
3290,
3292,
3297,
3364,
3424,
3456,
3457,
3594,
3598,
3616,
3628,
3647,
3686,
3688,
3693,
3727,
3759,
3764,
3782,
3790,
3808,
3942,
3944,
3962,
3973,
3993,
4013,
4053,
4054,
4132,
4133,
4211,
4278,
4312,
4493,
4494,
4499,
4520,
4528,
4546,
4551,
4571,
4577,
4652,
4720,
4779,
4801,
4819,
4851,
4852,
4906,
4916,
4945,
4969,
4979,
4980,
5009,
5019,
5031,
5043,
5091,
5121,
5163,
5203,
5291,
5320,
5332,
5433,
5462,
5472,
5473,
5493,
5503,
5596,
5626,
5636,
5642,
5751,
5755,
5776,
5792,
5810,
6174,
6179,
6200,
6208,
6226,
6590,
6591,
6592,
6738,
6739,
6809
],
"line_end_idx": [
19,
20,
32,
33,
47,
62,
74,
138,
139,
157,
158,
174,
203,
204,
228,
229,
234,
252,
260,
278,
522,
783,
795,
797,
815,
826,
846,
976,
981,
999,
1007,
1025,
1044,
1174,
1175,
1176,
1295,
1296,
1298,
1316,
1327,
1347,
1480,
1484,
1502,
1514,
1533,
1552,
1685,
1686,
1687,
1700,
1701,
1709,
1738,
1739,
1789,
1790,
1836,
1837,
1845,
1915,
1916,
1921,
1939,
1947,
1965,
1994,
1995,
1996,
1998,
2003,
2055,
2072,
2092,
2171,
2188,
2189,
2277,
2294,
2436,
2511,
2512,
2687,
2688,
2832,
2837,
2855,
2863,
2881,
2977,
3096,
3097,
3156,
3289,
3290,
3292,
3297,
3364,
3424,
3456,
3457,
3594,
3598,
3616,
3628,
3647,
3686,
3688,
3693,
3727,
3759,
3764,
3782,
3790,
3808,
3942,
3944,
3962,
3973,
3993,
4013,
4053,
4054,
4132,
4133,
4211,
4278,
4312,
4493,
4494,
4499,
4520,
4528,
4546,
4551,
4571,
4577,
4652,
4720,
4779,
4801,
4819,
4851,
4852,
4906,
4916,
4945,
4969,
4979,
4980,
5009,
5019,
5031,
5043,
5091,
5121,
5163,
5203,
5291,
5320,
5332,
5433,
5462,
5472,
5473,
5493,
5503,
5596,
5626,
5636,
5642,
5751,
5755,
5776,
5792,
5810,
6174,
6179,
6200,
6208,
6226,
6590,
6591,
6592,
6738,
6739,
6809,
6900
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6900,
"ccnet_original_nlines": 188,
"rps_doc_curly_bracket": 0.0011594200041145086,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.01066260039806366,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02741812914609909,
"rps_doc_frac_lines_end_with_ellipsis": 0.010582010261714458,
"rps_doc_frac_no_alph_words": 0.8560548424720764,
"rps_doc_frac_unique_words": 0.4496036171913147,
"rps_doc_mean_word_length": 5.927519798278809,
"rps_doc_num_sentences": 115,
"rps_doc_symbol_to_word_ratio": 0.0030464599840343,
"rps_doc_unigram_entropy": 5.6172332763671875,
"rps_doc_word_count": 883,
"rps_doc_frac_chars_dupe_10grams": 0.19870080053806305,
"rps_doc_frac_chars_dupe_5grams": 0.3622468411922455,
"rps_doc_frac_chars_dupe_6grams": 0.3507833480834961,
"rps_doc_frac_chars_dupe_7grams": 0.3274742066860199,
"rps_doc_frac_chars_dupe_8grams": 0.29423004388809204,
"rps_doc_frac_chars_dupe_9grams": 0.19870080053806305,
"rps_doc_frac_chars_top_2gram": 0.019870080053806305,
"rps_doc_frac_chars_top_3gram": 0.022927019745111465,
"rps_doc_frac_chars_top_4gram": 0.02273596078157425,
"rps_doc_books_importance": -545.5672607421875,
"rps_doc_books_importance_length_correction": -545.5672607421875,
"rps_doc_openwebtext_importance": -302.98626708984375,
"rps_doc_openwebtext_importance_length_correction": -302.98626708984375,
"rps_doc_wikipedia_importance": -261.81243896484375,
"rps_doc_wikipedia_importance_length_correction": -261.81243896484375
},
"fasttext": {
"dclm": 0.04120064154267311,
"english": 0.000054060001275502145,
"fineweb_edu_approx": 1.7434139251708984,
"eai_general_math": -0.000009780000254977494,
"eai_open_web_math": 0.3826282024383545,
"eai_web_code": 0.9999208450317383
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "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": "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
|
-2,558,568,566,588,504,600 |
GWT (formerly the Google Web Toolkit) is a development toolkit for building and optimizing complex browser-based applications. Its goal is to enable productive development of high-performance web applications without requiring the developer to be an expert in browser quirks, XMLHttpRequest, and ...
learn more… | top users | synonyms (1)
0
votes
0answers
2 views
How to handle multiple pages in gwt appliction
I am working on gwt application I am using "Anchor" for this , I exactly want that without page refresh my content should be change and also browser will update the url Thanks
0
votes
0answers
12 views
How to handle the reveal action after hits the cancel button in popup
When I click a add link it opens a popup and I cancel the popup then it goes to the previous place. private class CancelHandler implements ClickHandler { @Override public void ...
0
votes
2answers
20 views
Parse Date with time zone from GWT
I read many of similar SO questions regarding this very topic, but I still am confused how to do it now... I try to make it simpel: I got this String: "Sat Jan 24 00:00:00 GMT+100 2015" which shall ...
1
vote
0answers
22 views
Use PayPal Express Checkout in a project GWT-RPC
In my project I need to integrate the PayPal service. I'm using GWT-RPC (java) but in the PayPal API there is a description how to make call only to a JSON and other services. So I don't know what I ...
1
vote
0answers
15 views
How can I create Custom Connector for Javascript for my Custom State in Vaadin 7.4.6
I found that we can create our custom connectors for our custom components in the vaadin. But I need to have a explicit/custom Connector for my Javascript. I noticed Vaadin create a implicit ...
0
votes
1answer
26 views
How to add complex chart in GWT project? [on hold]
I have GWT project and this is FX trading portal project. Unfortunately, it does not contain charting functionality. Please could you give me an advice how can I extend its functionality and add ...
0
votes
0answers
13 views
Getting some unexpected issues when analysis my GWT project with SonarQube
I have been developing an application using GWT and did a SonarQube implementation of it. But it did throw some unexpected results : bDateStart.addClickHandler(new ClickHandler(){ ...
0
votes
0answers
15 views
merge column header in DataGrid or cellTable in GWT 2.4
I want to know the workaround used to have colspan in DataGrid or CellTable I saw the the GWT showcase :http://samples.gwtproject.org/samples/Showcase/Showcase.html#!CwCustomDataGrid but there is no ...
1
vote
0answers
13 views
GWT Serialization exception with AutoValue
According to AutoValue documentation annotating the abstract class with @GwtCompatible(serializable = true) and implementing serializable should be enough for the generated value class to be usable in ...
1
vote
1answer
17 views
GWT, there is a way to ignore the CSS ID's generated when the code is compiled?
I'm using GWT in a new project that I'm working on and I'm facing a problem. Some of the CSS rules were defined into the XML file and not into a CSS file. The problem is that when GWT compiles the ...
0
votes
0answers
12 views
how to make dynamic grid in gwt use image
Grid grid = new Grid(7,7); fieldwidgets[WindmillDao.WINDFARMID_INDEX] = new LabelText(_dao.fieldproperties[WindmillDao.WINDFARMID_INDEX][FieldType.PROP_ARR_INDEX_NAME]); ...
0
votes
0answers
24 views
Scroll not minimizing height
As shown in the picture, I can see the allocated height in my page. There is a table which parented by a Div. I restricted height of div and applied scroll on inner table which is fine. Even the ...
0
votes
0answers
15 views
GWT (Eclipse): 2 modules (2 entry points) + 2 HTML pages => LoginService possible for both HTML pages?
I am a newbie to GWT and at the moment I have the problem that I created two modules (see appendix 1/2) with two entry point classes in my project. So I made two run configurations (see appendix 5/6) ...
0
votes
1answer
15 views
Initialize zurb-foundation within GWT UiBinder
I'm pretty new in GWT and foundation and wonder how it is possible to initialize foundation after adding a UiBinder as a widget. While it is not possible (afaik) to call a javascript method within the ...
3
votes
1answer
18 views
GWT DockPanel incorrectly formatting with Chrome
I am building a departmental website and am running into a unique issue with my dock panel resizing incorrectly, but only with Chrome. When I change the information inside the center of my dock ...
0
votes
0answers
14 views
Compilation gives error validation-api-<version>.jar and validation-api-<version>-sources.jar are missing, but succeeds without them
I am facing the same issue as mentioned in https://code.google.com/p/google-web-toolkit/issues/detail?id=6470. I already have validation-api-1.0.0.GA.jar, validation-api-1.0.0.GA-sources.jar in my ...
3
votes
2answers
27 views
GWT-JSNI passing a JavaScriptObject in an external JS library
I'm desesperatly trying to create an Anno object in a JSNI method but I have a strange problem : the code in the jsni method doesn't work but if I do the same in my browser console, it works fine. ...
0
votes
1answer
10 views
Checking GWT project source, How we can devide client source and server source
Looking at Google GWT project source, How we can divide client source and server source. Do we need to any configurations such as these are client packages and these are server packages like wise.
0
votes
1answer
20 views
Adding a dropdown or toggle button to DataGrid
Is there a way to add a dropdown button or toggle button to the CellTable or DataGrid? The documentation only demonstrates using a regular button (ButtonCell).
0
votes
0answers
40 views
How to resolve Null pointer Exception in client server action in gwt?
Here is my client side class Requirement:There is object which 2 references and those 2 references are referenced to 1 more reference with same id and getting the 2 url's from the server side ...
0
votes
0answers
30 views
Coloring of countries in Google maps V3 using KML
I am trying to color countries based on its let's say population. I have successfully managed to do it using KML layers, but the issue is when I zoom-in on the map, the KML layer starts getting ...
1
vote
1answer
35 views
Hints on migrating GWT to AngularJS
With the end of the development plugin, the fun has gone out of GWT development. Every small change triggers endless recompilation and then I'm still debugging half Java half Javascript in the ...
0
votes
0answers
10 views
GWT and CSS: Creating a drop down from hover
In the existing gwt project there are a set of buttons which when hovered lists a set of dropdown options. I want to create another drop down which will be created to the right when I hover over one ...
2
votes
0answers
23 views
My Javascript running into errors with vaadin NoLayout annotations requirement
My vaadin(7.4.6) application running into errors saying "cannot read property 'NoLayout'". This is happening because my application is having a window that being created through javascript only, and ...
0
votes
0answers
23 views
Application is loading but no content is displaying in Super Dev Mode
I migrated my GWT classic dev mode to super dev mode and configured every think in GWT 2.5.1 rc.While launching its compiling the application but when i hit the hostpage(html) its not loading the ...
1
vote
1answer
28 views
Gwt CheckBoxCell check uncheck issue
I am not able to check or uncheck a Gwt CheckBoxCell . It works fine in Chrome but it doesn't work at all in mozilla . What wrong i am doing ? Please Suggest . When i am selecting selectAllHeader not ...
0
votes
1answer
23 views
How to override GWT default style clean.css?
I want to use the clean.css style for my webapp but of course I want to override a few things for the purpose of customization. The problem is that my approach is not working. I have added these: ...
1
vote
1answer
29 views
Error while running the GWT developer mode
While starting my application in the GWT dev mode from Intellij. I got the following error:- ERROR: Failed to create an instance of 'com.vaadin.client.ApplicationConnection' via deferred binding ...
0
votes
0answers
23 views
Setup for Launching Super Dev Mode for Multi Module Maven Dependency Project(GWT 2.5.1)
I found lot of question related to SDM(Super Dev mode in GWT) but not able to setup SDM for my application.Since it has got lot of dependency maven project(multi module) which is added to main client ...
0
votes
0answers
40 views
GWT editor error message display time
I use GWT editor framework. I experience that the validation message disappears quickly. If it contains long text then the user can't read it. Is there any setting to change the display time of the ...
0
votes
0answers
12 views
Error with MySQL Connector jar versions in hibernate JNDI application
I am getting the below problem with MySQL-Connector-java-5.1.6.jar, but, I am able to run the same without getting the any problem in MySQL-Connector-java-3.1.10-bin.jar. But, I have performance ...
0
votes
0answers
15 views
error during vaadin widgetset compilation
I have created component based on GWT Component state package com.game.quest.ui.gwt; import com.vaadin.shared.AbstractComponentState; import java.util.ArrayList; import java.util.List; public ...
0
votes
1answer
26 views
How can I set the value of gwt-Textbox through jquery.val()?
I am using redQueryBuilder. It uses gwt for rendering the textbox elements. I want to change the value of textbox on focus of the element. I am trying the following code. ...
0
votes
0answers
15 views
Migrating Classic Dev Mode to Super Dev Mode using GWT 2.5.1
I find lot of stackoverflow question related to this How to migrate a a custom sublass of GWT DevMode to GWT 2.7.0 Super dev mode but unable to solve my issue.I am migrating classic dev mode to super ...
0
votes
2answers
42 views
Can't build kie-wb-webapp 6.1.x (JBPM)
I need to modify KIE Workbench source and I have two issues that are stopping me from building with Maven 3.2.5, one on Windows and one on Linux. On Windows 7, I am getting an error that says ...
0
votes
1answer
13 views
GWT starter project doesn't work when inherit smartGWT is added
I'm brand new to GWT and am trying to use SmartGWT. I got GWT setup and created a new project. The starter project that's supplied with the new project works fine, but once I add the smartGWT jars and ...
0
votes
0answers
16 views
GWT stand alone page?
My app has an email newsletter and i'd like to implement an "Unsubscribe" option on the HTML email itself. This link would bring them to an isolated page that simply lets them know they've been ...
0
votes
0answers
15 views
Deploying APK with MGWT/GWT using intellj
I might be downvoted for this question but I couldn't find a correct answer to solve my problem. I have an application using GWT/MGWT using intellij-idea. First of "Built->Generate singed APK option" ...
0
votes
0answers
20 views
Vaadin extension: MouseOverHandler
In a simple extension I add a VHorizontalLayout with some VLabel. To the layout I add a MouseOverHandler, but its method is never invoked. What is wrong? (Everything else works - i.e. the label is ...
0
votes
1answer
26 views
External function call from JSNI is not working
I am trying to translate this JavaScript code to JSNI code. Script Imports <script src="jquery-1.11.2.min.js"></script> <script src="jquery.typeahead.min.js"></script> ...
1
vote
1answer
25 views
GUI component for displaying chat messages?
I'm searching for a gwt component with the following properties: -Able to display Strings in a structured way, ie. username and message in seperate columns -providing control over the scrollbar In ...
-2
votes
0answers
33 views
Save Pdf with a specific name in GAE(gwt)
I am working on GAE. I have printed PDF but I want to save that pdf with a specific name. I tried pdf stamper but it is giving an error message java.io.FileOutputStream is not supported by ...
-6
votes
0answers
63 views
Java frontend frameworks [closed]
I'm about to start working on a Spring web app, but im not sure which frontend framework should i use, because there are just too many of them. For now i have only one year experiences with JSP. I'm ...
0
votes
1answer
28 views
cannot start tomcat when I add GWT dependency to vaadin project
I am trying to add for test purposes gflot to my vaadin application using this tutorial https://vaadin.com/wiki/-/wiki/Main/Integrating+an+existing+GWT+widget But when I add dependency to my ...
0
votes
0answers
28 views
dynamic grid using gwt with condition
database (MYSQL) table data is communication status data is 0 and 1's . i need data is 1 image will be display otherwise error msg.. how using dynamic grid and how to fetch database using json ...
0
votes
0answers
9 views
gwt-data lib maven import
I'm trying to add gwt-gdata library to a GWT maven project. I've added pom dependency : <dependency> <groupId>com.google.gdata</groupId> ...
0
votes
0answers
14 views
GWT Tree icons not shown
my standard Tree gets error with the icons(i dont use custom icons!) http://www.img-host.de/bild.php/56219,unbenannt9UHY7.jpg TreeItem root = new TreeItem(); root.setText("Baugruppe"); ...
0
votes
0answers
19 views
GWT 2.7.0 StackOverflowError
The projects works fine with GWT 2.6.1. Upon changing the version to 2.7.0 I am getting this error: [INFO] Compiling module com.example.gwt.Admin [ERROR] Exception in thread "main" ...
0
votes
0answers
18 views
GWT SuggestBox - how to force selection of n'th suggestion from popup
I have a SuggestBox with an oracle full of geocoded addresses. I want to enter a specific default text (actually an initial address from the URL parameter) with setValue() or setText() and then ...
0
votes
0answers
24 views
Gwt Transaction-identify whether client is active or not
What if the RPC response of the server does not reach the client because the client loses connection to the server? The client has no information whether the object was stored properly nor does it ...
|
{
"url": "http://stackoverflow.com/questions/tagged/gwt",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-27",
"warc_metadata": {
"Content-Length": "174866",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BUW7OEGHNBRHQAJEH7TA4WPWIVK3OI3W",
"WARC-Concurrent-To": "<urn:uuid:53e56e1a-d143-4664-aaad-be2c814558b2>",
"WARC-Date": "2015-07-07T13:27:14Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:P3JGP46WQUZ2JLMFV6PODCLXT7DVVJKA",
"WARC-Record-ID": "<urn:uuid:d934ade4-9c05-4e2a-86db-fc57de67e711>",
"WARC-Target-URI": "http://stackoverflow.com/questions/tagged/gwt",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ca06b31c-1db3-4607-a025-f4b46357932d>"
},
"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,
300,
301,
340,
341,
343,
349,
358,
366,
367,
414,
415,
591,
593,
599,
608,
617,
618,
688,
689,
869,
871,
877,
886,
895,
896,
931,
932,
1134,
1136,
1141,
1150,
1159,
1160,
1209,
1210,
1413,
1415,
1420,
1429,
1438,
1439,
1524,
1525,
1720,
1722,
1728,
1736,
1745,
1746,
1797,
1798,
1997,
1999,
2005,
2014,
2023,
2024,
2099,
2100,
2284,
2286,
2292,
2301,
2310,
2311,
2367,
2368,
2571,
2573,
2578,
2587,
2596,
2597,
2640,
2641,
2846,
2848,
2853,
2861,
2870,
2871,
2951,
2952,
3153,
3155,
3161,
3170,
3179,
3180,
3222,
3223,
3397,
3399,
3405,
3414,
3423,
3424,
3453,
3454,
3653,
3655,
3661,
3670,
3679,
3680,
3783,
3784,
3988,
3990,
3996,
4004,
4013,
4014,
4061,
4062,
4267,
4269,
4275,
4283,
4292,
4293,
4342,
4343,
4541,
4543,
4549,
4558,
4567,
4568,
4701,
4702,
4903,
4905,
4911,
4920,
4929,
4930,
4992,
4993,
5194,
5196,
5202,
5210,
5219,
5220,
5299,
5300,
5497,
5499,
5505,
5513,
5522,
5523,
5570,
5571,
5731,
5733,
5739,
5748,
5757,
5758,
5828,
5829,
6025,
6027,
6033,
6042,
6051,
6052,
6102,
6103,
6301,
6303,
6308,
6316,
6325,
6326,
6362,
6363,
6560,
6562,
6568,
6577,
6586,
6587,
6632,
6633,
6836,
6838,
6844,
6853,
6862,
6863,
6942,
6943,
7146,
7148,
7154,
7163,
7172,
7173,
7243,
7244,
7444,
7446,
7451,
7459,
7468,
7469,
7506,
7507,
7711,
7713,
7719,
7727,
7736,
7737,
7782,
7783,
7983,
7985,
7990,
7998,
8007,
8008,
8051,
8052,
8251,
8253,
8259,
8268,
8277,
8278,
8366,
8367,
8571,
8573,
8579,
8588,
8597,
8598,
8636,
8637,
8839,
8841,
8847,
8856,
8865,
8866,
8936,
8937,
9136,
9138,
9144,
9153,
9162,
9163,
9205,
9206,
9402,
9404,
9410,
9418,
9427,
9428,
9489,
9490,
9665,
9667,
9673,
9682,
9691,
9692,
9753,
9754,
9958,
9960,
9966,
9975,
9984,
9985,
10024,
10025,
10221,
10223,
10229,
10237,
10246,
10247,
10311,
10312,
10517,
10519,
10525,
10534,
10543,
10544,
10566,
10567,
10765,
10767,
10773,
10782,
10791,
10792,
10834,
10835,
11039,
11041,
11047,
11056,
11065,
11066,
11101,
11102,
11303,
11305,
11311,
11319,
11328,
11329,
11377,
11378,
11550,
11552,
11557,
11565,
11574,
11575,
11619,
11620,
11821,
11824,
11830,
11839,
11848,
11849,
11891,
11892,
12085,
12088,
12094,
12103,
12112,
12113,
12147,
12148,
12351,
12353,
12359,
12367,
12376,
12377,
12441,
12442,
12637,
12639,
12645,
12654,
12663,
12664,
12702,
12703,
12900,
12902,
12908,
12917,
12925,
12926,
12952,
12953,
13094,
13096,
13102,
13111,
13120,
13121,
13146,
13147,
13336,
13338,
13344,
13353,
13362,
13363,
13392,
13393,
13578,
13580,
13586,
13595,
13604,
13605,
13675,
13676,
13874,
13876,
13882,
13891,
13900,
13901,
13958,
13959
],
"line_end_idx": [
300,
301,
340,
341,
343,
349,
358,
366,
367,
414,
415,
591,
593,
599,
608,
617,
618,
688,
689,
869,
871,
877,
886,
895,
896,
931,
932,
1134,
1136,
1141,
1150,
1159,
1160,
1209,
1210,
1413,
1415,
1420,
1429,
1438,
1439,
1524,
1525,
1720,
1722,
1728,
1736,
1745,
1746,
1797,
1798,
1997,
1999,
2005,
2014,
2023,
2024,
2099,
2100,
2284,
2286,
2292,
2301,
2310,
2311,
2367,
2368,
2571,
2573,
2578,
2587,
2596,
2597,
2640,
2641,
2846,
2848,
2853,
2861,
2870,
2871,
2951,
2952,
3153,
3155,
3161,
3170,
3179,
3180,
3222,
3223,
3397,
3399,
3405,
3414,
3423,
3424,
3453,
3454,
3653,
3655,
3661,
3670,
3679,
3680,
3783,
3784,
3988,
3990,
3996,
4004,
4013,
4014,
4061,
4062,
4267,
4269,
4275,
4283,
4292,
4293,
4342,
4343,
4541,
4543,
4549,
4558,
4567,
4568,
4701,
4702,
4903,
4905,
4911,
4920,
4929,
4930,
4992,
4993,
5194,
5196,
5202,
5210,
5219,
5220,
5299,
5300,
5497,
5499,
5505,
5513,
5522,
5523,
5570,
5571,
5731,
5733,
5739,
5748,
5757,
5758,
5828,
5829,
6025,
6027,
6033,
6042,
6051,
6052,
6102,
6103,
6301,
6303,
6308,
6316,
6325,
6326,
6362,
6363,
6560,
6562,
6568,
6577,
6586,
6587,
6632,
6633,
6836,
6838,
6844,
6853,
6862,
6863,
6942,
6943,
7146,
7148,
7154,
7163,
7172,
7173,
7243,
7244,
7444,
7446,
7451,
7459,
7468,
7469,
7506,
7507,
7711,
7713,
7719,
7727,
7736,
7737,
7782,
7783,
7983,
7985,
7990,
7998,
8007,
8008,
8051,
8052,
8251,
8253,
8259,
8268,
8277,
8278,
8366,
8367,
8571,
8573,
8579,
8588,
8597,
8598,
8636,
8637,
8839,
8841,
8847,
8856,
8865,
8866,
8936,
8937,
9136,
9138,
9144,
9153,
9162,
9163,
9205,
9206,
9402,
9404,
9410,
9418,
9427,
9428,
9489,
9490,
9665,
9667,
9673,
9682,
9691,
9692,
9753,
9754,
9958,
9960,
9966,
9975,
9984,
9985,
10024,
10025,
10221,
10223,
10229,
10237,
10246,
10247,
10311,
10312,
10517,
10519,
10525,
10534,
10543,
10544,
10566,
10567,
10765,
10767,
10773,
10782,
10791,
10792,
10834,
10835,
11039,
11041,
11047,
11056,
11065,
11066,
11101,
11102,
11303,
11305,
11311,
11319,
11328,
11329,
11377,
11378,
11550,
11552,
11557,
11565,
11574,
11575,
11619,
11620,
11821,
11824,
11830,
11839,
11848,
11849,
11891,
11892,
12085,
12088,
12094,
12103,
12112,
12113,
12147,
12148,
12351,
12353,
12359,
12367,
12376,
12377,
12441,
12442,
12637,
12639,
12645,
12654,
12663,
12664,
12702,
12703,
12900,
12902,
12908,
12917,
12925,
12926,
12952,
12953,
13094,
13096,
13102,
13111,
13120,
13121,
13146,
13147,
13336,
13338,
13344,
13353,
13362,
13363,
13392,
13393,
13578,
13580,
13586,
13595,
13604,
13605,
13675,
13676,
13874,
13876,
13882,
13891,
13900,
13901,
13958,
13959,
14159
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14159,
"ccnet_original_nlines": 403,
"rps_doc_curly_bracket": 0.00014124999870546162,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31376516819000244,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06477732956409454,
"rps_doc_frac_lines_end_with_ellipsis": 0.11881188303232193,
"rps_doc_frac_no_alph_words": 0.2152496576309204,
"rps_doc_frac_unique_words": 0.32562199234962463,
"rps_doc_mean_word_length": 4.838498592376709,
"rps_doc_num_sentences": 212,
"rps_doc_symbol_to_word_ratio": 0.017206480726599693,
"rps_doc_unigram_entropy": 5.694900035858154,
"rps_doc_word_count": 2291,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05908885970711708,
"rps_doc_frac_chars_dupe_6grams": 0.024176819249987602,
"rps_doc_frac_chars_dupe_7grams": 0.009742899797856808,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02002706006169319,
"rps_doc_frac_chars_top_3gram": 0.032837171107530594,
"rps_doc_frac_chars_top_4gram": 0.007216960191726685,
"rps_doc_books_importance": -1388.1240234375,
"rps_doc_books_importance_length_correction": -1388.1240234375,
"rps_doc_openwebtext_importance": -801.3184814453125,
"rps_doc_openwebtext_importance_length_correction": -801.3184814453125,
"rps_doc_wikipedia_importance": -474.6910705566406,
"rps_doc_wikipedia_importance_length_correction": -474.6910705566406
},
"fasttext": {
"dclm": 0.02194369025528431,
"english": 0.8633741736412048,
"fineweb_edu_approx": 1.09059739112854,
"eai_general_math": 0.005836190190166235,
"eai_open_web_math": 0.11730241775512695,
"eai_web_code": 0.004969949834048748
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,386,462,388,781,897,000 |
What values can be used for the background-position property?
Frontend 2021-08-29 22:04:41 0 802
Either percentage value or word value can be used. The percentage value represents the horizontal distance on the background image. For example, “20% 70%” means 20% of the horizontal distance to the left and 70% of the vertical distance to the upper side; if a word value is used, for example, “right center” means that the horizontal distance is right, Center vertically.
Your opinion
Already have 0 Article answer
|
{
"url": "https://itdot.cn/en/frontend/53.html",
"source_domain": "itdot.cn",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "17703",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EZ7QJFQ5SDVHUEWNKOFAFFP7KQJYWQ4T",
"WARC-Concurrent-To": "<urn:uuid:c39e3329-e9ce-4317-baba-5d15490e246b>",
"WARC-Date": "2022-01-22T17:04:10Z",
"WARC-IP-Address": "8.140.175.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NEILB66CUVW73B7NGUUODN6F2F7AVCN6",
"WARC-Record-ID": "<urn:uuid:0ac72223-e8d4-424d-a230-1155e79e2e0f>",
"WARC-Target-URI": "https://itdot.cn/en/frontend/53.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef7eb09c-5ec9-4483-906d-98b462a166b9>"
},
"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-95\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
62,
63,
98,
99,
472,
473,
474,
487,
488
],
"line_end_idx": [
62,
63,
98,
99,
472,
473,
474,
487,
488,
517
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 517,
"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.3486238420009613,
"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.31192660331726074,
"rps_doc_frac_unique_words": 0.6385542154312134,
"rps_doc_mean_word_length": 4.963855266571045,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.7608184814453125,
"rps_doc_word_count": 83,
"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.0946601927280426,
"rps_doc_frac_chars_top_3gram": 0.15291261672973633,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -33.899505615234375,
"rps_doc_books_importance_length_correction": -45.25954818725586,
"rps_doc_openwebtext_importance": -22.682607650756836,
"rps_doc_openwebtext_importance_length_correction": -34.04264831542969,
"rps_doc_wikipedia_importance": -21.94566535949707,
"rps_doc_wikipedia_importance_length_correction": -33.30570602416992
},
"fasttext": {
"dclm": 0.9674378037452698,
"english": 0.7277728915214539,
"fineweb_edu_approx": 3.6690633296966553,
"eai_general_math": 0.9901647567749023,
"eai_open_web_math": 0.9055510759353638,
"eai_web_code": 0.4819251298904419
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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
|
8,329,245,751,367,181,000 |
AWS Database Blog
Building a data discovery solution with Amundsen and Amazon Neptune
This blog post was last reviewed or updated May, 2022.
September 8, 2021: Amazon Elasticsearch Service has been renamed to Amazon OpenSearch Service. See details.
In this post, we discuss the need for a metadata and data lineage tool and the problems it solves, how to rapidly deploy it in the language you prefer using the AWS Cloud Development Kit (AWS CDK), as well as getting your first loads of metadata into the tool.
Modern data stacks involve ingesting from a wide variety of sources, undergoing multiple layers of transformations, and then surfacing insights through an array of visualizations and reports. This is similar to how traditional data stacks were built; involving more than just a single source—although certainly the challenge has grown over time. To provide a concrete example we introduce Amundsen, an open source tool for data discovery and metadata, and show a sample application in a fictional company whose datasets we ingest and make queryable.
A common challenge in both small and large enterprises is that it’s becoming increasingly difficult to find the right report that answers a particular business question. Furthermore, the lineage of that report’s data as well as the accuracy of it is often a mystery. It’s the famous “can I trust this data?” question.
The birth of Amundsen
To answer this ever-increasing sprawl of data sources, a new range of open-source metadata and lineage tools, led by Amundsen, has sprung up that provide business users the ability to easily trace data lineage from source to dashboard. They often involve purpose-built databases such as graph and search, and the need for integrations with a variety of source systems to allow for metadata loading and parsing.
The challenge is that deploying and maintaining open-source tooling can be complex, with the need to run ops on new styles of databases that folks may not have expertise in. Enter Amazon Neptune, a fully managed database, and Amazon Elasticsearch Service (Amazon ES), a fully managed search cluster. But we also need jobs to run on a regular basis to crawl through the various data sources and databases within the organization and load that into Amundsen, because it can provide this rich source of metadata for your organization. We run this as Amazon CloudWatch events triggered by AWS Fargate tasks, which we discuss later in this post.
Solution overview
In this section, we break the solution down into manageable chunks that we can later deploy via the AWS CDK. First, we’re dealing with databases, so we host them in an Amazon Virtual Private Cloud (Amazon VPC). Then we have a source system, a fictional application database hosted in Amazon Relational Database Service (Amazon RDS) for PostgreSQL. In a typical enterprise environment, analytical queries made on that data are copied across to a data warehouse, in this case Amazon Redshift. We use federated queries to gain access to Amazon RDS for PostgreSQL from Amazon Redshift. This concludes our core business stack.
From here, we move on to the Amundsen deployment and then look at the data loaders. For Amundsen, we need a Neptune cluster, an Elasticsearch cluster, and three Fargate containers (frontend UI, metadata API, and search API). From there, we need to load Amundsen with the metadata from our datastores within our fictional company. We do this with Fargate tasks triggered on a regular basis from CloudWatch events to capture any changes or updates in our data stores.
To summarize, we deploy the following:
• VPC stack
• Amazon RDS for PostgreSQL
• Amazon Redshift cluster
• Bastion host
• Amundsen
• Databuilder for Amundsen
Architecture overview
Our architecture is comprised of several components: the initial data loader, Amundsen Databuilder, Amundsen UI and services, and supporting AWS services (see the following diagram).
The estimated cost per day is approximately $20 USD and more details on Neptune pricing can be found here. Make sure that you delete the stacks when you’re done, and check and delete any orphaned infrastructure such as databases to avoid ongoing charges.
AWS CDK for infrastructure as code
We can achieve rapid deployment via the AWS CDK, which is a new way to deploy infrastructure as code in a programming language that is familiar to the developer with specific modules for Neptune, Amazon ES, Fargate, Application Load Balancer, and many other AWS resources.
Prerequisites
To get started, you need an AWS account, preferably free from any production workloads. You also need an AWS Identity and Access Management (IAM) role to deploy with from an AWS Cloud9 integrated development environment (IDE), or an IAM user with admin permissions, because the stacks we’re deploying with require significant access.
Important: You must increase the size of the EBS volume attached to your Cloud9 instance as the default size (10GB) is not enough. Follow the instructions on the Cloud9 documentation to resize your EBS volume to at least 30GB.
Once we have that in place, it’s time to get ready to deploy.
Service-linked role
Amazon ES uses IAM service-linked roles. A service-linked role is a unique type of IAM role that is linked directly to Amazon ES. Service-linked roles are predefined by Amazon ES and include all the permissions that the service requires to call other AWS services on your behalf. To create a service-linked role for Amazon ES, issue the following command:
aws iam create-service-linked-role --aws-service-name es.amazonaws.com
AWS Cloud9
AWS Cloud9 is a cloud-based IDE that lets you write, run, and debug your code with just a browser. AWS Cloud9 comes preconfigured with many of the dependencies we require for this blog post, such as git, npm, and AWS CDK.
Create an AWS Cloud9 environment from the AWS console. Provide the required name, and leave the remaining default values. After your environment is created, you should have access to a terminal window.
From the terminal window, let’s clone the GitHub repo:
git clone https://github.com/aws-samples/amazon-neptune-samples
cd amazon-neptune-samples/amazon-neptune-and-aws-cdk-for-amundsen
# Update to latest npm
npm install -g npm@latest
# Install packages
npm install
# Build
npm run build
# Bootstrap AWS Cloud Development Kit (AWS CDK)
cdk bootstrap
# Synthesize CloudFormation
cdk synth
The following sections describe the resources created by the respective stacks. By default, the AWS CDK prompts the user to deploy changes. If you want to skip confirmations, add the following command line option to the AWS CDK commands provided:
--require-approval never
Stack deployment
Now onto the fun part, where we begin rolling out our infrastructure with six stacks in total to deploy. These resources can come with considerable hourly charges, so you should delete these stacks upon completion—especially if this is coming out of your personal account.
VPC stack
The VPC stack creates a VPC with a CIDR block specified in the vpc-cidr context variable declared in the file cdk.json. The default CIDR block is 10.100.0.0/16. This stack creates two public and two private subnets. Access to the internet is enabled with an Internet gateway as well as a NAT gateway for private subnets. For production workloads, consider increasing the number of NAT gateways to two instead of the default one. To allow access via AWS Systems Manager Session Manager, VPC endpoints are created for AWS Systems Manager, Systems Manager messages, and Amazon Elastic Compute Cloud (Amazon EC2) messages. To keep network traffic on the Amazon backbone, VPC endpoints are created for Amazon Simple Storage Service (Amazon S3), as well as access to Amazon Elastic Container Registry (Amazon ECR). A security group is created, which allows traffic from the VPC CIDR block to individual services ports. To eliminate the need to specify passwords and risk exposure of database credentials, we use AWS Secrets Manager to create separate credentials for Amazon RDS and Amazon Redshift, with passwords automatically generated. Lastly, an S3 bucket is created to be used by our Amundsen Databuilder. The following diagram illustrates this architecture.
To deploy the VPC stack, run the following command:
cdk deploy Amundsen-Blog-VPC-Stack
Amazon RDS stack
To simulate a real-world customer environment, our Amazon RDS stack creates an RDS instance. This database is loaded with sample data from an existing Neptune sample project: Knowledge Graph Chatbot Full Stack Application Example.
A single t3.medium RDS for PostgreSQL DB instance is created as part of the Amazon RDS stack. In a production environment, we recommend using a Multi-AZ configuration with an m5 or m6g instance type. The DB instance is created with a default database schema, default port, and associated with the credentials created in Secrets Manager by our VPC stack. The default values are defined as context variables in the file cdk.json. Context variables are rds-database (default database schema), and rds-port (default port). Our DB instance is associated with a DB subnet group, which is associated with the private subnets created by our VPC stack, and supports high availability across Availability Zones if we choose to enable Multi-AZ. The following diagram depicts a potential secondary instance and read replica. We use the security group created by our VPC stack to limit inbound TCP network traffic to the default port of 5432 from IP addresses in our VPC CIDR block 10.100.0.0/16.
To deploy the Amazon RDS stack, run the following command:
cdk deploy Amundsen-Blog-RDS-Stack
Amazon Redshift stack
Most customers use Amazon Redshift for online analytical processing (OLAP) and business intelligence (BI) applications. We use Amazon Redshift federated queries to run queries against our Amazon RDS database, and create tables from the results in Amazon Redshift. Our goal is to build a representative dataset to catalog with our Amundsen Databuilder.
Our Amazon Redshift stack creates a single-node Amazon Redshift cluster in the VPC created by our VPC stack. The cluster is deployed in our private subnets, and uses the security groups created by our VPC stack. A role is created using the least privilege principle, allowing access to only the Amazon RDS and Amazon Redshift secrets created by our VPC stack. In a production environment, a multi-node cluster is recommended. The following diagram includes an optional secondary node. The security group created by our VPC stack is used to limit inbound TCP network traffic to the default port of 5439 from IP addresses in our VPC CIDR block 10.100.0.0/16.
To deploy the Amazon Redshift stack, run the following command:
cdk deploy Amundsen-Blog-Redshift-Stack
Bastion stack
A bastion host (Linux) is created, which we use to connect to other instances and services in the previously created VPC. The operating system is Amazon Linux 2 with the latest Systems Manager agent installed. We apply least privilege principles, and only associate the managed policies AmazonS3FullAccess and SecretsManagerReadWrite. A custom policy is applied to the bastion host, which allows IAM database authentication to our Neptune cluster for Databuilder testing. The bastion host has no inbound access allowed, and access is limited to Session Manager, which is a recommended best practice. The following diagram illustrates this architecture.
The bastion host stack runs several commands during the first boot cycle when the EC2 instance is launched. These commands install the necessary packages and dependencies, and prepare our environment with sample chatbot data via a series of steps. The load steps are depicted in the following diagram.
Step 1 copies a PostgreSQL (PG) dump file from the S3 bucket amundsen-neptune-blog to local storage on our bastion host. Step 2 uses the locally installed postgres pg_restore tool to restore the dump file to our RDS instance. Step 3 creates a federated query external schema chatbot_external in Amazon Redshift, and aggregates data from our RDS instance into a new table chatbot_dw.author_summary in Amazon Redshift.
To deploy the bastion stack, run the following command:
cdk deploy Amundsen-Blog-Bastion-Stack
Amundsen stack
The Amundsen stack is where the data discovery tool is hosted. For state, we use an Amazon Elasticsearch Service cluster and Neptune graph database. Amazon Elasticsearch Service is fronted by a search service in the form of an API hosted on Fargate. Likewise, our graph database hosted on Neptune is fronted by a metadata service, which again is an API hosted on Fargate. The two containers deployed on Fargate are joined by a third container, a frontend service that contains the main application code. To access the frontend from the internet, an application load balancer is in front of it. The following diagram illustrates how this all fits together.
Frontend service
Amundsen’s frontend is a flask app hosted on the default port 5000.
We need to set some environment variables in order for the containers to talk to one another and the Neptune and Elasticsearch clusters:
SEARCHSERVICE_BASE: 'http://localhost:5001'
METADATASERVICE_BASE: 'http://localhost:5002'
FRONTEND_SVC_CONFIG_MODULE_CLASS: 'amundsen_application.config.TestConfig'
Next, we set up the search service.
Search service
The search service is a flask API specified via swagger documents that talks to Amazon ES. It requires the following environment variables:
PROXY_CLIENT: 'ELASTICSEARCH'
CREDENTIALS_PROXY_USER: ''
CREDENTIALS_PROXY_PASSWORD: ''
LOG_LEVEL: 'DEBUG'
PORT: '5001'
PROXY_PORT: '443'
PROXY_ENDPOINT: `https://${esDomain.attrDomainEndpoint}`
We specify the Amazon ES endpoint, the port, and the client type of ELASTICSEARCH.
Metadata service
Similar to the search service, the metadata service requires the following environment variables:
METADATA_SVC_CONFIG_MODULE_CLASS: 'metadata_service.config.NeptuneConfig'
AWS_REGION: ${this.region}
S3_BUCKET_NAME: 'props.airflowS3Bucket.bucketName'
IGNORE_NEPTUNE_SHARD: 'True'
PROXY_CLIENT: 'NEPTUNE'
PROXY_PORT: '8182'
PROXY_HOST: wss://${neptuneCluster.attrEndpoint}:8182/gremlin
PROXY_ENCRYPTED: 'True'
PROXY_VALIDATE_SSL: 'False'
The use of Boto3 requires you to set an AWS Region. We need to specify an S3 bucket due to Neptune’s bulk data loader. The proxy client is Neptune, with a port of 8182, and the proxy host has the prefix as wss:// and the suffix of the port as /gremlin.
Elasticsearch and Neptune clusters
We do fairly standard deployment configurations for Amazon ES and Neptune—using a t3.small and t3.medium, respectively—but we highly recommend R5 instance types with Multi-AZ enabled in production settings.
To deploy the Amundsen stack, run the following command:
cdk deploy Amundsen-Blog-Amundsen-Stack
The Amundsen frontend hostname will be output to multiple places. First, the AWS CDK console output will include the following:
Amundsen-Blog-Amundsen-Stack.amundsenfrontendhostname = <amundsen-frontend-hostname>
As well, the associated CloudFormation stack Amundsen-Blog-Amundsen-Stack will have a key-value pair output with the key amundsenfrontendhostname. The Amundsen frontend hostname should be accessible over HTTP.
Databuilder stack
We modified the existing postgres extractor and Neptune sample loader scripts from the Amundsen GitHub repo. Our Databuilder stack depends on a Docker image created with the Dockerfile in /lib/databuilders/postgres/. This containerized Python script is added to a scheduled Fargate task. The following diagram details the Amundsen Databuilder flow.
The flow has the following steps:
1. The containerized Python script is pulled from Amazon ECR and run every 5 minutes with the Fargate task definition and associated environment variables set during deployment of the AWS CDK stack.
2. The Python script runs the Postgres extractor to retrieve table and column information from the chatbot schema in our Postgres database.
3. The node and relationship files are written to an S3 bucket created by our VPC stack.
4. The Neptune bulk loader is used to load the nodes and edges.
5. The Amazon ES index is updated with the searchable data, such as table and column names.
To deploy the Databuilder stack, run the following command:
cdk deploy Amundsen-Blog-Databuilder-Stack
The Databuilder task run every 5 minutes, so be patient after the initial stack deployment before opening the Amundsen frontend in your browser.
The dataset
As previously mentioned, our example dataset is from another post: Supercharge your knowledge graph using Amazon Neptune, Amazon Comprehend, and Amazon Lex. This dataset consists of data extracted from the AWS Database Blog for Neptune. To create this data, posts were scraped from the website to create a semi-structured representation of a blog, each of which contains the following attributes:
• Post – The post information such as URL, title, and date posted
• Author – The author of the post, including the author’s name
• Tag – The tags applied to the post
When we connect these entities, we get the following domain model.
From this domain model, we created a relational database schema consisting of five tables:
• Posts
• Post_tags
• Tags
• Authors
• Post_authors
Blog data was then loaded into this database, and after a short while it’s available for searching via the Amundsen console. In the following screenshot, we try it out using the keyword “chatbot.”
You should get something like the following as a response.
You can explore this list of tables to look at the column names and add descriptions to them.
Clean up
To clean up, you must remove your Amazon Redshift cluster manually. Refer to Deleting a cluster for more information.
Then you can simply run the following command:
cdk destroy --all
However, certain AWS resources aren’t completely deleted by the AWS CDK destroy command. For example, you need to delete the Amazon ECR repository via console or the AWS Command Line Interface (AWS CLI).
Don’t forget to also delete your Cloud9 environment if you no longer need it.
Conclusion
In this post, we used an application database in the form of postgres as a source, imported the data into Amazon Redshift, and extracted the metadata out of the two and imported them into Amundsen. From there we explored those tables and columns using the Amundsen frontend. This is just scratching the surface of the capabilities of this tool.
We hope you have enjoyed this post as much as we have putting it together. Amundsen is a great new project for solving the data democratization challenge within an enterprise. We hope this also gives you a bit of context as to how graph databases can solve some interesting problems in a much more elegant way than traditional relational database management services, and perhaps inspire you to use them more!
About the Author
Peter Hanssens is an AWS Hero, Solutions Architect, and Founder of Cloud Shuttle, a community-focused cloud consultancy. He counts his major interests on the intersection between serverless and data engineering. Peter is a community leader—he has led the Sydney Serverless community for the past 3 years and has also built out data engineering communities in Melbourne, Sydney, and Brisbane. He’s passionate about helping others learn and grow their careers through shared experiences. Peter ran the first-ever ServerlessDays in Australia in 2019, and in 2020 he organized AWS Serverless Community Day ANZ, ServerlessDays ANZ, and DataEngBytes, a community-built data engineering conference.
Don Simpson is a Principal Solutions Architect at Amazon Web Services. Since the age of 12, Don has been completely immersed in realizing his dreams with code. Don’s journey to AWS involved multiple startups he co-founded, and thought leadership in the area of knowledge graphs, link analysis, discourse analysis, and real-time analytics. Don enjoys working with customers to design well-architected solutions to help achieve their desired business outcomes. @don__simpson
|
{
"url": "https://aws.amazon.com/blogs/database/building-a-data-discovery-solution-with-amundsen-and-amazon-neptune/",
"source_domain": "aws.amazon.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "98062",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:T6HI2CGQFSRHZP5R5TOQVK3YNACF7NFG",
"WARC-Concurrent-To": "<urn:uuid:fdb7f099-3ac3-45f1-b8af-db55400ae5be>",
"WARC-Date": "2022-05-29T06:53:12Z",
"WARC-IP-Address": "18.67.73.66",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:J7REYSS4J6T6HDRKDTTLN4WSVFCMBC3T",
"WARC-Record-ID": "<urn:uuid:886d2392-e1fc-4acd-98b5-005ac63ec50a>",
"WARC-Target-URI": "https://aws.amazon.com/blogs/database/building-a-data-discovery-solution-with-amundsen-and-amazon-neptune/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e36416fb-9a88-448a-8f1f-9756d3f708dc>"
},
"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-177\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,
18,
19,
87,
88,
143,
144,
252,
253,
514,
515,
1065,
1066,
1384,
1385,
1407,
1408,
1819,
1820,
2461,
2462,
2480,
2481,
3103,
3104,
3570,
3571,
3610,
3611,
3625,
3655,
3683,
3700,
3713,
3742,
3743,
3765,
3766,
3949,
3950,
4205,
4206,
4241,
4242,
4515,
4516,
4530,
4531,
4865,
4866,
5093,
5094,
5156,
5157,
5177,
5178,
5534,
5535,
5606,
5607,
5618,
5619,
5841,
5842,
6044,
6045,
6100,
6101,
6165,
6231,
6254,
6280,
6299,
6311,
6319,
6333,
6381,
6395,
6423,
6433,
6434,
6681,
6682,
6707,
6708,
6725,
6726,
6999,
7000,
7010,
7011,
8269,
8270,
8322,
8323,
8358,
8359,
8376,
8377,
8608,
8609,
9593,
9594,
9653,
9654,
9689,
9690,
9712,
9713,
10065,
10066,
10723,
10724,
10788,
10789,
10829,
10830,
10844,
10845,
11498,
11499,
11801,
11802,
12219,
12220,
12276,
12277,
12316,
12317,
12332,
12333,
12989,
12990,
13007,
13008,
13076,
13077,
13214,
13215,
13259,
13305,
13380,
13381,
13417,
13418,
13433,
13434,
13574,
13575,
13605,
13632,
13663,
13682,
13695,
13713,
13770,
13771,
13854,
13855,
13872,
13873,
13971,
13972,
14046,
14073,
14124,
14153,
14177,
14196,
14258,
14282,
14310,
14311,
14564,
14565,
14600,
14601,
14808,
14809,
14866,
14867,
14907,
14908,
15036,
15037,
15122,
15123,
15333,
15334,
15352,
15353,
15702,
15703,
15737,
15738,
15939,
16081,
16172,
16238,
16332,
16333,
16393,
16394,
16437,
16438,
16583,
16584,
16596,
16597,
16994,
16995,
17063,
17128,
17167,
17168,
17235,
17236,
17327,
17328,
17338,
17352,
17361,
17373,
17390,
17391,
17588,
17589,
17648,
17649,
17743,
17744,
17753,
17754,
17872,
17873,
17920,
17921,
17939,
17940,
18144,
18145,
18223,
18224,
18235,
18236,
18581,
18582,
18992,
18993,
18994,
19011,
19012,
19704,
19705
],
"line_end_idx": [
18,
19,
87,
88,
143,
144,
252,
253,
514,
515,
1065,
1066,
1384,
1385,
1407,
1408,
1819,
1820,
2461,
2462,
2480,
2481,
3103,
3104,
3570,
3571,
3610,
3611,
3625,
3655,
3683,
3700,
3713,
3742,
3743,
3765,
3766,
3949,
3950,
4205,
4206,
4241,
4242,
4515,
4516,
4530,
4531,
4865,
4866,
5093,
5094,
5156,
5157,
5177,
5178,
5534,
5535,
5606,
5607,
5618,
5619,
5841,
5842,
6044,
6045,
6100,
6101,
6165,
6231,
6254,
6280,
6299,
6311,
6319,
6333,
6381,
6395,
6423,
6433,
6434,
6681,
6682,
6707,
6708,
6725,
6726,
6999,
7000,
7010,
7011,
8269,
8270,
8322,
8323,
8358,
8359,
8376,
8377,
8608,
8609,
9593,
9594,
9653,
9654,
9689,
9690,
9712,
9713,
10065,
10066,
10723,
10724,
10788,
10789,
10829,
10830,
10844,
10845,
11498,
11499,
11801,
11802,
12219,
12220,
12276,
12277,
12316,
12317,
12332,
12333,
12989,
12990,
13007,
13008,
13076,
13077,
13214,
13215,
13259,
13305,
13380,
13381,
13417,
13418,
13433,
13434,
13574,
13575,
13605,
13632,
13663,
13682,
13695,
13713,
13770,
13771,
13854,
13855,
13872,
13873,
13971,
13972,
14046,
14073,
14124,
14153,
14177,
14196,
14258,
14282,
14310,
14311,
14564,
14565,
14600,
14601,
14808,
14809,
14866,
14867,
14907,
14908,
15036,
15037,
15122,
15123,
15333,
15334,
15352,
15353,
15702,
15703,
15737,
15738,
15939,
16081,
16172,
16238,
16332,
16333,
16393,
16394,
16437,
16438,
16583,
16584,
16596,
16597,
16994,
16995,
17063,
17128,
17167,
17168,
17235,
17236,
17327,
17328,
17338,
17352,
17361,
17373,
17390,
17391,
17588,
17589,
17648,
17649,
17743,
17744,
17753,
17754,
17872,
17873,
17920,
17921,
17939,
17940,
18144,
18145,
18223,
18224,
18235,
18236,
18581,
18582,
18992,
18993,
18994,
19011,
19012,
19704,
19705,
20177
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 20177,
"ccnet_original_nlines": 253,
"rps_doc_curly_bracket": 0.00029736998840235174,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3275998830795288,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04816088825464249,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1637999564409256,
"rps_doc_frac_unique_words": 0.29915639758110046,
"rps_doc_mean_word_length": 5.299805164337158,
"rps_doc_num_sentences": 179,
"rps_doc_symbol_to_word_ratio": 0.001323099946603179,
"rps_doc_unigram_entropy": 5.793616771697998,
"rps_doc_word_count": 3082,
"rps_doc_frac_chars_dupe_10grams": 0.013101509772241116,
"rps_doc_frac_chars_dupe_5grams": 0.06544630974531174,
"rps_doc_frac_chars_dupe_6grams": 0.03979428857564926,
"rps_doc_frac_chars_dupe_7grams": 0.030733440071344376,
"rps_doc_frac_chars_dupe_8grams": 0.017509490251541138,
"rps_doc_frac_chars_dupe_9grams": 0.013101509772241116,
"rps_doc_frac_chars_top_2gram": 0.019835930317640305,
"rps_doc_frac_chars_top_3gram": 0.01046895980834961,
"rps_doc_frac_chars_top_4gram": 0.006367090158164501,
"rps_doc_books_importance": -1863.1851806640625,
"rps_doc_books_importance_length_correction": -1863.1851806640625,
"rps_doc_openwebtext_importance": -1018.279541015625,
"rps_doc_openwebtext_importance_length_correction": -1018.279541015625,
"rps_doc_wikipedia_importance": -744.6135864257812,
"rps_doc_wikipedia_importance_length_correction": -744.6135864257812
},
"fasttext": {
"dclm": 0.06492363661527634,
"english": 0.8907568454742432,
"fineweb_edu_approx": 1.7502058744430542,
"eai_general_math": 0.35899853706359863,
"eai_open_web_math": 0.08753305673599243,
"eai_web_code": 0.8139889240264893
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,785,989,371,766,311,000 |
* Posts by deshepherd
224 posts • joined 11 Jun 2009
Page:
Young blokes blinded by video-game addiction: THE FACTS
deshepherd
Re: Actually ...
Why? Simple answer: There is no possibility of saving, and then restarting the game from where you left off in RealLife[tm]
I remember a VW advert when I was in the US in late 90s which promtoed both the "fun" and "safety" features of one of their model and had the tag line "because in real life there is no reset button"
0
0
Thirty-five years ago today: Space Invaders conquer the Earth
deshepherd
Re: Doesn't time fly
I remember being intrigued by this when I saw a machine in the student common room at college
We had one in our school computer lab to show that computing wasn't just BASIC programs on 380Z's! Also, got the school model railway club to set up a layout using the then "state of the art" Hornby computer controlled system.
I was too mean to spend my meagre beer tokens on playing it though
Aha, someone discovered that it you rocked the whole machine from side to side at the right speed something would flip in the coin mechanism and you'd suddenly have 99 credits!
0
0
It's a fiddle! Funnyman's Irish tax flashmob floods Apple flagship store
deshepherd
Re: $100Bn cash pile
The problem Apple have is that they've parked their cash in a location where no tax is paid - US considers it to be in Ireland so they won't tax it until it comes back into the US while Ireland consider it to be "stateless" so isn't taxed in Ireland. Basically to use the money Apple will need to pay the normal tax on it except they seem to be holding out for the US treasury to annouce a special amnesty to all US companies to repatriate overseas captial without having to pay (the full) tax .... probably wrapped up as a "helping US companies bring overseas money back to invest in US jobs" measure or something like that -- they did this once before so everyone like Apple etc is assuming they'll do it again. And in the meantime they can use the cash pile as collateral to raise enourmous money on bonds at low interest (because if necessary they could redeem all the bonds with the 70% of the Irish cash pile that would be left if they pulled it back to the US and paid tax)
4
0
Tea, Earl Grey, hot! NASA blows $125k on Star Trek 3D FOOD PRINTER
deshepherd
Re: Primitive Food Replicator
Can see problems coming (or should that be brewing) when they send the UK astronaut to the ISS in a couple of years time and he asks for a cup of burnt leaves in hot water!
4
0
Star Trek: The original computer game
deshepherd
Hex code? - thee were lucky!
When I was at school we had to enter the bootstrap loader for the PDP-8/e using the toggle switches on the front.
Don't worry, been there, done that (was a time at school when I knew the DG Nova bootstrap code from memory). And on a few occasions reinstalled RDOS starting with bootstrap load on swicthes followed by binary loader followed by several dozen boxes of fanfold tape and a chance to practice the skill of catching the tape coming through the tape reader (immensely high speed of 300bytes/sec!) so it re-fan-folded itself.
0
0
deshepherd
Remember this well from school days ... must have had the BASIC version on the school's Data General mini computer (someone had the Dave Ahl 101 Basic Games book and I certainly spent many hours either dictating or type these into a teletype!) but also remember when someone published a version that would run on our new fangled 6800 micro system in the electronics lab. This needed to be typed in as hex code to get it into the system and being a humungeously large program it wouldn't fit in the 1kB RAM on the processor eurocard so was a big rush to build a 4kB memort expansion eurocard to add to it!
2
0
Google adds Atari Easter Egg for Breakout's birthday
deshepherd
Re: Addiction broken
We had an Apple ][ in the school computer lab .... main machines were RM-380Z's. From recollection the only use for the Apple ][ was playing "little brickout" (and for serious gaming we had a space invaders machine!)
0
0
Drone to deliver beer-as-a-service
deshepherd
Re: As a guy who once was paid good money to jump out of perfectly good airplanes ...
Air currents don't cooperate with pin-point accuracy. Even with a human at the controls.
Need to develop "smart cans" that can guide themselves to the target on descent then!
4
0
M&S shoppers make quarter of a million NFC payments a WEEK
deshepherd
Re: M & S considered "posh" and "high end"?
Higher quality than WHAT, exactly? I've shopped at M&S in the UK, and at *-mart here in the US. They are pretty much identical, on a world stage.
I've shopped in US "chain supermarkets" and on the whole anything in the UK is higher quality for food (meat and especially chicken in particular). On clothing side I seem to think I considered M&S to probably above Sears level and approaching Macy's. I definitely not put them in the same level as Wallmart.
That said, M&S can be a bit delusional at time. Remember after returning to the UK read an article about how M&S had sent a team out to look at US supermarkets and there were gushing comments about the amazing standards and varieties available in the US store they had just visited .... however, they'd chosen to go to Draegers in Los Altos (chain of 2 stores in top-end Silicon valley settings ... so had $200 bottles of olive oil on the shelf etc when we occassionally visited) ... rather like someone from the US commenting on the food stores in the UK on the basis of visiting Fortnum and Masons!
0
0
CLIMATE CHANGE forces women into PROSTITUTION - US politicians
deshepherd
Re: Gender sensitive framework
Think you'll find we already have somthing similar in the UK where councils have to consider the affects of various policies on different groups. A few months ago Bristol council launched proposals to roll out 20mph limits on residential streets citywide over the next 2 or 3 years ... I downloaded the paper that described the proposal to get more details and was "amused" to find that at the end there were a series of appendices which judged the impact of this proposal on women, gay and lesbian people, transgenedered people, black people and ethnic minorities - with the same conclusion in every case of no impact more than on the general population and effects were probably considered to be beneficial.
2
0
Quid-a-day nosh challenge hack in bullet-hard chickpea drama
deshepherd
Re: University weeks...
Seem to recall our college hall could serve mince all week for lunch and call it something different depending on what it was served with
mince + mash on top == cottage pie
mince + spaghetti == spaghetti bolognese
mince + red kidney beans + rice == chillie con carne
mince + flat pasta + cheese == lasagna
mince + red peppter + rice == savoury mince
mince + potatoes == mince & potatoes
etc
3
0
Google Now lands on iOS
deshepherd
Re: Linguistics
The Google test-to-voice system in navigation app on android regularily gives utterly weird pronunciations. On a recent trip in Bristol to pick up something from a ship I'd never been to before it was managing qiute happily with "Stapleton Road" until we got to Staple Hill - which it transformed into the much more interesting sounding "Stap Le Hill".
Anyway, its probably just American-ised pronunciatiation that produces Glow-sester-shire and War-sester-shire (though quite how they get Jag-war is beyond me!). Remember once being on a tube train in London where someone was trying to persuade a group of Americans that the station they wanted was really called Totnam Court Road and not Tote-en-ham Court Road!
Best American pronunication came when I was at a conference in Glasgow and went out with a group of other attendees for a meal one night and an American who'd been recommended the restaurant told use to drive along the road and turn right at "Soo-see-hal" ... took bit of time to realize he meant Socky-hall (or even Sauciehall) Street
0
0
Ten ancestors of the netbook
deshepherd
Re: Zenith Minisport
Remember those ... seem to recall they were in the category of things that I saw in the Morgan Computers adverts at a price that seemed a bargain for what they were at the time (probably £199) but sadly at that time a bit above my "frivolous spending" level so never got one!
0
0
Mosaic turns 20: Let's fire up the old girl, show her the web today
deshepherd
Must be almost 20 years since I started using the Web then! I was working using a system which had 3 or 4 large ring binders of documentation on all the commands when one day a message on the users email list (remember the days of email list and digests!) came from someone in a US university to say that he'd found this new program called Mosaic and he'd converted all the documentation into HTML so that by going to a web page on a server he'd set up at his university you could type in a command name and it would display the documentation for that command ... it seemed amazing that it was quicker to get info from a computer in Idaho than it was to pull a ring binder off the shelf above my desk!
Also, back in those days to help you navigate around the "web" the NCSA web site helpfully included a "new websites of the month" page ... later that became "new websites of the week" before disappearing. And true to rule on the development of new technologies one of the early sites list was from a Dutch University CS dept which among other contents proudly advertised that it considered it had the largest online collection of pr0n in Europe!
0
0
Bogus gov online test tells people on dole they're just SO employable
deshepherd
Re: Have you put in the FOI request yet?
My older son did one of those Connexions tests ... think his answers gave the impression that he liked to tell people what to do as his suggested careers had Army Officer, Navy Officer, RAF Officer near the top of the list!
0
0
Steve Jobs' 'spaceship' threatened by massive cost overruns
deshepherd
Re: Well, they could use...
p.s. I had a house a couple of blocks away from the site at one time.
Used to live in the area (just other side of Stevens Creek) too when I was in "silcon valley" for 3 years from 1998. Remember one day getting back from work and my wife telling me that there'd been lots of traffic a few blocks down of Stevens Creek and that something had been going on at De Anza college ... turned out from the newspapers the next day that Steve Jobs was launching the first product since he'd come back to Apple and it was something called an iMac.
1
0
Review: Jabra Revo Wireless headphones
deshepherd
Re: Gapless = correct
Gapless becomes even more important if you are listening to classical music, especially opera, where "tracks" are used to identify sections in what is otherwise an unbroken piece of music.
Anyway, agree with the other comment that had price been at the top of the article I might also have lost interest before the end while I was searching for any indication on the lag the bluetooth connection introduces and whether this was low enough to make them usable for watching video
2
0
Plucky Swede glides spaceplane to Earth from edge of stratosphere
deshepherd
Could combine this with James May's GPS controlled balsa glider crossing of (a section of water the same widths as) then English Channel .... I'm sure he could spin that out into a program reclaiming the UKs space heritage along with a link with some toy of the past ("Remember when you were a child and you had one of those stomp rockets where you stamped on a pump to launch a rocket which went up and then landed back beside you ... did you ever wonder about being able to launch it all the way to space? ....."). Ok, BBC, over to you now ... just put in a "from an original idea by ..." line in the creedits please!
4
0
Infinite loop: the Sinclair ZX Microdrive story
deshepherd
BBC Micro Hobbit drive
I was in the BBC Micro camp and remember seeing an advert in one of the computer mags for a new "floppy tape drive" called "the Hobbit" which was "faster than tape, cheaper than disk". Wasn't a continuous loop but wsa a high speed "cassette" which I think had "random access". Anyway, as it was ~1/3rd price of a floppy drive I decided I'd get one and persuade my parents to go via a shop somewhere in North London on our way somewhere. Went into the shop and said that I wanted to buy a Hobbit drive and the person in the shop basically replied "no you don't - they're not really worth the money - you want to save up the extra to get a floppy drive"!
A bit later I did get a floppy drive ... drove myself to N London that time to find this company that was advertising cheap floppy drives in the mags ... it was called "Viglen"! Got there to discover it was basically a company that had been making plastic boxes that seemed to have discovered that they could get a lot more money for their plastic boxes if they put a floppy disk drive in them.
2
0
Bacon sarnies can kill: Official
deshepherd
Re: In other news
Except in the discussion on this on the R4 Today program then the figure 3% of deaths that "could be prevented" (I think they mean delayed!) was after taking into account other factors. Another point was that his research was done on European sample groups so wasn't skewed by the much larger meat consumption of people in the USA. However, seemed that sample didn't have enough data to make any comment on processed (i.e. smoked) fish such as kippers!
2
0
Throttled customers rage over Virgin Mobile UK's tight cap
deshepherd
Re: Cap? What Cap?
Mine just reported 3.7Mb up and 1.5Mb down ... fine for me as "mobile" data.
0
0
Sony: Can't beat Apple and Samsung, so let's be the Other Guy
deshepherd
Sounds like they're copying the 90s "we want to be number 3" ads that Snapple ran (the underlying message was if you want cola then there's coke and pepsi - but if you don't then Snapple is the number 1 alternative)
0
1
Playmobil punts bank-heist set to wide-eyed kiddies
deshepherd
Re: Never mind Lego
yes, Playmobil are just playing catch up with Lego who've had a bank robber (helpfully identifiable by a striped top .... sadly, though, without a bag marked SWAG) called "the Brickster" for many years!
2
0
Cable Cowboy lassoes Virgin Media with HUGE £15bn deal
deshepherd
Re: TV Advert
Don't count your chickens yet ... they've said that they are retaining the Virgin brand in the UK and as to the vast bulk of the population Virgin==Branson then I'd assume they'll be keen to keep him involved (and I'm sure it won't take much persuasion to keep the shy and retiring inveterate self-publicist around!)
3
0
Tracy brothers are back: Thunderbirds Are Go! again in 5... 4... 3...
deshepherd
Re: I'm worried...
Back in the 60s we only got to watch half hour Dr Who episodes
Except a single story was told over several episodes so you had to be able to follow a storyline for several weeks .... and each episode started off where the last ended - you didn't get 5 mins of "previously on ..." intro to remind you what had happened. Whereas now you get 45-60mins self contained episodes (occasionally you get some 2-part stories but in current Dr Who series think they've said that they have abandoned this).
9
0
'Leccy-starved Reg hack: 'How I survive on 1.5kW'
deshepherd
Re: Kettle and Microwave.
Perhaps I am a barbarian American, but for tea, I always heated water on the stove
Probably are! I spent time in California in 1996 and 1998-2000. On first 6 month visit we went to local electrocal retailer (Fry's) and searched for a kettle ... found nothing and salesbods had no idea of what we were talking about. Just before I returned to UK branch of Bloomingdale's opened in Stanford shopping centre and I spotted a mini kettle there for .... $99! 2 years later when were were back for almost 3 years things had moved forward a bit and found an "electric water heater" for $20 in Walmart which was basically a 2 mug kettle which saw us through ... though at 110V it took forever to boil.
0
0
FAVI smacks your dumb TV with £30 Android SmartStick
deshepherd
So as long as your Wi-Fi coverage is very good
Pity they didn't include an ethernet socket as well - I'd much prefer to rely on a wired network for something like this (even if I need to use a homeplug to get the network there) as despite my best efforts I can never seem to get totally reliable wifi in my house!
4
0
Tiny Brit island stranded after £10m undersea fibre plea sunk
deshepherd
Re: article totally misses the point
5. The airport's strategic relevance with regards to the Falklands is very limited.
Also when considering the airport note that as a quid pro quo the Goverment funding for the airport is being done on the basis that when it opens they remove the funding that currently supports the mail ship that with 6 weekly visits is currently the only regular connection between St Helena and the outside world.
1
0
Boffins spot planet that could support life... just 12 light years away
deshepherd
Re: SETI ?
Or maybe they're going to pickup up something from CETI!
0
0
deshepherd
Arthur C Clarke
Well, after things like geostationary satellites etc perhaps ACC has another prediction coming true ... in the last of the Rama novels the Rama spaceship ends up in the Tau Ceti system where it rendezvous with "the node" where "samples" of intelligent life from that region of the galaxy are have been taken to.
0
0
Polish man mistakes hot iron for mobe
deshepherd
Re: The truth is out there...
I don't believe this for a second. Every mobile phone I've ever used require a button press (or opening of a clamshell) to answer. One does not answer a mobile phone by pressing it straight to the ear.
Might not have been a true "mobe" but a "carry-around" DECT phones ... many of those have a mode where lifting them off the base station answers to call.
1
0
Apple confirms Amazon ebooks bendover, EU watchdog drops bone
deshepherd
Re: Optional.
How is it bad for the publisher though?
I think the argument is that Amazon will take a hit on costs now to build up a dominant position in e-book selling so that in the future they'll be able to turn back on the publishers and tell them that if they want them to sell ebooks for them then they'd better reduce the prices.
1
0
England and Germany square off for FIFA goal line tech prize
deshepherd
Hawkeye works well in cricket and tennis because there is a clear view of the ball from most angles at any time ... perhaps one or two fo the several cameras may occasionally be blocked by a player but the others will have a clear view of the ball abd be able to track it. However this is not the case in football ... what happens in a goal mouth scramble after a corner with half a dozen players lunging for the ball which the goal keeper dives on an claim he grabbed before the ball crossed the line. I think Hawkeye will solve all the cases where TV replays can show that a goal should have been given but may still leave contenious decisions unsolved.
As for the magnetic field system ... wait till Adidas or Nike bring out their new goalie equipemnt with "embedded magnets" (of course, these will only be intended for their theraupeiutic effects on muscles!)
2
0
Copying Wikipedia's lies is not just for hacks, right Lord Leveson?
deshepherd
Thumb Up
Re: Oh for the love of . . .
Does everyone truly believe that Leveson actually sat down and typed all of this out or, far more likely, dictated this for someone else to type?
I'm sure Lord Leveson had no knowledge of the use of Wikipedia and it is down to one rogue secretary working on their own!
3
0
Badges for Commentards
deshepherd
Hmmm
Not sure whether I like the idea of badges but the way they appear against postings to my mind is so ugly that I've just adblock-ed all 3 images ... so, go ahead, get your badges - won't bother me as I won't see them!
0
0
Scoop! The inside story of the news website that saved the BBC
deshepherd
Re: A fascinating read
Used to be my main news source ... but a few years ago they forked the website to supply different versions to "UK" and "non-UK" users and, although I'm in the UK my companies WAN has its internet gateway in Switzerland so I can't see the "UK" version at work and as a result I switched to the Guardian as primary news site.
0
0
Android users: More of them than fanbois, but they don't use the web
deshepherd
Re: Browser agents
I've not done it but it may be a factor ... I remember in the days when Netscape was trying to nibble away at the IE dominance that there was a belief that Netscape usage were a bit higher than reported due to people changing agent strings ... why, because then many website checked this and sent anything other than the latest IE version to a "we don't support your browser, update to the latest IE" page.
4
0
Apple granted patent for ebook page-turning
deshepherd
Stop
Re: Lotus Organizer, 1995...
Still got Organiser on my PC (stlll holds the master address list used annually for Christmas cards!) and it does have an option for animating page turns .... only problem is over the past few years PCs have got so much faster that the animation seem to run in "the blink of an eye" ... I can just about see a vertical line at times where the page would be mid-turn ... but that said, seems pretty clear prior art ... unless Apple have added the magic words "on a mobile device" to turn something old in a brand new never before done idea
1
0
It's time to burn the schedules and seize control of OUR TVs
deshepherd
Re: my friend's four-year-old
Ditto everyone else - been there done that. We got series 1 TiVo when our sons were 5 and 1 and both immediately made the association TV == TiVo and were very put out at other peoples hosues to find they couldn't pause TV etc and got used to idea that a collection of their favourite programs would be already recorded waiting for them to watch. Still the same today 11 years later ... only difference is the selection of programs has moved on from Telletubbies/Tweenies to Futurerama/Castle. Meanwhile, there is still a role for "live TV" ... its called endless reruns of TopGear or QI on Dave!
2
0
It's Lego's 80th birthday party, but only the boys are invited
deshepherd
Thumb Up
Re: Unfortunately...
> Unfortunately, too many of today's LEGO sets for boys also "minimize... actual construction"
To some extent yes ... remember when I came back to Lego when my sons started to get lego sets (and inherited the small suitcase of my old lego that my parents still had in their loft!) that I'd get part way through a build wondering how they were going to manage to link two bits together as they appeared to need to join at a "non-standard" angle, turn the instruction page and discover "oh, they made a special piece to do that". From memories of what I'd had to do as a child it just seemed a bit like cheating to me!
However, in the bigger sets there is a serious amount of building still left (though they do still seem a little to keen in my mind to throw in a bag of specials bits to handle all the difficult sections)
0
0
BBC gives itself a gold in 700Gbit-a-second Olympic vid sprint
deshepherd
Re: Good job
All the 24 OBS feed channels were on VirginMedia as well
0
1
Devolo dLAN 500Mb/s powerline network adaptor review
deshepherd
Re: 500Mbps?
average UK broadband may still be under 10Mbs (but my VM has just jumped to 60Mbs!) but if you are using homeplugs then you probably have several PCs/devices around and then may well have a NAS or are sharing files/media from a PC. If so then higher speed may be beneficial - I've just added a couple of gigabit switches to my LAN setup so can get gigabit connections between main couple of PCs and a HP microserver that I am in process of setting up as replacement for current NAS ... quick comparison on transfer speed between PC and old NAS which has 100Mbs port and to microserver with 1Gbs port (and also better processor and newer disk etc) was stunning ... there definitely was a 10x speedup.
0
0
Amazon Android App Store to invade Europe
deshepherd
Re: 70% of list price to the developer
But I thought one of the complaints of the Amazon app store was that developers found that their app had been chosed for a special "75% off" offer and as a result got 30% of 25% of what they'd priced the app at. So I think you'd still be at risk of Amazon deciding to discount you book-in-an-app idea.
0
0
Why GM slammed the brakes on its $10m Facebook ads
deshepherd
"When was the last time you saw a Porsche or Ferrari advert?"
Don't know about Porsche but Ferrari have managed to get Sky to devote an entire channel to their adverts ... SkySports F1 - Ferrari's entire marketing activity is effectively their F1 team
1
0
Basic instinct: how we used to code
deshepherd
Re: The star trek game
We had a very early 6800 "system" in the electronics lab at school and I remember when we got the code for star trek (n.b. this was hex code that had to be typed in before we could save it to ?paper tape - may have been floppy) but there was a problem as it was too big to fit into the 1kB memory so there was a mad rush to put together a 4kB memory *expansion card* so that we could run it!
0
0
Inside Turing: Computer boffinry to cuffing cups to radiators
deshepherd
When I did my maths degree at Oxford one of my third year lecturers was Professor Robin Gandy who'd worked with Turing during the war then, when he was able to go to University after the war had Turing as his PhD supervisor. He tauhgt a course on "Computational Complexity" which covered Turing machines and the theory around them and I remember that every so often during a lecture he'd mention some result and then add something along the lines of "I remember when we first worked this out and how Alan was very excited by what it showed us"!
4
0
What kind of LOSER sits in front of a PC...
deshepherd
Re: I'm reading
I'm reading books mainly on a Kindle now (and confirming reports, I'm reading more books than before) but also really like the ability to pickup from the same point on the Kindle app on my phone. Best of both worlds!
2
0
Soup up your home network
deshepherd
Re: Just a shame...
I believe that with the VM "SuperHub" you can set it into "dumb modem" mode via its webpage setup interface. Probably something I'll have to sort out in a couple of months when I get upgraded to the 60Mb/s service ... I'm currently on the original 20Mb/s "XL" speed as when they moved XL to 30Mb/s my "free upgrade" involved paying £50 for a "superhub" which at that time seemed to have a fairly dire reputation + could not be used as a pure modem. Since then I think things sound better + they introduced modem mode and from what I gather a superhub is now a free part of the upgrade as they want to shift everyone to the latest cable standard so they can free the bandwidth used by us 20Mb holdouts!
1
0
Dijit
deshepherd
Re: Mystery solved re NTL Virgin Media box!
Think the issue is that the cable boxes used a different IR protocol to other AV devices (?IRDA vs IR) because the original idea was that the IR connection would be used for more than simple remote use and things like IR based keyboards etc would be used.
There was a similar problem in getting an original S1 TiVo to control one of these boxes as the TiVo was designed to output IR signals which the cable boxes didn't recognize so you had to buy an extra "dongle" which plugged into the IR extender port and "translated" the IR signals into IRDA
0
0
Americans resort to padlocking their dumb meters
deshepherd
Re: Smart Meters
Sounds like an electricity monitor and not a smart meter - smart meter replaces your exisitng electricity meter and is intended to send meter reading automatically via a wireless/mobile connection to remove the need for meter readers to come and read your meter. N.b. in the US (well at least 10-15 years ago when I was there) meter reading must be a significant expenses as PGE read our meter *every* month (as did the water company) - compared to the UK where it seems to be about once every 18-24 months to check that your reading/their estimates are sufficiently accurate
14
0
Page:
Forums
|
{
"url": "http://forums.theregister.co.uk/user/31870/2",
"source_domain": "forums.theregister.co.uk",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "152939",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z7VEVFRKDDWS2AQXUTSMFWDYIJKZOUZF",
"WARC-Concurrent-To": "<urn:uuid:46f7dbdd-1fac-4a08-b255-f4e8e649f158>",
"WARC-Date": "2015-04-19T18:18:40Z",
"WARC-IP-Address": "50.57.15.204",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6LD3UXB34FTGMGBHX3KYAGLYFC74SKYC",
"WARC-Record-ID": "<urn:uuid:aaa09d4e-58ee-4d79-ac4a-500ae13f7999>",
"WARC-Target-URI": "http://forums.theregister.co.uk/user/31870/2",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:81a7aaf2-ff69-4da1-b22c-08c1830a6c20>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
22,
23,
54,
55,
61,
62,
118,
119,
130,
131,
148,
149,
273,
274,
473,
474,
476,
478,
479,
541,
542,
553,
554,
575,
576,
670,
671,
898,
899,
966,
967,
1144,
1145,
1147,
1149,
1150,
1223,
1224,
1235,
1236,
1257,
1258,
2239,
2240,
2242,
2244,
2245,
2312,
2313,
2324,
2325,
2355,
2356,
2529,
2530,
2532,
2534,
2535,
2573,
2574,
2585,
2586,
2615,
2616,
2730,
2731,
3151,
3152,
3154,
3156,
3167,
3168,
3773,
3774,
3776,
3778,
3779,
3832,
3833,
3844,
3845,
3866,
3867,
4084,
4085,
4087,
4089,
4090,
4125,
4126,
4137,
4138,
4224,
4225,
4314,
4315,
4401,
4402,
4404,
4406,
4407,
4466,
4467,
4478,
4479,
4523,
4524,
4670,
4671,
4980,
4981,
5582,
5583,
5585,
5587,
5588,
5651,
5652,
5663,
5664,
5695,
5696,
6406,
6407,
6409,
6411,
6412,
6473,
6474,
6485,
6486,
6510,
6511,
6649,
6650,
6685,
6686,
6727,
6728,
6781,
6782,
6821,
6822,
6866,
6867,
6904,
6905,
6909,
6910,
6912,
6914,
6915,
6939,
6940,
6951,
6952,
6968,
6969,
7322,
7323,
7685,
7686,
8022,
8023,
8025,
8027,
8028,
8057,
8058,
8069,
8070,
8091,
8092,
8368,
8369,
8371,
8373,
8374,
8442,
8443,
8454,
8455,
9157,
9158,
9604,
9605,
9607,
9609,
9610,
9680,
9681,
9692,
9693,
9734,
9735,
9959,
9960,
9962,
9964,
9965,
10025,
10026,
10037,
10038,
10066,
10067,
10137,
10138,
10606,
10607,
10609,
10611,
10612,
10651,
10652,
10663,
10664,
10686,
10687,
10876,
10877,
11166,
11167,
11169,
11171,
11172,
11238,
11239,
11250,
11251,
11871,
11872,
11874,
11876,
11877,
11925,
11926,
11937,
11938,
11961,
11962,
12615,
12616,
13011,
13012,
13014,
13016,
13017,
13050,
13051,
13062,
13063,
13081,
13082,
13535,
13536,
13538,
13540,
13541,
13600,
13601,
13612,
13613,
13632,
13633,
13710,
13711,
13713,
13715,
13716,
13778,
13779,
13790,
13791,
14007,
14008,
14010,
14012,
14013,
14065,
14066,
14077,
14078,
14098,
14099,
14302,
14303,
14305,
14307,
14308,
14363,
14364,
14375,
14376,
14390,
14391,
14708,
14709,
14711,
14713,
14714,
14784,
14785,
14796,
14797,
14816,
14817,
14880,
14881,
15313,
15314,
15316,
15318,
15319,
15369,
15370,
15381,
15382,
15408,
15409,
15492,
15493,
16103,
16104,
16106,
16108,
16109,
16162,
16163,
16174,
16175,
16222,
16223,
16490,
16491,
16493,
16495,
16496,
16558,
16559,
16570,
16571,
16608,
16609,
16693,
16694,
17010,
17011,
17013,
17015,
17016,
17088,
17089,
17100,
17101,
17112,
17113,
17170,
17171,
17173,
17175,
17186,
17187,
17203,
17204,
17516,
17517,
17519,
17521,
17522,
17560,
17561,
17572,
17573,
17603,
17604,
17806,
17807,
17961,
17962,
17964,
17966,
17967,
18029,
18030,
18041,
18042,
18056,
18057,
18097,
18098,
18381,
18382,
18384,
18386,
18387,
18448,
18449,
18460,
18461,
19117,
19118,
19326,
19327,
19329,
19331,
19332,
19400,
19401,
19412,
19421,
19422,
19451,
19452,
19598,
19599,
19722,
19723,
19725,
19727,
19728,
19751,
19752,
19763,
19764,
19769,
19770,
19988,
19989,
19991,
19993,
19994,
20057,
20058,
20069,
20070,
20093,
20094,
20419,
20420,
20422,
20424,
20425,
20494,
20495,
20506,
20507,
20526,
20527,
20934,
20935,
20937,
20939,
20940,
20984,
20985,
20996,
21001,
21002,
21031,
21032,
21571,
21572,
21574,
21576,
21577,
21638,
21639,
21650,
21651,
21681,
21682,
22278,
22279,
22281,
22283,
22284,
22347,
22348,
22359,
22368,
22369,
22390,
22391,
22486,
22487,
23009,
23010,
23215,
23216,
23218,
23220,
23221,
23284,
23285,
23296,
23297,
23310,
23311,
23368,
23369,
23371,
23373,
23374,
23427,
23428,
23439,
23440,
23453,
23454,
24154,
24155,
24157,
24159,
24160,
24202,
24203,
24214,
24215,
24254,
24255,
24557,
24558,
24560,
24562,
24563,
24614,
24615,
24626,
24627,
24689,
24690,
24880,
24881,
24883,
24885,
24886,
24922,
24923,
24934,
24935,
24958,
24959,
25351,
25352,
25354,
25356,
25357,
25419,
25420,
25431,
25432,
25977,
25978,
25980,
25982,
25983,
26027,
26028,
26039,
26040,
26056,
26057,
26274,
26275,
26277,
26279,
26280,
26306,
26307,
26318,
26319,
26339,
26340,
27042,
27043,
27045,
27047,
27048,
27054,
27055,
27066,
27067,
27111,
27112,
27368,
27369,
27661,
27662,
27664,
27666,
27667,
27716,
27717,
27728,
27729,
27746,
27747,
28323,
28324,
28327,
28329,
28330,
28336,
28337
],
"line_end_idx": [
22,
23,
54,
55,
61,
62,
118,
119,
130,
131,
148,
149,
273,
274,
473,
474,
476,
478,
479,
541,
542,
553,
554,
575,
576,
670,
671,
898,
899,
966,
967,
1144,
1145,
1147,
1149,
1150,
1223,
1224,
1235,
1236,
1257,
1258,
2239,
2240,
2242,
2244,
2245,
2312,
2313,
2324,
2325,
2355,
2356,
2529,
2530,
2532,
2534,
2535,
2573,
2574,
2585,
2586,
2615,
2616,
2730,
2731,
3151,
3152,
3154,
3156,
3167,
3168,
3773,
3774,
3776,
3778,
3779,
3832,
3833,
3844,
3845,
3866,
3867,
4084,
4085,
4087,
4089,
4090,
4125,
4126,
4137,
4138,
4224,
4225,
4314,
4315,
4401,
4402,
4404,
4406,
4407,
4466,
4467,
4478,
4479,
4523,
4524,
4670,
4671,
4980,
4981,
5582,
5583,
5585,
5587,
5588,
5651,
5652,
5663,
5664,
5695,
5696,
6406,
6407,
6409,
6411,
6412,
6473,
6474,
6485,
6486,
6510,
6511,
6649,
6650,
6685,
6686,
6727,
6728,
6781,
6782,
6821,
6822,
6866,
6867,
6904,
6905,
6909,
6910,
6912,
6914,
6915,
6939,
6940,
6951,
6952,
6968,
6969,
7322,
7323,
7685,
7686,
8022,
8023,
8025,
8027,
8028,
8057,
8058,
8069,
8070,
8091,
8092,
8368,
8369,
8371,
8373,
8374,
8442,
8443,
8454,
8455,
9157,
9158,
9604,
9605,
9607,
9609,
9610,
9680,
9681,
9692,
9693,
9734,
9735,
9959,
9960,
9962,
9964,
9965,
10025,
10026,
10037,
10038,
10066,
10067,
10137,
10138,
10606,
10607,
10609,
10611,
10612,
10651,
10652,
10663,
10664,
10686,
10687,
10876,
10877,
11166,
11167,
11169,
11171,
11172,
11238,
11239,
11250,
11251,
11871,
11872,
11874,
11876,
11877,
11925,
11926,
11937,
11938,
11961,
11962,
12615,
12616,
13011,
13012,
13014,
13016,
13017,
13050,
13051,
13062,
13063,
13081,
13082,
13535,
13536,
13538,
13540,
13541,
13600,
13601,
13612,
13613,
13632,
13633,
13710,
13711,
13713,
13715,
13716,
13778,
13779,
13790,
13791,
14007,
14008,
14010,
14012,
14013,
14065,
14066,
14077,
14078,
14098,
14099,
14302,
14303,
14305,
14307,
14308,
14363,
14364,
14375,
14376,
14390,
14391,
14708,
14709,
14711,
14713,
14714,
14784,
14785,
14796,
14797,
14816,
14817,
14880,
14881,
15313,
15314,
15316,
15318,
15319,
15369,
15370,
15381,
15382,
15408,
15409,
15492,
15493,
16103,
16104,
16106,
16108,
16109,
16162,
16163,
16174,
16175,
16222,
16223,
16490,
16491,
16493,
16495,
16496,
16558,
16559,
16570,
16571,
16608,
16609,
16693,
16694,
17010,
17011,
17013,
17015,
17016,
17088,
17089,
17100,
17101,
17112,
17113,
17170,
17171,
17173,
17175,
17186,
17187,
17203,
17204,
17516,
17517,
17519,
17521,
17522,
17560,
17561,
17572,
17573,
17603,
17604,
17806,
17807,
17961,
17962,
17964,
17966,
17967,
18029,
18030,
18041,
18042,
18056,
18057,
18097,
18098,
18381,
18382,
18384,
18386,
18387,
18448,
18449,
18460,
18461,
19117,
19118,
19326,
19327,
19329,
19331,
19332,
19400,
19401,
19412,
19421,
19422,
19451,
19452,
19598,
19599,
19722,
19723,
19725,
19727,
19728,
19751,
19752,
19763,
19764,
19769,
19770,
19988,
19989,
19991,
19993,
19994,
20057,
20058,
20069,
20070,
20093,
20094,
20419,
20420,
20422,
20424,
20425,
20494,
20495,
20506,
20507,
20526,
20527,
20934,
20935,
20937,
20939,
20940,
20984,
20985,
20996,
21001,
21002,
21031,
21032,
21571,
21572,
21574,
21576,
21577,
21638,
21639,
21650,
21651,
21681,
21682,
22278,
22279,
22281,
22283,
22284,
22347,
22348,
22359,
22368,
22369,
22390,
22391,
22486,
22487,
23009,
23010,
23215,
23216,
23218,
23220,
23221,
23284,
23285,
23296,
23297,
23310,
23311,
23368,
23369,
23371,
23373,
23374,
23427,
23428,
23439,
23440,
23453,
23454,
24154,
24155,
24157,
24159,
24160,
24202,
24203,
24214,
24215,
24254,
24255,
24557,
24558,
24560,
24562,
24563,
24614,
24615,
24626,
24627,
24689,
24690,
24880,
24881,
24883,
24885,
24886,
24922,
24923,
24934,
24935,
24958,
24959,
25351,
25352,
25354,
25356,
25357,
25419,
25420,
25431,
25432,
25977,
25978,
25980,
25982,
25983,
26027,
26028,
26039,
26040,
26056,
26057,
26274,
26275,
26277,
26279,
26280,
26306,
26307,
26318,
26319,
26339,
26340,
27042,
27043,
27045,
27047,
27048,
27054,
27055,
27066,
27067,
27111,
27112,
27368,
27369,
27661,
27662,
27664,
27666,
27667,
27716,
27717,
27728,
27729,
27746,
27747,
28323,
28324,
28327,
28329,
28330,
28336,
28337,
28343
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 28343,
"ccnet_original_nlines": 605,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43870535492897034,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03672647848725319,
"rps_doc_frac_lines_end_with_ellipsis": 0.018151819705963135,
"rps_doc_frac_no_alph_words": 0.14891833066940308,
"rps_doc_frac_unique_words": 0.33247777819633484,
"rps_doc_mean_word_length": 4.345113754272461,
"rps_doc_num_sentences": 204,
"rps_doc_symbol_to_word_ratio": 0.01056514959782362,
"rps_doc_unigram_entropy": 6.318905353546143,
"rps_doc_word_count": 5065,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.003998550120741129,
"rps_doc_frac_chars_dupe_6grams": 0.0017266400391235948,
"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.019083969295024872,
"rps_doc_frac_chars_top_3gram": 0.001908399979583919,
"rps_doc_frac_chars_top_4gram": 0.0009087600046768785,
"rps_doc_books_importance": -2808.845703125,
"rps_doc_books_importance_length_correction": -2808.845703125,
"rps_doc_openwebtext_importance": -1616.9696044921875,
"rps_doc_openwebtext_importance_length_correction": -1616.9696044921875,
"rps_doc_wikipedia_importance": -1239.6444091796875,
"rps_doc_wikipedia_importance_length_correction": -1239.6444091796875
},
"fasttext": {
"dclm": 0.17143410444259644,
"english": 0.9701836109161377,
"fineweb_edu_approx": 1.4642797708511353,
"eai_general_math": 0.16016793251037598,
"eai_open_web_math": 0.2252657413482666,
"eai_web_code": 0.03679848089814186
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.09",
"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": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,073,245,271,665,675,000 |
Check if both the billing and the shipping address contain a house number in WooCommerce
Currently, when using the Checkout block from the WooCommerce Blocks plugin, there’s no check if the billing or shipping address field contains a house number. The following code snippets allow to check if these fields contain a number.
To check if both the billing and the shipping address contain a house number, please use the following code snippet:
add_action( 'woocommerce_store_api_checkout_update_order_from_request', 'woo_blocks_address_field_validation', 10, 2);
function woo_blocks_address_field_validation( WC_Order $order, $request ) {
$shipping_address = $order->get_address('shipping')['address_1'];
$billing_address = $order->get_address('billing')['address_1'];
if ( $shipping_address && ! preg_match( '/[0-9]+/', $shipping_address ) ) {
throw new Exception( 'Your shipping address must contain a house number!' );
}
if ( $billing_address && ! preg_match( '/[0-9]+/', $billing_address ) ) {
throw new Exception( 'Your billing address must contain a house number!' );
}
}
Add this code to your child theme’s functions.php file or via a plugin that allows custom functions to be added, such as the Dessky Snippets plugin. Please don’t add custom code directly to your parent theme’s functions.php file as this will be overwritten completely when you update the theme.
febles [email protected]
|
{
"url": "https://dessky.com/snippet/check-if-both-the-billing-and-the-shipping-address-contain-a-house-number-in-woocommerce/",
"source_domain": "dessky.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "45963",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LKFBFN32OJQ45U65DTO5A356S25VL4R3",
"WARC-Concurrent-To": "<urn:uuid:31ae4b18-596a-4869-b102-cb361ae50ea7>",
"WARC-Date": "2023-03-25T10:40:14Z",
"WARC-IP-Address": "45.55.176.60",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:Y35RH57IQ36D6YBZ6XTKWUSP5TG2KEOA",
"WARC-Record-ID": "<urn:uuid:2d986ad1-5b39-48ed-99c1-5d47188154a5>",
"WARC-Target-URI": "https://dessky.com/snippet/check-if-both-the-billing-and-the-shipping-address-contain-a-house-number-in-woocommerce/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2cbf8a52-318c-4ee4-a9db-e6fe563e235c>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-113\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
89,
90,
327,
328,
445,
446,
565,
641,
711,
780,
781,
861,
946,
952,
953,
1031,
1115,
1121,
1123,
1124,
1419,
1420
],
"line_end_idx": [
89,
90,
327,
328,
445,
446,
565,
641,
711,
780,
781,
861,
946,
952,
953,
1031,
1115,
1121,
1123,
1124,
1419,
1420,
1450
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1450,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0.004137929994612932,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2808988690376282,
"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.32209739089012146,
"rps_doc_frac_unique_words": 0.4941176474094391,
"rps_doc_mean_word_length": 6.305882453918457,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.17587947845459,
"rps_doc_word_count": 170,
"rps_doc_frac_chars_dupe_10grams": 0.11380597203969955,
"rps_doc_frac_chars_dupe_5grams": 0.16977612674236298,
"rps_doc_frac_chars_dupe_6grams": 0.16977612674236298,
"rps_doc_frac_chars_dupe_7grams": 0.11380597203969955,
"rps_doc_frac_chars_dupe_8grams": 0.11380597203969955,
"rps_doc_frac_chars_dupe_9grams": 0.11380597203969955,
"rps_doc_frac_chars_top_2gram": 0.03731343150138855,
"rps_doc_frac_chars_top_3gram": 0.05597015097737312,
"rps_doc_frac_chars_top_4gram": 0.07089552283287048,
"rps_doc_books_importance": -135.48385620117188,
"rps_doc_books_importance_length_correction": -131.34371948242188,
"rps_doc_openwebtext_importance": -78.17452239990234,
"rps_doc_openwebtext_importance_length_correction": -78.17452239990234,
"rps_doc_wikipedia_importance": -53.693641662597656,
"rps_doc_wikipedia_importance_length_correction": -45.206634521484375
},
"fasttext": {
"dclm": 0.132104754447937,
"english": 0.6707546710968018,
"fineweb_edu_approx": 1.4978495836257935,
"eai_general_math": 0.058374639600515366,
"eai_open_web_math": 0.02502197027206421,
"eai_web_code": 0.16731852293014526
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,882,196,588,232,546,300 |
Saturday, September 12, 2009
Amazon ELB - Capturing Client IP Address
If you're using Amazon EC2's Elastic Load Balancer (ELB) for load balancing web applications, you may have noticed that in your web access logs, the remote host IP address is the same for every request. The IP address you see is the private IP address of the load balancer.
If you want to see the IP address of the client (called remote host in access log documentation), you'll need to look at the value of the X-Forwarded-For request header which ELB populates when it forwards the request.
This can be achieved in an Apache access log by using the syntax:
%{X-Forwarded-For}i
You Apache log format would then look something like this:
LogFormat "\"%{X-Forwarded-For}i\" %l %u %t \"%r\" %>s %b \"%{Referer}i\" \"%{User-agent}i\"" combined-elb
CustomLog log/acces_log combined-elb
See Apache Custom Log Formats
If you're using a Tomcat application server, you could define an access log Valve like this:
<Valve className="org.apache.catalina.valves.AccessLogValve"
directory="logs" prefix="access_log." suffix=".txt"
pattern="%{X-Forwarded-For}i %l %u %t "%r" %s %b "%{Referer}i" "%{User-Agent}i""
resolveHosts="false"/>
See Tomcat 6 Valve Configuration Reference.
If you're trying to capture the client IP address within your application code, simply use whatever API you have to read the X-Forwarded-For request header. For example in Java use the HttpServletRequest:
String clientIpAddress = request.getHeader("X-Forwarded-For");
instead of
String clientIpAddress = request.getRemoteAddr();
9 comments:
sind26 said...
Thanks Ken,
I was wondering to get the external ip's in the access_log using while using elb.Your post was helpful.You saved my day.
Martin.M
lll said...
For some strange reason this isn't working for me.. My logs continue to show the ELB IP.
grourk said...
Is there any way to get the external IP for HTTPS requests? ELB only seems to set HTTP_X_FORWARDED_FOR for HTTP, which makes sense because for HTTPS it just does forwarding at the TCP level. Unfortunately I can't think of a way to get the client's IP address in this case.
Andy said...
This is very helpful, thanks for posting.
Dan Franklin said...
Here's what was causing our health checks to fail: we use name-based virtual hosting in Apache, and the first (default) vhost just redirects to our main vhost. Turns out that ELB does not supply a Host: header, so it hits this default vhost, and when it gets a 301 redirect it calls it a failure!
Solution is to have a file that your default vhost is willing to serve up, and call out that file in the ELB health check. I.e. before the default vhost redirects, check whether the incoming URL is this special file (we use arrowpoint.html for historical reasons) and skip the redirect in that case.
Anonymous said...
for IIS, follow this:
http://www.powercram.com/2011/10/amazon-elb-iis-capturing-client-ip.html
It works for me.
Scott McCarthy said...
Many thanks, this saved me a lot of work!
Anonymous said...
This is awesome! well done!
Anonymous said...
CustomLog log/acces_log combined-elb should be in this form
CustomLog "log/acces_log" combined-elb
thank you very much for the tip
|
{
"url": "http://blog.kenweiner.com/2009/09/amazon-elb-capturing-client-ip-address.html",
"source_domain": "blog.kenweiner.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "150122",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PZ43W4V6TOCMH7Z5RIJBKFRCOCSVSX6X",
"WARC-Concurrent-To": "<urn:uuid:194cfd29-b2ae-4495-a6c3-535fe0de88bf>",
"WARC-Date": "2015-04-27T00:13:53Z",
"WARC-IP-Address": "173.194.216.121",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3TSTBAHI2JN64WGW5V75XIYIIUHGKV6P",
"WARC-Record-ID": "<urn:uuid:520dc8d0-8c1a-4473-ae85-c5e7721a1770>",
"WARC-Target-URI": "http://blog.kenweiner.com/2009/09/amazon-elb-capturing-client-ip-address.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:208369e0-8c1e-4c4e-9ff3-111a067b5e78>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
29,
30,
71,
72,
346,
347,
566,
567,
633,
653,
712,
819,
856,
886,
887,
980,
1041,
1093,
1204,
1227,
1271,
1272,
1477,
1540,
1551,
1601,
1602,
1614,
1615,
1630,
1631,
1643,
1644,
1765,
1766,
1775,
1776,
1788,
1789,
1878,
1879,
1894,
1895,
2168,
2169,
2182,
2183,
2225,
2226,
2247,
2248,
2545,
2546,
2846,
2847,
2865,
2866,
2888,
2961,
2962,
2979,
2980,
3003,
3004,
3046,
3047,
3065,
3066,
3094,
3095,
3113,
3114,
3174,
3175,
3214,
3215
],
"line_end_idx": [
29,
30,
71,
72,
346,
347,
566,
567,
633,
653,
712,
819,
856,
886,
887,
980,
1041,
1093,
1204,
1227,
1271,
1272,
1477,
1540,
1551,
1601,
1602,
1614,
1615,
1630,
1631,
1643,
1644,
1765,
1766,
1775,
1776,
1788,
1789,
1878,
1879,
1894,
1895,
2168,
2169,
2182,
2183,
2225,
2226,
2247,
2248,
2545,
2546,
2846,
2847,
2865,
2866,
2888,
2961,
2962,
2979,
2980,
3003,
3004,
3046,
3047,
3065,
3066,
3094,
3095,
3113,
3114,
3174,
3175,
3214,
3215,
3246
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3246,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0.00431300001218915,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3396739065647125,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04755435138940811,
"rps_doc_frac_lines_end_with_ellipsis": 0.11688312143087387,
"rps_doc_frac_no_alph_words": 0.24728260934352875,
"rps_doc_frac_unique_words": 0.5020576119422913,
"rps_doc_mean_word_length": 5.102880477905273,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.012228259816765785,
"rps_doc_unigram_entropy": 5.096563816070557,
"rps_doc_word_count": 486,
"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.025403229519724846,
"rps_doc_frac_chars_top_3gram": 0.03750000149011612,
"rps_doc_frac_chars_top_4gram": 0.011290320195257664,
"rps_doc_books_importance": -314.33349609375,
"rps_doc_books_importance_length_correction": -314.33349609375,
"rps_doc_openwebtext_importance": -212.2284698486328,
"rps_doc_openwebtext_importance_length_correction": -212.2284698486328,
"rps_doc_wikipedia_importance": -119.1391830444336,
"rps_doc_wikipedia_importance_length_correction": -119.1391830444336
},
"fasttext": {
"dclm": 0.08019375801086426,
"english": 0.862446665763855,
"fineweb_edu_approx": 1.989617943763733,
"eai_general_math": 0.2763465642929077,
"eai_open_web_math": 0.15345168113708496,
"eai_web_code": 0.40892302989959717
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,809,752,425,324,234,000 |
DEV Community
Cover image for Azure vs GCP part 13: Functions (Azure)
Kenichiro Nakamura
Kenichiro Nakamura
Posted on
Azure vs GCP part 13: Functions (Azure)
In this article, I look into Functions for Azure and GCP. Why function matters? There are tons of answers for that question and I won't explain it in this article as I just want to compare Azure and GCP as C# developer.
Azure
Azure offers Function App to support function technology.
• Support multiple languages: C#, F#, Javascript, Java, etc. See here for detail.
• Support multiple triggers: HTTP request, timer, several web service webhook, several storage triggers. See here for detail.
• Scaling: It's support multiple scaling options. See here for detail.
• Flexible pricing: See here for detail.
• Integrate with platform: Security, Monitoring, Other services, etc. See here for detail.
• IDE support: Visual Studio and Visual Studio Code extension, local run-time for local debugging, etc.
• On-premise support: This is interesting that Microsoft offers on-premise run-time for Function App and offer same experience across cloud and on-premise. See here for mode detail.
1.x and 2.x
At this moment, there are two major versions for Function App.
• 1.x: Production ready. It's runs on Full .NET
• 2.x: Still preview. It's runs on .NET core, means it's cross platform.
See more detail at Compare 1.x and 2.x
Binding
One of the important concept is binding. I can "bind" many things to my function and treat them in same manner. There are several binding types.
• Trigger: I can bind trigger type to "trigger" my function. For example, the function can be triggered when a object is created in a blob storage, or when an event received in Event Grid.
• Input: I can integrate with services as input to get data, such as Microsoft Graph, One Drive, Blob, Auth token, etc.
• Output: Similar to input but I can output the result to the output binding.
See the Supported bindings here
Write a code
There are so many features, so let's do it one by one.
Basic function
1. Go to Azure Portal and create new resource. Select Function App and create.
function
2. Enter unique app name, and select OS. I select "Windows" this time. Click "Create".
funciton
3. Once it's created, go to the resource. Select "Fucntios" and click "+", then click "New function".
function
4. Select trigger and language you want to try. I use HTTP trigger and C# here.
function
5. Click "Create" with default values. Maybe changing name is good idea though.
function
6. At this point, the function is triggered via http and return http response as output. Click "Get function URL" and copy the address.
function
7. Hit the URL via tool such as postman or curl. Add name parameter.
function
Input Binding
Now, let's try integration. As I already have storage account which is auto created when I created Function App, I use it as my input and output.
1. Select Integration. I can see HTTP as trigger and output, and no input.
input
2. Click "New Input" and select "Azure Blob Storage". Then click "Select".
input
3. Click "new" next to storage account connection. Select the storage account to connect to. When wizard close, click "Save". The input name is "inputBlob" and path is "incontainer". I use container level for this function so I didn't specify object level path.
input
4. Go back to the function and update the code with following.
using System.Net;
using System.IO;
using Microsoft.Azure;
using Microsoft.WindowsAzure.Storage;
using Microsoft.WindowsAzure.Storage.Blob;
public static async Task<HttpResponseMessage> Run(
HttpRequestMessage req,
CloudBlobContainer inputBlob,
TraceWriter log)
{
log.Info("C# HTTP trigger function processed a request.");
log.Info($"Container name: {inputBlob.Name}");
// parse query parameter
string name = req.GetQueryNameValuePairs()
.FirstOrDefault(q => string.Compare(q.Key, "name", true) == 0)
.Value;
await inputBlob.CreateIfNotExistsAsync();
CloudBlockBlob blob = inputBlob.GetBlockBlobReference(name);
int i = 0;
try
{
i = int.Parse(await blob.DownloadTextAsync());
}
catch(Exception ex)
{
// Do nothing
}
i++;
await blob.UploadTextAsync((i).ToString());
return name == null
? req.CreateResponse(HttpStatusCode.BadRequest, "Please pass a name on the query string or in the request body")
: req.CreateResponse(HttpStatusCode.OK, $"Hello {name}. It's {i} times.");
}
Enter fullscreen mode Exit fullscreen mode
5. Click "Test" on the right and add parameter "name" with some name.
input
6. Click "Save and Run"
Developer experience
As I said, there are several tools.
Visual Studio extension
Azure Functions and Web Jobs Tools
It provides several things:
• Project template
• Run-time
• Local debug environment
• Deploy to Azure
Visual Studio Code extension
Azure Functions
It provides same capabilities as above.
Durable Functions
I need another article to explain this, but it basically orchestrates multiple functions, when you have many functions which requires to execute certain orders.
Documentation contains useful scenario where this helps.
In the next article, I look into function option of GCP.
Reference
Azure Functions
Durable Functions
Discussion (0)
|
{
"url": "https://dev.to/kenakamu/azure-vs-gcp-part-13-functions-azure-1moj",
"source_domain": "dev.to",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "111723",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CJODXR74TOWAQLNTC7TEOGDJGOEY7PAO",
"WARC-Concurrent-To": "<urn:uuid:a1908235-68b8-40ec-8094-32e33e8a9d85>",
"WARC-Date": "2021-10-20T08:41:08Z",
"WARC-IP-Address": "151.101.130.217",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MFJVEZZDPZMWSKV4CAW4IWGYMAE273UA",
"WARC-Record-ID": "<urn:uuid:636b934b-778e-4b22-906d-298536e38cd5>",
"WARC-Target-URI": "https://dev.to/kenakamu/azure-vs-gcp-part-13-functions-azure-1moj",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e050df04-4974-452c-a6d8-b32e27dfa7d1>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-190\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
14,
15,
71,
90,
109,
110,
120,
121,
161,
162,
382,
383,
389,
390,
448,
449,
533,
661,
734,
777,
870,
976,
1160,
1161,
1173,
1174,
1237,
1238,
1288,
1363,
1364,
1403,
1404,
1412,
1413,
1558,
1559,
1750,
1872,
1952,
1953,
1985,
1986,
1999,
2000,
2055,
2056,
2071,
2072,
2151,
2160,
2161,
2248,
2257,
2258,
2360,
2369,
2370,
2450,
2459,
2460,
2540,
2549,
2550,
2686,
2695,
2696,
2765,
2774,
2775,
2789,
2790,
2936,
2937,
3012,
3018,
3019,
3094,
3100,
3101,
3363,
3369,
3370,
3433,
3434,
3452,
3469,
3492,
3530,
3573,
3574,
3625,
3654,
3688,
3709,
3711,
3774,
3825,
3858,
3905,
3976,
3992,
4038,
4103,
4118,
4126,
4132,
4187,
4193,
4217,
4223,
4245,
4251,
4260,
4261,
4309,
4333,
4454,
4537,
4539,
4540,
4583,
4584,
4654,
4660,
4661,
4685,
4686,
4707,
4708,
4744,
4745,
4769,
4770,
4805,
4806,
4834,
4835,
4856,
4869,
4897,
4917,
4918,
4947,
4948,
4964,
4965,
5005,
5006,
5024,
5025,
5186,
5187,
5244,
5245,
5302,
5303,
5313,
5314,
5330,
5348,
5349
],
"line_end_idx": [
14,
15,
71,
90,
109,
110,
120,
121,
161,
162,
382,
383,
389,
390,
448,
449,
533,
661,
734,
777,
870,
976,
1160,
1161,
1173,
1174,
1237,
1238,
1288,
1363,
1364,
1403,
1404,
1412,
1413,
1558,
1559,
1750,
1872,
1952,
1953,
1985,
1986,
1999,
2000,
2055,
2056,
2071,
2072,
2151,
2160,
2161,
2248,
2257,
2258,
2360,
2369,
2370,
2450,
2459,
2460,
2540,
2549,
2550,
2686,
2695,
2696,
2765,
2774,
2775,
2789,
2790,
2936,
2937,
3012,
3018,
3019,
3094,
3100,
3101,
3363,
3369,
3370,
3433,
3434,
3452,
3469,
3492,
3530,
3573,
3574,
3625,
3654,
3688,
3709,
3711,
3774,
3825,
3858,
3905,
3976,
3992,
4038,
4103,
4118,
4126,
4132,
4187,
4193,
4217,
4223,
4245,
4251,
4260,
4261,
4309,
4333,
4454,
4537,
4539,
4540,
4583,
4584,
4654,
4660,
4661,
4685,
4686,
4707,
4708,
4744,
4745,
4769,
4770,
4805,
4806,
4834,
4835,
4856,
4869,
4897,
4917,
4918,
4947,
4948,
4964,
4965,
5005,
5006,
5024,
5025,
5186,
5187,
5244,
5245,
5302,
5303,
5313,
5314,
5330,
5348,
5349,
5363
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5363,
"ccnet_original_nlines": 162,
"rps_doc_curly_bracket": 0.0022375499829649925,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25668448209762573,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0365418903529644,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28431373834609985,
"rps_doc_frac_unique_words": 0.40330788493156433,
"rps_doc_mean_word_length": 5.115776062011719,
"rps_doc_num_sentences": 113,
"rps_doc_symbol_to_word_ratio": 0.004456330090761185,
"rps_doc_unigram_entropy": 5.267762184143066,
"rps_doc_word_count": 786,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0375528484582901,
"rps_doc_frac_chars_dupe_6grams": 0.024869440123438835,
"rps_doc_frac_chars_dupe_7grams": 0.014921659603714943,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01044515985995531,
"rps_doc_frac_chars_top_3gram": 0.014921659603714943,
"rps_doc_frac_chars_top_4gram": 0.01989554986357689,
"rps_doc_books_importance": -442.5279846191406,
"rps_doc_books_importance_length_correction": -442.5279846191406,
"rps_doc_openwebtext_importance": -163.84860229492188,
"rps_doc_openwebtext_importance_length_correction": -163.84860229492188,
"rps_doc_wikipedia_importance": -137.15518188476562,
"rps_doc_wikipedia_importance_length_correction": -137.15518188476562
},
"fasttext": {
"dclm": 0.1722356677055359,
"english": 0.7907738089561462,
"fineweb_edu_approx": 1.8703699111938477,
"eai_general_math": 0.4990379214286804,
"eai_open_web_math": 0.08323085308074951,
"eai_web_code": 0.5941755175590515
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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
|
-5,485,253,413,176,402,000 |
Nitro PDF Professional kann praktisch jede druckbare Datei in das PDF-Format umwandeln, indem einfach die entsprechende Datei in das Programmfenster von Nitro Pro gezogen wird; oder Sie können mit Nitro Pro zügig Dateien direkt vom Windows® Explorer aus in das PDF-Format konvertieren.
Nitro Pro enthält ebenfalls das integrierte Werkzeug Aus Datei erzeugen, das über die Registerkarte Start im Programmfenster von Nitro Pro verfügbar ist. Weitere Informationen finden Sie unter Schnelle PDF-Erstellung.
Hinweis: Die einzige Voraussetzung zur Ausführung einer Ein-Klick-Konvertierung in das PDF-Format ist, dass das entsprechende Dokumenterstellungsprogramm installiert sein muss. Um beispielsweise eine Microsoft Publisher-Datei in PDF zu konvertieren, muss Microsoft Publisher installiert sein.
So erstellen Sie eine PDF-Datei mit einem Klick:
• Ziehen Sie die Datei aus ihrem Ordner auf das Nitro PDF Professional-NitroPDF nitro%20pdf%20button PDF Erstellung von jeder Datei mit einem MausklickDesktop-Symbol oder – falls Nitro Pro geöffnet ist – ziehen Sie die Datei direkt in das Anwendungsfenster.
So konvertieren Sie Dateien aus einem Ordner oder vom Desktop in das PDF-Format:
1. Öffnen Sie den Ordner, der die Dateien enthält, die Sie konvertieren möchten.
2. Klicken Sie, um eine Datei auszuwählen. Um mehrere Dateien auszuwählen, halten Sie die STRG-Taste gedrückt, während Sie auf die einzelnen Dateien klicken.
3. Klicken Sie mit der rechten Maustaste auf eine ausgewählte Datei, und wählen Sie anschließend In PDF konvertieren.
PDF-Erstellung von jeder Datei mit einem Mausklick
|
{
"url": "http://nitropdf.helpmax.net/de/erstellen-von-pdf-dokumenten/pdf-dokument-von-einer-beliebigen-datei-erstellen/pdf-erstellung-von-jeder-datei-mit-einem-mausklick/",
"source_domain": "nitropdf.helpmax.net",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "35751",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3ZQKVY24TFGPZ6WRZ6PFGANBSOH27LBR",
"WARC-Concurrent-To": "<urn:uuid:a528d1e6-780c-4ef1-948d-36cdd1f21a3a>",
"WARC-Date": "2021-01-20T18:29:27Z",
"WARC-IP-Address": "165.22.201.74",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OXQ32DQKK4LNV2RLJ2XXIJLPVWB4UYQP",
"WARC-Record-ID": "<urn:uuid:b4327780-5b33-44fb-a820-3e8295b5b9c0>",
"WARC-Target-URI": "http://nitropdf.helpmax.net/de/erstellen-von-pdf-dokumenten/pdf-dokument-von-einer-beliebigen-datei-erstellen/pdf-erstellung-von-jeder-datei-mit-einem-mausklick/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ab1dbe67-3275-440e-b68b-94e3270d0853>"
},
"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-23.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,
286,
287,
505,
506,
799,
800,
849,
850,
1110,
1111,
1192,
1193,
1276,
1436,
1556,
1557
],
"line_end_idx": [
286,
287,
505,
506,
799,
800,
849,
850,
1110,
1111,
1192,
1193,
1276,
1436,
1556,
1557,
1607
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1607,
"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.024822700768709183,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04609929025173187,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.173758864402771,
"rps_doc_frac_unique_words": 0.4955357015132904,
"rps_doc_mean_word_length": 5.995535850524902,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.357651710510254,
"rps_doc_word_count": 224,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03127326816320419,
"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.022338049486279488,
"rps_doc_frac_chars_top_3gram": 0.04169768840074539,
"rps_doc_frac_chars_top_4gram": 0.038719289004802704,
"rps_doc_books_importance": -106.58030700683594,
"rps_doc_books_importance_length_correction": -92.86537170410156,
"rps_doc_openwebtext_importance": -60.34846496582031,
"rps_doc_openwebtext_importance_length_correction": -60.34846496582031,
"rps_doc_wikipedia_importance": -56.721248626708984,
"rps_doc_wikipedia_importance_length_correction": -43.16706848144531
},
"fasttext": {
"dclm": 0.7668227553367615,
"english": 0.0004088499990757555,
"fineweb_edu_approx": 1.5688761472702026,
"eai_general_math": 0.001117890002205968,
"eai_open_web_math": 0.3697018027305603,
"eai_web_code": 0.3437788486480713
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "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
|
8,634,164,649,294,493,000 |
Find and Replace in Windows Forms TreeView
1 Oct 2018 / 11 minutes to read
TreeViewAdvFindReplaceDialog
The find and replace feature enables users to search and replace a specific tree node present in the TreeViewAdv control. You can implement the fastest Find and Replace functionality in the TreeViewAdv control by using the TreeViewAdvFindReplaceDialog class. This class provides the methods that are necessary to perform a find and replace operation.
The value entered in the Search Text field is highlighted in the TreeViewAdv control after the search action is performed. You can switch to each highlighted tree node by clicking the Find Next button. This functionality is available only when there is more than one search result.
• Search and replace functionalities can be performed for the entire TreeViewAdv control or specific levels of tree nodes.
• Search and replace functionalities can be performed for
individual tree nodes by using the Find Next and Replace buttons.
• Search and replace functionalities can be performed for all the search results by using the Find All and Replace All buttons
TreeView Search Options
The available search options are as follows:
1. Match Case : Matches letter casing while performing a search.
2. Match Whole Node: Matches the search text with the entire text in a tree node.
TreeViewAdv Search Navigation
1. Search Up: Specifies whether the search can be performed from the bottom of the control up.
2. Search Down: Specifies whether the search can be performed from the top down.
3. Search All: Specifies whether the search can be performed from the bottom up, and then back to the bottom.
TreeViewAdv Search Range
1. TreeView: Specifies whether the search can be performed in entire TreeViewAdv control.
2. Root Node: Specifies whether the search can be performed only on the parent node level.
3. Child Node: Specifies whether the search can be performed only on the child node level.
The find and replace feature can be enabled for the TreeViewAdv control by using the following code:
TreeViewAdvFindReplaceDialog dialog = new TreeViewAdvFindReplaceDialog(this.TreeView);
dialog.Find("India", TreeViewSearchOption.MatchWholeText, TreeViewSearchRange.TreeView);
dialog.FindAll("India", TreeViewSearchOption.MatchWholeText, TreeViewSearchRange.TreeView);
dialog.Replace("India", TreeViewSearchOption.MatchWholeText, TreeViewSearchRange.TreeView);
dialog.ReplaceAll ("India", TreeViewSearchOption.MatchWholeText, TreeViewSearchRange.TreeView);
Dim dialog As New TreeViewAdvFindReplaceDialog(Me.TreeView)
dialog.Find("India", TreeViewSearchOption.MatchWholeText, TreeViewSearchRange.TreeView)
dialog.FindAll("India", TreeViewSearchOption.MatchWholeText, TreeViewSearchRange.TreeView)
dialog.Replace ("India", TreeViewSearchOption.MatchWholeText, TreeViewSearchRange.TreeView)
dialog.ReplaceAll ("India", TreeViewSearchOption.MatchWholeText, TreeViewSearchRange.TreeView)
OnNodeBeforeFind Event
This event will be triggered before the matching tree nodes are highlighted in the TreeViewAdv control.
Event Data
TreeNodeAdvBeforeFindArgs contains the following members that provide information specific to this event:
Members Table
Members Description
Node This will return the matched TreeNodeAdv based on user input.
SearchText This will return the search string to highlight in the TreeNodeAdv.
Cancel This enables users to disable highlighting matched TreeNodeAdv.
Void treeViewAdv1_OnNodeBeforeFind(object sender, Syncfusion.Windows.Forms.Tools.TreeNodeAdvBeforeFindArgs e)
{
// This will return the matched TreeNodeAdv.
TreeNodeAdv matchedNode = e.Node;
// This will return the searched string.
string matchedString = e.SearchText;
// Cancel arguments.
bool cancelFind = e.Cancel;
}
Private Sub treeViewAdv1_OnNodeBeforeFind(sender As Object, e As Syncfusion.Windows.Forms.Tools. TreeNodeAdvBeforeFindArgs)
' This will return the matched TreeNodeAdv.
Dim matchedNode As TreeNodeAdv = e.Node
' This will return the searched string.
Dim matchedString As string = e.SearchText
' Cancel arguments.
Dim cancelFind As Boolean = e.Cancel
End Sub
OnNodeAfterFound Event
This event will be triggered after the matching TreeNodeAdv is highlighted in the TreeViewAdv control.
Event Data
TreeNodeAdvAfterFindArgs contains the following members that provide information specific to this event:
Members Table
Members Description
Node This will return matched TreeNodeAdv based on user input.
SearchText This will return the search string to be highlighted in TreeNodeAdv.
void treeViewAdv1_OnNodeAfterFound(object sender, Syncfusion.Windows.Forms.Tools.TreeNodeAdvAfterFindArgs e)
{
// This will return matched TreeNodeAdv.
TreeNodeAdv matchedNode = e.Node;
// This will return the searched string.
string searchedString = e.SearchText;
}
Private Sub treeViewAdv1_OnNodeAfterFound(sender As Object, e As Syncfusion.Windows.Forms.Tools. TreeNodeAdvAfterFindArgs)
' This will return the matched TreeNodeAdv.
Dim matchedNode As TreeNodeAdv = e.Node
' This will return the searched string.
Dim searchedString As string = e.SearchText
End Sub
OnNodeReplacing Event
This event will be triggered before replacing the matched tree node text in the TreeViewAdv control.
Event Data
TreeNodeAdvOnReplacingArgs contains the following members that provide information specific to this event:
Members Table
Members Description
Node This will return the matched TreeNodeAdv based on user input.
SearchText This will return the searched string to be highlighted in TreeNodeAdv.
ReplaceText This will return the TreeNodeAdv text that is to be replaced.
TreeViewSearchOption This will return TreeViewSearchOption to find or replace TreeNodeAdv.
TreeViewSearchRange This will return TreeViewSearchRange level to find or replace TreeNodeAdv.
Cancel This will enable users to disable replacing matched TreeNodeAdv text.
void treeViewAdv1_OnNodeReplacing(object sender, Syncfusion.Windows.Forms.Tools.TreeNodeAdvOnReplacingArgs e)
{
// This will return the replaced TreeNodeAdv.
TreeNodeAdv replaceNode = e.Node;
// This will return the searched string.
string matchedString = e.SearchText;
// This will return the replaced string.
string ReplacedString = e.ReplaceText;
// TreeViewAdv search options.
TreeViewSearchOption searchOption = e.TreeViewSearchOption;
// This will return the TreeViewAdv search range.
TreeViewSearchRange searchRange = e.TreeViewSearchRange;
// Cancel arguments.
bool cancelReplace = e.Cancel;
}
Private Sub treeViewAdv1_OnNodeReplacing(sender As Object, e As Syncfusion.Windows.Forms.Tools. TreeNodeAdvOnReplacingArgs)
' This will return the replaced TreeNodeAdv.
Dim replaceNode As TreeNodeAdv = e.Node
' This will return the searched string.
Dim matchedString As string = e.SearchText
' This will return the replaced string.
Dim ReplacedString As string = e.ReplaceText
' TreeViewAdv search options.
Dim searchOption As TreeViewSearchOption = e.TreeViewSearchOption
' This will return the TreeViewAdv search range.
Dim searchRange As TreeViewSearchRange = e.TreeViewSearchRange
' Cancel arguments.
Dim cancelReplace As Boolean = e.Cancel
End Sub
OnNodeReplaced Event
This event will be triggered after the matched TreeNodeAdv text is replaced in the TreeViewAdv control.
Event Data
The TreeViewOnReplacedArgs contains the following members that provide information specific to this event:
Members Table
Members Description
Node This will return the TreeNodeAdv whose text will be replaced.
SearchText This will return the search string to highlight in TreeNodeAdv.
ReplaceText This will return TreeNodeAdv text that has been replaced.
void treeViewAdv1_OnNodeReplaced(object sender, Syncfusion.Windows.Forms.Tools.TreeNodeAdvOnReplacedArgs e)
{
// This will return the replaced TreeNodeAdv.
TreeNodeAdv replacedNode = e.Node;
// This will return the searched string.
string matchedString = e.SearchText;
// This will return the replaced string.
string ReplacedString = e.ReplaceText;
}
Private Sub treeViewAdv1_OnNodeReplaced(sender As Object, e As Syncfusion.Windows.Forms.Tools. TreeNodeAdvOnReplacedArgs)
' This will return Replaced TreeNodeAdv
Dim replacedNode As TreeNodeAdv = e.Node
' This will return Searched String
Dim matchedString As String = e.SearchText
' This will return Replaced String
Dim ReplacedString As String = e.ReplaceText
End Sub
Setting AllowKeyboardSearch property of the treeview to true, will allow the user to search for a node by typing the name of the node using the keyboard.
Property Table
TreeViewAdv Property Description
AllowKeyboardSearch Gets or sets a value indicating if keyboard-based searching should be allowed.
this.treeViewAdv1.AllowKeyboardSearch = true;
Me.treeViewAdv1.AllowKeyboardSearch = True
KeyDown Event
This event is triggered when the key is first pressed. An example which uses the KeyDown event is as follows.
Event Data
The KeyEventHandler receives an argument of type KeyEventArgs containing data related to this event. The following KeyEventArgs members provide information specific to this event.
Members Table
Members Description
Alt Gets a value indicating whether the ALT key was pressed.
Control Gets a value indicating whether the CTRL key was pressed.
Handled Gets or sets a value indicating whether the event was handled.
KeyCode Gets the keyboard code for a KeyDown or KeyUp event.
KeyData Gets the key data for a KeyDown or KeyUp event.
KeyValue Gets the keyboard value for a KeyDown or KeyUp event.
Modifiers Gets the modifier flags for a KeyDown or KeyUp event. The flags indicate which combination of CTRL, SHIFT, and ALT keys was pressed.
Shift Gets a value indicating whether the SHIFT key was pressed.
SuppressKeyPress Gets or sets a value indicating whether the key event should be passed on to the underlying control.
Adding Nodes into the TreeViewAdv using KeyBoard
The nodes can be added to the TreeViewAdv when any key is pressed, whereby the text of the node reflects the key that has been used for adding the node, by using the following code in the TreeViewAdv KeyDown event handler.
Border Settings
// Setting the key data to the newly added node.
// Add the nodes to the selected node.
private void treeViewAdv1_KeyDown(object sender, System.Windows.Forms.KeyEventArgs e)
{
// Setting the key data to the newly added node.
TreeNodeAdv node=new TreeNodeAdv("Node"+" "+e.KeyData.ToString());
// Add the nodes to the selected node.
this.treeViewAdv1.SelectedNode.Nodes.Add(node);
Console.WriteLine("The "+node.Text+" "+"is added");
}
Private Sub treeViewAdv1_KeyDown(ByVal sender As Object, ByVal e As System.Windows.Forms.KeyEventArgs)
' Setting the key data to the newly added node.
Dim node As TreeNodeAdv = New TreeNodeAdv("Node" & " " & e.KeyData.ToString())
' Add the nodes to the selected node.
Me.treeViewAdv1.SelectedNode.Nodes.Add(node)
Console.WriteLine("The " & node.Text & " " & "is added")
End Sub
FindAndReplace_Image1
|
{
"url": "https://help.syncfusion.com/windowsforms/treeview/find-and-replace",
"source_domain": "help.syncfusion.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "57986",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EAYYQB24EA3BPE5XRCKYKDXDZDP2O5BP",
"WARC-Concurrent-To": "<urn:uuid:8f1abd27-d23a-499c-8613-0621431a1b55>",
"WARC-Date": "2021-01-22T10:25:04Z",
"WARC-IP-Address": "40.121.84.190",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CG7C3ORHZEEBBI6QSPJH26DAM2O2TW3U",
"WARC-Record-ID": "<urn:uuid:6ac6a83a-3850-434e-bedc-d1ce0fd2eea4>",
"WARC-Target-URI": "https://help.syncfusion.com/windowsforms/treeview/find-and-replace",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b0fee9cc-1ac9-4579-bbbb-16a1e6426272>"
},
"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-254.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,
43,
44,
76,
77,
106,
107,
458,
459,
741,
742,
867,
868,
928,
998,
999,
1128,
1129,
1153,
1154,
1199,
1200,
1267,
1268,
1352,
1353,
1383,
1384,
1481,
1482,
1565,
1566,
1678,
1679,
1704,
1705,
1797,
1798,
1891,
1892,
1985,
1986,
2087,
2088,
2175,
2264,
2356,
2448,
2544,
2604,
2692,
2783,
2875,
2970,
2971,
2994,
2995,
3100,
3101,
3112,
3113,
3219,
3220,
3234,
3235,
3255,
3322,
3401,
3472,
3582,
3584,
3585,
3630,
3668,
3669,
3710,
3751,
3752,
3773,
3805,
3807,
3931,
3932,
3976,
4016,
4017,
4057,
4100,
4101,
4121,
4158,
4159,
4167,
4168,
4191,
4192,
4296,
4297,
4308,
4309,
4414,
4415,
4429,
4430,
4450,
4513,
4593,
4702,
4704,
4705,
4746,
4784,
4785,
4826,
4868,
4870,
4993,
4994,
5038,
5078,
5079,
5119,
5163,
5171,
5172,
5194,
5195,
5297,
5298,
5309,
5310,
5417,
5418,
5432,
5433,
5453,
5520,
5602,
5676,
5767,
5862,
5939,
6049,
6051,
6052,
6098,
6136,
6137,
6178,
6219,
6220,
6261,
6304,
6305,
6336,
6400,
6401,
6451,
6512,
6513,
6534,
6569,
6571,
6695,
6696,
6741,
6781,
6782,
6822,
6865,
6866,
6906,
6951,
6952,
6982,
7048,
7049,
7098,
7161,
7162,
7182,
7222,
7230,
7231,
7252,
7253,
7358,
7359,
7370,
7371,
7478,
7479,
7493,
7494,
7514,
7581,
7656,
7726,
7834,
7836,
7837,
7883,
7922,
7923,
7964,
8005,
8006,
8047,
8090,
8092,
8214,
8215,
8255,
8296,
8297,
8332,
8375,
8376,
8411,
8456,
8464,
8465,
8619,
8620,
8635,
8636,
8669,
8768,
8814,
8857,
8858,
8872,
8873,
8983,
8984,
8995,
8996,
9176,
9177,
9191,
9192,
9212,
9273,
9339,
9410,
9471,
9527,
9590,
9733,
9798,
9916,
9917,
9966,
9967,
10190,
10191,
10207,
10208,
10257,
10296,
10383,
10386,
10436,
10509,
10510,
10549,
10603,
10661,
10663,
10766,
10767,
10815,
10894,
10895,
10933,
10978,
11035,
11043,
11044
],
"line_end_idx": [
43,
44,
76,
77,
106,
107,
458,
459,
741,
742,
867,
868,
928,
998,
999,
1128,
1129,
1153,
1154,
1199,
1200,
1267,
1268,
1352,
1353,
1383,
1384,
1481,
1482,
1565,
1566,
1678,
1679,
1704,
1705,
1797,
1798,
1891,
1892,
1985,
1986,
2087,
2088,
2175,
2264,
2356,
2448,
2544,
2604,
2692,
2783,
2875,
2970,
2971,
2994,
2995,
3100,
3101,
3112,
3113,
3219,
3220,
3234,
3235,
3255,
3322,
3401,
3472,
3582,
3584,
3585,
3630,
3668,
3669,
3710,
3751,
3752,
3773,
3805,
3807,
3931,
3932,
3976,
4016,
4017,
4057,
4100,
4101,
4121,
4158,
4159,
4167,
4168,
4191,
4192,
4296,
4297,
4308,
4309,
4414,
4415,
4429,
4430,
4450,
4513,
4593,
4702,
4704,
4705,
4746,
4784,
4785,
4826,
4868,
4870,
4993,
4994,
5038,
5078,
5079,
5119,
5163,
5171,
5172,
5194,
5195,
5297,
5298,
5309,
5310,
5417,
5418,
5432,
5433,
5453,
5520,
5602,
5676,
5767,
5862,
5939,
6049,
6051,
6052,
6098,
6136,
6137,
6178,
6219,
6220,
6261,
6304,
6305,
6336,
6400,
6401,
6451,
6512,
6513,
6534,
6569,
6571,
6695,
6696,
6741,
6781,
6782,
6822,
6865,
6866,
6906,
6951,
6952,
6982,
7048,
7049,
7098,
7161,
7162,
7182,
7222,
7230,
7231,
7252,
7253,
7358,
7359,
7370,
7371,
7478,
7479,
7493,
7494,
7514,
7581,
7656,
7726,
7834,
7836,
7837,
7883,
7922,
7923,
7964,
8005,
8006,
8047,
8090,
8092,
8214,
8215,
8255,
8296,
8297,
8332,
8375,
8376,
8411,
8456,
8464,
8465,
8619,
8620,
8635,
8636,
8669,
8768,
8814,
8857,
8858,
8872,
8873,
8983,
8984,
8995,
8996,
9176,
9177,
9191,
9192,
9212,
9273,
9339,
9410,
9471,
9527,
9590,
9733,
9798,
9916,
9917,
9966,
9967,
10190,
10191,
10207,
10208,
10257,
10296,
10383,
10386,
10436,
10509,
10510,
10549,
10603,
10661,
10663,
10766,
10767,
10815,
10894,
10895,
10933,
10978,
11035,
11043,
11044,
11065
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11065,
"ccnet_original_nlines": 278,
"rps_doc_curly_bracket": 0.0009037500130943954,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24788135290145874,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0031779699493199587,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22510592639446259,
"rps_doc_frac_unique_words": 0.2098214328289032,
"rps_doc_mean_word_length": 6.6629462242126465,
"rps_doc_num_sentences": 203,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.853689670562744,
"rps_doc_word_count": 1344,
"rps_doc_frac_chars_dupe_10grams": 0.20804019272327423,
"rps_doc_frac_chars_dupe_5grams": 0.5054159760475159,
"rps_doc_frac_chars_dupe_6grams": 0.4638749361038208,
"rps_doc_frac_chars_dupe_7grams": 0.33188164234161377,
"rps_doc_frac_chars_dupe_8grams": 0.29525405168533325,
"rps_doc_frac_chars_dupe_9grams": 0.2548297047615051,
"rps_doc_frac_chars_top_2gram": 0.031267449259757996,
"rps_doc_frac_chars_top_3gram": 0.053154658526182175,
"rps_doc_frac_chars_top_4gram": 0.04935789853334427,
"rps_doc_books_importance": -894.5940551757812,
"rps_doc_books_importance_length_correction": -894.5940551757812,
"rps_doc_openwebtext_importance": -569.9667358398438,
"rps_doc_openwebtext_importance_length_correction": -569.9667358398438,
"rps_doc_wikipedia_importance": -420.6853332519531,
"rps_doc_wikipedia_importance_length_correction": -420.6853332519531
},
"fasttext": {
"dclm": 0.3279349207878113,
"english": 0.6021835803985596,
"fineweb_edu_approx": 2.127047538757324,
"eai_general_math": 0.3883182406425476,
"eai_open_web_math": 0.10047721862792969,
"eai_web_code": 0.7529153823852539
}
}
|
{
"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": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,064,771,659,615,311,000 |
Изменения
Перейти к: навигация, поиск
Статистики на отрезках. Корневая эвристика
Нет изменений в размере, 20:26, 6 июня 2012
м
Запрос на изменение элемента
== Запрос на изменение элемента ==
[[Файл:sqrt(+delta).png|right|264px360px]]
Реализация данного запроса будет зависеть от того, имеет ли операция, для которой мы сделали построение, обратную операцию и обладает ли она свойством коммутативности.
* если оба условия выполняются, то запрос на изменение элемента мы можем сделать за <tex>O(1)</tex> времени;
338
правок
Навигация
|
{
"url": "http://neerc.ifmo.ru/wiki/index.php?title=%D0%A1%D0%BB%D1%83%D0%B6%D0%B5%D0%B1%D0%BD%D0%B0%D1%8F:%D0%A1%D1%80%D0%B0%D0%B2%D0%BD%D0%B5%D0%BD%D0%B8%D0%B5_%D0%B2%D0%B5%D1%80%D1%81%D0%B8%D0%B9/24191",
"source_domain": "neerc.ifmo.ru",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "20532",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LHJQTNZEK7NM3Z4SPJMUJQKYLVHZQMTG",
"WARC-Concurrent-To": "<urn:uuid:6829e4b2-50f0-4886-96ef-a7bf101fdd49>",
"WARC-Date": "2020-02-18T21:46:48Z",
"WARC-IP-Address": "77.234.215.132",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SGYP5PEDF266YLF67TJ6XB7KXMQCOCHE",
"WARC-Record-ID": "<urn:uuid:904bd223-c045-4f84-93c7-ae2eba8dc3ec>",
"WARC-Target-URI": "http://neerc.ifmo.ru/wiki/index.php?title=%D0%A1%D0%BB%D1%83%D0%B6%D0%B5%D0%B1%D0%BD%D0%B0%D1%8F:%D0%A1%D1%80%D0%B0%D0%B2%D0%BD%D0%B5%D0%BD%D0%B8%D0%B5_%D0%B2%D0%B5%D1%80%D1%81%D0%B8%D0%B9/24191",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c0a3f984-25b8-48de-9339-745b3d080efe>"
},
"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-52.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
10,
11,
39,
40,
83,
84,
128,
130,
159,
194,
237,
405,
514,
518,
525,
526
],
"line_end_idx": [
10,
11,
39,
40,
83,
84,
128,
130,
159,
194,
237,
405,
514,
518,
525,
526,
535
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 535,
"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.009523809887468815,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009523809887468815,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9238095283508301,
"rps_doc_frac_unique_words": 0.8260869383811951,
"rps_doc_mean_word_length": 6.231884002685547,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.9501707553863525,
"rps_doc_word_count": 69,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.055813949555158615,
"rps_doc_frac_chars_top_3gram": 0.11860465258359909,
"rps_doc_frac_chars_top_4gram": 0.1744185984134674,
"rps_doc_books_importance": -49.30918884277344,
"rps_doc_books_importance_length_correction": -62.252716064453125,
"rps_doc_openwebtext_importance": -28.877098083496094,
"rps_doc_openwebtext_importance_length_correction": -41.82062530517578,
"rps_doc_wikipedia_importance": -9.469606399536133,
"rps_doc_wikipedia_importance_length_correction": -22.413131713867188
},
"fasttext": {
"dclm": 0.7863866090774536,
"english": 0.000016730000425013714,
"fineweb_edu_approx": 0.7332504391670227,
"eai_general_math": -0.000006910000138304895,
"eai_open_web_math": 0.08003658056259155,
"eai_web_code": 0.5661983489990234
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,262,971,157,997,126,700 |
szabgab szabgab - 1 year ago 57
HTML Question
Inline quote in html 5 and accessibility
What is the recommended way to quote someone else in an HTML text?
Especially if I'd like to make sure screen-readers will handle it properly?
• Should I use double-quotes like this:
"
• Should I write
"
that will look like this: " ?
• Should I use the
<q></q>
pair that apparently I cannot demo here?
• Something else?
http://html5doctor.com/blockquote-q-cite/ has a bunch of explanation on how works, but I did not see a recommendation.
Answer Source
For short inline quotations, use the <q></q> tag. Most browsers will insert quotation marks around the quotation, however if you are using a css reset the following may be required:
q:before, q:after {
content: """
}
For any longer quotations I would advise using the <blockquote></blockquote> tag in combination with the <cite></cite> tag, as follows:
<blockquote>
This text is from another source
<cite>
<a href="http://source-url.com">Source Title</a>
</cite>
</blockquote>
As per the HTML5 spec:
The blockquote element represents content that is quoted from another source, optionally with a citation which must be within a footer or cite element, and optionally with in-line changes such as annotations and abbreviations.
Source: https://w3c.github.io/html/grouping-content.html#the-blockquote-element
Avoid using inline quotation marks in conjunction with the <q></q> tag, however they can be used with the <blockquote></blockquote> tag. In either case it would be advisable to make some sort of graphical distinction (e.g. italics or a different background colour) between quotes from external sources and the page's original content.
|
{
"url": "https://codedump.io/share/t5JfOijc6UAj/1/inline-quote-in-html-5-and-accessibility",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "42498",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V5TE4YGYNXL6X4MLLQ6YGG72S44YWQRQ",
"WARC-Concurrent-To": "<urn:uuid:d2fc6a80-93e9-4334-a8dc-60dbdc45075a>",
"WARC-Date": "2017-12-13T20:59:24Z",
"WARC-IP-Address": "50.112.74.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KMUTXMY52E5ZWISXIP4FDUXLCDHI6V7U",
"WARC-Record-ID": "<urn:uuid:c305d58b-8f95-46d8-88a2-7ead3ba3f1cb>",
"WARC-Target-URI": "https://codedump.io/share/t5JfOijc6UAj/1/inline-quote-in-html-5-and-accessibility",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a67a571a-8ade-4cee-9520-5a440973bfab>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-30-53-223.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
32,
46,
47,
88,
89,
156,
232,
233,
234,
276,
282,
283,
302,
313,
347,
348,
369,
381,
426,
427,
447,
448,
449,
450,
569,
570,
584,
585,
767,
768,
788,
810,
812,
813,
949,
950,
963,
1000,
1011,
1068,
1080,
1094,
1095,
1118,
1119,
1346,
1347,
1427,
1428
],
"line_end_idx": [
32,
46,
47,
88,
89,
156,
232,
233,
234,
276,
282,
283,
302,
313,
347,
348,
369,
381,
426,
427,
447,
448,
449,
450,
569,
570,
584,
585,
767,
768,
788,
810,
812,
813,
949,
950,
963,
1000,
1011,
1068,
1080,
1094,
1095,
1118,
1119,
1346,
1347,
1427,
1428,
1762
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1762,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0.0011350699933245778,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35092347860336304,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026385219767689705,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26912927627563477,
"rps_doc_frac_unique_words": 0.590361475944519,
"rps_doc_mean_word_length": 5.289156436920166,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.002638519974425435,
"rps_doc_unigram_entropy": 4.760717391967773,
"rps_doc_word_count": 249,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.024297650903463364,
"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.015945330262184143,
"rps_doc_frac_chars_top_3gram": 0.01822322979569435,
"rps_doc_frac_chars_top_4gram": 0.016704630106687546,
"rps_doc_books_importance": -196.9109649658203,
"rps_doc_books_importance_length_correction": -188.7990264892578,
"rps_doc_openwebtext_importance": -116.26006317138672,
"rps_doc_openwebtext_importance_length_correction": -116.26006317138672,
"rps_doc_wikipedia_importance": -100.54859924316406,
"rps_doc_wikipedia_importance_length_correction": -97.03336334228516
},
"fasttext": {
"dclm": 0.2432030439376831,
"english": 0.8330180048942566,
"fineweb_edu_approx": 2.0911357402801514,
"eai_general_math": 0.9338803291320801,
"eai_open_web_math": 0.5470163226127625,
"eai_web_code": 0.699824869632721
}
}
|
{
"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": "-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": "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": "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,877,040,050,558,431,000 |
Fraction (mathématiques)
Un article de Wikipédia, l'encyclopédie libre.
Aller à : Navigation, rechercher
Page d'aide sur l'homonymie Pour les articles homonymes, voir Fraction.
Trois quarts de gâteau, un quart ayant été retiré.
Une fraction, en mathématiques, est pour un profane un certain nombre de parts considérés après la division d'un nombre entier en parts égales. Par exemple, la fraction \frac{56}{8} désigne le quotient de 56 par 8. Elle est égale à 7 car 7×8 = 56. Dans cette fraction, 56 est appelé le numérateur et 8 le dénominateur.
Les nombres que l'on peut représenter par des fractions de nombres entiers sont appelés nombres rationnels. L'ensemble des rationnels est noté \mathbb Q.
Il existe une définition plus générale et plus abstraite des fractions. Si (A, +, .) est un anneau intègre, on peut créer le corps des fractions de A. Ses éléments se notent (par analogie aux fractions d'entiers relatifs) \frac{a}{b} et possèdent les mêmes propriétés opératoires (somme, produit, simplification, ...) que les fractions de \mathbb Q.
Sommaire
Sens usuel de la fraction[modifier]
Définition de la fraction[modifier]
Une fraction est une division non effectuée entre deux nombres entiers relatifs n et d \neq 0. Elle est représentée comme suit :
n/d~ ou {}^{\textstyle n}\!\!\diagup\!\!{}_{\textstyle d} ou \frac{n}{d}
• Le nombre du haut s'appelle le numérateur............ n
• Le nombre du bas s'appelle le dénominateur......... d
• Le trait ou barre de fraction signifie que l'on divise le numérateur par le dénominateur.
Exemple : 37 signifie que l'on divise 3 par 7 ; on prononce cette fraction « trois septièmes ».
• 3 est appelé numérateur parce qu'il indique un nombre de trois unités (les septièmes)
• 7 est appelé dénominateur parce qu'il dénomme l'unité (le septième) avec laquelle on opère.
Si on mange les 37 d'une tarte, le numérateur 3 indique le nombre de parts que l'on mange alors que 7 indique le nombre total de parts, donc l'unité considérée...
On trouve aussi parfois la notation
n : d
ou encore
n ÷ d
les deux-points ou l'obélus remplaçant la barre de fraction.
Modélisation d'une fraction[modifier]
Pour comprendre et établir les règles de maniement des fractions, il existe deux méthodes différentes. La première consiste à faire usage de la géométrie. La fraction représente une portion d'aire d'une figure géométrique ou d'une longueur d'un côté d'un polygone, souvent un triangle. Démontrer les lois régissant les fractions revient à faire de la géométrie et à mesurer des aires ou des longueurs. Cette démarche est décrite dans l'article Algèbre géométrique.
Une autre démarche est de nature purement algébrique. Les nombres rationnels sont construits de manière abstraite à partir de classes d'équivalence d'entiers. L'addition et la multiplication issues des nombres entiers sont compatibles avec la classe d'équivalence, ce qui équipe l'ensemble des fractions d'une addition et d'une multiplication naturelles. Cette construction permet d'établir les lois régissant le comportement des fractions.
La démarche choisie ici correspond à la première décrite et est purement géométrique. Les méthodes utilisées s'appliquent pour les fractions d'entiers. La géométrie offre une autre méthode, permettant de généraliser les résultats au cas de fractions de deux nombres réels positifs. Elle est décrite dans l'article Algèbre géométrique.
Représenter une fraction[modifier]
Le but ici est de visualiser une fraction n/d.
La fraction peut être représentée par un dessin. Bien souvent une forme géométrique que l'on divise en plusieurs parties.
Fractions dont n < d[modifier]
1° Le dénominateur d indique le nombre de parties égales à dessiner dans la forme géométrique.
2° Le numérateur n indique le nombre de parties égales utilisées.
Exemple :
Choisissons un rectangle comme forme géométrique et la fraction 34.
Le dénominateur est 4 donc le rectangle sera divisé en 4 parties égales.
Le numérateur est 3 donc seules 3 parties égales seront utilisées.
Autre possibilité : Fraction3 4.svg
Fractions dont n > d[modifier]
Cette fraction sera équivalente au quotient de n /d, (qui représentera le nombre d'unité) suivi d'une fraction constituée par le reste de la division pour numérateur et d pour dénominateur.
Exemple : pour la fraction 7/3, la division entière donne 2, il reste 1.
Le quotient est 2 donc 2 unités, le reste 1 donc 2 1/3.
Il est impossible de représenter ce genre de fraction par un schéma unique, nous utiliserons dès lors plusieurs formes géométriques similaires : Fraction7 3.svg
Prendre une fraction d'une quantité[modifier]
Pour prendre les 23 de 750, on divise 750 par 3, puis on multiplie le résultat par 2 :
750÷3 = 250 ; 250 × 2 = 500. Donc 23 de 750 = 500
Prendre ab de c revient à diviser c par b et à multiplier le tout par a. Ou plus simplement, quand on connaît les règles de calcul sur les fractions, prendre ab de c revient à multiplier ab par c. Plus généralement, on constate que le « de » est remplacé par une multiplication. Il en est de même quand on calcule 75 % de c, on doit juste calculer 75 % multiplié par c. En effet, 75 % est une fraction : 75 % = 75100 = 0,75.
Fractions équivalentes[modifier]
Si on multiplie, ou divise, le numérateur et le dénominateur d'une fraction par un même nombre, on obtient une fraction équivalente.
Exemple : Fraction2 3.svg (on a multiplié 2/3 par 2/2)
De manière générale, les fractions nd et n'd' sont équivalentes dès que n × d'= d × n'.
Exemple : Fraction6 9.svg
\frac{4}{6}=\frac{6}{9} car 6 \times 6 = 4 \times 9\, (on appelle ces deux produits les produits en croix).
Certaines fractions peuvent être simplifiées, c'est-à-dire que n et d peuvent être divisés par un même nombre mais le plus grand possible. Ce nombre s'appelle le PGCD (plus grand commun diviseur) de n et d. Après réduction, la fraction est dite irréductible.
Pour effectuer certaines opérations entre fractions, tous les dénominateurs des fractions doivent être égaux. Pour ce faire, il faut remplacer chaque fraction par une fraction équivalente, en s'arrangeant pour que tous les dénominateurs soient identiques. Ce dénominateur sera le plus petit nombre possible qui soit divisible par chaque dénominateur. Ce nombre s'appelle le PPCM (plus petit commun multiple) des dénominateurs. L'opération s'appelle réduire au même dénominateur.
Exemple :
\frac{3}{4}=\frac{3 \times 3\times 3\times 5}{4 \times 3\times 3\times 5}= \frac{135}{180}
\frac{1}{6}=\frac{1 \times 2\times 3\times 5}{6 \times 2\times 3\times 5}= \frac{30}{180}
\frac{5}{9}=\frac{5 \times 2\times 2\times 5}{9 \times 2\times 2\times 5}= \frac{100}{180}
\frac{14}{15}=\frac{14 \times 2\times 2\times 3}{15 \times 2\times 2\times 3}= \frac{168}{180}
Comparaison de fractions[modifier]
• Pour un même numérateur, plus le dénominateur est petit plus la fraction est grande.
Exemple : Fraction comp1.svg
\frac{2}{3} > \frac{2}{5}
Le numérateur 2 est le même pour chaque fraction.
La comparaison des dénominateurs donne 3 < 5
• Pour un même dénominateur, plus le numérateur est grand, plus la fraction est grande :
Exemple : Fraction comp2.svg
\frac{2}{7} < \frac{5}{7}
Le dénominateur 7 est le même pour chaque fraction.
La comparaison des numérateurs donne 2 < 5
• Si les numérateurs et les dénominateurs sont différents, on peut toujours réduire les fractions au même dénominateur et comparer alors les numérateurs : Comparaison de 1/4 et 2/5
1/4 =5/20 et 2/5 = 8/20. Or 5 < 8 donc 5/20 < 8/20 donc 1/4 < 2/5
Remarque : on peut aussi utiliser l'écriture décimale comme par exemple 1/4 = 0,25 et 2/5 = 0,4, 0,25 < 0,4 donc 14 < 25.
Écriture décimale, écriture fractionnaire[modifier]
Toute fraction possède un développement décimal fini ou illimité périodique qui s'obtient en posant la division de n par d.
1/4 = 0,25
2/3 = 0,666...(période 6)
17/7 = 2,428571428571...(période 428571)
Inversement, tout nombre décimal ou possédant un développement décimal périodique peut s'écrire sous forme de fraction.
Cas du nombre décimal[modifier]
Il suffit de prendre comme numérateur le nombre décimal privé de sa virgule et comme dénominateur 10nn est le nombre de chiffres après la virgule :
0{,}256 = \frac{256}{1000}=\frac{32}{125}
15{,}16 = \frac{1516}{100}=\frac{379}{25}
Cas du développement décimal illimité[modifier]
On commence par se débarrasser de la partie entière : 3,4545... = 3 + 0,4545...
Cas du développement décimal périodique simple[modifier]
Un nombre périodique simple est un nombre décimal dans lequel la période commence immédiatement après la virgule.
0,666 ou 0,4545 ou 0,108108
Comme numérateur, il suffit d'utiliser la période tandis que le dénominateur sera composé d'autant de 9 qu'il y a de chiffres composant la période.
Exemple : 0,4545
Période 45 donc numérateur = 45
Période composée de deux chiffres donc dénominateur = 99
Fraction = 45/99 ou 5/11 par conséquent : 3,4545... = 3 + 5/11 = 38/11
Sinon : Posons x pour 0,4545454545...
100x=45,4545454545... donc 100x - x=45,4545454545... - 0,4545454545... donc 99x=45 donc x = 45/99
Cas du développement décimal périodique mixte[modifier]
Un nombre décimal périodique mixte est un nombre décimal dans lequel la période ne commence pas immédiatement après la virgule.
0,8333 ou 0,14666
Pour trouver le numérateur de la fraction, il faut soustraire la valeur mixte de la valeur mixte suivie de la première période. Exemple : 0,36981981...
valeur mixte : 36
Valeur mixte suivie de la première période : 36981
Numérateur = 36981 - 36 = 36945
Quant au dénominateur, il sera composé d'autant de 9 qu'il y a de chiffres composant la période, suivis d'autant de zéros qu'il y a de chiffres après la virgule composant la valeur mixte.
Exemple 1 : dans la valeur 0,36981981, la période 981 est constituée de 3 chiffres donc le dénominateur sera constitué d'une série de trois 9 suivis de deux zéros puisque la valeur mixte 36 est composée de deux chiffres. Finalement nous aurons :
0,36981981 = 36945/99900 ou 821/2220
Exemple 2 : 1,24545...= \frac{1245-12}{990}=137/110
Opérations sur les fractions[modifier]
Addition et soustraction[modifier]
Pour un dénominateur commun[modifier]
Il suffit d'additionner ou de soustraire le numérateur de chaque fraction et de conserver le dénominateur commun.
Exemple d'une somme :
Fraction sum1.svg
Fraction sum2.svg
Exemple d'une différence :
Fraction diff.svg
Pour un dénominateur différent[modifier]
Avant d'effectuer l'opération, chaque fraction doit être transformée en une fraction équivalente dont le dénominateur leur soit commun.
Exemple : Fraction sum3.svg
A = \frac{1}{6} + \frac{4}{9}
A = \frac{3}{18} + \frac{8}{18}
A = \frac{11}{18}
Multiplication[modifier]
La multiplication de deux fractions est simple à effectuer mais il n'est pas simple de comprendre pourquoi elle fonctionne ainsi.
\frac {2}{15} \times \frac {7} {11} = \frac {2 \times 7} {15 \times 11} = \frac {14} {165}
En voici une explication, basée sur une compréhension intuitive des fractions.
On peut comprendre sept onzièmes comme sept fois un onzième (voir les représentations graphiques ci-dessus) soit \frac {7} {11} comme {7} \times \frac {1}{11}. Ainsi multiplier \frac {2}{15} par \frac {7} {11} revient à effectuer \frac {2}{15} \times 7 \times \frac {1} {11} = \frac {2 \times 7}{15} \times \frac {1}{11}.
Mais multiplier par un onzième revient à diviser par 11, c'est-à-dire à multiplier le dénominateur par 11 (les parts sont 11 fois plus petites), soit : \frac {2 \times 7} {15 \times 11} .
Autres fractions[modifier]
Usage[modifier]
Alors que les Français utilisent volontiers les nombres à virgule, les Anglo-saxons préfèrent souvent exprimer les parties non entières par des fractions — sans doute en raison de la différence culturelle (songer par exemple à la popularité du système métrique et du système impérial dans les deux cultures). Par exemple, ils diront d'une personne qu'elle mesure 5 pieds ⅔ et non pas 5,67 pieds.
Problèmes historiques[modifier]
1. J’ai trouvé une pierre mais je ne l’ai pas pesée. Après lui avoir ajouté un septième de son poids et avoir ajouté un onzième du résultat, j’ai pesé le tout et j’ai trouvé : 1 ma-na [unité de masse]. Quel était à l’origine le poids de la pierre ? (problème babylonien, tablette YBC 4652, problème 7)
2. Un nombre augmenté de son septième donne 19. Quel est ce nombre ? (papyrus Rhind, problème 24)
3. Un nombre augmenté de son quart donne 15. Quel est ce nombre ? (papyrus Rhind, problème 26)
4. Supposons que l’on ait 9 tiges d’or jaune et 11 tiges d’argent blanc qui, à la pesée, ont des poids tout juste égaux. Si l’on échange entre elles une de leurs tiges, l’or devient plus léger de 13 liang [unité de masse]. On demande combien pèsent respectivement une tige d’or et une tige d’argent. (Les neuf chapitres sur l'art mathématique, problème 7.17)
5. Une lance a la moitié et le tiers dans l’eau et neuf paumes à l’extérieur. Je te demande combien elle a de long. (problème médiéval)
Étymologie[modifier]
Le terme fraction, apparu en français à la fin du XIIe siècle, est un dérivé du bas latin fractio - « action de briser » - utilisé dans la terminologie mathématique médiévale pour désigner la « division ». Ce terme lui-même provient du latin classique frangere - « briser » - qui provient de la racine indo-européen °bhreg qui a la même signification et dont dérive la racine gotique brikan qui donne break en anglais et brechen en allemand[1].
Notes et références[modifier]
1. Alain Rey (dir.), Dictionnaire historique de la langue française, éd. Le Robert, 1998, tome II, p. 1478
Voir aussi[modifier]
Sur les autres projets Wikimedia :
|
{
"url": "http://fr.wikipedia.org/wiki/Fraction_(math%C3%A9matiques)",
"source_domain": "fr.wikipedia.org",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "87470",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IKPJNMUBULZIEYCJMSFT2XLWUKZZYAUD",
"WARC-Concurrent-To": "<urn:uuid:40eebcfc-26b4-4b2f-958d-616c32417ab4>",
"WARC-Date": "2013-06-19T00:15:00Z",
"WARC-IP-Address": "208.80.154.225",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QVF4SEDJCLIB5GTXWTSHWNJBRTBMTCET",
"WARC-Record-ID": "<urn:uuid:2cff675a-7f4d-409e-95ae-42f3ef401c3e>",
"WARC-Target-URI": "http://fr.wikipedia.org/wiki/Fraction_(math%C3%A9matiques)",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e63c22e6-66bf-47d6-880c-d505a124d4ee>"
},
"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,
25,
26,
73,
106,
178,
229,
230,
549,
550,
704,
705,
1055,
1056,
1065,
1066,
1102,
1103,
1139,
1140,
1270,
1271,
1344,
1404,
1462,
1556,
1557,
1653,
1654,
1744,
1840,
1841,
2004,
2005,
2041,
2042,
2048,
2049,
2059,
2060,
2066,
2067,
2128,
2129,
2167,
2168,
2633,
2634,
3075,
3076,
3411,
3412,
3447,
3448,
3495,
3496,
3618,
3619,
3650,
3651,
3746,
3812,
3822,
3890,
3963,
3964,
3972,
3980,
3981,
4048,
4049,
4057,
4065,
4066,
4102,
4103,
4134,
4135,
4325,
4326,
4399,
4455,
4456,
4617,
4618,
4664,
4665,
4752,
4753,
4803,
4804,
5229,
5230,
5263,
5264,
5397,
5398,
5453,
5454,
5542,
5543,
5569,
5570,
5678,
5679,
5938,
5939,
6418,
6428,
6429,
6520,
6521,
6611,
6612,
6703,
6704,
6799,
6800,
6835,
6836,
6925,
6954,
6980,
7030,
7075,
7166,
7195,
7221,
7273,
7316,
7499,
7565,
7566,
7688,
7689,
7741,
7742,
7866,
7867,
7878,
7904,
7945,
7946,
8066,
8067,
8099,
8100,
8248,
8249,
8291,
8333,
8334,
8382,
8383,
8463,
8464,
8521,
8522,
8636,
8664,
8812,
8829,
8861,
8918,
8989,
8990,
9028,
9029,
9127,
9128,
9184,
9185,
9313,
9331,
9483,
9501,
9552,
9584,
9772,
9773,
10019,
10056,
10057,
10109,
10110,
10149,
10150,
10185,
10186,
10224,
10225,
10339,
10340,
10362,
10363,
10381,
10399,
10400,
10427,
10428,
10446,
10447,
10488,
10489,
10625,
10653,
10654,
10684,
10716,
10734,
10735,
10760,
10761,
10891,
10892,
10983,
10984,
11063,
11064,
11386,
11574,
11575,
11602,
11603,
11619,
11620,
12016,
12017,
12049,
12050,
12354,
12454,
12551,
12912,
13050,
13051,
13072,
13073,
13518,
13519,
13549,
13550,
13659,
13660,
13681,
13682
],
"line_end_idx": [
25,
26,
73,
106,
178,
229,
230,
549,
550,
704,
705,
1055,
1056,
1065,
1066,
1102,
1103,
1139,
1140,
1270,
1271,
1344,
1404,
1462,
1556,
1557,
1653,
1654,
1744,
1840,
1841,
2004,
2005,
2041,
2042,
2048,
2049,
2059,
2060,
2066,
2067,
2128,
2129,
2167,
2168,
2633,
2634,
3075,
3076,
3411,
3412,
3447,
3448,
3495,
3496,
3618,
3619,
3650,
3651,
3746,
3812,
3822,
3890,
3963,
3964,
3972,
3980,
3981,
4048,
4049,
4057,
4065,
4066,
4102,
4103,
4134,
4135,
4325,
4326,
4399,
4455,
4456,
4617,
4618,
4664,
4665,
4752,
4753,
4803,
4804,
5229,
5230,
5263,
5264,
5397,
5398,
5453,
5454,
5542,
5543,
5569,
5570,
5678,
5679,
5938,
5939,
6418,
6428,
6429,
6520,
6521,
6611,
6612,
6703,
6704,
6799,
6800,
6835,
6836,
6925,
6954,
6980,
7030,
7075,
7166,
7195,
7221,
7273,
7316,
7499,
7565,
7566,
7688,
7689,
7741,
7742,
7866,
7867,
7878,
7904,
7945,
7946,
8066,
8067,
8099,
8100,
8248,
8249,
8291,
8333,
8334,
8382,
8383,
8463,
8464,
8521,
8522,
8636,
8664,
8812,
8829,
8861,
8918,
8989,
8990,
9028,
9029,
9127,
9128,
9184,
9185,
9313,
9331,
9483,
9501,
9552,
9584,
9772,
9773,
10019,
10056,
10057,
10109,
10110,
10149,
10150,
10185,
10186,
10224,
10225,
10339,
10340,
10362,
10363,
10381,
10399,
10400,
10427,
10428,
10446,
10447,
10488,
10489,
10625,
10653,
10654,
10684,
10716,
10734,
10735,
10760,
10761,
10891,
10892,
10983,
10984,
11063,
11064,
11386,
11574,
11575,
11602,
11603,
11619,
11620,
12016,
12017,
12049,
12050,
12354,
12454,
12551,
12912,
13050,
13051,
13072,
13073,
13518,
13519,
13549,
13550,
13659,
13660,
13681,
13682,
13716
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13716,
"ccnet_original_nlines": 245,
"rps_doc_curly_bracket": 0.013852439820766449,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08194621652364731,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004801540169864893,
"rps_doc_frac_lines_end_with_ellipsis": 0.016260160133242607,
"rps_doc_frac_no_alph_words": 0.37035849690437317,
"rps_doc_frac_unique_words": 0.330910861492157,
"rps_doc_mean_word_length": 5.270833492279053,
"rps_doc_num_sentences": 133,
"rps_doc_symbol_to_word_ratio": 0.006402050144970417,
"rps_doc_unigram_entropy": 5.731819152832031,
"rps_doc_word_count": 2064,
"rps_doc_frac_chars_dupe_10grams": 0.01047889981418848,
"rps_doc_frac_chars_dupe_5grams": 0.08383122831583023,
"rps_doc_frac_chars_dupe_6grams": 0.06765328347682953,
"rps_doc_frac_chars_dupe_7grams": 0.05000460147857666,
"rps_doc_frac_chars_dupe_8grams": 0.025737660005688667,
"rps_doc_frac_chars_dupe_9grams": 0.018567880615592003,
"rps_doc_frac_chars_top_2gram": 0.005147530231624842,
"rps_doc_frac_chars_top_3gram": 0.00551520986482501,
"rps_doc_frac_chars_top_4gram": 0.0046879299916327,
"rps_doc_books_importance": -1626.1925048828125,
"rps_doc_books_importance_length_correction": -1626.1925048828125,
"rps_doc_openwebtext_importance": -934.42724609375,
"rps_doc_openwebtext_importance_length_correction": -934.42724609375,
"rps_doc_wikipedia_importance": -918.4793701171875,
"rps_doc_wikipedia_importance_length_correction": -918.4793701171875
},
"fasttext": {
"dclm": 0.9677725434303284,
"english": 0.0012596800224855542,
"fineweb_edu_approx": 1.3367698192596436,
"eai_general_math": 0.12826383113861084,
"eai_open_web_math": 0.9900757074356079,
"eai_web_code": 0.7169738411903381
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.2",
"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": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,681,268,119,063,210,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've heard a lot about the semantic web but I'm still not exactly sure what it is. How will it be different to the web we know now?
share|improve this question
closed as too broad by Joshua Taylor, Jeroen, Andy Lester, Eric Brown, Anatoliy Nikolaev Sep 24 '13 at 4:59
There are either too many possible answers, or good answers would be too long for this format. Please add details to narrow the answer set or to isolate an issue that can be answered in a few paragraphs. If this question can be reworded to fit the rules in the help center, please edit the question.
10 Answers 10
up vote 33 down vote accepted
How will it be different to the web we know now?
Right now the HTML+CSS is centered more on structure and presentation. Semantics is about the meaning of the information. In semantic web you use shared ontologies to establish meaning (semantic) of the object and meaning of relations between the objects. Best known ontologies are: FOAF and Dublin Core.
Typically semantics would be expressed in specialized language, such as RDF or OWL. RDF can be embedded within XHTML using eRDF or W3C's RDFa.
Less structured alternative to eRDF/RDFa are microformats.
Read more at: http://en.wikipedia.org/wiki/Semantic_web
share|improve this answer
1
Dublin core relates to what an information resource contains (data about data / metadata), rather than the relationship between information resources. Information about relationships can be described using ISO topic maps (en.wikipedia.org/wiki/Topic_Maps). – codeinthehole May 12 '10 at 16:05
As far I know - the semantic web is more involved with the relationship between data (rather than classification). – codeinthehole May 12 '10 at 16:07
Just for completeness and because examples often assist in conveying a concept, can you provide a small code example in your answer using one of the languages you mentioned? – w5m Jun 21 '13 at 10:14
The best explanation is by example. Try googling for all cars advertised on the web with engines smaller than 2.0 litres that run unleaded, and have an mp3 connection and can been seen in a showroom conveniently accessible by public transport from my house.
Google just won't be able to help you with that query, not really. You have to make several searches and correlate the results yourself. On the Semantic web, you'd be able to express an interest in products for sale that are cars, and add the constraints. Every result would be useful. One or more UIs might enable you to do that, some may be specialized, others entirely generic.
An other example, creating a chart of things not normally stored in one place, say the popularity of diet coke, or country walks in a population versus the levels of clinical obesity in the same population. For these you may not use a web browser at all, but might use something more like Excel - but the semantic web gives you tools (SPARQL, RDF) for finding and manipulating the data that is out there and is accessible via HTTP.
So the point made by Bravax is not entirely true, not a lot may change - you may merely get some more useful and better mashup web sites. Or you may find yourself doing a whole lot of stuff you never thought of as being related to the web before today.
The current web has lots of alternatives for doing the same thing, say Animated GIFs, Flash, Silverlight, DHTML etc. For putting data on the semantic web there will be a range of tools and formats. RDFa is a good one, a more general type of microformat, but you could provide a dump of the whole database, expose a SPARQL endpoint, use a microformat or a proprietary HTML structure and add a transformation, there will be many tools to suit different cases.
So Vartec is also partially right, you may use RDFa and eRDF but you could also use a whole lot of other things for publishing data.
Note that there is a lot over overlap between the semantic web and another simper concept called Linked Data. How they relate to each other isn't clear, but my perception of it is that the Linked Data web is what you need before Semantic Web tools and techniques have anything to do. Linked Data is about data, the semantic web is more about processing the data, reasoning over it and handling issues like trust reliability and such like. Essentially the bottom few layers of the technology stack.
share|improve this answer
6
Good luck with end users entering SPARQL queries into a search engine. – hsivonen Apr 7 '09 at 13:26
1
I think users will enter SPARQL about as often as they enter SQL now, though perhaps slightly more often as they'll have more data to attract them. I think you'd be appalled to see how much SQL there is embedded in Excel spreadsheets sometimes! – Simon Gibbs Apr 7 '09 at 15:10
My search engine example did not mention SPARQL anyway.... – Simon Gibbs Apr 7 '09 at 15:14
"Linked Data" is just a euphamism for Semantic Web – Mark Cidade Apr 7 '09 at 15:54
Quite possibly, though Linked Data people tend to look an "ontologies" and other things a bit differently. Sem Web people tend to look at things from a maths / logic point of view. Linked Data people the grunt programmer perspective. Compare Open Link Software to Clark and Parsia for a contrast. – Simon Gibbs Apr 7 '09 at 17:13
The Semantic Web is at heart a really simple idea. (Like all the good ones.)
The Web at present consists of documents with links between them. Google have made a pretty good business out of using context, and anchor text within the links, to work out what the links mean and build an engine for retrieving data based on that. In other words, Google guesstimate what the semantic meaning of a link is.
The Semantic Web idea is "what if these links were typed?" Every fact on the Web gets an address - a URI - and is linked to other facts (also URIs) by relations (also URIs). Groups of relations are called "ontologies".
So instead of page A links to page B, like on the current web, links on the Semantic Web are more like:
URI A links to URI B with a link of type URI C.
Anything can have a URI. People can have URIs; usually we use a set of relations called FOAF to describe them. So let's say the URI for Jeff Atwood is http://codinghorror.com/foaf.xml; then you could say:
<http://codinghorror.com> <http://xmlns.com/foaf/0.1/homepage> <http://codinghorror.com/foaf.xml>
ie, http://codinghorror.com is the homepage of the person represented by the contents of http://codinghorror.com/foaf.xml.
Now machines can read, and query, these relationships - so you turn the Web into a database that computers can immediately do something with. The Semantic Web query language is SPARQL, and it's worth checking out.
share|improve this answer
The Semantic Web is just that - a Semantic (meaningful) layer on top of the WWW. It is semi structured (RDF), it is self-describing (ontologies using OWL), and allows resource discovery (SPARQL).
The Semantic Web works on the premise of the "Open World" assumption; just because something is not stated doesn't mean it doesn't exist, it is simply "unknown". This is a fundamentally different logic to that used in an RDBMS like MySQL et al. - if something is missing it doesn't exist - "Closed World" assumption. Prolog and DATALOG are good examples of Close World logics.
If you want to really learn what is happening underneath, you'll need to look at its foundations, which lie in Description Logic. A good overview of the Description Logic can be found here: http://www.inf.unibz.it/~franconi/dl/course/
If you want to learn more about RDF, read the RDF Primer. RDF Semantics is another rip-roaring read.
Researchers have basically given up on the "Semantic" part of the Semantic Web and decided to focus on Linked Data - how RDF triples can be navigated so that we can waste more Internet bandwidth ;-)
share|improve this answer
Currently with HTML pages we have markup tags which describe how content should be displayed, <b>, '<pre>, etc. These tags imply no meaning about their content.
The concept of a semantic web is that documents would contain XML tags that do imply meaning about their content. For example <person><firstname>. The grand idea is that CSS would be able to format documents such as these but it would also be possible to extract meaningful info easily from these documents.
share|improve this answer
That HTML elements have no semantic meaning is a common misconception. HTML covers only the meaning of an element with respect to the structure of a document. HTML has document-focussed semantics not data-focussed semantics. – Jon Cram Apr 7 '09 at 11:52
It didn't say HTML had no semantic meaning at all, I said that they imply no meaning about their content. As you say HTML is structual have meaning towards the renderer. HTML is agnostic to the content itself. – AnthonyWJones Apr 7 '09 at 12:02
1
The Semantic Web with upper-case S is RDF. The use of XML is only incidental. – hsivonen Apr 7 '09 at 13:25
I don't see how changing the case changes the word or that RDF has a monopoly on the concept. XML however is a reasonable basis for delivering the concept regardless of whether you subscribe to a specific implementation of "Semantic". – AnthonyWJones Apr 7 '09 at 13:40
@AnthonyWJones: Fair point, I slightly misread your answer! Hopefully someone reading these comments will learn something from them. – Jon Cram Apr 7 '09 at 14:53
The Semantic Web is what Tim Berners-Lee, the inventor of the World Wide Web, really intended the Web to be—that is, a global graph of interlinked data. It is a generalization of a social graph, where you can use social data (with vocabularies like FOAF) as well as any other kind of machine-understandable data and connect them to each other. The standard formats for describing this infortmation to machines is the Resource Description Format (RDF) and the Web Ontology Language (OWL). There's already a lot of encoded data on the Web, including an RDF version of Wikipedia, called DBPedia.
The Semantic Web will be different than today's Web in that computers as well as humans will understand what documents contain as well as what the significance of the links between documents are. This will facilitate automation of information-processing tasks, including researching information from trustworthy sources. The full SemWeb stack includes cryptography, proof systems, and trust networks.
share|improve this answer
Tim Berners-Lee describes it in his blog post Giant Global Graph (from 2007-11-21):
Three mental moves:
1. Internet: "It isn't the cables, it is the computers which are interesting"
2. (World Wide) Web: "It isn't the computers, but the documents which are interesting"
3. Giant Global Graph: "It's not the documents, it is the things they are about which are important"
About the term "Giant Global Graph":
We can use the word Graph, now, to distinguish from Web.
I called this graph the Semantic Web, but maybe it should have been Giant Global Graph! Any worse than WWWW? ;-) Not the "Semantic Web" term has been established for a long time, I'm not proposing to change it. But let's think about the graph which it is. (Footnote: "Graph" also happens to be the word the RDF specifications use, but that is by the way. While an XML parser creates a DOM tree, an RDF parser creates an RDF graph in memory.)
share|improve this answer
It's a buzz word to attract people's interest, Similiar to Web 2.0
I.e. In the future content will be split from presentation allowing much goodness.
In reality Facts will be subjective, depending on the realibility and authority of the host.
In other words, users won't see much difference from now.
share|improve this answer
The difference is that the computers will know about reliability and authority – Simon Gibbs Apr 7 '09 at 12:42
1
I doubt it. Those are both subjective terms. – Bravax Apr 7 '09 at 12:53
2
The fact that for example "jaguar" means both an animal, a car and few other thing is subjective? Temperature expressed in Kelvin scale is subjective? What are you talking about? – vartec Apr 7 '09 at 12:59
1
No those aren't subjective, but say whether a wikipedia article (on jaguars) is accurate is subjective. In the future we will have some semantic websites but the vast majority won't be. – Bravax Apr 7 '09 at 13:01
3
The semantic web allows for tagging trustworthy sources, which will make it different than the web now in that you can delegate the task of source-checking to the computer. – Mark Cidade Apr 7 '09 at 15:53
The Semantic Web is a distributed information system where interlinked data is published as RDF triples over HTTP. RDF triples consist of subject, predicate and object but can have other things attached to them such as datatypes and annotations about the natural language of objects. On the Semantic Web, URIs are used both as identifiers and as addresses of network resources.
It’s different from the Web, because the Web is a distributed information system of documents and application interfaces.
share|improve this answer
Semantic web is the only pragmatic solution proposed so far to repair inherent design flaws of World Wide Web. Because the designers of the internet, as we know it today, did not provide mechanisms which would address fundamental linguistic phenomenons which govern the way humans think and communicate such as homonymy, synonymy etc. searching for information on the internet results in a flood of false positives. The idea of semantic web boils down to assigning unequivocal identifiers to web resources which will help identify their meaning correctly. If it succeeds one day we may forget what the usual google search looked like, if it fails all will remain as it is now.
share|improve this answer
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/725261/what-is-the-semantic-web",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "129327",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F5DQZPXQ2BPBKCWY47VTDJGB3GOVCWMA",
"WARC-Concurrent-To": "<urn:uuid:2911e478-64f3-4059-b214-01016f23e710>",
"WARC-Date": "2015-05-28T11:02:13Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OBBBDQAVGJNSJSY4XUU55NU7RQFPYLTO",
"WARC-Record-ID": "<urn:uuid:3e3a0780-5812-4bef-b30c-ede08822a220>",
"WARC-Target-URI": "http://stackoverflow.com/questions/725261/what-is-the-semantic-web",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:85448c06-e227-443d-8cba-6e06382d943d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
290,
291,
319,
320,
428,
429,
729,
730,
744,
745,
775,
776,
825,
826,
1131,
1132,
1275,
1276,
1335,
1336,
1392,
1393,
1419,
1423,
1717,
1722,
1874,
1879,
2080,
2081,
2339,
2340,
2721,
2722,
3154,
3155,
3408,
3409,
3867,
3868,
4001,
4002,
4500,
4501,
4527,
4531,
4633,
4637,
4916,
4921,
5014,
5019,
5104,
5109,
5440,
5441,
5518,
5519,
5843,
5844,
6063,
6064,
6168,
6169,
6217,
6218,
6423,
6424,
6522,
6523,
6646,
6647,
6861,
6862,
6888,
6889,
7085,
7086,
7463,
7464,
7699,
7700,
7801,
7802,
8001,
8002,
8028,
8029,
8190,
8191,
8499,
8500,
8526,
8531,
8787,
8792,
9038,
9042,
9151,
9156,
9427,
9432,
9596,
9597,
10190,
10191,
10592,
10593,
10619,
10620,
10704,
10705,
10725,
10726,
10806,
10895,
10998,
10999,
11036,
11037,
11094,
11095,
11537,
11538,
11564,
11565,
11632,
11633,
11716,
11809,
11810,
11868,
11869,
11895,
11900,
12013,
12017,
12091,
12095,
12303,
12307,
12522,
12526,
12733,
12734,
13112,
13113,
13235,
13236,
13262,
13263,
13940,
13941,
13967,
13968
],
"line_end_idx": [
25,
157,
158,
290,
291,
319,
320,
428,
429,
729,
730,
744,
745,
775,
776,
825,
826,
1131,
1132,
1275,
1276,
1335,
1336,
1392,
1393,
1419,
1423,
1717,
1722,
1874,
1879,
2080,
2081,
2339,
2340,
2721,
2722,
3154,
3155,
3408,
3409,
3867,
3868,
4001,
4002,
4500,
4501,
4527,
4531,
4633,
4637,
4916,
4921,
5014,
5019,
5104,
5109,
5440,
5441,
5518,
5519,
5843,
5844,
6063,
6064,
6168,
6169,
6217,
6218,
6423,
6424,
6522,
6523,
6646,
6647,
6861,
6862,
6888,
6889,
7085,
7086,
7463,
7464,
7699,
7700,
7801,
7802,
8001,
8002,
8028,
8029,
8190,
8191,
8499,
8500,
8526,
8531,
8787,
8792,
9038,
9042,
9151,
9156,
9427,
9432,
9596,
9597,
10190,
10191,
10592,
10593,
10619,
10620,
10704,
10705,
10725,
10726,
10806,
10895,
10998,
10999,
11036,
11037,
11094,
11095,
11537,
11538,
11564,
11565,
11632,
11633,
11716,
11809,
11810,
11868,
11869,
11895,
11900,
12013,
12017,
12091,
12095,
12303,
12307,
12522,
12526,
12733,
12734,
13112,
13113,
13235,
13236,
13262,
13263,
13940,
13941,
13967,
13968,
14058
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14058,
"ccnet_original_nlines": 158,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40075162053108215,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028356680646538734,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19405534863471985,
"rps_doc_frac_unique_words": 0.32754236459732056,
"rps_doc_mean_word_length": 4.679237365722656,
"rps_doc_num_sentences": 146,
"rps_doc_symbol_to_word_ratio": 0.00034165001125074923,
"rps_doc_unigram_entropy": 5.755768775939941,
"rps_doc_word_count": 2360,
"rps_doc_frac_chars_dupe_10grams": 0.0067010801285505295,
"rps_doc_frac_chars_dupe_5grams": 0.04926197975873947,
"rps_doc_frac_chars_dupe_6grams": 0.045639768242836,
"rps_doc_frac_chars_dupe_7grams": 0.01992212049663067,
"rps_doc_frac_chars_dupe_8grams": 0.0067010801285505295,
"rps_doc_frac_chars_dupe_9grams": 0.0067010801285505295,
"rps_doc_frac_chars_top_2gram": 0.027890970930457115,
"rps_doc_frac_chars_top_3gram": 0.027890970930457115,
"rps_doc_frac_chars_top_4gram": 0.010866610333323479,
"rps_doc_books_importance": -1294.7421875,
"rps_doc_books_importance_length_correction": -1294.7421875,
"rps_doc_openwebtext_importance": -716.5693359375,
"rps_doc_openwebtext_importance_length_correction": -716.5693359375,
"rps_doc_wikipedia_importance": -515.7687377929688,
"rps_doc_wikipedia_importance_length_correction": -515.7687377929688
},
"fasttext": {
"dclm": 0.49249404668807983,
"english": 0.9308145642280579,
"fineweb_edu_approx": 2.749872922897339,
"eai_general_math": 0.350424587726593,
"eai_open_web_math": 0.3304263949394226,
"eai_web_code": 0.026712600141763687
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "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": "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
|
3,383,515,124,292,496,000 |
Making a Flickr-powered Slideshow
Making a Flickr-powered Slideshow
Today we will be developing a jQuery plugin that will make it easy to create slideshows, product guides or presentations from your Flickr photo sets. The plugin will be using Flickr’s APIs and YQL to fetch the photos in the sets, after which it will create the markup of the slideshow and listen for events.
Updated on Oct 11th 2011: Due to a change in Flickr’s API, you are now required to provide an API key when requesting the photos in a set. The script and this tutorial were updated to reflect this change. If you have downloaded this script before, replace jqFlick.js and script.js. You will also need to generate a Flickr API key (as explained in the tutorial) and paste it in script.js.
The HTML
Before starting with jqFlick (the name of our plugin), lest first lay down the HTML structure of the underlying document. I am including the plugin’s CSS stylesheet – jqFlick.css, which we will be creating in the next step, and the plugin’s js file – jqFlick.js.
index.html
<!DOCTYPE html>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>jqFlick - Flickr Micro Slider Plugin | Tutorialzine Demo</title>
<link rel="stylesheet" type="text/css" href="assets/css/styles.css" />
<link rel="stylesheet" type="text/css" href="assets/jqFlick/jqFlick.css" />
</head>
<body>
<div id="page">
<h1>Flickr Powered Micro Slider</h1>
<div id="flickrSlider"></div>
<p class="demos">More demos: <select>
<option value="1" selected>Presentation Example</option>
<option value="2">Photo Slideshow</option>
<option value="3">Product Shots (small)</option>
</select></p>
</div>
<script src="http://ajax.googleapis.com/ajax/libs/jquery/1.5.0/jquery.min.js"></script>
<script src="assets/jqFlick/jqFlick.js"></script>
<script src="assets/js/script.js"></script>
</body>
</html>
Additionally, we have styles.css, which styles the page itself, and script.js, which calls the plugin. Also, we have a select element with demos of three different configurations of the plugin. We will come back to this in a moment.
The other important element in the fragment above is the #flickrSlider div, which is going to be populated with the slider’s HTML by the jqFlick plugin:
Generated Code
<div id="flickrSlider" class="flickrSliderHolder" style="width: 500px; height: 345px;">
<span class="caption"></span>
<ul style="width: 1000px; height: 320px; left: 0px;">
<li style="background-image: url('example.jpg'); width: 500px;"></li>
<li style="background-image: url('example2.jpg'); width: 500px;"></li>
</ul>
<div class="arrows">
<a class="previous" href="#"></a>
<a class="next" href="#"></a>
</div>
</div>
The #flickrSlider div is assigned a class name – .flickrSliderHolder, a width and a height. Inside it we have an unordered list with the slides, an arrow div holder with previous and next arrows, and a span for the captions. The unordered list is set to be wide enough to accommodate the LIs side by side. The slide animation is achieved by animating the left property of the UL.
Flickr Slideshow jQuery Plugin
Flickr Slideshow jQuery Plugin
The CSS
We need to provide the plugin with its own stylesheet, so it is easier to include into a website. This stylesheet must only affect the markup generated by the plugin, and we have to make sure it does not corrupt any other elements on the page. To achieve this, we are going to prefix the styles with the .flickrSliderHolder class name, assigned to the slideshow holder by the plugin.
jqFlick.css
.flickrSliderHolder{
position:relative;
overflow:hidden;
}
.flickrSliderHolder ul{
position:absolute;
height:100%;
list-style:none;
}
.flickrSliderHolder ul li{
float:left;
height:100%;
background-repeat:no-repeat;
background-position:center center;
}
.flickrSliderHolder .arrows{
position:absolute;
right:0;
bottom:0;
}
.flickrSliderHolder .arrows a{
width:22px;
height:22px;
float:left;
background:url('arrows.png') no-repeat top left;
text-decoration:none;
outline:none;
border:none;
}
.flickrSliderHolder a.previous:hover{
background-position:left bottom;
}
.flickrSliderHolder a.next{
margin-left:-1px;
background-position:top right;
}
.flickrSliderHolder a.next:hover{
background-position:bottom right;
}
.flickrSliderHolder .caption{
font-size:13px;
line-height: 22px;
position:absolute;
bottom:0;
left:0;
}
Once called, jqFlick assigns the .flickrSliderHolder class to the slider holder div, and generates the markup that we saw in the previous step. The code above styles the arrows, caption, unordered list and the container.
Perfect for Slideshows, Product Guides and Presentations
Perfect for Slideshows, Product Guides and Presentations
The jQuery Code
Starting with the jQuery section, lets first see what a response from the Flickr API looks like:
Sample YQL Response
{
"query": {
"count": 3,
"created": "2011-02-19T20:11:18Z",
"lang": "en-US",
"results": {
"photo": [{
"farm": "6",
"id": "5456788328",
"isprimary": "1",
"secret": "e9eddccf8e",
"server": "5213",
"title": "The title of the image becomes an optional caption."
}, {
"farm": "6",
"id": "5456179165",
"isprimary": "0",
"secret": "28bae85307",
"server": "5216",
"title": "There are no limits really."
}, {
"farm": "6",
"id": "5456179233",
"isprimary": "0",
"secret": "e05287691f",
"server": "5018",
"title": "What more do you need.."
}]
}
}
}
Here I’ve selected the photos that are contained in this photoset. The response contains useful information about the images. We are going to use the farm, id, secret, and server properties of these objects to put together the URL at which the photos are located, while the title properties are going to be used as captions.
You can find your photos at the following address, by replacing the keywords with the objects’ values:
http://farm{FARM}.static.flickr.com/{SERVER}/{ID}_{SECRET}.jpg
In our plugin, we will be using Flickr’s API method for listing photos in a photoset. However, to communicate with Flickr’s APIs, we will need to register for an API key.
API key registration
This step is actually quite simple. You need to have a valid Flickr registration and visit this page. After you choose the type of the registration (non commercial in our case), you fill in the application details. You now get your API key, which you will need in a second.
For more info on the various Flickr APIs you can go to their documentation page. If you would like to know more about the URL addresses of their photos (including info on how to fetch different image sizes) see here. You can also read more about YQL in our previous YQL tutorials.
Now we are ready to write the jQuery code. As you know, encapsulating jQuery functionality in a plugin has many benefits, as you can read from our jQuery plugin tutorial. Lets see what jqFlick.js, the main plugin file, looks like:
jqFlick.js
(function($){
$.fn.jqFlick = function(options){
// Default options:
options = $.extend({
width:500,
height:500,
maxFetch:50,
captions:false,
autoAdvance:false,
advancePeriod:5000,
apiKey:''
},options);
// Using YQL and the flickr.photosets.photos table to query the Flickr API.
var YQL = 'http://query.yahooapis.com/v1/public/yql?q={QUERY}&format=json&callback=?',
query = "SELECT * FROM flickr.photosets.photos({MAX}) WHERE photoset_id='{PHOTOSET}'"+
" AND api_key='{KEY}'";
// Replacing the "{EXAMPLE}" keywords from the strings:
YQL = templateReplace(YQL,{
"query": encodeURIComponent(
templateReplace(query,{
photoset : options.photosetID,
max : options.maxFetch,
key : options.apiKey
}
))
});
// Template for building Flickr's image URLs:
var flickrSRC = 'http://farm{FARM}.static.flickr.com/{SERVER}/{ID}_{SECRET}.jpg',
flickrSlider = this;
flickrSlider.trigger('jqFlickRemove');
// Fetching the images using Flickr's API:
$.getJSON(YQL,function(r){
if(!r || !r.query || !r.query.count){
throw "There is no such photoset!";
}
var currentPos = 1,
cnt = r.query.count;
var caption = $('<span>',{
className: 'caption'
}).appendTo(flickrSlider);
var ul = $('<ul>',{
css:{
width: options.width*r.query.count,
height:options.height
}
});
// Looping through the photo results:
$.each(r.query.results.photo,function(){
data = this;
// Creating a new LI element with the photo as its
// centered background image:
$('<li>',{
css : {
backgroundImage: 'url('+templateReplace(flickrSRC,data)+')',
width: options.width
}
}).appendTo(ul);
});
flickrSlider.addClass('flickrSliderHolder')
.width(options.width)
.height(options.height+25)
.append(ul);
// Binding a custom "slide" event.
// You can then flickrSlider.trigger("slide",2)
// to go to the second slide:
flickrSlider.bind('slide',function(e,slide){
if(slide < 1 || slide > cnt || ul.is(':animated')){
return false;
}
ul.animate({
left:-(slide-1)*options.width
},{
easing: 'easeInOutCirc',
duration: 300
});
if(options.captions){
// Animating the transition between
// the captions (if enabled):
caption.fadeOut(150,function(){
caption.html(r.query.results.photo[slide-1].title);
}).fadeIn(150);
}
currentPos = slide;
});
var arrows = $('<div>',{
className: 'arrows'
});
// Creating the previous / next arrows, and
// binding event listeners for the click events:
var arrowPrev = $('<a>',{
className: 'previous',
href: '#',
click : function(){
var toShow = currentPos - 1;
if(toShow < 1){
toShow = cnt;
}
flickrSlider.trigger('slide',[toShow]);
return false;
}
}).appendTo(arrows);
var arrowNext = $('<a>',{
className: 'next',
href: '#',
click : function(){
var toShow = currentPos + 1;
if(toShow > cnt){
toShow = 1;
}
flickrSlider.trigger('slide',[toShow]);
return false;
}
}).appendTo(arrows);
arrows.appendTo(flickrSlider);
// Showing the first slide by default:
flickrSlider.trigger('slide',[1]);
if(options.autoAdvance){
// If auto advance is enabled, listen for
// the load event and schedule a periodic slide change.
//
// Read more here:
// http://tutorialzine.com/2011/01/how-to-make-auto-advancing-slideshows/
$(window).load(function(){
$.fn.jqFlick.timeOut = null;
arrowPrev.add(arrowNext).click(function(e,simulated){
if(!simulated){
clearTimeout($.fn.jqFlick.timeOut);
}
});
(function autoAdvance(){
if($.fn.jqFlick.timeOut){
arrowNext.trigger('click',[true]);
}
$.fn.jqFlick.timeOut = setTimeout(autoAdvance,options.advancePeriod);
})();
});
}
});
// This custom event removes all event listeners,
// and empties the slider holder:
flickrSlider.bind('jqFlickRemove',function(){
if($.fn.jqFlick.timeOut){
clearTimeout($.fn.jqFlick.timeOut);
}
flickrSlider.empty().unbind('jqFlickRemove slide');
});
return flickrSlider;
};
// Helper function for replacing "{KEYWORD}" with
// the respectful values of an object:
function templateReplace(template,data){
return template.replace(/{([^}]+)}/g,function(match,group){
return data[group.toLowerCase()];
});
}
// A custom easing functon. For more info visit:
// http://gsgd.co.uk/sandbox/jquery/easing/
$.easing.easeInOutCirc = function (x, t, b, c, d) {
if ((t/=d/2) < 1) return -c/2 * (Math.sqrt(1 - t*t) - 1) + b;
return c/2 * (Math.sqrt(1 - (t-=2)*t) + 1) + b;
};
})(jQuery);
jqFlick takes an options object as its only parameter. You are required to specify the id of the photoset (the photosetID property), which you can easily copy from the address bar of your web browser while viewing the photoset. Only public photosets can be shown by the jqFlick.
Now lets see how the plugin is called. At the top of this file, you will need to paste your Flickr API key that we generated above:
js/script.js
$(document).ready(function(){
// Paste your Flickr API key here
var apiKey = '';
// Creating a flickr slider. This is
// how you would probably use the plugin.
$('#flickrSlider').jqFlick({
photosetID: '72157625956932639',
width:500,
height:320,
autoAdvance:true,
apiKey:apiKey
});
// Creating different flickr sliders,
// depending on the select element value.
$('select').change(function(){
var options = {};
switch(this.value){
case '1':
options = {
photosetID: '72157625956932639',
width:500,
height:320,
captions:true,
autoAdvance:true,
apiKey:apiKey
};
break;
case '2':
options = {
photosetID:'42296',
width:500,
height:500,
captions:true,
autoAdvance:true,
apiKey:apiKey
};
break;
case '3':
options = {
photosetID:'72157625961099915',
width:200,
height:150,
apiKey:apiKey
}
}
$('#flickrSlider').jqFlick(options);
});
});
In the switch statement above, I am listening for the change event of the select dropdown. There, depending on the value of the select, I assign different options objects, which are then passed to the plugin. This demonstrates the different options that are available without taking much screen space.
With this our Flickr-powered Slideshow is complete!
Conclusion
You can use this plugin to build slideshows, product guides or presentations. To use the plugin you just need to drop the jqFlickr folder to your website root and include jqFlick.css and jqFlick.js in your HTML documents.
by Martin Angelov
Martin is a web developer with an eye for design from Bulgaria. He founded Tutorialzine in 2009 and publishes new tutorials weekly.
Tutorials
26 Comments
1. Kevin says:
Very nice bit of jQuerying there, I'll have a play =) Thanks
2. Alex Flueras says:
Useful, simple and nice plugin. Thanks for sharing!
3. Jireck says:
Simple, useful and power plugin....
Nice tut and thanks
4. Tristan says:
Simple, yet capable. This deserves the official awesomesauce label!
5. e11world says:
I love that you don't need an api key for this to work and it pulls more than 20 pix as well. Totally great plugin and I would love to be able to add thumbs to it but don't really know where to start!!
6. Revell says:
Thank you!
Simple, clean and just the thing i was looking for, for about a week!
7. Yes, e11world, nice that you don't need an api key. Maybe useful in the future, but I don't see myself using it now since no sites I've done recently really utilize Flickr. Thanks though for this tut.
8. Lasse Jensen says:
Anybody else having trouble with making the images bigger?
I edited everywhere possible, but the images is still only 500 px wide...
9. Lasse Jensen says:
Any news on making the images bigger?
10. Jared says:
love it, but im also having some trouble making the photos bigger. for my site i would like to have 647x431px but everything i have tried still only places the images in a square that im pretty sure is 500px.
I've gone through all the code several times except the jquery.min.js which im unable to edit...
11. Cedric says:
@ Lassee and @Jared
The flickr feed itself sets the sizes of the images. I am not sure if you can use a pipe to change the feed and set the appropriate size, but its worth a shot. The feed specifies different sizes _s,_m,_l,_o,_z. You can check the flickr api for more information on this.
But, you would need to have a script to resize the images as they are loaded onto the page -- specifically one that can resize proportionally. There is one jquery slidershow that does just this, "Supersized!", however, it wasn't meant as a typical slideshow, BUT, you can rework the css to place the slideshow within a container of whatever size you need (its originally meant as a background slideshow).
The problem with flickr and slideshows....no one has created a slideshow/slider/plugin specifically for uh slideshows. There are plenty of plugins that pull from the api to display images, thumbs, or the original size of the image. There used to be a plugin called "Galleria" (and i think you can still download it), that uses the flickr api, and allows images to be resized, however, the developers of that project have stopped supporting it. blah blah blah
12. Justin MacLeod says:
I have been using this awesome plugin for a bit now and today I noticed it was returning the error "There is no such photoset!". The thing is I can see the photoset on the Flickr website and everything appears fine. I also see the exact same error happening on the demo. I wonder if Flickr/Yahoo have changed something?
Justin
1. Caleb says:
Justin, my Flickr slider just recently stopped working. I'm wondering if something has changed too... The demo isn't even working.
13. Luc says:
I use this picture rotator on a nonprofit organization's site. One fundraiser is a golf scramble. Every year they take pictures. Before I started working on their site they simply had a stack of pictures on the past scramble pages. The pictures are now pulled from flicker and individually captioned (They were not before.) On flickers interface it is easy to caption, rearrange and categorize pictures into sets. I actually modified the script to parse the url for a phrase and a year. The phrase and year determines what set of pictures the script will pull. It's pretty helpful!
I have found two other flicker picture rotator's but this one is the easiest to work with, along with being the best in my opinion!
One more thing. Some of the past comments have been saying that the picture rotator is giving errors and is broken. Martin (the author of this code) has fixed this problem and it works great now.
14. Joe Jag says:
I've found this and thought it would be a great fit for a website I'm building. The only problem I'm having is that for some reason the autoAdvance option doesn't work in IE. Any ideas why? It works in other browsers...and your autoAdvance tutorial (http://demo.tutorialzine.com/2011/01/slideshow-autoadvance-jquery/) works in IE but the code built into this script doesn't. Any help would be greatly appreciated. Thanks!
15. Kokoro says:
I'm new to javascript would you please explain what to do with =
http://farm{FARM}.static.flickr.com/{SERVER}/{ID}_{SECRET}.jpg
I'm not sure what to replace or where to find the info.
Thank you in advance.
16. Kokoro says:
any pointers on how to make the other two sliders autoadvance.
17. For anyone that is looking for help on bringing in other image sizes, check out this URL: link.
Basically, you'll want to find this line in jqFlick.js:
var flickrSRC = 'http://farm{FARM}.static.flickr.com/{SERVER}/{ID}_{SECRET}.jpg',
After the {SECRET} add a letter to represent the size you want the image imported as.
Such as {SECRET}_z.jpg, {SECRET}_m.jpg
s small square 75x75
q large square 150x150
t thumbnail, 100 on longest side
m small, 240 on longest side
n small, 320 on longest side
- medium, 500 on longest side
z medium 640, 640 on longest side
b large, 1024 on longest side*
o original image, either a jpg, gif or png, depending on source format
1. Kerry Griggs says:
I have everything working and can resize the images using the method Jon Bukiewicz described. That works great for everything except original images. Just putting in the _o does not work.
I was able to obtain the values (ex. farm-id: 1, server-id: 2, photo-id:, 1418878, secret: 1e92283336, size: m) for my images but where does that information go?
18. Stefan says:
@ Kerry
I think the _o images only work with an »pro« account due to the limited original images rights in the free account.
But I haven’t tried.
19. undsoft says:
Your slideshow does not work correctly with the latest jquery.
The problem is with:
$('<span>',{
className: 'caption'
})
In my browser it just creates the span with 'className' attribute, instead of 'class'.
20. Love this slideshow, but had the same problem where it doesn't work properly with the latest version of Jquery, so had to go back to version 1.5 which isn't ideal.
Any chance it could be updated please?
21. Thor says:
Hi, thanks for a great tutorial!
I've implementet the slideshow on my page, and the images loads and slides perfectly. Only thing I can't figure out is the images seems a little off.
I've taken a screenshot to try to illustrate it:
http://tobba.org/bilder/screenshot.png
In the screenshot there, I have drawn a red rectangle around the problem.
The slideshow can be seen at my experimental page http://tobba.org/no/
Hope someone can help me with this issue.
Thanks
-Thor
1. Thor says:
OK, not mutch response here.
I've discovered that this problem occures when I use the _z parameter to get large photos from Flickr. Is there anyway to resolve this without removing the _z parameter?
Thanks
- Thor
22. benz says:
I like this plugin so much, thank you!
23. dubbs says:
Lovely slider - great work!
Is it possible to get the autoadvance to be set to true after a user interaction on the next/prev button? By defualt it stops when the user presses next/prev - How can I fire the function to get autoplay to restart following the button press? Perhaps have a toggle button for autoadvance?
Add Comment
Add a Reply
HTML is escaped automatically. Surround code blocks with <pre></pre> for readability.
Perks: **bold** __italics__ [some text](http://example.com) for links
|
{
"url": "http://tutorialzine.com/2011/02/flickr-api-slideshow-jquery/",
"source_domain": "tutorialzine.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "73137",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:J3LDQK6ENIEXM5HIAHNTTDMQEWLK2CSM",
"WARC-Concurrent-To": "<urn:uuid:63d058ed-6726-426f-8c45-c458849decc5>",
"WARC-Date": "2014-03-09T03:05:18Z",
"WARC-IP-Address": "69.164.217.35",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MIYH7OQ72A5PTSUJJRHUXB7GTT5KOFZN",
"WARC-Record-ID": "<urn:uuid:3c30e805-9802-45c3-a222-370c50f9b657>",
"WARC-Target-URI": "http://tutorialzine.com/2011/02/flickr-api-slideshow-jquery/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:36bed7f0-acb1-4b60-a388-576687fed972>"
},
"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,
34,
35,
69,
70,
378,
379,
767,
768,
777,
778,
1041,
1042,
1053,
1054,
1070,
1077,
1084,
1154,
1226,
1227,
1298,
1374,
1375,
1383,
1390,
1391,
1407,
1408,
1446,
1447,
1478,
1479,
1518,
1580,
1631,
1688,
1706,
1707,
1714,
1715,
1803,
1853,
1897,
1898,
1906,
1914,
1915,
2148,
2149,
2302,
2303,
2318,
2319,
2407,
2438,
2493,
2565,
2638,
2645,
2667,
2703,
2735,
2743,
2750,
2751,
3131,
3132,
3163,
3164,
3195,
3196,
3204,
3205,
3589,
3590,
3602,
3603,
3624,
3644,
3662,
3664,
3665,
3689,
3709,
3723,
3741,
3743,
3744,
3771,
3784,
3798,
3828,
3864,
3866,
3867,
3896,
3916,
3926,
3937,
3939,
3940,
3971,
3984,
3998,
4011,
4061,
4084,
4099,
4113,
4115,
4116,
4154,
4188,
4190,
4191,
4219,
4238,
4270,
4272,
4273,
4307,
4342,
4344,
4345,
4375,
4392,
4412,
4432,
4443,
4452,
4454,
4455,
4676,
4677,
4734,
4735,
4792,
4793,
4809,
4810,
4907,
4908,
4928,
4929,
4931,
4946,
4966,
5009,
5034,
5055,
5079,
5108,
5144,
5178,
5218,
5252,
5331,
5348,
5377,
5413,
5447,
5487,
5521,
5576,
5593,
5622,
5658,
5692,
5732,
5766,
5817,
5832,
5842,
5848,
5850,
5851,
6176,
6177,
6280,
6281,
6344,
6345,
6516,
6517,
6538,
6539,
6813,
6814,
7095,
7096,
7327,
7328,
7339,
7340,
7354,
7355,
7390,
7391,
7413,
7414,
7437,
7451,
7466,
7482,
7501,
7523,
7546,
7559,
7573,
7574,
7652,
7653,
7742,
7832,
7860,
7861,
7919,
7920,
7950,
7982,
8010,
8046,
8075,
8101,
8107,
8113,
8119,
8120,
8168,
8169,
8253,
8277,
8278,
8319,
8320,
8365,
8366,
8395,
8436,
8476,
8481,
8482,
8505,
8530,
8531,
8561,
8586,
8616,
8617,
8640,
8650,
8691,
8718,
8724,
8731,
8732,
8773,
8774,
8818,
8835,
8836,
8891,
8925,
8926,
8941,
8954,
9021,
9048,
9055,
9076,
9083,
9084,
9131,
9159,
9192,
9211,
9212,
9250,
9301,
9334,
9335,
9383,
9439,
9458,
9464,
9465,
9482,
9517,
9525,
9555,
9574,
9582,
9583,
9609,
9610,
9651,
9686,
9687,
9724,
9782,
9803,
9809,
9810,
9834,
9841,
9842,
9870,
9894,
9901,
9902,
9949,
10001,
10002,
10031,
10058,
10073,
10097,
10131,
10152,
10172,
10179,
10180,
10225,
10244,
10250,
10274,
10275,
10304,
10327,
10342,
10366,
10400,
10423,
10441,
10448,
10449,
10494,
10513,
10519,
10543,
10544,
10578,
10579,
10621,
10622,
10660,
10661,
10689,
10690,
10736,
10796,
10803,
10826,
10904,
10905,
10936,
10937,
10971,
10972,
11031,
11053,
11096,
11104,
11113,
11114,
11144,
11176,
11218,
11226,
11302,
11313,
11321,
11326,
11332,
11333,
11385,
11421,
11422,
11470,
11499,
11539,
11544,
11545,
11600,
11601,
11607,
11608,
11631,
11632,
11636,
11637,
11688,
11728,
11729,
11771,
11833,
11870,
11876,
11879,
11880,
11930,
11975,
11976,
12029,
12093,
12143,
12147,
12148,
12160,
12161,
12440,
12441,
12573,
12574,
12587,
12588,
12618,
12619,
12654,
12672,
12673,
12711,
12754,
12755,
12785,
12820,
12833,
12847,
12867,
12883,
12888,
12889,
12928,
12971,
12972,
13004,
13005,
13025,
13026,
13048,
13061,
13077,
13115,
13131,
13148,
13168,
13191,
13210,
13217,
13228,
13241,
13257,
13282,
13298,
13315,
13335,
13358,
13377,
13384,
13395,
13408,
13424,
13461,
13477,
13494,
13513,
13519,
13523,
13524,
13563,
13568,
13569,
13573,
13574,
13876,
13877,
13929,
13930,
13941,
13942,
14164,
14165,
14183,
14184,
14316,
14317,
14327,
14328,
14340,
14341,
14358,
14359,
14424,
14425,
14449,
14450,
14506,
14507,
14525,
14526,
14566,
14590,
14591,
14610,
14611,
14683,
14684,
14704,
14705,
14911,
14912,
14930,
14931,
14946,
14947,
15021,
15022,
15228,
15229,
15253,
15254,
15317,
15395,
15396,
15420,
15421,
15463,
15464,
15482,
15483,
15696,
15697,
15798,
15799,
15818,
15819,
15843,
15844,
16118,
16119,
16528,
16529,
16992,
16993,
17020,
17021,
17345,
17346,
17357,
17358,
17377,
17378,
17515,
17516,
17532,
17533,
18119,
18255,
18256,
18456,
18457,
18477,
18478,
18904,
18905,
18924,
18925,
18994,
19061,
19062,
19122,
19123,
19149,
19150,
19169,
19170,
19237,
19238,
19340,
19341,
19401,
19402,
19488,
19489,
19579,
19580,
19623,
19624,
19649,
19676,
19713,
19746,
19779,
19813,
19851,
19886,
19961,
19962,
19988,
19989,
20183,
20184,
20352,
20353,
20372,
20373,
20385,
20386,
20507,
20508,
20533,
20534,
20554,
20555,
20622,
20647,
20664,
20689,
20696,
20697,
20788,
20789,
20959,
20960,
21003,
21004,
21021,
21022,
21059,
21213,
21214,
21267,
21268,
21311,
21312,
21390,
21465,
21466,
21512,
21513,
21524,
21534,
21535,
21553,
21554,
21589,
21765,
21766,
21779,
21792,
21793,
21810,
21811,
21854,
21855,
21873,
21874,
21906,
21907,
22200,
22201,
22213,
22214,
22226,
22227,
22313
],
"line_end_idx": [
34,
35,
69,
70,
378,
379,
767,
768,
777,
778,
1041,
1042,
1053,
1054,
1070,
1077,
1084,
1154,
1226,
1227,
1298,
1374,
1375,
1383,
1390,
1391,
1407,
1408,
1446,
1447,
1478,
1479,
1518,
1580,
1631,
1688,
1706,
1707,
1714,
1715,
1803,
1853,
1897,
1898,
1906,
1914,
1915,
2148,
2149,
2302,
2303,
2318,
2319,
2407,
2438,
2493,
2565,
2638,
2645,
2667,
2703,
2735,
2743,
2750,
2751,
3131,
3132,
3163,
3164,
3195,
3196,
3204,
3205,
3589,
3590,
3602,
3603,
3624,
3644,
3662,
3664,
3665,
3689,
3709,
3723,
3741,
3743,
3744,
3771,
3784,
3798,
3828,
3864,
3866,
3867,
3896,
3916,
3926,
3937,
3939,
3940,
3971,
3984,
3998,
4011,
4061,
4084,
4099,
4113,
4115,
4116,
4154,
4188,
4190,
4191,
4219,
4238,
4270,
4272,
4273,
4307,
4342,
4344,
4345,
4375,
4392,
4412,
4432,
4443,
4452,
4454,
4455,
4676,
4677,
4734,
4735,
4792,
4793,
4809,
4810,
4907,
4908,
4928,
4929,
4931,
4946,
4966,
5009,
5034,
5055,
5079,
5108,
5144,
5178,
5218,
5252,
5331,
5348,
5377,
5413,
5447,
5487,
5521,
5576,
5593,
5622,
5658,
5692,
5732,
5766,
5817,
5832,
5842,
5848,
5850,
5851,
6176,
6177,
6280,
6281,
6344,
6345,
6516,
6517,
6538,
6539,
6813,
6814,
7095,
7096,
7327,
7328,
7339,
7340,
7354,
7355,
7390,
7391,
7413,
7414,
7437,
7451,
7466,
7482,
7501,
7523,
7546,
7559,
7573,
7574,
7652,
7653,
7742,
7832,
7860,
7861,
7919,
7920,
7950,
7982,
8010,
8046,
8075,
8101,
8107,
8113,
8119,
8120,
8168,
8169,
8253,
8277,
8278,
8319,
8320,
8365,
8366,
8395,
8436,
8476,
8481,
8482,
8505,
8530,
8531,
8561,
8586,
8616,
8617,
8640,
8650,
8691,
8718,
8724,
8731,
8732,
8773,
8774,
8818,
8835,
8836,
8891,
8925,
8926,
8941,
8954,
9021,
9048,
9055,
9076,
9083,
9084,
9131,
9159,
9192,
9211,
9212,
9250,
9301,
9334,
9335,
9383,
9439,
9458,
9464,
9465,
9482,
9517,
9525,
9555,
9574,
9582,
9583,
9609,
9610,
9651,
9686,
9687,
9724,
9782,
9803,
9809,
9810,
9834,
9841,
9842,
9870,
9894,
9901,
9902,
9949,
10001,
10002,
10031,
10058,
10073,
10097,
10131,
10152,
10172,
10179,
10180,
10225,
10244,
10250,
10274,
10275,
10304,
10327,
10342,
10366,
10400,
10423,
10441,
10448,
10449,
10494,
10513,
10519,
10543,
10544,
10578,
10579,
10621,
10622,
10660,
10661,
10689,
10690,
10736,
10796,
10803,
10826,
10904,
10905,
10936,
10937,
10971,
10972,
11031,
11053,
11096,
11104,
11113,
11114,
11144,
11176,
11218,
11226,
11302,
11313,
11321,
11326,
11332,
11333,
11385,
11421,
11422,
11470,
11499,
11539,
11544,
11545,
11600,
11601,
11607,
11608,
11631,
11632,
11636,
11637,
11688,
11728,
11729,
11771,
11833,
11870,
11876,
11879,
11880,
11930,
11975,
11976,
12029,
12093,
12143,
12147,
12148,
12160,
12161,
12440,
12441,
12573,
12574,
12587,
12588,
12618,
12619,
12654,
12672,
12673,
12711,
12754,
12755,
12785,
12820,
12833,
12847,
12867,
12883,
12888,
12889,
12928,
12971,
12972,
13004,
13005,
13025,
13026,
13048,
13061,
13077,
13115,
13131,
13148,
13168,
13191,
13210,
13217,
13228,
13241,
13257,
13282,
13298,
13315,
13335,
13358,
13377,
13384,
13395,
13408,
13424,
13461,
13477,
13494,
13513,
13519,
13523,
13524,
13563,
13568,
13569,
13573,
13574,
13876,
13877,
13929,
13930,
13941,
13942,
14164,
14165,
14183,
14184,
14316,
14317,
14327,
14328,
14340,
14341,
14358,
14359,
14424,
14425,
14449,
14450,
14506,
14507,
14525,
14526,
14566,
14590,
14591,
14610,
14611,
14683,
14684,
14704,
14705,
14911,
14912,
14930,
14931,
14946,
14947,
15021,
15022,
15228,
15229,
15253,
15254,
15317,
15395,
15396,
15420,
15421,
15463,
15464,
15482,
15483,
15696,
15697,
15798,
15799,
15818,
15819,
15843,
15844,
16118,
16119,
16528,
16529,
16992,
16993,
17020,
17021,
17345,
17346,
17357,
17358,
17377,
17378,
17515,
17516,
17532,
17533,
18119,
18255,
18256,
18456,
18457,
18477,
18478,
18904,
18905,
18924,
18925,
18994,
19061,
19062,
19122,
19123,
19149,
19150,
19169,
19170,
19237,
19238,
19340,
19341,
19401,
19402,
19488,
19489,
19579,
19580,
19623,
19624,
19649,
19676,
19713,
19746,
19779,
19813,
19851,
19886,
19961,
19962,
19988,
19989,
20183,
20184,
20352,
20353,
20372,
20373,
20385,
20386,
20507,
20508,
20533,
20534,
20554,
20555,
20622,
20647,
20664,
20689,
20696,
20697,
20788,
20789,
20959,
20960,
21003,
21004,
21021,
21022,
21059,
21213,
21214,
21267,
21268,
21311,
21312,
21390,
21465,
21466,
21512,
21513,
21524,
21534,
21535,
21553,
21554,
21589,
21765,
21766,
21779,
21792,
21793,
21810,
21811,
21854,
21855,
21873,
21874,
21906,
21907,
22200,
22201,
22213,
22214,
22226,
22227,
22313,
22388
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 22388,
"ccnet_original_nlines": 666,
"rps_doc_curly_bracket": 0.007816690020263195,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2668329179286957,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022859519347548485,
"rps_doc_frac_lines_end_with_ellipsis": 0.004497750196605921,
"rps_doc_frac_no_alph_words": 0.3337489664554596,
"rps_doc_frac_unique_words": 0.34178104996681213,
"rps_doc_mean_word_length": 5.4790568351745605,
"rps_doc_num_sentences": 347,
"rps_doc_symbol_to_word_ratio": 0.0029093900229781866,
"rps_doc_unigram_entropy": 6.044532775878906,
"rps_doc_word_count": 2841,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03147885948419571,
"rps_doc_frac_chars_dupe_6grams": 0.015032759867608547,
"rps_doc_frac_chars_dupe_7grams": 0.015032759867608547,
"rps_doc_frac_chars_dupe_8grams": 0.005781829822808504,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0038545499555766582,
"rps_doc_frac_chars_top_3gram": 0.005010920111089945,
"rps_doc_frac_chars_top_4gram": 0.003726070048287511,
"rps_doc_books_importance": -1987.649169921875,
"rps_doc_books_importance_length_correction": -1987.649169921875,
"rps_doc_openwebtext_importance": -1241.3399658203125,
"rps_doc_openwebtext_importance_length_correction": -1241.3399658203125,
"rps_doc_wikipedia_importance": -844.0491333007812,
"rps_doc_wikipedia_importance_length_correction": -844.0491333007812
},
"fasttext": {
"dclm": 0.06183654069900513,
"english": 0.7453389763832092,
"fineweb_edu_approx": 1.455115795135498,
"eai_general_math": 0.23647964000701904,
"eai_open_web_math": 0.13430291414260864,
"eai_web_code": 0.34711796045303345
}
}
|
{
"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": "791.4372",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "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
|
5,512,062,601,320,708,000 |
Similarities and Difference Between WordPress and Magento
difference between wordpress and magento
Webmasters eye building slick and chrome websites that do not skimp on features. A wholesome website that addresses every business requirement of theirs and appeals to their target audience in a great measure and effect is always a pre-requisite. And for the same, the business owners happily rely on content management systems. Here we would like to highlight the similarities and difference between WordPress and Magento.
Unarguably, the two content management systems that almost instantly come to mind when it comes to building a fully featured business website are Magento and WordPress. The question arises, should I use Magento or WordPress? Each of these CMS platforms offers several advantages over the other. So, let’s get to the point right away:
How Do Magento and WordPress Compare
difference between wordpress and magento
• The Similarities
Let’s begin the comparison by highlighting few similarities between the two. Both, Magento and WordPress, are open source technologies that can be acquired for free. You can use them to start your own personal blog.
What takes both of these platforms above and beyond the platforms of the same genre is the fact that they are highly customizable and offer you a sea of options when you are looking to integrate new-fangled features with your website. There is no complexity or hassle involved since you have a suite of themes and plugins and extensions to choose from with either CMS.
• The Differences
Magento and WordPress happen to be different in a lot of ways, and that is where the decision to go with either of them can be made. To begin with, not everyone can set up a Magento CMS website. On the contrary, setting up a WordPress website can be a cake. And we are not talking about creating a WP site with the most basic features.
WordPress instead can help even those with minimal technical knowledge in web development to construct a website that boasts of some seriously dynamic features. And it all boils down to choosing the right theme, and following it with the correct set of WP plugins that are only growing in number by the hour.
Magento website on the other hand cannot be accomplished by a non developer since it involves a comparatively more complicated process that only those aware of the nitty-gritty can carry out.
This also leads to cheaper WordPress site development since webmasters don’t have to hire a professional developer to get their website developed. At the same time, customization on Magento also needs a prior knowledge as opposed to customization in WordPress. The complexity spills on to the maintenance of the websites.
Magento websites require constant maintenance as you can’t get complacent. WordPress on the other hand don’t need to be maintained with such an urgency. Updating a WordPress website is a matter of just hitting the update button and the process is accomplished in just a few seconds.
For e-Commerce, Magento Manages to Trump Over WordPress
For all intents and purposes, WordPress is a matchless content management system that can power you to create websites of all genres. Whether you wish to create a website around poetry or movie reviews, or you are eyeing creating a business website that advertises your services, WordPress proves to be the perfect launchpad. WordPress also facilitates developing feature rich eCommerce websites.
However, when you compare it with Magento pertaining to eCommerce website development, WordPress falls well short of the mark set by Magento. For undeniable reasons, Magento is the best platform for hosting and building eCommerce websites.
The Magento architecture has been custom built to handle products and services and when you build your online store using the Magento CMS, you can leverage its unrivaled power and eCommerce-specific functionalities that WordPress doesn’t boast with similar charge.
So, when building an SEO friendly and versatile website with utter simplicity of process is on your agenda, WordPress is the perfect choice. It can let you enjoy rich pleasures of a flurry of features that get better with each update.
But when building an online store that gives you complete control of the proceedings, do not look beyond Magento. While you may need a developer to build your website for you, you anyways can’t rely on a non-teh-savvy approach to building an eCommerce website that is meant to target a huge user base.
Aly Chiman
Aly Chiman is a Blogger & Reporter at AlyChiTech.com which covers a wide variety of topics from local news from digital world fashion and beauty . AlyChiTech covers the top notch content from the around the world covering a wide variety of topics. Aly is currently studying BS Mass Communication at University.
|
{
"url": "https://alychitech.com/difference-between-wordpress-and-magento/",
"source_domain": "alychitech.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "69407",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6CX5TH4PSE6BJICPLNXHACSNM3PUKUPH",
"WARC-Concurrent-To": "<urn:uuid:e0edf590-8821-4fd1-a78c-69d8454c0d3f>",
"WARC-Date": "2024-04-13T00:07:58Z",
"WARC-IP-Address": "172.67.160.147",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LNBGT74XRQRZEB2AZE2IHRNRMLHHQXH2",
"WARC-Record-ID": "<urn:uuid:834fb4ff-e662-4585-9e4a-37bc394abd27>",
"WARC-Target-URI": "https://alychitech.com/difference-between-wordpress-and-magento/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:32742c57-8e2f-49c7-9f6c-23a4de41a7fd>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-180\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,
58,
59,
100,
101,
525,
526,
860,
861,
898,
899,
940,
961,
962,
1178,
1179,
1548,
1549,
1569,
1570,
1906,
1907,
2216,
2217,
2409,
2410,
2732,
2733,
3016,
3017,
3073,
3074,
3471,
3472,
3712,
3713,
3978,
3979,
4214,
4215,
4517,
4518,
4529,
4530
],
"line_end_idx": [
58,
59,
100,
101,
525,
526,
860,
861,
898,
899,
940,
961,
962,
1178,
1179,
1548,
1549,
1569,
1570,
1906,
1907,
2216,
2217,
2409,
2410,
2732,
2733,
3016,
3017,
3073,
3074,
3471,
3472,
3712,
3713,
3978,
3979,
4214,
4215,
4517,
4518,
4529,
4530,
4840
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4840,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4562002420425415,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011376559734344482,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09101250767707825,
"rps_doc_frac_unique_words": 0.43638676404953003,
"rps_doc_mean_word_length": 5.034351348876953,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.172104358673096,
"rps_doc_word_count": 786,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05408136919140816,
"rps_doc_frac_chars_dupe_6grams": 0.025777099654078484,
"rps_doc_frac_chars_dupe_7grams": 0.025777099654078484,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006317920051515102,
"rps_doc_frac_chars_top_3gram": 0.0262825395911932,
"rps_doc_frac_chars_top_4gram": 0.02931514009833336,
"rps_doc_books_importance": -526.017578125,
"rps_doc_books_importance_length_correction": -526.017578125,
"rps_doc_openwebtext_importance": -304.0508117675781,
"rps_doc_openwebtext_importance_length_correction": -304.0508117675781,
"rps_doc_wikipedia_importance": -201.87442016601562,
"rps_doc_wikipedia_importance_length_correction": -201.87442016601562
},
"fasttext": {
"dclm": 0.03940457105636597,
"english": 0.9299354553222656,
"fineweb_edu_approx": 1.5847928524017334,
"eai_general_math": 0.017987970262765884,
"eai_open_web_math": 0.043980419635772705,
"eai_web_code": 0.10608453303575516
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "12",
"label": "Listicle"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,165,158,951,873,203,000 |
How to not duplicate game objects on DontDestroyOnLoad?
So I am making a 2D RPG game. When I load a new scene, I have DontDestroyOnLoad() attached to my player script, this is so that my players (soon to be) stats and equipment will not be removed. However, when I go back to the starting scene, where my player spawned, it duplicates the player every time the scene is laoded.
Any Suggestions? Here is my code. Any help would be nice, thanks.
using UnityEngine;
using System.Collections;
public class Player : Entities {
void Start () {
DontDestroyOnLoad (this);
}
void Update ()
{
if (Input.GetKey (KeyCode.W))
{
GetComponent<Rigidbody2D>().transform.position += Vector3.up * speed * Time.deltaTime;
}
if (Input.GetKey (KeyCode.A))
{
GetComponent<Rigidbody2D>().transform.position += Vector3.left * speed * Time.deltaTime;
}
if (Input.GetKey (KeyCode.S))
{
GetComponent<Rigidbody2D>().transform.position += Vector3.down * speed * Time.deltaTime;
}
if (Input.GetKey (KeyCode.D))
{
GetComponent<Rigidbody2D>().transform.position += Vector3.right * speed * Time.deltaTime;
}
}
}
One way is to have a static instance variable of the class in the class itself and use it to check whether you should destroy it or not. Example:
private static Player playerInstance;
void Awake(){
DontDestroyOnLoad (this);
if (playerInstance == null) {
playerInstance = this;
} else {
DestroyObject(gameObject);
}
}
Another one I can think of is to create another class that holds the stats values and refer to that everytime you load up the level.
public class MusicPlayer : MonoBehaviour
{
private void Awake()
{
int numMusicPlayers = FindObjectsOfType().Length;
if (numMusicPlayers != 1)
{
Destroy(this.gameObject);
}
// if more then one music player is in the scene
//destroy ourselves
else
{
DontDestroyOnLoad(gameObject);
}
}
Use this, this is the simplest way.
private static GameObject instance;
void Start()
{
DontDestroyOnLoad(gameObject);
if (instance == null)
instance = gameObject;
else
Destroy(gameObject);
}
You can use this.gameobject wherever gamebject is written in the code above, as gameobject in the script directly refers to the GameObject that this component is attached to. So to optimize the code, I have used directly gameobject .
Make a GameObject named for example _GM ( Game manager ) and place it in your first scene, but no other.
Make an empty GameObject for your spawn position, or just simply check the Vector3 coordinates where you’d like to spawn.
In the start method of _GM do this:
Void Start()
{
DontDestroyOnLoad(this)
//Position to spawn your player
Vector3 position = GameObject.Find("SpawnPoint").transform.position;
//If your player prefab doesn't exist in the scene, then instantiate it
if (GameObject.Find("Player") == null)
{
GameObject player = Instantiate(player, position, Quaternion.rotation) as GameObject;
}
}
If you switch scenes then you can either:
1.)reinstantiate it at a new position
2.)set the position of your player again, but you have to attach the DontDestroyOnLoad script to it aswell if your going with the 2nd method!
For Instantiating prefabs, check this reference: http://docs.unity3d.com/ScriptReference/Object.Instantiate.html
private static GameObject Instance;
if (Instance == null) {
Instance = gameObject;
DontDestroyOnLoad(gameObject);
}
We have a tutorial on how to make one dontdestroyonload script that you can use as many times as you like without duplication when traveling back and forth between scenes.
Hey @tippsy711
I might be a bit late to help you any further, but I wanted to answer for everyone searching an easy solution to this:
I would recommend using the Singleton pattern.
You would use a baseclass that guarantees there is only one Instance of an Object at a time.
The code for the baseclass is:
using UnityEngine;
/// <summary>
/// Inherit from this base class to create a singleton.
/// e.g. public class MyClassName : Singleton<MyClassName> {}
/// </summary>
public class Singleton<T> : MonoBehaviour where T : MonoBehaviour
{
// Check to see if we're about to be destroyed.
private static bool m_ShuttingDown = false;
private static object m_Lock = new object();
private static T m_Instance;
/// <summary>
/// Access singleton instance through this propriety.
/// </summary>
public static T Instance
{
get
{
if (m_ShuttingDown)
{
Debug.LogWarning("[Singleton] Instance '" + typeof(T) +
"' already destroyed. Returning null.");
return null;
}
lock (m_Lock)
{
if (m_Instance == null)
{
// Search for existing instance.
m_Instance = (T)FindObjectOfType(typeof(T));
// Create new instance if one doesn't already exist.
if (m_Instance == null)
{
// Need to create a new GameObject to attach the singleton to.
var singletonObject = new GameObject();
m_Instance = singletonObject.AddComponent<T>();
singletonObject.name = typeof(T).ToString() + " (Singleton)";
// Make instance persistent.
DontDestroyOnLoad(singletonObject);
}
}
return m_Instance;
}
}
}
private void OnApplicationQuit()
{
m_ShuttingDown = true;
}
private void OnDestroy()
{
m_ShuttingDown = true;
}
}
(Source)
To use it, you inherit the class from Singleton Instead of MonoBehaviour:
[DisallowMultipleComponent]
public class Example : Singleton<Example>
{
//Normal MonoBehavour Code Here
public int someInteger = -1;
}
It automatically is a MonoBehaviour and exactly one Instance is accessible at alltimes - not more and not less.
To access this Instance you refer to the static .Instance variable:
void AccessExampleSingleton()
{
Debug.Log(Example.Instance.someInteger.ToString());
}
That’s all you have to do to have a perfectly smooth running system. I would personally recommend the Singleton-Pattern for all kinds of game managers, resource managers, pooling managers, player objects and so on. Everything that is persistent throughout the game should use this base class to avoid complicated bugs when introducing the object to the scene and removing it again, transporting it between scenes and avoiding multiple Objects. On top, it is good practice and clean code.
|
{
"url": "https://discussions.unity.com/t/how-to-not-duplicate-game-objects-on-dontdestroyonload/140566",
"source_domain": "discussions.unity.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "38831",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LCQHGNUCHZID6TRPOOALUCSTYALCLIRH",
"WARC-Concurrent-To": "<urn:uuid:4ac749ad-61ee-4344-9974-d236184dc23e>",
"WARC-Date": "2023-09-25T09:50:40Z",
"WARC-IP-Address": "184.104.178.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:POG55AFEYUPPPMM5Y3JALCMP57NLNBK4",
"WARC-Record-ID": "<urn:uuid:d7cc8d1a-7d2b-41a9-b9a8-1341ce615ea5>",
"WARC-Target-URI": "https://discussions.unity.com/t/how-to-not-duplicate-game-objects-on-dontdestroyonload/140566",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1598f8ea-86ac-4fe3-92cc-129777d4464b>"
},
"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-18\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,
56,
57,
379,
445,
446,
465,
491,
492,
525,
526,
543,
571,
573,
576,
593,
596,
628,
632,
722,
726,
758,
762,
854,
858,
890,
894,
986,
990,
1022,
1026,
1119,
1123,
1126,
1128,
1129,
1275,
1276,
1314,
1328,
1355,
1358,
1389,
1414,
1424,
1453,
1456,
1458,
1459,
1592,
1593,
1634,
1636,
1657,
1659,
1709,
1735,
1737,
1763,
1765,
1814,
1834,
1839,
1841,
1872,
1873,
1879,
1883,
1885,
1886,
1922,
1923,
1959,
1960,
1974,
1976,
2011,
2012,
2038,
2069,
2078,
2107,
2109,
2110,
2344,
2345,
2450,
2572,
2573,
2609,
2610,
2623,
2628,
2656,
2692,
2765,
2841,
2884,
2894,
2992,
3002,
3004,
3005,
3047,
3048,
3086,
3087,
3229,
3230,
3343,
3344,
3380,
3381,
3409,
3448,
3495,
3501,
3502,
3674,
3675,
3690,
3691,
3810,
3811,
3858,
3859,
3952,
3953,
3954,
3985,
3986,
4005,
4007,
4021,
4077,
4139,
4154,
4220,
4222,
4274,
4322,
4371,
4404,
4406,
4424,
4482,
4501,
4530,
4536,
4548,
4558,
4590,
4604,
4676,
4737,
4766,
4780,
4782,
4808,
4822,
4862,
4880,
4933,
4998,
5000,
5073,
5117,
5139,
5226,
5290,
5362,
5448,
5450,
5503,
5563,
5585,
5603,
5605,
5640,
5654,
5664,
5670,
5672,
5674,
5711,
5717,
5748,
5754,
5756,
5758,
5787,
5793,
5824,
5830,
5832,
5833,
5842,
5843,
5917,
5918,
5946,
5988,
5990,
6026,
6058,
6060,
6061,
6173,
6174,
6242,
6243,
6273,
6275,
6331,
6333,
6334
],
"line_end_idx": [
56,
57,
379,
445,
446,
465,
491,
492,
525,
526,
543,
571,
573,
576,
593,
596,
628,
632,
722,
726,
758,
762,
854,
858,
890,
894,
986,
990,
1022,
1026,
1119,
1123,
1126,
1128,
1129,
1275,
1276,
1314,
1328,
1355,
1358,
1389,
1414,
1424,
1453,
1456,
1458,
1459,
1592,
1593,
1634,
1636,
1657,
1659,
1709,
1735,
1737,
1763,
1765,
1814,
1834,
1839,
1841,
1872,
1873,
1879,
1883,
1885,
1886,
1922,
1923,
1959,
1960,
1974,
1976,
2011,
2012,
2038,
2069,
2078,
2107,
2109,
2110,
2344,
2345,
2450,
2572,
2573,
2609,
2610,
2623,
2628,
2656,
2692,
2765,
2841,
2884,
2894,
2992,
3002,
3004,
3005,
3047,
3048,
3086,
3087,
3229,
3230,
3343,
3344,
3380,
3381,
3409,
3448,
3495,
3501,
3502,
3674,
3675,
3690,
3691,
3810,
3811,
3858,
3859,
3952,
3953,
3954,
3985,
3986,
4005,
4007,
4021,
4077,
4139,
4154,
4220,
4222,
4274,
4322,
4371,
4404,
4406,
4424,
4482,
4501,
4530,
4536,
4548,
4558,
4590,
4604,
4676,
4737,
4766,
4780,
4782,
4808,
4822,
4862,
4880,
4933,
4998,
5000,
5073,
5117,
5139,
5226,
5290,
5362,
5448,
5450,
5503,
5563,
5585,
5603,
5605,
5640,
5654,
5664,
5670,
5672,
5674,
5711,
5717,
5748,
5754,
5756,
5758,
5787,
5793,
5824,
5830,
5832,
5833,
5842,
5843,
5917,
5918,
5946,
5988,
5990,
6026,
6058,
6060,
6061,
6173,
6174,
6242,
6243,
6273,
6275,
6331,
6333,
6334,
6821
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6821,
"ccnet_original_nlines": 215,
"rps_doc_curly_bracket": 0.00864975992590189,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27863526344299316,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021933389827609062,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3103168308734894,
"rps_doc_frac_unique_words": 0.38181817531585693,
"rps_doc_mean_word_length": 6.002597332000732,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.1567254066467285,
"rps_doc_word_count": 770,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01384682022035122,
"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.006490699946880341,
"rps_doc_frac_chars_top_3gram": 0.01298138964921236,
"rps_doc_frac_chars_top_4gram": 0.02012116089463234,
"rps_doc_books_importance": -657.2910766601562,
"rps_doc_books_importance_length_correction": -657.2910766601562,
"rps_doc_openwebtext_importance": -329.0447082519531,
"rps_doc_openwebtext_importance_length_correction": -329.0447082519531,
"rps_doc_wikipedia_importance": -293.017333984375,
"rps_doc_wikipedia_importance_length_correction": -293.017333984375
},
"fasttext": {
"dclm": 0.9197264909744263,
"english": 0.7317097187042236,
"fineweb_edu_approx": 2.0111618041992188,
"eai_general_math": 0.8085565567016602,
"eai_open_web_math": 0.0850837230682373,
"eai_web_code": 0.9880005717277527
}
}
|
{
"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": "-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
|
-984,237,682,711,700,600 |
Windows 10 full disk error 100%?
In summary, the conversation revolves around a problem with 100% full disk error on Windows 10. The participants suggest checking if the disk is actually full and if it is partitioned with one partition being full. They also provide links to possible solutions and suggest emptying the trash bin or using CCleaner. It is unclear whether the error is related to disk usage or bandwidth. There is also mention of a temporary solution that needs to be applied repeatedly.
• #1
HaNguyen
1
0
I'm using Windows 10 sometimes it is 100% full disk error, does anyone know how to fix it?
Computer science news on Phys.org
• #2
Just to get the obvious question out of the way: Did you check if the disk is full?
Is the disk partitioned and one partition is full?
• Like
Likes russ_watters
• #4
Did you find the perfect fix for it? I can fix this issue for a short span of time but after few days it starts showing again. Not a permanent solution.
• #5
Have you ever emptied the trash bin?
• Like
Likes russ_watters
• #7
Is it telling you the disc is 100% full or that it's using 100% of its bandwidth?
• #8
1. What is a "full disk error 100%" in Windows 10?
A "full disk error 100%" in Windows 10 refers to a situation where the computer's hard drive is almost or completely full, causing performance issues and potential data loss. This error can occur due to a variety of reasons, such as large file sizes, a large number of files, or a malfunctioning disk.
2. How can I check if my Windows 10 disk is full?
To check if your Windows 10 disk is full, you can open the File Explorer and right-click on the disk you want to check. Then, select "Properties" and you will see a pie chart representation of the disk's usage. If the chart shows that the disk is almost or completely full, then you may have a "full disk error 100%".
3. How can I fix a "full disk error 100%" in Windows 10?
To fix a "full disk error 100%" in Windows 10, you can try deleting unnecessary files and programs, running disk cleanup, or moving large files to an external drive. You can also try using third-party disk management tools to optimize your disk's usage and free up space.
4. Can a "full disk error 100%" cause data loss?
Yes, a "full disk error 100%" can potentially cause data loss if the disk is completely full and the computer is unable to write new data. This can result in corrupted files or even a complete loss of data. It is important to regularly check and manage your disk's usage to prevent this error and potential data loss.
5. How can I prevent a "full disk error 100%" in Windows 10?
To prevent a "full disk error 100%" in Windows 10, you can regularly delete unnecessary files and programs, run disk cleanup, and use disk management tools to optimize your disk's usage. It is also important to regularly back up your important files in case of data loss due to this error.
Similar threads
Replies
9
Views
2K
• Computing and Technology
Replies
30
Views
2K
Replies
2
Views
1K
• Computing and Technology
Replies
12
Views
481
• Computing and Technology
Replies
3
Views
2K
• Computing and Technology
Replies
3
Views
1K
• Computing and Technology
Replies
24
Views
2K
• Computing and Technology
Replies
10
Views
1K
Replies
1
Views
1K
• Computing and Technology
Replies
14
Views
2K
Back
Top
|
{
"url": "https://www.physicsforums.com/threads/windows-10-full-disk-error-100.951098/",
"source_domain": "www.physicsforums.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "85507",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RVWN2IDLD37UNF2K6F66EDFI5FCJNJW7",
"WARC-Concurrent-To": "<urn:uuid:c807c735-9fda-4fc7-8a96-3ddab1b24dbf>",
"WARC-Date": "2024-04-19T02:31:07Z",
"WARC-IP-Address": "104.26.15.132",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5RN4VCPEHVLGTHMACYWGURSFJJGS6XCV",
"WARC-Record-ID": "<urn:uuid:652608a7-560e-4be5-8b8b-1aac926915f5>",
"WARC-Target-URI": "https://www.physicsforums.com/threads/windows-10-full-disk-error-100.951098/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:49114494-149a-41c4-bc4d-e488306d6c80>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-122\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
33,
34,
503,
510,
519,
521,
523,
614,
616,
650,
657,
741,
792,
794,
803,
822,
829,
982,
984,
991,
1028,
1030,
1039,
1058,
1065,
1147,
1149,
1156,
1157,
1208,
1209,
1511,
1512,
1562,
1563,
1881,
1882,
1939,
1940,
2212,
2213,
2262,
2263,
2581,
2582,
2643,
2644,
2934,
2935,
2951,
2952,
2960,
2962,
2968,
2971,
3000,
3008,
3011,
3017,
3020,
3028,
3030,
3036,
3039,
3068,
3076,
3079,
3085,
3089,
3118,
3126,
3128,
3134,
3137,
3166,
3174,
3176,
3182,
3185,
3214,
3222,
3225,
3231,
3234,
3263,
3271,
3274,
3280,
3283,
3291,
3293,
3299,
3302,
3331,
3339,
3342,
3348,
3351,
3356
],
"line_end_idx": [
33,
34,
503,
510,
519,
521,
523,
614,
616,
650,
657,
741,
792,
794,
803,
822,
829,
982,
984,
991,
1028,
1030,
1039,
1058,
1065,
1147,
1149,
1156,
1157,
1208,
1209,
1511,
1512,
1562,
1563,
1881,
1882,
1939,
1940,
2212,
2213,
2262,
2263,
2581,
2582,
2643,
2644,
2934,
2935,
2951,
2952,
2960,
2962,
2968,
2971,
3000,
3008,
3011,
3017,
3020,
3028,
3030,
3036,
3039,
3068,
3076,
3079,
3085,
3089,
3118,
3126,
3128,
3134,
3137,
3166,
3174,
3176,
3182,
3185,
3214,
3222,
3225,
3231,
3234,
3263,
3271,
3274,
3280,
3283,
3291,
3293,
3299,
3302,
3331,
3339,
3342,
3348,
3351,
3356,
3359
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3359,
"ccnet_original_nlines": 99,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3216783106327057,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02097902074456215,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2181818187236786,
"rps_doc_frac_unique_words": 0.33931484818458557,
"rps_doc_mean_word_length": 4.223491191864014,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0.008391610346734524,
"rps_doc_unigram_entropy": 4.7163519859313965,
"rps_doc_word_count": 613,
"rps_doc_frac_chars_dupe_10grams": 0.026264969259500504,
"rps_doc_frac_chars_dupe_5grams": 0.2869834005832672,
"rps_doc_frac_chars_dupe_6grams": 0.21011973917484283,
"rps_doc_frac_chars_dupe_7grams": 0.21011973917484283,
"rps_doc_frac_chars_dupe_8grams": 0.1120123565196991,
"rps_doc_frac_chars_dupe_9grams": 0.05716492980718613,
"rps_doc_frac_chars_top_2gram": 0.03707994893193245,
"rps_doc_frac_chars_top_3gram": 0.06025492027401924,
"rps_doc_frac_chars_top_4gram": 0.061799921095371246,
"rps_doc_books_importance": -278.5848693847656,
"rps_doc_books_importance_length_correction": -278.5848693847656,
"rps_doc_openwebtext_importance": -136.0260772705078,
"rps_doc_openwebtext_importance_length_correction": -136.0260772705078,
"rps_doc_wikipedia_importance": -96.75869750976562,
"rps_doc_wikipedia_importance_length_correction": -96.75869750976562
},
"fasttext": {
"dclm": 0.08673667907714844,
"english": 0.8963063955307007,
"fineweb_edu_approx": 2.39741849899292,
"eai_general_math": 0.31235724687576294,
"eai_open_web_math": 0.3694220185279846,
"eai_web_code": 0.0031010499224066734
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,486,170,967,014,945,300 |
topbanner_forum
*
avatar image
Welcome, Guest. Please login or register.
Did you miss your activation email?
Login with username, password and session length
• Sunday September 25, 2022, 6:06 pm
• Proudly celebrating 15+ years online.
• Donate now to become a lifetime supporting member of the site and get a non-expiring license key for all of our programs.
• donate
Show Posts
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Messages - allen [ switch to compact view ]
Pages: prev1 ... 39 40 41 42 43 [44] 45 46next
1076
Back when I first started using dirms/buzzsaw, I was certain my computer ran better -- especially in long stretches. I haven't not used it in so long, though, I don't actually have any perception of what the benchmark change might be. Computers are so much better these days, the difference might be negligible . . . but I feel better knowing (or at least assuming) my computer is constantly being defragged as I work.
(You should see the queue of files to work through after I import/export a big mail base . . .)
1077
Living Room / Re: Is this offesive?
« on: February 05, 2006, 11:51 AM »
They get away with it because they aren't doing anything wrong, necessarily. With the exception of adult only content, there aren't laws requiring ratings on websites in the same manner as, say, movies and TV -- and while this is suggestive, it doesn't quite hit the AO mark. Further, I haven't seen the picture in context of the full flash and website it's on, but in the original post, rover said
My concern is that it is inside a free flash games that to me is aimed at kids.
-- 'to me is aimed at kids' -- which makes me think it seems like a childrens game because of its simplicity and cute rodents, but is perhaps not explicitly aimed at kids.
I'd wager it's just a blacksheep.com ha ha shock value deal, maybe designed to seem like it's for kids while being adult themed (ala peewee herman's playhouse ;).
1078
General Software Discussion / Re: extremely good gif editor required
« on: February 05, 2006, 11:39 AM »
Xara Xtreme is awesome, total control over palettes and such -- though I prefer my exports as PNG's ;)
Worth looking at is Graphics Gale, as well -- It's geared toward pixel by pixel art for video game devs who need to zoom in on the grid -- I'd imagine pixel art people would need total palette control, so that might be worth looking at.
http://www.humanbalance.net/gale/us/.
In the free version you can't save/open gifs . . . however you can copy/paste them in/out ;)
1079
I've always been a fan of BuzzSaw -- it runs as a process, degragmenting as you go -- essentially keeping a hard drive defragged -- assuming you run it on a hard drive defragged to begin with ;)
1080
I figured as much . . . great to hear it ;)
1081
Now he just needs festive outfits for holidays ala google. It'd be cool to have seasonal logos.
1082
Living Room / Re: Is this offesive?
« on: February 04, 2006, 08:31 PM »
It's in image I'd want in kids game . . . I just wouldn't let my kid play it. :D
1083
to clarify what i was saying from before, i was saying we cant insist that the filename comes first,
because sometimes there is no filename, for example when you want to send an email.
Essentially, wouldn't the email address or contact name be the "file" -- Without additional parameters, it's not an action, just a launch. ;)
1084
Living Room / Re: Just for fun: What is this ?
« on: February 04, 2006, 04:27 PM »
?
1085
Developer's Corner / Nested Matches
« on: February 04, 2006, 03:37 PM »
For my web-based php regex find/replace do-hickey, I need to match individual back references and wrap a tag around them so they'll be unique to the rest of the match for individual color markup. Initially this would seem easy enough, however not all of a potential regex match is going to be within a back reference. So it's necessary to replace the back reference, and only the back reference, while preserving the context of the match. For example, if I were to search the text
fish this fish fish
looking for
.*?(?<=this )(fish).*
I'd match everything, capturing the second instance of fish into the back reference. I can't simply take the match and run a replace for fish in order to apply the highlighting, because then i'd end up with 3 highlighted "fish", 2 of which weren't supposed to be. I also couldn't simply return the back reference with the markup, as that wouldn't return the non-back referenced stuff.
My initial solution was to run the original find text over the match to get the back references, using an extra flag to have it return the offset of each back reference. So now I have the location of the text within the string, and can get the length of it from that point from the string itself. Going backwards so as not to mess with the numeric location with in the string, it captures back references without losing context or data. Perfect.
. . . until back references are nested. In this example:
(.*?(?<=this )(fish).*)
back reference 1 would be fish this fish fish, back reference 2 would be fish -- here's where the problem surfaces.
If I wrap back reference 2 in the markup, when I apply back reference 1's markup it's going to apply the end tag in the wrong place since the string has increased and the original length calculated no longer applies. If I replace back reference 1 first, same problem. I'm sure there's some obvious, simple solution I'm overlooking having exhausted a bunch of complex attempts to compensate for it. Any fresh perspectives on the best way to markup nested groups while preserving the integrity of the return?
1086
Living Room / Re: Just for fun: What is this ?
« on: February 04, 2006, 03:19 PM »
There's a new farm of these a few miles from where I grew up.
1087
Best E-mail Client / Re: The Bat! (Some constructive criticism)
« on: February 04, 2006, 07:10 AM »
Yeah, I'm a bit rusty ;) but you should include the -- yourself if you're using quick templates to switch the signature -- that's what tells it where to delete the text before inserting the new one.
I have the sig delimiter in my main template, beneath that the qinclude -- so swapping among quicktempaltes -should- replace everything beneath the delimiter with the quick template text.
I think.
:-)
1088
As for keeping it newb friendly -- the keystrokes and stuff aren't likely going to be used by anyone but power users
Here, i don't agree with you. I think we should try to fins a solution that is both suitable to power-users as much as intuitive, so as someone new to farr can see it's power immediatelly.
I don't disagree with you on this point -- I absolutely agree that it should be intuitive regardless of experience level. All I'm saying is no matter how much brainstorming you do to have optimized keyboard shortcuts, keyboard shortcuts are not par for the course for less experienced computer users. My point was that there should be an alternate method or methods of accessing all this functionality without expecting a point-click user to use the keyboard.
As it is often descibred, most people when trying to use a software, only evalute it in the first use, which means that these kind of functions should be as easy as possible, but also providing as much flexibility as possible.
Right, which is precisely my point. There needs to be a quick, easy way to access the features from the start -- if a user has to spend the beginning of their trial of the software learning a bunch of proprietary keystrokes, they're going to throw in the towel. Give them things to click on, and display the shortcuts next to the menu items or in tooltips and they'll have their GUI interface and the shortcuts will be right there for them to learn when they're ready. It's not difficult to hit "enter" after typing a website, but users want a "go" button, you know?
1089
part of the challenge is figuring out a solution that doesnt require opening the help file and searching for a day looking for the magic keystroke to do things..
One thing to consider is something I've seen in several applications in recent years -- a section of the help file devoted exclusively to listing keyboard accellerators and link directly to it in the help menu.
As for keeping it newb friendly -- the keystrokes and stuff aren't likely going to be used by anyone but power users, so it seems the trick there is to have all those available shortcuts available as items in a right click contect menu as well as, perhaps, a drop down button in the toolbar. An "actions" button, so to speak.
1090
Best E-mail Client / Re: The Bat! (Some constructive criticism)
« on: February 03, 2006, 05:15 AM »
I'm a pack rat -- losing my e-mail archive was far more traumatic than the loss of the computer itself, or the DVD's, or anything else for that matter . . . it was a growing experience, I had to learn to let go :-)
-- it took most of the night to download all my gmail messages into The Bat!. As it would turn out, I had almost 50,000 -- I have a nice, full mailbase on TB now :)
1091
Gmail does have an RSS feed--as long as the screensaver supports SSL/authenticated feeds. There's a good chance the reader, in most cases, is using MSIE's rendering engine and xslt to grab/show the data -- so as long as you're logged into gmail in IE, the reader should be able to grab the gmail feed.
1092
RSSmore has its shortcomings, it's young -- but it does a decent job with most feeds. It's donation-ware, too ;)
1093
Find And Run Robot / Re: A unified FARR / Launcher Interface Proposal
« on: February 01, 2006, 10:56 PM »
As long as the overhead doesn't increase by much, and I don't think it would knowing mouser, I don't think those of us who wouldn't use the launcher would object to the functionality being there so long as it could be removed.
As for FRR being an almost launcher, I think it's more than that -- at least for keyboardcentric users, it's a ver powerful, fully capable launcher. Between its search setup and the configurable groups, launcher gives immediate access everything I need to get to with minimal interaction -- couple of keystrokes, and I'm where I want to be. This isn't to say I don't understand FRR's obvious weaknesses to those who prefer to use the mouse to interface with their computer -- it takes no stretch of the imagination to see where FRR falls short in that regard.
Personally, I'd rather see unified than separate and I don't even have any immediate plans to use the launcher. As mouser stated, it would be advantageous in terms of the ability to maintain groups as well as frequent/recent access lists between the two interfaces -- as well as other shared configurations. On a day when I'm sitting back and actually using my mouse, if I toggle on the launcher module, all the stuff I'm used to accessing in FRR is right there and vice versa.
There's also the matter of having one application to maintain/support versus having two -- while having one that is merged would be more effort to maintain than either of the two as individuals, I can't imagine it would be easier to maintain them both than to maintain one app.
Plus, having one fully featured application ideally suited to both ends of the mouse v. keyboard debate is surely more likely to grab the attention of the WWW -- offering a loaded hybrid program is surely more valuable than offering two great but limited programs.
1094
Way, way late in replying to this thread--I blame it on being way-way late in showing up here altogether -- but I was immediately impressed to see it as a praised application here with a significant discount offered. Having first discovered TB when it was in version 1.2x or 1.3x something and having used it as my primary e-mail client for most of the years between then and now, it has a special place in my heart.
I was amused to read in the review about the complaints of seemingly trivial version increases -- having been there at the time of it. Version 1 supported free updates for several years, with most of the active users fearing version 2 was a pipe dream. When version 2 was released, even though only a minor upgrade from the current 1.x version with most of the new features promises rather than implemented, I had no problem paying--simply because I'd used it for so long without having to pay further. Version 3, on the other hand, came quickly and with a similar level of upgrade--trivial with promised features.
The developers are certainly not renowned for their internal organization and if they're known for their documentation, it's because it's absolutely terrible -- but there's no question about it, they deliver the most powerful e-mail client on the market. It's a lot easier to get your feet wet with Thunderbird, but even with dozens of extensions installed--neither it nor any other client can compare to the featureset of TB.
Anyway, it's nice stumbling into a public venue where she's getting some love.
1095
Best E-mail Client / Re: TheBat Toolbars
« on: February 01, 2006, 10:30 PM »
Toolbars? I avoid such problems by not using them ;)
1096
Best E-mail Client / Re: The Bat! (Some constructive criticism)
« on: February 01, 2006, 10:28 PM »
For the record, I've set my gmail account to make all messages available for download and am in the process of downloading15000 + messages, dating back to 2002. In '01, a roommate pawned my computer and ran, so I lost everything from '98 - '01, but I'd imported everything after that into gmail when I started using it -- so at least I'll have a few years searchable archive. Have a few templates configured and am slowly moving back in. I learned from this thread I haven't forgotten as much about using TB as I'd thought, which makes the move a bit less daunting ;)
1097
2) ill look into that - do i understand that you're basically pointing out a user interface annoyance/baddesign or is there something deeper i'm missing?
There's nothing deeper, it's just initially a bit confusing when you go to toggle a box that -appears- active, and nothing happens. Took me a second to figure out why those checkboxes looked more lively than they really were ;P It has absolutely no impact on actual performance of the various cleanup functions that I've used.
1098
CHSGreat stuff, mouser -- I especially love the ability to send it back to the application from whence it came without reaching for my mouse. That change alone makes CHS exponentially more useful to me. Of course, I have to nitpick still -- would it be possible to have an option to have it close after sending the text back?
After using this a while, my favorite feature is the ability to apply cleanup presets on the fly via the quick paste menu -- Saving me oodles of time there, I don't believe anyone else offers that do they?
Few things quickly.
1. If nothing is selected, would it be possible to automatically select all before copying? Would be handy in textareas as well as text editors where the intent is, in fact, to grab the whole thing. Save a keystroke or two.
2. In the text cleanup, when boxes are unchecked most of the child stuff is grayed out -- however now all children are grayed out. Actually, the only check boxes grayed out when the parent is disabled is "Trim Excess White Space" and "Add to Empties" -- the rest, while unclickable, remain bright white requiring more scrutiny to figure out what is/isn't actually enabled at the time.
3. If CHS is open, activating Capture/View/Spell does not bring focus to CHS, though the text is captured properly. So if you use it, then send it back to the application, then go to use it again -- you'll have to give focus to the CHS window manually.
1099
Regarding the UI / features, blatant imitation is par for the course, Microsoft are pretty good at it. However, claiming Firefox as precedent is quite funny — it was originally designed to imitate IE ;)
Indeed! -- Irony. Firefox looked not unlike IE, now IE looks not unlike Firefox . . . perhaps that means IE looks more like IE? ;)
1100
Best E-mail Client / Re: The Bat! (Some constructive criticism)
« on: February 01, 2006, 04:59 PM »
I don't necessarily know all the advantages to the microed as far as efficiency and such things are concerned but when I started using TB it was -the- editor and I've used it since. It's quick and responsive, that's always nice -- and I love how it reflows text -- I've always had it set with "persistent" selections, automatically reflowing with full justify.
The truth is, though I'm rather comfortable with these settings, they're not of the importance they once were. When Microed was in its prime, it was common for mail clients to have trouble with long lines--sometimes reading, but at the very least with replies having ugly broken lines. Microed rose to the occasion, elegantly wrapping incoming and outgoing mail and was/is fully capable of seamlessly reflowing quoted/forwarded text. Things are handled more elgantly by other mail editors now than they once were, making MicroEd less important, I suppose--but I still have yet to find an editor that handles plain text mail more elegantly.
I've often wished they'd release Microed as a standalone text editor/notepad. No luck there, but The Bat! does now have "Smart Bat" -- a built in notepad/calendar -- jot down notes with it and it can be used to have e-mail messages automatically sent out at certain times/dates. Once upon a time, scheduler saved me face when I'd forget birthdays, it'd still mail them. They'd think I remembered ;)
Pages: prev1 ... 39 40 41 42 43 [44] 45 46next
|
{
"url": "https://www.donationcoder.com/forum/index.php?action=profile;u=18249;area=showposts;start=1075",
"source_domain": "www.donationcoder.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "77404",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JVNUSU4X2XDQB4UXMLADG2MQMHA274FT",
"WARC-Concurrent-To": "<urn:uuid:c0aaa02c-8444-4389-ac0e-ea92ed9046d5>",
"WARC-Date": "2022-09-25T23:06:56Z",
"WARC-IP-Address": "104.21.47.232",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:C3V2HUUW5FJJNCTBIVDPCDY22TOII7VM",
"WARC-Record-ID": "<urn:uuid:b72df49a-f55d-42d1-a4d1-ecd59ab4e7c1>",
"WARC-Target-URI": "https://www.donationcoder.com/forum/index.php?action=profile;u=18249;area=showposts;start=1075",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:34b9c615-24d6-4f85-b925-b8aea7ddefed>"
},
"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-96\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
20,
21,
34,
35,
77,
113,
114,
163,
202,
244,
370,
381,
382,
393,
394,
534,
535,
536,
580,
581,
628,
633,
1054,
1055,
1151,
1152,
1157,
1193,
1229,
1631,
1711,
1712,
1885,
1886,
2049,
2050,
2055,
2124,
2160,
2263,
2264,
2503,
2541,
2542,
2635,
2636,
2641,
2837,
2838,
2843,
2887,
2888,
2893,
2989,
2990,
2995,
3031,
3067,
3148,
3149,
3154,
3255,
3339,
3481,
3482,
3487,
3534,
3570,
3572,
3573,
3578,
3614,
3650,
4134,
4135,
4155,
4156,
4168,
4169,
4191,
4192,
4580,
4581,
5030,
5031,
5089,
5113,
5229,
5230,
5740,
5741,
5746,
5793,
5829,
5891,
5892,
5897,
5961,
5997,
6196,
6197,
6385,
6386,
6395,
6396,
6400,
6401,
6406,
6523,
6712,
6713,
7175,
7176,
7403,
7404,
7974,
7975,
7980,
8142,
8143,
8354,
8355,
8682,
8683,
8688,
8752,
8788,
9003,
9004,
9170,
9171,
9176,
9479,
9480,
9485,
9599,
9600,
9605,
9675,
9711,
9938,
9939,
10501,
10502,
10982,
10983,
11261,
11262,
11527,
11528,
11533,
11951,
11952,
12570,
12571,
12999,
13000,
13079,
13080,
13085,
13126,
13162,
13215,
13216,
13221,
13285,
13321,
13892,
13893,
13898,
14053,
14054,
14382,
14383,
14388,
14717,
14718,
14924,
14925,
14945,
15170,
15171,
15557,
15558,
15812,
15813,
15818,
16021,
16022,
16154,
16155,
16160,
16224,
16260,
16622,
16623,
17266,
17267,
17669,
17670
],
"line_end_idx": [
16,
20,
21,
34,
35,
77,
113,
114,
163,
202,
244,
370,
381,
382,
393,
394,
534,
535,
536,
580,
581,
628,
633,
1054,
1055,
1151,
1152,
1157,
1193,
1229,
1631,
1711,
1712,
1885,
1886,
2049,
2050,
2055,
2124,
2160,
2263,
2264,
2503,
2541,
2542,
2635,
2636,
2641,
2837,
2838,
2843,
2887,
2888,
2893,
2989,
2990,
2995,
3031,
3067,
3148,
3149,
3154,
3255,
3339,
3481,
3482,
3487,
3534,
3570,
3572,
3573,
3578,
3614,
3650,
4134,
4135,
4155,
4156,
4168,
4169,
4191,
4192,
4580,
4581,
5030,
5031,
5089,
5113,
5229,
5230,
5740,
5741,
5746,
5793,
5829,
5891,
5892,
5897,
5961,
5997,
6196,
6197,
6385,
6386,
6395,
6396,
6400,
6401,
6406,
6523,
6712,
6713,
7175,
7176,
7403,
7404,
7974,
7975,
7980,
8142,
8143,
8354,
8355,
8682,
8683,
8688,
8752,
8788,
9003,
9004,
9170,
9171,
9176,
9479,
9480,
9485,
9599,
9600,
9605,
9675,
9711,
9938,
9939,
10501,
10502,
10982,
10983,
11261,
11262,
11527,
11528,
11533,
11951,
11952,
12570,
12571,
12999,
13000,
13079,
13080,
13085,
13126,
13162,
13215,
13216,
13221,
13285,
13321,
13892,
13893,
13898,
14053,
14054,
14382,
14383,
14388,
14717,
14718,
14924,
14925,
14945,
15170,
15171,
15557,
15558,
15812,
15813,
15818,
16021,
16022,
16154,
16155,
16160,
16224,
16260,
16622,
16623,
17266,
17267,
17669,
17670,
17716
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17716,
"ccnet_original_nlines": 201,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4254770576953888,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0337802991271019,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20448684692382812,
"rps_doc_frac_unique_words": 0.3383508026599884,
"rps_doc_mean_word_length": 4.469568252563477,
"rps_doc_num_sentences": 144,
"rps_doc_symbol_to_word_ratio": 0.0005157300038263202,
"rps_doc_unigram_entropy": 6.047524929046631,
"rps_doc_word_count": 3056,
"rps_doc_frac_chars_dupe_10grams": 0.0431949608027935,
"rps_doc_frac_chars_dupe_5grams": 0.0639871135354042,
"rps_doc_frac_chars_dupe_6grams": 0.05490884929895401,
"rps_doc_frac_chars_dupe_7grams": 0.04861263930797577,
"rps_doc_frac_chars_dupe_8grams": 0.04861263930797577,
"rps_doc_frac_chars_dupe_9grams": 0.04861263930797577,
"rps_doc_frac_chars_top_2gram": 0.008053299970924854,
"rps_doc_frac_chars_top_3gram": 0.009663959965109825,
"rps_doc_frac_chars_top_4gram": 0.004758770111948252,
"rps_doc_books_importance": -1740.681640625,
"rps_doc_books_importance_length_correction": -1740.681640625,
"rps_doc_openwebtext_importance": -1152.79833984375,
"rps_doc_openwebtext_importance_length_correction": -1152.79833984375,
"rps_doc_wikipedia_importance": -1088.703857421875,
"rps_doc_wikipedia_importance_length_correction": -1088.703857421875
},
"fasttext": {
"dclm": 0.060817718505859375,
"english": 0.946774423122406,
"fineweb_edu_approx": 1.0663199424743652,
"eai_general_math": 0.4316806197166443,
"eai_open_web_math": 0.27077972888946533,
"eai_web_code": 0.12160425633192062
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.656",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"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
|
3,968,709,962,858,253,000 |
summaryrefslogtreecommitdiff
path: root/sw/source/filter/ww8/docxattributeoutput.cxx
blob: 45abbf61e6cabd1e92e314d1a7a9bd53b3f1f744 (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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
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
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
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
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
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
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
/* -*- 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 "docxattributeoutput.hxx"
#include "docxexportfilter.hxx"
#include "docxfootnotes.hxx"
#include "writerwordglue.hxx"
#include "ww8par.hxx"
#include "fmtcntnt.hxx"
#include "fchrfmt.hxx"
#include "tgrditem.hxx"
#include "fmtruby.hxx"
#include "breakit.hxx"
#include <comphelper/string.hxx>
#include <oox/token/tokens.hxx>
#include <oox/export/utils.hxx>
#include <oox/mathml/export.hxx>
#include <i18npool/mslangid.hxx>
#include <editeng/fontitem.hxx>
#include <editeng/tstpitem.hxx>
#include <editeng/spltitem.hxx>
#include <editeng/widwitem.hxx>
#include <editeng/shaditem.hxx>
#include <editeng/brshitem.hxx>
#include <editeng/postitem.hxx>
#include <editeng/wghtitem.hxx>
#include <editeng/kernitem.hxx>
#include <editeng/crsditem.hxx>
#include <editeng/cmapitem.hxx>
#include <editeng/udlnitem.hxx>
#include <editeng/langitem.hxx>
#include <editeng/escpitem.hxx>
#include <editeng/fhgtitem.hxx>
#include <editeng/colritem.hxx>
#include <editeng/hyznitem.hxx>
#include <editeng/ulspitem.hxx>
#include <editeng/boxitem.hxx>
#include <editeng/cntritem.hxx>
#include <editeng/shdditem.hxx>
#include <editeng/emphitem.hxx>
#include <editeng/twolinesitem.hxx>
#include <editeng/charscaleitem.hxx>
#include <editeng/charrotateitem.hxx>
#include <editeng/charreliefitem.hxx>
#include <editeng/paravertalignitem.hxx>
#include <editeng/pgrditem.hxx>
#include <editeng/frmdiritem.hxx>
#include <editeng/blnkitem.hxx>
#include <editeng/charhiddenitem.hxx>
#include <editeng/opaqitem.hxx>
#include <editeng/editobj.hxx>
#include <svx/svdmodel.hxx>
#include <svx/svdobj.hxx>
#include <sfx2/sfxbasemodel.hxx>
#include <anchoredobject.hxx>
#include <docufld.hxx>
#include <flddropdown.hxx>
#include <fmtanchr.hxx>
#include <fmtclds.hxx>
#include <fmtinfmt.hxx>
#include <fmtrowsplt.hxx>
#include <fmtline.hxx>
#include <frmatr.hxx>
#include <ftninfo.hxx>
#include <htmltbl.hxx>
#include <lineinfo.hxx>
#include <ndgrf.hxx>
#include <ndole.hxx>
#include <ndtxt.hxx>
#include <pagedesc.hxx>
#include <paratr.hxx>
#include <swmodule.hxx>
#include <swtable.hxx>
#include <txtftn.hxx>
#include <txtinet.hxx>
#include <osl/file.hxx>
#include <vcl/temporaryfonts.hxx>
#include <com/sun/star/i18n/ScriptType.hpp>
#include <com/sun/star/chart2/XChartDocument.hpp>
#if OSL_DEBUG_LEVEL > 1
#include <stdio.h>
#endif
using ::editeng::SvxBorderLine;
using namespace oox;
using namespace docx;
using namespace sax_fastparser;
using namespace nsSwDocInfoSubType;
using namespace nsFieldFlags;
using namespace sw::util;
using namespace ::com::sun::star;
class FFDataWriterHelper
{
::sax_fastparser::FSHelperPtr m_pSerializer;
void writeCommonStart( const rtl::OUString& rName )
{
m_pSerializer->startElementNS( XML_w, XML_ffData, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_name,
FSNS( XML_w, XML_val ), OUStringToOString( rName, RTL_TEXTENCODING_UTF8 ).getStr(),
FSEND );
m_pSerializer->singleElementNS( XML_w, XML_enabled, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_calcOnExit,
FSNS( XML_w, XML_val ),
"0", FSEND );
}
void writeFinish()
{
m_pSerializer->endElementNS( XML_w, XML_ffData );
}
public:
FFDataWriterHelper( const ::sax_fastparser::FSHelperPtr pSerializer ) : m_pSerializer( pSerializer ){}
void WriteFormCheckbox( const rtl::OUString& rName, const rtl::OUString& rDefault, bool bChecked )
{
writeCommonStart( rName );
// Checkbox specific bits
m_pSerializer->startElementNS( XML_w, XML_checkBox, FSEND );
// currently hardcoding autosize
// #TODO check if this defaulted
m_pSerializer->startElementNS( XML_w, XML_sizeAuto, FSEND );
m_pSerializer->endElementNS( XML_w, XML_sizeAuto );
if ( !rDefault.isEmpty() )
{
m_pSerializer->singleElementNS( XML_w, XML_default,
FSNS( XML_w, XML_val ),
rtl::OUStringToOString( rDefault, RTL_TEXTENCODING_UTF8 ).getStr(), FSEND );
}
if ( bChecked )
m_pSerializer->singleElementNS( XML_w, XML_checked, FSEND );
m_pSerializer->endElementNS( XML_w, XML_checkBox );
writeFinish();
}
void WriteFormText( const rtl::OUString& rName, const rtl::OUString& rDefault )
{
writeCommonStart( rName );
if ( !rDefault.isEmpty() )
{
m_pSerializer->startElementNS( XML_w, XML_textInput, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_default,
FSNS( XML_w, XML_val ),
rtl::OUStringToOString( rDefault, RTL_TEXTENCODING_UTF8 ).getStr(), FSEND );
m_pSerializer->endElementNS( XML_w, XML_textInput );
}
writeFinish();
}
};
class FieldMarkParamsHelper
{
const sw::mark::IFieldmark& mrFieldmark;
public:
FieldMarkParamsHelper( const sw::mark::IFieldmark& rFieldmark ) : mrFieldmark( rFieldmark ) {}
rtl::OUString getName() { return mrFieldmark.GetName(); }
template < typename T >
bool extractParam( const rtl::OUString& rKey, T& rResult )
{
bool bResult = false;
if ( mrFieldmark.GetParameters() )
{
sw::mark::IFieldmark::parameter_map_t::const_iterator it = mrFieldmark.GetParameters()->find( rKey );
if ( it != mrFieldmark.GetParameters()->end() )
bResult = ( it->second >>= rResult );
}
return bResult;
}
};
void DocxAttributeOutput::RTLAndCJKState( bool bIsRTL, sal_uInt16 /*nScript*/ )
{
if (bIsRTL)
m_pSerializer->singleElementNS( XML_w, XML_rtl, FSNS( XML_w, XML_val ), "true", FSEND );
}
void DocxAttributeOutput::StartParagraph( ww8::WW8TableNodeInfo::Pointer_t pTextNodeInfo )
{
if ( m_nColBreakStatus == COLBRK_POSTPONE )
m_nColBreakStatus = COLBRK_WRITE;
// Output table/table row/table cell starts if needed
if ( pTextNodeInfo.get() )
{
sal_uInt32 nRow = pTextNodeInfo->getRow();
sal_uInt32 nCell = pTextNodeInfo->getCell();
// New cell/row?
if ( m_nTableDepth > 0 && !m_bTableCellOpen )
{
ww8::WW8TableNodeInfoInner::Pointer_t pDeepInner( pTextNodeInfo->getInnerForDepth( m_nTableDepth ) );
if ( pDeepInner->getCell() == 0 )
StartTableRow( pDeepInner );
StartTableCell( pDeepInner );
}
if ( nRow == 0 && nCell == 0 )
{
// Do we have to start the table?
// [If we are at the rigth depth already, it means that we
// continue the table cell]
sal_uInt32 nCurrentDepth = pTextNodeInfo->getDepth();
if ( nCurrentDepth > m_nTableDepth )
{
// Start all the tables that begin here
for ( sal_uInt32 nDepth = m_nTableDepth + 1; nDepth <= pTextNodeInfo->getDepth(); ++nDepth )
{
ww8::WW8TableNodeInfoInner::Pointer_t pInner( pTextNodeInfo->getInnerForDepth( nDepth ) );
StartTable( pInner );
StartTableRow( pInner );
StartTableCell( pInner );
}
m_nTableDepth = nCurrentDepth;
}
}
}
m_pSerializer->startElementNS( XML_w, XML_p, FSEND );
// postpone the output of the run (we get it before the paragraph
// properties, but must write it after them)
m_pSerializer->mark();
// no section break in this paragraph yet; can be set in SectionBreak()
m_pSectionInfo.reset();
m_bParagraphOpened = true;
}
void DocxAttributeOutput::EndParagraph( ww8::WW8TableNodeInfoInner::Pointer_t pTextNodeInfoInner )
{
// write the paragraph properties + the run, already in the correct order
m_pSerializer->mergeTopMarks();
m_pSerializer->endElementNS( XML_w, XML_p );
// Check for end of cell, rows, tables here
FinishTableRowCell( pTextNodeInfoInner );
m_bParagraphOpened = false;
// Write the anchored frame if any
if ( m_pParentFrame )
{
sw::Frame *pParentFrame = m_pParentFrame;
m_pParentFrame = NULL;
const SwFrmFmt& rFrmFmt = pParentFrame->GetFrmFmt( );
const SwNodeIndex* pNodeIndex = rFrmFmt.GetCntnt().GetCntntIdx();
sal_uLong nStt = pNodeIndex ? pNodeIndex->GetIndex()+1 : 0;
sal_uLong nEnd = pNodeIndex ? pNodeIndex->GetNode().EndOfSectionIndex() : 0;
m_rExport.SaveData( nStt, nEnd );
m_rExport.mpParentFrame = pParentFrame;
m_rExport.WriteText( );
m_rExport.RestoreData();
delete pParentFrame;
}
}
void DocxAttributeOutput::FinishTableRowCell( ww8::WW8TableNodeInfoInner::Pointer_t pInner, bool bForceEmptyParagraph )
{
if ( pInner.get() )
{
// Where are we in the table
sal_uInt32 nRow = pInner->getRow( );
const SwTable *pTable = pInner->getTable( );
const SwTableLines& rLines = pTable->GetTabLines( );
sal_uInt16 nLinesCount = rLines.size( );
// HACK
// msoffice seems to have an internal limitation of 63 columns for tables
// and refuses to load .docx with more, even though the spec seems to allow that;
// so simply if there are more columns, don't close the last one msoffice will handle
// and merge the contents of the remaining ones into it (since we don't close the cell
// here, following ones will not be opened)
bool limitWorkaround = ( pInner->getCell() >= 62 && !pInner->isEndOfLine());
if ( pInner->isEndOfCell() && !limitWorkaround )
{
if ( bForceEmptyParagraph )
m_pSerializer->singleElementNS( XML_w, XML_p, FSEND );
EndTableCell();
}
// This is a line end
if ( pInner->isEndOfLine() )
EndTableRow();
// This is the end of the table
if ( pInner->isEndOfLine( ) && ( nRow + 1 ) == nLinesCount )
EndTable();
}
}
void DocxAttributeOutput::EmptyParagraph()
{
m_pSerializer->singleElementNS( XML_w, XML_p, FSEND );
}
void DocxAttributeOutput::StartParagraphProperties( const SwTxtNode& rNode )
{
// output page/section breaks
// Writer can have them at the beginning of a paragraph, or at the end, but
// in docx, we have to output them in the paragraph properties of the last
// paragraph in a section. To get it right, we have to switch to the next
// paragraph, and detect the section breaks there.
SwNodeIndex aNextIndex( rNode, 1 );
if ( aNextIndex.GetNode().IsTxtNode() )
{
const SwTxtNode* pTxtNode = static_cast< SwTxtNode* >( &aNextIndex.GetNode() );
m_rExport.OutputSectionBreaks( pTxtNode->GetpSwAttrSet(), *pTxtNode );
}
else if ( aNextIndex.GetNode().IsTableNode() )
{
const SwTableNode* pTableNode = static_cast< SwTableNode* >( &aNextIndex.GetNode() );
const SwFrmFmt *pFmt = pTableNode->GetTable().GetFrmFmt();
m_rExport.OutputSectionBreaks( &(pFmt->GetAttrSet()), *pTableNode );
}
m_pSerializer->mark( );
m_pSerializer->startElementNS( XML_w, XML_pPr, FSEND );
// and output the section break now (if it appeared)
if ( m_pSectionInfo )
{
m_rExport.SectionProperties( *m_pSectionInfo );
m_pSectionInfo.reset();
}
InitCollectedParagraphProperties();
}
void DocxAttributeOutput::InitCollectedParagraphProperties()
{
m_pParagraphSpacingAttrList = NULL;
// Write the elements in the spec order
static const sal_Int32 aOrder[] =
{
FSNS( XML_w, XML_pStyle ),
FSNS( XML_w, XML_keepNext ),
FSNS( XML_w, XML_keepLines ),
FSNS( XML_w, XML_pageBreakBefore ),
FSNS( XML_w, XML_framePr ),
FSNS( XML_w, XML_widowControl ),
FSNS( XML_w, XML_numPr ),
FSNS( XML_w, XML_suppressLineNumbers ),
FSNS( XML_w, XML_pBdr ),
FSNS( XML_w, XML_shd ),
FSNS( XML_w, XML_tabs ),
FSNS( XML_w, XML_suppressAutoHyphens ),
FSNS( XML_w, XML_kinsoku ),
FSNS( XML_w, XML_wordWrap ),
FSNS( XML_w, XML_overflowPunct ),
FSNS( XML_w, XML_topLinePunct ),
FSNS( XML_w, XML_autoSpaceDE ),
FSNS( XML_w, XML_autoSpaceDN ),
FSNS( XML_w, XML_bidi ),
FSNS( XML_w, XML_adjustRightInd ),
FSNS( XML_w, XML_snapToGrid ),
FSNS( XML_w, XML_spacing ),
FSNS( XML_w, XML_ind ),
FSNS( XML_w, XML_contextualSpacing ),
FSNS( XML_w, XML_mirrorIndents ),
FSNS( XML_w, XML_suppressOverlap ),
FSNS( XML_w, XML_jc ),
FSNS( XML_w, XML_textDirection ),
FSNS( XML_w, XML_textAlignment ),
FSNS( XML_w, XML_textboxTightWrap ),
FSNS( XML_w, XML_outlineLvl ),
FSNS( XML_w, XML_divId ),
FSNS( XML_w, XML_cnfStyle ),
FSNS( XML_w, XML_rPr ),
FSNS( XML_w, XML_sectPr ),
FSNS( XML_w, XML_pPrChange )
};
// postpone the output so that we can later [in EndParagraphProperties()]
// prepend the properties before the run
sal_Int32 len = sizeof ( aOrder ) / sizeof( sal_Int32 );
uno::Sequence< sal_Int32 > aSeqOrder( len );
for ( sal_Int32 i = 0; i < len; i++ )
aSeqOrder[i] = aOrder[i];
m_pSerializer->mark( aSeqOrder );
}
void DocxAttributeOutput::WriteCollectedParagraphProperties()
{
if ( m_pFlyAttrList )
{
XFastAttributeListRef xAttrList( m_pFlyAttrList );
m_pFlyAttrList = NULL;
m_pSerializer->singleElementNS( XML_w, XML_framePr, xAttrList );
}
if ( m_pParagraphSpacingAttrList )
{
XFastAttributeListRef xAttrList( m_pParagraphSpacingAttrList );
m_pParagraphSpacingAttrList = NULL;
m_pSerializer->singleElementNS( XML_w, XML_spacing, xAttrList );
}
// Merge the marks for the ordered elements
m_pSerializer->mergeTopMarks( );
}
void DocxAttributeOutput::EndParagraphProperties()
{
WriteCollectedParagraphProperties();
m_pSerializer->endElementNS( XML_w, XML_pPr );
if ( m_nColBreakStatus == COLBRK_WRITE )
{
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_br,
FSNS( XML_w, XML_type ), "column", FSEND );
m_pSerializer->endElementNS( XML_w, XML_r );
m_nColBreakStatus = COLBRK_NONE;
}
// merge the properties _before_ the run (strictly speaking, just
// after the start of the paragraph)
m_pSerializer->mergeTopMarks( sax_fastparser::MERGE_MARKS_PREPEND );
}
void DocxAttributeOutput::StartRun( const SwRedlineData* pRedlineData, bool /*bSingleEmptyRun*/ )
{
// if there is some redlining in the document, output it
StartRedline( pRedlineData );
// postpone the output of the start of a run (there are elements that need
// to be written before the start of the run, but we learn which they are
// _inside_ of the run)
m_pSerializer->mark(); // let's call it "postponed run start"
// postpone the output of the text (we get it before the run properties,
// but must write it after them)
m_pSerializer->mark(); // let's call it "postponed text"
}
void DocxAttributeOutput::EndRun()
{
// Write field starts
for ( std::vector<FieldInfos>::iterator pIt = m_Fields.begin(); pIt != m_Fields.end(); )
{
// Add the fields starts for all but hyperlinks and TOCs
if ( pIt->bOpen && pIt->pField )
{
StartField_Impl( *pIt );
// Remove the field from the stack if only the start has to be written
// Unknown fields sould be removed too
if ( !pIt->bClose || ( pIt->eType == ww::eUNKNOWN ) )
{
pIt = m_Fields.erase( pIt );
continue;
}
}
++pIt;
}
// write the run properties + the text, already in the correct order
m_pSerializer->mergeTopMarks(); // merges with "postponed text", see above
// level down, to be able to prepend the actual run start attribute (just
// before "postponed run start")
m_pSerializer->mark(); // let's call it "actual run start"
if ( m_closeHyperlinkInPreviousRun )
{
if ( m_startedHyperlink )
{
m_pSerializer->endElementNS( XML_w, XML_hyperlink );
m_startedHyperlink = false;
}
m_closeHyperlinkInPreviousRun = false;
}
// Write the hyperlink and toc fields starts
for ( std::vector<FieldInfos>::iterator pIt = m_Fields.begin(); pIt != m_Fields.end(); )
{
// Add the fields starts for hyperlinks, TOCs and index marks
if ( pIt->bOpen && !pIt->pField )
{
StartField_Impl( *pIt, sal_True );
// Remove the field if no end needs to be written
if ( !pIt->bClose ) {
pIt = m_Fields.erase( pIt );
continue;
}
}
++pIt;
}
// Start the hyperlink after the fields separators or we would generate invalid file
if ( m_pHyperlinkAttrList )
{
XFastAttributeListRef xAttrList ( m_pHyperlinkAttrList );
m_pSerializer->startElementNS( XML_w, XML_hyperlink, xAttrList );
m_pHyperlinkAttrList = NULL;
m_startedHyperlink = true;
}
DoWriteBookmarks( );
WriteCommentRanges();
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
m_pSerializer->mergeTopMarks( sax_fastparser::MERGE_MARKS_PREPEND ); // merges with "postponed run start", see above
// write the run start + the run content
m_pSerializer->mergeTopMarks(); // merges the "actual run start"
// append the actual run end
m_pSerializer->endElementNS( XML_w, XML_r );
WritePostponedMath();
if ( m_closeHyperlinkInThisRun )
{
if ( m_startedHyperlink )
{
m_pSerializer->endElementNS( XML_w, XML_hyperlink );
m_startedHyperlink = false;
}
m_closeHyperlinkInThisRun = false;
}
while ( m_Fields.begin() != m_Fields.end() )
{
EndField_Impl( m_Fields.front( ) );
m_Fields.erase( m_Fields.begin( ) );
}
// if there is some redlining in the document, output it
EndRedline();
}
void DocxAttributeOutput::WriteCommentRanges()
{
if (m_bPostitStart)
{
m_bPostitStart = false;
OString idstr = OString::valueOf( sal_Int32( m_postitFieldsMaxId ));
m_pSerializer->singleElementNS( XML_w, XML_commentRangeStart, FSNS( XML_w, XML_id ), idstr.getStr(), FSEND );
}
if (m_bPostitEnd)
{
m_bPostitEnd = false;
OString idstr = OString::valueOf( sal_Int32( m_postitFieldsMaxId ));
m_pSerializer->singleElementNS( XML_w, XML_commentRangeEnd, FSNS( XML_w, XML_id ), idstr.getStr(), FSEND );
}
}
void DocxAttributeOutput::DoWriteBookmarks()
{
// Write the start bookmarks
for ( std::vector< OString >::const_iterator it = m_rMarksStart.begin(), end = m_rMarksStart.end();
it != end; ++it )
{
const OString& rName = *it;
// Output the bookmark
sal_uInt16 nId = m_nNextMarkId++;
m_rOpenedMarksIds[rName] = nId;
m_pSerializer->singleElementNS( XML_w, XML_bookmarkStart,
FSNS( XML_w, XML_id ), OString::valueOf( sal_Int32( nId ) ).getStr( ),
FSNS( XML_w, XML_name ), rName.getStr(),
FSEND );
}
m_rMarksStart.clear();
// export the end bookmarks
for ( std::vector< OString >::const_iterator it = m_rMarksEnd.begin(), end = m_rMarksEnd.end();
it != end; ++it )
{
const OString& rName = *it;
// Get the id of the bookmark
std::map< OString, sal_uInt16 >::iterator pPos = m_rOpenedMarksIds.find( rName );
if ( pPos != m_rOpenedMarksIds.end( ) )
{
sal_uInt16 nId = ( *pPos ).second;
m_pSerializer->singleElementNS( XML_w, XML_bookmarkEnd,
FSNS( XML_w, XML_id ), OString::valueOf( sal_Int32( nId ) ).getStr( ),
FSEND );
m_rOpenedMarksIds.erase( rName );
}
}
m_rMarksEnd.clear();
}
void DocxAttributeOutput::WriteFFData( const FieldInfos& rInfos )
{
const ::sw::mark::IFieldmark& rFieldmark = *rInfos.pFieldmark;
if ( rInfos.eType == ww::eFORMDROPDOWN )
{
uno::Sequence< ::rtl::OUString> vListEntries;
rtl::OUString sName, sHelp, sToolTip, sSelected;
FieldMarkParamsHelper params( rFieldmark );
params.extractParam( ODF_FORMDROPDOWN_LISTENTRY, vListEntries );
sName = params.getName();
sal_Int32 nSelectedIndex = 0;
if ( params.extractParam( ODF_FORMDROPDOWN_RESULT, nSelectedIndex ) )
{
if (nSelectedIndex < vListEntries.getLength() )
sSelected = vListEntries[ nSelectedIndex ];
}
GetExport().DoComboBox( sName, sHelp, sToolTip, sSelected, vListEntries );
}
else if ( rInfos.eType == ww::eFORMCHECKBOX )
{
rtl::OUString sName;
bool bChecked = false;
FieldMarkParamsHelper params( rFieldmark );
params.extractParam( ODF_FORMCHECKBOX_NAME, sName );
const sw::mark::ICheckboxFieldmark* pCheckboxFm = dynamic_cast<const sw::mark::ICheckboxFieldmark*>(&rFieldmark);
if ( pCheckboxFm && pCheckboxFm->IsChecked() )
bChecked = true;
FFDataWriterHelper ffdataOut( m_pSerializer );
ffdataOut.WriteFormCheckbox( sName, rtl::OUString(), bChecked );
}
else if ( rInfos.eType == ww::eFORMTEXT )
{
FieldMarkParamsHelper params( rFieldmark );
FFDataWriterHelper ffdataOut( m_pSerializer );
ffdataOut.WriteFormText( params.getName(), rtl::OUString() );
}
}
void DocxAttributeOutput::StartField_Impl( FieldInfos& rInfos, bool bWriteRun )
{
if ( rInfos.pField && rInfos.eType == ww::eUNKNOWN )
{
// Expand unsupported fields
RunText( rInfos.pField->GetFieldName() );
}
else if ( rInfos.eType != ww::eNONE ) // HYPERLINK fields are just commands
{
if ( bWriteRun )
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
if ( rInfos.eType == ww::eFORMDROPDOWN )
{
m_pSerializer->startElementNS( XML_w, XML_fldChar,
FSNS( XML_w, XML_fldCharType ), "begin",
FSEND );
if ( rInfos.pFieldmark && !rInfos.pField )
WriteFFData( rInfos );
if ( rInfos.pField )
{
const SwDropDownField& rFld2 = *(SwDropDownField*)rInfos.pField;
uno::Sequence<rtl::OUString> aItems =
rFld2.GetItemSequence();
GetExport().DoComboBox(rFld2.GetName(),
rFld2.GetHelp(),
rFld2.GetToolTip(),
rFld2.GetSelectedItem(), aItems);
}
m_pSerializer->endElementNS( XML_w, XML_fldChar );
if ( bWriteRun )
m_pSerializer->endElementNS( XML_w, XML_r );
if ( !rInfos.pField )
CmdField_Impl( rInfos );
}
else
{
// Write the field start
m_pSerializer->startElementNS( XML_w, XML_fldChar,
FSNS( XML_w, XML_fldCharType ), "begin",
FSEND );
if ( rInfos.pFieldmark )
WriteFFData( rInfos );
m_pSerializer->endElementNS( XML_w, XML_fldChar );
if ( bWriteRun )
m_pSerializer->endElementNS( XML_w, XML_r );
// The hyperlinks fields can't be expanded: the value is
// normally in the text run
if ( !rInfos.pField )
CmdField_Impl( rInfos );
}
}
}
void DocxAttributeOutput::DoWriteCmd( String& rCmd )
{
// Write the Field command
m_pSerializer->startElementNS( XML_w, XML_instrText, FSEND );
m_pSerializer->writeEscaped( OUString( rCmd ) );
m_pSerializer->endElementNS( XML_w, XML_instrText );
}
void DocxAttributeOutput::CmdField_Impl( FieldInfos& rInfos )
{
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
xub_StrLen nNbToken = comphelper::string::getTokenCount(rInfos.sCmd, '\t');
for ( xub_StrLen i = 0; i < nNbToken; i++ )
{
String sToken = rInfos.sCmd.GetToken( i, '\t' );
if ( rInfos.eType == ww::eCREATEDATE
|| rInfos.eType == ww::eSAVEDATE
|| rInfos.eType == ww::ePRINTDATE
|| rInfos.eType == ww::eDATE
|| rInfos.eType == ww::eTIME )
{
sToken.SearchAndReplaceAll( String( "NNNN" ), String( "dddd" ) );
sToken.SearchAndReplaceAll( String( "NN" ), String( "ddd" ) );
}
// Write the Field command
DoWriteCmd( sToken );
// Replace tabs by </instrText><tab/><instrText>
if ( i < ( nNbToken - 1 ) )
RunText( rtl::OUString( "\t" ) );
}
m_pSerializer->endElementNS( XML_w, XML_r );
// Write the Field separator
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_fldChar,
FSNS( XML_w, XML_fldCharType ), "separate",
FSEND );
m_pSerializer->endElementNS( XML_w, XML_r );
}
void DocxAttributeOutput::EndField_Impl( FieldInfos& rInfos )
{
// The command has to be written before for the hyperlinks
if ( rInfos.pField )
{
CmdField_Impl( rInfos );
}
// Write the bookmark start if any
OUString aBkmName( m_sFieldBkm );
if ( !aBkmName.isEmpty() )
{
m_pSerializer->singleElementNS( XML_w, XML_bookmarkStart,
FSNS( XML_w, XML_id ), OString::valueOf( sal_Int32( m_nNextMarkId ) ).getStr( ),
FSNS( XML_w, XML_name ), OUStringToOString( aBkmName, RTL_TEXTENCODING_UTF8 ).getStr( ),
FSEND );
}
if (rInfos.pField ) // For hyperlinks and TOX
{
// Write the Field latest value
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
String sExpand( rInfos.pField->ExpandField( true ) );
// newlines embedded in fields are 0x0B in MSO and 0x0A for us
sExpand.SearchAndReplaceAll( 0x0A, 0x0B );
RunText( sExpand );
m_pSerializer->endElementNS( XML_w, XML_r );
}
// Write the bookmark end if any
if ( !aBkmName.isEmpty() )
{
m_pSerializer->singleElementNS( XML_w, XML_bookmarkEnd,
FSNS( XML_w, XML_id ), OString::valueOf( sal_Int32( m_nNextMarkId ) ).getStr( ),
FSEND );
m_nNextMarkId++;
}
// Write the Field end
if ( rInfos.bClose )
{
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_fldChar,
FSNS( XML_w, XML_fldCharType ), "end",
FSEND );
m_pSerializer->endElementNS( XML_w, XML_r );
}
// Write the ref field if a bookmark had to be set and the field
// should be visible
if ( rInfos.pField )
{
sal_uInt16 nSubType = rInfos.pField->GetSubType( );
bool bIsSetField = rInfos.pField->GetTyp( )->Which( ) == RES_SETEXPFLD;
bool bShowRef = ( !bIsSetField || ( nSubType & nsSwExtendedSubType::SUB_INVISIBLE ) ) ? false : true;
if ( ( m_sFieldBkm.Len( ) > 0 ) && bShowRef )
{
// Write the field beginning
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_fldChar,
FSNS( XML_w, XML_fldCharType ), "begin",
FSEND );
m_pSerializer->endElementNS( XML_w, XML_r );
rInfos.sCmd = FieldString( ww::eREF );
rInfos.sCmd.APPEND_CONST_ASC( "\"" );
rInfos.sCmd += m_sFieldBkm;
rInfos.sCmd.APPEND_CONST_ASC( "\" " );
// Clean the field bookmark data to avoid infinite loop
m_sFieldBkm = String( );
// Write the end of the field
EndField_Impl( rInfos );
}
}
}
void DocxAttributeOutput::StartRunProperties()
{
// postpone the output so that we can later [in EndRunProperties()]
// prepend the properties before the text
m_pSerializer->mark();
m_pSerializer->startElementNS( XML_w, XML_rPr, FSEND );
InitCollectedRunProperties();
OSL_ASSERT( m_postponedGraphic == NULL );
m_postponedGraphic = new std::list< PostponedGraphic >;
}
void DocxAttributeOutput::InitCollectedRunProperties()
{
m_pFontsAttrList = NULL;
m_pEastAsianLayoutAttrList = NULL;
m_pCharLangAttrList = NULL;
// Write the elements in the spec order
static const sal_Int32 aOrder[] =
{
FSNS( XML_w, XML_rStyle ),
FSNS( XML_w, XML_rFonts ),
FSNS( XML_w, XML_b ),
FSNS( XML_w, XML_bCs ),
FSNS( XML_w, XML_i ),
FSNS( XML_w, XML_iCs ),
FSNS( XML_w, XML_caps ),
FSNS( XML_w, XML_smallCaps ),
FSNS( XML_w, XML_strike ),
FSNS( XML_w, XML_dstrike ),
FSNS( XML_w, XML_outline ),
FSNS( XML_w, XML_shadow ),
FSNS( XML_w, XML_emboss ),
FSNS( XML_w, XML_imprint ),
FSNS( XML_w, XML_noProof ),
FSNS( XML_w, XML_snapToGrid ),
FSNS( XML_w, XML_vanish ),
FSNS( XML_w, XML_webHidden ),
FSNS( XML_w, XML_color ),
FSNS( XML_w, XML_spacing ),
FSNS( XML_w, XML_w ),
FSNS( XML_w, XML_kern ),
FSNS( XML_w, XML_position ),
FSNS( XML_w, XML_sz ),
FSNS( XML_w, XML_szCs ),
FSNS( XML_w, XML_highlight ),
FSNS( XML_w, XML_u ),
FSNS( XML_w, XML_effect ),
FSNS( XML_w, XML_bdr ),
FSNS( XML_w, XML_shd ),
FSNS( XML_w, XML_fitText ),
FSNS( XML_w, XML_vertAlign ),
FSNS( XML_w, XML_rtl ),
FSNS( XML_w, XML_cs ),
FSNS( XML_w, XML_em ),
FSNS( XML_w, XML_lang ),
FSNS( XML_w, XML_eastAsianLayout ),
FSNS( XML_w, XML_specVanish ),
FSNS( XML_w, XML_oMath ),
FSNS( XML_w, XML_rPrChange )
};
// postpone the output so that we can later [in EndParagraphProperties()]
// prepend the properties before the run
sal_Int32 len = sizeof ( aOrder ) / sizeof( sal_Int32 );
uno::Sequence< sal_Int32 > aSeqOrder( len );
for ( sal_Int32 i = 0; i < len; i++ )
aSeqOrder[i] = aOrder[i];
m_pSerializer->mark( aSeqOrder );
}
void DocxAttributeOutput::WriteCollectedRunProperties()
{
// Write all differed properties
if ( m_pFontsAttrList )
{
XFastAttributeListRef xAttrList( m_pFontsAttrList );
m_pFontsAttrList = NULL;
m_pSerializer->singleElementNS( XML_w, XML_rFonts, xAttrList );
}
if ( m_pEastAsianLayoutAttrList )
{
XFastAttributeListRef xAttrList( m_pEastAsianLayoutAttrList );
m_pEastAsianLayoutAttrList = NULL;
m_pSerializer->singleElementNS( XML_w, XML_eastAsianLayout, xAttrList );
}
if ( m_pCharLangAttrList )
{
XFastAttributeListRef xAttrList( m_pCharLangAttrList );
m_pCharLangAttrList = NULL;
m_pSerializer->singleElementNS( XML_w, XML_lang, xAttrList );
}
// Merge the marks for the ordered elements
m_pSerializer->mergeTopMarks();
}
void DocxAttributeOutput::EndRunProperties( const SwRedlineData* /*pRedlineData*/ )
{
WriteCollectedRunProperties();
m_pSerializer->endElementNS( XML_w, XML_rPr );
// write footnotes/endnotes if we have any
FootnoteEndnoteReference();
WritePostponedGraphic();
// merge the properties _before_ the run text (strictly speaking, just
// after the start of the run)
m_pSerializer->mergeTopMarks( sax_fastparser::MERGE_MARKS_PREPEND );
}
void DocxAttributeOutput::WritePostponedGraphic()
{
for( std::list< PostponedGraphic >::const_iterator it = m_postponedGraphic->begin();
it != m_postponedGraphic->end();
++it )
FlyFrameGraphic( it->grfNode, it->size );
delete m_postponedGraphic;
m_postponedGraphic = NULL;
}
void DocxAttributeOutput::FootnoteEndnoteRefTag()
{
if( m_footnoteEndnoteRefTag == 0 )
return;
m_pSerializer->singleElementNS( XML_w, m_footnoteEndnoteRefTag, FSEND );
m_footnoteEndnoteRefTag = 0;
}
/** Output sal_Unicode* as a run text (<t>the text</t>).
When bMove is true, update rBegin to point _after_ the end of the text +
1, meaning that it skips one character after the text. This is to make
the switch in DocxAttributeOutput::RunText() nicer ;-)
*/
static void impl_WriteRunText( FSHelperPtr pSerializer, sal_Int32 nTextToken,
const sal_Unicode* &rBegin, const sal_Unicode* pEnd, bool bMove = true )
{
const sal_Unicode *pBegin = rBegin;
// skip one character after the end
if ( bMove )
rBegin = pEnd + 1;
if ( pBegin >= pEnd )
return; // we want to write at least one character
// we have to add 'preserve' when starting/ending with space
if ( *pBegin == sal_Unicode( ' ' ) || *( pEnd - 1 ) == sal_Unicode( ' ' ) )
{
pSerializer->startElementNS( XML_w, nTextToken, FSNS( XML_xml, XML_space ), "preserve", FSEND );
}
else
pSerializer->startElementNS( XML_w, nTextToken, FSEND );
pSerializer->writeEscaped( OUString( pBegin, pEnd - pBegin ) );
pSerializer->endElementNS( XML_w, nTextToken );
}
void DocxAttributeOutput::RunText( const String& rText, rtl_TextEncoding /*eCharSet*/ )
{
if( m_closeHyperlinkInThisRun )
{
m_closeHyperlinkInPreviousRun = true;
m_closeHyperlinkInThisRun = false;
}
OUString aText( rText );
// one text can be split into more <w:t>blah</w:t>'s by line breaks etc.
const sal_Unicode *pBegin = aText.getStr();
const sal_Unicode *pEnd = pBegin + aText.getLength();
// the text run is usually XML_t, with the exception of the deleted text
sal_Int32 nTextToken = XML_t;
if ( m_pRedlineData && m_pRedlineData->GetType() == nsRedlineType_t::REDLINE_DELETE )
nTextToken = XML_delText;
for ( const sal_Unicode *pIt = pBegin; pIt < pEnd; ++pIt )
{
switch ( *pIt )
{
case 0x09: // tab
impl_WriteRunText( m_pSerializer, nTextToken, pBegin, pIt );
m_pSerializer->singleElementNS( XML_w, XML_tab, FSEND );
break;
case 0x0b: // line break
impl_WriteRunText( m_pSerializer, nTextToken, pBegin, pIt );
m_pSerializer->singleElementNS( XML_w, XML_br, FSEND );
break;
default:
if ( *pIt < 0x0020 ) // filter out the control codes
{
impl_WriteRunText( m_pSerializer, nTextToken, pBegin, pIt );
OSL_TRACE( "Ignored control code %x in a text run.", *pIt );
}
break;
}
}
impl_WriteRunText( m_pSerializer, nTextToken, pBegin, pEnd, false );
}
void DocxAttributeOutput::RawText( const String& /*rText*/, bool /*bForceUnicode*/, rtl_TextEncoding /*eCharSet*/ )
{
OSL_TRACE("TODO DocxAttributeOutput::RawText( const String& rText, bool bForceUnicode, rtl_TextEncoding eCharSet )" );
}
void DocxAttributeOutput::StartRuby( const SwTxtNode& rNode, xub_StrLen nPos, const SwFmtRuby& rRuby )
{
OSL_TRACE("TODO DocxAttributeOutput::StartRuby( const SwTxtNode& rNode, const SwFmtRuby& rRuby )" );
m_pSerializer->startElementNS( XML_w, XML_ruby, FSEND );
m_pSerializer->startElementNS( XML_w, XML_rubyPr, FSEND );
// hps
// hpsBaseText
// hpsRaise
// lid
lang::Locale aLocale( SwBreakIt::Get()->GetLocale(
rNode.GetLang( nPos ) ) );
OUString sLang( aLocale.Language );
if ( !aLocale.Country.isEmpty() )
sLang += OUString( "-" ) + OUString( aLocale.Country );
m_pSerializer->singleElementNS( XML_w, XML_lid,
FSNS( XML_w, XML_val ),
OUStringToOString( sLang, RTL_TEXTENCODING_UTF8 ).getStr( ), FSEND );
OString sAlign ( "center" );
switch ( rRuby.GetAdjustment( ) )
{
case 0:
sAlign = OString( "left" );
break;
case 1:
// Defaults to center
break;
case 2:
sAlign = OString( "right" );
break;
case 3:
sAlign = OString( "distributeLetter" );
break;
case 4:
sAlign = OString( "distributeSpace" );
break;
default:
break;
}
m_pSerializer->singleElementNS( XML_w, XML_rubyAlign,
FSNS( XML_w, XML_val ), sAlign.getStr(), FSEND );
m_pSerializer->endElementNS( XML_w, XML_rubyPr );
m_pSerializer->startElementNS( XML_w, XML_rt, FSEND );
StartRun( NULL );
StartRunProperties( );
SwWW8AttrIter aAttrIt( m_rExport, rNode );
aAttrIt.OutAttr( nPos, true );
sal_uInt16 nStyle = m_rExport.GetId( *rRuby.GetTxtRuby()->GetCharFmt() );
OString aStyleId( "style" );
aStyleId += OString::valueOf( sal_Int32( nStyle ) );
m_pSerializer->singleElementNS( XML_w, XML_rStyle,
FSNS( XML_w, XML_val ), aStyleId.getStr(), FSEND );
EndRunProperties( NULL );
RunText( rRuby.GetText( ) );
EndRun( );
m_pSerializer->endElementNS( XML_w, XML_rt );
m_pSerializer->startElementNS( XML_w, XML_rubyBase, FSEND );
StartRun( NULL );
}
void DocxAttributeOutput::EndRuby()
{
OSL_TRACE( "TODO DocxAttributeOutput::EndRuby()" );
EndRun( );
m_pSerializer->endElementNS( XML_w, XML_rubyBase );
m_pSerializer->endElementNS( XML_w, XML_ruby );
}
bool DocxAttributeOutput::AnalyzeURL( const String& rUrl, const String& rTarget, String* pLinkURL, String* pMark )
{
bool bBookMarkOnly = AttributeOutputBase::AnalyzeURL( rUrl, rTarget, pLinkURL, pMark );
String sURL = *pLinkURL;
String sMark = *pMark;
bool bOutputField = sMark.Len();
if ( bOutputField )
{
if ( bBookMarkOnly )
sURL = FieldString( ww::eHYPERLINK );
else
{
String sFld( FieldString( ww::eHYPERLINK ) );
sFld.APPEND_CONST_ASC( "\"" );
sURL.Insert( sFld, 0 );
sURL += '\"';
}
if ( sMark.Len() )
( ( sURL.APPEND_CONST_ASC( " \\l \"" ) ) += sMark ) += '\"';
if ( rTarget.Len() )
( sURL.APPEND_CONST_ASC( " \\n " ) ) += rTarget;
}
*pLinkURL = sURL;
*pMark = sMark;
return bBookMarkOnly;
}
bool DocxAttributeOutput::StartURL( const String& rUrl, const String& rTarget )
{
String sMark;
String sUrl;
bool bBookmarkOnly = AnalyzeURL( rUrl, rTarget, &sUrl, &sMark );
if ( sMark.Len() && !bBookmarkOnly )
{
m_rExport.OutputField( NULL, ww::eHYPERLINK, sUrl );
}
else
{
// Output a hyperlink XML element
m_pHyperlinkAttrList = m_pSerializer->createAttrList();
if ( !bBookmarkOnly )
{
OUString osUrl( sUrl );
OString sId = rtl::OUStringToOString( GetExport().GetFilter().addRelation( m_pSerializer->getOutputStream(),
S( "http://schemas.openxmlformats.org/officeDocument/2006/relationships/hyperlink" ),
osUrl, true ), RTL_TEXTENCODING_UTF8 );
m_pHyperlinkAttrList->add( FSNS( XML_r, XML_id), sId.getStr());
}
else
m_pHyperlinkAttrList->add( FSNS( XML_w, XML_anchor ),
OUStringToOString( OUString( sMark ), RTL_TEXTENCODING_UTF8 ).getStr( ) );
OUString sTarget( rTarget );
if ( !sTarget.isEmpty() )
{
OString soTarget = OUStringToOString( sTarget, RTL_TEXTENCODING_UTF8 );
m_pHyperlinkAttrList->add(FSNS( XML_w, XML_tgtFrame ), soTarget.getStr());
}
}
return true;
}
bool DocxAttributeOutput::EndURL()
{
m_closeHyperlinkInThisRun = true;
return true;
}
void DocxAttributeOutput::FieldVanish( const String& rTxt, ww::eField eType )
{
WriteField_Impl( NULL, eType, rTxt, WRITEFIELD_ALL );
}
void DocxAttributeOutput::Redline( const SwRedlineData* /*pRedline*/ )
{
OSL_TRACE( "TODO DocxAttributeOutput::Redline( const SwRedlineData* pRedline )" );
}
void DocxAttributeOutput::StartRedline( const SwRedlineData* pRedlineData )
{
m_pRedlineData = pRedlineData;
if ( !m_pRedlineData )
return;
// FIXME check if it's necessary to travel over the Next()'s in pRedlineData
OString aId( OString::valueOf( m_nRedlineId++ ) );
const String &rAuthor( SW_MOD()->GetRedlineAuthor( pRedlineData->GetAuthor() ) );
OString aAuthor( OUStringToOString( rAuthor, RTL_TEXTENCODING_UTF8 ) );
OString aDate( msfilter::util::DateTimeToOString( pRedlineData->GetTimeStamp() ) );
switch ( pRedlineData->GetType() )
{
case nsRedlineType_t::REDLINE_INSERT:
m_pSerializer->startElementNS( XML_w, XML_ins,
FSNS( XML_w, XML_id ), aId.getStr(),
FSNS( XML_w, XML_author ), aAuthor.getStr(),
FSNS( XML_w, XML_date ), aDate.getStr(),
FSEND );
break;
case nsRedlineType_t::REDLINE_DELETE:
m_pSerializer->startElementNS( XML_w, XML_del,
FSNS( XML_w, XML_id ), aId.getStr(),
FSNS( XML_w, XML_author ), aAuthor.getStr(),
FSNS( XML_w, XML_date ), aDate.getStr(),
FSEND );
break;
case nsRedlineType_t::REDLINE_FORMAT:
OSL_TRACE( "TODO DocxAttributeOutput::StartRedline()" );
default:
break;
}
}
void DocxAttributeOutput::EndRedline()
{
if ( !m_pRedlineData )
return;
switch ( m_pRedlineData->GetType() )
{
case nsRedlineType_t::REDLINE_INSERT:
m_pSerializer->endElementNS( XML_w, XML_ins );
break;
case nsRedlineType_t::REDLINE_DELETE:
m_pSerializer->endElementNS( XML_w, XML_del );
break;
case nsRedlineType_t::REDLINE_FORMAT:
OSL_TRACE( "TODO DocxAttributeOutput::EndRedline()" );
break;
default:
break;
}
m_pRedlineData = NULL;
}
void DocxAttributeOutput::FormatDrop( const SwTxtNode& /*rNode*/, const SwFmtDrop& /*rSwFmtDrop*/, sal_uInt16 /*nStyle*/, ww8::WW8TableNodeInfo::Pointer_t /*pTextNodeInfo*/, ww8::WW8TableNodeInfoInner::Pointer_t )
{
OSL_TRACE( "TODO DocxAttributeOutput::FormatDrop( const SwTxtNode& rNode, const SwFmtDrop& rSwFmtDrop, sal_uInt16 nStyle )" );
}
void DocxAttributeOutput::ParagraphStyle( sal_uInt16 nStyle )
{
OString aStyleId( "style" );
aStyleId += OString::valueOf( sal_Int32( nStyle ) );
m_pSerializer->singleElementNS( XML_w, XML_pStyle, FSNS( XML_w, XML_val ), aStyleId.getStr(), FSEND );
}
static OString impl_ConvertColor( const Color &rColor )
{
OString color( "auto" );
if ( rColor.GetColor() != COL_AUTO )
{
const char pHexDigits[] = "0123456789ABCDEF";
char pBuffer[] = "000000";
pBuffer[0] = pHexDigits[ ( rColor.GetRed() >> 4 ) & 0x0F ];
pBuffer[1] = pHexDigits[ rColor.GetRed() & 0x0F ];
pBuffer[2] = pHexDigits[ ( rColor.GetGreen() >> 4 ) & 0x0F ];
pBuffer[3] = pHexDigits[ rColor.GetGreen() & 0x0F ];
pBuffer[4] = pHexDigits[ ( rColor.GetBlue() >> 4 ) & 0x0F ];
pBuffer[5] = pHexDigits[ rColor.GetBlue() & 0x0F ];
color = OString( pBuffer );
}
return color;
}
static void impl_borderLine( FSHelperPtr pSerializer, sal_Int32 elementToken, const SvxBorderLine* pBorderLine, sal_uInt16 nDist )
{
FastAttributeList* pAttr = pSerializer->createAttrList();
// Compute val attribute value
// Can be one of:
// single, double,
// basicWideOutline, basicWideInline
// OOXml also supports those types of borders, but we'll try to play with the first ones.
// thickThinMediumGap, thickThinLargeGap, thickThinSmallGap
// thinThickLargeGap, thinThickMediumGap, thinThickSmallGap
const char* pVal = "none";
if ( pBorderLine && !pBorderLine->isEmpty( ) )
{
switch (pBorderLine->GetBorderLineStyle())
{
case table::BorderLineStyle::SOLID:
pVal = ( sal_Char* )"single";
break;
case table::BorderLineStyle::DOTTED:
pVal = ( sal_Char* )"dotted";
break;
case table::BorderLineStyle::DASHED:
pVal = ( sal_Char* )"dashed";
break;
case table::BorderLineStyle::DOUBLE:
pVal = ( sal_Char* )"double";
break;
case table::BorderLineStyle::THINTHICK_SMALLGAP:
pVal = ( sal_Char* )"thinThickSmallGap";
break;
case table::BorderLineStyle::THINTHICK_MEDIUMGAP:
pVal = ( sal_Char* )"thinThickMediumGap";
break;
case table::BorderLineStyle::THINTHICK_LARGEGAP:
pVal = ( sal_Char* )"thinThickLargeGap";
break;
case table::BorderLineStyle::THICKTHIN_SMALLGAP:
pVal = ( sal_Char* )"thickThinSmallGap";
break;
case table::BorderLineStyle::THICKTHIN_MEDIUMGAP:
pVal = ( sal_Char* )"thickThinMediumGap";
break;
case table::BorderLineStyle::THICKTHIN_LARGEGAP:
pVal = ( sal_Char* )"thickThinLargeGap";
break;
case table::BorderLineStyle::EMBOSSED:
pVal = ( sal_Char* )"threeDEmboss";
break;
case table::BorderLineStyle::ENGRAVED:
pVal = ( sal_Char* )"threeDEngrave";
break;
case table::BorderLineStyle::OUTSET:
pVal = ( sal_Char* )"outset";
break;
case table::BorderLineStyle::INSET:
pVal = ( sal_Char* )"inset";
break;
case table::BorderLineStyle::NONE:
default:
break;
}
}
pAttr->add( FSNS( XML_w, XML_val ), OString( pVal ) );
if ( pBorderLine && !pBorderLine->isEmpty() )
{
// Compute the sz attribute
double const fConverted( ::editeng::ConvertBorderWidthToWord(
pBorderLine->GetBorderLineStyle(), pBorderLine->GetWidth()));
// The unit is the 8th of point
sal_Int32 nWidth = sal_Int32( fConverted / 2.5 );
sal_uInt16 nMinWidth = 2;
sal_uInt16 nMaxWidth = 96;
if ( nWidth > nMaxWidth )
nWidth = nMaxWidth;
else if ( nWidth < nMinWidth )
nWidth = nMinWidth;
pAttr->add( FSNS( XML_w, XML_sz ), OString::valueOf( sal_Int32( nWidth ) ) );
// Get the distance (in pt)
pAttr->add( FSNS( XML_w, XML_space ), OString::valueOf( sal_Int32( nDist / 20 ) ) );
// Get the color code as an RRGGBB hex value
OString sColor( impl_ConvertColor( pBorderLine->GetColor( ) ) );
pAttr->add( FSNS( XML_w, XML_color ), sColor );
}
XFastAttributeListRef xAttrs( pAttr );
pSerializer->singleElementNS( XML_w, elementToken, xAttrs );
}
static void impl_pageBorders( FSHelperPtr pSerializer, const SvxBoxItem& rBox, sal_Int32 tag, bool bUseStartEnd = false, bool bWriteTag = true, const SvxBoxItem* pDefaultBorders = 0)
{
static const sal_uInt16 aBorders[] =
{
BOX_LINE_TOP, BOX_LINE_LEFT, BOX_LINE_BOTTOM, BOX_LINE_RIGHT
};
const sal_Int32 aXmlElements[] =
{
XML_top,
bUseStartEnd ? XML_start : XML_left,
XML_bottom,
bUseStartEnd ? XML_end : XML_right
};
bool tagWritten = false;
const sal_uInt16* pBrd = aBorders;
for( int i = 0; i < 4; ++i, ++pBrd )
{
const SvxBorderLine* pLn = rBox.GetLine( *pBrd );
if ( pDefaultBorders && pLn )
{
const SvxBorderLine* pRefLn = pDefaultBorders->GetLine( *pBrd );
// If border is equal to default border: do not output
if ( pRefLn && *pLn == *pRefLn) {
continue;
}
}
if (!tagWritten && bWriteTag) {
pSerializer->startElementNS( XML_w, tag, FSEND );
tagWritten = true;
}
impl_borderLine( pSerializer, aXmlElements[i], pLn, 0 );
// When exporting default borders, we need to export these 2 attr
if ( pDefaultBorders == 0 ) {
if ( i == 2 )
impl_borderLine( pSerializer, XML_insideH, pLn, 0 );
else if ( i == 3 )
impl_borderLine( pSerializer, XML_insideV, pLn, 0 );
}
}
if (tagWritten && bWriteTag) {
pSerializer->endElementNS( XML_w, tag );
}
}
static void impl_cellMargins( FSHelperPtr pSerializer, const SvxBoxItem& rBox, sal_Int32 tag, bool bUseStartEnd = false, const SvxBoxItem* pDefaultMargins = 0)
{
static const sal_uInt16 aBorders[] =
{
BOX_LINE_TOP, BOX_LINE_LEFT, BOX_LINE_BOTTOM, BOX_LINE_RIGHT
};
const sal_Int32 aXmlElements[] =
{
XML_top,
bUseStartEnd ? XML_start : XML_left,
XML_bottom,
bUseStartEnd ? XML_end : XML_right
};
bool tagWritten = false;
const sal_uInt16* pBrd = aBorders;
for( int i = 0; i < 4; ++i, ++pBrd )
{
sal_Int32 nDist = sal_Int32( rBox.GetDistance( *pBrd ) );
if ( aBorders[i] == BOX_LINE_LEFT ) {
// Office's cell margin is measured from the right of the border.
// While LO's cell spacing is measured from the center of the border.
// So we add half left-border width to tblIndent value
const SvxBorderLine* pLn = rBox.GetLine( *pBrd );
if (pLn)
nDist -= pLn->GetWidth() * 0.5;
}
if (pDefaultMargins)
{
// Skip output if cell margin == table default margin
if (sal_Int32( pDefaultMargins->GetDistance( *pBrd ) ) == nDist)
continue;
}
if (!tagWritten) {
pSerializer->startElementNS( XML_w, tag, FSEND );
tagWritten = true;
}
pSerializer->singleElementNS( XML_w, aXmlElements[i],
FSNS( XML_w, XML_w ), OString::valueOf( nDist ).getStr( ),
FSNS( XML_w, XML_type ), "dxa",
FSEND );
}
if (tagWritten) {
pSerializer->endElementNS( XML_w, tag );
}
}
void DocxAttributeOutput::TableCellProperties( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
m_pSerializer->startElementNS( XML_w, XML_tcPr, FSEND );
const SwTableBox *pTblBox = pTableTextNodeInfoInner->getTableBox( );
bool bEcma = GetExport().GetFilter().getVersion( ) == oox::core::ECMA_DIALECT;
// Cell prefered width
SwTwips nWidth = GetGridCols( pTableTextNodeInfoInner )->at( pTableTextNodeInfoInner->getCell() );
if ( pTableTextNodeInfoInner->getCell() )
nWidth = nWidth - GetGridCols( pTableTextNodeInfoInner )->at( pTableTextNodeInfoInner->getCell() - 1 );
m_pSerializer->singleElementNS( XML_w, XML_tcW,
FSNS( XML_w, XML_w ), OString::valueOf( sal_Int32( nWidth ) ).getStr( ),
FSNS( XML_w, XML_type ), "dxa",
FSEND );
// Horizontal spans
const SwWriteTableRows& aRows = m_pTableWrt->GetRows( );
SwWriteTableRow *pRow = aRows[ pTableTextNodeInfoInner->getRow( ) ];
const SwWriteTableCell *pCell = &pRow->GetCells( )[ pTableTextNodeInfoInner->getCell( ) ];
sal_uInt16 nColSpan = pCell->GetColSpan();
if ( nColSpan > 1 )
m_pSerializer->singleElementNS( XML_w, XML_gridSpan,
FSNS( XML_w, XML_val ), OString::valueOf( sal_Int32( nColSpan ) ).getStr(),
FSEND );
// Vertical merges
long vSpan = pTblBox->getRowSpan( );
if ( vSpan > 1 )
{
m_pSerializer->singleElementNS( XML_w, XML_vMerge,
FSNS( XML_w, XML_val ), "restart",
FSEND );
}
else if ( vSpan < 0 )
{
m_pSerializer->singleElementNS( XML_w, XML_vMerge,
FSNS( XML_w, XML_val ), "continue",
FSEND );
}
const SvxBoxItem& rBox = pTblBox->GetFrmFmt( )->GetBox( );
const SvxBoxItem& rDefaultBox = (*tableFirstCells.rbegin())->getTableBox( )->GetFrmFmt( )->GetBox( );
{
// The cell borders
impl_pageBorders( m_pSerializer, rBox, XML_tcBorders, !bEcma, true, &rDefaultBox );
}
TableBackgrounds( pTableTextNodeInfoInner );
{
// Cell margins
impl_cellMargins( m_pSerializer, rBox, XML_tcMar, !bEcma, &rDefaultBox );
}
TableVerticalCell( pTableTextNodeInfoInner );
m_pSerializer->endElementNS( XML_w, XML_tcPr );
}
void DocxAttributeOutput::InitTableHelper( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
sal_uInt32 nPageSize = 0;
bool bRelBoxSize = false;
// Create the SwWriteTable instance to use col spans (and maybe other infos)
GetTablePageSize( pTableTextNodeInfoInner.get(), nPageSize, bRelBoxSize );
const SwTable* pTable = pTableTextNodeInfoInner->getTable( );
const SwFrmFmt *pFmt = pTable->GetFrmFmt( );
SwTwips nTblSz = pFmt->GetFrmSize( ).GetWidth( );
const SwHTMLTableLayout *pLayout = pTable->GetHTMLTableLayout();
if( pLayout && pLayout->IsExportable() )
m_pTableWrt = new SwWriteTable( pLayout );
else
m_pTableWrt = new SwWriteTable( pTable->GetTabLines(), (sal_uInt16)nPageSize,
(sal_uInt16)nTblSz, false);
}
void DocxAttributeOutput::StartTable( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
m_pSerializer->startElementNS( XML_w, XML_tbl, FSEND );
tableFirstCells.push_back(pTableTextNodeInfoInner);
InitTableHelper( pTableTextNodeInfoInner );
TableDefinition( pTableTextNodeInfoInner );
}
void DocxAttributeOutput::EndTable()
{
m_pSerializer->endElementNS( XML_w, XML_tbl );
if ( m_nTableDepth > 0 )
--m_nTableDepth;
tableFirstCells.pop_back();
// We closed the table; if it is a nested table, the cell that contains it
// still continues
m_bTableCellOpen = true;
// Cleans the table helper
delete m_pTableWrt, m_pTableWrt = NULL;
}
void DocxAttributeOutput::StartTableRow( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
m_pSerializer->startElementNS( XML_w, XML_tr, FSEND );
// Output the row properties
m_pSerializer->startElementNS( XML_w, XML_trPr, FSEND );
// Header row: tblHeader
const SwTable *pTable = pTableTextNodeInfoInner->getTable( );
if ( pTable->GetRowsToRepeat( ) > pTableTextNodeInfoInner->getRow( ) )
m_pSerializer->singleElementNS( XML_w, XML_tblHeader,
FSNS( XML_w, XML_val ), "true",
FSEND );
TableHeight( pTableTextNodeInfoInner );
TableCanSplit( pTableTextNodeInfoInner );
m_pSerializer->endElementNS( XML_w, XML_trPr );
}
void DocxAttributeOutput::EndTableRow( )
{
m_pSerializer->endElementNS( XML_w, XML_tr );
}
void DocxAttributeOutput::StartTableCell( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
if ( !m_pTableWrt )
InitTableHelper( pTableTextNodeInfoInner );
m_pSerializer->startElementNS( XML_w, XML_tc, FSEND );
// Write the cell properties here
TableCellProperties( pTableTextNodeInfoInner );
m_bTableCellOpen = true;
}
void DocxAttributeOutput::EndTableCell( )
{
m_pSerializer->endElementNS( XML_w, XML_tc );
m_bTableCellOpen = false;
}
void DocxAttributeOutput::TableInfoCell( ww8::WW8TableNodeInfoInner::Pointer_t /*pTableTextNodeInfoInner*/ )
{
}
void DocxAttributeOutput::TableInfoRow( ww8::WW8TableNodeInfoInner::Pointer_t /*pTableTextNodeInfo*/ )
{
}
void DocxAttributeOutput::TableDefinition( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
bool bEcma = GetExport().GetFilter().getVersion( ) == oox::core::ECMA_DIALECT;
// Write the table properties
m_pSerializer->startElementNS( XML_w, XML_tblPr, FSEND );
static const sal_Int32 aOrder[] =
{
FSNS( XML_w, XML_tblStyle ),
FSNS( XML_w, XML_tblpPr ),
FSNS( XML_w, XML_tblOverlap ),
FSNS( XML_w, XML_bidiVisual ),
FSNS( XML_w, XML_tblStyleRowBandSize ),
FSNS( XML_w, XML_tblStyleColBandSize ),
FSNS( XML_w, XML_tblW ),
FSNS( XML_w, XML_jc ),
FSNS( XML_w, XML_tblCellSpacing ),
FSNS( XML_w, XML_tblInd ),
FSNS( XML_w, XML_tblBorders ),
FSNS( XML_w, XML_shd ),
FSNS( XML_w, XML_tblLayout ),
FSNS( XML_w, XML_tblCellMar ),
FSNS( XML_w, XML_tblLook ),
FSNS( XML_w, XML_tblPrChange )
};
// postpone the output so that we can later []
// prepend the properties before the run
sal_Int32 len = sizeof ( aOrder ) / sizeof( sal_Int32 );
uno::Sequence< sal_Int32 > aSeqOrder( len );
for ( sal_Int32 i = 0; i < len; i++ )
aSeqOrder[i] = aOrder[i];
m_pSerializer->mark( aSeqOrder );
sal_uInt32 nPageSize = 0;
bool bRelBoxSize = false;
// Create the SwWriteTable instance to use col spans (and maybe other infos)
GetTablePageSize( pTableTextNodeInfoInner.get(), nPageSize, bRelBoxSize );
// Output the table prefered width
if ( nPageSize != 0 )
m_pSerializer->singleElementNS( XML_w, XML_tblW,
FSNS( XML_w, XML_w ), OString::valueOf( sal_Int32( nPageSize ) ).getStr( ),
FSNS( XML_w, XML_type ), "dxa",
FSEND );
// Output the table alignement
const SwTable *pTable = pTableTextNodeInfoInner->getTable();
SwFrmFmt *pTblFmt = pTable->GetFrmFmt( );
const char* pJcVal;
sal_Int32 nIndent = 0;
switch ( pTblFmt->GetHoriOrient( ).GetHoriOrient( ) )
{
case text::HoriOrientation::CENTER:
pJcVal = "center";
break;
case text::HoriOrientation::RIGHT:
if ( bEcma )
pJcVal = "right";
else
pJcVal = "end";
break;
default:
case text::HoriOrientation::NONE:
case text::HoriOrientation::LEFT_AND_WIDTH:
{
if ( bEcma )
pJcVal = "left";
else
pJcVal = "start";
nIndent = sal_Int32( pTblFmt->GetLRSpace( ).GetLeft( ) );
break;
}
}
m_pSerializer->singleElementNS( XML_w, XML_jc,
FSNS( XML_w, XML_val ), pJcVal,
FSEND );
// Output the table borders
TableDefaultBorders( pTableTextNodeInfoInner );
// Output the default cell margins
TableDefaultCellMargins( pTableTextNodeInfoInner, nIndent );
TableBidi( pTableTextNodeInfoInner );
// Table indent (need to get written even if == 0)
m_pSerializer->singleElementNS( XML_w, XML_tblInd,
FSNS( XML_w, XML_w ), OString::valueOf( nIndent ).getStr( ),
FSNS( XML_w, XML_type ), "dxa",
FSEND );
// Merge the marks for the ordered elements
m_pSerializer->mergeTopMarks( );
m_pSerializer->endElementNS( XML_w, XML_tblPr );
// Write the table grid infos
m_pSerializer->startElementNS( XML_w, XML_tblGrid, FSEND );
sal_Int32 nPrv = 0;
ww8::GridColsPtr pGridCols = GetGridCols( pTableTextNodeInfoInner );
for ( ww8::GridCols::const_iterator it = pGridCols->begin(); it != pGridCols->end(); ++it )
{
sal_Int32 nWidth = sal_Int32( *it ) - nPrv;
m_pSerializer->singleElementNS( XML_w, XML_gridCol,
FSNS( XML_w, XML_w ), OString::valueOf( nWidth ).getStr( ),
FSEND );
nPrv = sal_Int32( *it );
}
m_pSerializer->endElementNS( XML_w, XML_tblGrid );
}
void DocxAttributeOutput::TableDefaultBorders( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
const SwTableBox * pTabBox = pTableTextNodeInfoInner->getTableBox();
const SwFrmFmt * pFrmFmt = pTabBox->GetFrmFmt();
bool bEcma = GetExport().GetFilter().getVersion( ) == oox::core::ECMA_DIALECT;
// the defaults of the table are taken from the top-left cell
impl_pageBorders( m_pSerializer, pFrmFmt->GetBox( ), XML_tblBorders, !bEcma, true );
}
void DocxAttributeOutput::TableDefaultCellMargins( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner, sal_Int32& tblIndent )
{
const SwTableBox * pTabBox = pTableTextNodeInfoInner->getTableBox();
const SwFrmFmt * pFrmFmt = pTabBox->GetFrmFmt();
const SvxBoxItem& rBox = pFrmFmt->GetBox( );
const bool bEcma = GetExport().GetFilter().getVersion( ) == oox::core::ECMA_DIALECT;
impl_cellMargins(m_pSerializer, rBox, XML_tblCellMar, !bEcma);
// add table cell left margin to tblIndent
tblIndent += sal_Int32( rBox.GetDistance( BOX_LINE_LEFT ) );
}
void DocxAttributeOutput::TableBackgrounds( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
const SwTableBox *pTblBox = pTableTextNodeInfoInner->getTableBox( );
const SwFrmFmt *pFmt = pTblBox->GetFrmFmt( );
const SfxPoolItem *pI = NULL;
Color aColor;
if ( SFX_ITEM_ON == pFmt->GetAttrSet().GetItemState( RES_BACKGROUND, false, &pI ) )
aColor = dynamic_cast<const SvxBrushItem *>(pI)->GetColor();
else
aColor = COL_AUTO;
OString sColor = impl_ConvertColor( aColor );
m_pSerializer->singleElementNS( XML_w, XML_shd,
FSNS( XML_w, XML_fill ), sColor.getStr( ),
FSNS( XML_w, XML_val ), "clear",
FSEND );
}
void DocxAttributeOutput::TableHeight( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
const SwTableBox * pTabBox = pTableTextNodeInfoInner->getTableBox();
const SwTableLine * pTabLine = pTabBox->GetUpper();
const SwFrmFmt * pLineFmt = pTabLine->GetFrmFmt();
const SwFmtFrmSize& rLSz = pLineFmt->GetFrmSize();
if ( ATT_VAR_SIZE != rLSz.GetHeightSizeType() && rLSz.GetHeight() )
{
sal_Int32 nHeight = rLSz.GetHeight();
const char *pRule = NULL;
switch ( rLSz.GetHeightSizeType() )
{
case ATT_FIX_SIZE: pRule = "exact"; break;
case ATT_MIN_SIZE: pRule = "atLeast"; break;
default: break;
}
if ( pRule )
m_pSerializer->singleElementNS( XML_w, XML_trHeight,
FSNS( XML_w, XML_val ), OString::valueOf( nHeight ).getStr( ),
FSNS( XML_w, XML_hRule ), pRule,
FSEND );
}
}
void DocxAttributeOutput::TableCanSplit( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
const SwTableBox * pTabBox = pTableTextNodeInfoInner->getTableBox();
const SwTableLine * pTabLine = pTabBox->GetUpper();
const SwFrmFmt * pLineFmt = pTabLine->GetFrmFmt();
const SwFmtRowSplit& rSplittable = pLineFmt->GetRowSplit( );
const char* pCantSplit = ( !rSplittable.GetValue( ) ) ? "true" : "false";
m_pSerializer->singleElementNS( XML_w, XML_cantSplit,
FSNS( XML_w, XML_val ), pCantSplit,
FSEND );
}
void DocxAttributeOutput::TableBidi( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
const SwTable * pTable = pTableTextNodeInfoInner->getTable();
const SwFrmFmt * pFrmFmt = pTable->GetFrmFmt();
if ( m_rExport.TrueFrameDirection( *pFrmFmt ) == FRMDIR_HORI_RIGHT_TOP )
{
m_pSerializer->singleElementNS( XML_w, XML_bidiVisual,
FSNS( XML_w, XML_val ), "true",
FSEND );
}
}
void DocxAttributeOutput::TableVerticalCell( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )
{
const SwTableBox * pTabBox = pTableTextNodeInfoInner->getTableBox();
const SwFrmFmt *pFrmFmt = pTabBox->GetFrmFmt( );
if ( FRMDIR_VERT_TOP_RIGHT == m_rExport.TrueFrameDirection( *pFrmFmt ) )
m_pSerializer->singleElementNS( XML_w, XML_textDirection,
FSNS( XML_w, XML_val ), "tbRl",
FSEND );
const SwWriteTableRows& aRows = m_pTableWrt->GetRows( );
SwWriteTableRow *pRow = aRows[ pTableTextNodeInfoInner->getRow( ) ];
const SwWriteTableCell *pCell = &pRow->GetCells( )[ pTableTextNodeInfoInner->getCell( ) ];
switch( pCell->GetVertOri())
{
case text::VertOrientation::TOP:
break;
case text::VertOrientation::CENTER:
m_pSerializer->singleElementNS( XML_w, XML_vAlign,
FSNS( XML_w, XML_val ), "center", FSEND );
break;
case text::VertOrientation::BOTTOM:
m_pSerializer->singleElementNS( XML_w, XML_vAlign,
FSNS( XML_w, XML_val ), "bottom", FSEND );
break;
}
}
void DocxAttributeOutput::TableNodeInfo( ww8::WW8TableNodeInfo::Pointer_t /*pNodeInfo*/ )
{
OSL_TRACE( "TODO: DocxAttributeOutput::TableNodeInfo( ww8::WW8TableNodeInfo::Pointer_t pNodeInfo )" );
}
void DocxAttributeOutput::TableNodeInfoInner( ww8::WW8TableNodeInfoInner::Pointer_t pNodeInfoInner )
{
// This is called when the nested table ends in a cell, and there's no
// paragraph benhind that; so we must check for the ends of cell, rows,
// tables
// ['true' to write an empty paragraph, MS Word insists on that]
FinishTableRowCell( pNodeInfoInner, true );
}
void DocxAttributeOutput::TableOrientation( ww8::WW8TableNodeInfoInner::Pointer_t /*pTableTextNodeInfoInner*/ )
{
OSL_TRACE( "TODO: DocxAttributeOutput::TableOrientation( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )" );
}
void DocxAttributeOutput::TableSpacing( ww8::WW8TableNodeInfoInner::Pointer_t /*pTableTextNodeInfoInner*/ )
{
#if OSL_DEBUG_LEVEL > 1
fprintf( stderr, "TODO: DocxAttributeOutput::TableSpacing( ww8::WW8TableNodeInfoInner::Pointer_t pTableTextNodeInfoInner )\n" );
#endif
}
void DocxAttributeOutput::TableRowEnd( sal_uInt32 /*nDepth*/ )
{
OSL_TRACE( "TODO: DocxAttributeOutput::TableRowEnd( sal_uInt32 nDepth = 1 )" );
}
void DocxAttributeOutput::StartStyles()
{
m_pSerializer->startElementNS( XML_w, XML_styles,
FSNS( XML_xmlns, XML_w ), "http://schemas.openxmlformats.org/wordprocessingml/2006/main",
FSEND );
}
void DocxAttributeOutput::EndStyles( sal_uInt16 /*nNumberOfStyles*/ )
{
m_pSerializer->endElementNS( XML_w, XML_styles );
}
void DocxAttributeOutput::DefaultStyle( sal_uInt16 nStyle )
{
// are these the values of enum ww::sti (see ../inc/wwstyles.hxx)?
#if OSL_DEBUG_LEVEL > 1
OSL_TRACE( "TODO DocxAttributeOutput::DefaultStyle( sal_uInt16 nStyle )- %d", nStyle );
#else
(void) nStyle; // to quiet the warning
#endif
}
void DocxAttributeOutput::FlyFrameGraphic( const SwGrfNode* pGrfNode, const Size& rSize, const SwFlyFrmFmt* pOLEFrmFmt, SwOLENode* pOLENode )
{
OSL_TRACE( "TODO DocxAttributeOutput::FlyFrameGraphic( const SwGrfNode* pGrfNode, const Size& rSize, const SwFlyFrmFmt* pOLEFrmFmt, SwOLENode* pOLENode ) - some stuff still missing" );
// detect mis-use of the API
assert(pGrfNode || (pOLEFrmFmt && pOLENode));
const SwFrmFmt* pFrmFmt = pGrfNode ? pGrfNode->GetFlyFmt() : pOLEFrmFmt;
// create the relation ID
OString aRelId;
sal_Int32 nImageType;
if ( pGrfNode && pGrfNode->IsLinkedFile() )
{
// linked image, just create the relation
String aFileName;
pGrfNode->GetFileFilterNms( &aFileName, 0 );
// TODO Convert the file name to relative for better interoperability
aRelId = m_rExport.AddRelation(
S( "http://schemas.openxmlformats.org/officeDocument/2006/relationships/image" ),
OUString( aFileName ) );
nImageType = XML_link;
}
else
{
// inline, we also have to write the image itself
Graphic* pGraphic = 0;
if (pGrfNode)
pGraphic = &const_cast< Graphic& >( pGrfNode->GetGrf() );
else
pGraphic = pOLENode->GetGraphic();
m_rDrawingML.SetFS( m_pSerializer ); // to be sure that we write to the right stream
OUString aImageId = m_rDrawingML.WriteImage( *pGraphic );
aRelId = OUStringToOString( aImageId, RTL_TEXTENCODING_UTF8 );
nImageType = XML_embed;
}
if ( aRelId.isEmpty() )
return;
m_pSerializer->startElementNS( XML_w, XML_drawing,
FSEND );
bool isAnchor = pFrmFmt->GetAnchor().GetAnchorId() != FLY_AS_CHAR;
if( isAnchor )
{
::sax_fastparser::FastAttributeList* attrList = m_pSerializer->createAttrList();
attrList->add( XML_behindDoc, pFrmFmt->GetOpaque().GetValue() ? "0" : "1" );
attrList->add( XML_distT, "0" );
attrList->add( XML_distB, "0" );
attrList->add( XML_distL, "0" );
attrList->add( XML_distR, "0" );
attrList->add( XML_simplePos, "0" );
attrList->add( XML_locked, "0" );
attrList->add( XML_layoutInCell, "1" );
attrList->add( XML_allowOverlap, "1" ); // TODO
if( const SdrObject* pObj = pFrmFmt->FindRealSdrObject())
attrList->add( XML_relativeHeight, OString::valueOf( sal_Int32( pObj->GetOrdNum())));
m_pSerializer->startElementNS( XML_wp, XML_anchor, XFastAttributeListRef( attrList ));
m_pSerializer->singleElementNS( XML_wp, XML_simplePos, XML_x, "0", XML_y, "0", FSEND ); // required, unused
const char* relativeFromH;
const char* relativeFromV;
switch( pFrmFmt->GetAnchor().GetAnchorId())
{
case FLY_AT_PAGE:
relativeFromV = relativeFromH = "page";
break;
case FLY_AT_PARA:
relativeFromH = "column";
relativeFromV = "paragraph";
break;
case FLY_AT_CHAR:
default:
relativeFromH = "character";
relativeFromV = "line";
break;
};
Point pos( 0, 0 );
if( const SwFlyFrmFmt* flyfmt = dynamic_cast<const SwFlyFrmFmt*>(pFrmFmt)) // TODO is always true?
pos = flyfmt->GetAnchoredObj()->GetCurrRelPos();
OString x( OString::valueOf( TwipsToEMU( pos.X())));
OString y( OString::valueOf( TwipsToEMU( pos.Y())));
m_pSerializer->startElementNS( XML_wp, XML_positionH, XML_relativeFrom, relativeFromH, FSEND );
m_pSerializer->startElementNS( XML_wp, XML_posOffset, FSEND );
m_pSerializer->write( x.getStr() );
m_pSerializer->endElementNS( XML_wp, XML_posOffset );
m_pSerializer->endElementNS( XML_wp, XML_positionH );
m_pSerializer->startElementNS( XML_wp, XML_positionV, XML_relativeFrom, relativeFromV, FSEND );
m_pSerializer->startElementNS( XML_wp, XML_posOffset, FSEND );
m_pSerializer->write( y.getStr() );
m_pSerializer->endElementNS( XML_wp, XML_posOffset );
m_pSerializer->endElementNS( XML_wp, XML_positionV );
}
else
{
m_pSerializer->startElementNS( XML_wp, XML_inline,
XML_distT, "0", XML_distB, "0", XML_distL, "0", XML_distR, "0",
FSEND );
}
// now the common parts
// extent of the image
OString aWidth( OString::valueOf( TwipsToEMU( rSize.Width() ) ) );
OString aHeight( OString::valueOf( TwipsToEMU( rSize.Height() ) ) );
m_pSerializer->singleElementNS( XML_wp, XML_extent,
XML_cx, aWidth.getStr(),
XML_cy, aHeight.getStr(),
FSEND );
// TODO - the right effectExtent, extent including the effect
m_pSerializer->singleElementNS( XML_wp, XML_effectExtent,
XML_l, "0", XML_t, "0", XML_r, "0", XML_b, "0",
FSEND );
if( isAnchor )
{
switch( pFrmFmt->GetSurround().GetValue())
{
case SURROUND_NONE:
m_pSerializer->singleElementNS( XML_wp, XML_wrapTopAndBottom, FSEND );
break;
case SURROUND_THROUGHT:
m_pSerializer->singleElementNS( XML_wp, XML_wrapNone, FSEND );
break;
case SURROUND_PARALLEL:
m_pSerializer->singleElementNS( XML_wp, XML_wrapSquare,
XML_wrapText, "bothSides", FSEND );
break;
case SURROUND_IDEAL:
default:
m_pSerializer->singleElementNS( XML_wp, XML_wrapSquare,
XML_wrapText, "largest", FSEND );
break;
}
}
// picture description (used for pic:cNvPr later too)
::sax_fastparser::FastAttributeList* docPrattrList = m_pSerializer->createAttrList();
docPrattrList->add( XML_id, OString::valueOf( sal_Int32( m_anchorId++ )).getStr());
docPrattrList->add( XML_name, "Picture" );
docPrattrList->add( XML_descr, OUStringToOString( pGrfNode ? pGrfNode->GetDescription() : pOLEFrmFmt->GetObjDescription(), RTL_TEXTENCODING_UTF8 ).getStr());
if( GetExport().GetFilter().getVersion( ) != oox::core::ECMA_DIALECT )
docPrattrList->add( XML_title, OUStringToOString( pGrfNode ? pGrfNode->GetTitle() : pOLEFrmFmt->GetObjTitle(), RTL_TEXTENCODING_UTF8 ).getStr());
XFastAttributeListRef docPrAttrListRef( docPrattrList );
m_pSerializer->startElementNS( XML_wp, XML_docPr, docPrAttrListRef );
// TODO hyperlink
// m_pSerializer->singleElementNS( XML_a, XML_hlinkClick,
// FSNS( XML_xmlns, XML_a ), "http://schemas.openxmlformats.org/drawingml/2006/main",
// FSNS( XML_r, XML_id ), "rId4",
// FSEND );
m_pSerializer->endElementNS( XML_wp, XML_docPr );
m_pSerializer->startElementNS( XML_wp, XML_cNvGraphicFramePr,
FSEND );
// TODO change aspect?
m_pSerializer->singleElementNS( XML_a, XML_graphicFrameLocks,
FSNS( XML_xmlns, XML_a ), "http://schemas.openxmlformats.org/drawingml/2006/main",
XML_noChangeAspect, "1",
FSEND );
m_pSerializer->endElementNS( XML_wp, XML_cNvGraphicFramePr );
m_pSerializer->startElementNS( XML_a, XML_graphic,
FSNS( XML_xmlns, XML_a ), "http://schemas.openxmlformats.org/drawingml/2006/main",
FSEND );
m_pSerializer->startElementNS( XML_a, XML_graphicData,
XML_uri, "http://schemas.openxmlformats.org/drawingml/2006/picture",
FSEND );
m_pSerializer->startElementNS( XML_pic, XML_pic,
FSNS( XML_xmlns, XML_pic ), "http://schemas.openxmlformats.org/drawingml/2006/picture",
FSEND );
m_pSerializer->startElementNS( XML_pic, XML_nvPicPr,
FSEND );
// It seems pic:cNvpr and wp:docPr are pretty much the same thing with the same attributes
m_pSerializer->startElementNS( XML_pic, XML_cNvPr, docPrAttrListRef );
// TODO hyperlink
// m_pSerializer->singleElementNS( XML_a, XML_hlinkClick,
// FSNS( XML_r, XML_id ), "rId4",
// FSEND );
m_pSerializer->endElementNS( XML_pic, XML_cNvPr );
m_pSerializer->startElementNS( XML_pic, XML_cNvPicPr,
FSEND );
// TODO change aspect?
m_pSerializer->singleElementNS( XML_a, XML_picLocks,
XML_noChangeAspect, "1", XML_noChangeArrowheads, "1",
FSEND );
m_pSerializer->endElementNS( XML_pic, XML_cNvPicPr );
m_pSerializer->endElementNS( XML_pic, XML_nvPicPr );
// the actual picture
m_pSerializer->startElementNS( XML_pic, XML_blipFill,
FSEND );
m_pSerializer->singleElementNS( XML_a, XML_blip,
FSNS( XML_r, nImageType ), aRelId.getStr(),
FSEND );
m_pSerializer->singleElementNS( XML_a, XML_srcRect,
FSEND );
m_pSerializer->startElementNS( XML_a, XML_stretch,
FSEND );
m_pSerializer->singleElementNS( XML_a, XML_fillRect,
FSEND );
m_pSerializer->endElementNS( XML_a, XML_stretch );
m_pSerializer->endElementNS( XML_pic, XML_blipFill );
// TODO setup the right values below
m_pSerializer->startElementNS( XML_pic, XML_spPr,
XML_bwMode, "auto",
FSEND );
m_pSerializer->startElementNS( XML_a, XML_xfrm,
FSEND );
m_pSerializer->singleElementNS( XML_a, XML_off,
XML_x, "0", XML_y, "0",
FSEND );
m_pSerializer->singleElementNS( XML_a, XML_ext,
XML_cx, aWidth.getStr(),
XML_cy, aHeight.getStr(),
FSEND );
m_pSerializer->endElementNS( XML_a, XML_xfrm );
m_pSerializer->startElementNS( XML_a, XML_prstGeom,
XML_prst, "rect",
FSEND );
m_pSerializer->singleElementNS( XML_a, XML_avLst,
FSEND );
m_pSerializer->endElementNS( XML_a, XML_prstGeom );
m_pSerializer->singleElementNS( XML_a, XML_noFill,
FSEND );
m_pSerializer->startElementNS( XML_a, XML_ln,
XML_w, "9525",
FSEND );
m_pSerializer->singleElementNS( XML_a, XML_noFill,
FSEND );
m_pSerializer->singleElementNS( XML_a, XML_miter,
XML_lim, "800000",
FSEND );
m_pSerializer->singleElementNS( XML_a, XML_headEnd,
FSEND );
m_pSerializer->singleElementNS( XML_a, XML_tailEnd,
FSEND );
m_pSerializer->endElementNS( XML_a, XML_ln );
// Output effects
SvxShadowItem aShadowItem = pFrmFmt->GetShadow();
if ( aShadowItem.GetLocation() != SVX_SHADOW_NONE )
{
// Distance is measured diagonally from corner
double nShadowDist = sqrt((aShadowItem.GetWidth()*aShadowItem.GetWidth())*2.0);
OString aShadowDist( OString::valueOf( TwipsToEMU( nShadowDist ) ) );
OString aShadowColor = impl_ConvertColor( aShadowItem.GetColor() );
sal_uInt32 nShadowDir = 0;
switch ( aShadowItem.GetLocation() )
{
case SVX_SHADOW_TOPLEFT: nShadowDir = 13500000; break;
case SVX_SHADOW_TOPRIGHT: nShadowDir = 18900000; break;
case SVX_SHADOW_BOTTOMLEFT: nShadowDir = 8100000; break;
case SVX_SHADOW_BOTTOMRIGHT: nShadowDir = 2700000; break;
case SVX_SHADOW_NONE:
case SVX_SHADOW_END:
break;
}
OString aShadowDir( OString::valueOf( long(nShadowDir) ) );
m_pSerializer->startElementNS( XML_a, XML_effectLst, FSEND );
m_pSerializer->startElementNS( XML_a, XML_outerShdw,
XML_dist, aShadowDist.getStr(),
XML_dir, aShadowDir.getStr(), FSEND );
m_pSerializer->singleElementNS( XML_a, XML_srgbClr,
XML_val, aShadowColor.getStr(), FSEND );
m_pSerializer->endElementNS( XML_a, XML_outerShdw );
m_pSerializer->endElementNS( XML_a, XML_effectLst );
}
m_pSerializer->endElementNS( XML_pic, XML_spPr );
m_pSerializer->endElementNS( XML_pic, XML_pic );
m_pSerializer->endElementNS( XML_a, XML_graphicData );
m_pSerializer->endElementNS( XML_a, XML_graphic );
m_pSerializer->endElementNS( XML_wp, isAnchor ? XML_anchor : XML_inline );
m_pSerializer->endElementNS( XML_w, XML_drawing );
}
void DocxAttributeOutput::WriteOLE2Obj( const SdrObject* pSdrObj, SwOLENode& rOLENode, const Size& rSize, const SwFlyFrmFmt* pFlyFrmFmt )
{
if( WriteOLEChart( pSdrObj, rSize ))
return;
if( WriteOLEMath( pSdrObj, rOLENode, rSize ))
return;
// Then we fall back to just export the object as a graphic.
FlyFrameGraphic( 0, rSize, pFlyFrmFmt, &rOLENode );
}
bool DocxAttributeOutput::WriteOLEChart( const SdrObject* pSdrObj, const Size& rSize )
{
uno::Reference< chart2::XChartDocument > xChartDoc;
uno::Reference< drawing::XShape > xShape( ((SdrObject*)pSdrObj)->getUnoShape(), uno::UNO_QUERY );
if( xShape.is() )
{
uno::Reference< beans::XPropertySet > xPropSet( xShape, uno::UNO_QUERY );
if( xPropSet.is() )
xChartDoc.set( xPropSet->getPropertyValue( "Model" ), uno::UNO_QUERY );
}
if( xChartDoc.is() )
{
OSL_TRACE("DocxAttributeOutput::WriteOLE2Obj: export chart ");
m_pSerializer->startElementNS( XML_w, XML_drawing,
FSEND );
m_pSerializer->startElementNS( XML_wp, XML_inline,
XML_distT, "0", XML_distB, "0", XML_distL, "0", XML_distR, "0",
FSEND );
OString aWidth( OString::valueOf( TwipsToEMU( rSize.Width() ) ) );
OString aHeight( OString::valueOf( TwipsToEMU( rSize.Height() ) ) );
m_pSerializer->singleElementNS( XML_wp, XML_extent,
XML_cx, aWidth.getStr(),
XML_cy, aHeight.getStr(),
FSEND );
// TODO - the right effectExtent, extent including the effect
m_pSerializer->singleElementNS( XML_wp, XML_effectExtent,
XML_l, "0", XML_t, "0", XML_r, "0", XML_b, "0",
FSEND );
// should get the unique id
sal_Int32 nID = 1;
OUString sName("Object 1");
uno::Reference< container::XNamed > xNamed( xShape, uno::UNO_QUERY );
if( xNamed.is() )
sName = xNamed->getName();
m_pSerializer->singleElementNS( XML_wp, XML_docPr,
XML_id, I32S( nID ),
XML_name, USS( sName ),
FSEND );
m_pSerializer->singleElementNS( XML_wp, XML_cNvGraphicFramePr,
FSEND );
m_pSerializer->startElementNS( XML_a, XML_graphic,
FSNS( XML_xmlns, XML_a ), "http://schemas.openxmlformats.org/drawingml/2006/main",
FSEND );
m_pSerializer->startElementNS( XML_a, XML_graphicData,
XML_uri, "http://schemas.openxmlformats.org/drawingml/2006/chart",
FSEND );
OString aRelId;
static sal_Int32 nChartCount = 0;
nChartCount++;
uno::Reference< frame::XModel > xModel( xChartDoc, uno::UNO_QUERY );
aRelId = m_rExport.OutputChart( xModel, nChartCount );
m_pSerializer->singleElementNS( XML_c, XML_chart,
FSNS( XML_xmlns, XML_c ), "http://schemas.openxmlformats.org/drawingml/2006/chart",
FSNS( XML_xmlns, XML_r ), "http://schemas.openxmlformats.org/officeDocument/2006/relationships",
FSNS( XML_r, XML_id ), aRelId.getStr(),
FSEND );
m_pSerializer->endElementNS( XML_a, XML_graphicData );
m_pSerializer->endElementNS( XML_a, XML_graphic );
m_pSerializer->endElementNS( XML_wp, XML_inline );
m_pSerializer->endElementNS( XML_w, XML_drawing );
return true;
}
return false;
}
bool DocxAttributeOutput::WriteOLEMath( const SdrObject*, const SwOLENode& rOLENode, const Size& )
{
uno::Reference < embed::XEmbeddedObject > xObj(const_cast<SwOLENode&>(rOLENode).GetOLEObj().GetOleRef());
sal_Int64 nAspect = rOLENode.GetAspect();
svt::EmbeddedObjectRef aObjRef( xObj, nAspect );
SvGlobalName aObjName(aObjRef->getClassID());
if( !SotExchange::IsMath(aObjName) )
return false;
assert( m_postponedMath == NULL ); // make it a list if there can be more inside one run
m_postponedMath = &rOLENode;
return true;
}
void DocxAttributeOutput::WritePostponedMath()
{
if( m_postponedMath == NULL )
return;
uno::Reference < embed::XEmbeddedObject > xObj(const_cast<SwOLENode*>(m_postponedMath)->GetOLEObj().GetOleRef());
uno::Reference< uno::XInterface > xInterface( xObj->getComponent(), uno::UNO_QUERY );
// gcc4.4 (and 4.3 and possibly older) have a problem with dynamic_cast directly to the target class,
// so help it with an intermediate cast. I'm not sure what exactly the problem is, seems to be unrelated
// to RTLD_GLOBAL, so most probably a gcc bug.
oox::FormulaExportBase* formulaexport = dynamic_cast<oox::FormulaExportBase*>(dynamic_cast<SfxBaseModel*>(xInterface.get()));
assert( formulaexport != NULL );
formulaexport->writeFormulaOoxml( m_pSerializer, GetExport().GetFilter().getVersion());
m_postponedMath = NULL;
}
void DocxAttributeOutput::OutputFlyFrame_Impl( const sw::Frame &rFrame, const Point& /*rNdTopLeft*/ )
{
m_pSerializer->mark();
switch ( rFrame.GetWriterType() )
{
case sw::Frame::eGraphic:
{
const SwNode *pNode = rFrame.GetContent();
const SwGrfNode *pGrfNode = pNode ? pNode->GetGrfNode() : 0;
if ( pGrfNode )
{
if( m_postponedGraphic == NULL )
FlyFrameGraphic( pGrfNode, rFrame.GetLayoutSize() );
else // we are writting out attributes, but w:drawing should not be inside w:rPr,
{ // so write it out later
m_postponedGraphic->push_back( PostponedGraphic( pGrfNode, rFrame.GetLayoutSize()));
}
}
}
break;
case sw::Frame::eDrawing:
{
const SdrObject* pSdrObj = rFrame.GetFrmFmt().FindRealSdrObject();
if ( pSdrObj )
{
bool bSwapInPage = false;
if ( !pSdrObj->GetPage() )
{
if ( SdrModel* pModel = m_rExport.pDoc->GetDrawModel() )
{
if ( SdrPage *pPage = pModel->GetPage( 0 ) )
{
bSwapInPage = true;
const_cast< SdrObject* >( pSdrObj )->SetPage( pPage );
}
}
}
m_pSerializer->startElementNS( XML_w, XML_pict,
FSEND );
m_rExport.VMLExporter().AddSdrObject( *pSdrObj );
m_pSerializer->endElementNS( XML_w, XML_pict );
if ( bSwapInPage )
const_cast< SdrObject* >( pSdrObj )->SetPage( 0 );
}
}
break;
case sw::Frame::eTxtBox:
{
// The frame output is postponed to the end of the anchor paragraph
m_pParentFrame = new sw::Frame(rFrame);
}
break;
case sw::Frame::eOle:
{
const SwFrmFmt &rFrmFmt = rFrame.GetFrmFmt();
const SdrObject *pSdrObj = rFrmFmt.FindRealSdrObject();
if ( pSdrObj )
{
SwNodeIndex aIdx(*rFrmFmt.GetCntnt().GetCntntIdx(), 1);
SwOLENode& rOLENd = *aIdx.GetNode().GetOLENode();
WriteOLE2Obj( pSdrObj, rOLENd, rFrame.GetLayoutSize(), dynamic_cast<const SwFlyFrmFmt*>( &rFrmFmt ));
}
}
break;
default:
OSL_TRACE( "TODO DocxAttributeOutput::OutputFlyFrame_Impl( const sw::Frame& rFrame, const Point& rNdTopLeft ) - frame type '%s'\n",
rFrame.GetWriterType() == sw::Frame::eTxtBox? "eTxtBox":
( rFrame.GetWriterType() == sw::Frame::eOle? "eOle":
( rFrame.GetWriterType() == sw::Frame::eFormControl? "eFormControl": "???" ) ) );
break;
}
m_pSerializer->mergeTopMarks( sax_fastparser::MERGE_MARKS_POSTPONE );
}
void DocxAttributeOutput::WriteOutliner(const OutlinerParaObject& rParaObj)
{
const EditTextObject& rEditObj = rParaObj.GetTextObject();
MSWord_SdrAttrIter aAttrIter( m_rExport, rEditObj, TXT_HFTXTBOX );
sal_uInt16 nPara = rEditObj.GetParagraphCount();
m_pSerializer->startElementNS( XML_w, XML_textbox, FSEND );
m_pSerializer->startElementNS( XML_w, XML_txbxContent, FSEND );
for (sal_uInt16 n = 0; n < nPara; ++n)
{
if( n )
aAttrIter.NextPara( n );
String aStr( rEditObj.GetText( n ));
xub_StrLen nAktPos = 0;
xub_StrLen nEnd = aStr.Len();
m_pSerializer->startElementNS( XML_w, XML_p, FSEND );
do {
xub_StrLen nNextAttr = aAttrIter.WhereNext();
if( nNextAttr > nEnd )
nNextAttr = nEnd;
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
bool bTxtAtr = aAttrIter.IsTxtAttr( nAktPos );
if( !bTxtAtr )
{
String aOut( aStr.Copy( nAktPos, nNextAttr - nAktPos ) );
RunText(aOut);
}
m_pSerializer->endElementNS( XML_w, XML_r );
nAktPos = nNextAttr;
aAttrIter.NextPos();
}
while( nAktPos < nEnd );
m_pSerializer->endElementNS( XML_w, XML_p );
}
m_pSerializer->endElementNS( XML_w, XML_txbxContent );
m_pSerializer->endElementNS( XML_w, XML_textbox );
}
oox::drawingml::DrawingML& DocxAttributeOutput::GetDrawingML()
{
return m_rDrawingML;
}
void DocxAttributeOutput::StartStyle( const String& rName, bool bPapFmt,
sal_uInt16 nBase, sal_uInt16 nNext, sal_uInt16 /*nWwId*/, sal_uInt16 nId, bool bAutoUpdate )
{
OString aStyle( "style" );
m_pSerializer->startElementNS( XML_w, XML_style,
FSNS( XML_w, XML_type ), bPapFmt? "paragraph": "character", // FIXME is this correct?
FSNS( XML_w, XML_styleId ), ( aStyle + OString::valueOf( sal_Int32( nId ) ) ).getStr(),
FSEND );
m_pSerializer->singleElementNS( XML_w, XML_name,
FSNS( XML_w, XML_val ), OUStringToOString( OUString( rName ), RTL_TEXTENCODING_UTF8 ).getStr(),
FSEND );
if ( nBase != 0x0FFF )
{
m_pSerializer->singleElementNS( XML_w, XML_basedOn,
FSNS( XML_w, XML_val ), ( aStyle + OString::valueOf( sal_Int32( nBase ) ) ).getStr(),
FSEND );
}
m_pSerializer->singleElementNS( XML_w, XML_next,
FSNS( XML_w, XML_val ), ( aStyle + OString::valueOf( sal_Int32( nNext ) ) ).getStr(),
FSEND );
if ( bAutoUpdate )
m_pSerializer->singleElementNS( XML_w, XML_autoRedefine, FSEND );
}
void DocxAttributeOutput::EndStyle()
{
m_pSerializer->endElementNS( XML_w, XML_style );
}
void DocxAttributeOutput::StartStyleProperties( bool bParProp, sal_uInt16 /*nStyle*/ )
{
if ( bParProp )
{
m_pSerializer->startElementNS( XML_w, XML_pPr, FSEND );
InitCollectedParagraphProperties();
}
else
{
m_pSerializer->startElementNS( XML_w, XML_rPr, FSEND );
InitCollectedRunProperties();
}
}
void DocxAttributeOutput::EndStyleProperties( bool bParProp )
{
if ( bParProp )
{
WriteCollectedParagraphProperties();
m_pSerializer->endElementNS( XML_w, XML_pPr );
}
else
{
WriteCollectedRunProperties();
m_pSerializer->endElementNS( XML_w, XML_rPr );
}
}
void DocxAttributeOutput::OutlineNumbering( sal_uInt8 nLvl, const SwNumFmt& /*rNFmt*/, const SwFmt& /*rFmt*/ )
{
if ( nLvl >= WW8ListManager::nMaxLevel )
nLvl = WW8ListManager::nMaxLevel - 1;
m_pSerializer->singleElementNS( XML_w, XML_outlineLvl,
FSNS( XML_w, XML_val ), OString::valueOf( sal_Int32( nLvl ) ).getStr( ),
FSEND );
}
void DocxAttributeOutput::PageBreakBefore( bool bBreak )
{
if ( bBreak )
m_pSerializer->singleElementNS( XML_w, XML_pageBreakBefore, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_pageBreakBefore,
FSNS( XML_w, XML_val ), "false",
FSEND );
}
void DocxAttributeOutput::SectionBreak( sal_uInt8 nC, const WW8_SepInfo* pSectionInfo )
{
switch ( nC )
{
case msword::ColumnBreak:
// The column break should be output in the next paragraph...
m_nColBreakStatus = COLBRK_POSTPONE;
break;
case msword::PageBreak:
if ( pSectionInfo )
{
if ( !m_bParagraphOpened )
{
// Create a dummy paragraph if needed
m_pSerializer->startElementNS( XML_w, XML_p, FSEND );
m_pSerializer->startElementNS( XML_w, XML_pPr, FSEND );
m_rExport.SectionProperties( *pSectionInfo );
m_pSerializer->endElementNS( XML_w, XML_pPr );
m_pSerializer->endElementNS( XML_w, XML_p );
}
else
{
// postpone the output of this; it has to be done inside the
// paragraph properties, so remember it until then
m_pSectionInfo.reset( new WW8_SepInfo( *pSectionInfo ));
}
}
else
{
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_br,
FSNS( XML_w, XML_type ), "page", FSEND );
m_pSerializer->endElementNS( XML_w, XML_r );
}
break;
default:
OSL_TRACE( "Unknown section break to write: %d", nC );
break;
}
}
void DocxAttributeOutput::StartSection()
{
m_pSerializer->startElementNS( XML_w, XML_sectPr, FSEND );
m_bOpenedSectPr = true;
// Write the elements in the spec order
static const sal_Int32 aOrder[] =
{
FSNS( XML_w, XML_headerReference ),
FSNS( XML_w, XML_footerReference ),
FSNS( XML_w, XML_footnotePr ),
FSNS( XML_w, XML_endnotePr ),
FSNS( XML_w, XML_type ),
FSNS( XML_w, XML_pgSz ),
FSNS( XML_w, XML_pgMar ),
FSNS( XML_w, XML_paperSrc ),
FSNS( XML_w, XML_pgBorders ),
FSNS( XML_w, XML_lnNumType ),
FSNS( XML_w, XML_pgNumType ),
FSNS( XML_w, XML_cols ),
FSNS( XML_w, XML_formProt ),
FSNS( XML_w, XML_vAlign ),
FSNS( XML_w, XML_noEndnote ),
FSNS( XML_w, XML_titlePg ),
FSNS( XML_w, XML_textDirection ),
FSNS( XML_w, XML_bidi ),
FSNS( XML_w, XML_rtlGutter ),
FSNS( XML_w, XML_docGrid ),
FSNS( XML_w, XML_printerSettings ),
FSNS( XML_w, XML_sectPrChange )
};
// postpone the output so that we can later [in EndParagraphProperties()]
// prepend the properties before the run
sal_Int32 len = sizeof ( aOrder ) / sizeof( sal_Int32 );
uno::Sequence< sal_Int32 > aSeqOrder( len );
for ( sal_Int32 i = 0; i < len; i++ )
aSeqOrder[i] = aOrder[i];
m_pSerializer->mark( aSeqOrder );
}
void DocxAttributeOutput::EndSection()
{
// Write the section properties
if ( m_pSectionSpacingAttrList )
{
XFastAttributeListRef xAttrList( m_pSectionSpacingAttrList );
m_pSectionSpacingAttrList = NULL;
m_pSerializer->singleElementNS( XML_w, XML_pgMar, xAttrList );
}
// Order the elements
m_pSerializer->mergeTopMarks( );
m_pSerializer->endElementNS( XML_w, XML_sectPr );
m_bOpenedSectPr = false;
}
void DocxAttributeOutput::SectionFormProtection( bool bProtected )
{
if ( bProtected )
m_pSerializer->singleElementNS( XML_w, XML_formProt, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_formProt,
FSNS( XML_w, XML_val ), "false", FSEND );
}
void DocxAttributeOutput::SectionLineNumbering( sal_uLong nRestartNo, const SwLineNumberInfo& rLnNumInfo )
{
FastAttributeList* pAttr = m_pSerializer->createAttrList();
pAttr->add( FSNS( XML_w, XML_countBy ), OString::valueOf(static_cast<sal_Int32>(rLnNumInfo.GetCountBy())).getStr());
pAttr->add( FSNS( XML_w, XML_restart ), rLnNumInfo.IsRestartEachPage() ? "newPage" : "continuous" );
if( rLnNumInfo.GetPosFromLeft())
pAttr->add( FSNS( XML_w, XML_distance ), OString::valueOf(static_cast<sal_Int32>(rLnNumInfo.GetPosFromLeft())).getStr());
if( nRestartNo )
pAttr->add( FSNS( XML_w, XML_start ), OString::valueOf( long( nRestartNo )).getStr());
XFastAttributeListRef xAttrs( pAttr );
m_pSerializer->singleElementNS( XML_w, XML_lnNumType, xAttrs );
}
void DocxAttributeOutput::SectionTitlePage()
{
m_pSerializer->singleElementNS( XML_w, XML_titlePg, FSEND );
}
void DocxAttributeOutput::SectionPageBorders( const SwFrmFmt* pFmt, const SwFrmFmt* /*pFirstPageFmt*/ )
{
// Output the margins
const SvxBoxItem& rBox = pFmt->GetBox( );
const SvxBorderLine* pBottom = rBox.GetBottom( );
const SvxBorderLine* pTop = rBox.GetTop( );
const SvxBorderLine* pLeft = rBox.GetLeft( );
const SvxBorderLine* pRight = rBox.GetRight( );
if ( pBottom || pTop || pLeft || pRight )
{
// All distances are relative to the text margins
m_pSerializer->startElementNS( XML_w, XML_pgBorders,
FSNS( XML_w, XML_display ), "allPages",
FSNS( XML_w, XML_offsetFrom ), "text",
FSEND );
m_pSerializer->mark();
m_pSerializer->endElementNS( XML_w, XML_pgBorders );
m_pSerializer->mark();
}
}
void DocxAttributeOutput::SectionBiDi( bool bBiDi )
{
if ( bBiDi )
m_pSerializer->singleElementNS( XML_w, XML_bidi, FSEND );
}
static OString impl_NumberingType( sal_uInt16 nNumberingType )
{
OString aType;
switch ( nNumberingType )
{
case SVX_NUM_CHARS_UPPER_LETTER:
case SVX_NUM_CHARS_UPPER_LETTER_N: aType = "upperLetter"; break;
case SVX_NUM_CHARS_LOWER_LETTER:
case SVX_NUM_CHARS_LOWER_LETTER_N: aType = "lowerLetter"; break;
case SVX_NUM_ROMAN_UPPER: aType = "upperRoman"; break;
case SVX_NUM_ROMAN_LOWER: aType = "lowerRoman"; break;
case SVX_NUM_ARABIC: aType = "decimal"; break;
case SVX_NUM_BITMAP:
case SVX_NUM_CHAR_SPECIAL: aType = "bullet"; break;
default: aType = "none"; break;
}
return aType;
}
void DocxAttributeOutput::SectionPageNumbering( sal_uInt16 nNumType, sal_uInt16 nPageRestartNumber )
{
// FIXME Not called properly with page styles like "First Page"
FastAttributeList* pAttr = m_pSerializer->createAttrList();
// 0 means no restart: then don't output that attribute if 0
if ( nPageRestartNumber > 0 )
pAttr->add( FSNS( XML_w, XML_start ), OString::valueOf( sal_Int32( nPageRestartNumber ) ) );
// nNumType corresponds to w:fmt. See WW8Export::GetNumId() for more precisions
OString aFmt( impl_NumberingType( nNumType ) );
if ( !aFmt.isEmpty() )
pAttr->add( FSNS( XML_w, XML_fmt ), aFmt.getStr() );
XFastAttributeListRef xAttrs( pAttr );
m_pSerializer->singleElementNS( XML_w, XML_pgNumType, xAttrs );
// see 2.6.12 pgNumType (Page Numbering Settings)
OSL_TRACE( "TODO DocxAttributeOutput::SectionPageNumbering()" );
}
void DocxAttributeOutput::SectionType( sal_uInt8 nBreakCode )
{
/* break code: 0 No break, 1 New column
2 New page, 3 Even page, 4 Odd page
*/
const char* pType = NULL;
switch ( nBreakCode )
{
case 1: pType = "nextColumn"; break;
case 2: pType = "nextPage"; break;
case 3: pType = "evenPage"; break;
case 4: pType = "oddPage"; break;
default: pType = "continuous"; break;
}
if ( pType )
m_pSerializer->singleElementNS( XML_w, XML_type,
FSNS( XML_w, XML_val ), pType,
FSEND );
}
void DocxAttributeOutput::StartFont( const String& rFamilyName ) const
{
m_pSerializer->startElementNS( XML_w, XML_font,
FSNS( XML_w, XML_name ), OUStringToOString( OUString( rFamilyName ), RTL_TEXTENCODING_UTF8 ).getStr(),
FSEND );
}
void DocxAttributeOutput::EndFont() const
{
m_pSerializer->endElementNS( XML_w, XML_font );
}
void DocxAttributeOutput::FontAlternateName( const String& rName ) const
{
m_pSerializer->singleElementNS( XML_w, XML_altName,
FSNS( XML_w, XML_val ), OUStringToOString( OUString( rName ), RTL_TEXTENCODING_UTF8 ).getStr(),
FSEND );
}
void DocxAttributeOutput::FontCharset( sal_uInt8 nCharSet, rtl_TextEncoding nEncoding ) const
{
FastAttributeList* pAttr = m_pSerializer->createAttrList();
OString aCharSet( OString::valueOf( sal_Int32( nCharSet ), 16 ) );
if ( aCharSet.getLength() == 1 )
aCharSet = OString( "0" ) + aCharSet;
pAttr->add( FSNS( XML_w, XML_val ), aCharSet.getStr());
if( GetExport().GetFilter().getVersion( ) != oox::core::ECMA_DIALECT )
{
if( const char* charset = rtl_getMimeCharsetFromTextEncoding( nEncoding ))
pAttr->add( FSNS( XML_w, XML_characterSet ), charset );
}
m_pSerializer->singleElementNS( XML_w, XML_charset, XFastAttributeListRef( pAttr ));
}
void DocxAttributeOutput::FontFamilyType( FontFamily eFamily ) const
{
const char *pFamily = NULL;
switch ( eFamily )
{
case FAMILY_ROMAN: pFamily = "roman"; break;
case FAMILY_SWISS: pFamily = "swiss"; break;
case FAMILY_MODERN: pFamily = "modern"; break;
case FAMILY_SCRIPT: pFamily = "script"; break;
case FAMILY_DECORATIVE: pFamily = "decorative"; break;
default: pFamily = "auto"; break; // no font family
}
if ( pFamily )
m_pSerializer->singleElementNS( XML_w, XML_family,
FSNS( XML_w, XML_val ), pFamily,
FSEND );
}
void DocxAttributeOutput::FontPitchType( FontPitch ePitch ) const
{
const char *pPitch = NULL;
switch ( ePitch )
{
case PITCH_VARIABLE: pPitch = "variable"; break;
case PITCH_FIXED: pPitch = "fixed"; break;
default: pPitch = "default"; break; // no info about the pitch
}
if ( pPitch )
m_pSerializer->singleElementNS( XML_w, XML_pitch,
FSNS( XML_w, XML_val ), pPitch,
FSEND );
}
void DocxAttributeOutput::EmbedFont( const OUString& name )
{
if( !m_rExport.pDoc->get( IDocumentSettingAccess::EMBED_FONTS ))
return; // no font embedding with this document
EmbedFontStyle( name, XML_embedRegular, "" );
EmbedFontStyle( name, XML_embedBold, "b" );
EmbedFontStyle( name, XML_embedItalic, "i" );
EmbedFontStyle( name, XML_embedBoldItalic, "bi" );
}
static inline char toHexChar( int value )
{
return value >= 10 ? value + 'A' - 10 : value + '0';
}
void DocxAttributeOutput::EmbedFontStyle( const OUString& name, int tag, const char* style )
{
OUString fontUrl = TemporaryFonts::fileUrlForFont( name, style );
// If a temporary font file exists for this font, assume it was embedded
// and embed it again.
// TODO IDocumentSettingAccess::EMBED_SYSTEM_FONTS
osl::File file( fontUrl );
if( file.open( osl_File_OpenFlag_Write ) != osl::File::E_None )
return;
uno::Reference< com::sun::star::io::XOutputStream > xOutStream = m_rExport.GetFilter().openFragmentStream(
OUString( "word/fonts/font" ) + OUString::valueOf( static_cast< sal_Int32 >( m_nextFontId )) + ".ttf",
"application/vnd.openxmlformats-officedocument.obfuscatedFont" );
// Not much point in trying hard with the obfuscation key, whoever reads the spec can read the font anyway,
// so just alter the first and last part of the key.
char fontKeyStr[] = "{00014A78-CABC-4EF0-12AC-5CD89AEFDE00}";
sal_uInt8 fontKey[ 16 ] = { 0, 0xDE, 0xEF, 0x9A, 0xD8, 0x5C, 0xAC, 0x12, 0xF0, 0x4E,
0xBC, 0xCA, 0x78, 0x4A, 0x01, 0 };
fontKey[ 0 ] = fontKey[ 15 ] = m_nextFontId % 256;
fontKeyStr[ 1 ] = fontKeyStr[ 35 ] = toHexChar(( m_nextFontId % 256 ) / 16 );
fontKeyStr[ 2 ] = fontKeyStr[ 36 ] = toHexChar(( m_nextFontId % 256 ) % 16 );
char buffer[ 4096 ];
sal_uInt64 readSize;
file.read( buffer, 32, readSize );
if( readSize < 32 )
{
SAL_WARN( "sw.ww8", "Font file size too small (" << fontUrl << ")" );
xOutStream->closeOutput();
return;
}
for( int i = 0;
i < 16;
++i )
{
buffer[ i ] ^= fontKey[ i ];
buffer[ i + 16 ] ^= fontKey[ i ];
}
xOutStream->writeBytes( uno::Sequence< sal_Int8 >( reinterpret_cast< const sal_Int8* >( buffer ), 32 ));
for(;;)
{
sal_Bool eof;
if( file.isEndOfFile( &eof ) != osl::File::E_None )
{
SAL_WARN( "sw.ww8", "Error reading font file " << fontUrl );
xOutStream->closeOutput();
return;
}
if( eof )
break;
if( file.read( buffer, 4096, readSize ) != osl::File::E_None )
{
SAL_WARN( "sw.ww8", "Error reading font file " << fontUrl );
xOutStream->closeOutput();
return;
}
if( readSize == 0 )
break;
xOutStream->writeBytes( uno::Sequence< sal_Int8 >( reinterpret_cast< const sal_Int8* >( buffer ), readSize ));
}
xOutStream->closeOutput();
OString relId = OUStringToOString( GetExport().GetFilter().addRelation( m_pSerializer->getOutputStream(),
"http://schemas.openxmlformats.org/officeDocument/2006/relationships/font",
OUString( "fonts/font" ) + OUString::valueOf( static_cast< sal_Int32 >( m_nextFontId )) + ".ttf" ), RTL_TEXTENCODING_UTF8 );
m_pSerializer->singleElementNS( XML_w, tag,
FSNS( XML_r, XML_id ), relId.getStr(),
FSNS( XML_w, XML_fontKey ), fontKeyStr,
FSEND );
++m_nextFontId;
}
void DocxAttributeOutput::NumberingDefinition( sal_uInt16 nId, const SwNumRule &rRule )
{
// nId is the same both for abstract numbering definition as well as the
// numbering definition itself
// TODO check that this is actually true & fix if not ;-)
OString aId( OString::valueOf( sal_Int32( nId ) ) );
m_pSerializer->startElementNS( XML_w, XML_num,
FSNS( XML_w, XML_numId ), aId.getStr(),
FSEND );
m_pSerializer->singleElementNS( XML_w, XML_abstractNumId,
FSNS( XML_w, XML_val ), aId.getStr(),
FSEND );
#if OSL_DEBUG_LEVEL > 1
// TODO ww8 version writes this, anything to do about it here?
if ( rRule.IsContinusNum() )
OSL_TRACE( "TODO DocxAttributeOutput::NumberingDefinition()" );
#else
(void) rRule; // to quiet the warning...
#endif
m_pSerializer->endElementNS( XML_w, XML_num );
}
void DocxAttributeOutput::StartAbstractNumbering( sal_uInt16 nId )
{
m_pSerializer->startElementNS( XML_w, XML_abstractNum,
FSNS( XML_w, XML_abstractNumId ), OString::valueOf( sal_Int32( nId ) ).getStr(),
FSEND );
}
void DocxAttributeOutput::EndAbstractNumbering()
{
m_pSerializer->endElementNS( XML_w, XML_abstractNum );
}
void DocxAttributeOutput::NumberingLevel( sal_uInt8 nLevel,
sal_uInt16 nStart,
sal_uInt16 nNumberingType,
SvxAdjust eAdjust,
const sal_uInt8 * /*pNumLvlPos*/,
sal_uInt8 nFollow,
const wwFont *pFont,
const SfxItemSet *pOutSet,
sal_Int16 nIndentAt,
sal_Int16 nFirstLineIndex,
sal_Int16 nListTabPos,
const String &rNumberingString )
{
m_pSerializer->startElementNS( XML_w, XML_lvl,
FSNS( XML_w, XML_ilvl ), OString::valueOf( sal_Int32( nLevel ) ).getStr(),
FSEND );
// start with the nStart value
m_pSerializer->singleElementNS( XML_w, XML_start,
FSNS( XML_w, XML_val ), OString::valueOf( sal_Int32( nStart ) ).getStr(),
FSEND );
// format
OString aFmt( impl_NumberingType( nNumberingType ) );
if ( !aFmt.isEmpty() )
m_pSerializer->singleElementNS( XML_w, XML_numFmt,
FSNS( XML_w, XML_val ), aFmt.getStr(),
FSEND );
// suffix
const char *pSuffix = NULL;
switch ( nFollow )
{
case 1: pSuffix = "space"; break;
case 2: pSuffix = "nothing"; break;
default: /*pSuffix = "tab";*/ break;
}
if ( pSuffix )
m_pSerializer->singleElementNS( XML_w, XML_suff,
FSNS( XML_w, XML_val ), pSuffix,
FSEND );
// text
OUString aText( rNumberingString );
OUStringBuffer aBuffer( aText.getLength() + WW8ListManager::nMaxLevel );
const sal_Unicode *pPrev = aText.getStr();
const sal_Unicode *pIt = aText.getStr();
while ( pIt < aText.getStr() + aText.getLength() )
{
// convert the level values to %NUMBER form
// (we don't use pNumLvlPos at all)
// FIXME so far we support the ww8 limit of levels only
if ( *pIt < sal_Unicode( WW8ListManager::nMaxLevel ) )
{
aBuffer.append( pPrev, pIt - pPrev );
aBuffer.append( '%' );
aBuffer.append( OUString::valueOf( sal_Int32( *pIt ) + 1 ) );
pPrev = pIt + 1;
}
++pIt;
}
if ( pPrev < pIt )
aBuffer.append( pPrev, pIt - pPrev );
m_pSerializer->singleElementNS( XML_w, XML_lvlText,
FSNS( XML_w, XML_val ), OUStringToOString( aBuffer.makeStringAndClear(), RTL_TEXTENCODING_UTF8 ).getStr(),
FSEND );
// justification
const char *pJc;
bool ecmaDialect = ( m_rExport.GetFilter().getVersion() == oox::core::ECMA_DIALECT );
switch ( eAdjust )
{
case SVX_ADJUST_CENTER: pJc = "center"; break;
case SVX_ADJUST_RIGHT: pJc = !ecmaDialect ? "end" : "right"; break;
default: pJc = !ecmaDialect ? "start" : "left"; break;
}
m_pSerializer->singleElementNS( XML_w, XML_lvlJc,
FSNS( XML_w, XML_val ), pJc,
FSEND );
// indentation
m_pSerializer->startElementNS( XML_w, XML_pPr, FSEND );
if( nListTabPos != 0 )
{
m_pSerializer->startElementNS( XML_w, XML_tabs, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_tab,
FSNS( XML_w, XML_val ), "num",
FSNS( XML_w, XML_pos ), OString::valueOf( static_cast<sal_Int32>(nListTabPos) ).getStr(),
FSEND );
m_pSerializer->endElementNS( XML_w, XML_tabs );
}
sal_Int32 nToken = ecmaDialect ? XML_left : XML_start;
m_pSerializer->singleElementNS( XML_w, XML_ind,
FSNS( XML_w, nToken ), OString::valueOf( sal_Int32( nIndentAt ) ).getStr(),
FSNS( XML_w, XML_hanging ), OString::valueOf( sal_Int32( -nFirstLineIndex ) ).getStr(),
FSEND );
m_pSerializer->endElementNS( XML_w, XML_pPr );
// font
if ( pOutSet )
{
m_pSerializer->startElementNS( XML_w, XML_rPr, FSEND );
if ( pFont )
{
GetExport().GetId( *pFont ); // ensure font info is written to fontTable.xml
OString aFamilyName( OUStringToOString( OUString( pFont->GetFamilyName() ), RTL_TEXTENCODING_UTF8 ) );
m_pSerializer->singleElementNS( XML_w, XML_rFonts,
FSNS( XML_w, XML_ascii ), aFamilyName.getStr(),
FSNS( XML_w, XML_hAnsi ), aFamilyName.getStr(),
FSNS( XML_w, XML_cs ), aFamilyName.getStr(),
FSNS( XML_w, XML_hint ), "default",
FSEND );
}
m_rExport.OutputItemSet( *pOutSet, false, true, i18n::ScriptType::LATIN, m_rExport.mbExportModeRTF );
m_pSerializer->endElementNS( XML_w, XML_rPr );
}
// TODO anything to do about nListTabPos?
m_pSerializer->endElementNS( XML_w, XML_lvl );
}
void DocxAttributeOutput::CharCaseMap( const SvxCaseMapItem& rCaseMap )
{
switch ( rCaseMap.GetValue() )
{
case SVX_CASEMAP_KAPITAELCHEN:
m_pSerializer->singleElementNS( XML_w, XML_smallCaps, FSEND );
break;
case SVX_CASEMAP_VERSALIEN:
m_pSerializer->singleElementNS( XML_w, XML_caps, FSEND );
break;
default: // Something that ooxml does not support
m_pSerializer->singleElementNS( XML_w, XML_smallCaps, FSNS( XML_w, XML_val ), "false", FSEND );
m_pSerializer->singleElementNS( XML_w, XML_caps, FSNS( XML_w, XML_val ), "false", FSEND );
break;
}
}
void DocxAttributeOutput::CharColor( const SvxColorItem& rColor )
{
const Color aColor( rColor.GetValue() );
OString aColorString;
aColorString = impl_ConvertColor( aColor );
m_pSerializer->singleElementNS( XML_w, XML_color,
FSNS( XML_w, XML_val ), aColorString.getStr(), FSEND );
}
void DocxAttributeOutput::CharContour( const SvxContourItem& rContour )
{
if ( rContour.GetValue() )
m_pSerializer->singleElementNS( XML_w, XML_outline, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_outline, FSNS( XML_w, XML_val ), "false", FSEND );
}
void DocxAttributeOutput::CharCrossedOut( const SvxCrossedOutItem& rCrossedOut )
{
switch ( rCrossedOut.GetStrikeout() )
{
case STRIKEOUT_DOUBLE:
m_pSerializer->singleElementNS( XML_w, XML_dstrike, FSEND );
break;
case STRIKEOUT_NONE:
m_pSerializer->singleElementNS( XML_w, XML_dstrike, FSNS( XML_w, XML_val ), "false", FSEND );
m_pSerializer->singleElementNS( XML_w, XML_strike, FSNS( XML_w, XML_val ), "false", FSEND );
break;
default:
m_pSerializer->singleElementNS( XML_w, XML_strike, FSEND );
break;
}
}
void DocxAttributeOutput::CharEscapement( const SvxEscapementItem& rEscapement )
{
OString sIss;
short nEsc = rEscapement.GetEsc(), nProp = rEscapement.GetProp();
if ( !nEsc )
{
sIss = OString( "baseline" );
nEsc = 0;
nProp = 100;
}
else if ( DFLT_ESC_PROP == nProp )
{
if ( DFLT_ESC_SUB == nEsc || DFLT_ESC_AUTO_SUB == nEsc )
sIss = OString( "subscript" );
else if ( DFLT_ESC_SUPER == nEsc || DFLT_ESC_AUTO_SUPER == nEsc )
sIss = OString( "superscript" );
}
if ( !sIss.isEmpty() )
m_pSerializer->singleElementNS( XML_w, XML_vertAlign,
FSNS( XML_w, XML_val ), sIss.getStr(), FSEND );
if ( sIss.isEmpty() || sIss.match( OString( "baseline" ) ) )
{
long nHeight = ((SvxFontHeightItem&)m_rExport.GetItem(
RES_CHRATR_FONTSIZE )).GetHeight();
OString sPos = OString::valueOf( ( nHeight * nEsc + 500 ) / 1000 );
m_pSerializer->singleElementNS( XML_w, XML_position,
FSNS( XML_w, XML_val ), sPos.getStr( ), FSEND );
if( 100 != nProp || sIss.match( OString( "baseline" ) ) )
{
OString sSize = OString::valueOf( ( nHeight * nProp + 500 ) / 1000 );
m_pSerializer->singleElementNS( XML_w, XML_sz,
FSNS( XML_w, XML_val ), sSize.getStr( ), FSEND );
}
}
}
void DocxAttributeOutput::CharFont( const SvxFontItem& rFont)
{
if (!m_pFontsAttrList)
m_pFontsAttrList = m_pSerializer->createAttrList();
GetExport().GetId( rFont ); // ensure font info is written to fontTable.xml
OUString sFontName(rFont.GetFamilyName());
OString sFontNameUtf8 = OUStringToOString(sFontName, RTL_TEXTENCODING_UTF8);
m_pFontsAttrList->add(FSNS(XML_w, XML_ascii), sFontNameUtf8);
m_pFontsAttrList->add(FSNS(XML_w, XML_hAnsi), sFontNameUtf8);
}
void DocxAttributeOutput::CharFontSize( const SvxFontHeightItem& rFontSize)
{
OString fontSize = OString::valueOf( sal_Int32( ( rFontSize.GetHeight() + 5 ) / 10 ) );
switch ( rFontSize.Which() )
{
case RES_CHRATR_FONTSIZE:
case RES_CHRATR_CJK_FONTSIZE:
m_pSerializer->singleElementNS( XML_w, XML_sz, FSNS( XML_w, XML_val ), fontSize.getStr(), FSEND );
break;
case RES_CHRATR_CTL_FONTSIZE:
m_pSerializer->singleElementNS( XML_w, XML_szCs, FSNS( XML_w, XML_val ), fontSize.getStr(), FSEND );
break;
}
}
void DocxAttributeOutput::CharKerning( const SvxKerningItem& rKerning )
{
OString aKerning = OString::valueOf( ( sal_Int32 ) rKerning.GetValue() );
m_pSerializer->singleElementNS( XML_w, XML_spacing, FSNS(XML_w, XML_val), aKerning.getStr(), FSEND );
}
void DocxAttributeOutput::CharLanguage( const SvxLanguageItem& rLanguage )
{
if (!m_pCharLangAttrList)
m_pCharLangAttrList = m_pSerializer->createAttrList();
::com::sun::star::lang::Locale xLocale= MsLangId::convertLanguageToLocale( rLanguage.GetLanguage( ) );
OString sLanguage = OUStringToOString(xLocale.Language, RTL_TEXTENCODING_UTF8);
OString sCountry = OUStringToOString(xLocale.Country, RTL_TEXTENCODING_UTF8);
OString aLanguageCode = sLanguage + "-" + sCountry;
switch ( rLanguage.Which() )
{
case RES_CHRATR_LANGUAGE:
m_pCharLangAttrList->add(FSNS(XML_w, XML_val), aLanguageCode);
break;
case RES_CHRATR_CJK_LANGUAGE:
m_pCharLangAttrList->add(FSNS(XML_w, XML_eastAsia), aLanguageCode);
break;
case RES_CHRATR_CTL_LANGUAGE:
m_pCharLangAttrList->add(FSNS(XML_w, XML_bidi), aLanguageCode);
break;
}
}
void DocxAttributeOutput::CharPosture( const SvxPostureItem& rPosture )
{
if ( rPosture.GetPosture() != ITALIC_NONE )
m_pSerializer->singleElementNS( XML_w, XML_i, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_i, FSNS( XML_w, XML_val ), "false", FSEND );
}
void DocxAttributeOutput::CharShadow( const SvxShadowedItem& rShadow )
{
if ( rShadow.GetValue() )
m_pSerializer->singleElementNS( XML_w, XML_shadow, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_shadow, FSNS( XML_w, XML_val ), "false", FSEND );
}
void DocxAttributeOutput::CharUnderline( const SvxUnderlineItem& rUnderline )
{
const char *pUnderline;
switch ( rUnderline.GetLineStyle() )
{
case UNDERLINE_SINGLE: pUnderline = "single"; break;
case UNDERLINE_BOLD: pUnderline = "thick"; break;
case UNDERLINE_DOUBLE: pUnderline = "double"; break;
case UNDERLINE_DOTTED: pUnderline = "dotted"; break;
case UNDERLINE_DASH: pUnderline = "dash"; break;
case UNDERLINE_DASHDOT: pUnderline = "dotDash"; break;
case UNDERLINE_DASHDOTDOT: pUnderline = "dotDotDash"; break;
case UNDERLINE_WAVE: pUnderline = "wave"; break;
case UNDERLINE_BOLDDOTTED: pUnderline = "dottedHeavy"; break;
case UNDERLINE_BOLDDASH: pUnderline = "dashedHeavy"; break;
case UNDERLINE_LONGDASH: pUnderline = "dashLongHeavy"; break;
case UNDERLINE_BOLDLONGDASH: pUnderline = "dashLongHeavy"; break;
case UNDERLINE_BOLDDASHDOT: pUnderline = "dashDotHeavy"; break;
case UNDERLINE_BOLDDASHDOTDOT: pUnderline = "dashDotDotHeavy"; break;
case UNDERLINE_BOLDWAVE: pUnderline = "wavyHeavy"; break;
case UNDERLINE_DOUBLEWAVE: pUnderline = "wavyDouble"; break;
case UNDERLINE_NONE: // fall through
default: pUnderline = "none"; break;
}
m_pSerializer->singleElementNS( XML_w, XML_u, FSNS( XML_w, XML_val ), pUnderline, FSEND );
}
void DocxAttributeOutput::CharWeight( const SvxWeightItem& rWeight )
{
if ( rWeight.GetWeight() == WEIGHT_BOLD )
m_pSerializer->singleElementNS( XML_w, XML_b, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_b, FSNS( XML_w, XML_val ), "false", FSEND );
}
void DocxAttributeOutput::CharAutoKern( const SvxAutoKernItem& )
{
OSL_TRACE( "TODO DocxAttributeOutput::CharAutoKern()" );
}
void DocxAttributeOutput::CharAnimatedText( const SvxBlinkItem& rBlink )
{
if ( rBlink.GetValue() )
m_pSerializer->singleElementNS(XML_w, XML_effect, FSNS( XML_w, XML_val ), "blinkBackground", FSEND );
else
m_pSerializer->singleElementNS(XML_w, XML_effect, FSNS( XML_w, XML_val ), "none", FSEND );
}
void DocxAttributeOutput::CharBackground( const SvxBrushItem& rBrush )
{
m_pSerializer->singleElementNS( XML_w, XML_shd,
FSNS( XML_w, XML_fill ), impl_ConvertColor( rBrush.GetColor() ).getStr(),
FSNS( XML_w, XML_val ), "clear",
FSEND );
}
void DocxAttributeOutput::CharFontCJK( const SvxFontItem& rFont )
{
if (!m_pFontsAttrList)
m_pFontsAttrList = m_pSerializer->createAttrList();
OUString sFontName(rFont.GetFamilyName());
OString sFontNameUtf8 = OUStringToOString(sFontName, RTL_TEXTENCODING_UTF8);
m_pFontsAttrList->add(FSNS(XML_w, XML_eastAsia), sFontNameUtf8);
}
void DocxAttributeOutput::CharPostureCJK( const SvxPostureItem& rPosture )
{
if ( rPosture.GetPosture() != ITALIC_NONE )
m_pSerializer->singleElementNS( XML_w, XML_i, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_i, FSNS( XML_w, XML_val ), "false", FSEND );
}
void DocxAttributeOutput::CharWeightCJK( const SvxWeightItem& rWeight )
{
if ( rWeight.GetWeight() == WEIGHT_BOLD )
m_pSerializer->singleElementNS( XML_w, XML_b, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_b, FSNS( XML_w, XML_val ), "false", FSEND );
}
void DocxAttributeOutput::CharFontCTL( const SvxFontItem& rFont )
{
if (!m_pFontsAttrList)
m_pFontsAttrList = m_pSerializer->createAttrList();
OUString sFontName(rFont.GetFamilyName());
OString sFontNameUtf8 = OUStringToOString(sFontName, RTL_TEXTENCODING_UTF8);
m_pFontsAttrList->add(FSNS(XML_w, XML_cs), sFontNameUtf8);
}
void DocxAttributeOutput::CharPostureCTL( const SvxPostureItem& rPosture)
{
if ( rPosture.GetPosture() != ITALIC_NONE )
m_pSerializer->singleElementNS( XML_w, XML_iCs, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_iCs, FSNS( XML_w, XML_val ), "false", FSEND );
}
void DocxAttributeOutput::CharWeightCTL( const SvxWeightItem& rWeight )
{
if ( rWeight.GetWeight() == WEIGHT_BOLD )
m_pSerializer->singleElementNS( XML_w, XML_bCs, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_bCs, FSNS( XML_w, XML_val ), "false", FSEND );
}
void DocxAttributeOutput::CharRotate( const SvxCharRotateItem& rRotate)
{
if ( !rRotate.GetValue() )
return;
if (!m_pEastAsianLayoutAttrList)
m_pEastAsianLayoutAttrList = m_pSerializer->createAttrList();
OString sTrue((sal_Char *)"true");
m_pEastAsianLayoutAttrList->add(FSNS(XML_w, XML_vert), sTrue);
if (rRotate.IsFitToLine())
m_pEastAsianLayoutAttrList->add(FSNS(XML_w, XML_vertCompress), sTrue);
}
void DocxAttributeOutput::CharEmphasisMark( const SvxEmphasisMarkItem& rEmphasisMark )
{
const char *pEmphasis;
switch ( rEmphasisMark.GetValue() )
{
case EMPHASISMARK_NONE: pEmphasis = "none"; break;
case EMPHASISMARK_SIDE_DOTS: pEmphasis = "dot"; break;
case EMPHASISMARK_CIRCLE_ABOVE: pEmphasis = "circle"; break;
case EMPHASISMARK_DOTS_BELOW: pEmphasis = "underDot"; break;
default: pEmphasis = "comma"; break;
}
m_pSerializer->singleElementNS( XML_w, XML_em, FSNS( XML_w, XML_val ), pEmphasis, FSEND );
}
void DocxAttributeOutput::CharTwoLines( const SvxTwoLinesItem& rTwoLines )
{
if ( !rTwoLines.GetValue() )
return;
if (!m_pEastAsianLayoutAttrList)
m_pEastAsianLayoutAttrList = m_pSerializer->createAttrList();
OString sTrue((sal_Char *)"true");
m_pEastAsianLayoutAttrList->add(FSNS(XML_w, XML_combine), sTrue);
sal_Unicode cStart = rTwoLines.GetStartBracket();
sal_Unicode cEnd = rTwoLines.GetEndBracket();
if (!cStart && !cEnd)
return;
OString sBracket;
if ((cStart == '{') || (cEnd == '}'))
sBracket = (sal_Char *)"curly";
else if ((cStart == '<') || (cEnd == '>'))
sBracket = (sal_Char *)"angle";
else if ((cStart == '[') || (cEnd == ']'))
sBracket = (sal_Char *)"square";
else
sBracket = (sal_Char *)"round";
m_pEastAsianLayoutAttrList->add(FSNS(XML_w, XML_combineBrackets), sBracket);
}
void DocxAttributeOutput::CharScaleWidth( const SvxCharScaleWidthItem& rScaleWidth )
{
m_pSerializer->singleElementNS( XML_w, XML_w,
FSNS( XML_w, XML_val ), rtl::OString::valueOf( sal_Int32( rScaleWidth.GetValue() ) ).getStr(), FSEND );
}
void DocxAttributeOutput::CharRelief( const SvxCharReliefItem& rRelief )
{
switch ( rRelief.GetValue() )
{
case RELIEF_EMBOSSED:
m_pSerializer->singleElementNS( XML_w, XML_emboss, FSEND );
break;
case RELIEF_ENGRAVED:
m_pSerializer->singleElementNS( XML_w, XML_imprint, FSEND );
break;
default:
m_pSerializer->singleElementNS( XML_w, XML_emboss, FSNS( XML_w, XML_val ), "false", FSEND );
m_pSerializer->singleElementNS( XML_w, XML_imprint, FSNS( XML_w, XML_val ), "false", FSEND );
break;
}
}
void DocxAttributeOutput::CharHidden( const SvxCharHiddenItem& rHidden )
{
if ( rHidden.GetValue() )
m_pSerializer->singleElementNS( XML_w, XML_vanish, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_vanish, FSNS( XML_w, XML_val ), "false", FSEND );
}
void DocxAttributeOutput::TextINetFormat( const SwFmtINetFmt& rLink )
{
const SwTxtINetFmt* pINetFmt = rLink.GetTxtINetFmt();
const SwCharFmt* pCharFmt = pINetFmt->GetCharFmt();
OString aStyleId( "style" );
aStyleId += OString::valueOf( sal_Int32( m_rExport.GetId( *pCharFmt ) ) );
m_pSerializer->singleElementNS( XML_w, XML_rStyle, FSNS( XML_w, XML_val ), aStyleId.getStr(), FSEND );
}
void DocxAttributeOutput::TextCharFormat( const SwFmtCharFmt& rCharFmt )
{
OString aStyleId( "style" );
aStyleId += OString::valueOf( sal_Int32( m_rExport.GetId( *rCharFmt.GetCharFmt() ) ) );
m_pSerializer->singleElementNS( XML_w, XML_rStyle, FSNS( XML_w, XML_val ), aStyleId.getStr(), FSEND );
}
void DocxAttributeOutput::RefField( const SwField& rFld, const String& rRef )
{
sal_uInt16 nType = rFld.GetTyp( )->Which( );
if ( nType == RES_GETEXPFLD )
{
String sCmd = FieldString( ww::eREF );
sCmd.APPEND_CONST_ASC( "\"" );
sCmd += rRef;
sCmd.APPEND_CONST_ASC( "\" " );
m_rExport.OutputField( &rFld, ww::eREF, sCmd );
}
// There is nothing to do here for the set fields
}
void DocxAttributeOutput::HiddenField( const SwField& /*rFld*/ )
{
OSL_TRACE( "TODO DocxAttributeOutput::HiddenField()" );
}
void DocxAttributeOutput::PostitField( const SwField* pFld )
{
assert( dynamic_cast< const SwPostItField* >( pFld ));
m_postitFields.push_back( static_cast< const SwPostItField* >( pFld ));
}
void DocxAttributeOutput::WritePostitFieldReference()
{
while( m_postitFieldsMaxId < m_postitFields.size())
{
OString idstr = OString::valueOf( sal_Int32( m_postitFieldsMaxId ));
m_pSerializer->singleElementNS( XML_w, XML_commentReference, FSNS( XML_w, XML_id ), idstr.getStr(), FSEND );
++m_postitFieldsMaxId;
}
}
void DocxAttributeOutput::WritePostitFieldStart()
{
m_bPostitStart = true;
}
void DocxAttributeOutput::WritePostitFieldEnd()
{
m_bPostitEnd = true;
}
void DocxAttributeOutput::WritePostitFields()
{
for( unsigned int i = 0;
i < m_postitFields.size();
++i )
{
OString idstr = OString::valueOf( sal_Int32( i ));
const SwPostItField* f = m_postitFields[ i ];
m_pSerializer->startElementNS( XML_w, XML_comment, FSNS( XML_w, XML_id ), idstr.getStr(),
FSNS( XML_w, XML_author ), rtl::OUStringToOString( f->GetPar1(), RTL_TEXTENCODING_UTF8 ).getStr(),
FSNS( XML_w, XML_date ), msfilter::util::DateTimeToOString(f->GetDateTime()).getStr(),
FSNS( XML_w, XML_initials ), rtl::OUStringToOString( f->GetInitials(), RTL_TEXTENCODING_UTF8 ).getStr(), FSEND );
// Check for the text object existing, it seems that it can be NULL when saving a newly created
// comment without giving focus back to the main document. As GetTxt() is empty in that case as well,
// that is probably a bug in the Writer core.
if( f->GetTextObject() != NULL )
GetExport().WriteOutliner( *f->GetTextObject(), TXT_ATN );
m_pSerializer->endElementNS( XML_w, XML_comment );
}
}
bool DocxAttributeOutput::DropdownField( const SwField* pFld )
{
bool bExpand = false;
ww::eField eType = ww::eFORMDROPDOWN;
String sCmd = FieldString( eType );
GetExport( ).OutputField( pFld, eType, sCmd );
return bExpand;
}
void DocxAttributeOutput::SetField( const SwField& rFld, ww::eField eType, const String& rCmd )
{
// field bookmarks are handled in the EndRun method
GetExport().OutputField(&rFld, eType, rCmd );
}
void DocxAttributeOutput::WriteExpand( const SwField* pFld )
{
// Will be written in the next End Run
String sCmd;
m_rExport.OutputField( pFld, ww::eUNKNOWN, sCmd );
}
void DocxAttributeOutput::WriteField_Impl( const SwField* pFld, ww::eField eType, const String& rFldCmd, sal_uInt8 nMode )
{
struct FieldInfos infos;
infos.pField = pFld;
infos.sCmd = rFldCmd;
infos.eType = eType;
infos.bClose = WRITEFIELD_CLOSE & nMode;
infos.bOpen = WRITEFIELD_START & nMode;
m_Fields.push_back( infos );
if ( pFld )
{
sal_uInt16 nType = pFld->GetTyp( )->Which( );
sal_uInt16 nSubType = pFld->GetSubType();
// TODO Any other field types here ?
if ( ( nType == RES_SETEXPFLD ) && ( nSubType & nsSwGetSetExpType::GSE_STRING ) )
{
const SwSetExpField *pSet = ( const SwSetExpField* )( pFld );
m_sFieldBkm = pSet->GetPar1( );
}
else if ( nType == RES_DROPDOWN )
{
const SwDropDownField* pDropDown = ( const SwDropDownField* )( pFld );
m_sFieldBkm = pDropDown->GetName( );
}
}
}
void DocxAttributeOutput::WriteFormData_Impl( const ::sw::mark::IFieldmark& rFieldmark )
{
if ( !m_Fields.empty() )
m_Fields.begin()->pFieldmark = &rFieldmark;
}
void DocxAttributeOutput::WriteBookmarks_Impl( std::vector< OUString >& rStarts,
std::vector< OUString >& rEnds )
{
for ( std::vector< OUString >::const_iterator it = rStarts.begin(), end = rStarts.end(); it != end; ++it )
{
OString rName = OUStringToOString( *it, RTL_TEXTENCODING_UTF8 ).getStr( );
m_rMarksStart.push_back( rName );
}
rStarts.clear();
for ( std::vector< OUString >::const_iterator it = rEnds.begin(), end = rEnds.end(); it != end; ++it )
{
OString rName = OUStringToOString( *it, RTL_TEXTENCODING_UTF8 ).getStr( );
m_rMarksEnd.push_back( rName );
}
rEnds.clear();
}
void DocxAttributeOutput::TextFootnote_Impl( const SwFmtFtn& rFootnote )
{
const SwEndNoteInfo& rInfo = rFootnote.IsEndNote()?
m_rExport.pDoc->GetEndNoteInfo(): m_rExport.pDoc->GetFtnInfo();
// footnote/endnote run properties
const SwCharFmt* pCharFmt = rInfo.GetAnchorCharFmt( *m_rExport.pDoc );
OString aStyleId( "style" );
aStyleId += OString::valueOf( sal_Int32( m_rExport.GetId( *pCharFmt ) ) );
m_pSerializer->singleElementNS( XML_w, XML_rStyle, FSNS( XML_w, XML_val ), aStyleId.getStr(), FSEND );
// remember the footnote/endnote to
// 1) write the footnoteReference/endnoteReference in EndRunProperties()
// 2) be able to dump them all to footnotes.xml/endnotes.xml
if ( !rFootnote.IsEndNote() )
m_pFootnotesList->add( rFootnote );
else
m_pEndnotesList->add( rFootnote );
}
void DocxAttributeOutput::FootnoteEndnoteReference()
{
sal_Int32 nId;
const SwFmtFtn *pFootnote = m_pFootnotesList->getCurrent( nId );
// both cannot be set at the same time - if they are, it's a bug
if ( !pFootnote )
pFootnote = m_pEndnotesList->getCurrent( nId );
if ( !pFootnote )
return;
sal_Int32 nToken = pFootnote->IsEndNote()? XML_endnoteReference: XML_footnoteReference;
// write it
if ( pFootnote->GetNumStr().Len() == 0 )
{
// autonumbered
m_pSerializer->singleElementNS( XML_w, nToken,
FSNS( XML_w, XML_id ), ::rtl::OString::valueOf( nId ).getStr(),
FSEND );
}
else
{
// not autonumbered
m_pSerializer->singleElementNS( XML_w, nToken,
FSNS( XML_w, XML_customMarkFollows ), "1",
FSNS( XML_w, XML_id ), ::rtl::OString::valueOf( nId ).getStr(),
FSEND );
RunText( pFootnote->GetNumStr() );
}
}
void DocxAttributeOutput::FootnotesEndnotes( bool bFootnotes )
{
const FootnotesVector& rVector = bFootnotes? m_pFootnotesList->getVector(): m_pEndnotesList->getVector();
sal_Int32 nBody = bFootnotes? XML_footnotes: XML_endnotes;
sal_Int32 nItem = bFootnotes? XML_footnote: XML_endnote;
m_pSerializer->startElementNS( XML_w, nBody,
FSNS( XML_xmlns, XML_w ), "http://schemas.openxmlformats.org/wordprocessingml/2006/main",
FSNS( XML_xmlns, XML_r ), "http://schemas.openxmlformats.org/officeDocument/2006/relationships",
FSEND );
sal_Int32 nIndex = 0;
// separator
m_pSerializer->startElementNS( XML_w, nItem,
FSNS( XML_w, XML_id ), OString::valueOf( nIndex++ ).getStr(),
FSNS( XML_w, XML_type ), "separator",
FSEND );
m_pSerializer->startElementNS( XML_w, XML_p, FSEND );
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_separator, FSEND );
m_pSerializer->endElementNS( XML_w, XML_r );
m_pSerializer->endElementNS( XML_w, XML_p );
m_pSerializer->endElementNS( XML_w, nItem );
// separator
m_pSerializer->startElementNS( XML_w, nItem,
FSNS( XML_w, XML_id ), OString::valueOf( nIndex++ ).getStr(),
FSNS( XML_w, XML_type ), "continuationSeparator",
FSEND );
m_pSerializer->startElementNS( XML_w, XML_p, FSEND );
m_pSerializer->startElementNS( XML_w, XML_r, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_continuationSeparator, FSEND );
m_pSerializer->endElementNS( XML_w, XML_r );
m_pSerializer->endElementNS( XML_w, XML_p );
m_pSerializer->endElementNS( XML_w, nItem );
// if new special ones are added, update also WriteFootnoteEndnotePr()
// footnotes/endnotes themselves
for ( FootnotesVector::const_iterator i = rVector.begin(); i != rVector.end(); ++i, ++nIndex )
{
m_pSerializer->startElementNS( XML_w, nItem,
FSNS( XML_w, XML_id ), OString::valueOf( nIndex ).getStr(),
FSEND );
const SwNodeIndex* pIndex = (*i)->GetTxtFtn()->GetStartNode();
// tag required at the start of each footnote/endnote
m_footnoteEndnoteRefTag = bFootnotes ? XML_footnoteRef : XML_endnoteRef;
m_rExport.WriteSpecialText( pIndex->GetIndex() + 1,
pIndex->GetNode().EndOfSectionIndex(),
bFootnotes? TXT_FTN: TXT_EDN );
m_pSerializer->endElementNS( XML_w, nItem );
}
m_pSerializer->endElementNS( XML_w, nBody );
}
void DocxAttributeOutput::WriteFootnoteEndnotePr( ::sax_fastparser::FSHelperPtr fs, int tag,
const SwEndNoteInfo& info, int listtag )
{
fs->startElementNS( XML_w, tag, FSEND );
const char* fmt = NULL;
switch( info.aFmt.GetNumberingType())
{
case SVX_NUM_CHARS_UPPER_LETTER_N: // fall through, map to upper letters
case SVX_NUM_CHARS_UPPER_LETTER:
fmt = "upperLetter";
break;
case SVX_NUM_CHARS_LOWER_LETTER_N: // fall through, map to lower letters
case SVX_NUM_CHARS_LOWER_LETTER:
fmt = "lowerLetter";
break;
case SVX_NUM_ROMAN_UPPER:
fmt = "upperRoman";
break;
case SVX_NUM_ROMAN_LOWER:
fmt = "lowerRoman";
break;
case SVX_NUM_ARABIC:
fmt = "decimal";
break;
case SVX_NUM_NUMBER_NONE:
fmt = "none";
break;
case SVX_NUM_CHAR_SPECIAL:
fmt = "bullet";
break;
case SVX_NUM_PAGEDESC:
case SVX_NUM_BITMAP:
default:
break; // no format
}
if( fmt != NULL )
fs->singleElementNS( XML_w, XML_numFmt, FSNS( XML_w, XML_val ), fmt, FSEND );
if( info.nFtnOffset != 0 )
fs->singleElementNS( XML_w, XML_numStart, FSNS( XML_w, XML_val ),
rtl::OString::valueOf( sal_Int32( info.nFtnOffset + 1 )).getStr(), FSEND );
if( listtag != 0 ) // we are writting to settings.xml, write also special footnote/endnote list
{ // there are currently only two hardcoded ones ( see FootnotesEndnotes())
fs->singleElementNS( XML_w, listtag, FSNS( XML_w, XML_id ), "0", FSEND );
fs->singleElementNS( XML_w, listtag, FSNS( XML_w, XML_id ), "1", FSEND );
}
fs->endElementNS( XML_w, tag );
}
void DocxAttributeOutput::SectFootnoteEndnotePr()
{
if( HasFootnotes())
WriteFootnoteEndnotePr( m_pSerializer, XML_footnotePr, m_rExport.pDoc->GetFtnInfo(), 0 );
if( HasEndnotes())
WriteFootnoteEndnotePr( m_pSerializer, XML_endnotePr, m_rExport.pDoc->GetEndNoteInfo(), 0 );
}
void DocxAttributeOutput::ParaLineSpacing_Impl( short nSpace, short nMulti )
{
if ( !m_pParagraphSpacingAttrList )
m_pParagraphSpacingAttrList = m_pSerializer->createAttrList();
if ( nSpace < 0 )
{
m_pParagraphSpacingAttrList->add( FSNS( XML_w, XML_lineRule ), "exact" );
m_pParagraphSpacingAttrList->add( FSNS( XML_w, XML_line ), OString::valueOf( sal_Int32( -nSpace ) ) );
}
else if( nMulti )
{
m_pParagraphSpacingAttrList->add( FSNS( XML_w, XML_lineRule ), "auto" );
m_pParagraphSpacingAttrList->add( FSNS( XML_w, XML_line ), OString::valueOf( sal_Int32( nSpace ) ) );
}
else if ( nSpace > 0 )
{
m_pParagraphSpacingAttrList->add( FSNS( XML_w, XML_lineRule ), "atLeast" );
m_pParagraphSpacingAttrList->add( FSNS( XML_w, XML_line ), OString::valueOf( sal_Int32( nSpace ) ) );
}
else
m_pParagraphSpacingAttrList->add( FSNS( XML_w, XML_lineRule ), "auto" );
}
void DocxAttributeOutput::ParaAdjust( const SvxAdjustItem& rAdjust )
{
const char *pAdjustString;
bool bEcma = GetExport().GetFilter().getVersion( ) == oox::core::ECMA_DIALECT;
const SfxItemSet* pItems = GetExport().GetCurItemSet();
const SvxFrameDirectionItem* rFrameDir = static_cast< const SvxFrameDirectionItem* >( pItems->GetItem( RES_FRAMEDIR ) );
short nDir = FRMDIR_ENVIRONMENT;
if( rFrameDir != NULL )
nDir = rFrameDir->GetValue();
if ( nDir == FRMDIR_ENVIRONMENT )
nDir = GetExport( ).GetDefaultFrameDirection( );
bool bRtl = ( nDir == FRMDIR_HORI_RIGHT_TOP );
switch ( rAdjust.GetAdjust() )
{
case SVX_ADJUST_LEFT:
if ( bEcma )
pAdjustString = "left";
else if ( bRtl )
pAdjustString = "end";
else
pAdjustString = "start";
break;
case SVX_ADJUST_RIGHT:
if ( bEcma )
pAdjustString = "right";
else if ( bRtl )
pAdjustString = "start";
else
pAdjustString = "end";
break;
case SVX_ADJUST_BLOCKLINE:
case SVX_ADJUST_BLOCK:
pAdjustString = "both";
break;
case SVX_ADJUST_CENTER:
pAdjustString = "center";
break;
default:
return; // not supported attribute
}
m_pSerializer->singleElementNS( XML_w, XML_jc, FSNS( XML_w, XML_val ), pAdjustString, FSEND );
}
void DocxAttributeOutput::ParaSplit( const SvxFmtSplitItem& rSplit )
{
if (rSplit.GetValue())
m_pSerializer->singleElementNS( XML_w, XML_keepLines, FSNS( XML_w, XML_val ), "false", FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_keepLines, FSEND );
}
void DocxAttributeOutput::ParaWidows( const SvxWidowsItem& rWidows )
{
if (rWidows.GetValue())
m_pSerializer->singleElementNS( XML_w, XML_widowControl, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_widowControl, FSNS( XML_w, XML_val ), "false", FSEND );
}
static void impl_WriteTabElement( FSHelperPtr pSerializer,
const SvxTabStop& rTab, long nCurrentLeft )
{
FastAttributeList *pTabElementAttrList = pSerializer->createAttrList();
switch (rTab.GetAdjustment())
{
case SVX_TAB_ADJUST_RIGHT:
pTabElementAttrList->add( FSNS( XML_w, XML_val ), OString( (sal_Char *)"right") );
break;
case SVX_TAB_ADJUST_DECIMAL:
pTabElementAttrList->add( FSNS( XML_w, XML_val ), OString( (sal_Char *)"decimal") );
break;
case SVX_TAB_ADJUST_CENTER:
pTabElementAttrList->add( FSNS( XML_w, XML_val ), OString( (sal_Char *)"center") );
break;
case SVX_TAB_ADJUST_DEFAULT:
case SVX_TAB_ADJUST_LEFT:
default:
pTabElementAttrList->add( FSNS( XML_w, XML_val ), OString( (sal_Char *)"left") );
break;
}
pTabElementAttrList->add( FSNS( XML_w, XML_pos ), OString::valueOf( rTab.GetTabPos() + nCurrentLeft ) );
sal_Unicode cFillChar = rTab.GetFill();
if (sal_Unicode('.') == cFillChar )
pTabElementAttrList->add( FSNS( XML_w, XML_leader ), OString( (sal_Char *) "dot" ) );
else if ( sal_Unicode('-') == cFillChar )
pTabElementAttrList->add( FSNS( XML_w, XML_leader ), OString( (sal_Char *) "hyphen" ) );
else if ( sal_Unicode(0xB7) == cFillChar ) // middle dot
pTabElementAttrList->add( FSNS( XML_w, XML_leader ), OString( (sal_Char *) "middleDot" ) );
else if ( sal_Unicode('_') == cFillChar )
pTabElementAttrList->add( FSNS( XML_w, XML_leader ), OString( (sal_Char *) "underscore" ) );
else
pTabElementAttrList->add( FSNS( XML_w, XML_leader ), OString( (sal_Char *) "none" ) );
pSerializer->singleElementNS( XML_w, XML_tab, pTabElementAttrList );
}
void DocxAttributeOutput::ParaTabStop( const SvxTabStopItem& rTabStop )
{
const SfxPoolItem* pLR = m_rExport.HasItem( RES_LR_SPACE );
long nCurrentLeft = pLR ? ((const SvxLRSpaceItem*)pLR)->GetTxtLeft() : 0;
sal_uInt16 nCount = rTabStop.Count();
// <w:tabs> must contain at least one <w:tab>, so don't write it empty
if( nCount == 0 )
return;
if( nCount == 1 && rTabStop[ 0 ].GetAdjustment() == SVX_TAB_ADJUST_DEFAULT )
{
GetExport().setDefaultTabStop( rTabStop[ 0 ].GetTabPos());
return;
}
m_pSerializer->startElementNS( XML_w, XML_tabs, FSEND );
for (sal_uInt16 i = 0; i < nCount; i++ )
{
if( rTabStop[i].GetAdjustment() != SVX_TAB_ADJUST_DEFAULT )
impl_WriteTabElement( m_pSerializer, rTabStop[i], nCurrentLeft );
else
GetExport().setDefaultTabStop( rTabStop[i].GetTabPos());
}
m_pSerializer->endElementNS( XML_w, XML_tabs );
}
void DocxAttributeOutput::ParaHyphenZone( const SvxHyphenZoneItem& rHyphenZone )
{
m_pSerializer->singleElementNS( XML_w, XML_suppressAutoHyphens,
FSNS( XML_w, XML_val ), rHyphenZone.IsHyphen( ) ? "false" : "true" ,
FSEND );
}
void DocxAttributeOutput::ParaNumRule_Impl( const SwTxtNode* /*pTxtNd*/, sal_Int32 nLvl, sal_Int32 nNumId )
{
if ( USHRT_MAX != nNumId && 0 != nNumId )
{
m_pSerializer->startElementNS( XML_w, XML_numPr, FSEND );
m_pSerializer->singleElementNS( XML_w, XML_ilvl, FSNS( XML_w, XML_val ), OString::valueOf( sal_Int32( nLvl )).getStr(), FSEND );
m_pSerializer->singleElementNS( XML_w, XML_numId, FSNS( XML_w, XML_val ), OString::valueOf( sal_Int32( nNumId )).getStr(), FSEND );
m_pSerializer->endElementNS( XML_w, XML_numPr );
}
}
void DocxAttributeOutput::ParaScriptSpace( const SfxBoolItem& rScriptSpace )
{
sal_uInt16 nXmlElement = 0;
switch ( rScriptSpace.Which( ) )
{
case RES_PARATR_SCRIPTSPACE:
nXmlElement = XML_autoSpaceDE;
break;
case RES_PARATR_HANGINGPUNCTUATION:
nXmlElement = XML_overflowPunct;
break;
case RES_PARATR_FORBIDDEN_RULES:
nXmlElement = XML_kinsoku;
break;
}
if ( nXmlElement )
{
m_pSerializer->singleElementNS( XML_w, nXmlElement,
FSNS( XML_w, XML_val ), rScriptSpace.GetValue( ) ? "true": "false",
FSEND );
}
}
void DocxAttributeOutput::ParaVerticalAlign( const SvxParaVertAlignItem& rAlign )
{
const char *pAlignString;
switch ( rAlign.GetValue() )
{
case SvxParaVertAlignItem::BASELINE:
pAlignString = "baseline";
break;
case SvxParaVertAlignItem::TOP:
pAlignString = "top";
break;
case SvxParaVertAlignItem::CENTER:
pAlignString = "center";
break;
case SvxParaVertAlignItem::BOTTOM:
pAlignString = "bottom";
break;
case SvxParaVertAlignItem::AUTOMATIC:
pAlignString = "auto";
break;
default:
return; // not supported attribute
}
m_pSerializer->singleElementNS( XML_w, XML_textAlignment, FSNS( XML_w, XML_val ), pAlignString, FSEND );
}
void DocxAttributeOutput::ParaSnapToGrid( const SvxParaGridItem& rGrid )
{
m_pSerializer->singleElementNS( XML_w, XML_snapToGrid,
FSNS( XML_w, XML_val ), rGrid.GetValue( ) ? "true": "false",
FSEND );
}
void DocxAttributeOutput::FormatFrameSize( const SwFmtFrmSize& rSize )
{
if ( m_rExport.bOutFlyFrmAttrs )
{
if ( !m_pFlyAttrList )
m_pFlyAttrList = m_pSerializer->createAttrList( );
if ( rSize.GetWidth() && rSize.GetWidthSizeType() == ATT_FIX_SIZE )
{
m_pFlyAttrList->add( FSNS( XML_w, XML_w ), OString::valueOf( rSize.GetWidth( ) ) );
}
if ( rSize.GetHeight() )
{
OString sRule( "exact" );
if ( rSize.GetHeightSizeType() == ATT_MIN_SIZE )
sRule = OString( "atLeast" );
m_pFlyAttrList->add( FSNS( XML_w, XML_hRule ), sRule );
m_pFlyAttrList->add( FSNS( XML_w, XML_h ), OString::valueOf( rSize.GetHeight( ) ) );
}
}
else if ( m_rExport.bOutPageDescs )
{
FastAttributeList *attrList = m_pSerializer->createAttrList( );
if ( m_rExport.pAktPageDesc->GetLandscape( ) )
attrList->add( FSNS( XML_w, XML_orient ), "landscape" );
attrList->add( FSNS( XML_w, XML_w ), OString::valueOf( rSize.GetWidth( ) ) );
attrList->add( FSNS( XML_w, XML_h ), OString::valueOf( rSize.GetHeight( ) ) );
XFastAttributeListRef xAttrList( attrList );
attrList = NULL;
m_pSerializer->singleElementNS( XML_w, XML_pgSz, xAttrList );
}
}
void DocxAttributeOutput::FormatPaperBin( const SvxPaperBinItem& )
{
OSL_TRACE( "TODO DocxAttributeOutput::FormatPaperBin()" );
}
void DocxAttributeOutput::FormatLRSpace( const SvxLRSpaceItem& rLRSpace )
{
bool bEcma = m_rExport.GetFilter().getVersion( ) == oox::core::ECMA_DIALECT;
if ( m_rExport.bOutFlyFrmAttrs )
{
if ( !m_pFlyAttrList )
m_pFlyAttrList = m_pSerializer->createAttrList();
m_pFlyAttrList->add( FSNS( XML_w, XML_hSpace ),
OString::valueOf(
sal_Int32( ( rLRSpace.GetLeft() + rLRSpace.GetRight() ) / 2 ) ) );
}
else if ( m_rExport.bOutPageDescs )
{
if ( !m_pSectionSpacingAttrList )
m_pSectionSpacingAttrList = m_pSerializer->createAttrList();
sal_uInt16 nLDist, nRDist;
const SfxPoolItem* pItem = m_rExport.HasItem( RES_BOX );
if ( pItem )
{
nRDist = ((SvxBoxItem*)pItem)->CalcLineSpace( BOX_LINE_LEFT );
nLDist = ((SvxBoxItem*)pItem)->CalcLineSpace( BOX_LINE_RIGHT );
}
else
nLDist = nRDist = 0;
nLDist = nLDist + (sal_uInt16)rLRSpace.GetLeft();
nRDist = nRDist + (sal_uInt16)rLRSpace.GetRight();
m_pSectionSpacingAttrList->add( FSNS( XML_w, XML_left ), OString::valueOf( sal_Int32( nLDist ) ) );
m_pSectionSpacingAttrList->add( FSNS( XML_w, XML_right ), OString::valueOf( sal_Int32( nRDist ) ) );
}
else
{
FastAttributeList *pLRSpaceAttrList = m_pSerializer->createAttrList();
pLRSpaceAttrList->add( FSNS( XML_w, ( bEcma ? XML_left : XML_start ) ), OString::valueOf( (sal_Int32) rLRSpace.GetTxtLeft() ) );
pLRSpaceAttrList->add( FSNS( XML_w, ( bEcma ? XML_right : XML_end ) ), OString::valueOf( (sal_Int32) rLRSpace.GetRight() ) );
sal_Int32 nFirstLineAdjustment = rLRSpace.GetTxtFirstLineOfst();
if (nFirstLineAdjustment > 0)
pLRSpaceAttrList->add( FSNS( XML_w, XML_firstLine ), OString::valueOf( nFirstLineAdjustment ) );
else
pLRSpaceAttrList->add( FSNS( XML_w, XML_hanging ), OString::valueOf( - nFirstLineAdjustment ) );
m_pSerializer->singleElementNS( XML_w, XML_ind, pLRSpaceAttrList );
}
}
void DocxAttributeOutput::FormatULSpace( const SvxULSpaceItem& rULSpace )
{
if ( m_rExport.bOutFlyFrmAttrs )
{
if ( !m_pFlyAttrList )
m_pFlyAttrList = m_pSerializer->createAttrList();
m_pFlyAttrList->add( FSNS( XML_w, XML_vSpace ),
OString::valueOf(
sal_Int32( ( rULSpace.GetLower() + rULSpace.GetUpper() ) / 2 ) ) );
}
else if (m_rExport.bOutPageDescs )
{
OSL_ENSURE( m_rExport.GetCurItemSet(), "Impossible" );
if ( !m_rExport.GetCurItemSet() )
return;
if ( !m_pSectionSpacingAttrList )
m_pSectionSpacingAttrList = m_pSerializer->createAttrList();
HdFtDistanceGlue aDistances( *m_rExport.GetCurItemSet() );
sal_Int32 nHeader = 0;
if ( aDistances.HasHeader() )
nHeader = sal_Int32( aDistances.dyaHdrTop );
m_pSectionSpacingAttrList->add( FSNS( XML_w, XML_header ), OString::valueOf( nHeader ) );
// Page top
m_pSectionSpacingAttrList->add( FSNS( XML_w, XML_top ),
OString::valueOf( sal_Int32( aDistances.dyaTop ) ) );
sal_Int32 nFooter = 0;
if ( aDistances.HasFooter() )
nFooter = sal_Int32( aDistances.dyaHdrBottom );
m_pSectionSpacingAttrList->add( FSNS( XML_w, XML_footer ), OString::valueOf( nFooter ) );
// Page Bottom
m_pSectionSpacingAttrList->add( FSNS( XML_w, XML_bottom ),
OString::valueOf( sal_Int32( aDistances.dyaBottom ) ) );
// FIXME Page Gutter is not handled ATM, setting to 0 as it's mandatory for OOXML
m_pSectionSpacingAttrList->add( FSNS( XML_w, XML_gutter ),
OString::valueOf( sal_Int32( 0 ) ) );
}
else
{
if ( !m_pParagraphSpacingAttrList )
m_pParagraphSpacingAttrList = m_pSerializer->createAttrList();
m_pParagraphSpacingAttrList->add( FSNS( XML_w, XML_before ),
OString::valueOf( (sal_Int32)rULSpace.GetUpper() ) );
m_pParagraphSpacingAttrList->add( FSNS( XML_w, XML_after ),
OString::valueOf( (sal_Int32)rULSpace.GetLower() ) );
if (rULSpace.GetContext())
m_pSerializer->singleElementNS( XML_w, XML_contextualSpacing, FSEND );
else
m_pSerializer->singleElementNS( XML_w, XML_contextualSpacing, FSNS( XML_w, XML_val ), "false", FSEND );
}
}
void DocxAttributeOutput::FormatSurround( const SwFmtSurround& rSurround )
{
if ( m_rExport.bOutFlyFrmAttrs )
{
if ( !m_pFlyAttrList )
m_pFlyAttrList = m_pSerializer->createAttrList();
OString sWrap( "auto" );
switch ( rSurround.GetSurround( ) )
{
case SURROUND_NONE:
sWrap = OString( "none" );
break;
case SURROUND_THROUGHT:
sWrap = OString( "through" );
break;
case SURROUND_IDEAL:
case SURROUND_PARALLEL:
case SURROUND_LEFT:
case SURROUND_RIGHT:
default:
sWrap = OString( "around" );
}
m_pFlyAttrList->add( FSNS( XML_w, XML_wrap ), sWrap );
}
}
void DocxAttributeOutput::FormatVertOrientation( const SwFmtVertOrient& rFlyVert )
{
if ( m_rExport.bOutFlyFrmAttrs )
{
if ( !m_pFlyAttrList )
m_pFlyAttrList = m_pSerializer->createAttrList();
OString sAlign;
switch( rFlyVert.GetVertOrient() )
{
case text::VertOrientation::NONE:
break;
case text::VertOrientation::CENTER:
case text::VertOrientation::LINE_CENTER:
sAlign = OString( "center" );
break;
case text::VertOrientation::BOTTOM:
case text::VertOrientation::LINE_BOTTOM:
sAlign = OString( "bottom" );
break;
case text::VertOrientation::TOP:
case text::VertOrientation::LINE_TOP:
default:
sAlign = OString( "top" );
break;
}
if ( !sAlign.isEmpty() )
m_pFlyAttrList->add( FSNS( XML_w, XML_yAlign ), sAlign );
else
m_pFlyAttrList->add( FSNS( XML_w, XML_y ),
OString::valueOf( sal_Int32( rFlyVert.GetPos() ) ) );
OString sVAnchor( "page" );
switch ( rFlyVert.GetRelationOrient( ) )
{
case text::RelOrientation::CHAR:
case text::RelOrientation::PRINT_AREA:
case text::RelOrientation::TEXT_LINE:
sVAnchor = OString( "column" );
break;
case text::RelOrientation::FRAME:
case text::RelOrientation::PAGE_LEFT:
case text::RelOrientation::PAGE_RIGHT:
case text::RelOrientation::FRAME_LEFT:
case text::RelOrientation::FRAME_RIGHT:
sVAnchor = OString( "margin" );
break;
case text::RelOrientation::PAGE_FRAME:
case text::RelOrientation::PAGE_PRINT_AREA:
default:
break;
}
m_pFlyAttrList->add( FSNS( XML_w, XML_vAnchor ), sVAnchor );
}
}
void DocxAttributeOutput::FormatHorizOrientation( const SwFmtHoriOrient& rFlyHori )
{
if ( m_rExport.bOutFlyFrmAttrs )
{
if ( !m_pFlyAttrList )
m_pFlyAttrList = m_pSerializer->createAttrList();
OString sAlign;
switch( rFlyHori.GetHoriOrient() )
{
case text::HoriOrientation::NONE:
break;
case text::HoriOrientation::LEFT:
sAlign = OString( rFlyHori.IsPosToggle( ) ? "inside" : "left" );
break;
case text::HoriOrientation::RIGHT:
sAlign = OString( rFlyHori.IsPosToggle( ) ? "outside" : "right" );
break;
case text::HoriOrientation::CENTER:
case text::HoriOrientation::FULL: // FULL only for tables
default:
sAlign = OString( "center" );
break;
}
if ( !sAlign.isEmpty() )
m_pFlyAttrList->add( FSNS( XML_w, XML_xAlign ), sAlign );
else
m_pFlyAttrList->add( FSNS( XML_w, XML_x ),
OString::valueOf( sal_Int32( rFlyHori.GetPos() ) ) );
OString sHAnchor( "page" );
switch ( rFlyHori.GetRelationOrient( ) )
{
case text::RelOrientation::CHAR:
case text::RelOrientation::PRINT_AREA:
sHAnchor = OString( "text" );
break;
case text::RelOrientation::FRAME:
case text::RelOrientation::PAGE_LEFT:
case text::RelOrientation::PAGE_RIGHT:
case text::RelOrientation::FRAME_LEFT:
case text::RelOrientation::FRAME_RIGHT:
sHAnchor = OString( "margin" );
break;
case text::RelOrientation::PAGE_FRAME:
case text::RelOrientation::PAGE_PRINT_AREA:
default:
break;
}
m_pFlyAttrList->add( FSNS( XML_w, XML_hAnchor ), sHAnchor );
}
}
void DocxAttributeOutput::FormatAnchor( const SwFmtAnchor& )
{
// Fly frames: anchors here aren't matching the anchors in docx
}
void DocxAttributeOutput::FormatBackground( const SvxBrushItem& rBrush )
{
if ( !m_rExport.bOutPageDescs )
{
OString sColor = impl_ConvertColor( rBrush.GetColor( ) );
m_pSerializer->singleElementNS( XML_w, XML_shd,
FSNS( XML_w, XML_fill ), sColor.getStr( ),
FSNS( XML_w, XML_val ), "clear",
FSEND );
}
}
void DocxAttributeOutput::FormatBox( const SvxBoxItem& rBox )
{
if ( !m_bOpenedSectPr )
{
// Normally open the borders tag for paragraphs
m_pSerializer->startElementNS( XML_w, XML_pBdr, FSEND );
}
impl_pageBorders( m_pSerializer, rBox, false, false );
if ( m_bOpenedSectPr )
{
// Special handling for pgBorder
m_pSerializer->mergeTopMarks( sax_fastparser::MERGE_MARKS_PREPEND );
m_pSerializer->mergeTopMarks( );
}
else
{
// Normally close the borders tag for paragraphs
m_pSerializer->endElementNS( XML_w, XML_pBdr );
}
}
void DocxAttributeOutput::FormatColumns_Impl( sal_uInt16 nCols, const SwFmtCol& rCol, bool bEven, SwTwips nPageSize )
{
// Get the columns attributes
FastAttributeList *pColsAttrList = m_pSerializer->createAttrList();
pColsAttrList->add( FSNS( XML_w, XML_num ),
OString::valueOf( sal_Int32( nCols ) ). getStr( ) );
const char* pEquals = "false";
if ( bEven )
{
sal_uInt16 nWidth = rCol.GetGutterWidth( true );
pColsAttrList->add( FSNS( XML_w, XML_space ),
OString::valueOf( sal_Int32( nWidth ) ).getStr( ) );
pEquals = "true";
}
pColsAttrList->add( FSNS( XML_w, XML_equalWidth ), pEquals );
bool bHasSep = COLADJ_NONE == rCol.GetLineAdj( );
pColsAttrList->add( FSNS( XML_w, XML_sep ), bHasSep ? "true" : "false" );
// Write the element
m_pSerializer->startElementNS( XML_w, XML_cols, pColsAttrList );
// Write the columns width if non-equals
const SwColumns & rColumns = rCol.GetColumns( );
if ( !bEven )
{
for ( sal_uInt16 n = 0; n < nCols; ++n )
{
FastAttributeList *pColAttrList = m_pSerializer->createAttrList();
sal_uInt16 nWidth = rCol.CalcPrtColWidth( n, ( sal_uInt16 ) nPageSize );
pColAttrList->add( FSNS( XML_w, XML_w ),
OString::valueOf( sal_Int32( nWidth ) ).getStr( ) );
if ( n + 1 != nCols )
{
sal_uInt16 nSpacing = rColumns[n].GetRight( ) + rColumns[n + 1].GetLeft( );
pColAttrList->add( FSNS( XML_w, XML_space ),
OString::valueOf( sal_Int32( nSpacing ) ).getStr( ) );
}
m_pSerializer->singleElementNS( XML_w, XML_col, pColAttrList );
}
}
m_pSerializer->endElementNS( XML_w, XML_cols );
}
void DocxAttributeOutput::FormatKeep( const SvxFmtKeepItem& )
{
m_pSerializer->singleElementNS( XML_w, XML_keepNext, FSEND );
}
void DocxAttributeOutput::FormatTextGrid( const SwTextGridItem& rGrid )
{
FastAttributeList *pGridAttrList = m_pSerializer->createAttrList();
OString sGridType;
switch ( rGrid.GetGridType( ) )
{
default:
case GRID_NONE:
sGridType = OString( "default" );
break;
case GRID_LINES_ONLY:
sGridType = OString( "lines" );
break;
case GRID_LINES_CHARS:
if ( rGrid.IsSnapToChars( ) )
sGridType = OString( "snapToChars" );
else
sGridType = OString( "linesAndChars" );
break;
}
pGridAttrList->add( FSNS( XML_w, XML_type ), sGridType.getStr( ) );
sal_uInt16 nHeight = rGrid.GetBaseHeight() + rGrid.GetRubyHeight();
pGridAttrList->add( FSNS( XML_w, XML_linePitch ),
OString::valueOf( sal_Int32( nHeight ) ).getStr( ) );
pGridAttrList->add( FSNS( XML_w, XML_charSpace ),
OString::valueOf( sal_Int32( GridCharacterPitch( rGrid ) ) ).getStr( ) );
m_pSerializer->singleElementNS( XML_w, XML_docGrid, pGridAttrList );
}
void DocxAttributeOutput::FormatLineNumbering( const SwFmtLineNumber& rNumbering )
{
if ( !rNumbering.IsCount( ) )
m_pSerializer->singleElementNS( XML_w, XML_suppressLineNumbers, FSEND );
}
void DocxAttributeOutput::FormatFrameDirection( const SvxFrameDirectionItem& rDirection )
{
OString sTextFlow;
bool bBiDi = false;
short nDir = rDirection.GetValue();
if ( nDir == FRMDIR_ENVIRONMENT )
nDir = GetExport( ).GetDefaultFrameDirection( );
switch ( nDir )
{
default:
case FRMDIR_HORI_LEFT_TOP:
sTextFlow = OString( "lrTb" );
break;
case FRMDIR_HORI_RIGHT_TOP:
sTextFlow = OString( "lrTb" );
bBiDi = true;
break;
case FRMDIR_VERT_TOP_LEFT: // many things but not this one
case FRMDIR_VERT_TOP_RIGHT:
sTextFlow = OString( "tbRl" );
break;
}
if ( m_rExport.bOutPageDescs )
{
m_pSerializer->singleElementNS( XML_w, XML_textDirection,
FSNS( XML_w, XML_val ), sTextFlow.getStr( ),
FSEND );
if ( bBiDi )
m_pSerializer->singleElementNS( XML_w, XML_bidi, FSEND );
}
else if ( !m_rExport.bOutFlyFrmAttrs )
{
if ( bBiDi )
m_pSerializer->singleElementNS( XML_w, XML_bidi, FSEND );
}
}
DocxAttributeOutput::DocxAttributeOutput( DocxExport &rExport, FSHelperPtr pSerializer, oox::drawingml::DrawingML* pDrawingML )
: m_rExport( rExport ),
m_pSerializer( pSerializer ),
m_rDrawingML( *pDrawingML ),
m_pFontsAttrList( NULL ),
m_pEastAsianLayoutAttrList( NULL ),
m_pCharLangAttrList( NULL ),
m_pSectionSpacingAttrList( NULL ),
m_pParagraphSpacingAttrList( NULL ),
m_pHyperlinkAttrList( NULL ),
m_pFlyAttrList( NULL ),
m_pFootnotesList( new ::docx::FootnotesList() ),
m_pEndnotesList( new ::docx::FootnotesList() ),
m_footnoteEndnoteRefTag( 0 ),
m_pSectionInfo( NULL ),
m_pRedlineData( NULL ),
m_nRedlineId( 0 ),
m_bOpenedSectPr( false ),
m_sFieldBkm( ),
m_nNextMarkId( 0 ),
m_bPostitStart(false),
m_bPostitEnd(false),
m_pTableWrt( NULL ),
m_bTableCellOpen( false ),
m_nTableDepth( 0 ),
m_bParagraphOpened( false ),
m_nColBreakStatus( COLBRK_NONE ),
m_pParentFrame( NULL ),
m_closeHyperlinkInThisRun( false ),
m_closeHyperlinkInPreviousRun( false ),
m_startedHyperlink( false ),
m_postponedGraphic( NULL ),
m_postponedMath( NULL ),
m_postitFieldsMaxId( 0 ),
m_anchorId( 0 ),
m_nextFontId( 1 )
{
}
DocxAttributeOutput::~DocxAttributeOutput()
{
delete m_pFontsAttrList, m_pFontsAttrList = NULL;
delete m_pEastAsianLayoutAttrList, m_pEastAsianLayoutAttrList = NULL;
delete m_pCharLangAttrList, m_pCharLangAttrList = NULL;
delete m_pSectionSpacingAttrList, m_pSectionSpacingAttrList = NULL;
delete m_pParagraphSpacingAttrList, m_pParagraphSpacingAttrList = NULL;
delete m_pHyperlinkAttrList, m_pHyperlinkAttrList = NULL;
delete m_pFlyAttrList, m_pFlyAttrList = NULL;
delete m_pFootnotesList, m_pFootnotesList = NULL;
delete m_pEndnotesList, m_pEndnotesList = NULL;
delete m_pTableWrt, m_pTableWrt = NULL;
delete m_pParentFrame;
}
DocxExport& DocxAttributeOutput::GetExport()
{
return m_rExport;
}
bool DocxAttributeOutput::HasFootnotes() const
{
return !m_pFootnotesList->isEmpty();
}
bool DocxAttributeOutput::HasEndnotes() const
{
return !m_pEndnotesList->isEmpty();
}
bool DocxAttributeOutput::HasPostitFields() const
{
return !m_postitFields.empty();
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
{
"url": "https://cgit.freedesktop.org/libreoffice/core/tree/sw/source/filter/ww8/docxattributeoutput.cxx?id=dd77f79f0acf202ba7ff40cdd5b7411d277b9d1c",
"source_domain": "cgit.freedesktop.org",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "383518",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2ALPM6DALZ2ORKOKAOE5YRNFZ2LBNPKA",
"WARC-Concurrent-To": "<urn:uuid:9fd39471-8f72-4465-b64b-8314daab0b3e>",
"WARC-Date": "2021-10-17T15:35:34Z",
"WARC-IP-Address": "131.252.210.161",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3O6FFQYSU6VQ7KYEMFCTMJFSLTQ6PW3Z",
"WARC-Record-ID": "<urn:uuid:8cf9c532-7719-41b7-9003-508339e58066>",
"WARC-Target-URI": "https://cgit.freedesktop.org/libreoffice/core/tree/sw/source/filter/ww8/docxattributeoutput.cxx?id=dd77f79f0acf202ba7ff40cdd5b7411d277b9d1c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:14cee990-689b-4267-96a2-e49eddc90dee>"
},
"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,
29,
85,
140,
142,
144,
146,
148,
150,
152,
154,
156,
158,
161,
164,
167,
170,
173,
176,
179,
182,
185,
188,
191,
194,
197,
200,
203,
206,
209,
212,
215,
218,
221,
224,
227,
230,
233,
236,
239,
242,
245,
248,
251,
254,
257,
260,
263,
266,
269,
272,
275,
278,
281,
284,
287,
290,
293,
296,
299,
302,
305,
308,
311,
314,
317,
320,
323,
326,
329,
332,
335,
338,
341,
344,
347,
350,
353,
356,
359,
362,
365,
368,
371,
374,
377,
380,
383,
386,
389,
392,
395,
398,
401,
404,
407,
410,
413,
416,
419,
422,
425,
428,
432,
436,
440,
444,
448,
452,
456,
460,
464,
468,
472,
476,
480,
484,
488,
492,
496,
500,
504,
508,
512,
516,
520,
524,
528,
532,
536,
540,
544,
548,
552,
556,
560,
564,
568,
572,
576,
580,
584,
588,
592,
596,
600,
604,
608,
612,
616,
620,
624,
628,
632,
636,
640,
644,
648,
652,
656,
660,
664,
668,
672,
676,
680,
684,
688,
692,
696,
700,
704,
708,
712,
716,
720,
724,
728,
732,
736,
740,
744,
748,
752,
756,
760,
764,
768,
772,
776,
780,
784,
788,
792,
796,
800,
804,
808,
812,
816,
820,
824,
828,
832,
836,
840,
844,
848,
852,
856,
860,
864,
868,
872,
876,
880,
884,
888,
892,
896,
900,
904,
908,
912,
916,
920,
924,
928,
932,
936,
940,
944,
948,
952,
956,
960,
964,
968,
972,
976,
980,
984,
988,
992,
996,
1000,
1004,
1008,
1012,
1016,
1020,
1024,
1028,
1032,
1036,
1040,
1044,
1048,
1052,
1056,
1060,
1064,
1068,
1072,
1076,
1080,
1084,
1088,
1092,
1096,
1100,
1104,
1108,
1112,
1116,
1120,
1124,
1128,
1132,
1136,
1140,
1144,
1148,
1152,
1156,
1160,
1164,
1168,
1172,
1176,
1180,
1184,
1188,
1192,
1196,
1200,
1204,
1208,
1212,
1216,
1220,
1224,
1228,
1232,
1236,
1240,
1244,
1248,
1252,
1256,
1260,
1264,
1268,
1272,
1276,
1280,
1284,
1288,
1292,
1296,
1300,
1304,
1308,
1312,
1316,
1320,
1324,
1328,
1332,
1336,
1340,
1344,
1348,
1352,
1356,
1360,
1364,
1368,
1372,
1376,
1380,
1384,
1388,
1392,
1396,
1400,
1404,
1408,
1412,
1416,
1420,
1424,
1428,
1432,
1436,
1440,
1444,
1448,
1452,
1456,
1460,
1464,
1468,
1472,
1476,
1480,
1484,
1488,
1492,
1496,
1500,
1504,
1508,
1512,
1516,
1520,
1524,
1528,
1532,
1536,
1540,
1544,
1548,
1552,
1556,
1560,
1564,
1568,
1572,
1576,
1580,
1584,
1588,
1592,
1596,
1600,
1604,
1608,
1612,
1616,
1620,
1624,
1628,
1632,
1636,
1640,
1644,
1648,
1652,
1656,
1660,
1664,
1668,
1672,
1676,
1680,
1684,
1688,
1692,
1696,
1700,
1704,
1708,
1712,
1716,
1720,
1724,
1728,
1732,
1736,
1740,
1744,
1748,
1752,
1756,
1760,
1764,
1768,
1772,
1776,
1780,
1784,
1788,
1792,
1796,
1800,
1804,
1808,
1812,
1816,
1820,
1824,
1828,
1832,
1836,
1840,
1844,
1848,
1852,
1856,
1860,
1864,
1868,
1872,
1876,
1880,
1884,
1888,
1892,
1896,
1900,
1904,
1908,
1912,
1916,
1920,
1924,
1928,
1932,
1936,
1940,
1944,
1948,
1952,
1956,
1960,
1964,
1968,
1972,
1976,
1980,
1984,
1988,
1992,
1996,
2000,
2004,
2008,
2012,
2016,
2020,
2024,
2028,
2032,
2036,
2040,
2044,
2048,
2052,
2056,
2060,
2064,
2068,
2072,
2076,
2080,
2084,
2088,
2092,
2096,
2100,
2104,
2108,
2112,
2116,
2120,
2124,
2128,
2132,
2136,
2140,
2144,
2148,
2152,
2156,
2160,
2164,
2168,
2172,
2176,
2180,
2184,
2188,
2192,
2196,
2200,
2204,
2208,
2212,
2216,
2220,
2224,
2228,
2232,
2236,
2240,
2244,
2248,
2252,
2256,
2260,
2264,
2268,
2272,
2276,
2280,
2284,
2288,
2292,
2296,
2300,
2304,
2308,
2312,
2316,
2320,
2324,
2328,
2332,
2336,
2340,
2344,
2348,
2352,
2356,
2360,
2364,
2368,
2372,
2376,
2380,
2384,
2388,
2392,
2396,
2400,
2404,
2408,
2412,
2416,
2420,
2424,
2428,
2432,
2436,
2440,
2444,
2448,
2452,
2456,
2460,
2464,
2468,
2472,
2476,
2480,
2484,
2488,
2492,
2496,
2500,
2504,
2508,
2512,
2516,
2520,
2524,
2528,
2532,
2536,
2540,
2544,
2548,
2552,
2556,
2560,
2564,
2568,
2572,
2576,
2580,
2584,
2588,
2592,
2596,
2600,
2604,
2608,
2612,
2616,
2620,
2624,
2628,
2632,
2636,
2640,
2644,
2648,
2652,
2656,
2660,
2664,
2668,
2672,
2676,
2680,
2684,
2688,
2692,
2696,
2700,
2704,
2708,
2712,
2716,
2720,
2724,
2728,
2732,
2736,
2740,
2744,
2748,
2752,
2756,
2760,
2764,
2768,
2772,
2776,
2780,
2784,
2788,
2792,
2796,
2800,
2804,
2808,
2812,
2816,
2820,
2824,
2828,
2832,
2836,
2840,
2844,
2848,
2852,
2856,
2860,
2864,
2868,
2872,
2876,
2880,
2884,
2888,
2892,
2896,
2900,
2904,
2908,
2912,
2916,
2920,
2924,
2928,
2932,
2936,
2940,
2944,
2948,
2952,
2956,
2960,
2964,
2968,
2972,
2976,
2980,
2984,
2988,
2992,
2996,
3000,
3004,
3008,
3012,
3016,
3020,
3024,
3028,
3032,
3036,
3040,
3044,
3048,
3052,
3056,
3060,
3064,
3068,
3072,
3076,
3080,
3084,
3088,
3092,
3096,
3100,
3104,
3108,
3112,
3116,
3120,
3124,
3128,
3132,
3136,
3140,
3144,
3148,
3152,
3156,
3160,
3164,
3168,
3172,
3176,
3180,
3184,
3188,
3192,
3196,
3200,
3204,
3208,
3212,
3216,
3220,
3224,
3228,
3232,
3236,
3240,
3244,
3248,
3252,
3256,
3260,
3264,
3268,
3272,
3276,
3280,
3284,
3288,
3292,
3296,
3300,
3304,
3308,
3312,
3316,
3320,
3324,
3328,
3332,
3336,
3340,
3344,
3348,
3352,
3356,
3360,
3364,
3368,
3372,
3376,
3380,
3384,
3388,
3392,
3396,
3400,
3404,
3408,
3412,
3416,
3420,
3424,
3428,
3432,
3436,
3440,
3444,
3448,
3452,
3456,
3460,
3464,
3468,
3472,
3476,
3480,
3484,
3488,
3492,
3496,
3500,
3504,
3508,
3512,
3516,
3520,
3524,
3528,
3532,
3536,
3540,
3544,
3548,
3552,
3556,
3560,
3564,
3568,
3572,
3576,
3580,
3584,
3588,
3592,
3596,
3600,
3604,
3608,
3612,
3616,
3620,
3624,
3628,
3632,
3636,
3640,
3644,
3648,
3652,
3656,
3660,
3664,
3668,
3672,
3676,
3680,
3684,
3688,
3692,
3696,
3700,
3704,
3708,
3712,
3716,
3720,
3724,
3728,
3732,
3736,
3740,
3744,
3748,
3752,
3756,
3760,
3764,
3768,
3772,
3776,
3780,
3784,
3788,
3792,
3796,
3800,
3804,
3808,
3812,
3816,
3820,
3824,
3828,
3832,
3836,
3840,
3844,
3848,
3852,
3856,
3860,
3864,
3868,
3872,
3876,
3880,
3884,
3888,
3892,
3896,
3900,
3904,
3908,
3912,
3916,
3920,
3924,
3928,
3932,
3936,
3940,
3944,
3948,
3952,
3956,
3960,
3964,
3968,
3972,
3976,
3980,
3984,
3988,
3992,
3996,
4000,
4004,
4008,
4012,
4016,
4020,
4024,
4028,
4033,
4038,
4043,
4048,
4053,
4058,
4063,
4068,
4073,
4078,
4083,
4088,
4093,
4098,
4103,
4108,
4113,
4118,
4123,
4128,
4133,
4138,
4143,
4148,
4153,
4158,
4163,
4168,
4173,
4178,
4183,
4188,
4193,
4198,
4203,
4208,
4213,
4218,
4223,
4228,
4233,
4238,
4243,
4248,
4253,
4258,
4263,
4268,
4273,
4278,
4283,
4288,
4293,
4298,
4303,
4308,
4313,
4318,
4323,
4328,
4333,
4338,
4343,
4348,
4353,
4358,
4363,
4368,
4373,
4378,
4383,
4388,
4393,
4398,
4403,
4408,
4413,
4418,
4423,
4428,
4433,
4438,
4443,
4448,
4453,
4458,
4463,
4468,
4473,
4478,
4483,
4488,
4493,
4498,
4503,
4508,
4513,
4518,
4523,
4528,
4533,
4538,
4543,
4548,
4553,
4558,
4563,
4568,
4573,
4578,
4583,
4588,
4593,
4598,
4603,
4608,
4613,
4618,
4623,
4628,
4633,
4638,
4643,
4648,
4653,
4658,
4663,
4668,
4673,
4678,
4683,
4688,
4693,
4698,
4703,
4708,
4713,
4718,
4723,
4728,
4733,
4738,
4743,
4748,
4753,
4758,
4763,
4768,
4773,
4778,
4783,
4788,
4793,
4798,
4803,
4808,
4813,
4818,
4823,
4828,
4833,
4838,
4843,
4848,
4853,
4858,
4863,
4868,
4873,
4878,
4883,
4888,
4893,
4898,
4903,
4908,
4913,
4918,
4923,
4928,
4933,
4938,
4943,
4948,
4953,
4958,
4963,
4968,
4973,
4978,
4983,
4988,
4993,
4998,
5003,
5008,
5013,
5018,
5023,
5028,
5033,
5038,
5043,
5048,
5053,
5058,
5063,
5068,
5073,
5078,
5083,
5088,
5093,
5098,
5103,
5108,
5113,
5118,
5123,
5128,
5133,
5138,
5143,
5148,
5153,
5158,
5163,
5168,
5173,
5178,
5183,
5188,
5193,
5198,
5203,
5208,
5213,
5218,
5223,
5228,
5233,
5238,
5243,
5248,
5253,
5258,
5263,
5268,
5273,
5278,
5283,
5288,
5293,
5298,
5303,
5308,
5313,
5318,
5323,
5328,
5333,
5338,
5343,
5348,
5353,
5358,
5363,
5368,
5373,
5378,
5383,
5388,
5393,
5398,
5403,
5408,
5413,
5418,
5423,
5428,
5433,
5438,
5443,
5448,
5453,
5458,
5463,
5468,
5473,
5478,
5483,
5488,
5493,
5498,
5503,
5508,
5513,
5518,
5523,
5528,
5533,
5538,
5543,
5548,
5553,
5558,
5563,
5568,
5573,
5578,
5583,
5588,
5593,
5598,
5603,
5608,
5613,
5618,
5623,
5628,
5633,
5638,
5643,
5648,
5653,
5658,
5663,
5668,
5673,
5678,
5683,
5688,
5693,
5698,
5703,
5708,
5713,
5718,
5723,
5728,
5733,
5738,
5743,
5748,
5753,
5758,
5763,
5768,
5773,
5778,
5783,
5788,
5793,
5798,
5803,
5808,
5813,
5818,
5823,
5828,
5833,
5838,
5843,
5848,
5853,
5858,
5863,
5868,
5873,
5878,
5883,
5888,
5893,
5898,
5903,
5908,
5913,
5918,
5923,
5928,
5933,
5938,
5943,
5948,
5953,
5958,
5963,
5968,
5973,
5978,
5983,
5988,
5993,
5998,
6003,
6008,
6013,
6018,
6023,
6028,
6033,
6038,
6043,
6048,
6053,
6058,
6063,
6068,
6073,
6078,
6083,
6088,
6093,
6098,
6103,
6108,
6113,
6118,
6123,
6128,
6133,
6138,
6143,
6148,
6153,
6158,
6163,
6168,
6173,
6178,
6183,
6188,
6193,
6198,
6203,
6208,
6213,
6218,
6223,
6228,
6233,
6238,
6243,
6248,
6253,
6258,
6263,
6268,
6273,
6278,
6283,
6288,
6293,
6298,
6303,
6308,
6313,
6318,
6323,
6328,
6333,
6338,
6343,
6348,
6353,
6358,
6363,
6368,
6373,
6378,
6383,
6388,
6393,
6398,
6403,
6408,
6413,
6418,
6423,
6428,
6433,
6438,
6443,
6448,
6453,
6458,
6463,
6468,
6473,
6478,
6483,
6488,
6493,
6498,
6503,
6508,
6513,
6518,
6523,
6528,
6533,
6538,
6543,
6548,
6553,
6558,
6563,
6568,
6573,
6578,
6583,
6588,
6593,
6598,
6603,
6608,
6613,
6618,
6623,
6628,
6633,
6638,
6643,
6648,
6653,
6658,
6663,
6668,
6673,
6678,
6683,
6688,
6693,
6698,
6703,
6708,
6713,
6718,
6723,
6728,
6733,
6738,
6743,
6748,
6753,
6758,
6763,
6768,
6773,
6778,
6783,
6788,
6793,
6798,
6803,
6808,
6813,
6818,
6823,
6828,
6833,
6838,
6843,
6848,
6853,
6858,
6863,
6868,
6873,
6878,
6883,
6888,
6893,
6898,
6903,
6908,
6913,
6918,
6923,
6928,
6933,
6938,
6943,
6948,
6953,
6958,
6963,
6968,
6973,
6978,
6983,
6988,
6993,
6998,
7003,
7008,
7013,
7018,
7023,
7028,
7033,
7038,
7043,
7048,
7053,
7058,
7063,
7068,
7073,
7078,
7083,
7088,
7093,
7098,
7103,
7108,
7113,
7118,
7123,
7128,
7133,
7138,
7143,
7148,
7153,
7158,
7163,
7168,
7173,
7178,
7183,
7188,
7193,
7198,
7203,
7208,
7213,
7218,
7223,
7228,
7233,
7238,
7243,
7248,
7253,
7258,
7263,
7268,
7273,
7278,
7283,
7288,
7293,
7298,
7303,
7308,
7313,
7318,
7323,
7328,
7333,
7338,
7343,
7348,
7353,
7358,
7363,
7368,
7373,
7378,
7383,
7388,
7393,
7398,
7403,
7408,
7413,
7418,
7423,
7428,
7433,
7438,
7443,
7448,
7453,
7458,
7463,
7468,
7473,
7478,
7483,
7488,
7493,
7498,
7503,
7508,
7513,
7518,
7523,
7528,
7533,
7538,
7543,
7548,
7553,
7558,
7563,
7568,
7573,
7578,
7583,
7588,
7593,
7598,
7603,
7608,
7613,
7618,
7623,
7628,
7633,
7638,
7643,
7648,
7653,
7658,
7663,
7668,
7673,
7678,
7683,
7688,
7693,
7698,
7703,
7708,
7713,
7718,
7723,
7728,
7733,
7738,
7743,
7748,
7753,
7758,
7763,
7768,
7773,
7778,
7783,
7788,
7793,
7798,
7803,
7808,
7813,
7818,
7823,
7828,
7833,
7838,
7843,
7848,
7853,
7858,
7863,
7868,
7873,
7878,
7883,
7888,
7893,
7898,
7903,
7908,
7913,
7918,
7923,
7928,
7933,
7938,
7943,
7948,
7953,
7958,
7963,
7968,
7973,
7978,
7983,
7988,
7993,
7998,
8003,
8008,
8013,
8018,
8023,
8028,
8033,
8038,
8043,
8048,
8053,
8058,
8063,
8068,
8073,
8078,
8083,
8088,
8093,
8098,
8103,
8108,
8113,
8118,
8123,
8128,
8133,
8138,
8143,
8148,
8153,
8158,
8163,
8168,
8173,
8178,
8183,
8188,
8193,
8198,
8203,
8208,
8213,
8218,
8223,
8228,
8233,
8238,
8243,
8248,
8253,
8258,
8263,
8268,
8273,
8278,
8283,
8288,
8293,
8298,
8303,
8308,
8313,
8318,
8323,
8328,
8333,
8338,
8343,
8348,
8353,
8358,
8363,
8368,
8373,
8378,
8383,
8388,
8393,
8398,
8403,
8408,
8413,
8418,
8423,
8428,
8433,
8438,
8443,
8448,
8453,
8458,
8463,
8468,
8473,
8478,
8483,
8488,
8493,
8498,
8503,
8508,
8513,
8518,
8523,
8528,
8533,
8538,
8543,
8548,
8553,
8558,
8563,
8568,
8573,
8578,
8583,
8588,
8593,
8598,
8603,
8608,
8613,
8618,
8623,
8628,
8633,
8638,
8643,
8648,
8653,
8658,
8663,
8668,
8673,
8678,
8683,
8688,
8693,
8698,
8703,
8708,
8713,
8718,
8723,
8728,
8733,
8738,
8743,
8748,
8753,
8758,
8763,
8768,
8773,
8778,
8783,
8788,
8793,
8798,
8803,
8808,
8813,
8818,
8823,
8828,
8833,
8838,
8843,
8848,
8853,
8858,
8863,
8868,
8873,
8878,
8883,
8888,
8893,
8898,
8903,
8908,
8913,
8918,
8923,
8928,
8933,
8938,
8943,
8948,
8953,
8958,
8963,
8968,
8973,
8978,
8983,
8988,
8993,
8998,
9003,
9008,
9013,
9018,
9023,
9028,
9033,
9038,
9043,
9048,
9053,
9058,
9063,
9068,
9073,
9078,
9083,
9088,
9093,
9098,
9103,
9108,
9113,
9118,
9123,
9128,
9133,
9138,
9143,
9148,
9153,
9158,
9163,
9168,
9173,
9178,
9183,
9188,
9193,
9198,
9203,
9208,
9213,
9218,
9223,
9228,
9233,
9238,
9243,
9248,
9253,
9258,
9263,
9268,
9273,
9278,
9283,
9288,
9293,
9298,
9303,
9308,
9313,
9318,
9323,
9328,
9333,
9338,
9343,
9348,
9353,
9358,
9363,
9368,
9373,
9378,
9383,
9388,
9393,
9398,
9403,
9408,
9413,
9418,
9423,
9428,
9433,
9438,
9443,
9448,
9453,
9458,
9463,
9468,
9473,
9478,
9483,
9488,
9493,
9498,
9503,
9508,
9513,
9518,
9523,
9528,
9533,
9538,
9543,
9548,
9553,
9558,
9563,
9568,
9573,
9578,
9583,
9588,
9593,
9598,
9603,
9608,
9613,
9618,
9623,
9628,
9633,
9638,
9643,
9648,
9653,
9658,
9663,
9668,
9673,
9678,
9683,
9688,
9693,
9698,
9703,
9708,
9713,
9718,
9723,
9728,
9733,
9738,
9743,
9748,
9753,
9758,
9763,
9768,
9773,
9778,
9783,
9788,
9793,
9798,
9803,
9808,
9813,
9818,
9823,
9828,
9833,
9838,
9843,
9848,
9853,
9858,
9863,
9868,
9873,
9878,
9883,
9888,
9893,
9898,
9903,
9908,
9913,
9918,
9923,
9928,
9933,
9938,
9943,
9948,
9953,
9958,
9963,
9968,
9973,
9978,
9983,
9988,
9993,
9998,
10003,
10008,
10013,
10018,
10023,
10028,
10033,
10038,
10043,
10048,
10053,
10058,
10063,
10068,
10073,
10078,
10083,
10088,
10093,
10098,
10103,
10108,
10113,
10118,
10123,
10128,
10133,
10138,
10143,
10148,
10153,
10158,
10163,
10168,
10173,
10178,
10183,
10188,
10193,
10198,
10203,
10208,
10213,
10218,
10223,
10228,
10233,
10238,
10243,
10248,
10253,
10258,
10263,
10268,
10273,
10278,
10283,
10288,
10293,
10298,
10303,
10308,
10313,
10318,
10323,
10328,
10333,
10338,
10343,
10348,
10353,
10358,
10363,
10368,
10373,
10378,
10383,
10388,
10393,
10398,
10403,
10408,
10413,
10418,
10423,
10428,
10433,
10438,
10443,
10448,
10453,
10458,
10463,
10468,
10473,
10478,
10483,
10488,
10493,
10498,
10503,
10508,
10513,
10518,
10523,
10528,
10533,
10538,
10543,
10548,
10553,
10558,
10563,
10568,
10573,
10578,
10583,
10588,
10593,
10598,
10603,
10608,
10613,
10618,
10623,
10628,
10633,
10638,
10643,
10648,
10653,
10658,
10663,
10668,
10673,
10678,
10683,
10688,
10693,
10698,
10703,
10708,
10713,
10718,
10723,
10728,
10733,
10738,
10743,
10748,
10753,
10758,
10763,
10768,
10773,
10778,
10783,
10788,
10793,
10798,
10803,
10808,
10813,
10818,
10823,
10828,
10833,
10838,
10843,
10848,
10853,
10858,
10863,
10868,
10873,
10878,
10883,
10888,
10893,
10898,
10903,
10908,
10913,
10918,
10923,
10928,
10933,
10938,
10943,
10948,
10953,
10958,
10963,
10968,
10973,
10978,
10983,
10988,
10993,
10998,
11003,
11008,
11013,
11018,
11023,
11028,
11033,
11038,
11043,
11048,
11053,
11058,
11063,
11068,
11073,
11078,
11083,
11088,
11093,
11098,
11103,
11108,
11113,
11118,
11123,
11128,
11133,
11138,
11143,
11148,
11153,
11158,
11163,
11168,
11173,
11178,
11183,
11188,
11193,
11198,
11203,
11208,
11213,
11218,
11223,
11228,
11233,
11238,
11243,
11248,
11253,
11258,
11263,
11268,
11273,
11278,
11283,
11288,
11293,
11298,
11303,
11308,
11313,
11318,
11323,
11328,
11333,
11338,
11343,
11348,
11353,
11358,
11363,
11368,
11373,
11378,
11383,
11388,
11393,
11398,
11403,
11408,
11413,
11418,
11423,
11428,
11433,
11438,
11443,
11448,
11453,
11458,
11463,
11468,
11473,
11478,
11483,
11488,
11493,
11498,
11503,
11508,
11513,
11518,
11523,
11528,
11533,
11538,
11543,
11548,
11553,
11558,
11563,
11568,
11573,
11578,
11583,
11588,
11593,
11598,
11603,
11608,
11613,
11618,
11623,
11628,
11633,
11638,
11643,
11648,
11653,
11658,
11663,
11668,
11673,
11678,
11683,
11688,
11693,
11698,
11703,
11708,
11713,
11718,
11723,
11728,
11733,
11738,
11743,
11748,
11753,
11758,
11763,
11768,
11773,
11778,
11783,
11788,
11793,
11798,
11803,
11808,
11813,
11818,
11823,
11828,
11833,
11838,
11843,
11848,
11853,
11858,
11863,
11868,
11873,
11878,
11883,
11888,
11893,
11898,
11903,
11908,
11913,
11918,
11923,
11928,
11933,
11938,
11943,
11948,
11953,
11958,
11963,
11968,
11973,
11978,
11983,
11988,
11993,
11998,
12003,
12008,
12013,
12018,
12023,
12028,
12033,
12038,
12043,
12048,
12053,
12058,
12063,
12068,
12073,
12078,
12083,
12088,
12093,
12098,
12103,
12108,
12113,
12118,
12123,
12128,
12133,
12138,
12143,
12148,
12153,
12158,
12163,
12168,
12173,
12178,
12183,
12188,
12193,
12198,
12203,
12208,
12213,
12218,
12223,
12228,
12233,
12238,
12243,
12248,
12253,
12258,
12263,
12268,
12273,
12278,
12283,
12288,
12293,
12298,
12303,
12308,
12313,
12318,
12323,
12328,
12333,
12338,
12343,
12348,
12353,
12358,
12363,
12368,
12373,
12378,
12383,
12388,
12393,
12398,
12403,
12408,
12413,
12418,
12423,
12428,
12433,
12438,
12443,
12448,
12453,
12458,
12463,
12468,
12473,
12478,
12483,
12488,
12493,
12498,
12503,
12508,
12513,
12518,
12523,
12528,
12533,
12538,
12543,
12548,
12553,
12558,
12563,
12568,
12573,
12578,
12583,
12588,
12593,
12598,
12603,
12608,
12613,
12618,
12623,
12628,
12633,
12638,
12643,
12648,
12653,
12658,
12663,
12668,
12673,
12678,
12683,
12688,
12693,
12698,
12703,
12708,
12713,
12718,
12723,
12728,
12733,
12738,
12743,
12748,
12753,
12758,
12763,
12768,
12773,
12778,
12783,
12788,
12793,
12798,
12803,
12808,
12813,
12818,
12823,
12828,
12833,
12838,
12843,
12848,
12853,
12858,
12863,
12868,
12873,
12878,
12883,
12888,
12893,
12898,
12903,
12908,
12913,
12918,
12923,
12928,
12933,
12938,
12943,
12948,
12953,
12958,
12963,
12968,
12973,
12978,
12983,
12988,
12993,
12998,
13003,
13008,
13013,
13018,
13023,
13028,
13033,
13038,
13043,
13048,
13053,
13058,
13063,
13068,
13073,
13078,
13083,
13088,
13093,
13098,
13103,
13108,
13113,
13118,
13123,
13128,
13133,
13138,
13143,
13148,
13153,
13158,
13163,
13168,
13173,
13178,
13183,
13188,
13193,
13198,
13203,
13208,
13213,
13218,
13223,
13228,
13233,
13238,
13243,
13248,
13253,
13258,
13263,
13268,
13273,
13278,
13283,
13288,
13293,
13298,
13303,
13308,
13313,
13318,
13323,
13328,
13333,
13338,
13343,
13348,
13353,
13358,
13363,
13368,
13373,
13378,
13383,
13388,
13393,
13398,
13403,
13408,
13413,
13418,
13423,
13428,
13433,
13438,
13443,
13448,
13453,
13458,
13463,
13468,
13473,
13478,
13483,
13488,
13493,
13498,
13503,
13508,
13513,
13518,
13523,
13528,
13533,
13538,
13543,
13548,
13553,
13558,
13563,
13568,
13573,
13578,
13583,
13588,
13593,
13598,
13603,
13608,
13613,
13618,
13623,
13628,
13633,
13638,
13643,
13648,
13653,
13658,
13663,
13668,
13673,
13678,
13683,
13688,
13693,
13698,
13703,
13708,
13713,
13718,
13723,
13728,
13733,
13738,
13743,
13748,
13753,
13758,
13763,
13768,
13773,
13778,
13783,
13788,
13793,
13798,
13803,
13808,
13813,
13818,
13823,
13828,
13833,
13838,
13843,
13848,
13853,
13858,
13863,
13868,
13873,
13878,
13883,
13888,
13893,
13898,
13903,
13908,
13913,
13918,
13923,
13928,
13933,
13938,
13943,
13948,
13953,
13958,
13963,
13968,
13973,
13978,
13983,
13988,
13993,
13998,
14003,
14008,
14013,
14018,
14023,
14028,
14033,
14038,
14043,
14048,
14053,
14058,
14063,
14068,
14073,
14078,
14083,
14088,
14093,
14098,
14103,
14108,
14113,
14118,
14123,
14128,
14133,
14138,
14143,
14148,
14153,
14158,
14163,
14168,
14173,
14178,
14183,
14188,
14193,
14198,
14203,
14208,
14213,
14218,
14223,
14228,
14233,
14238,
14243,
14248,
14253,
14258,
14263,
14268,
14273,
14278,
14283,
14288,
14293,
14298,
14303,
14308,
14313,
14318,
14323,
14328,
14333,
14338,
14343,
14348,
14353,
14358,
14363,
14368,
14373,
14378,
14383,
14388,
14393,
14398,
14403,
14408,
14413,
14418,
14423,
14428,
14433,
14438,
14443,
14448,
14453,
14458,
14463,
14468,
14473,
14478,
14483,
14488,
14493,
14498,
14503,
14508,
14513,
14518,
14523,
14528,
14533,
14538,
14543,
14548,
14553,
14558,
14563,
14568,
14573,
14578,
14583,
14588,
14593,
14598,
14603,
14608,
14613,
14618,
14623,
14628,
14633,
14638,
14643,
14648,
14653,
14658,
14663,
14668,
14673,
14678,
14683,
14688,
14693,
14698,
14703,
14708,
14713,
14718,
14723,
14728,
14733,
14738,
14743,
14748,
14753,
14758,
14763,
14768,
14773,
14778,
14783,
14788,
14793,
14798,
14803,
14808,
14813,
14818,
14823,
14828,
14833,
14838,
14843,
14848,
14853,
14858,
14863,
14868,
14873,
14878,
14883,
14888,
14893,
14898,
14903,
14908,
14913,
14918,
14923,
14928,
14933,
14938,
14943,
14948,
14953,
14958,
14963,
14968,
14973,
14978,
14983,
14988,
14993,
14998,
15003,
15008,
15013,
15018,
15023,
15028,
15033,
15038,
15043,
15048,
15053,
15058,
15063,
15068,
15073,
15078,
15083,
15088,
15093,
15098,
15103,
15108,
15113,
15118,
15123,
15128,
15133,
15138,
15143,
15148,
15153,
15158,
15163,
15168,
15173,
15178,
15183,
15188,
15193,
15198,
15203,
15208,
15213,
15218,
15223,
15228,
15233,
15238,
15243,
15248,
15253,
15258,
15263,
15268,
15273,
15278,
15283,
15288,
15293,
15298,
15303,
15308,
15313,
15318,
15323,
15328,
15333,
15338,
15343,
15348,
15353,
15358,
15363,
15368,
15373,
15378,
15383,
15388,
15393,
15398,
15403,
15408,
15413,
15418,
15423,
15428,
15433,
15438,
15443,
15448,
15453,
15458,
15463,
15468,
15473,
15478,
15483,
15488,
15493,
15498,
15503,
15508,
15513,
15518,
15523,
15528,
15533,
15538,
15543,
15548,
15553,
15558,
15563,
15568,
15573,
15578,
15583,
15588,
15593,
15598,
15603,
15608,
15613,
15618,
15623,
15628,
15633,
15638,
15643,
15648,
15653,
15658,
15663,
15668,
15673,
15678,
15683,
15688,
15693,
15698,
15703,
15708,
15713,
15718,
15723,
15728,
15733,
15738,
15743,
15748,
15753,
15758,
15763,
15768,
15773,
15778,
15783,
15788,
15793,
15798,
15803,
15808,
15813,
15818,
15823,
15828,
15833,
15838,
15843,
15848,
15853,
15858,
15863,
15868,
15873,
15878,
15883,
15888,
15893,
15898,
15903,
15908,
15913,
15918,
15923,
15928,
15933,
15938,
15943,
15948,
15953,
15958,
15963,
15968,
15973,
15978,
15983,
15988,
15993,
15998,
16003,
16008,
16013,
16018,
16023,
16028,
16033,
16038,
16043,
16048,
16053,
16058,
16063,
16068,
16073,
16078,
16083,
16088,
16093,
16098,
16103,
16108,
16113,
16118,
16123,
16128,
16133,
16138,
16143,
16148,
16153,
16158,
16163,
16168,
16173,
16178,
16183,
16188,
16193,
16198,
16203,
16208,
16213,
16218,
16223,
16228,
16233,
16238,
16243,
16248,
16253,
16258,
16263,
16268,
16273,
16278,
16283,
16288,
16293,
16298,
16303,
16308,
16313,
16318,
16323,
16328,
16333,
16338,
16343,
16348,
16353,
16358,
16363,
16368,
16373,
16378,
16383,
16388,
16393,
16398,
16403,
16408,
16413,
16418,
16423,
16428,
16433,
16438,
16443,
16448,
16453,
16458,
16463,
16468,
16473,
16478,
16483,
16488,
16493,
16498,
16503,
16508,
16513,
16518,
16523,
16528,
16533,
16538,
16543,
16548,
16553,
16558,
16563,
16568,
16573,
16578,
16583,
16588,
16593,
16598,
16603,
16608,
16613,
16618,
16623,
16628,
16633,
16638,
16643,
16648,
16653,
16658,
16663,
16668,
16673,
16678,
16683,
16688,
16693,
16698,
16703,
16708,
16713,
16718,
16723,
16728,
16733,
16738,
16743,
16748,
16753,
16758,
16763,
16768,
16773,
16778,
16783,
16788,
16793,
16798,
16803,
16808,
16813,
16818,
16823,
16828,
16833,
16838,
16843,
16848,
16853,
16858,
16863,
16868,
16873,
16878,
16883,
16888,
16893,
16898,
16903,
16908,
16913,
16918,
16923,
16928,
16933,
16938,
16943,
16948,
16953,
16958,
16963,
16968,
16973,
16978,
16983,
16988,
16993,
16998,
17003,
17008,
17013,
17018,
17023,
17028,
17033,
17038,
17043,
17048,
17053,
17058,
17063,
17068,
17073,
17078,
17083,
17088,
17093,
17098,
17103,
17108,
17113,
17118,
17123,
17128,
17133,
17138,
17143,
17148,
17153,
17158,
17163,
17168,
17173,
17178,
17183,
17188,
17193,
17198,
17203,
17208,
17213,
17218,
17223,
17228,
17233,
17238,
17243,
17248,
17253,
17258,
17263,
17268,
17273,
17278,
17283,
17288,
17293,
17298,
17303,
17308,
17313,
17318,
17323,
17328,
17333,
17338,
17343,
17348,
17353,
17358,
17363,
17368,
17373,
17378,
17383,
17388,
17393,
17398,
17403,
17408,
17413,
17418,
17423,
17428,
17433,
17438,
17443,
17448,
17453,
17458,
17463,
17468,
17473,
17478,
17483,
17488,
17493,
17498,
17503,
17508,
17513,
17518,
17523,
17528,
17533,
17538,
17543,
17548,
17553,
17558,
17563,
17568,
17573,
17578,
17583,
17588,
17593,
17598,
17603,
17608,
17613,
17618,
17623,
17628,
17633,
17638,
17643,
17648,
17653,
17658,
17663,
17668,
17673,
17678,
17683,
17688,
17693,
17698,
17703,
17708,
17713,
17718,
17723,
17728,
17733,
17738,
17743,
17748,
17753,
17758,
17763,
17768,
17773,
17778,
17783,
17788,
17793,
17798,
17803,
17808,
17813,
17818,
17823,
17828,
17833,
17838,
17843,
17848,
17853,
17858,
17863,
17868,
17873,
17878,
17883,
17888,
17893,
17898,
17903,
17908,
17913,
17918,
17923,
17928,
17933,
17938,
17943,
17948,
17953,
17958,
17963,
17968,
17973,
17978,
17983,
17988,
17993,
17998,
18003,
18008,
18013,
18018,
18023,
18028,
18033,
18038,
18043,
18048,
18053,
18058,
18063,
18068,
18073,
18078,
18083,
18088,
18093,
18098,
18103,
18108,
18113,
18118,
18123,
18128,
18133,
18138,
18143,
18148,
18153,
18158,
18163,
18168,
18173,
18178,
18183,
18188,
18193,
18198,
18203,
18208,
18213,
18218,
18223,
18228,
18233,
18238,
18243,
18248,
18253,
18258,
18263,
18268,
18273,
18278,
18283,
18288,
18293,
18298,
18303,
18308,
18313,
18318,
18323,
18328,
18333,
18338,
18343,
18348,
18353,
18358,
18363,
18368,
18373,
18378,
18383,
18388,
18393,
18398,
18403,
18408,
18413,
18418,
18423,
18428,
18433,
18438,
18443,
18448,
18453,
18458,
18463,
18468,
18473,
18478,
18483,
18488,
18493,
18498,
18503,
18508,
18513,
18518,
18523,
18528,
18533,
18538,
18543,
18548,
18553,
18558,
18563,
18568,
18573,
18578,
18583,
18588,
18593,
18598,
18603,
18608,
18613,
18618,
18623,
18628,
18633,
18638,
18643,
18648,
18653,
18658,
18663,
18668,
18673,
18678,
18683,
18688,
18693,
18698,
18703,
18708,
18713,
18718,
18723,
18728,
18733,
18738,
18743,
18748,
18753,
18758,
18763,
18768,
18773,
18778,
18783,
18788,
18793,
18798,
18803,
18808,
18813,
18818,
18823,
18828,
18833,
18838,
18843,
18848,
18853,
18858,
18863,
18868,
18873,
18878,
18883,
18888,
18893,
18898,
18903,
18908,
18913,
18918,
18923,
18928,
18933,
18938,
18943,
18948,
18953,
18958,
18963,
18968,
18973,
18978,
18983,
18988,
18993,
18998,
19003,
19008,
19013,
19018,
19023,
19028,
19033,
19038,
19043,
19048,
19053,
19058,
19063,
19068,
19073,
19078,
19083,
19088,
19093,
19098,
19103,
19108,
19113,
19118,
19123,
19128,
19133,
19138,
19143,
19148,
19153,
19158,
19163,
19168,
19173,
19178,
19183,
19188,
19193,
19198,
19203,
19208,
19213,
19218,
19223,
19228,
19233,
19238,
19243,
19248,
19253,
19258,
19263,
19268,
19273,
19278,
19283,
19288,
19293,
19298,
19303,
19308,
19313,
19318,
19323,
19328,
19333,
19338,
19343,
19348,
19353,
19358,
19363,
19368,
19373,
19378,
19383,
19388,
19393,
19398,
19403,
19408,
19413,
19418,
19423,
19428,
19433,
19438,
19443,
19448,
19453,
19458,
19463,
19468,
19473,
19478,
19483,
19488,
19493,
19498,
19503,
19508,
19513,
19518,
19523,
19528,
19533,
19538,
19543,
19548,
19553,
19558,
19563,
19568,
19573,
19578,
19583,
19588,
19593,
19598,
19603,
19608,
19613,
19618,
19623,
19628,
19633,
19638,
19643,
19648,
19653,
19658,
19663,
19668,
19673,
19678,
19683,
19688,
19693,
19698,
19703,
19708,
19713,
19718,
19723,
19728,
19733,
19738,
19743,
19748,
19753,
19758,
19763,
19768,
19773,
19778,
19783,
19788,
19793,
19798,
19803,
19808,
19813,
19818,
19823,
19828,
19833,
19838,
19843,
19848,
19853,
19858,
19863,
19868,
19873,
19878,
19883,
19888,
19893,
19898,
19903,
19908,
19913,
19918,
19923,
19928,
19933,
19938,
19943,
19948,
19953,
19958,
19963,
19968,
19973,
19978,
19983,
19988,
19993,
19998,
20003,
20008,
20013,
20018,
20023,
20028,
20033,
20038,
20043,
20048,
20053,
20058,
20063,
20068,
20073,
20078,
20083,
20088,
20093,
20098,
20103,
20108,
20113,
20118,
20123,
20128,
20133,
20138,
20143,
20148,
20153,
20158,
20163,
20168,
20173,
20178,
20183,
20188,
20193,
20198,
20203,
20208,
20213,
20218,
20223,
20228,
20233,
20238,
20243,
20248,
20253,
20258,
20263,
20268,
20273,
20278,
20283,
20288,
20293,
20298,
20303,
20308,
20313,
20318,
20323,
20328,
20333,
20338,
20343,
20348,
20353,
20358,
20363,
20368,
20373,
20378,
20383,
20388,
20393,
20398,
20403,
20408,
20413,
20418,
20423,
20428,
20433,
20438,
20443,
20448,
20453,
20458,
20463,
20468,
20473,
20478,
20483,
20488,
20493,
20498,
20503,
20508,
20513,
20518,
20523,
20528,
20533,
20538,
20543,
20548,
20553,
20558,
20563,
20568,
20573,
20578,
20583,
20588,
20593,
20598,
20603,
20608,
20613,
20618,
20623,
20628,
20633,
20638,
20643,
20648,
20653,
20658,
20663,
20668,
20673,
20678,
20683,
20688,
20693,
20698,
20703,
20708,
20713,
20718,
20723,
20728,
20733,
20738,
20743,
20748,
20753,
20758,
20763,
20768,
20773,
20778,
20783,
20788,
20793,
20798,
20803,
20808,
20813,
20818,
20823,
20828,
20833,
20838,
20843,
20848,
20853,
20858,
20863,
20868,
20873,
20878,
20883,
20888,
20893,
20898,
20903,
20908,
20913,
20918,
20923,
20928,
20933,
20938,
20943,
20948,
20953,
20958,
20963,
20968,
20973,
20978,
20983,
20988,
20993,
20998,
21003,
21008,
21013,
21018,
21023,
21028,
21033,
21038,
21043,
21048,
21053,
21058,
21063,
21068,
21073,
21078,
21083,
21088,
21093,
21098,
21103,
21108,
21113,
21118,
21123,
21128,
21133,
21138,
21143,
21148,
21153,
21158,
21163,
21168,
21173,
21178,
21183,
21188,
21193,
21198,
21203,
21208,
21213,
21218,
21223,
21228,
21233,
21238,
21243,
21248,
21253,
21258,
21263,
21268,
21273,
21278,
21283,
21288,
21293,
21298,
21303,
21308,
21313,
21318,
21323,
21328,
21333,
21338,
21343,
21348,
21353,
21358,
21363,
21368,
21373,
21378,
21383,
21388,
21393,
21398,
21403,
21408,
21413,
21418,
21423,
21428,
21433,
21438,
21443,
21448,
21453,
21458,
21463,
21468,
21473,
21478,
21483,
21488,
21493,
21498,
21503,
21508,
21513,
21518,
21523,
21528,
21533,
21538,
21543,
21548,
21553,
21558,
21563,
21568,
21573,
21578,
21583,
21588,
21593,
21598,
21603,
21608,
21613,
21618,
21623,
21628,
21633,
21638,
21643,
21648,
21653,
21658,
21663,
21668,
21673,
21678,
21683,
21688,
21693,
21698,
21703,
21708,
21713,
21718,
21723,
21728,
21733,
21738,
21743,
21748,
21753,
21758,
21763,
21768,
21773,
21778,
21783,
21788,
21793,
21798,
21803,
21808,
21813,
21818,
21823,
21828,
21833,
21838,
21843,
21848,
21853,
21858,
21863,
21868,
21873,
21878,
21883,
21888,
21893,
21898,
21903,
21908,
21913,
21918,
21923,
21928,
21933,
21938,
21943,
21948,
21953,
21958,
21963,
21968,
21973,
21978,
21983,
21988,
21993,
21998,
22003,
22008,
22013,
22018,
22023,
22028,
22033,
22038,
22043,
22048,
22053,
22058,
22063,
22068,
22073,
22078,
22083,
22088,
22093,
22098,
22103,
22108,
22113,
22118,
22123,
22128,
22133,
22138,
22143,
22148,
22153,
22158,
22163,
22168,
22173,
22178,
22183,
22188,
22193,
22198,
22203,
22283,
22286,
22335,
22338,
22409,
22480,
22540,
22543,
22615,
22618,
22690,
22759,
22826,
22893,
22962,
23031,
23096,
23100,
23101,
23136,
23168,
23197,
23227,
23249,
23273,
23296,
23320,
23343,
23366,
23367,
23400,
23432,
23464,
23497,
23498,
23531,
23532,
23564,
23596,
23628,
23660,
23692,
23724,
23756,
23788,
23820,
23852,
23884,
23916,
23948,
23980,
24012,
24044,
24076,
24108,
24139,
24171,
24203,
24235,
24271,
24308,
24346,
24384,
24425,
24457,
24491,
24523,
24561,
24593,
24624,
24652,
24678,
24711,
24712,
24742,
24765,
24792,
24816,
24839,
24863,
24889,
24912,
24934,
24957,
24980,
25004,
25025,
25046,
25067,
25091,
25113,
25137,
25160,
25182,
25205,
25206,
25230,
25264,
25265,
25309,
25359,
25360,
25384,
25403,
25410,
25411,
25443,
25444,
25465,
25487,
25519,
25555,
25585,
25611,
25645,
25646,
25671,
25673,
25722,
25778,
25784,
25851,
25908,
26004,
26025,
26094,
26157,
26193,
26219,
26225,
26248,
26254,
26312,
26318,
26326,
26433,
26536,
26542,
26576,
26609,
26677,
26717,
26757,
26825,
26884,
26918,
26927,
26990,
27029,
27125,
27134,
27157,
27230,
27290,
27312,
27318,
27403,
27409,
27443,
27477,
27486,
27559,
27622,
27661,
27753,
27817,
27826,
27848,
27854,
27857,
27858,
27886,
27888,
27933,
27945,
28044,
28106,
28134,
28197,
28203,
28233,
28276,
28286,
28400,
28460,
28514,
28524,
28548,
28554,
28557,
28637,
28639,
28655,
28752,
28754,
28755,
28846,
28848,
28896,
28938,
28939,
28997,
29028,
29034,
29085,
29138,
29139,
29164,
29218,
29228,
29342,
29388,
29433,
29434,
29476,
29486,
29487,
29526,
29536,
29582,
29653,
29693,
29759,
29760,
29809,
29823,
29879,
29988,
30006,
30117,
30118,
30160,
30205,
30251,
30269,
30270,
30317,
30331,
30341,
30347,
30348,
30406,
30407,
30477,
30526,
30553,
30554,
30630,
30658,
30659,
30690,
30692,
30693,
30792,
30794,
30872,
30908,
30957,
30958,
31006,
31052,
31053,
31085,
31086,
31125,
31151,
31157,
31207,
31238,
31239,
31301,
31375,
31376,
31461,
31546,
31547,
31589,
31590,
31638,
31639,
31671,
31672,
31705,
31706,
31735,
31741,
31743,
31744,
31864,
31866,
31890,
31896,
31933,
31978,
31979,
32032,
32093,
32142,
32158,
32240,
32330,
32424,
32519,
32571,
32656,
32657,
32714,
32724,
32764,
32835,
32836,
32864,
32874,
32875,
32905,
32942,
32969,
32970,
33010,
33079,
33103,
33109,
33111,
33112,
33155,
33157,
33216,
33218,
33219,
33296,
33298,
33332,
33412,
33491,
33570,
33625,
33665,
33709,
33715,
33803,
33882,
33888,
33939,
33945,
34039,
34106,
34183,
34189,
34190,
34218,
34219,
34279,
34280,
34337,
34363,
34369,
34425,
34457,
34463,
34464,
34504,
34506,
34507,
34568,
34570,
34610,
34611,
34655,
34693,
34699,
34734,
34771,
34809,
34853,
34889,
34930,
34964,
35012,
35045,
35077,
35110,
35158,
35194,
35231,
35273,
35314,
35354,
35394,
35427,
35470,
35509,
35545,
35577,
35623,
35665,
35709,
35740,
35782,
35824,
35869,
35908,
35942,
35979,
36011,
36046,
36083,
36090,
36091,
36169,
36214,
36275,
36324,
36366,
36400,
36401,
36439,
36441,
36442,
36504,
36506,
36532,
36538,
36597,
36628,
36629,
36702,
36708,
36709,
36748,
36754,
36826,
36870,
36871,
36944,
36950,
36951,
36999,
37036,
37038,
37039,
37090,
37092,
37133,
37134,
37185,
37186,
37231,
37237,
37299,
37354,
37414,
37467,
37468,
37509,
37515,
37516,
37586,
37627,
37700,
37702,
37703,
37801,
37803,
37864,
37898,
37899,
37978,
38056,
38084,
38150,
38151,
38228,
38265,
38326,
38328,
38329,
38364,
38366,
38392,
38485,
38491,
38556,
38597,
38607,
38644,
38645,
38728,
38779,
38845,
38859,
38904,
38930,
38944,
38954,
38969,
38975,
38976,
39049,
39128,
39129,
39207,
39244,
39307,
39308,
39349,
39355,
39389,
39399,
39464,
39504,
39514,
39561,
39567,
39568,
39617,
39710,
39716,
39786,
39828,
39838,
39885,
39886,
39948,
39982,
40027,
40053,
40067,
40077,
40092,
40098,
40099,
40188,
40220,
40226,
40292,
40293,
40367,
40404,
40439,
40445,
40446,
40471,
40497,
40498,
40556,
40677,
40678,
40723,
40792,
40793,
40826,
40875,
40876,
40902,
40903,
40940,
40946,
40980,
40990,
41055,
41095,
41105,
41148,
41154,
41155,
41204,
41210,
41254,
41299,
41305,
41306,
41367,
41385,
41387,
41388,
41435,
41437,
41461,
41467,
41499,
41576,
41694,
41700,
41722,
41728,
41758,
41835,
41951,
41957,
41959,
41960,
42005,
42007,
42040,
42144,
42172,
42178,
42214,
42215,
42246,
42288,
42328,
42394,
42478,
42531,
42552,
42558,
42585,
42586,
42618,
42718,
42746,
42752,
42788,
42789,
42827,
42917,
42966,
42976,
43023,
43091,
43179,
43204,
43250,
43260,
43266,
43291,
43293,
43294,
43361,
43363,
43430,
43475,
43481,
43535,
43592,
43593,
43645,
43718,
43752,
43790,
43791,
43869,
43879,
43939,
43999,
44009,
44010,
44093,
44099,
44149,
44155,
44184,
44215,
44216,
44268,
44329,
44330,
44452,
44507,
44536,
44537,
44592,
44665,
44671,
44717,
44723,
44775,
44830,
44900,
44906,
44908,
44909,
44989,
44991,
45048,
45054,
45091,
45141,
45147,
45227,
45233,
45258,
45324,
45325,
45374,
45384,
45451,
45512,
45541,
45600,
45644,
45681,
45699,
45784,
45842,
45891,
45951,
45999,
46050,
46115,
46133,
46200,
46201,
46234,
46299,
46337,
46382,
46383,
46393,
46406,
46416,
46453,
46516,
46573,
46598,
46599,
46636,
46676,
46677,
46740,
46741,
46770,
46831,
46832,
46901,
46941,
46975,
47016,
47026,
47032,
47034,
47035,
47088,
47090,
47121,
47187,
47240,
47297,
47298,
47300,
47301,
47363,
47365,
47423,
47503,
47504,
47552,
47558,
47615,
47661,
47705,
47750,
47790,
47832,
47842,
47920,
47995,
48005,
48040,
48070,
48071,
48128,
48164,
48210,
48216,
48217,
48266,
48267,
48300,
48358,
48414,
48468,
48487,
48536,
48538,
48539,
48601,
48603,
48666,
48691,
48697,
48730,
48736,
48737,
48776,
48814,
48845,
48851,
48917,
49013,
49117,
49141,
49147,
49148,
49198,
49204,
49244,
49306,
49307,
49369,
49440,
49491,
49519,
49520,
49573,
49579,
49580,
49617,
49648,
49654,
49718,
49814,
49838,
49839,
49864,
49870,
49871,
49898,
49924,
49930,
49992,
50052,
50105,
50128,
50181,
50187,
50256,
50281,
50306,
50312,
50372,
50452,
50562,
50563,
50617,
50627,
50668,
50734,
50798,
50855,
50880,
50937,
50938,
50989,
51039,
51079,
51130,
51131,
51199,
51236,
51237,
51279,
51316,
51326,
51332,
51334,
51335,
51382,
51384,
51456,
51502,
51529,
51530,
51590,
51591,
51625,
51626,
51672,
51732,
51734,
51735,
51790,
51792,
51821,
51860,
51892,
51893,
51937,
51975,
51981,
52016,
52051,
52081,
52113,
52143,
52175,
52208,
52246,
52281,
52317,
52353,
52388,
52423,
52459,
52495,
52534,
52569,
52607,
52641,
52677,
52707,
52740,
52777,
52808,
52841,
52879,
52909,
52944,
52976,
53008,
53044,
53082,
53114,
53145,
53176,
53209,
53253,
53292,
53326,
53363,
53370,
53371,
53449,
53494,
53555,
53604,
53646,
53680,
53681,
53719,
53720,
53722,
53723,
53779,
53781,
53818,
53846,
53852,
53913,
53946,
53947,
54019,
54025,
54026,
54064,
54070,
54141,
54184,
54185,
54266,
54272,
54273,
54304,
54310,
54374,
54410,
54411,
54481,
54487,
54488,
54536,
54572,
54574,
54575,
54659,
54661,
54696,
54697,
54748,
54749,
54796,
54828,
54829,
54858,
54859,
54934,
54969,
55042,
55044,
55045,
55095,
55097,
55186,
55228,
55244,
55294,
55325,
55356,
55358,
55359,
55409,
55411,
55450,
55466,
55543,
55576,
55578,
55579,
55636,
55637,
55714,
55790,
55849,
55853,
55931,
56012,
56014,
56054,
56055,
56095,
56112,
56139,
56140,
56166,
56225,
56226,
56291,
56371,
56377,
56482,
56488,
56497,
56562,
56563,
56631,
56632,
56684,
56686,
56687,
56775,
56777,
56813,
56819,
56865,
56908,
56914,
56943,
56944,
57021,
57069,
57127,
57128,
57205,
57239,
57329,
57363,
57364,
57427,
57433,
57457,
57467,
57497,
57574,
57647,
57670,
57707,
57784,
57856,
57879,
57900,
57969,
57987,
58068,
58149,
58167,
58190,
58200,
58206,
58207,
58280,
58282,
58283,
58399,
58401,
58524,
58526,
58527,
58630,
58632,
58737,
58798,
58861,
58872,
58891,
58907,
58918,
58973,
59016,
59056,
59094,
59158,
59210,
59246,
59328,
59329,
59362,
59400,
59406,
59422,
59462,
59481,
59497,
59531,
59550,
59566,
59607,
59626,
59642,
59694,
59713,
59729,
59780,
59799,
59816,
59835,
59841,
59899,
59961,
60015,
60016,
60075,
60097,
60124,
60171,
60206,
60284,
60317,
60374,
60429,
60493,
60523,
60556,
60571,
60621,
60622,
60687,
60709,
60711,
60712,
60748,
60750,
60806,
60821,
60877,
60929,
60931,
60932,
61047,
61049,
61141,
61142,
61171,
61198,
61199,
61236,
61237,
61261,
61267,
61296,
61346,
61359,
61369,
61427,
61470,
61506,
61532,
61542,
61543,
61570,
61643,
61644,
61673,
61734,
61740,
61741,
61763,
61783,
61784,
61810,
61812,
61813,
61893,
61895,
61913,
61930,
61931,
62000,
62001,
62042,
62048,
62109,
62115,
62124,
62130,
62172,
62236,
62237,
62267,
62277,
62313,
62314,
62435,
62545,
62609,
62610,
62686,
62696,
62709,
62775,
62870,
62871,
62908,
62942,
62952,
63036,
63123,
63133,
63139,
63140,
63157,
63159,
63160,
63195,
63197,
63235,
63252,
63254,
63255,
63333,
63335,
63393,
63395,
63396,
63467,
63469,
63556,
63558,
63559,
63635,
63637,
63672,
63673,
63700,
63716,
63717,
63798,
63799,
63854,
63855,
63941,
64017,
64018,
64106,
64107,
64146,
64152,
64198,
64257,
64314,
64379,
64440,
64469,
64488,
64489,
64535,
64594,
64651,
64716,
64777,
64806,
64825,
64826,
64872,
64941,
64958,
64977,
64983,
64985,
64986,
65025,
65027,
65054,
65070,
65071,
65112,
65118,
65164,
65223,
65242,
65243,
65289,
65348,
65367,
65368,
65414,
65481,
65500,
65517,
65536,
65542,
65543,
65570,
65572,
65573,
65787,
65789,
65920,
65922,
65923,
65985,
65987,
66020,
66077,
66078,
66185,
66187,
66188,
66244,
66246,
66275,
66316,
66322,
66376,
66411,
66412,
66482,
66552,
66622,
66692,
66762,
66832,
66833,
66869,
66875,
66893,
66895,
66896,
67027,
67029,
67091,
67092,
67093,
67128,
67150,
67178,
67224,
67318,
67387,
67456,
67487,
67538,
67544,
67595,
67605,
67653,
67699,
67722,
67771,
67817,
67840,
67889,
67935,
67958,
68007,
68053,
68076,
68137,
68194,
68217,
68279,
68337,
68360,
68421,
68478,
68501,
68562,
68619,
68642,
68704,
68762,
68785,
68846,
68903,
68926,
68977,
69029,
69052,
69103,
69156,
69179,
69228,
69274,
69297,
69345,
69390,
69413,
69460,
69481,
69504,
69514,
69520,
69521,
69580,
69581,
69631,
69637,
69673,
69674,
69744,
69822,
69862,
69920,
69954,
69989,
69990,
70024,
70056,
70095,
70127,
70128,
70214,
70215,
70251,
70344,
70345,
70398,
70471,
70527,
70533,
70534,
70577,
70642,
70644,
70645,
70828,
70830,
70871,
70877,
70946,
70953,
70954,
70991,
70997,
71014,
71059,
71079,
71122,
71129,
71158,
71197,
71238,
71244,
71302,
71340,
71350,
71427,
71428,
71495,
71541,
71567,
71581,
71591,
71592,
71632,
71694,
71725,
71735,
71736,
71801,
71802,
71876,
71914,
71940,
72009,
72040,
72109,
72119,
72125,
72160,
72209,
72215,
72217,
72218,
72378,
72380,
72421,
72427,
72496,
72503,
72504,
72541,
72547,
72564,
72609,
72629,
72672,
72679,
72708,
72747,
72788,
72794,
72860,
72861,
72907,
72985,
73067,
73134,
73196,
73217,
73265,
73275,
73276,
73305,
73315,
73381,
73458,
73484,
73494,
73495,
73522,
73584,
73615,
73625,
73687,
73761,
73808,
73832,
73838,
73860,
73909,
73915,
73917,
73918,
74029,
74031,
74092,
74093,
74166,
74167,
74250,
74251,
74278,
74381,
74427,
74539,
74591,
74675,
74718,
74738,
74739,
74763,
74824,
74897,
74992,
74993,
75040,
75064,
75125,
75217,
75242,
75243,
75266,
75307,
75328,
75334,
75393,
75444,
75469,
75475,
75501,
75507,
75566,
75618,
75643,
75649,
75650,
75713,
75819,
75825,
75853,
75945,
75951,
75952,
76001,
76002,
76008,
76032,
76114,
76120,
76121,
76171,
76172,
76224,
76226,
76227,
76334,
76336,
76366,
76396,
76397,
76478,
76557,
76558,
76624,
76673,
76727,
76728,
76797,
76842,
76893,
76902,
76988,
77032,
77034,
77035,
77137,
77139,
77199,
77200,
77256,
77257,
77305,
77353,
77355,
77356,
77393,
77395,
77446,
77447,
77476,
77501,
77502,
77534,
77535,
77614,
77637,
77666,
77667,
77698,
77742,
77744,
77745,
77850,
77852,
77911,
77912,
77945,
78006,
78007,
78036,
78102,
78177,
78239,
78286,
78310,
78311,
78355,
78401,
78402,
78454,
78456,
78457,
78498,
78500,
78550,
78552,
78553,
78659,
78661,
78685,
78737,
78738,
78797,
78798,
78836,
78888,
78889,
78918,
78920,
78921,
78963,
78965,
79015,
79016,
79046,
79048,
79049,
79158,
79160,
79162,
79163,
79266,
79268,
79270,
79271,
79378,
79380,
79463,
79464,
79498,
79560,
79561,
79599,
79605,
79642,
79677,
79716,
79755,
79803,
79851,
79884,
79915,
79958,
79993,
80032,
80064,
80102,
80141,
80177,
80216,
80223,
80224,
80275,
80320,
80381,
80430,
80472,
80506,
80507,
80545,
80546,
80576,
80606,
80607,
80688,
80767,
80768,
80807,
80833,
80890,
80982,
81030,
81055,
81056,
81091,
81156,
81202,
81226,
81253,
81311,
81317,
81361,
81392,
81411,
81454,
81479,
81513,
81530,
81562,
81581,
81598,
81640,
81692,
81702,
81727,
81760,
81777,
81811,
81881,
81900,
81910,
81916,
81967,
82011,
82032,
82033,
82065,
82117,
82118,
82157,
82222,
82223,
82265,
82266,
82321,
82376,
82449,
82493,
82514,
82515,
82563,
82600,
82601,
82654,
82655,
82689,
82753,
82777,
82850,
82946,
82952,
83006,
83066,
83141,
83165,
83198,
83204,
83205,
83260,
83262,
83263,
83374,
83376,
83449,
83502,
83503,
83586,
83587,
83653,
83742,
83744,
83745,
83882,
83884,
83957,
84010,
84059,
84148,
84149,
84216,
84217,
84264,
84329,
84331,
84332,
84440,
84442,
84515,
84565,
84599,
84600,
84618,
84706,
84775,
84784,
84811,
84812,
84862,
84914,
84969,
85014,
85035,
85037,
85038,
85141,
85143,
85216,
85272,
85327,
85328,
85383,
85455,
85461,
85507,
85541,
85542,
85586,
85596,
85651,
85708,
85746,
85756,
85757,
85778,
85843,
85926,
85979,
86008,
86014,
86016,
86017,
86122,
86124,
86197,
86253,
86308,
86309,
86374,
86452,
86453,
86511,
86558,
86578,
86580,
86581,
86682,
86684,
86750,
86802,
86803,
86880,
86886,
86949,
86997,
87022,
87028,
87030,
87031,
87140,
87142,
87215,
87268,
87269,
87346,
87412,
87459,
87483,
87484,
87545,
87618,
87713,
87746,
87752,
87793,
87812,
87856,
87919,
87978,
87997,
88041,
88104,
88163,
88182,
88188,
88190,
88191,
88281,
88283,
88390,
88392,
88393,
88494,
88496,
88571,
88647,
88661,
88730,
88778,
88780,
88781,
88893,
88895,
89024,
89026,
89027,
89135,
89137,
89161,
89294,
89301,
89303,
89304,
89367,
89369,
89453,
89455,
89456,
89496,
89498,
89552,
89654,
89675,
89677,
89678,
89748,
89750,
89804,
89806,
89807,
89867,
89869,
89940,
89964,
90056,
90062,
90105,
90112,
90114,
90115,
90257,
90259,
90448,
90481,
90531,
90608,
90638,
90658,
90684,
90732,
90738,
90788,
90814,
90867,
90868,
90946,
90947,
90987,
91089,
91134,
91135,
91166,
91172,
91181,
91187,
91245,
91276,
91298,
91368,
91381,
91428,
91429,
91522,
91588,
91589,
91660,
91661,
91693,
91699,
91700,
91728,
91744,
91745,
91800,
91821,
91892,
91911,
91917,
92006,
92091,
92132,
92173,
92214,
92255,
92300,
92342,
92390,
92446,
92512,
92610,
92705,
92821,
92856,
92891,
92943,
92953,
92983,
93039,
93062,
93092,
93134,
93179,
93202,
93232,
93253,
93298,
93338,
93361,
93372,
93399,
93506,
93567,
93628,
93689,
93793,
93864,
93908,
93970,
94032,
94136,
94207,
94251,
94313,
94375,
94381,
94390,
94396,
94455,
94535,
94560,
94566,
94594,
94621,
94692,
94765,
94821,
94858,
94896,
94917,
94983,
95045,
95105,
95126,
95127,
95146,
95152,
95203,
95213,
95245,
95332,
95355,
95391,
95470,
95493,
95529,
95601,
95657,
95680,
95713,
95734,
95806,
95860,
95883,
95893,
95899,
95957,
96047,
96135,
96182,
96344,
96419,
96573,
96634,
96708,
96730,
96792,
96890,
96936,
96960,
97014,
97015,
97081,
97102,
97129,
97195,
97290,
97327,
97348,
97414,
97415,
97470,
97565,
97586,
97645,
97726,
97747,
97748,
97801,
97901,
97922,
97923,
97980,
98001,
98096,
98171,
98172,
98194,
98256,
98298,
98318,
98373,
98374,
98432,
98453,
98480,
98537,
98603,
98624,
98682,
98739,
98740,
98766,
98824,
98845,
98898,
98954,
98975,
99031,
99052,
99107,
99128,
99185,
99206,
99261,
99319,
99320,
99361,
99415,
99447,
99468,
99520,
99541,
99593,
99629,
99650,
99702,
99739,
99777,
99798,
99850,
99906,
99936,
99957,
100011,
100032,
100088,
100143,
100164,
100214,
100241,
100262,
100317,
100338,
100392,
100423,
100444,
100500,
100521,
100577,
100598,
100648,
100649,
100671,
100725,
100781,
100787,
100842,
100930,
101008,
101084,
101119,
101164,
101174,
101241,
101309,
101378,
101448,
101482,
101515,
101538,
101548,
101616,
101617,
101687,
101748,
101819,
101897,
101957,
102038,
102099,
102160,
102166,
102167,
102221,
102222,
102275,
102276,
102335,
102390,
102469,
102470,
102525,
102527,
102528,
102666,
102668,
102709,
102725,
102775,
102791,
102856,
102912,
102914,
102915,
103002,
103004,
103060,
103162,
103184,
103190,
103272,
103300,
103384,
103390,
103391,
103416,
103422,
103493,
103552,
103573,
103632,
103708,
103729,
103730,
103805,
103882,
103942,
103979,
104017,
104038,
104108,
104174,
104234,
104255,
104256,
104292,
104319,
104355,
104433,
104459,
104498,
104499,
104558,
104591,
104627,
104648,
104649,
104720,
104741,
104742,
104801,
104896,
104917,
104918,
104981,
105060,
105081,
105082,
105106,
105148,
105171,
105248,
105311,
105312,
105370,
105466,
105575,
105627,
105648,
105649,
105712,
105771,
105830,
105889,
105890,
105911,
105917,
105935,
105937,
105938,
106037,
106039,
106149,
106195,
106248,
106298,
106299,
106340,
106362,
106455,
106488,
106505,
106507,
106508,
106555,
106557,
106591,
106607,
106725,
106815,
106917,
107022,
107069,
107199,
107236,
107328,
107356,
107358,
107359,
107461,
107463,
107490,
107491,
107529,
107535,
107569,
107583,
107642,
107719,
107751,
107769,
107822,
107899,
108001,
108051,
108160,
108182,
108200,
108214,
108233,
108267,
108281,
108364,
108395,
108413,
108459,
108506,
108528,
108609,
108635,
108708,
108738,
108790,
108877,
108907,
108933,
108955,
108956,
109024,
109061,
109062,
109132,
109133,
109201,
109202,
109241,
109316,
109334,
109348,
109367,
109400,
109414,
109498,
109554,
109568,
109587,
109617,
109631,
109693,
109765,
109796,
109814,
109890,
109960,
110082,
110100,
110114,
110133,
110150,
110294,
110371,
110444,
110548,
110567,
110573,
110574,
110648,
110650,
110651,
110727,
110729,
110792,
110863,
110864,
110917,
110918,
110982,
111050,
111093,
111099,
111115,
111152,
111153,
111198,
111230,
111268,
111269,
111331,
111344,
111402,
111437,
111471,
111472,
111538,
111597,
111624,
111638,
111712,
111743,
111757,
111758,
111815,
111816,
111849,
111882,
111892,
111925,
111978,
111984,
112043,
112098,
112100,
112101,
112164,
112166,
112191,
112193,
112194,
112267,
112368,
112370,
112401,
112402,
112455,
112553,
112653,
112674,
112675,
112728,
112836,
112857,
112858,
112885,
112891,
112951,
113053,
113078,
113084,
113085,
113138,
113236,
113257,
113258,
113281,
113355,
113357,
113358,
113395,
113397,
113450,
113452,
113453,
113540,
113542,
113562,
113568,
113632,
113676,
113682,
113691,
113697,
113761,
113799,
113805,
113807,
113808,
113870,
113872,
113892,
113898,
113943,
113998,
114004,
114013,
114019,
114058,
114113,
114119,
114121,
114122,
114233,
114235,
114280,
114326,
114327,
114386,
114471,
114492,
114494,
114495,
114552,
114554,
114572,
114649,
114658,
114726,
114775,
114800,
114802,
114803,
114891,
114893,
114911,
114917,
114951,
115025,
115074,
115093,
115125,
115157,
115171,
115214,
115232,
115290,
115364,
115440,
115441,
115507,
115508,
115575,
115640,
115658,
115679,
115697,
115778,
115849,
115926,
115944,
115958,
115975,
115989,
116059,
116122,
116188,
116249,
116263,
116282,
116299,
116366,
116385,
116391,
116393,
116394,
116435,
116437,
116500,
116528,
116529,
116573,
116611,
116617,
116661,
116705,
116744,
116782,
116815,
116848,
116882,
116919,
116957,
116995,
117033,
117066,
117103,
117138,
117176,
117212,
117254,
117287,
117325,
117361,
117405,
117445,
117452,
117453,
117531,
117576,
117637,
117686,
117728,
117762,
117763,
117801,
117803,
117804,
117843,
117845,
117881,
117918,
117924,
117994,
118036,
118037,
118108,
118114,
118115,
118141,
118178,
118179,
118233,
118262,
118264,
118265,
118332,
118334,
118356,
118426,
118435,
118496,
118554,
118556,
118557,
118664,
118666,
118730,
118851,
118956,
118993,
119123,
119144,
119239,
119282,
119350,
119352,
119353,
119398,
119400,
119465,
119467,
119468,
119572,
119574,
119600,
119601,
119647,
119648,
119702,
119750,
119800,
119852,
119853,
119899,
119905,
119963,
120024,
120079,
120133,
120157,
120158,
120189,
120190,
120251,
120282,
120288,
120290,
120291,
120343,
120345,
120362,
120428,
120430,
120431,
120494,
120496,
120515,
120516,
120546,
120552,
120593,
120667,
120708,
120782,
120856,
120930,
120931,
121005,
121006,
121035,
121109,
121110,
121184,
121190,
121191,
121209,
121211,
121212,
121313,
121315,
121383,
121384,
121448,
121449,
121514,
121548,
121648,
121649,
121733,
121785,
121812,
121873,
121874,
121917,
121985,
121986,
122040,
122109,
122111,
122112,
122174,
122176,
122223,
122267,
122278,
122308,
122334,
122340,
122386,
122432,
122478,
122524,
122570,
122576,
122577,
122594,
122651,
122698,
122723,
122725,
122726,
122797,
122799,
122851,
122966,
122987,
122989,
122990,
123032,
123034,
123086,
123088,
123089,
123162,
123164,
123220,
123328,
123349,
123351,
123352,
123446,
123448,
123512,
123513,
123584,
123621,
123667,
123727,
123728,
123803,
123809,
123892,
123960,
123966,
123967,
124056,
124058,
124059,
124128,
124130,
124162,
124185,
124191,
124249,
124307,
124366,
124425,
124488,
124563,
124569,
124570,
124589,
124648,
124697,
124722,
124724,
124725,
124791,
124793,
124824,
124846,
124852,
124909,
124963,
125046,
125052,
125053,
125071,
125129,
125177,
125202,
125204,
125205,
125265,
125267,
125336,
125392,
125442,
125490,
125540,
125595,
125597,
125598,
125640,
125642,
125699,
125701,
125702,
125795,
125797,
125867,
125944,
125971,
126026,
126057,
126125,
126141,
126252,
126363,
126437,
126549,
126606,
126672,
126761,
126804,
126859,
126941,
127023,
127048,
127073,
127112,
127136,
127142,
127220,
127255,
127271,
127277,
127297,
127314,
127329,
127335,
127372,
127414,
127420,
127529,
127541,
127547,
127569,
127629,
127639,
127712,
127751,
127771,
127781,
127799,
127818,
127889,
127899,
127972,
128011,
128031,
128041,
128069,
128088,
128207,
128213,
128244,
128354,
128438,
128571,
128619,
128666,
128714,
128731,
128751,
128753,
128754,
128842,
128844,
128921,
128956,
129018,
129075,
129076,
129127,
129179,
129200,
129201,
129263,
129313,
129334,
129335,
129359,
129426,
129459,
129531,
129537,
129582,
129589,
129590,
129641,
129643,
129644,
129711,
129713,
129772,
129865,
129886,
129888,
129889,
129938,
129940,
129999,
130001,
130002,
130062,
130089,
130124,
130151,
130193,
130220,
130249,
130284,
130313,
130348,
130379,
130420,
130422,
130473,
130560,
130581,
130582,
130617,
130671,
130757,
130778,
130779,
130793,
130851,
130852,
130879,
130938,
130993,
131018,
131019,
131033,
131065,
131088,
131094,
131139,
131184,
131229,
131235,
131254,
131311,
131360,
131385,
131386,
131398,
131438,
131515,
131516,
131563,
131608,
131663,
131669,
131721,
131765,
131829,
131892,
131902,
131952,
131987,
132061,
132062,
132091,
132101,
132116,
132122,
132145,
132191,
132192,
132248,
132367,
132388,
132389,
132410,
132431,
132521,
132544,
132550,
132605,
132683,
132763,
132769,
132823,
132864,
132885,
132886,
132905,
132965,
132992,
132998,
133063,
133119,
133166,
133272,
133297,
133353,
133359,
133360,
133419,
133471,
133559,
133659,
133680,
133731,
133732,
133744,
133763,
133769,
133833,
133834,
133855,
133865,
133954,
134069,
134132,
134200,
134268,
134333,
134389,
134418,
134428,
134538,
134539,
134594,
134600,
134601,
134647,
134648,
134699,
134701,
134702,
134774,
134776,
134811,
134817,
134856,
134931,
134950,
134986,
135056,
135075,
135133,
135241,
135344,
135363,
135369,
135371,
135372,
135438,
135440,
135485,
135511,
135512,
135560,
135561,
135615,
135683,
135685,
135686,
135758,
135760,
135791,
135860,
135869,
135971,
135973,
135974,
136055,
136057,
136099,
136105,
136136,
136209,
136228,
136257,
136363,
136468,
136487,
136504,
136576,
136595,
136601,
136603,
136604,
136685,
136687,
136705,
136775,
136792,
136798,
136836,
136854,
136875,
136881,
136920,
136926,
136991,
137034,
137108,
137153,
137159,
137160,
137187,
137249,
137308,
137309,
137374,
137380,
137443,
137515,
137591,
137652,
137717,
137718,
137784,
137794,
137876,
137939,
138009,
138019,
138025,
138027,
138028,
138090,
138092,
138119,
138179,
138259,
138306,
138387,
138453,
138519,
138521,
138522,
138598,
138600,
138692,
138693,
138726,
138732,
138766,
138804,
138915,
138934,
138972,
139085,
139104,
139110,
139112,
139113,
139185,
139187,
139265,
139371,
139373,
139374,
139449,
139451,
139481,
139544,
139545,
139652,
139736,
139818,
139819,
139875,
139876,
139909,
139915,
139949,
140024,
140043,
140081,
140161,
140180,
140218,
140294,
140313,
140319,
140321,
140322,
140394,
140396,
140444,
140507,
140516,
140612,
140614,
140615,
140686,
140688,
140718,
140786,
140795,
140896,
140898,
140899,
140977,
140979,
141007,
141008,
141049,
141055,
141133,
141211,
141289,
141367,
141445,
141523,
141601,
141679,
141757,
141835,
141913,
141991,
142069,
142147,
142225,
142303,
142358,
142436,
142442,
142443,
142538,
142540,
142541,
142610,
142612,
142658,
142721,
142730,
142826,
142828,
142829,
142894,
142896,
142957,
142959,
142960,
143033,
143035,
143064,
143174,
143183,
143282,
143284,
143285,
143356,
143358,
143410,
143496,
143541,
143562,
143564,
143565,
143631,
143633,
143660,
143720,
143767,
143848,
143917,
143919,
143920,
143995,
143997,
144045,
144108,
144117,
144213,
144215,
144216,
144288,
144290,
144336,
144399,
144408,
144504,
144506,
144507,
144573,
144575,
144602,
144662,
144709,
144790,
144853,
144854,
144856,
144857,
144931,
144933,
144981,
145046,
145055,
145153,
145155,
145156,
145228,
145230,
145276,
145341,
145350,
145448,
145450,
145451,
145523,
145525,
145556,
145572,
145573,
145610,
145680,
145719,
145786,
145787,
145818,
145897,
145899,
145900,
145987,
145989,
146016,
146017,
146057,
146063,
146134,
146205,
146276,
146347,
146418,
146424,
146425,
146520,
146522,
146523,
146598,
146600,
146633,
146649,
146650,
146687,
146757,
146796,
146866,
146867,
146921,
146971,
146972,
146998,
147014,
147015,
147037,
147079,
147119,
147166,
147206,
147253,
147294,
147303,
147343,
147424,
147426,
147427,
147512,
147514,
147564,
147680,
147682,
147683,
147756,
147758,
147792,
147798,
147828,
147900,
147919,
147949,
148022,
148041,
148058,
148163,
148269,
148288,
148294,
148296,
148297,
148370,
148372,
148402,
148470,
148479,
148580,
148582,
148583,
148653,
148655,
148713,
148769,
148770,
148803,
148882,
148883,
148990,
148992,
148993,
149066,
149068,
149101,
149193,
149194,
149301,
149303,
149304,
149383,
149385,
149434,
149468,
149474,
149521,
149560,
149582,
149622,
149623,
149679,
149685,
149686,
149740,
149742,
149743,
149808,
149810,
149870,
149872,
149873,
149934,
149936,
149995,
150071,
150073,
150074,
150128,
150130,
150186,
150192,
150269,
150386,
150417,
150423,
150425,
150426,
150476,
150478,
150505,
150507,
150508,
150556,
150558,
150583,
150585,
150586,
150632,
150634,
150663,
150699,
150714,
150720,
150779,
150833,
150931,
151042,
151141,
151267,
151371,
151481,
151535,
151576,
151647,
151706,
151712,
151714,
151715,
151778,
151780,
151806,
151807,
151849,
151890,
151941,
151942,
151962,
151964,
151965,
152061,
152063,
152119,
152169,
152171,
152172,
152233,
152235,
152278,
152295,
152350,
152352,
152353,
152476,
152478,
152507,
152532,
152558,
152583,
152628,
152672,
152705,
152706,
152722,
152728,
152782,
152832,
152833,
152878,
152968,
152978,
153052,
153096,
153106,
153148,
153158,
153241,
153290,
153300,
153306,
153308,
153309,
153398,
153400,
153429,
153481,
153483,
153484,
153565,
153606,
153608,
153719,
153725,
153808,
153850,
153856,
153877,
153878,
153985,
153991,
154074,
154114,
154120,
154139,
154141,
154142,
154215,
154217,
154273,
154345,
154346,
154385,
154460,
154461,
154494,
154573,
154574,
154681,
154682,
154722,
154799,
154864,
154898,
154942,
154951,
154994,
154996,
154997,
155050,
155052,
155071,
155140,
155141,
155210,
155232,
155288,
155289,
155311,
155327,
155328,
155420,
155421,
155437,
155482,
155488,
155512,
155567,
155647,
155672,
155678,
155687,
155693,
155721,
155776,
155835,
155915,
155940,
155941,
155984,
155990,
155992,
155993,
156056,
156058,
156168,
156169,
156232,
156294,
156295,
156344,
156446,
156555,
156576,
156577,
156603,
156604,
156621,
156670,
156744,
156794,
156815,
156873,
156931,
156998,
157047,
157096,
157145,
157146,
157163,
157212,
157286,
157348,
157369,
157427,
157485,
157564,
157613,
157662,
157711,
157712,
157787,
157788,
157825,
157924,
157930,
157983,
158059,
158084,
158085,
158156,
158218,
158299,
158300,
158360,
158415,
158463,
158464,
158517,
158523,
158524,
158573,
158574,
158576,
158577,
158670,
158715,
158717,
158762,
158790,
158832,
158838,
158919,
158960,
158993,
159012,
159093,
159134,
159167,
159186,
159220,
159252,
159271,
159305,
159337,
159356,
159385,
159414,
159433,
159467,
159493,
159512,
159547,
159575,
159594,
159625,
159654,
159671,
159703,
159709,
159731,
159817,
159848,
159922,
160010,
160110,
160190,
160272,
160354,
160360,
160396,
160398,
160399,
160449,
160451,
160475,
160573,
160596,
160697,
160699,
160700,
160777,
160779,
160819,
160890,
160891,
160913,
160919,
161001,
161112,
161118,
161140,
161146,
161227,
161337,
161343,
161370,
161376,
161460,
161570,
161576,
161585,
161666,
161668,
161669,
161738,
161740,
161771,
161772,
161855,
161856,
161916,
162041,
162042,
162079,
162107,
162145,
162183,
162240,
162291,
162292,
162327,
162333,
162363,
162388,
162428,
162457,
162496,
162513,
162554,
162573,
162604,
162629,
162670,
162699,
162740,
162757,
162796,
162815,
162850,
162881,
162917,
162936,
162968,
163006,
163025,
163042,
163089,
163095,
163194,
163196,
163197,
163266,
163268,
163295,
163399,
163408,
163479,
163481,
163482,
163551,
163553,
163581,
163655,
163664,
163771,
163773,
163774,
163833,
163885,
163887,
163963,
163964,
163998,
164004,
164035,
164126,
164141,
164174,
164267,
164282,
164314,
164406,
164421,
164454,
164484,
164497,
164587,
164602,
164608,
164609,
164718,
164719,
164763,
164764,
164804,
164898,
164944,
165041,
165102,
165202,
165248,
165349,
165358,
165453,
165454,
165527,
165529,
165530,
165602,
165604,
165668,
165746,
165747,
165789,
165790,
165865,
165887,
165903,
165984,
165990,
166057,
166073,
166079,
166080,
166141,
166142,
166187,
166193,
166261,
166339,
166352,
166421,
166427,
166428,
166480,
166482,
166483,
166564,
166566,
166634,
166715,
166736,
166738,
166739,
166847,
166849,
166895,
166901,
166967,
167104,
167244,
167301,
167307,
167309,
167310,
167387,
167389,
167421,
167422,
167459,
167465,
167502,
167545,
167564,
167608,
167653,
167672,
167713,
167752,
167771,
167777,
167778,
167801,
167807,
167867,
167950,
167974,
167980,
167982,
167983,
168065,
168067,
168097,
168098,
168131,
168137,
168182,
168221,
168240,
168280,
168314,
168333,
168376,
168413,
168432,
168475,
168512,
168531,
168577,
168612,
168631,
168648,
168695,
168701,
168810,
168812,
168813,
168886,
168888,
168947,
169020,
169041,
169043,
169044,
169115,
169117,
169154,
169160,
169191,
169254,
169255,
169331,
169341,
169437,
169447,
169448,
169481,
169491,
169529,
169590,
169636,
169704,
169801,
169811,
169817,
169857,
169863,
169935,
169990,
170059,
170060,
170146,
170233,
170234,
170287,
170312,
170313,
170383,
170389,
170391,
170392,
170459,
170461,
170524,
170526,
170527,
170601,
170603,
170684,
170685,
170722,
170728,
170759,
170821,
170822,
170878,
170912,
170999,
171005,
171045,
171051,
171093,
171166,
171167,
171202,
171267,
171288,
171298,
171373,
171449,
171459,
171472,
171505,
171563,
171622,
171623,
171731,
171840,
171846,
171855,
171861,
171940,
171941,
172078,
172212,
172213,
172286,
172324,
172433,
172446,
172555,
172631,
172637,
172639,
172640,
172714,
172716,
172717,
172754,
172760,
172791,
172853,
172854,
172910,
172944,
173032,
173038,
173077,
173083,
173146,
173188,
173208,
173209,
173251,
173324,
173325,
173392,
173393,
173424,
173462,
173519,
173617,
173618,
173638,
173702,
173772,
173773,
173804,
173842,
173902,
174000,
174001,
174024,
174091,
174164,
174165,
174255,
174322,
174376,
174377,
174383,
174392,
174398,
174442,
174517,
174586,
174656,
174724,
174794,
174829,
174912,
174925,
175041,
175047,
175049,
175050,
175125,
175127,
175164,
175170,
175201,
175263,
175264,
175297,
175341,
175351,
175383,
175426,
175449,
175485,
175531,
175554,
175587,
175623,
175655,
175688,
175709,
175754,
175764,
175765,
175828,
175834,
175836,
175837,
175920,
175922,
175959,
175965,
175996,
176058,
176059,
176083,
176126,
176136,
176182,
176205,
176253,
176306,
176352,
176375,
176423,
176476,
176522,
176545,
176590,
176640,
176661,
176704,
176727,
176737,
176738,
176771,
176841,
176854,
176909,
176979,
176980,
177016,
177065,
177075,
177120,
177171,
177221,
177269,
177292,
177338,
177388,
177439,
177490,
177542,
177590,
177613,
177664,
177720,
177741,
177764,
177774,
177775,
177844,
177850,
177852,
177853,
177937,
177939,
177976,
177982,
178013,
178075,
178076,
178100,
178143,
178153,
178199,
178222,
178268,
178349,
178372,
178419,
178502,
178525,
178573,
178643,
178664,
178710,
178733,
178743,
178744,
178777,
178847,
178860,
178915,
178985,
178986,
179022,
179071,
179081,
179126,
179177,
179223,
179246,
179292,
179342,
179393,
179444,
179496,
179544,
179567,
179618,
179674,
179695,
179718,
179728,
179729,
179798,
179804,
179806,
179807,
179868,
179870,
179938,
179940,
179941,
180014,
180016,
180052,
180058,
180124,
180180,
180239,
180288,
180313,
180319,
180321,
180322,
180384,
180386,
180387,
180415,
180421,
180477,
180542,
180548,
180549,
180608,
180609,
180636,
180642,
180683,
180760,
180801,
180807,
180816,
180822,
180879,
180935,
180941,
180943,
180944,
181062,
181064,
181098,
181170,
181171,
181219,
181284,
181285,
181320,
181337,
181343,
181400,
181454,
181522,
181523,
181549,
181555,
181556,
181622,
181623,
181677,
181755,
181756,
181781,
181850,
181851,
181896,
181950,
181968,
181974,
182023,
182033,
182112,
182197,
182250,
182323,
182324,
182358,
182372,
182464,
182525,
182600,
182614,
182615,
182691,
182701,
182707,
182708,
182760,
182762,
182763,
182825,
182827,
182893,
182895,
182896,
182968,
182970,
183042,
183043,
183066,
183102,
183108,
183125,
183149,
183195,
183214,
183244,
183288,
183307,
183338,
183380,
183434,
183451,
183507,
183526,
183532,
183604,
183605,
183677,
183731,
183797,
183798,
183852,
183938,
183939,
184012,
184014,
184015,
184098,
184100,
184134,
184215,
184217,
184218,
184308,
184310,
184333,
184357,
184397,
184398,
184436,
184493,
184494,
184514,
184520,
184537,
184572,
184615,
184634,
184670,
184713,
184739,
184758,
184825,
184861,
184904,
184923,
184929,
184930,
184965,
184971,
185037,
185097,
185121,
185142,
185212,
185218,
185261,
185267,
185288,
185358,
185364,
185366,
185367,
185495,
185523,
185559,
185594,
185626,
185668,
185703,
185744,
185787,
185823,
185853,
185908,
185962,
185998,
186028,
186058,
186083,
186115,
186137,
186163,
186192,
186219,
186246,
186279,
186305,
186340,
186380,
186410,
186452,
186498,
186533,
186567,
186598,
186630,
186653,
186677,
186679,
186681,
186682,
186726,
186728,
186782,
186856,
186916,
186988,
187064,
187126,
187176,
187177,
187231,
187283,
187284,
187328,
187355,
187357,
187358,
187403,
187405,
187427,
187429,
187430,
187477,
187479,
187520,
187522,
187523,
187569,
187571,
187611,
187613,
187614,
187664,
187666,
187702,
187704,
187705
],
"line_end_idx": [
29,
85,
140,
142,
144,
146,
148,
150,
152,
154,
156,
158,
161,
164,
167,
170,
173,
176,
179,
182,
185,
188,
191,
194,
197,
200,
203,
206,
209,
212,
215,
218,
221,
224,
227,
230,
233,
236,
239,
242,
245,
248,
251,
254,
257,
260,
263,
266,
269,
272,
275,
278,
281,
284,
287,
290,
293,
296,
299,
302,
305,
308,
311,
314,
317,
320,
323,
326,
329,
332,
335,
338,
341,
344,
347,
350,
353,
356,
359,
362,
365,
368,
371,
374,
377,
380,
383,
386,
389,
392,
395,
398,
401,
404,
407,
410,
413,
416,
419,
422,
425,
428,
432,
436,
440,
444,
448,
452,
456,
460,
464,
468,
472,
476,
480,
484,
488,
492,
496,
500,
504,
508,
512,
516,
520,
524,
528,
532,
536,
540,
544,
548,
552,
556,
560,
564,
568,
572,
576,
580,
584,
588,
592,
596,
600,
604,
608,
612,
616,
620,
624,
628,
632,
636,
640,
644,
648,
652,
656,
660,
664,
668,
672,
676,
680,
684,
688,
692,
696,
700,
704,
708,
712,
716,
720,
724,
728,
732,
736,
740,
744,
748,
752,
756,
760,
764,
768,
772,
776,
780,
784,
788,
792,
796,
800,
804,
808,
812,
816,
820,
824,
828,
832,
836,
840,
844,
848,
852,
856,
860,
864,
868,
872,
876,
880,
884,
888,
892,
896,
900,
904,
908,
912,
916,
920,
924,
928,
932,
936,
940,
944,
948,
952,
956,
960,
964,
968,
972,
976,
980,
984,
988,
992,
996,
1000,
1004,
1008,
1012,
1016,
1020,
1024,
1028,
1032,
1036,
1040,
1044,
1048,
1052,
1056,
1060,
1064,
1068,
1072,
1076,
1080,
1084,
1088,
1092,
1096,
1100,
1104,
1108,
1112,
1116,
1120,
1124,
1128,
1132,
1136,
1140,
1144,
1148,
1152,
1156,
1160,
1164,
1168,
1172,
1176,
1180,
1184,
1188,
1192,
1196,
1200,
1204,
1208,
1212,
1216,
1220,
1224,
1228,
1232,
1236,
1240,
1244,
1248,
1252,
1256,
1260,
1264,
1268,
1272,
1276,
1280,
1284,
1288,
1292,
1296,
1300,
1304,
1308,
1312,
1316,
1320,
1324,
1328,
1332,
1336,
1340,
1344,
1348,
1352,
1356,
1360,
1364,
1368,
1372,
1376,
1380,
1384,
1388,
1392,
1396,
1400,
1404,
1408,
1412,
1416,
1420,
1424,
1428,
1432,
1436,
1440,
1444,
1448,
1452,
1456,
1460,
1464,
1468,
1472,
1476,
1480,
1484,
1488,
1492,
1496,
1500,
1504,
1508,
1512,
1516,
1520,
1524,
1528,
1532,
1536,
1540,
1544,
1548,
1552,
1556,
1560,
1564,
1568,
1572,
1576,
1580,
1584,
1588,
1592,
1596,
1600,
1604,
1608,
1612,
1616,
1620,
1624,
1628,
1632,
1636,
1640,
1644,
1648,
1652,
1656,
1660,
1664,
1668,
1672,
1676,
1680,
1684,
1688,
1692,
1696,
1700,
1704,
1708,
1712,
1716,
1720,
1724,
1728,
1732,
1736,
1740,
1744,
1748,
1752,
1756,
1760,
1764,
1768,
1772,
1776,
1780,
1784,
1788,
1792,
1796,
1800,
1804,
1808,
1812,
1816,
1820,
1824,
1828,
1832,
1836,
1840,
1844,
1848,
1852,
1856,
1860,
1864,
1868,
1872,
1876,
1880,
1884,
1888,
1892,
1896,
1900,
1904,
1908,
1912,
1916,
1920,
1924,
1928,
1932,
1936,
1940,
1944,
1948,
1952,
1956,
1960,
1964,
1968,
1972,
1976,
1980,
1984,
1988,
1992,
1996,
2000,
2004,
2008,
2012,
2016,
2020,
2024,
2028,
2032,
2036,
2040,
2044,
2048,
2052,
2056,
2060,
2064,
2068,
2072,
2076,
2080,
2084,
2088,
2092,
2096,
2100,
2104,
2108,
2112,
2116,
2120,
2124,
2128,
2132,
2136,
2140,
2144,
2148,
2152,
2156,
2160,
2164,
2168,
2172,
2176,
2180,
2184,
2188,
2192,
2196,
2200,
2204,
2208,
2212,
2216,
2220,
2224,
2228,
2232,
2236,
2240,
2244,
2248,
2252,
2256,
2260,
2264,
2268,
2272,
2276,
2280,
2284,
2288,
2292,
2296,
2300,
2304,
2308,
2312,
2316,
2320,
2324,
2328,
2332,
2336,
2340,
2344,
2348,
2352,
2356,
2360,
2364,
2368,
2372,
2376,
2380,
2384,
2388,
2392,
2396,
2400,
2404,
2408,
2412,
2416,
2420,
2424,
2428,
2432,
2436,
2440,
2444,
2448,
2452,
2456,
2460,
2464,
2468,
2472,
2476,
2480,
2484,
2488,
2492,
2496,
2500,
2504,
2508,
2512,
2516,
2520,
2524,
2528,
2532,
2536,
2540,
2544,
2548,
2552,
2556,
2560,
2564,
2568,
2572,
2576,
2580,
2584,
2588,
2592,
2596,
2600,
2604,
2608,
2612,
2616,
2620,
2624,
2628,
2632,
2636,
2640,
2644,
2648,
2652,
2656,
2660,
2664,
2668,
2672,
2676,
2680,
2684,
2688,
2692,
2696,
2700,
2704,
2708,
2712,
2716,
2720,
2724,
2728,
2732,
2736,
2740,
2744,
2748,
2752,
2756,
2760,
2764,
2768,
2772,
2776,
2780,
2784,
2788,
2792,
2796,
2800,
2804,
2808,
2812,
2816,
2820,
2824,
2828,
2832,
2836,
2840,
2844,
2848,
2852,
2856,
2860,
2864,
2868,
2872,
2876,
2880,
2884,
2888,
2892,
2896,
2900,
2904,
2908,
2912,
2916,
2920,
2924,
2928,
2932,
2936,
2940,
2944,
2948,
2952,
2956,
2960,
2964,
2968,
2972,
2976,
2980,
2984,
2988,
2992,
2996,
3000,
3004,
3008,
3012,
3016,
3020,
3024,
3028,
3032,
3036,
3040,
3044,
3048,
3052,
3056,
3060,
3064,
3068,
3072,
3076,
3080,
3084,
3088,
3092,
3096,
3100,
3104,
3108,
3112,
3116,
3120,
3124,
3128,
3132,
3136,
3140,
3144,
3148,
3152,
3156,
3160,
3164,
3168,
3172,
3176,
3180,
3184,
3188,
3192,
3196,
3200,
3204,
3208,
3212,
3216,
3220,
3224,
3228,
3232,
3236,
3240,
3244,
3248,
3252,
3256,
3260,
3264,
3268,
3272,
3276,
3280,
3284,
3288,
3292,
3296,
3300,
3304,
3308,
3312,
3316,
3320,
3324,
3328,
3332,
3336,
3340,
3344,
3348,
3352,
3356,
3360,
3364,
3368,
3372,
3376,
3380,
3384,
3388,
3392,
3396,
3400,
3404,
3408,
3412,
3416,
3420,
3424,
3428,
3432,
3436,
3440,
3444,
3448,
3452,
3456,
3460,
3464,
3468,
3472,
3476,
3480,
3484,
3488,
3492,
3496,
3500,
3504,
3508,
3512,
3516,
3520,
3524,
3528,
3532,
3536,
3540,
3544,
3548,
3552,
3556,
3560,
3564,
3568,
3572,
3576,
3580,
3584,
3588,
3592,
3596,
3600,
3604,
3608,
3612,
3616,
3620,
3624,
3628,
3632,
3636,
3640,
3644,
3648,
3652,
3656,
3660,
3664,
3668,
3672,
3676,
3680,
3684,
3688,
3692,
3696,
3700,
3704,
3708,
3712,
3716,
3720,
3724,
3728,
3732,
3736,
3740,
3744,
3748,
3752,
3756,
3760,
3764,
3768,
3772,
3776,
3780,
3784,
3788,
3792,
3796,
3800,
3804,
3808,
3812,
3816,
3820,
3824,
3828,
3832,
3836,
3840,
3844,
3848,
3852,
3856,
3860,
3864,
3868,
3872,
3876,
3880,
3884,
3888,
3892,
3896,
3900,
3904,
3908,
3912,
3916,
3920,
3924,
3928,
3932,
3936,
3940,
3944,
3948,
3952,
3956,
3960,
3964,
3968,
3972,
3976,
3980,
3984,
3988,
3992,
3996,
4000,
4004,
4008,
4012,
4016,
4020,
4024,
4028,
4033,
4038,
4043,
4048,
4053,
4058,
4063,
4068,
4073,
4078,
4083,
4088,
4093,
4098,
4103,
4108,
4113,
4118,
4123,
4128,
4133,
4138,
4143,
4148,
4153,
4158,
4163,
4168,
4173,
4178,
4183,
4188,
4193,
4198,
4203,
4208,
4213,
4218,
4223,
4228,
4233,
4238,
4243,
4248,
4253,
4258,
4263,
4268,
4273,
4278,
4283,
4288,
4293,
4298,
4303,
4308,
4313,
4318,
4323,
4328,
4333,
4338,
4343,
4348,
4353,
4358,
4363,
4368,
4373,
4378,
4383,
4388,
4393,
4398,
4403,
4408,
4413,
4418,
4423,
4428,
4433,
4438,
4443,
4448,
4453,
4458,
4463,
4468,
4473,
4478,
4483,
4488,
4493,
4498,
4503,
4508,
4513,
4518,
4523,
4528,
4533,
4538,
4543,
4548,
4553,
4558,
4563,
4568,
4573,
4578,
4583,
4588,
4593,
4598,
4603,
4608,
4613,
4618,
4623,
4628,
4633,
4638,
4643,
4648,
4653,
4658,
4663,
4668,
4673,
4678,
4683,
4688,
4693,
4698,
4703,
4708,
4713,
4718,
4723,
4728,
4733,
4738,
4743,
4748,
4753,
4758,
4763,
4768,
4773,
4778,
4783,
4788,
4793,
4798,
4803,
4808,
4813,
4818,
4823,
4828,
4833,
4838,
4843,
4848,
4853,
4858,
4863,
4868,
4873,
4878,
4883,
4888,
4893,
4898,
4903,
4908,
4913,
4918,
4923,
4928,
4933,
4938,
4943,
4948,
4953,
4958,
4963,
4968,
4973,
4978,
4983,
4988,
4993,
4998,
5003,
5008,
5013,
5018,
5023,
5028,
5033,
5038,
5043,
5048,
5053,
5058,
5063,
5068,
5073,
5078,
5083,
5088,
5093,
5098,
5103,
5108,
5113,
5118,
5123,
5128,
5133,
5138,
5143,
5148,
5153,
5158,
5163,
5168,
5173,
5178,
5183,
5188,
5193,
5198,
5203,
5208,
5213,
5218,
5223,
5228,
5233,
5238,
5243,
5248,
5253,
5258,
5263,
5268,
5273,
5278,
5283,
5288,
5293,
5298,
5303,
5308,
5313,
5318,
5323,
5328,
5333,
5338,
5343,
5348,
5353,
5358,
5363,
5368,
5373,
5378,
5383,
5388,
5393,
5398,
5403,
5408,
5413,
5418,
5423,
5428,
5433,
5438,
5443,
5448,
5453,
5458,
5463,
5468,
5473,
5478,
5483,
5488,
5493,
5498,
5503,
5508,
5513,
5518,
5523,
5528,
5533,
5538,
5543,
5548,
5553,
5558,
5563,
5568,
5573,
5578,
5583,
5588,
5593,
5598,
5603,
5608,
5613,
5618,
5623,
5628,
5633,
5638,
5643,
5648,
5653,
5658,
5663,
5668,
5673,
5678,
5683,
5688,
5693,
5698,
5703,
5708,
5713,
5718,
5723,
5728,
5733,
5738,
5743,
5748,
5753,
5758,
5763,
5768,
5773,
5778,
5783,
5788,
5793,
5798,
5803,
5808,
5813,
5818,
5823,
5828,
5833,
5838,
5843,
5848,
5853,
5858,
5863,
5868,
5873,
5878,
5883,
5888,
5893,
5898,
5903,
5908,
5913,
5918,
5923,
5928,
5933,
5938,
5943,
5948,
5953,
5958,
5963,
5968,
5973,
5978,
5983,
5988,
5993,
5998,
6003,
6008,
6013,
6018,
6023,
6028,
6033,
6038,
6043,
6048,
6053,
6058,
6063,
6068,
6073,
6078,
6083,
6088,
6093,
6098,
6103,
6108,
6113,
6118,
6123,
6128,
6133,
6138,
6143,
6148,
6153,
6158,
6163,
6168,
6173,
6178,
6183,
6188,
6193,
6198,
6203,
6208,
6213,
6218,
6223,
6228,
6233,
6238,
6243,
6248,
6253,
6258,
6263,
6268,
6273,
6278,
6283,
6288,
6293,
6298,
6303,
6308,
6313,
6318,
6323,
6328,
6333,
6338,
6343,
6348,
6353,
6358,
6363,
6368,
6373,
6378,
6383,
6388,
6393,
6398,
6403,
6408,
6413,
6418,
6423,
6428,
6433,
6438,
6443,
6448,
6453,
6458,
6463,
6468,
6473,
6478,
6483,
6488,
6493,
6498,
6503,
6508,
6513,
6518,
6523,
6528,
6533,
6538,
6543,
6548,
6553,
6558,
6563,
6568,
6573,
6578,
6583,
6588,
6593,
6598,
6603,
6608,
6613,
6618,
6623,
6628,
6633,
6638,
6643,
6648,
6653,
6658,
6663,
6668,
6673,
6678,
6683,
6688,
6693,
6698,
6703,
6708,
6713,
6718,
6723,
6728,
6733,
6738,
6743,
6748,
6753,
6758,
6763,
6768,
6773,
6778,
6783,
6788,
6793,
6798,
6803,
6808,
6813,
6818,
6823,
6828,
6833,
6838,
6843,
6848,
6853,
6858,
6863,
6868,
6873,
6878,
6883,
6888,
6893,
6898,
6903,
6908,
6913,
6918,
6923,
6928,
6933,
6938,
6943,
6948,
6953,
6958,
6963,
6968,
6973,
6978,
6983,
6988,
6993,
6998,
7003,
7008,
7013,
7018,
7023,
7028,
7033,
7038,
7043,
7048,
7053,
7058,
7063,
7068,
7073,
7078,
7083,
7088,
7093,
7098,
7103,
7108,
7113,
7118,
7123,
7128,
7133,
7138,
7143,
7148,
7153,
7158,
7163,
7168,
7173,
7178,
7183,
7188,
7193,
7198,
7203,
7208,
7213,
7218,
7223,
7228,
7233,
7238,
7243,
7248,
7253,
7258,
7263,
7268,
7273,
7278,
7283,
7288,
7293,
7298,
7303,
7308,
7313,
7318,
7323,
7328,
7333,
7338,
7343,
7348,
7353,
7358,
7363,
7368,
7373,
7378,
7383,
7388,
7393,
7398,
7403,
7408,
7413,
7418,
7423,
7428,
7433,
7438,
7443,
7448,
7453,
7458,
7463,
7468,
7473,
7478,
7483,
7488,
7493,
7498,
7503,
7508,
7513,
7518,
7523,
7528,
7533,
7538,
7543,
7548,
7553,
7558,
7563,
7568,
7573,
7578,
7583,
7588,
7593,
7598,
7603,
7608,
7613,
7618,
7623,
7628,
7633,
7638,
7643,
7648,
7653,
7658,
7663,
7668,
7673,
7678,
7683,
7688,
7693,
7698,
7703,
7708,
7713,
7718,
7723,
7728,
7733,
7738,
7743,
7748,
7753,
7758,
7763,
7768,
7773,
7778,
7783,
7788,
7793,
7798,
7803,
7808,
7813,
7818,
7823,
7828,
7833,
7838,
7843,
7848,
7853,
7858,
7863,
7868,
7873,
7878,
7883,
7888,
7893,
7898,
7903,
7908,
7913,
7918,
7923,
7928,
7933,
7938,
7943,
7948,
7953,
7958,
7963,
7968,
7973,
7978,
7983,
7988,
7993,
7998,
8003,
8008,
8013,
8018,
8023,
8028,
8033,
8038,
8043,
8048,
8053,
8058,
8063,
8068,
8073,
8078,
8083,
8088,
8093,
8098,
8103,
8108,
8113,
8118,
8123,
8128,
8133,
8138,
8143,
8148,
8153,
8158,
8163,
8168,
8173,
8178,
8183,
8188,
8193,
8198,
8203,
8208,
8213,
8218,
8223,
8228,
8233,
8238,
8243,
8248,
8253,
8258,
8263,
8268,
8273,
8278,
8283,
8288,
8293,
8298,
8303,
8308,
8313,
8318,
8323,
8328,
8333,
8338,
8343,
8348,
8353,
8358,
8363,
8368,
8373,
8378,
8383,
8388,
8393,
8398,
8403,
8408,
8413,
8418,
8423,
8428,
8433,
8438,
8443,
8448,
8453,
8458,
8463,
8468,
8473,
8478,
8483,
8488,
8493,
8498,
8503,
8508,
8513,
8518,
8523,
8528,
8533,
8538,
8543,
8548,
8553,
8558,
8563,
8568,
8573,
8578,
8583,
8588,
8593,
8598,
8603,
8608,
8613,
8618,
8623,
8628,
8633,
8638,
8643,
8648,
8653,
8658,
8663,
8668,
8673,
8678,
8683,
8688,
8693,
8698,
8703,
8708,
8713,
8718,
8723,
8728,
8733,
8738,
8743,
8748,
8753,
8758,
8763,
8768,
8773,
8778,
8783,
8788,
8793,
8798,
8803,
8808,
8813,
8818,
8823,
8828,
8833,
8838,
8843,
8848,
8853,
8858,
8863,
8868,
8873,
8878,
8883,
8888,
8893,
8898,
8903,
8908,
8913,
8918,
8923,
8928,
8933,
8938,
8943,
8948,
8953,
8958,
8963,
8968,
8973,
8978,
8983,
8988,
8993,
8998,
9003,
9008,
9013,
9018,
9023,
9028,
9033,
9038,
9043,
9048,
9053,
9058,
9063,
9068,
9073,
9078,
9083,
9088,
9093,
9098,
9103,
9108,
9113,
9118,
9123,
9128,
9133,
9138,
9143,
9148,
9153,
9158,
9163,
9168,
9173,
9178,
9183,
9188,
9193,
9198,
9203,
9208,
9213,
9218,
9223,
9228,
9233,
9238,
9243,
9248,
9253,
9258,
9263,
9268,
9273,
9278,
9283,
9288,
9293,
9298,
9303,
9308,
9313,
9318,
9323,
9328,
9333,
9338,
9343,
9348,
9353,
9358,
9363,
9368,
9373,
9378,
9383,
9388,
9393,
9398,
9403,
9408,
9413,
9418,
9423,
9428,
9433,
9438,
9443,
9448,
9453,
9458,
9463,
9468,
9473,
9478,
9483,
9488,
9493,
9498,
9503,
9508,
9513,
9518,
9523,
9528,
9533,
9538,
9543,
9548,
9553,
9558,
9563,
9568,
9573,
9578,
9583,
9588,
9593,
9598,
9603,
9608,
9613,
9618,
9623,
9628,
9633,
9638,
9643,
9648,
9653,
9658,
9663,
9668,
9673,
9678,
9683,
9688,
9693,
9698,
9703,
9708,
9713,
9718,
9723,
9728,
9733,
9738,
9743,
9748,
9753,
9758,
9763,
9768,
9773,
9778,
9783,
9788,
9793,
9798,
9803,
9808,
9813,
9818,
9823,
9828,
9833,
9838,
9843,
9848,
9853,
9858,
9863,
9868,
9873,
9878,
9883,
9888,
9893,
9898,
9903,
9908,
9913,
9918,
9923,
9928,
9933,
9938,
9943,
9948,
9953,
9958,
9963,
9968,
9973,
9978,
9983,
9988,
9993,
9998,
10003,
10008,
10013,
10018,
10023,
10028,
10033,
10038,
10043,
10048,
10053,
10058,
10063,
10068,
10073,
10078,
10083,
10088,
10093,
10098,
10103,
10108,
10113,
10118,
10123,
10128,
10133,
10138,
10143,
10148,
10153,
10158,
10163,
10168,
10173,
10178,
10183,
10188,
10193,
10198,
10203,
10208,
10213,
10218,
10223,
10228,
10233,
10238,
10243,
10248,
10253,
10258,
10263,
10268,
10273,
10278,
10283,
10288,
10293,
10298,
10303,
10308,
10313,
10318,
10323,
10328,
10333,
10338,
10343,
10348,
10353,
10358,
10363,
10368,
10373,
10378,
10383,
10388,
10393,
10398,
10403,
10408,
10413,
10418,
10423,
10428,
10433,
10438,
10443,
10448,
10453,
10458,
10463,
10468,
10473,
10478,
10483,
10488,
10493,
10498,
10503,
10508,
10513,
10518,
10523,
10528,
10533,
10538,
10543,
10548,
10553,
10558,
10563,
10568,
10573,
10578,
10583,
10588,
10593,
10598,
10603,
10608,
10613,
10618,
10623,
10628,
10633,
10638,
10643,
10648,
10653,
10658,
10663,
10668,
10673,
10678,
10683,
10688,
10693,
10698,
10703,
10708,
10713,
10718,
10723,
10728,
10733,
10738,
10743,
10748,
10753,
10758,
10763,
10768,
10773,
10778,
10783,
10788,
10793,
10798,
10803,
10808,
10813,
10818,
10823,
10828,
10833,
10838,
10843,
10848,
10853,
10858,
10863,
10868,
10873,
10878,
10883,
10888,
10893,
10898,
10903,
10908,
10913,
10918,
10923,
10928,
10933,
10938,
10943,
10948,
10953,
10958,
10963,
10968,
10973,
10978,
10983,
10988,
10993,
10998,
11003,
11008,
11013,
11018,
11023,
11028,
11033,
11038,
11043,
11048,
11053,
11058,
11063,
11068,
11073,
11078,
11083,
11088,
11093,
11098,
11103,
11108,
11113,
11118,
11123,
11128,
11133,
11138,
11143,
11148,
11153,
11158,
11163,
11168,
11173,
11178,
11183,
11188,
11193,
11198,
11203,
11208,
11213,
11218,
11223,
11228,
11233,
11238,
11243,
11248,
11253,
11258,
11263,
11268,
11273,
11278,
11283,
11288,
11293,
11298,
11303,
11308,
11313,
11318,
11323,
11328,
11333,
11338,
11343,
11348,
11353,
11358,
11363,
11368,
11373,
11378,
11383,
11388,
11393,
11398,
11403,
11408,
11413,
11418,
11423,
11428,
11433,
11438,
11443,
11448,
11453,
11458,
11463,
11468,
11473,
11478,
11483,
11488,
11493,
11498,
11503,
11508,
11513,
11518,
11523,
11528,
11533,
11538,
11543,
11548,
11553,
11558,
11563,
11568,
11573,
11578,
11583,
11588,
11593,
11598,
11603,
11608,
11613,
11618,
11623,
11628,
11633,
11638,
11643,
11648,
11653,
11658,
11663,
11668,
11673,
11678,
11683,
11688,
11693,
11698,
11703,
11708,
11713,
11718,
11723,
11728,
11733,
11738,
11743,
11748,
11753,
11758,
11763,
11768,
11773,
11778,
11783,
11788,
11793,
11798,
11803,
11808,
11813,
11818,
11823,
11828,
11833,
11838,
11843,
11848,
11853,
11858,
11863,
11868,
11873,
11878,
11883,
11888,
11893,
11898,
11903,
11908,
11913,
11918,
11923,
11928,
11933,
11938,
11943,
11948,
11953,
11958,
11963,
11968,
11973,
11978,
11983,
11988,
11993,
11998,
12003,
12008,
12013,
12018,
12023,
12028,
12033,
12038,
12043,
12048,
12053,
12058,
12063,
12068,
12073,
12078,
12083,
12088,
12093,
12098,
12103,
12108,
12113,
12118,
12123,
12128,
12133,
12138,
12143,
12148,
12153,
12158,
12163,
12168,
12173,
12178,
12183,
12188,
12193,
12198,
12203,
12208,
12213,
12218,
12223,
12228,
12233,
12238,
12243,
12248,
12253,
12258,
12263,
12268,
12273,
12278,
12283,
12288,
12293,
12298,
12303,
12308,
12313,
12318,
12323,
12328,
12333,
12338,
12343,
12348,
12353,
12358,
12363,
12368,
12373,
12378,
12383,
12388,
12393,
12398,
12403,
12408,
12413,
12418,
12423,
12428,
12433,
12438,
12443,
12448,
12453,
12458,
12463,
12468,
12473,
12478,
12483,
12488,
12493,
12498,
12503,
12508,
12513,
12518,
12523,
12528,
12533,
12538,
12543,
12548,
12553,
12558,
12563,
12568,
12573,
12578,
12583,
12588,
12593,
12598,
12603,
12608,
12613,
12618,
12623,
12628,
12633,
12638,
12643,
12648,
12653,
12658,
12663,
12668,
12673,
12678,
12683,
12688,
12693,
12698,
12703,
12708,
12713,
12718,
12723,
12728,
12733,
12738,
12743,
12748,
12753,
12758,
12763,
12768,
12773,
12778,
12783,
12788,
12793,
12798,
12803,
12808,
12813,
12818,
12823,
12828,
12833,
12838,
12843,
12848,
12853,
12858,
12863,
12868,
12873,
12878,
12883,
12888,
12893,
12898,
12903,
12908,
12913,
12918,
12923,
12928,
12933,
12938,
12943,
12948,
12953,
12958,
12963,
12968,
12973,
12978,
12983,
12988,
12993,
12998,
13003,
13008,
13013,
13018,
13023,
13028,
13033,
13038,
13043,
13048,
13053,
13058,
13063,
13068,
13073,
13078,
13083,
13088,
13093,
13098,
13103,
13108,
13113,
13118,
13123,
13128,
13133,
13138,
13143,
13148,
13153,
13158,
13163,
13168,
13173,
13178,
13183,
13188,
13193,
13198,
13203,
13208,
13213,
13218,
13223,
13228,
13233,
13238,
13243,
13248,
13253,
13258,
13263,
13268,
13273,
13278,
13283,
13288,
13293,
13298,
13303,
13308,
13313,
13318,
13323,
13328,
13333,
13338,
13343,
13348,
13353,
13358,
13363,
13368,
13373,
13378,
13383,
13388,
13393,
13398,
13403,
13408,
13413,
13418,
13423,
13428,
13433,
13438,
13443,
13448,
13453,
13458,
13463,
13468,
13473,
13478,
13483,
13488,
13493,
13498,
13503,
13508,
13513,
13518,
13523,
13528,
13533,
13538,
13543,
13548,
13553,
13558,
13563,
13568,
13573,
13578,
13583,
13588,
13593,
13598,
13603,
13608,
13613,
13618,
13623,
13628,
13633,
13638,
13643,
13648,
13653,
13658,
13663,
13668,
13673,
13678,
13683,
13688,
13693,
13698,
13703,
13708,
13713,
13718,
13723,
13728,
13733,
13738,
13743,
13748,
13753,
13758,
13763,
13768,
13773,
13778,
13783,
13788,
13793,
13798,
13803,
13808,
13813,
13818,
13823,
13828,
13833,
13838,
13843,
13848,
13853,
13858,
13863,
13868,
13873,
13878,
13883,
13888,
13893,
13898,
13903,
13908,
13913,
13918,
13923,
13928,
13933,
13938,
13943,
13948,
13953,
13958,
13963,
13968,
13973,
13978,
13983,
13988,
13993,
13998,
14003,
14008,
14013,
14018,
14023,
14028,
14033,
14038,
14043,
14048,
14053,
14058,
14063,
14068,
14073,
14078,
14083,
14088,
14093,
14098,
14103,
14108,
14113,
14118,
14123,
14128,
14133,
14138,
14143,
14148,
14153,
14158,
14163,
14168,
14173,
14178,
14183,
14188,
14193,
14198,
14203,
14208,
14213,
14218,
14223,
14228,
14233,
14238,
14243,
14248,
14253,
14258,
14263,
14268,
14273,
14278,
14283,
14288,
14293,
14298,
14303,
14308,
14313,
14318,
14323,
14328,
14333,
14338,
14343,
14348,
14353,
14358,
14363,
14368,
14373,
14378,
14383,
14388,
14393,
14398,
14403,
14408,
14413,
14418,
14423,
14428,
14433,
14438,
14443,
14448,
14453,
14458,
14463,
14468,
14473,
14478,
14483,
14488,
14493,
14498,
14503,
14508,
14513,
14518,
14523,
14528,
14533,
14538,
14543,
14548,
14553,
14558,
14563,
14568,
14573,
14578,
14583,
14588,
14593,
14598,
14603,
14608,
14613,
14618,
14623,
14628,
14633,
14638,
14643,
14648,
14653,
14658,
14663,
14668,
14673,
14678,
14683,
14688,
14693,
14698,
14703,
14708,
14713,
14718,
14723,
14728,
14733,
14738,
14743,
14748,
14753,
14758,
14763,
14768,
14773,
14778,
14783,
14788,
14793,
14798,
14803,
14808,
14813,
14818,
14823,
14828,
14833,
14838,
14843,
14848,
14853,
14858,
14863,
14868,
14873,
14878,
14883,
14888,
14893,
14898,
14903,
14908,
14913,
14918,
14923,
14928,
14933,
14938,
14943,
14948,
14953,
14958,
14963,
14968,
14973,
14978,
14983,
14988,
14993,
14998,
15003,
15008,
15013,
15018,
15023,
15028,
15033,
15038,
15043,
15048,
15053,
15058,
15063,
15068,
15073,
15078,
15083,
15088,
15093,
15098,
15103,
15108,
15113,
15118,
15123,
15128,
15133,
15138,
15143,
15148,
15153,
15158,
15163,
15168,
15173,
15178,
15183,
15188,
15193,
15198,
15203,
15208,
15213,
15218,
15223,
15228,
15233,
15238,
15243,
15248,
15253,
15258,
15263,
15268,
15273,
15278,
15283,
15288,
15293,
15298,
15303,
15308,
15313,
15318,
15323,
15328,
15333,
15338,
15343,
15348,
15353,
15358,
15363,
15368,
15373,
15378,
15383,
15388,
15393,
15398,
15403,
15408,
15413,
15418,
15423,
15428,
15433,
15438,
15443,
15448,
15453,
15458,
15463,
15468,
15473,
15478,
15483,
15488,
15493,
15498,
15503,
15508,
15513,
15518,
15523,
15528,
15533,
15538,
15543,
15548,
15553,
15558,
15563,
15568,
15573,
15578,
15583,
15588,
15593,
15598,
15603,
15608,
15613,
15618,
15623,
15628,
15633,
15638,
15643,
15648,
15653,
15658,
15663,
15668,
15673,
15678,
15683,
15688,
15693,
15698,
15703,
15708,
15713,
15718,
15723,
15728,
15733,
15738,
15743,
15748,
15753,
15758,
15763,
15768,
15773,
15778,
15783,
15788,
15793,
15798,
15803,
15808,
15813,
15818,
15823,
15828,
15833,
15838,
15843,
15848,
15853,
15858,
15863,
15868,
15873,
15878,
15883,
15888,
15893,
15898,
15903,
15908,
15913,
15918,
15923,
15928,
15933,
15938,
15943,
15948,
15953,
15958,
15963,
15968,
15973,
15978,
15983,
15988,
15993,
15998,
16003,
16008,
16013,
16018,
16023,
16028,
16033,
16038,
16043,
16048,
16053,
16058,
16063,
16068,
16073,
16078,
16083,
16088,
16093,
16098,
16103,
16108,
16113,
16118,
16123,
16128,
16133,
16138,
16143,
16148,
16153,
16158,
16163,
16168,
16173,
16178,
16183,
16188,
16193,
16198,
16203,
16208,
16213,
16218,
16223,
16228,
16233,
16238,
16243,
16248,
16253,
16258,
16263,
16268,
16273,
16278,
16283,
16288,
16293,
16298,
16303,
16308,
16313,
16318,
16323,
16328,
16333,
16338,
16343,
16348,
16353,
16358,
16363,
16368,
16373,
16378,
16383,
16388,
16393,
16398,
16403,
16408,
16413,
16418,
16423,
16428,
16433,
16438,
16443,
16448,
16453,
16458,
16463,
16468,
16473,
16478,
16483,
16488,
16493,
16498,
16503,
16508,
16513,
16518,
16523,
16528,
16533,
16538,
16543,
16548,
16553,
16558,
16563,
16568,
16573,
16578,
16583,
16588,
16593,
16598,
16603,
16608,
16613,
16618,
16623,
16628,
16633,
16638,
16643,
16648,
16653,
16658,
16663,
16668,
16673,
16678,
16683,
16688,
16693,
16698,
16703,
16708,
16713,
16718,
16723,
16728,
16733,
16738,
16743,
16748,
16753,
16758,
16763,
16768,
16773,
16778,
16783,
16788,
16793,
16798,
16803,
16808,
16813,
16818,
16823,
16828,
16833,
16838,
16843,
16848,
16853,
16858,
16863,
16868,
16873,
16878,
16883,
16888,
16893,
16898,
16903,
16908,
16913,
16918,
16923,
16928,
16933,
16938,
16943,
16948,
16953,
16958,
16963,
16968,
16973,
16978,
16983,
16988,
16993,
16998,
17003,
17008,
17013,
17018,
17023,
17028,
17033,
17038,
17043,
17048,
17053,
17058,
17063,
17068,
17073,
17078,
17083,
17088,
17093,
17098,
17103,
17108,
17113,
17118,
17123,
17128,
17133,
17138,
17143,
17148,
17153,
17158,
17163,
17168,
17173,
17178,
17183,
17188,
17193,
17198,
17203,
17208,
17213,
17218,
17223,
17228,
17233,
17238,
17243,
17248,
17253,
17258,
17263,
17268,
17273,
17278,
17283,
17288,
17293,
17298,
17303,
17308,
17313,
17318,
17323,
17328,
17333,
17338,
17343,
17348,
17353,
17358,
17363,
17368,
17373,
17378,
17383,
17388,
17393,
17398,
17403,
17408,
17413,
17418,
17423,
17428,
17433,
17438,
17443,
17448,
17453,
17458,
17463,
17468,
17473,
17478,
17483,
17488,
17493,
17498,
17503,
17508,
17513,
17518,
17523,
17528,
17533,
17538,
17543,
17548,
17553,
17558,
17563,
17568,
17573,
17578,
17583,
17588,
17593,
17598,
17603,
17608,
17613,
17618,
17623,
17628,
17633,
17638,
17643,
17648,
17653,
17658,
17663,
17668,
17673,
17678,
17683,
17688,
17693,
17698,
17703,
17708,
17713,
17718,
17723,
17728,
17733,
17738,
17743,
17748,
17753,
17758,
17763,
17768,
17773,
17778,
17783,
17788,
17793,
17798,
17803,
17808,
17813,
17818,
17823,
17828,
17833,
17838,
17843,
17848,
17853,
17858,
17863,
17868,
17873,
17878,
17883,
17888,
17893,
17898,
17903,
17908,
17913,
17918,
17923,
17928,
17933,
17938,
17943,
17948,
17953,
17958,
17963,
17968,
17973,
17978,
17983,
17988,
17993,
17998,
18003,
18008,
18013,
18018,
18023,
18028,
18033,
18038,
18043,
18048,
18053,
18058,
18063,
18068,
18073,
18078,
18083,
18088,
18093,
18098,
18103,
18108,
18113,
18118,
18123,
18128,
18133,
18138,
18143,
18148,
18153,
18158,
18163,
18168,
18173,
18178,
18183,
18188,
18193,
18198,
18203,
18208,
18213,
18218,
18223,
18228,
18233,
18238,
18243,
18248,
18253,
18258,
18263,
18268,
18273,
18278,
18283,
18288,
18293,
18298,
18303,
18308,
18313,
18318,
18323,
18328,
18333,
18338,
18343,
18348,
18353,
18358,
18363,
18368,
18373,
18378,
18383,
18388,
18393,
18398,
18403,
18408,
18413,
18418,
18423,
18428,
18433,
18438,
18443,
18448,
18453,
18458,
18463,
18468,
18473,
18478,
18483,
18488,
18493,
18498,
18503,
18508,
18513,
18518,
18523,
18528,
18533,
18538,
18543,
18548,
18553,
18558,
18563,
18568,
18573,
18578,
18583,
18588,
18593,
18598,
18603,
18608,
18613,
18618,
18623,
18628,
18633,
18638,
18643,
18648,
18653,
18658,
18663,
18668,
18673,
18678,
18683,
18688,
18693,
18698,
18703,
18708,
18713,
18718,
18723,
18728,
18733,
18738,
18743,
18748,
18753,
18758,
18763,
18768,
18773,
18778,
18783,
18788,
18793,
18798,
18803,
18808,
18813,
18818,
18823,
18828,
18833,
18838,
18843,
18848,
18853,
18858,
18863,
18868,
18873,
18878,
18883,
18888,
18893,
18898,
18903,
18908,
18913,
18918,
18923,
18928,
18933,
18938,
18943,
18948,
18953,
18958,
18963,
18968,
18973,
18978,
18983,
18988,
18993,
18998,
19003,
19008,
19013,
19018,
19023,
19028,
19033,
19038,
19043,
19048,
19053,
19058,
19063,
19068,
19073,
19078,
19083,
19088,
19093,
19098,
19103,
19108,
19113,
19118,
19123,
19128,
19133,
19138,
19143,
19148,
19153,
19158,
19163,
19168,
19173,
19178,
19183,
19188,
19193,
19198,
19203,
19208,
19213,
19218,
19223,
19228,
19233,
19238,
19243,
19248,
19253,
19258,
19263,
19268,
19273,
19278,
19283,
19288,
19293,
19298,
19303,
19308,
19313,
19318,
19323,
19328,
19333,
19338,
19343,
19348,
19353,
19358,
19363,
19368,
19373,
19378,
19383,
19388,
19393,
19398,
19403,
19408,
19413,
19418,
19423,
19428,
19433,
19438,
19443,
19448,
19453,
19458,
19463,
19468,
19473,
19478,
19483,
19488,
19493,
19498,
19503,
19508,
19513,
19518,
19523,
19528,
19533,
19538,
19543,
19548,
19553,
19558,
19563,
19568,
19573,
19578,
19583,
19588,
19593,
19598,
19603,
19608,
19613,
19618,
19623,
19628,
19633,
19638,
19643,
19648,
19653,
19658,
19663,
19668,
19673,
19678,
19683,
19688,
19693,
19698,
19703,
19708,
19713,
19718,
19723,
19728,
19733,
19738,
19743,
19748,
19753,
19758,
19763,
19768,
19773,
19778,
19783,
19788,
19793,
19798,
19803,
19808,
19813,
19818,
19823,
19828,
19833,
19838,
19843,
19848,
19853,
19858,
19863,
19868,
19873,
19878,
19883,
19888,
19893,
19898,
19903,
19908,
19913,
19918,
19923,
19928,
19933,
19938,
19943,
19948,
19953,
19958,
19963,
19968,
19973,
19978,
19983,
19988,
19993,
19998,
20003,
20008,
20013,
20018,
20023,
20028,
20033,
20038,
20043,
20048,
20053,
20058,
20063,
20068,
20073,
20078,
20083,
20088,
20093,
20098,
20103,
20108,
20113,
20118,
20123,
20128,
20133,
20138,
20143,
20148,
20153,
20158,
20163,
20168,
20173,
20178,
20183,
20188,
20193,
20198,
20203,
20208,
20213,
20218,
20223,
20228,
20233,
20238,
20243,
20248,
20253,
20258,
20263,
20268,
20273,
20278,
20283,
20288,
20293,
20298,
20303,
20308,
20313,
20318,
20323,
20328,
20333,
20338,
20343,
20348,
20353,
20358,
20363,
20368,
20373,
20378,
20383,
20388,
20393,
20398,
20403,
20408,
20413,
20418,
20423,
20428,
20433,
20438,
20443,
20448,
20453,
20458,
20463,
20468,
20473,
20478,
20483,
20488,
20493,
20498,
20503,
20508,
20513,
20518,
20523,
20528,
20533,
20538,
20543,
20548,
20553,
20558,
20563,
20568,
20573,
20578,
20583,
20588,
20593,
20598,
20603,
20608,
20613,
20618,
20623,
20628,
20633,
20638,
20643,
20648,
20653,
20658,
20663,
20668,
20673,
20678,
20683,
20688,
20693,
20698,
20703,
20708,
20713,
20718,
20723,
20728,
20733,
20738,
20743,
20748,
20753,
20758,
20763,
20768,
20773,
20778,
20783,
20788,
20793,
20798,
20803,
20808,
20813,
20818,
20823,
20828,
20833,
20838,
20843,
20848,
20853,
20858,
20863,
20868,
20873,
20878,
20883,
20888,
20893,
20898,
20903,
20908,
20913,
20918,
20923,
20928,
20933,
20938,
20943,
20948,
20953,
20958,
20963,
20968,
20973,
20978,
20983,
20988,
20993,
20998,
21003,
21008,
21013,
21018,
21023,
21028,
21033,
21038,
21043,
21048,
21053,
21058,
21063,
21068,
21073,
21078,
21083,
21088,
21093,
21098,
21103,
21108,
21113,
21118,
21123,
21128,
21133,
21138,
21143,
21148,
21153,
21158,
21163,
21168,
21173,
21178,
21183,
21188,
21193,
21198,
21203,
21208,
21213,
21218,
21223,
21228,
21233,
21238,
21243,
21248,
21253,
21258,
21263,
21268,
21273,
21278,
21283,
21288,
21293,
21298,
21303,
21308,
21313,
21318,
21323,
21328,
21333,
21338,
21343,
21348,
21353,
21358,
21363,
21368,
21373,
21378,
21383,
21388,
21393,
21398,
21403,
21408,
21413,
21418,
21423,
21428,
21433,
21438,
21443,
21448,
21453,
21458,
21463,
21468,
21473,
21478,
21483,
21488,
21493,
21498,
21503,
21508,
21513,
21518,
21523,
21528,
21533,
21538,
21543,
21548,
21553,
21558,
21563,
21568,
21573,
21578,
21583,
21588,
21593,
21598,
21603,
21608,
21613,
21618,
21623,
21628,
21633,
21638,
21643,
21648,
21653,
21658,
21663,
21668,
21673,
21678,
21683,
21688,
21693,
21698,
21703,
21708,
21713,
21718,
21723,
21728,
21733,
21738,
21743,
21748,
21753,
21758,
21763,
21768,
21773,
21778,
21783,
21788,
21793,
21798,
21803,
21808,
21813,
21818,
21823,
21828,
21833,
21838,
21843,
21848,
21853,
21858,
21863,
21868,
21873,
21878,
21883,
21888,
21893,
21898,
21903,
21908,
21913,
21918,
21923,
21928,
21933,
21938,
21943,
21948,
21953,
21958,
21963,
21968,
21973,
21978,
21983,
21988,
21993,
21998,
22003,
22008,
22013,
22018,
22023,
22028,
22033,
22038,
22043,
22048,
22053,
22058,
22063,
22068,
22073,
22078,
22083,
22088,
22093,
22098,
22103,
22108,
22113,
22118,
22123,
22128,
22133,
22138,
22143,
22148,
22153,
22158,
22163,
22168,
22173,
22178,
22183,
22188,
22193,
22198,
22203,
22283,
22286,
22335,
22338,
22409,
22480,
22540,
22543,
22615,
22618,
22690,
22759,
22826,
22893,
22962,
23031,
23096,
23100,
23101,
23136,
23168,
23197,
23227,
23249,
23273,
23296,
23320,
23343,
23366,
23367,
23400,
23432,
23464,
23497,
23498,
23531,
23532,
23564,
23596,
23628,
23660,
23692,
23724,
23756,
23788,
23820,
23852,
23884,
23916,
23948,
23980,
24012,
24044,
24076,
24108,
24139,
24171,
24203,
24235,
24271,
24308,
24346,
24384,
24425,
24457,
24491,
24523,
24561,
24593,
24624,
24652,
24678,
24711,
24712,
24742,
24765,
24792,
24816,
24839,
24863,
24889,
24912,
24934,
24957,
24980,
25004,
25025,
25046,
25067,
25091,
25113,
25137,
25160,
25182,
25205,
25206,
25230,
25264,
25265,
25309,
25359,
25360,
25384,
25403,
25410,
25411,
25443,
25444,
25465,
25487,
25519,
25555,
25585,
25611,
25645,
25646,
25671,
25673,
25722,
25778,
25784,
25851,
25908,
26004,
26025,
26094,
26157,
26193,
26219,
26225,
26248,
26254,
26312,
26318,
26326,
26433,
26536,
26542,
26576,
26609,
26677,
26717,
26757,
26825,
26884,
26918,
26927,
26990,
27029,
27125,
27134,
27157,
27230,
27290,
27312,
27318,
27403,
27409,
27443,
27477,
27486,
27559,
27622,
27661,
27753,
27817,
27826,
27848,
27854,
27857,
27858,
27886,
27888,
27933,
27945,
28044,
28106,
28134,
28197,
28203,
28233,
28276,
28286,
28400,
28460,
28514,
28524,
28548,
28554,
28557,
28637,
28639,
28655,
28752,
28754,
28755,
28846,
28848,
28896,
28938,
28939,
28997,
29028,
29034,
29085,
29138,
29139,
29164,
29218,
29228,
29342,
29388,
29433,
29434,
29476,
29486,
29487,
29526,
29536,
29582,
29653,
29693,
29759,
29760,
29809,
29823,
29879,
29988,
30006,
30117,
30118,
30160,
30205,
30251,
30269,
30270,
30317,
30331,
30341,
30347,
30348,
30406,
30407,
30477,
30526,
30553,
30554,
30630,
30658,
30659,
30690,
30692,
30693,
30792,
30794,
30872,
30908,
30957,
30958,
31006,
31052,
31053,
31085,
31086,
31125,
31151,
31157,
31207,
31238,
31239,
31301,
31375,
31376,
31461,
31546,
31547,
31589,
31590,
31638,
31639,
31671,
31672,
31705,
31706,
31735,
31741,
31743,
31744,
31864,
31866,
31890,
31896,
31933,
31978,
31979,
32032,
32093,
32142,
32158,
32240,
32330,
32424,
32519,
32571,
32656,
32657,
32714,
32724,
32764,
32835,
32836,
32864,
32874,
32875,
32905,
32942,
32969,
32970,
33010,
33079,
33103,
33109,
33111,
33112,
33155,
33157,
33216,
33218,
33219,
33296,
33298,
33332,
33412,
33491,
33570,
33625,
33665,
33709,
33715,
33803,
33882,
33888,
33939,
33945,
34039,
34106,
34183,
34189,
34190,
34218,
34219,
34279,
34280,
34337,
34363,
34369,
34425,
34457,
34463,
34464,
34504,
34506,
34507,
34568,
34570,
34610,
34611,
34655,
34693,
34699,
34734,
34771,
34809,
34853,
34889,
34930,
34964,
35012,
35045,
35077,
35110,
35158,
35194,
35231,
35273,
35314,
35354,
35394,
35427,
35470,
35509,
35545,
35577,
35623,
35665,
35709,
35740,
35782,
35824,
35869,
35908,
35942,
35979,
36011,
36046,
36083,
36090,
36091,
36169,
36214,
36275,
36324,
36366,
36400,
36401,
36439,
36441,
36442,
36504,
36506,
36532,
36538,
36597,
36628,
36629,
36702,
36708,
36709,
36748,
36754,
36826,
36870,
36871,
36944,
36950,
36951,
36999,
37036,
37038,
37039,
37090,
37092,
37133,
37134,
37185,
37186,
37231,
37237,
37299,
37354,
37414,
37467,
37468,
37509,
37515,
37516,
37586,
37627,
37700,
37702,
37703,
37801,
37803,
37864,
37898,
37899,
37978,
38056,
38084,
38150,
38151,
38228,
38265,
38326,
38328,
38329,
38364,
38366,
38392,
38485,
38491,
38556,
38597,
38607,
38644,
38645,
38728,
38779,
38845,
38859,
38904,
38930,
38944,
38954,
38969,
38975,
38976,
39049,
39128,
39129,
39207,
39244,
39307,
39308,
39349,
39355,
39389,
39399,
39464,
39504,
39514,
39561,
39567,
39568,
39617,
39710,
39716,
39786,
39828,
39838,
39885,
39886,
39948,
39982,
40027,
40053,
40067,
40077,
40092,
40098,
40099,
40188,
40220,
40226,
40292,
40293,
40367,
40404,
40439,
40445,
40446,
40471,
40497,
40498,
40556,
40677,
40678,
40723,
40792,
40793,
40826,
40875,
40876,
40902,
40903,
40940,
40946,
40980,
40990,
41055,
41095,
41105,
41148,
41154,
41155,
41204,
41210,
41254,
41299,
41305,
41306,
41367,
41385,
41387,
41388,
41435,
41437,
41461,
41467,
41499,
41576,
41694,
41700,
41722,
41728,
41758,
41835,
41951,
41957,
41959,
41960,
42005,
42007,
42040,
42144,
42172,
42178,
42214,
42215,
42246,
42288,
42328,
42394,
42478,
42531,
42552,
42558,
42585,
42586,
42618,
42718,
42746,
42752,
42788,
42789,
42827,
42917,
42966,
42976,
43023,
43091,
43179,
43204,
43250,
43260,
43266,
43291,
43293,
43294,
43361,
43363,
43430,
43475,
43481,
43535,
43592,
43593,
43645,
43718,
43752,
43790,
43791,
43869,
43879,
43939,
43999,
44009,
44010,
44093,
44099,
44149,
44155,
44184,
44215,
44216,
44268,
44329,
44330,
44452,
44507,
44536,
44537,
44592,
44665,
44671,
44717,
44723,
44775,
44830,
44900,
44906,
44908,
44909,
44989,
44991,
45048,
45054,
45091,
45141,
45147,
45227,
45233,
45258,
45324,
45325,
45374,
45384,
45451,
45512,
45541,
45600,
45644,
45681,
45699,
45784,
45842,
45891,
45951,
45999,
46050,
46115,
46133,
46200,
46201,
46234,
46299,
46337,
46382,
46383,
46393,
46406,
46416,
46453,
46516,
46573,
46598,
46599,
46636,
46676,
46677,
46740,
46741,
46770,
46831,
46832,
46901,
46941,
46975,
47016,
47026,
47032,
47034,
47035,
47088,
47090,
47121,
47187,
47240,
47297,
47298,
47300,
47301,
47363,
47365,
47423,
47503,
47504,
47552,
47558,
47615,
47661,
47705,
47750,
47790,
47832,
47842,
47920,
47995,
48005,
48040,
48070,
48071,
48128,
48164,
48210,
48216,
48217,
48266,
48267,
48300,
48358,
48414,
48468,
48487,
48536,
48538,
48539,
48601,
48603,
48666,
48691,
48697,
48730,
48736,
48737,
48776,
48814,
48845,
48851,
48917,
49013,
49117,
49141,
49147,
49148,
49198,
49204,
49244,
49306,
49307,
49369,
49440,
49491,
49519,
49520,
49573,
49579,
49580,
49617,
49648,
49654,
49718,
49814,
49838,
49839,
49864,
49870,
49871,
49898,
49924,
49930,
49992,
50052,
50105,
50128,
50181,
50187,
50256,
50281,
50306,
50312,
50372,
50452,
50562,
50563,
50617,
50627,
50668,
50734,
50798,
50855,
50880,
50937,
50938,
50989,
51039,
51079,
51130,
51131,
51199,
51236,
51237,
51279,
51316,
51326,
51332,
51334,
51335,
51382,
51384,
51456,
51502,
51529,
51530,
51590,
51591,
51625,
51626,
51672,
51732,
51734,
51735,
51790,
51792,
51821,
51860,
51892,
51893,
51937,
51975,
51981,
52016,
52051,
52081,
52113,
52143,
52175,
52208,
52246,
52281,
52317,
52353,
52388,
52423,
52459,
52495,
52534,
52569,
52607,
52641,
52677,
52707,
52740,
52777,
52808,
52841,
52879,
52909,
52944,
52976,
53008,
53044,
53082,
53114,
53145,
53176,
53209,
53253,
53292,
53326,
53363,
53370,
53371,
53449,
53494,
53555,
53604,
53646,
53680,
53681,
53719,
53720,
53722,
53723,
53779,
53781,
53818,
53846,
53852,
53913,
53946,
53947,
54019,
54025,
54026,
54064,
54070,
54141,
54184,
54185,
54266,
54272,
54273,
54304,
54310,
54374,
54410,
54411,
54481,
54487,
54488,
54536,
54572,
54574,
54575,
54659,
54661,
54696,
54697,
54748,
54749,
54796,
54828,
54829,
54858,
54859,
54934,
54969,
55042,
55044,
55045,
55095,
55097,
55186,
55228,
55244,
55294,
55325,
55356,
55358,
55359,
55409,
55411,
55450,
55466,
55543,
55576,
55578,
55579,
55636,
55637,
55714,
55790,
55849,
55853,
55931,
56012,
56014,
56054,
56055,
56095,
56112,
56139,
56140,
56166,
56225,
56226,
56291,
56371,
56377,
56482,
56488,
56497,
56562,
56563,
56631,
56632,
56684,
56686,
56687,
56775,
56777,
56813,
56819,
56865,
56908,
56914,
56943,
56944,
57021,
57069,
57127,
57128,
57205,
57239,
57329,
57363,
57364,
57427,
57433,
57457,
57467,
57497,
57574,
57647,
57670,
57707,
57784,
57856,
57879,
57900,
57969,
57987,
58068,
58149,
58167,
58190,
58200,
58206,
58207,
58280,
58282,
58283,
58399,
58401,
58524,
58526,
58527,
58630,
58632,
58737,
58798,
58861,
58872,
58891,
58907,
58918,
58973,
59016,
59056,
59094,
59158,
59210,
59246,
59328,
59329,
59362,
59400,
59406,
59422,
59462,
59481,
59497,
59531,
59550,
59566,
59607,
59626,
59642,
59694,
59713,
59729,
59780,
59799,
59816,
59835,
59841,
59899,
59961,
60015,
60016,
60075,
60097,
60124,
60171,
60206,
60284,
60317,
60374,
60429,
60493,
60523,
60556,
60571,
60621,
60622,
60687,
60709,
60711,
60712,
60748,
60750,
60806,
60821,
60877,
60929,
60931,
60932,
61047,
61049,
61141,
61142,
61171,
61198,
61199,
61236,
61237,
61261,
61267,
61296,
61346,
61359,
61369,
61427,
61470,
61506,
61532,
61542,
61543,
61570,
61643,
61644,
61673,
61734,
61740,
61741,
61763,
61783,
61784,
61810,
61812,
61813,
61893,
61895,
61913,
61930,
61931,
62000,
62001,
62042,
62048,
62109,
62115,
62124,
62130,
62172,
62236,
62237,
62267,
62277,
62313,
62314,
62435,
62545,
62609,
62610,
62686,
62696,
62709,
62775,
62870,
62871,
62908,
62942,
62952,
63036,
63123,
63133,
63139,
63140,
63157,
63159,
63160,
63195,
63197,
63235,
63252,
63254,
63255,
63333,
63335,
63393,
63395,
63396,
63467,
63469,
63556,
63558,
63559,
63635,
63637,
63672,
63673,
63700,
63716,
63717,
63798,
63799,
63854,
63855,
63941,
64017,
64018,
64106,
64107,
64146,
64152,
64198,
64257,
64314,
64379,
64440,
64469,
64488,
64489,
64535,
64594,
64651,
64716,
64777,
64806,
64825,
64826,
64872,
64941,
64958,
64977,
64983,
64985,
64986,
65025,
65027,
65054,
65070,
65071,
65112,
65118,
65164,
65223,
65242,
65243,
65289,
65348,
65367,
65368,
65414,
65481,
65500,
65517,
65536,
65542,
65543,
65570,
65572,
65573,
65787,
65789,
65920,
65922,
65923,
65985,
65987,
66020,
66077,
66078,
66185,
66187,
66188,
66244,
66246,
66275,
66316,
66322,
66376,
66411,
66412,
66482,
66552,
66622,
66692,
66762,
66832,
66833,
66869,
66875,
66893,
66895,
66896,
67027,
67029,
67091,
67092,
67093,
67128,
67150,
67178,
67224,
67318,
67387,
67456,
67487,
67538,
67544,
67595,
67605,
67653,
67699,
67722,
67771,
67817,
67840,
67889,
67935,
67958,
68007,
68053,
68076,
68137,
68194,
68217,
68279,
68337,
68360,
68421,
68478,
68501,
68562,
68619,
68642,
68704,
68762,
68785,
68846,
68903,
68926,
68977,
69029,
69052,
69103,
69156,
69179,
69228,
69274,
69297,
69345,
69390,
69413,
69460,
69481,
69504,
69514,
69520,
69521,
69580,
69581,
69631,
69637,
69673,
69674,
69744,
69822,
69862,
69920,
69954,
69989,
69990,
70024,
70056,
70095,
70127,
70128,
70214,
70215,
70251,
70344,
70345,
70398,
70471,
70527,
70533,
70534,
70577,
70642,
70644,
70645,
70828,
70830,
70871,
70877,
70946,
70953,
70954,
70991,
70997,
71014,
71059,
71079,
71122,
71129,
71158,
71197,
71238,
71244,
71302,
71340,
71350,
71427,
71428,
71495,
71541,
71567,
71581,
71591,
71592,
71632,
71694,
71725,
71735,
71736,
71801,
71802,
71876,
71914,
71940,
72009,
72040,
72109,
72119,
72125,
72160,
72209,
72215,
72217,
72218,
72378,
72380,
72421,
72427,
72496,
72503,
72504,
72541,
72547,
72564,
72609,
72629,
72672,
72679,
72708,
72747,
72788,
72794,
72860,
72861,
72907,
72985,
73067,
73134,
73196,
73217,
73265,
73275,
73276,
73305,
73315,
73381,
73458,
73484,
73494,
73495,
73522,
73584,
73615,
73625,
73687,
73761,
73808,
73832,
73838,
73860,
73909,
73915,
73917,
73918,
74029,
74031,
74092,
74093,
74166,
74167,
74250,
74251,
74278,
74381,
74427,
74539,
74591,
74675,
74718,
74738,
74739,
74763,
74824,
74897,
74992,
74993,
75040,
75064,
75125,
75217,
75242,
75243,
75266,
75307,
75328,
75334,
75393,
75444,
75469,
75475,
75501,
75507,
75566,
75618,
75643,
75649,
75650,
75713,
75819,
75825,
75853,
75945,
75951,
75952,
76001,
76002,
76008,
76032,
76114,
76120,
76121,
76171,
76172,
76224,
76226,
76227,
76334,
76336,
76366,
76396,
76397,
76478,
76557,
76558,
76624,
76673,
76727,
76728,
76797,
76842,
76893,
76902,
76988,
77032,
77034,
77035,
77137,
77139,
77199,
77200,
77256,
77257,
77305,
77353,
77355,
77356,
77393,
77395,
77446,
77447,
77476,
77501,
77502,
77534,
77535,
77614,
77637,
77666,
77667,
77698,
77742,
77744,
77745,
77850,
77852,
77911,
77912,
77945,
78006,
78007,
78036,
78102,
78177,
78239,
78286,
78310,
78311,
78355,
78401,
78402,
78454,
78456,
78457,
78498,
78500,
78550,
78552,
78553,
78659,
78661,
78685,
78737,
78738,
78797,
78798,
78836,
78888,
78889,
78918,
78920,
78921,
78963,
78965,
79015,
79016,
79046,
79048,
79049,
79158,
79160,
79162,
79163,
79266,
79268,
79270,
79271,
79378,
79380,
79463,
79464,
79498,
79560,
79561,
79599,
79605,
79642,
79677,
79716,
79755,
79803,
79851,
79884,
79915,
79958,
79993,
80032,
80064,
80102,
80141,
80177,
80216,
80223,
80224,
80275,
80320,
80381,
80430,
80472,
80506,
80507,
80545,
80546,
80576,
80606,
80607,
80688,
80767,
80768,
80807,
80833,
80890,
80982,
81030,
81055,
81056,
81091,
81156,
81202,
81226,
81253,
81311,
81317,
81361,
81392,
81411,
81454,
81479,
81513,
81530,
81562,
81581,
81598,
81640,
81692,
81702,
81727,
81760,
81777,
81811,
81881,
81900,
81910,
81916,
81967,
82011,
82032,
82033,
82065,
82117,
82118,
82157,
82222,
82223,
82265,
82266,
82321,
82376,
82449,
82493,
82514,
82515,
82563,
82600,
82601,
82654,
82655,
82689,
82753,
82777,
82850,
82946,
82952,
83006,
83066,
83141,
83165,
83198,
83204,
83205,
83260,
83262,
83263,
83374,
83376,
83449,
83502,
83503,
83586,
83587,
83653,
83742,
83744,
83745,
83882,
83884,
83957,
84010,
84059,
84148,
84149,
84216,
84217,
84264,
84329,
84331,
84332,
84440,
84442,
84515,
84565,
84599,
84600,
84618,
84706,
84775,
84784,
84811,
84812,
84862,
84914,
84969,
85014,
85035,
85037,
85038,
85141,
85143,
85216,
85272,
85327,
85328,
85383,
85455,
85461,
85507,
85541,
85542,
85586,
85596,
85651,
85708,
85746,
85756,
85757,
85778,
85843,
85926,
85979,
86008,
86014,
86016,
86017,
86122,
86124,
86197,
86253,
86308,
86309,
86374,
86452,
86453,
86511,
86558,
86578,
86580,
86581,
86682,
86684,
86750,
86802,
86803,
86880,
86886,
86949,
86997,
87022,
87028,
87030,
87031,
87140,
87142,
87215,
87268,
87269,
87346,
87412,
87459,
87483,
87484,
87545,
87618,
87713,
87746,
87752,
87793,
87812,
87856,
87919,
87978,
87997,
88041,
88104,
88163,
88182,
88188,
88190,
88191,
88281,
88283,
88390,
88392,
88393,
88494,
88496,
88571,
88647,
88661,
88730,
88778,
88780,
88781,
88893,
88895,
89024,
89026,
89027,
89135,
89137,
89161,
89294,
89301,
89303,
89304,
89367,
89369,
89453,
89455,
89456,
89496,
89498,
89552,
89654,
89675,
89677,
89678,
89748,
89750,
89804,
89806,
89807,
89867,
89869,
89940,
89964,
90056,
90062,
90105,
90112,
90114,
90115,
90257,
90259,
90448,
90481,
90531,
90608,
90638,
90658,
90684,
90732,
90738,
90788,
90814,
90867,
90868,
90946,
90947,
90987,
91089,
91134,
91135,
91166,
91172,
91181,
91187,
91245,
91276,
91298,
91368,
91381,
91428,
91429,
91522,
91588,
91589,
91660,
91661,
91693,
91699,
91700,
91728,
91744,
91745,
91800,
91821,
91892,
91911,
91917,
92006,
92091,
92132,
92173,
92214,
92255,
92300,
92342,
92390,
92446,
92512,
92610,
92705,
92821,
92856,
92891,
92943,
92953,
92983,
93039,
93062,
93092,
93134,
93179,
93202,
93232,
93253,
93298,
93338,
93361,
93372,
93399,
93506,
93567,
93628,
93689,
93793,
93864,
93908,
93970,
94032,
94136,
94207,
94251,
94313,
94375,
94381,
94390,
94396,
94455,
94535,
94560,
94566,
94594,
94621,
94692,
94765,
94821,
94858,
94896,
94917,
94983,
95045,
95105,
95126,
95127,
95146,
95152,
95203,
95213,
95245,
95332,
95355,
95391,
95470,
95493,
95529,
95601,
95657,
95680,
95713,
95734,
95806,
95860,
95883,
95893,
95899,
95957,
96047,
96135,
96182,
96344,
96419,
96573,
96634,
96708,
96730,
96792,
96890,
96936,
96960,
97014,
97015,
97081,
97102,
97129,
97195,
97290,
97327,
97348,
97414,
97415,
97470,
97565,
97586,
97645,
97726,
97747,
97748,
97801,
97901,
97922,
97923,
97980,
98001,
98096,
98171,
98172,
98194,
98256,
98298,
98318,
98373,
98374,
98432,
98453,
98480,
98537,
98603,
98624,
98682,
98739,
98740,
98766,
98824,
98845,
98898,
98954,
98975,
99031,
99052,
99107,
99128,
99185,
99206,
99261,
99319,
99320,
99361,
99415,
99447,
99468,
99520,
99541,
99593,
99629,
99650,
99702,
99739,
99777,
99798,
99850,
99906,
99936,
99957,
100011,
100032,
100088,
100143,
100164,
100214,
100241,
100262,
100317,
100338,
100392,
100423,
100444,
100500,
100521,
100577,
100598,
100648,
100649,
100671,
100725,
100781,
100787,
100842,
100930,
101008,
101084,
101119,
101164,
101174,
101241,
101309,
101378,
101448,
101482,
101515,
101538,
101548,
101616,
101617,
101687,
101748,
101819,
101897,
101957,
102038,
102099,
102160,
102166,
102167,
102221,
102222,
102275,
102276,
102335,
102390,
102469,
102470,
102525,
102527,
102528,
102666,
102668,
102709,
102725,
102775,
102791,
102856,
102912,
102914,
102915,
103002,
103004,
103060,
103162,
103184,
103190,
103272,
103300,
103384,
103390,
103391,
103416,
103422,
103493,
103552,
103573,
103632,
103708,
103729,
103730,
103805,
103882,
103942,
103979,
104017,
104038,
104108,
104174,
104234,
104255,
104256,
104292,
104319,
104355,
104433,
104459,
104498,
104499,
104558,
104591,
104627,
104648,
104649,
104720,
104741,
104742,
104801,
104896,
104917,
104918,
104981,
105060,
105081,
105082,
105106,
105148,
105171,
105248,
105311,
105312,
105370,
105466,
105575,
105627,
105648,
105649,
105712,
105771,
105830,
105889,
105890,
105911,
105917,
105935,
105937,
105938,
106037,
106039,
106149,
106195,
106248,
106298,
106299,
106340,
106362,
106455,
106488,
106505,
106507,
106508,
106555,
106557,
106591,
106607,
106725,
106815,
106917,
107022,
107069,
107199,
107236,
107328,
107356,
107358,
107359,
107461,
107463,
107490,
107491,
107529,
107535,
107569,
107583,
107642,
107719,
107751,
107769,
107822,
107899,
108001,
108051,
108160,
108182,
108200,
108214,
108233,
108267,
108281,
108364,
108395,
108413,
108459,
108506,
108528,
108609,
108635,
108708,
108738,
108790,
108877,
108907,
108933,
108955,
108956,
109024,
109061,
109062,
109132,
109133,
109201,
109202,
109241,
109316,
109334,
109348,
109367,
109400,
109414,
109498,
109554,
109568,
109587,
109617,
109631,
109693,
109765,
109796,
109814,
109890,
109960,
110082,
110100,
110114,
110133,
110150,
110294,
110371,
110444,
110548,
110567,
110573,
110574,
110648,
110650,
110651,
110727,
110729,
110792,
110863,
110864,
110917,
110918,
110982,
111050,
111093,
111099,
111115,
111152,
111153,
111198,
111230,
111268,
111269,
111331,
111344,
111402,
111437,
111471,
111472,
111538,
111597,
111624,
111638,
111712,
111743,
111757,
111758,
111815,
111816,
111849,
111882,
111892,
111925,
111978,
111984,
112043,
112098,
112100,
112101,
112164,
112166,
112191,
112193,
112194,
112267,
112368,
112370,
112401,
112402,
112455,
112553,
112653,
112674,
112675,
112728,
112836,
112857,
112858,
112885,
112891,
112951,
113053,
113078,
113084,
113085,
113138,
113236,
113257,
113258,
113281,
113355,
113357,
113358,
113395,
113397,
113450,
113452,
113453,
113540,
113542,
113562,
113568,
113632,
113676,
113682,
113691,
113697,
113761,
113799,
113805,
113807,
113808,
113870,
113872,
113892,
113898,
113943,
113998,
114004,
114013,
114019,
114058,
114113,
114119,
114121,
114122,
114233,
114235,
114280,
114326,
114327,
114386,
114471,
114492,
114494,
114495,
114552,
114554,
114572,
114649,
114658,
114726,
114775,
114800,
114802,
114803,
114891,
114893,
114911,
114917,
114951,
115025,
115074,
115093,
115125,
115157,
115171,
115214,
115232,
115290,
115364,
115440,
115441,
115507,
115508,
115575,
115640,
115658,
115679,
115697,
115778,
115849,
115926,
115944,
115958,
115975,
115989,
116059,
116122,
116188,
116249,
116263,
116282,
116299,
116366,
116385,
116391,
116393,
116394,
116435,
116437,
116500,
116528,
116529,
116573,
116611,
116617,
116661,
116705,
116744,
116782,
116815,
116848,
116882,
116919,
116957,
116995,
117033,
117066,
117103,
117138,
117176,
117212,
117254,
117287,
117325,
117361,
117405,
117445,
117452,
117453,
117531,
117576,
117637,
117686,
117728,
117762,
117763,
117801,
117803,
117804,
117843,
117845,
117881,
117918,
117924,
117994,
118036,
118037,
118108,
118114,
118115,
118141,
118178,
118179,
118233,
118262,
118264,
118265,
118332,
118334,
118356,
118426,
118435,
118496,
118554,
118556,
118557,
118664,
118666,
118730,
118851,
118956,
118993,
119123,
119144,
119239,
119282,
119350,
119352,
119353,
119398,
119400,
119465,
119467,
119468,
119572,
119574,
119600,
119601,
119647,
119648,
119702,
119750,
119800,
119852,
119853,
119899,
119905,
119963,
120024,
120079,
120133,
120157,
120158,
120189,
120190,
120251,
120282,
120288,
120290,
120291,
120343,
120345,
120362,
120428,
120430,
120431,
120494,
120496,
120515,
120516,
120546,
120552,
120593,
120667,
120708,
120782,
120856,
120930,
120931,
121005,
121006,
121035,
121109,
121110,
121184,
121190,
121191,
121209,
121211,
121212,
121313,
121315,
121383,
121384,
121448,
121449,
121514,
121548,
121648,
121649,
121733,
121785,
121812,
121873,
121874,
121917,
121985,
121986,
122040,
122109,
122111,
122112,
122174,
122176,
122223,
122267,
122278,
122308,
122334,
122340,
122386,
122432,
122478,
122524,
122570,
122576,
122577,
122594,
122651,
122698,
122723,
122725,
122726,
122797,
122799,
122851,
122966,
122987,
122989,
122990,
123032,
123034,
123086,
123088,
123089,
123162,
123164,
123220,
123328,
123349,
123351,
123352,
123446,
123448,
123512,
123513,
123584,
123621,
123667,
123727,
123728,
123803,
123809,
123892,
123960,
123966,
123967,
124056,
124058,
124059,
124128,
124130,
124162,
124185,
124191,
124249,
124307,
124366,
124425,
124488,
124563,
124569,
124570,
124589,
124648,
124697,
124722,
124724,
124725,
124791,
124793,
124824,
124846,
124852,
124909,
124963,
125046,
125052,
125053,
125071,
125129,
125177,
125202,
125204,
125205,
125265,
125267,
125336,
125392,
125442,
125490,
125540,
125595,
125597,
125598,
125640,
125642,
125699,
125701,
125702,
125795,
125797,
125867,
125944,
125971,
126026,
126057,
126125,
126141,
126252,
126363,
126437,
126549,
126606,
126672,
126761,
126804,
126859,
126941,
127023,
127048,
127073,
127112,
127136,
127142,
127220,
127255,
127271,
127277,
127297,
127314,
127329,
127335,
127372,
127414,
127420,
127529,
127541,
127547,
127569,
127629,
127639,
127712,
127751,
127771,
127781,
127799,
127818,
127889,
127899,
127972,
128011,
128031,
128041,
128069,
128088,
128207,
128213,
128244,
128354,
128438,
128571,
128619,
128666,
128714,
128731,
128751,
128753,
128754,
128842,
128844,
128921,
128956,
129018,
129075,
129076,
129127,
129179,
129200,
129201,
129263,
129313,
129334,
129335,
129359,
129426,
129459,
129531,
129537,
129582,
129589,
129590,
129641,
129643,
129644,
129711,
129713,
129772,
129865,
129886,
129888,
129889,
129938,
129940,
129999,
130001,
130002,
130062,
130089,
130124,
130151,
130193,
130220,
130249,
130284,
130313,
130348,
130379,
130420,
130422,
130473,
130560,
130581,
130582,
130617,
130671,
130757,
130778,
130779,
130793,
130851,
130852,
130879,
130938,
130993,
131018,
131019,
131033,
131065,
131088,
131094,
131139,
131184,
131229,
131235,
131254,
131311,
131360,
131385,
131386,
131398,
131438,
131515,
131516,
131563,
131608,
131663,
131669,
131721,
131765,
131829,
131892,
131902,
131952,
131987,
132061,
132062,
132091,
132101,
132116,
132122,
132145,
132191,
132192,
132248,
132367,
132388,
132389,
132410,
132431,
132521,
132544,
132550,
132605,
132683,
132763,
132769,
132823,
132864,
132885,
132886,
132905,
132965,
132992,
132998,
133063,
133119,
133166,
133272,
133297,
133353,
133359,
133360,
133419,
133471,
133559,
133659,
133680,
133731,
133732,
133744,
133763,
133769,
133833,
133834,
133855,
133865,
133954,
134069,
134132,
134200,
134268,
134333,
134389,
134418,
134428,
134538,
134539,
134594,
134600,
134601,
134647,
134648,
134699,
134701,
134702,
134774,
134776,
134811,
134817,
134856,
134931,
134950,
134986,
135056,
135075,
135133,
135241,
135344,
135363,
135369,
135371,
135372,
135438,
135440,
135485,
135511,
135512,
135560,
135561,
135615,
135683,
135685,
135686,
135758,
135760,
135791,
135860,
135869,
135971,
135973,
135974,
136055,
136057,
136099,
136105,
136136,
136209,
136228,
136257,
136363,
136468,
136487,
136504,
136576,
136595,
136601,
136603,
136604,
136685,
136687,
136705,
136775,
136792,
136798,
136836,
136854,
136875,
136881,
136920,
136926,
136991,
137034,
137108,
137153,
137159,
137160,
137187,
137249,
137308,
137309,
137374,
137380,
137443,
137515,
137591,
137652,
137717,
137718,
137784,
137794,
137876,
137939,
138009,
138019,
138025,
138027,
138028,
138090,
138092,
138119,
138179,
138259,
138306,
138387,
138453,
138519,
138521,
138522,
138598,
138600,
138692,
138693,
138726,
138732,
138766,
138804,
138915,
138934,
138972,
139085,
139104,
139110,
139112,
139113,
139185,
139187,
139265,
139371,
139373,
139374,
139449,
139451,
139481,
139544,
139545,
139652,
139736,
139818,
139819,
139875,
139876,
139909,
139915,
139949,
140024,
140043,
140081,
140161,
140180,
140218,
140294,
140313,
140319,
140321,
140322,
140394,
140396,
140444,
140507,
140516,
140612,
140614,
140615,
140686,
140688,
140718,
140786,
140795,
140896,
140898,
140899,
140977,
140979,
141007,
141008,
141049,
141055,
141133,
141211,
141289,
141367,
141445,
141523,
141601,
141679,
141757,
141835,
141913,
141991,
142069,
142147,
142225,
142303,
142358,
142436,
142442,
142443,
142538,
142540,
142541,
142610,
142612,
142658,
142721,
142730,
142826,
142828,
142829,
142894,
142896,
142957,
142959,
142960,
143033,
143035,
143064,
143174,
143183,
143282,
143284,
143285,
143356,
143358,
143410,
143496,
143541,
143562,
143564,
143565,
143631,
143633,
143660,
143720,
143767,
143848,
143917,
143919,
143920,
143995,
143997,
144045,
144108,
144117,
144213,
144215,
144216,
144288,
144290,
144336,
144399,
144408,
144504,
144506,
144507,
144573,
144575,
144602,
144662,
144709,
144790,
144853,
144854,
144856,
144857,
144931,
144933,
144981,
145046,
145055,
145153,
145155,
145156,
145228,
145230,
145276,
145341,
145350,
145448,
145450,
145451,
145523,
145525,
145556,
145572,
145573,
145610,
145680,
145719,
145786,
145787,
145818,
145897,
145899,
145900,
145987,
145989,
146016,
146017,
146057,
146063,
146134,
146205,
146276,
146347,
146418,
146424,
146425,
146520,
146522,
146523,
146598,
146600,
146633,
146649,
146650,
146687,
146757,
146796,
146866,
146867,
146921,
146971,
146972,
146998,
147014,
147015,
147037,
147079,
147119,
147166,
147206,
147253,
147294,
147303,
147343,
147424,
147426,
147427,
147512,
147514,
147564,
147680,
147682,
147683,
147756,
147758,
147792,
147798,
147828,
147900,
147919,
147949,
148022,
148041,
148058,
148163,
148269,
148288,
148294,
148296,
148297,
148370,
148372,
148402,
148470,
148479,
148580,
148582,
148583,
148653,
148655,
148713,
148769,
148770,
148803,
148882,
148883,
148990,
148992,
148993,
149066,
149068,
149101,
149193,
149194,
149301,
149303,
149304,
149383,
149385,
149434,
149468,
149474,
149521,
149560,
149582,
149622,
149623,
149679,
149685,
149686,
149740,
149742,
149743,
149808,
149810,
149870,
149872,
149873,
149934,
149936,
149995,
150071,
150073,
150074,
150128,
150130,
150186,
150192,
150269,
150386,
150417,
150423,
150425,
150426,
150476,
150478,
150505,
150507,
150508,
150556,
150558,
150583,
150585,
150586,
150632,
150634,
150663,
150699,
150714,
150720,
150779,
150833,
150931,
151042,
151141,
151267,
151371,
151481,
151535,
151576,
151647,
151706,
151712,
151714,
151715,
151778,
151780,
151806,
151807,
151849,
151890,
151941,
151942,
151962,
151964,
151965,
152061,
152063,
152119,
152169,
152171,
152172,
152233,
152235,
152278,
152295,
152350,
152352,
152353,
152476,
152478,
152507,
152532,
152558,
152583,
152628,
152672,
152705,
152706,
152722,
152728,
152782,
152832,
152833,
152878,
152968,
152978,
153052,
153096,
153106,
153148,
153158,
153241,
153290,
153300,
153306,
153308,
153309,
153398,
153400,
153429,
153481,
153483,
153484,
153565,
153606,
153608,
153719,
153725,
153808,
153850,
153856,
153877,
153878,
153985,
153991,
154074,
154114,
154120,
154139,
154141,
154142,
154215,
154217,
154273,
154345,
154346,
154385,
154460,
154461,
154494,
154573,
154574,
154681,
154682,
154722,
154799,
154864,
154898,
154942,
154951,
154994,
154996,
154997,
155050,
155052,
155071,
155140,
155141,
155210,
155232,
155288,
155289,
155311,
155327,
155328,
155420,
155421,
155437,
155482,
155488,
155512,
155567,
155647,
155672,
155678,
155687,
155693,
155721,
155776,
155835,
155915,
155940,
155941,
155984,
155990,
155992,
155993,
156056,
156058,
156168,
156169,
156232,
156294,
156295,
156344,
156446,
156555,
156576,
156577,
156603,
156604,
156621,
156670,
156744,
156794,
156815,
156873,
156931,
156998,
157047,
157096,
157145,
157146,
157163,
157212,
157286,
157348,
157369,
157427,
157485,
157564,
157613,
157662,
157711,
157712,
157787,
157788,
157825,
157924,
157930,
157983,
158059,
158084,
158085,
158156,
158218,
158299,
158300,
158360,
158415,
158463,
158464,
158517,
158523,
158524,
158573,
158574,
158576,
158577,
158670,
158715,
158717,
158762,
158790,
158832,
158838,
158919,
158960,
158993,
159012,
159093,
159134,
159167,
159186,
159220,
159252,
159271,
159305,
159337,
159356,
159385,
159414,
159433,
159467,
159493,
159512,
159547,
159575,
159594,
159625,
159654,
159671,
159703,
159709,
159731,
159817,
159848,
159922,
160010,
160110,
160190,
160272,
160354,
160360,
160396,
160398,
160399,
160449,
160451,
160475,
160573,
160596,
160697,
160699,
160700,
160777,
160779,
160819,
160890,
160891,
160913,
160919,
161001,
161112,
161118,
161140,
161146,
161227,
161337,
161343,
161370,
161376,
161460,
161570,
161576,
161585,
161666,
161668,
161669,
161738,
161740,
161771,
161772,
161855,
161856,
161916,
162041,
162042,
162079,
162107,
162145,
162183,
162240,
162291,
162292,
162327,
162333,
162363,
162388,
162428,
162457,
162496,
162513,
162554,
162573,
162604,
162629,
162670,
162699,
162740,
162757,
162796,
162815,
162850,
162881,
162917,
162936,
162968,
163006,
163025,
163042,
163089,
163095,
163194,
163196,
163197,
163266,
163268,
163295,
163399,
163408,
163479,
163481,
163482,
163551,
163553,
163581,
163655,
163664,
163771,
163773,
163774,
163833,
163885,
163887,
163963,
163964,
163998,
164004,
164035,
164126,
164141,
164174,
164267,
164282,
164314,
164406,
164421,
164454,
164484,
164497,
164587,
164602,
164608,
164609,
164718,
164719,
164763,
164764,
164804,
164898,
164944,
165041,
165102,
165202,
165248,
165349,
165358,
165453,
165454,
165527,
165529,
165530,
165602,
165604,
165668,
165746,
165747,
165789,
165790,
165865,
165887,
165903,
165984,
165990,
166057,
166073,
166079,
166080,
166141,
166142,
166187,
166193,
166261,
166339,
166352,
166421,
166427,
166428,
166480,
166482,
166483,
166564,
166566,
166634,
166715,
166736,
166738,
166739,
166847,
166849,
166895,
166901,
166967,
167104,
167244,
167301,
167307,
167309,
167310,
167387,
167389,
167421,
167422,
167459,
167465,
167502,
167545,
167564,
167608,
167653,
167672,
167713,
167752,
167771,
167777,
167778,
167801,
167807,
167867,
167950,
167974,
167980,
167982,
167983,
168065,
168067,
168097,
168098,
168131,
168137,
168182,
168221,
168240,
168280,
168314,
168333,
168376,
168413,
168432,
168475,
168512,
168531,
168577,
168612,
168631,
168648,
168695,
168701,
168810,
168812,
168813,
168886,
168888,
168947,
169020,
169041,
169043,
169044,
169115,
169117,
169154,
169160,
169191,
169254,
169255,
169331,
169341,
169437,
169447,
169448,
169481,
169491,
169529,
169590,
169636,
169704,
169801,
169811,
169817,
169857,
169863,
169935,
169990,
170059,
170060,
170146,
170233,
170234,
170287,
170312,
170313,
170383,
170389,
170391,
170392,
170459,
170461,
170524,
170526,
170527,
170601,
170603,
170684,
170685,
170722,
170728,
170759,
170821,
170822,
170878,
170912,
170999,
171005,
171045,
171051,
171093,
171166,
171167,
171202,
171267,
171288,
171298,
171373,
171449,
171459,
171472,
171505,
171563,
171622,
171623,
171731,
171840,
171846,
171855,
171861,
171940,
171941,
172078,
172212,
172213,
172286,
172324,
172433,
172446,
172555,
172631,
172637,
172639,
172640,
172714,
172716,
172717,
172754,
172760,
172791,
172853,
172854,
172910,
172944,
173032,
173038,
173077,
173083,
173146,
173188,
173208,
173209,
173251,
173324,
173325,
173392,
173393,
173424,
173462,
173519,
173617,
173618,
173638,
173702,
173772,
173773,
173804,
173842,
173902,
174000,
174001,
174024,
174091,
174164,
174165,
174255,
174322,
174376,
174377,
174383,
174392,
174398,
174442,
174517,
174586,
174656,
174724,
174794,
174829,
174912,
174925,
175041,
175047,
175049,
175050,
175125,
175127,
175164,
175170,
175201,
175263,
175264,
175297,
175341,
175351,
175383,
175426,
175449,
175485,
175531,
175554,
175587,
175623,
175655,
175688,
175709,
175754,
175764,
175765,
175828,
175834,
175836,
175837,
175920,
175922,
175959,
175965,
175996,
176058,
176059,
176083,
176126,
176136,
176182,
176205,
176253,
176306,
176352,
176375,
176423,
176476,
176522,
176545,
176590,
176640,
176661,
176704,
176727,
176737,
176738,
176771,
176841,
176854,
176909,
176979,
176980,
177016,
177065,
177075,
177120,
177171,
177221,
177269,
177292,
177338,
177388,
177439,
177490,
177542,
177590,
177613,
177664,
177720,
177741,
177764,
177774,
177775,
177844,
177850,
177852,
177853,
177937,
177939,
177976,
177982,
178013,
178075,
178076,
178100,
178143,
178153,
178199,
178222,
178268,
178349,
178372,
178419,
178502,
178525,
178573,
178643,
178664,
178710,
178733,
178743,
178744,
178777,
178847,
178860,
178915,
178985,
178986,
179022,
179071,
179081,
179126,
179177,
179223,
179246,
179292,
179342,
179393,
179444,
179496,
179544,
179567,
179618,
179674,
179695,
179718,
179728,
179729,
179798,
179804,
179806,
179807,
179868,
179870,
179938,
179940,
179941,
180014,
180016,
180052,
180058,
180124,
180180,
180239,
180288,
180313,
180319,
180321,
180322,
180384,
180386,
180387,
180415,
180421,
180477,
180542,
180548,
180549,
180608,
180609,
180636,
180642,
180683,
180760,
180801,
180807,
180816,
180822,
180879,
180935,
180941,
180943,
180944,
181062,
181064,
181098,
181170,
181171,
181219,
181284,
181285,
181320,
181337,
181343,
181400,
181454,
181522,
181523,
181549,
181555,
181556,
181622,
181623,
181677,
181755,
181756,
181781,
181850,
181851,
181896,
181950,
181968,
181974,
182023,
182033,
182112,
182197,
182250,
182323,
182324,
182358,
182372,
182464,
182525,
182600,
182614,
182615,
182691,
182701,
182707,
182708,
182760,
182762,
182763,
182825,
182827,
182893,
182895,
182896,
182968,
182970,
183042,
183043,
183066,
183102,
183108,
183125,
183149,
183195,
183214,
183244,
183288,
183307,
183338,
183380,
183434,
183451,
183507,
183526,
183532,
183604,
183605,
183677,
183731,
183797,
183798,
183852,
183938,
183939,
184012,
184014,
184015,
184098,
184100,
184134,
184215,
184217,
184218,
184308,
184310,
184333,
184357,
184397,
184398,
184436,
184493,
184494,
184514,
184520,
184537,
184572,
184615,
184634,
184670,
184713,
184739,
184758,
184825,
184861,
184904,
184923,
184929,
184930,
184965,
184971,
185037,
185097,
185121,
185142,
185212,
185218,
185261,
185267,
185288,
185358,
185364,
185366,
185367,
185495,
185523,
185559,
185594,
185626,
185668,
185703,
185744,
185787,
185823,
185853,
185908,
185962,
185998,
186028,
186058,
186083,
186115,
186137,
186163,
186192,
186219,
186246,
186279,
186305,
186340,
186380,
186410,
186452,
186498,
186533,
186567,
186598,
186630,
186653,
186677,
186679,
186681,
186682,
186726,
186728,
186782,
186856,
186916,
186988,
187064,
187126,
187176,
187177,
187231,
187283,
187284,
187328,
187355,
187357,
187358,
187403,
187405,
187427,
187429,
187430,
187477,
187479,
187520,
187522,
187523,
187569,
187571,
187611,
187613,
187614,
187664,
187666,
187702,
187704,
187705,
187756
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 187756,
"ccnet_original_nlines": 9270,
"rps_doc_curly_bracket": 0.004505849909037352,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.050993289798498154,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03438568115234375,
"rps_doc_frac_lines_end_with_ellipsis": 0.000215730004129,
"rps_doc_frac_no_alph_words": 0.5746235847473145,
"rps_doc_frac_unique_words": 0.4637472629547119,
"rps_doc_mean_word_length": 7.379042625427246,
"rps_doc_num_sentences": 894,
"rps_doc_symbol_to_word_ratio": 0.002847020048648119,
"rps_doc_unigram_entropy": 7.626886367797852,
"rps_doc_word_count": 15985,
"rps_doc_frac_chars_dupe_10grams": 0.0741645023226738,
"rps_doc_frac_chars_dupe_5grams": 0.17882394790649414,
"rps_doc_frac_chars_dupe_6grams": 0.15149973332881927,
"rps_doc_frac_chars_dupe_7grams": 0.12310730665922165,
"rps_doc_frac_chars_dupe_8grams": 0.10621937364339828,
"rps_doc_frac_chars_dupe_9grams": 0.08883123844861984,
"rps_doc_frac_chars_top_2gram": 0.02224596031010151,
"rps_doc_frac_chars_top_3gram": 0.01044475007802248,
"rps_doc_frac_chars_top_4gram": 0.00322159007191658,
"rps_doc_books_importance": -14722.3662109375,
"rps_doc_books_importance_length_correction": -14722.3662109375,
"rps_doc_openwebtext_importance": -9000.783203125,
"rps_doc_openwebtext_importance_length_correction": -9000.783203125,
"rps_doc_wikipedia_importance": -6074.75537109375,
"rps_doc_wikipedia_importance_length_correction": -6074.75537109375
},
"fasttext": {
"dclm": 0.6910653114318848,
"english": 0.15089020133018494,
"fineweb_edu_approx": 2.41157603263855,
"eai_general_math": 0.7963908314704895,
"eai_open_web_math": 0.809745728969574,
"eai_web_code": 0.7917336225509644
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "22",
"label": "Truncated"
}
},
"reasoning_depth": {
"primary": {
"code": "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,769,258,748,943,438,000 |
NAME ==== Raku port of Perl's reverse() built-in SYNOPSIS ======== use P5reverse; say reverse "Foo"; # ooF with "Zippo" { say reverse(); # oppiZ, may need parens to avoid compilation error } say reverse 1,2,3; # (3 2 1) with 1,2,3 { say reverse(); # (3 2 1), may need parens to avoid compilation error } DESCRIPTION =========== This module tries to mimic the behaviour of Perl's `reverse` built-in as closely as possible in the Raku Programming Language. ORIGINAL PERL 5 DOCUMENTATION ============================= reverse LIST In list context, returns a list value consisting of the elements of LIST in the opposite order. In scalar context, concatenates the elements of LIST and returns a string value with all characters in the opposite order. print join(", ", reverse "world", "Hello"); # Hello, world print scalar reverse "dlrow ,", "olleH"; # Hello, world Used without arguments in scalar context, reverse() reverses $_. $_ = "dlrow ,olleH"; print reverse; # No output, list context print scalar reverse; # Hello, world Note that reversing an array to itself (as in "@a = reverse @a") will preserve non-existent elements whenever possible; i.e., for non-magical arrays or for tied arrays with "EXISTS" and "DELETE" methods. This operator is also handy for inverting a hash, although there are some caveats. If a value is duplicated in the original hash, only one of those can be represented as a key in the inverted hash. Also, this has to unwind one hash and build a whole new one, which may take some time on a large hash, such as from a DBM file. %by_name = reverse %by_address; # Invert the hash PORTING CAVEATS =============== Context does not define behaviour --------------------------------- Whereas in Perl the type of context determines how `reverse` operates, in this implementation it's the type of parameter that determines the semantics. When given a `List`, it will revert the order of the elements. When given something that can coerce to a `Str`, it will return a string with the characters reversed in order. $_ no longer accessible from caller's scope ------------------------------------------- In future language versions of Raku, it will become impossible to access the `$_` variable of the caller's scope, because it will not have been marked as a dynamic variable. So please consider changing: reverse; to either: reverse($_); or, using the subroutine as a method syntax, with the prefix `.` shortcut to use that scope's `$_` as the invocant: .&reverse; AUTHOR ====== Elizabeth Mattijsen Source can be located at: https://github.com/lizmat/P5reverse . Comments and Pull Requests are wereverseome. COPYRIGHT AND LICENSE ===================== Copyright 2018-2020 Elizabeth Mattijsen Re-imagined from Perl as part of the CPAN Butterfly Plan. This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0.
|
{
"url": "http://cpan.mirror.euserv.net/authors/id/E/EL/ELIZABETH/Perl6/P5reverse-0.0.7.readme",
"source_domain": "cpan.mirror.euserv.net",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "3531",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BYUOAIDQFXI4ZIIYTEZC4RDQACWUWZAO",
"WARC-Concurrent-To": "<urn:uuid:c3e292f1-1b56-42e6-a353-37f03fadbcc6>",
"WARC-Date": "2021-01-17T18:46:16Z",
"WARC-IP-Address": "85.31.185.102",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:P7L2Y4LIB5M2ECVANQDBDJFOVEPGOSSX",
"WARC-Record-ID": "<urn:uuid:0d41b313-984a-4e10-8311-cbe9317671d6>",
"WARC-Target-URI": "http://cpan.mirror.euserv.net/authors/id/E/EL/ELIZABETH/Perl6/P5reverse-0.0.7.readme",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:54264d77-9e9c-4daa-926a-89889ed35178>"
},
"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-246.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": [
2872
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2872,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.001392759964801371,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32833331823349,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03166666999459267,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28833332657814026,
"rps_doc_frac_unique_words": 0.49168646335601807,
"rps_doc_mean_word_length": 4.909738540649414,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0.014999999664723873,
"rps_doc_unigram_entropy": 4.905752658843994,
"rps_doc_word_count": 421,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.034833088517189026,
"rps_doc_frac_chars_dupe_6grams": 0.034833088517189026,
"rps_doc_frac_chars_dupe_7grams": 0.034833088517189026,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01209481991827488,
"rps_doc_frac_chars_top_3gram": 0.013546199537813663,
"rps_doc_frac_chars_top_4gram": 0.020319299772381783,
"rps_doc_books_importance": -265.0227355957031,
"rps_doc_books_importance_length_correction": -265.0227355957031,
"rps_doc_openwebtext_importance": -133.455078125,
"rps_doc_openwebtext_importance_length_correction": -133.455078125,
"rps_doc_wikipedia_importance": -66.98343658447266,
"rps_doc_wikipedia_importance_length_correction": -66.98343658447266
},
"fasttext": {
"dclm": 0.3194431662559509,
"english": 0.8203754425048828,
"fineweb_edu_approx": 2.224149703979492,
"eai_general_math": 0.612079381942749,
"eai_open_web_math": 0.1404963731765747,
"eai_web_code": 0.30971115827560425
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
1,828,385,493,444,374,500 |
WordPress.org
Ready to get started?Download WordPress
Forums
How to manipulate core file from functions.php (3 posts)
1. Kevin Daniels
Member
Posted 2 years ago #
How do I modify line 352 of media.php inside wp-includes folder from functions.php (so it doesn't get over-written upon new releases)
the line is:
$s_y = floor( ($orig_h - $crop_h) / 2 );
I want it to stay:
$s_y = floor( ($orig_h - $crop_h) / 4 );
this basically makes it so a hard crop will use the area slightly above the center so if the image is portrait oriented and of people their heads wont get cut off
2. Andrew Bartel
Member
Posted 2 years ago #
You don't. Didn't you know that every time someone hacks core God kills a kitten?
http://websynthesis.com/wsa/wp-content/uploads/2012/06/hack_core.jpg
This is untested but the function that line 352 is in says you can user the image_resize_dimensions filter to play around with it. Do that instead.
3. Kevin Daniels
Member
Posted 2 years ago #
its not the dimensions I want to change, I want to change the crop position
Topic Closed
This topic has been closed to new replies.
About this Topic
|
{
"url": "https://wordpress.org/support/topic/how-to-manipulate-core-file-from-functionsphp",
"source_domain": "wordpress.org",
"snapshot_id": "crawl=CC-MAIN-2015-11",
"warc_metadata": {
"Content-Length": "16814",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CJQLRNN23CDMZVO5VWTS55QTJONVVRXL",
"WARC-Concurrent-To": "<urn:uuid:c33e4bc5-0eef-4c95-87d1-d1c215e8d245>",
"WARC-Date": "2015-03-01T15:39:03Z",
"WARC-IP-Address": "66.155.40.249",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KRRN754WA23XLKB4BNWFJOTMSDZJMRVJ",
"WARC-Record-ID": "<urn:uuid:92c1dd61-8447-4457-a4df-9b1264dce27b>",
"WARC-Target-URI": "https://wordpress.org/support/topic/how-to-manipulate-core-file-from-functionsphp",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db5f63a2-ee96-48cb-9817-84a3924facb0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-28-5-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-11\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for February 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
14,
15,
55,
56,
63,
64,
121,
122,
141,
152,
177,
178,
316,
317,
334,
379,
380,
403,
448,
449,
616,
617,
636,
647,
672,
673,
759,
760,
833,
834,
986,
987,
1006,
1017,
1042,
1043,
1123,
1124,
1137,
1138,
1181,
1182
],
"line_end_idx": [
14,
15,
55,
56,
63,
64,
121,
122,
141,
152,
177,
178,
316,
317,
334,
379,
380,
403,
448,
449,
616,
617,
636,
647,
672,
673,
759,
760,
833,
834,
986,
987,
1006,
1017,
1042,
1043,
1123,
1124,
1137,
1138,
1181,
1182,
1198
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1198,
"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.29182878136634827,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015564199537038803,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2684824764728546,
"rps_doc_frac_unique_words": 0.6132596731185913,
"rps_doc_mean_word_length": 4.69060754776001,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.011673149652779102,
"rps_doc_unigram_entropy": 4.518504619598389,
"rps_doc_word_count": 181,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10247349739074707,
"rps_doc_frac_chars_dupe_6grams": 0.07773852348327637,
"rps_doc_frac_chars_dupe_7grams": 0.07773852348327637,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.042402829974889755,
"rps_doc_frac_chars_top_3gram": 0.04593639820814133,
"rps_doc_frac_chars_top_4gram": 0.06360424309968948,
"rps_doc_books_importance": -113.75904083251953,
"rps_doc_books_importance_length_correction": -113.75904083251953,
"rps_doc_openwebtext_importance": -79.4063949584961,
"rps_doc_openwebtext_importance_length_correction": -79.40042877197266,
"rps_doc_wikipedia_importance": -52.013160705566406,
"rps_doc_wikipedia_importance_length_correction": -52.013160705566406
},
"fasttext": {
"dclm": 0.3720162510871887,
"english": 0.9110031127929688,
"fineweb_edu_approx": 1.1587059497833252,
"eai_general_math": 0.09411699324846268,
"eai_open_web_math": 0.231570303440094,
"eai_web_code": 0.00004709000131697394
}
}
|
{
"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": "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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,059,121,596,260,958,200 |
238386
#82480
Henry Brown
Participant
Agree with you HOWEVER As I read the press release the PRIMARY reason that people were not allowed to use Web 2.0 tools was the concern by CIO’s about the loss of productivity control of people using social networking tools. And the various discussions here at govloop indicate that is also the primary reason for the upward struggle to get these tools implemented in at least some organizations, whether public, private or ????
|
{
"url": "https://www.govloop.com/forums/reply/238386/",
"source_domain": "www.govloop.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "42849",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TTFLDL6QIDHHYOO4YOSK37KJGSG2BDXQ",
"WARC-Concurrent-To": "<urn:uuid:1c0f9399-06cb-4bb5-9461-a02bbb3875be>",
"WARC-Date": "2017-12-12T12:50:25Z",
"WARC-IP-Address": "104.20.5.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SYXZS3PC24MV2LK5JKRJSMW2EK53IZBN",
"WARC-Record-ID": "<urn:uuid:175c6a8b-eab2-4c12-8e58-464cd8958984>",
"WARC-Target-URI": "https://www.govloop.com/forums/reply/238386/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1a22df63-5114-4ffe-b470-a709c279ff62>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-142-32-26.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
7,
8,
15,
16,
28,
40,
41
],
"line_end_idx": [
7,
8,
15,
16,
28,
40,
41,
469
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 469,
"ccnet_original_nlines": 7,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44186046719551086,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.046511631458997726,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12790697813034058,
"rps_doc_frac_unique_words": 0.8051947951316833,
"rps_doc_mean_word_length": 4.935064792633057,
"rps_doc_num_sentences": 3,
"rps_doc_symbol_to_word_ratio": 0.01162790972739458,
"rps_doc_unigram_entropy": 3.998074769973755,
"rps_doc_word_count": 77,
"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.05263157933950424,
"rps_doc_frac_chars_top_3gram": 0.08421052992343903,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -29.661802291870117,
"rps_doc_books_importance_length_correction": -33.69352722167969,
"rps_doc_openwebtext_importance": -23.153963088989258,
"rps_doc_openwebtext_importance_length_correction": -27.185688018798828,
"rps_doc_wikipedia_importance": -14.67593002319336,
"rps_doc_wikipedia_importance_length_correction": -18.70765495300293
},
"fasttext": {
"dclm": 0.05180000886321068,
"english": 0.9489381909370422,
"fineweb_edu_approx": 1.5860226154327393,
"eai_general_math": 0.692317008972168,
"eai_open_web_math": 0.13624805212020874,
"eai_web_code": 0.46211063861846924
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "352.4",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Local government"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "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": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,207,133,496,144,378,000 |
14
When doing spell checking, keying z=, brings up a selection list, as shown bellow.
select correct
As you can see the correct spelling; "i.e." is not shown as any of the options. I would like to enhance this menu, so that I can instead just type in "i.e." and press enter and have it replaced.
It would also be nice, if as part of the same step if I could start typing the name of one of the presented options and tab compete to that -- my mind works better on replacing words by entering words rather than by entering numbers.
I suspect this needs to be done with a plug-in but I'm not certain that it is not just a config option.
3 Answers 3
5
Looking at the spell_suggest() function in spell.c this doesn't seem possible with z=. After getting & displaying all the possible suggestions, it does:
/* Ask for choice. */
selected = prompt_for_number(&mouse_used);
prompt_for_number() lives in misc1.c, and does exactly what you would expect it to do: it prompts for a number (also see get_number() in the same file). Mappings or other input isn't allowed.
A second option is to use Vim's spell "completion" through Ctrl x + s or Ctrl x + Ctrl s1 in insert mode. This does roughly what you want. You can choose from the completions with Ctrl n and Ctrl p or the arrow keys, or type your own improvement.
You can use the supertab plugin to do this with your Tab key. :help ins-completion also has a CleverTab() function which you could adapt for this.
For more information, see: :help ins-completion, :help i_CTRL-X_s
Finally, Vim has the spellsuggest() function, which returns a list of spelling suggestions:
:echo spellsuggest('hellz')
['hells', 'hello', 'hell', 'help', 'halls', 'heals', 'heels', 'hills', 'hulls', 'hell''s',
'hellos', 'hell’s', 'held', 'helm', 'tell', 'well', 'bells', 'cells', 'dells', 'fells',
'helot', 'helve', 'hertz', 'hilly', 'holly']
You could use this function to construct your own spell suggestion screen.
Footnote
1: Note that using Ctrl s may not work, as the docs mention:
NOTE: CTRL-S suspends display in many Unix terminals. Use 's' instead. Type CTRL-Q to resume displaying.
If you're using gVim, using Ctrl s should work. Or you could disable this in your terminal with stty -ixon.
3
I'm going to expand/consolidate @quincy-bowers answer:
1. You can not enter you own suggestions from the spell suggestions screen.
2. It doesn't make much sense (in VIM) to enter your own suggestions form the spell suggestions screen.
VIM is a text editor. Since that is what it does best it leaves the editing to itself. In other words the answer to change a misspelled word to your own custom suggestion just press enter to dismiss the suggestion list and then change the word to your correct spelling manually. (ciw works perfect for that).
Then (as @quincy-bowers suggested) if you want the custom correct spelling to show up in subsequent suggestion lists type zg when the cursor is on the word and it will be added to your spelling dictionary (see :help zg for details).
However, after saying all that, it hasn't stopped the clever folks who use VIM from finding alternatives (unlimited ways to skin a cat they say) and so you could try an alternative plugin for example unite-spell-suggest.
3
2
Without adding any plugins you can add a known good word to your spell file. Rather than z= to bring up the spelling suggestions, visually select the text you want to add to the spell file and press zg.
I should also note that from within the spell suggestion window you can use the mouse to select the one you want as long as you have enabled the mouse for NORMAL mode. I have set mouse=a set in my .vimrc, for instance, which enables the mouse in all modes whether I am in Vim or gVim.
I don't think the other things you want can be accomplished without a plugin or changing Vim itself.
3
• 1
These are all useful tips, but I don't see how they answer the question? Commented Feb 16, 2015 at 15:35
• @Carpetsmoker I could say the same about your own answer. I told him it wasn't possible and offered a change of workflow as a possible work around. Just like you did. Commented Feb 16, 2015 at 17:16
• 1
@MartinTournoij This answer actually gives a solution to the problem: Needs to include new word > zg executes such inclusion.
– nilon
Commented Aug 8, 2018 at 22:28
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://vi.stackexchange.com/questions/835/how-can-i-make-the-spellcheck-selection-window-allow-me-to-type-my-own-correctio",
"source_domain": "vi.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "184790",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KISTHYUUOSCSYQXCQZVBKSYS6644YCMK",
"WARC-Concurrent-To": "<urn:uuid:e3019380-f229-468e-9398-66a83d47a66b>",
"WARC-Date": "2024-06-21T00:15:12Z",
"WARC-IP-Address": "172.64.144.30",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5RF725ZABGH64C3MBGEFBP6HCVDNKYGG",
"WARC-Record-ID": "<urn:uuid:7a4486c9-01d7-444a-8dd2-1025d9a65d08>",
"WARC-Target-URI": "https://vi.stackexchange.com/questions/835/how-can-i-make-the-spellcheck-selection-window-allow-me-to-type-my-own-correctio",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9ac43046-f188-4477-aa04-eda2bc8e646f>"
},
"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-105\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,
3,
4,
87,
88,
103,
104,
299,
300,
534,
535,
639,
640,
652,
653,
655,
656,
809,
810,
832,
875,
876,
1068,
1069,
1070,
1317,
1318,
1465,
1466,
1532,
1533,
1534,
1626,
1627,
1655,
1746,
1835,
1881,
1882,
1957,
1958,
1959,
1968,
1969,
2030,
2031,
2136,
2137,
2245,
2246,
2248,
2249,
2304,
2305,
2383,
2489,
2490,
2799,
2800,
3033,
3034,
3255,
3256,
3258,
3260,
3261,
3464,
3465,
3750,
3751,
3852,
3853,
3855,
3861,
3970,
4173,
4179,
4309,
4321,
4356,
4357,
4369,
4370,
4486,
4487
],
"line_end_idx": [
3,
4,
87,
88,
103,
104,
299,
300,
534,
535,
639,
640,
652,
653,
655,
656,
809,
810,
832,
875,
876,
1068,
1069,
1070,
1317,
1318,
1465,
1466,
1532,
1533,
1534,
1626,
1627,
1655,
1746,
1835,
1881,
1882,
1957,
1958,
1959,
1968,
1969,
2030,
2031,
2136,
2137,
2245,
2246,
2248,
2249,
2304,
2305,
2383,
2489,
2490,
2799,
2800,
3033,
3034,
3255,
3256,
3258,
3260,
3261,
3464,
3465,
3750,
3751,
3852,
3853,
3855,
3861,
3970,
4173,
4179,
4309,
4321,
4356,
4357,
4369,
4370,
4486,
4487,
4577
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4577,
"ccnet_original_nlines": 84,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40740740299224854,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02241715043783188,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2300194948911667,
"rps_doc_frac_unique_words": 0.44005101919174194,
"rps_doc_mean_word_length": 4.414540767669678,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.351966381072998,
"rps_doc_word_count": 784,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.011557349935173988,
"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.010401619598269463,
"rps_doc_frac_chars_top_3gram": 0.008668020367622375,
"rps_doc_frac_chars_top_4gram": 0.006934409961104393,
"rps_doc_books_importance": -377.6619873046875,
"rps_doc_books_importance_length_correction": -377.6619873046875,
"rps_doc_openwebtext_importance": -216.74794006347656,
"rps_doc_openwebtext_importance_length_correction": -216.74794006347656,
"rps_doc_wikipedia_importance": -206.28878784179688,
"rps_doc_wikipedia_importance_length_correction": -206.28878784179688
},
"fasttext": {
"dclm": 0.06815177202224731,
"english": 0.9148462414741516,
"fineweb_edu_approx": 1.6359654664993286,
"eai_general_math": 0.255853533744812,
"eai_open_web_math": 0.21680963039398193,
"eai_web_code": 0.07433872669935226
}
}
|
{
"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.436",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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,792,085,748,116,174,000 |
my dog learned polymorphism
The moose likes Java Micro Edition and the fly likes many language how to? Big Moose Saloon
Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login
Win a copy of REST with Spring (video course) this week in the Spring forum!
JavaRanch » Java Forums » Mobile » Java Micro Edition
Bookmark "many language how to?" Watch "many language how to?" New topic
Author
many language how to?
senu shankar
Greenhorn
Joined: Feb 19, 2004
Posts: 3
Hi,
I have English , Chinese, Japanese and Hindi on my mobile phone. I want to use an application in Tamil (it is an Indian language). How to implement this? Do I have to load tamil ttf font in resource folder and then use unicode? Or do I have to use some other form of ttf? Pl help resolve this.
thanks In advance.
senu shankar
Greenhorn
Joined: Feb 19, 2004
Posts: 3
doesn't any body know? Strange. Experts on board? Hasn't ANYONE developed a foriegn langauge midlets?
David Price
Ranch Hand
Joined: Jan 22, 2003
Posts: 93
If your phone doesn't support Tamil natively (e.g., you can't switch the menus to use Tamil), then it won't support Tamil in MIDlet UI components either. In this case, you could still display Tamil characters in a MIDlet by including the font as a PNG image file in the MIDlet's JAR file and drawing the characters on a MIDP 'Canvas' (use a clip window to make only the needed character get drawn). However, entering text in Tamil would probably be very clumsy.
If the phone does support Tamil natively, then your MIDlet should just automatically work in Tamil too. Java language characters and Strings all use Unicode, so a MIDlet should work in Tamil without modification: just use Tamil characters for all the messages you display, and e.g. TextFields will use Tamil for input. If your messages are in your Java source code and that source code is in ASCII or ISO-8859-1, you'll have to represent the Tamil characters using Java's Unicode escape sequences, e.g.: '\u01C9'.
subject: many language how to?
It's not a secret anymore!
|
{
"url": "http://www.coderanch.com/t/227809/JME/Mobile/language",
"source_domain": "www.coderanch.com",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "24168",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QGCAGDJ7GGN72ACXHLFGPNNOHLOW62Q3",
"WARC-Concurrent-To": "<urn:uuid:dae474db-281c-40c1-af53-041f3504e523>",
"WARC-Date": "2015-10-08T18:28:28Z",
"WARC-IP-Address": "204.144.184.130",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ULMQFEHJXHRXKQEBESMSMW6MYTYSMSDU",
"WARC-Record-ID": "<urn:uuid:067915d6-7cf9-4c09-a71b-19ab6a539750>",
"WARC-Target-URI": "http://www.coderanch.com/t/227809/JME/Mobile/language",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6ff93deb-2cf6-4e32-bb04-e5f745e103e2>"
},
"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,
28,
120,
201,
218,
219,
220,
297,
351,
424,
431,
432,
454,
455,
468,
478,
479,
500,
509,
513,
807,
826,
839,
849,
850,
871,
880,
982,
994,
1005,
1006,
1027,
1037,
1499,
2013,
2015,
2017,
2048,
2050
],
"line_end_idx": [
28,
120,
201,
218,
219,
220,
297,
351,
424,
431,
432,
454,
455,
468,
478,
479,
500,
509,
513,
807,
826,
839,
849,
850,
871,
880,
982,
994,
1005,
1006,
1027,
1037,
1499,
2013,
2015,
2017,
2048,
2050,
2076
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2076,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3377777934074402,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028888890519738197,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20666666328907013,
"rps_doc_frac_unique_words": 0.5434173941612244,
"rps_doc_mean_word_length": 4.509803771972656,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.934346675872803,
"rps_doc_word_count": 357,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05093168094754219,
"rps_doc_frac_chars_dupe_6grams": 0.05093168094754219,
"rps_doc_frac_chars_dupe_7grams": 0.05093168094754219,
"rps_doc_frac_chars_dupe_8grams": 0.05093168094754219,
"rps_doc_frac_chars_dupe_9grams": 0.05093168094754219,
"rps_doc_frac_chars_top_2gram": 0.040993791073560715,
"rps_doc_frac_chars_top_3gram": 0.048447199165821075,
"rps_doc_frac_chars_top_4gram": 0.05279503017663956,
"rps_doc_books_importance": -181.67791748046875,
"rps_doc_books_importance_length_correction": -181.67791748046875,
"rps_doc_openwebtext_importance": -118.33773803710938,
"rps_doc_openwebtext_importance_length_correction": -118.33773803710938,
"rps_doc_wikipedia_importance": -93.36430358886719,
"rps_doc_wikipedia_importance_length_correction": -93.36430358886719
},
"fasttext": {
"dclm": 0.02463621087372303,
"english": 0.8938323259353638,
"fineweb_edu_approx": 2.080313205718994,
"eai_general_math": 0.013861889950931072,
"eai_open_web_math": 0.15345805883407593,
"eai_web_code": 0.0004073999880347401
}
}
|
{
"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.01954",
"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
|
-7,133,003,665,770,658,000 |
Saturday, 20 June 2015
Introduction to Linq to SharePoint
Introduction to Linq to SharePoint
LINQ is a way to access external data sources.SharePoint Foundation 2010 comes with its own LINQ to SharePoint provider.
The namespace which contains the provider is Microsoft.SharePoint.Linq.dll.
LINQ provides strongly typed classes, this is an advantage of LINQ over CAML query.
Another advantage of LINQ is that Visual Studio provides IntelliSense to help in writing a query where as CAML Query is written in a string of text which will be executed only at runtime.
Overall we can say that LINQ provides more readable syntax than CAML.
As LINQ provides strongly typed classes, so SharePoint List must be strongly typed. This can be done by command line tool SPMetal.exe.
SPMetal.exe generate a class file which contains details about the list such as columns, content types, and other information.
SPMetal.exe is available in bin folder within hive folder of SharePoint.
Syntax to work with SPMetal is :
> "C:\Program Files...\14\bin\" SPMetal /web:http://spserver/sites /code:Site.cs /namespace:SP.Cafe.Linq
So above command will create entity classes for each list and library in the site and one DataContext class.
Now it's time to access Site Data using LINQ.
First, create a DataContext class which is a part of Microsoft.SharePoint.Linq namespace. To access site data use below code.
DataContext dctxt = new DataContext("Site URL");
Pass list entity type to DataContext object to get a list object.
List object that's returned has a type of EntityList<T>, where T is the type of object in the list.
Suppose your list name is Employee then overall code will look like this:
using System.Linq;
using Microsoft.SharePoint;
using Microsoft.SharePoint.Linq;
DataContext dctxt = new DataContext("Site URL");
EntityList<Employee> emp = dctxt.GetList<Employee>("Employee");
var empData = from employee in emp select new {EmployeeName = employee.Title};
Gridview1.DataSource = empData;
Gridview1.DataBind();
In next blog, i will post the practical of this blog with the screen shot.
Disqus Comments
|
{
"url": "https://www.sharepointcafe.net/2015/06/introduction-to-linq-to-sharepoint.html",
"source_domain": "www.sharepointcafe.net",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "88624",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PF3LVDNJM3BXPDIA74TRDSQ7OGLGRXH2",
"WARC-Concurrent-To": "<urn:uuid:9a0485b3-7bbf-43d9-a7ff-be67c6df667c>",
"WARC-Date": "2020-01-21T06:56:52Z",
"WARC-IP-Address": "172.217.13.243",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MH7QSA2HZ7OGHFVMICEWM6KZAA6H2VE7",
"WARC-Record-ID": "<urn:uuid:4b29c3f8-b53b-425a-8afe-0821b5e79c8b>",
"WARC-Target-URI": "https://www.sharepointcafe.net/2015/06/introduction-to-linq-to-sharepoint.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3eda7d6d-729e-4f49-b80c-f8d71595d115>"
},
"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-154.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,
23,
24,
59,
60,
95,
96,
97,
218,
294,
295,
296,
297,
381,
569,
570,
640,
641,
776,
777,
904,
905,
978,
979,
1012,
1013,
1118,
1119,
1228,
1229,
1275,
1276,
1402,
1403,
1452,
1453,
1519,
1619,
1620,
1694,
1695,
1714,
1742,
1775,
1824,
1888,
1967,
1999,
2021,
2022,
2023,
2098,
2099,
2100,
2101,
2117
],
"line_end_idx": [
23,
24,
59,
60,
95,
96,
97,
218,
294,
295,
296,
297,
381,
569,
570,
640,
641,
776,
777,
904,
905,
978,
979,
1012,
1013,
1118,
1119,
1228,
1229,
1275,
1276,
1402,
1403,
1452,
1453,
1519,
1619,
1620,
1694,
1695,
1714,
1742,
1775,
1824,
1888,
1967,
1999,
2021,
2022,
2023,
2098,
2099,
2100,
2101,
2117,
2118
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2118,
"ccnet_original_nlines": 55,
"rps_doc_curly_bracket": 0.0009442900191061199,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31455397605895996,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0399060994386673,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2089201956987381,
"rps_doc_frac_unique_words": 0.5180327892303467,
"rps_doc_mean_word_length": 5.485245704650879,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0.0023474199697375298,
"rps_doc_unigram_entropy": 4.75579833984375,
"rps_doc_word_count": 305,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11835026741027832,
"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.010759119875729084,
"rps_doc_frac_chars_top_3gram": 0.028690969571471214,
"rps_doc_frac_chars_top_4gram": 0.023909149691462517,
"rps_doc_books_importance": -167.28488159179688,
"rps_doc_books_importance_length_correction": -167.28488159179688,
"rps_doc_openwebtext_importance": -76.27802276611328,
"rps_doc_openwebtext_importance_length_correction": -76.27802276611328,
"rps_doc_wikipedia_importance": -57.14433288574219,
"rps_doc_wikipedia_importance_length_correction": -57.14433288574219
},
"fasttext": {
"dclm": 0.03043491020798683,
"english": 0.7857971787452698,
"fineweb_edu_approx": 2.6389315128326416,
"eai_general_math": 0.6787109375,
"eai_open_web_math": 0.03965746983885765,
"eai_web_code": 0.7978571653366089
}
}
|
{
"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": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,462,373,816,461,054,000 |
/* * FFV1 decoder * * Copyright (c) 2003-2012 Michael Niedermayer * * This file is part of FFmpeg. * * FFmpeg is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * FFmpeg is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with FFmpeg; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA */ /** * @file * FF Video Codec 1 (a lossless codec) decoder */ #include "libavutil/avassert.h" #include "libavutil/crc.h" #include "libavutil/opt.h" #include "libavutil/imgutils.h" #include "libavutil/pixdesc.h" #include "libavutil/timer.h" #include "avcodec.h" #include "internal.h" #include "get_bits.h" #include "rangecoder.h" #include "golomb.h" #include "mathops.h" #include "ffv1.h" static inline av_flatten int get_symbol_inline(RangeCoder *c, uint8_t *state, int is_signed) { if (get_rac(c, state + 0)) return 0; else { int i, e, a; e = 0; while (get_rac(c, state + 1 + FFMIN(e, 9))) // 1..10 e++; a = 1; for (i = e - 1; i >= 0; i--) a += a + get_rac(c, state + 22 + FFMIN(i, 9)); // 22..31 e = -(is_signed && get_rac(c, state + 11 + FFMIN(e, 10))); // 11..21 return (a ^ e) - e; } } static av_noinline int get_symbol(RangeCoder *c, uint8_t *state, int is_signed) { return get_symbol_inline(c, state, is_signed); } static inline int get_vlc_symbol(GetBitContext *gb, VlcState *const state, int bits) { int k, i, v, ret; i = state->count; k = 0; while (i < state->error_sum) { // FIXME: optimize k++; i += i; } v = get_sr_golomb(gb, k, 12, bits); av_dlog(NULL, "v:%d bias:%d error:%d drift:%d count:%d k:%d", v, state->bias, state->error_sum, state->drift, state->count, k); #if 0 // JPEG LS if (k == 0 && 2 * state->drift <= -state->count) v ^= (-1); #else v ^= ((2 * state->drift + state->count) >> 31); #endif ret = fold(v + state->bias, bits); update_vlc_state(state, v); return ret; } static av_always_inline void decode_line(FFV1Context *s, int w, int16_t *sample[2], int plane_index, int bits) { PlaneContext *const p = &s->plane[plane_index]; RangeCoder *const c = &s->c; int x; int run_count = 0; int run_mode = 0; int run_index = s->run_index; for (x = 0; x < w; x++) { int diff, context, sign; context = get_context(p, sample[1] + x, sample[0] + x, sample[1] + x); if (context < 0) { context = -context; sign = 1; } else sign = 0; av_assert2(context < p->context_count); if (s->ac) { diff = get_symbol_inline(c, p->state[context], 1); } else { if (context == 0 && run_mode == 0) run_mode = 1; if (run_mode) { if (run_count == 0 && run_mode == 1) { if (get_bits1(&s->gb)) { run_count = 1 << ff_log2_run[run_index]; if (x + run_count <= w) run_index++; } else { if (ff_log2_run[run_index]) run_count = get_bits(&s->gb, ff_log2_run[run_index]); else run_count = 0; if (run_index) run_index--; run_mode = 2; } } run_count--; if (run_count < 0) { run_mode = 0; run_count = 0; diff = get_vlc_symbol(&s->gb, &p->vlc_state[context], bits); if (diff >= 0) diff++; } else diff = 0; } else diff = get_vlc_symbol(&s->gb, &p->vlc_state[context], bits); av_dlog(s->avctx, "count:%d index:%d, mode:%d, x:%d pos:%d\n", run_count, run_index, run_mode, x, get_bits_count(&s->gb)); } if (sign) diff = -diff; sample[1][x] = (predict(sample[1] + x, sample[0] + x) + diff) & ((1 << bits) - 1); } s->run_index = run_index; } static void decode_plane(FFV1Context *s, uint8_t *src, int w, int h, int stride, int plane_index) { int x, y; int16_t *sample[2]; sample[0] = s->sample_buffer + 3; sample[1] = s->sample_buffer + w + 6 + 3; s->run_index = 0; memset(s->sample_buffer, 0, 2 * (w + 6) * sizeof(*s->sample_buffer)); for (y = 0; y < h; y++) { int16_t *temp = sample[0]; // FIXME: try a normal buffer sample[0] = sample[1]; sample[1] = temp; sample[1][-1] = sample[0][0]; sample[0][w] = sample[0][w - 1]; // { START_TIMER if (s->avctx->bits_per_raw_sample <= 8) { decode_line(s, w, sample, plane_index, 8); for (x = 0; x < w; x++) src[x + stride * y] = sample[1][x]; } else { decode_line(s, w, sample, plane_index, s->avctx->bits_per_raw_sample); if (s->packed_at_lsb) { for (x = 0; x < w; x++) { ((uint16_t*)(src + stride*y))[x] = sample[1][x]; } } else { for (x = 0; x < w; x++) { ((uint16_t*)(src + stride*y))[x] = sample[1][x] << (16 - s->avctx->bits_per_raw_sample); } } } // STOP_TIMER("decode-line") } } } static void decode_rgb_frame(FFV1Context *s, uint8_t *src[3], int w, int h, int stride[3]) { int x, y, p; int16_t *sample[4][2]; int lbd = s->avctx->bits_per_raw_sample <= 8; int bits = s->avctx->bits_per_raw_sample > 0 ? s->avctx->bits_per_raw_sample : 8; int offset = 1 << bits; for (x = 0; x < 4; x++) { sample[x][0] = s->sample_buffer + x * 2 * (w + 6) + 3; sample[x][1] = s->sample_buffer + (x * 2 + 1) * (w + 6) + 3; } s->run_index = 0; memset(s->sample_buffer, 0, 8 * (w + 6) * sizeof(*s->sample_buffer)); for (y = 0; y < h; y++) { for (p = 0; p < 3 + s->transparency; p++) { int16_t *temp = sample[p][0]; // FIXME: try a normal buffer sample[p][0] = sample[p][1]; sample[p][1] = temp; sample[p][1][-1]= sample[p][0][0 ]; sample[p][0][ w]= sample[p][0][w-1]; if (lbd) decode_line(s, w, sample[p], (p + 1)/2, 9); else decode_line(s, w, sample[p], (p + 1)/2, bits + 1); } for (x = 0; x < w; x++) { int g = sample[0][1][x]; int b = sample[1][1][x]; int r = sample[2][1][x]; int a = sample[3][1][x]; b -= offset; r -= offset; g -= (b + r) >> 2; b += g; r += g; if (lbd) *((uint32_t*)(src[0] + x*4 + stride[0]*y)) = b + (g<<8) + (r<<16) + (a<<24); else { *((uint16_t*)(src[0] + x*2 + stride[0]*y)) = b; *((uint16_t*)(src[1] + x*2 + stride[1]*y)) = g; *((uint16_t*)(src[2] + x*2 + stride[2]*y)) = r; } } } } static int decode_slice_header(FFV1Context *f, FFV1Context *fs) { RangeCoder *c = &fs->c; uint8_t state[CONTEXT_SIZE]; unsigned ps, i, context_count; memset(state, 128, sizeof(state)); av_assert0(f->version > 2); fs->slice_x = get_symbol(c, state, 0) * f->width ; fs->slice_y = get_symbol(c, state, 0) * f->height; fs->slice_width = (get_symbol(c, state, 0) + 1) * f->width + fs->slice_x; fs->slice_height = (get_symbol(c, state, 0) + 1) * f->height + fs->slice_y; fs->slice_x /= f->num_h_slices; fs->slice_y /= f->num_v_slices; fs->slice_width = fs->slice_width /f->num_h_slices - fs->slice_x; fs->slice_height = fs->slice_height/f->num_v_slices - fs->slice_y; if ((unsigned)fs->slice_width > f->width || (unsigned)fs->slice_height > f->height) return -1; if ( (unsigned)fs->slice_x + (uint64_t)fs->slice_width > f->width || (unsigned)fs->slice_y + (uint64_t)fs->slice_height > f->height) return -1; for (i = 0; i < f->plane_count; i++) { PlaneContext * const p = &fs->plane[i]; int idx = get_symbol(c, state, 0); if (idx > (unsigned)f->quant_table_count) { av_log(f->avctx, AV_LOG_ERROR, "quant_table_index out of range\n"); return -1; } p->quant_table_index = idx; memcpy(p->quant_table, f->quant_tables[idx], sizeof(p->quant_table)); context_count = f->context_count[idx]; if (p->context_count < context_count) { av_freep(&p->state); av_freep(&p->vlc_state); } p->context_count = context_count; } ps = get_symbol(c, state, 0); if (ps == 1) { f->cur->interlaced_frame = 1; f->cur->top_field_first = 1; } else if (ps == 2) { f->cur->interlaced_frame = 1; f->cur->top_field_first = 0; } else if (ps == 3) { f->cur->interlaced_frame = 0; } f->cur->sample_aspect_ratio.num = get_symbol(c, state, 0); f->cur->sample_aspect_ratio.den = get_symbol(c, state, 0); return 0; } static int decode_slice(AVCodecContext *c, void *arg) { FFV1Context *fs = *(void **)arg; FFV1Context *f = fs->avctx->priv_data; int width, height, x, y, ret; const int ps = av_pix_fmt_desc_get(c->pix_fmt)->comp[0].step_minus1 + 1; AVFrame * const p = f->cur; if (f->version > 2) { if (ffv1_init_slice_state(f, fs) < 0) return AVERROR(ENOMEM); if (decode_slice_header(f, fs) < 0) { fs->slice_damaged = 1; return AVERROR_INVALIDDATA; } } if ((ret = ffv1_init_slice_state(f, fs)) < 0) return ret; if (f->cur->key_frame) ffv1_clear_slice_state(f, fs); width = fs->slice_width; height = fs->slice_height; x = fs->slice_x; y = fs->slice_y; if (!fs->ac) { if (f->version == 3 && f->minor_version > 1 || f->version > 3) get_rac(&fs->c, (uint8_t[]) { 129 }); fs->ac_byte_count = f->version > 2 || (!x && !y) ? fs->c.bytestream - fs->c.bytestream_start - 1 : 0; init_get_bits(&fs->gb, fs->c.bytestream_start + fs->ac_byte_count, (fs->c.bytestream_end - fs->c.bytestream_start - fs->ac_byte_count) * 8); } av_assert1(width && height); if (f->colorspace == 0) { const int chroma_width = -((-width) >> f->chroma_h_shift); const int chroma_height = -((-height) >> f->chroma_v_shift); const int cx = x >> f->chroma_h_shift; const int cy = y >> f->chroma_v_shift; decode_plane(fs, p->data[0] + ps*x + y*p->linesize[0], width, height, p->linesize[0], 0); if (f->chroma_planes) { decode_plane(fs, p->data[1] + ps*cx+cy*p->linesize[1], chroma_width, chroma_height, p->linesize[1], 1); decode_plane(fs, p->data[2] + ps*cx+cy*p->linesize[2], chroma_width, chroma_height, p->linesize[2], 1); } if (fs->transparency) decode_plane(fs, p->data[3] + ps*x + y*p->linesize[3], width, height, p->linesize[3], 2); } else { uint8_t *planes[3] = { p->data[0] + ps * x + y * p->linesize[0], p->data[1] + ps * x + y * p->linesize[1], p->data[2] + ps * x + y * p->linesize[2] }; decode_rgb_frame(fs, planes, width, height, p->linesize); } if (fs->ac && f->version > 2) { int v; get_rac(&fs->c, (uint8_t[]) { 129 }); v = fs->c.bytestream_end - fs->c.bytestream - 2 - 5*f->ec; if (v) { av_log(f->avctx, AV_LOG_ERROR, "bytestream end mismatching by %d\n", v); fs->slice_damaged = 1; } } emms_c(); return 0; } static int read_quant_table(RangeCoder *c, int16_t *quant_table, int scale) { int v; int i = 0; uint8_t state[CONTEXT_SIZE]; memset(state, 128, sizeof(state)); for (v = 0; i < 128; v++) { unsigned len = get_symbol(c, state, 0) + 1; if (len > 128 - i) return AVERROR_INVALIDDATA; while (len--) { quant_table[i] = scale * v; i++; } } for (i = 1; i < 128; i++) quant_table[256 - i] = -quant_table[i]; quant_table[128] = -quant_table[127]; return 2 * v - 1; } static int read_quant_tables(RangeCoder *c, int16_t quant_table[MAX_CONTEXT_INPUTS][256]) { int i; int context_count = 1; for (i = 0; i < 5; i++) { context_count *= read_quant_table(c, quant_table[i], context_count); if (context_count > 32768U) { return AVERROR_INVALIDDATA; } } return (context_count + 1) / 2; } static int read_extra_header(FFV1Context *f) { RangeCoder *const c = &f->c; uint8_t state[CONTEXT_SIZE]; int i, j, k, ret; uint8_t state2[32][CONTEXT_SIZE]; memset(state2, 128, sizeof(state2)); memset(state, 128, sizeof(state)); ff_init_range_decoder(c, f->avctx->extradata, f->avctx->extradata_size); ff_build_rac_states(c, 0.05 * (1LL << 32), 256 - 8); f->version = get_symbol(c, state, 0); if (f->version > 2) { c->bytestream_end -= 4; f->minor_version = get_symbol(c, state, 0); } f->ac = f->avctx->coder_type = get_symbol(c, state, 0); if (f->ac > 1) { for (i = 1; i < 256; i++) f->state_transition[i] = get_symbol(c, state, 1) + c->one_state[i]; } f->colorspace = get_symbol(c, state, 0); //YUV cs type f->avctx->bits_per_raw_sample = get_symbol(c, state, 0); f->chroma_planes = get_rac(c, state); f->chroma_h_shift = get_symbol(c, state, 0); f->chroma_v_shift = get_symbol(c, state, 0); f->transparency = get_rac(c, state); f->plane_count = 2 + f->transparency; f->num_h_slices = 1 + get_symbol(c, state, 0); f->num_v_slices = 1 + get_symbol(c, state, 0); if (f->num_h_slices > (unsigned)f->width || !f->num_h_slices || f->num_v_slices > (unsigned)f->height || !f->num_v_slices ) { av_log(f->avctx, AV_LOG_ERROR, "slice count invalid\n"); return AVERROR_INVALIDDATA; } f->quant_table_count = get_symbol(c, state, 0); if (f->quant_table_count > (unsigned)MAX_QUANT_TABLES) return AVERROR_INVALIDDATA; for (i = 0; i < f->quant_table_count; i++) { f->context_count[i] = read_quant_tables(c, f->quant_tables[i]); if (f->context_count[i] < 0) { av_log(f->avctx, AV_LOG_ERROR, "read_quant_table error\n"); return AVERROR_INVALIDDATA; } } if ((ret = ffv1_allocate_initial_states(f)) < 0) return ret; for (i = 0; i < f->quant_table_count; i++) if (get_rac(c, state)) { for (j = 0; j < f->context_count[i]; j++) for (k = 0; k < CONTEXT_SIZE; k++) { int pred = j ? f->initial_states[i][j - 1][k] : 128; f->initial_states[i][j][k] = (pred + get_symbol(c, state2[k], 1)) & 0xFF; } } if (f->version > 2) { f->ec = get_symbol(c, state, 0); } if (f->version > 2) { unsigned v; v = av_crc(av_crc_get_table(AV_CRC_32_IEEE), 0, f->avctx->extradata, f->avctx->extradata_size); if (v) { av_log(f->avctx, AV_LOG_ERROR, "CRC mismatch %X!\n", v); return AVERROR_INVALIDDATA; } } return 0; } static int read_header(FFV1Context *f) { uint8_t state[CONTEXT_SIZE]; int i, j, context_count = -1; //-1 to avoid warning RangeCoder *const c = &f->slice_context[0]->c; memset(state, 128, sizeof(state)); if (f->version < 2) { unsigned v= get_symbol(c, state, 0); if (v >= 2) { av_log(f->avctx, AV_LOG_ERROR, "invalid version %d in ver01 header\n", v); return AVERROR_INVALIDDATA; } f->version = v; f->ac = f->avctx->coder_type = get_symbol(c, state, 0); if (f->ac > 1) { for (i = 1; i < 256; i++) f->state_transition[i] = get_symbol(c, state, 1) + c->one_state[i]; } f->colorspace = get_symbol(c, state, 0); //YUV cs type if (f->version > 0) f->avctx->bits_per_raw_sample = get_symbol(c, state, 0); f->chroma_planes = get_rac(c, state); f->chroma_h_shift = get_symbol(c, state, 0); f->chroma_v_shift = get_symbol(c, state, 0); f->transparency = get_rac(c, state); f->plane_count = 2 + f->transparency; } if (f->colorspace == 0) { if (!f->transparency && !f->chroma_planes) { if (f->avctx->bits_per_raw_sample <= 8) f->avctx->pix_fmt = AV_PIX_FMT_GRAY8; else f->avctx->pix_fmt = AV_PIX_FMT_GRAY16; } else if (f->avctx->bits_per_raw_sample<=8 && !f->transparency) { switch(16 * f->chroma_h_shift + f->chroma_v_shift) { case 0x00: f->avctx->pix_fmt = AV_PIX_FMT_YUV444P; break; case 0x01: f->avctx->pix_fmt = AV_PIX_FMT_YUV440P; break; case 0x10: f->avctx->pix_fmt = AV_PIX_FMT_YUV422P; break; case 0x11: f->avctx->pix_fmt = AV_PIX_FMT_YUV420P; break; case 0x20: f->avctx->pix_fmt = AV_PIX_FMT_YUV411P; break; case 0x22: f->avctx->pix_fmt = AV_PIX_FMT_YUV410P; break; default: av_log(f->avctx, AV_LOG_ERROR, "format not supported\n"); return AVERROR(ENOSYS); } } else if (f->avctx->bits_per_raw_sample <= 8 && f->transparency) { switch(16*f->chroma_h_shift + f->chroma_v_shift) { case 0x00: f->avctx->pix_fmt = AV_PIX_FMT_YUVA444P; break; case 0x10: f->avctx->pix_fmt = AV_PIX_FMT_YUVA422P; break; case 0x11: f->avctx->pix_fmt = AV_PIX_FMT_YUVA420P; break; default: av_log(f->avctx, AV_LOG_ERROR, "format not supported\n"); return AVERROR(ENOSYS); } } else if (f->avctx->bits_per_raw_sample == 9) { f->packed_at_lsb = 1; switch(16 * f->chroma_h_shift + f->chroma_v_shift) { case 0x00: f->avctx->pix_fmt = AV_PIX_FMT_YUV444P9; break; case 0x10: f->avctx->pix_fmt = AV_PIX_FMT_YUV422P9; break; case 0x11: f->avctx->pix_fmt = AV_PIX_FMT_YUV420P9; break; default: av_log(f->avctx, AV_LOG_ERROR, "format not supported\n"); return AVERROR(ENOSYS); } } else if (f->avctx->bits_per_raw_sample == 10) { f->packed_at_lsb = 1; switch(16 * f->chroma_h_shift + f->chroma_v_shift) { case 0x00: f->avctx->pix_fmt = AV_PIX_FMT_YUV444P10; break; case 0x10: f->avctx->pix_fmt = AV_PIX_FMT_YUV422P10; break; case 0x11: f->avctx->pix_fmt = AV_PIX_FMT_YUV420P10; break; default: av_log(f->avctx, AV_LOG_ERROR, "format not supported\n"); return AVERROR(ENOSYS); } } else { switch(16 * f->chroma_h_shift + f->chroma_v_shift) { case 0x00: f->avctx->pix_fmt = AV_PIX_FMT_YUV444P16; break; case 0x10: f->avctx->pix_fmt = AV_PIX_FMT_YUV422P16; break; case 0x11: f->avctx->pix_fmt = AV_PIX_FMT_YUV420P16; break; default: av_log(f->avctx, AV_LOG_ERROR, "format not supported\n"); return AVERROR(ENOSYS); } } } else if (f->colorspace == 1) { if (f->chroma_h_shift || f->chroma_v_shift) { av_log(f->avctx, AV_LOG_ERROR, "chroma subsampling not supported in this colorspace\n"); return AVERROR(ENOSYS); } if ( f->avctx->bits_per_raw_sample == 9) f->avctx->pix_fmt = AV_PIX_FMT_GBRP9; else if (f->avctx->bits_per_raw_sample == 10) f->avctx->pix_fmt = AV_PIX_FMT_GBRP10; else if (f->avctx->bits_per_raw_sample == 12) f->avctx->pix_fmt = AV_PIX_FMT_GBRP12; else if (f->avctx->bits_per_raw_sample == 14) f->avctx->pix_fmt = AV_PIX_FMT_GBRP14; else if (f->transparency) f->avctx->pix_fmt = AV_PIX_FMT_RGB32; else f->avctx->pix_fmt = AV_PIX_FMT_0RGB32; } else { av_log(f->avctx, AV_LOG_ERROR, "colorspace not supported\n"); return AVERROR(ENOSYS); } av_dlog(f->avctx, "%d %d %d\n", f->chroma_h_shift, f->chroma_v_shift, f->avctx->pix_fmt); if (f->version < 2) { context_count = read_quant_tables(c, f->quant_table); if (context_count < 0) { av_log(f->avctx, AV_LOG_ERROR, "read_quant_table error\n"); return AVERROR_INVALIDDATA; } } else if (f->version < 3) { f->slice_count = get_symbol(c, state, 0); } else { const uint8_t *p = c->bytestream_end; for (f->slice_count = 0; f->slice_count < MAX_SLICES && 3 < p - c->bytestream_start; f->slice_count++) { int trailer = 3 + 5*!!f->ec; int size = AV_RB24(p-trailer); if (size + trailer > p - c->bytestream_start) break; p -= size + trailer; } } if (f->slice_count > (unsigned)MAX_SLICES || f->slice_count <= 0) { av_log(f->avctx, AV_LOG_ERROR, "slice count %d is invalid\n", f->slice_count); return AVERROR_INVALIDDATA; } for (j = 0; j < f->slice_count; j++) { FFV1Context *fs = f->slice_context[j]; fs->ac = f->ac; fs->packed_at_lsb = f->packed_at_lsb; fs->slice_damaged = 0; if (f->version == 2) { fs->slice_x = get_symbol(c, state, 0) * f->width ; fs->slice_y = get_symbol(c, state, 0) * f->height; fs->slice_width = (get_symbol(c, state, 0) + 1) * f->width + fs->slice_x; fs->slice_height = (get_symbol(c, state, 0) + 1) * f->height + fs->slice_y; fs->slice_x /= f->num_h_slices; fs->slice_y /= f->num_v_slices; fs->slice_width = fs->slice_width / f->num_h_slices - fs->slice_x; fs->slice_height = fs->slice_height / f->num_v_slices - fs->slice_y; if ((unsigned)fs->slice_width > f->width || (unsigned)fs->slice_height > f->height) return AVERROR_INVALIDDATA; if ( (unsigned)fs->slice_x + (uint64_t)fs->slice_width > f->width || (unsigned)fs->slice_y + (uint64_t)fs->slice_height > f->height) return AVERROR_INVALIDDATA; } for (i = 0; i < f->plane_count; i++) { PlaneContext *const p = &fs->plane[i]; if (f->version == 2) { int idx = get_symbol(c, state, 0); if (idx > (unsigned)f->quant_table_count) { av_log(f->avctx, AV_LOG_ERROR, "quant_table_index out of range\n"); return AVERROR_INVALIDDATA; } p->quant_table_index = idx; memcpy(p->quant_table, f->quant_tables[idx], sizeof(p->quant_table)); context_count = f->context_count[idx]; } else { memcpy(p->quant_table, f->quant_table, sizeof(p->quant_table)); } if (f->version <= 2) { av_assert0(context_count >= 0); if (p->context_count < context_count) { av_freep(&p->state); av_freep(&p->vlc_state); } p->context_count = context_count; } } } return 0; } static av_cold int decode_init(AVCodecContext *avctx) { FFV1Context *f = avctx->priv_data; int ret; if ((ret = ffv1_common_init(avctx)) < 0) return ret; if (avctx->extradata && (ret = read_extra_header(f)) < 0) return ret; if ((ret = ffv1_init_slice_contexts(f)) < 0) return ret; return 0; } static int decode_frame(AVCodecContext *avctx, void *data, int *got_frame, AVPacket *avpkt) { const uint8_t *buf = avpkt->data; int buf_size = avpkt->size; FFV1Context *f = avctx->priv_data; RangeCoder *const c = &f->slice_context[0]->c; int i, ret; uint8_t keystate = 128; const uint8_t *buf_p; AVFrame *const p = data; f->cur = p; ff_init_range_decoder(c, buf, buf_size); ff_build_rac_states(c, 0.05 * (1LL << 32), 256 - 8); p->pict_type = AV_PICTURE_TYPE_I; //FIXME I vs. P if (get_rac(c, &keystate)) { p->key_frame = 1; f->key_frame_ok = 0; if ((ret = read_header(f)) < 0) return ret; f->key_frame_ok = 1; } else { if (!f->key_frame_ok) { av_log(avctx, AV_LOG_ERROR, "Cannot decode non-keyframe without valid keyframe\n"); return AVERROR_INVALIDDATA; } p->key_frame = 0; } if ((ret = ff_get_buffer(avctx, p, AV_GET_BUFFER_FLAG_REF)) < 0) return ret; if (avctx->debug & FF_DEBUG_PICT_INFO) av_log(avctx, AV_LOG_DEBUG, "ver:%d keyframe:%d coder:%d ec:%d slices:%d bps:%d\n", f->version, p->key_frame, f->ac, f->ec, f->slice_count, f->avctx->bits_per_raw_sample); buf_p = buf + buf_size; for (i = f->slice_count - 1; i >= 0; i--) { FFV1Context *fs = f->slice_context[i]; int trailer = 3 + 5*!!f->ec; int v; if (i || f->version > 2) v = AV_RB24(buf_p-trailer) + trailer; else v = buf_p - c->bytestream_start; if (buf_p - c->bytestream_start < v) { av_log(avctx, AV_LOG_ERROR, "Slice pointer chain broken\n"); return AVERROR_INVALIDDATA; } buf_p -= v; if (f->ec) { unsigned crc = av_crc(av_crc_get_table(AV_CRC_32_IEEE), 0, buf_p, v); if (crc) { int64_t ts = avpkt->pts != AV_NOPTS_VALUE ? avpkt->pts : avpkt->dts; av_log(f->avctx, AV_LOG_ERROR, "CRC mismatch %X!", crc); if (ts != AV_NOPTS_VALUE && avctx->pkt_timebase.num) { av_log(f->avctx, AV_LOG_ERROR, "at %f seconds\n", ts*av_q2d(avctx->pkt_timebase)); } else if (ts != AV_NOPTS_VALUE) { av_log(f->avctx, AV_LOG_ERROR, "at %"PRId64"\n", ts); } else { av_log(f->avctx, AV_LOG_ERROR, "\n"); } fs->slice_damaged = 1; } } if (i) { ff_init_range_decoder(&fs->c, buf_p, v); } else fs->c.bytestream_end = (uint8_t *)(buf_p + v); fs->cur = p; } avctx->execute(avctx, decode_slice, &f->slice_context[0], NULL, f->slice_count, sizeof(void*)); for (i = f->slice_count - 1; i >= 0; i--) { FFV1Context *fs = f->slice_context[i]; int j; if (fs->slice_damaged && f->last_picture.data[0]) { const uint8_t *src[4]; uint8_t *dst[4]; for (j = 0; j < 4; j++) { int sh = (j==1 || j==2) ? f->chroma_h_shift : 0; int sv = (j==1 || j==2) ? f->chroma_v_shift : 0; dst[j] = p->data[j] + p->linesize[j]* (fs->slice_y>>sv) + (fs->slice_x>>sh); src[j] = f->last_picture.data[j] + f->last_picture.linesize[j]* (fs->slice_y>>sv) + (fs->slice_x>>sh); } av_image_copy(dst, p->linesize, (const uint8_t **)src, f->last_picture.linesize, avctx->pix_fmt, fs->slice_width, fs->slice_height); } } f->picture_number++; av_frame_unref(&f->last_picture); if ((ret = av_frame_ref(&f->last_picture, p)) < 0) return ret; f->cur = NULL; *got_frame = 1; return buf_size; } AVCodec ff_ffv1_decoder = { .name = "ffv1", .type = AVMEDIA_TYPE_VIDEO, .id = AV_CODEC_ID_FFV1, .priv_data_size = sizeof(FFV1Context), .init = decode_init, .close = ffv1_close, .decode = decode_frame, .capabilities = CODEC_CAP_DR1 /*| CODEC_CAP_DRAW_HORIZ_BAND*/ | CODEC_CAP_SLICE_THREADS, .long_name = NULL_IF_CONFIG_SMALL("FFmpeg video codec #1"), };
|
{
"url": "https://git.ffmpeg.org/gitweb/ffmpeg.git/blob_plain/aa96439fae67d8cefa2376d60f9a0e29b234ceaa:/libavcodec/ffv1dec.c",
"source_domain": "git.ffmpeg.org",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "30333",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SQ2SQ23YJDEWAX46ILYNVRD76POVKCDF",
"WARC-Concurrent-To": "<urn:uuid:75f48dc4-c8a7-4c01-810c-48df2639f104>",
"WARC-Date": "2021-05-08T23:03:07Z",
"WARC-IP-Address": "79.124.17.100",
"WARC-Identified-Payload-Type": "text/x-csrc",
"WARC-Payload-Digest": "sha1:2BMU4LVCLNO5OHPKK3PDNDJXIB4ZRZW2",
"WARC-Record-ID": "<urn:uuid:b55b404a-565e-4eee-ad49-1295f826d877>",
"WARC-Target-URI": "https://git.ffmpeg.org/gitweb/ffmpeg.git/blob_plain/aa96439fae67d8cefa2376d60f9a0e29b234ceaa:/libavcodec/ffv1dec.c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4cf1067e-3655-4e20-9026-c4c2cdd4e19b>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-211.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
22956
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 22956,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.010106289759278297,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1588486135005951,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02238805964589119,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5660980939865112,
"rps_doc_frac_unique_words": 0.26885536313056946,
"rps_doc_mean_word_length": 6.416592597961426,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0.0025891000404953957,
"rps_doc_unigram_entropy": 5.463850498199463,
"rps_doc_word_count": 2254,
"rps_doc_frac_chars_dupe_10grams": 0.13351309299468994,
"rps_doc_frac_chars_dupe_5grams": 0.2615639865398407,
"rps_doc_frac_chars_dupe_6grams": 0.2423425316810608,
"rps_doc_frac_chars_dupe_7grams": 0.21828113496303558,
"rps_doc_frac_chars_dupe_8grams": 0.16421212255954742,
"rps_doc_frac_chars_dupe_9grams": 0.1422249972820282,
"rps_doc_frac_chars_top_2gram": 0.03526239097118378,
"rps_doc_frac_chars_top_3gram": 0.03540068119764328,
"rps_doc_frac_chars_top_4gram": 0.012445550411939621,
"rps_doc_books_importance": -3898.140625,
"rps_doc_books_importance_length_correction": -3898.140625,
"rps_doc_openwebtext_importance": -1944.7799072265625,
"rps_doc_openwebtext_importance_length_correction": -1944.7799072265625,
"rps_doc_wikipedia_importance": -2670.622802734375,
"rps_doc_wikipedia_importance_length_correction": -2670.622802734375
},
"fasttext": {
"dclm": 0.9993244409561157,
"english": 0.2947579622268677,
"fineweb_edu_approx": 3.053191900253296,
"eai_general_math": 0.9200237393379211,
"eai_open_web_math": 0.35395896434783936,
"eai_web_code": 0.8798791170120239
}
}
|
{
"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.3922",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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,369,425,487,769,469,000 |
Adding a partition in Kafka
The impact is pretty clear. Below we load ten events using a given key. We add a partition, then load ten more events. Notice the partition differs after adding a partition, even though the key is the same.
<code>Steve-Howards-MBP13:confluent-5.1.2 steve.howard$ for i in {1..10}; do java ProducerDemo 2>/dev/null | grep Partition; done | sort | uniq -c
10 Partition:1
Steve-Howards-MBP13:bin steve.howard$ ./kafka-topics --zookeeper localhost:2181 --topic bar --alter --partitions 4
WARNING: If partitions are increased for a topic that has a key, the partition logic or ordering of the messages will be affected
Adding partitions succeeded!
Steve-Howards-MBP13:confluent-5.1.2 steve.howard$ for i in {1..10}; do java ProducerDemo 2>/dev/null | grep Partition; done | sort | uniq -c
10 Partition:0
Steve-Howards-MBP13:confluent-5.1.2 steve.howard$ </code>
|
{
"url": "http://appcrawler.com/wordpress/2019/03/26/adding-a-partition-in-kafka/?utm_source=rss&utm_medium=rss&utm_campaign=adding-a-partition-in-kafka",
"source_domain": "appcrawler.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "33057",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RYJMWJYRD3M7PJIFD2SLFZXBBFEFXI2V",
"WARC-Concurrent-To": "<urn:uuid:dea2b8c1-54b2-4359-8e3d-34cb41f213dc>",
"WARC-Date": "2020-04-07T11:02:42Z",
"WARC-IP-Address": "104.18.62.66",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:U5U777ASN3VI6GI75UEDNUS26TU5BQHW",
"WARC-Record-ID": "<urn:uuid:a97b7148-9de4-45f7-a1d8-fc123f63571a>",
"WARC-Target-URI": "http://appcrawler.com/wordpress/2019/03/26/adding-a-partition-in-kafka/?utm_source=rss&utm_medium=rss&utm_campaign=adding-a-partition-in-kafka",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ebd23fc0-e97b-465f-baf0-a3d71603902f>"
},
"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-193.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,
28,
29,
236,
237,
384,
401,
516,
646,
675,
816,
833
],
"line_end_idx": [
28,
29,
236,
237,
384,
401,
516,
646,
675,
816,
833,
890
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 890,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0.004494380205869675,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19111110270023346,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02222222089767456,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.40888887643814087,
"rps_doc_frac_unique_words": 0.5932203531265259,
"rps_doc_mean_word_length": 5.745762825012207,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.063172340393066,
"rps_doc_word_count": 118,
"rps_doc_frac_chars_dupe_10grams": 0.2182890921831131,
"rps_doc_frac_chars_dupe_5grams": 0.2182890921831131,
"rps_doc_frac_chars_dupe_6grams": 0.2182890921831131,
"rps_doc_frac_chars_dupe_7grams": 0.2182890921831131,
"rps_doc_frac_chars_dupe_8grams": 0.2182890921831131,
"rps_doc_frac_chars_dupe_9grams": 0.2182890921831131,
"rps_doc_frac_chars_top_2gram": 0.044247791171073914,
"rps_doc_frac_chars_top_3gram": 0.04719763994216919,
"rps_doc_frac_chars_top_4gram": 0.050147488713264465,
"rps_doc_books_importance": -115.28551483154297,
"rps_doc_books_importance_length_correction": -115.28551483154297,
"rps_doc_openwebtext_importance": -69.20062255859375,
"rps_doc_openwebtext_importance_length_correction": -61.024837493896484,
"rps_doc_wikipedia_importance": -41.79985046386719,
"rps_doc_wikipedia_importance_length_correction": -41.79985046386719
},
"fasttext": {
"dclm": 0.48354291915893555,
"english": 0.6196678280830383,
"fineweb_edu_approx": 1.6228419542312622,
"eai_general_math": 0.7734445929527283,
"eai_open_web_math": 0.21772223711013794,
"eai_web_code": 0.8731246590614319
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-422,605,292,818,024,100 |
What Could be the Proposed Time for a Picture Capture in Buy to Be Effective and Productive?
How exactly to Efficiently Use Android Industry APK Documents and Prevent Phone Malware
This is good information for Android software designers as it enables them to supply applications on a broader array of the company’s hardware. This new modify is certainly one of Google’s key initiatives to handle the problems that have been experienced with fragmentation. Multiple versions of exactly the same app may now be combined into one Android Industry listing. The previous concept just permitted for one APK per product listing. The advantage to posting numerous designs of an APK are that every edition can address an alternative niche of your customers. Different versions share the same deal title, but contain code that targets different types on the Android system, numerous monitor sizes and GL texture-compression formats. The proper APK is delivered to the consumer, on the basis of the signatures and characteristics of the customers device.
Preliminary studies with this new market device recognition appeared last month on the internet version of Google’s Android Market. Customers only go to the net visitor and sign in, then choose the app they desire to install. This method then checks the compatibility of the selected software and the equipment that’s given in the controls of the user. Approved programs will likely then get a natural information that happymod download “this software is compatible together with your device” or a yellow meaning that claims “this app is incompatible together with your device.”
Today Android app developers can have the capacity of providing bonus types which are suitable and within exactly the same offering, rather than filling up the marketplace with numerous entries that end up complicated the user. Multiple APK help will give the developer more alternatives for preventing their app distribution. Most significant, a builder can create a different APK for smartphones and tablets under that same listing. Taking advantage of new API’s or equipment functions without drastically effecting your client base should be considered as a significant gain to offering the Android Industry a apply for app developers.
There has not been a date collection for the release of the new-look Android Market software, but published types have already been collection up on the web for get and installation. Google did announce programs to unveil a completely new Android Market app which allows for customers to get books or rent movies from their pills, smartphones and devices. Android Industry moved via a new change that’s embodies more of a Windows Phone 7 “Metro UI” look, as opposed to the previous Natural and Bright motif.
Ingen kommentarer endnu
Der er endnu ingen kommentarer til indlægget. Hvis du synes indlægget er interessant, så vær den første til at kommentere på indlægget.
Skriv et svar
Skriv et svar
Din e-mailadresse vil ikke blive publiceret. Krævede felter er markeret med *
Næste indlæg
What Could be the Proposed Time for a Picture Capture in Buy to Be Effective and Productive?
|
{
"url": "https://nihekar909.bloggersdelight.dk/2022/01/23/how-exactly-to-efficiently-use-android-industry-apk-documents-and-prevent-phone-malware/",
"source_domain": "nihekar909.bloggersdelight.dk",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "39455",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SYXK57SKIDDF7LXQA4ET6DNKX3MR57EW",
"WARC-Concurrent-To": "<urn:uuid:fa39a75b-5564-435d-bf8f-c149291e56eb>",
"WARC-Date": "2022-09-28T12:11:17Z",
"WARC-IP-Address": "49.12.130.165",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2RJY335HPHWNXJNEQ5MELYETBA7SNZGZ",
"WARC-Record-ID": "<urn:uuid:d62017b2-9a93-480c-b6b1-6a6cd6eb24e5>",
"WARC-Target-URI": "https://nihekar909.bloggersdelight.dk/2022/01/23/how-exactly-to-efficiently-use-android-industry-apk-documents-and-prevent-phone-malware/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:93be4043-7f9b-4771-8277-186ea52f3bc2>"
},
"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-28\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
93,
94,
182,
183,
1046,
1047,
1627,
1628,
2267,
2268,
2776,
2777,
2801,
2802,
2938,
2939,
2953,
2954,
2968,
2969,
3047,
3048,
3050,
3051,
3064,
3065
],
"line_end_idx": [
93,
94,
182,
183,
1046,
1047,
1627,
1628,
2267,
2268,
2776,
2777,
2801,
2802,
2938,
2939,
2953,
2954,
2968,
2969,
3047,
3048,
3050,
3051,
3064,
3065,
3157
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3157,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4107142984867096,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01607142947614193,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.08749999850988388,
"rps_doc_frac_unique_words": 0.5328031778335571,
"rps_doc_mean_word_length": 5.174950122833252,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.168037414550781,
"rps_doc_word_count": 503,
"rps_doc_frac_chars_dupe_10grams": 0.057625818997621536,
"rps_doc_frac_chars_dupe_5grams": 0.057625818997621536,
"rps_doc_frac_chars_dupe_6grams": 0.057625818997621536,
"rps_doc_frac_chars_dupe_7grams": 0.057625818997621536,
"rps_doc_frac_chars_dupe_8grams": 0.057625818997621536,
"rps_doc_frac_chars_dupe_9grams": 0.057625818997621536,
"rps_doc_frac_chars_top_2gram": 0.011525159701704979,
"rps_doc_frac_chars_top_3gram": 0.008451789617538452,
"rps_doc_frac_chars_top_4gram": 0.010756820440292358,
"rps_doc_books_importance": -265.2148742675781,
"rps_doc_books_importance_length_correction": -265.2148742675781,
"rps_doc_openwebtext_importance": -174.49642944335938,
"rps_doc_openwebtext_importance_length_correction": -174.49642944335938,
"rps_doc_wikipedia_importance": -99.87836456298828,
"rps_doc_wikipedia_importance_length_correction": -99.87836456298828
},
"fasttext": {
"dclm": 0.01947277970612049,
"english": 0.8501655459403992,
"fineweb_edu_approx": 1.1499091386795044,
"eai_general_math": 0.013307330198585987,
"eai_open_web_math": 0.09735984355211258,
"eai_web_code": 0.10522335767745972
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,681,332,762,546,439,000 |
Excel How To Do List YouTube
Excel How To Do List YouTube from www.youtube.com
In 2023, creating a to do list in Excel is easier than ever. We are now able to perform complex calculations and organize our data in an efficient manner. Excel is a powerful spreadsheet program that can help us organize our data and keep track of our tasks. In this article, we will show you how to create a to do list in Excel. We will also provide some examples of how to create a to do list in Excel.
Benefits of Creating a To Do List in Excel
Creating a to do list in Excel has many benefits. First, it allows us to keep track of our tasks in a visual way. We can easily see what tasks we need to complete and what tasks we have already completed. Second, Excel allows us to perform calculations and organize our data in an efficient manner. Third, it gives us the ability to customize our lists according to our needs. Lastly, we can easily create charts and graphs to visualize our data.
Steps to Create a To Do List in Excel
Creating a to do list in Excel is easy. The first step is to open a new spreadsheet in Excel. Next, we need to create the columns that will contain our tasks. We can create a column for task name, task description, due date, and status. Once we have created the columns, we can start entering our tasks. We can enter our tasks into the columns and then assign a due date and status to each task. We can also use formulas to automatically create a status for each task based on its due date.
Examples of To Do List in Excel
Here are some examples of how to create a to do list in Excel. First, we can use a drop-down list to assign a status to each task. We can create a drop-down list with the options “Not Started”, “In Progress”, “Completed”. We can then select the appropriate status for each task. Second, we can create a chart to visualize our tasks. We can create a chart with columns for task name, due date, and status. This will help us to easily see which tasks we need to complete and which tasks we have already completed.
Conclusion
Creating a to do list in Excel is a great way to keep track of our tasks and organize our data. Excel is a powerful spreadsheet program that allows us to perform calculations, customize our lists, and create charts and graphs. We can create a to do list in Excel by creating the columns for task name, task description, due date, and status. We can also use formulas and drop-down lists to assign a status to each task. Finally, we can create charts to visualize our data.
Tags
#create to do list excel #excel #todo list #spreadsheet #calculations #drop down list #visualize data #task list #task name #task description #due date #status #charts #graphs
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://www.indotemplate123.com/create-to-do-list-excel-2/",
"source_domain": "www.indotemplate123.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "80097",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O5OABG5YZCUIJVE6QJPUXI2XY3U57CQZ",
"WARC-Concurrent-To": "<urn:uuid:efc88278-62a2-4353-b619-9ffb4be4f2d4>",
"WARC-Date": "2023-09-25T19:19:37Z",
"WARC-IP-Address": "184.154.46.217",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5DMY5OVQ7G4S3C7XRJIPHOK6T5HBDYU6",
"WARC-Record-ID": "<urn:uuid:5a38b2b5-2827-41d3-a7af-6bcd9c180c26>",
"WARC-Target-URI": "https://www.indotemplate123.com/create-to-do-list-excel-2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:214b7e21-a67e-4414-83a4-7195ce5b837e>"
},
"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-105\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,
29,
79,
80,
485,
486,
529,
530,
977,
978,
1016,
1017,
1508,
1509,
1541,
1542,
2054,
2055,
2066,
2067,
2540,
2541,
2546,
2547,
2723,
2724,
2738,
2739
],
"line_end_idx": [
29,
79,
80,
485,
486,
529,
530,
977,
978,
1016,
1017,
1508,
1509,
1541,
1542,
2054,
2055,
2066,
2067,
2540,
2541,
2546,
2547,
2723,
2724,
2738,
2739,
2809
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2809,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4344941973686218,
"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.12935322523117065,
"rps_doc_frac_unique_words": 0.274472177028656,
"rps_doc_mean_word_length": 4.2245683670043945,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.023217249661684036,
"rps_doc_unigram_entropy": 4.332676410675049,
"rps_doc_word_count": 521,
"rps_doc_frac_chars_dupe_10grams": 0.07360290735960007,
"rps_doc_frac_chars_dupe_5grams": 0.461608350276947,
"rps_doc_frac_chars_dupe_6grams": 0.3834620714187622,
"rps_doc_frac_chars_dupe_7grams": 0.26760563254356384,
"rps_doc_frac_chars_dupe_8grams": 0.19672876596450806,
"rps_doc_frac_chars_dupe_9grams": 0.1685597449541092,
"rps_doc_frac_chars_top_2gram": 0.025442980229854584,
"rps_doc_frac_chars_top_3gram": 0.05088596045970917,
"rps_doc_frac_chars_top_4gram": 0.04997728019952774,
"rps_doc_books_importance": -357.7856140136719,
"rps_doc_books_importance_length_correction": -357.7856140136719,
"rps_doc_openwebtext_importance": -193.35560607910156,
"rps_doc_openwebtext_importance_length_correction": -193.35560607910156,
"rps_doc_wikipedia_importance": -169.3030548095703,
"rps_doc_wikipedia_importance_length_correction": -169.3030548095703
},
"fasttext": {
"dclm": 0.7877695560455322,
"english": 0.8919808268547058,
"fineweb_edu_approx": 2.895155668258667,
"eai_general_math": 0.02430903911590576,
"eai_open_web_math": 0.09341902285814285,
"eai_web_code": 0.07568187266588211
}
}
|
{
"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": "658.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,166,784,671,722,368,500 |
How to read Unicode files in Visual C++ Multibyte Application
An MFC application using Multibyte Character Set cannot read Chinese (PRC) Unicode files created by C# .NET.
It can read legacy files which do not have BOM and are MBCS. The Unicode file begins with BOM FF FE. "Male" is stored as 37 75 in the Unicode file but loads as 0xe7 'ç' 0x94 '”' 0xb7 '·'
The Multibyte file stores "Male" as C4 'Ä' D0 0xd0 'Ð'.
What's the best way to read the Unicode files if the application is MFC Visual C++ using MBCS?
1. Convert the unicode string to MBCS when writing the file in C#?
2. Modify the C++ app to correctly read the Unicode files?
3. Create another C++ app in Unicode to read and convert these files?
I have tried in Visual C++ ismbblead, setLocale, CFile, fopen, _open, and C# FileStream. No matter what I try, I can never get the hex bytes as they are stored inside the file. I always get the bytes encoded. If the file format doesn't match the app format, I'm stuck. This is my current code in the multibyte C++ app:
CString pathName = fileDlg.GetPathName();
//char *pLocale = setlocale(LC_CTYPE, "zh-hk"); //has no effect on encoding
//_setmbcp(_MB_CP_LOCALE); //has no effect on encoding
FILE *fh = fopen(pathName, "rb");
const int MAX_COUNT = 100;
char buffer[MAX_COUNT];
memset(buffer, 0, MAX_COUNT);
fgets(buffer, MAX_COUNT, fh); //Male
And this is code in C# .NET test app that reads Unicode but not MBCS
using (StreamReader sr = new StreamReader(vpdName))
{
int lineIndex = 0;
while (sr.Peek() >= 0)
{
string str = sr.ReadLine();
This is tough! I've worked on it for 3 days and spent lots of hours searching this forum and others for help on this problem. My goal is to be able to read the Unicode file and convert the Chinese strings so that they will display properly in a multibyte app. I think this means that I need to convert Unicode 0x75 37 to MBCS 0x C4 D0. Can this be done? But first I need to get that Unicode string! And the multibyte app always reads and encodes the Unicode file so that the strings are garbage--don't display properly and cannot be converted.
ForehandAsked:
Who is Participating?
ForehandAuthor Commented:
I am able to read Unicode files in C# .NET using StreamReader. If I specify the Encoding, I can read files created with the Chinese code page 936 (Chinese Simplified (GB2312).
Encoding mbcs = Encoding.GetEncoding(936); //encoding for China big5 950
string mbName = @"c:\imswin\data\china_mb.txt"; //multibyte character set 0XC4 D0
StreamReader srMbcs = new StreamReader(mbName, mbcs);
string str = srMbcs.ReadLine();
srMbcs.Close();
If I don't specify the encoding, the files are read correctly when they were created with a Unicode format. In this case, the files had an ASCII? Unicode format so that \U7537 was written as 0Xe7 94 b7.
string ucName = @"c:\imswin\data\china_uc.txt"; //unicode
StreamReader sr = new StreamReader(ucName);
string unicodeString = sr.ReadLine(); //\U7537
sr.Close();
Currently it is almost impossible to detect encoding of the file without a BOM. Whenever I read the multibyte file, it always is read with UTF-8 encoding, even though this is the wrong encoding for this file. IsTextUnicode always returns true. Here are some other references that indicate how difficult it is.
Rick Strahl's web log http://www.codeproject.com/KB/recipes/DetectEncoding.aspx
StreamReader() specifically has an overload that's supposed to help with detection of byte order marks and based on that is supposed to sniff the document's encoding. It actually works but only if
the content is encoded as UTF-8/16/32 - ie. when it actually has a byte order mark.
It doesn't revert back to Encoding.Default if it can't find a byte order mark - the default
without a byte order mark is UTF-8 which usually will result in invalid text parsing.
Complex way to detect how file is encoded
http://www.codeproject.com/KB/recipes/DetectEncoding.aspx
My solution is to translate the Unicode strings to Multibyte character set strings before creating the file that will be read by the legacy multibyte app. That way, the file will always be in the correct format for reading multibyte character set.
Encoding unicode = new UnicodeEncoding(true, false); // Convert the string into a byte[].
byte[] unicodeBytes = unicode.GetBytes(unicodeString);
// Perform the conversion from one encoding to the other.
Encoding mbcs = Encoding.GetEncoding(936); //encoding for China big5 950
byte[] mbcsBytes = Encoding.Convert(unicode, mbcs, unicodeBytes);
0
evilrixSenior Software Engineer (Avast)Commented:
Before we go any further can we just get some terminology straight because Microsoft's terminology is pretty confusing.
What format is the file. You say Unicode, but that is not a format that is a character set. Is it UTF8, 16 or 32? I would guess UTF16 since this is what Microsoft generally call Unicode.
When you say your MFC app is Multibyte. What format is that? UTF8, ANSI (or even UTF16 because, contrary to what Microsoft would have you belief UTF16 is also a multibyte encoding format)?
Generally the simplest way to handle Unicode files for cross platform/application pollination is UTF8 because this is easy to handle on all platforms and the basic data types are alway char. If course if your C# app is creating UTF16 you are probably stuck with that so the best solution, in my view, would be to read the file as UTF16 and convert internally.
The tools for Unicode Character Encoding on Windows are pretty poor. I'd suggest you consider using ICU, which is a cross-platform Unicode handling framework from IBM. It's free and open source.
http://site.icu-project.org/
0
ForehandAuthor Commented:
Encoding of the Unicode file from the BOM FF FE it is UTF-16. But when I read it in C# it reads correctly and the FileStream.Encoding.EncodingName after "Male" is read is UTF8. Documentation states that all files will automatically be encoded correctly using the BOM, and this certainly seems to be true, providing the app was built with Unicode as the character set or built with C# .NET where the default is UTF-16.
How can I tell what the format is of the MFC Application? I look in properties and see only 2 relevant properites. One is "Using Multibyte Character Set." The other is in the pre processor C++ properties and is "MBCS." So the application is not Unicode. I would probably guess that the files are read with ANSI encoding.
I am now working on this solution: Create a small consule app in Unicode Visual C++ which can read the file. Then try to convert it to Chinese using WideCharToMultibyte. I wish that I could make conversions without going through a separate application. However, I don't know how to write a multibyte file using Unicode strings in C#. Also I have only garbage when I read a Unicode file in a Visual C++ Application built with MBCS.
0
Ultimate Tool Kit for Technology Solution Provider
Broken down into practical pointers and step-by-step instructions, the IT Service Excellence Tool Kit delivers expert advice for technology solution providers. Get your free copy now.
evilrixSenior Software Engineer (Avast)Commented:
That BOM suggests it's UTF16 Little Endian.
>> So the application is not Unicode.
That doesn't mean anything other than it will use wide and not narrow char types - this is why I really hate the fact Microsoft call it Unicode. It's not. There are three things that come into play when dealing with text:
1. The data type - wide (wchar_t) or narrow (char). When UNICODE and UNICODE_ is defined the natural char type is wide and wide versions of C and API functions are called. These expect UTF16 encoding. When MBSC is defined the natural char type is narrow.
2. The character encoding. This could be ANSI (think code pages), UTF8 or UTF16 (or other, but we'll consider these just for simplicity). UTF16 is the standard for UNICODE and ANSI is the standard for MBCS
3. The character set. Unicode is a 32 bit character set, UTFx is a way of encoding these 32 bit into smaller data types, which could be wide or narrow.
So, you see, it matters not one little bit if your app is build with MBCS or UNICODE when it comes to reading a file. What matters is you know what the format is and you treat it accordingly. If it's UTF16 you can read that regardless of what type of app you've built. You just need to read it into wide (wchar_t) types and treat it as UTF16. If you want to handle it as UTF8 or ANSI you will need to re-encode it. You can do that using ICU or there are some API functions provided by Windows.
http://en.wikipedia.org/wiki/Character_encoding
0
ForehandAuthor Commented:
OK. I'm going to try opening the Unicode file with a wide character version of fopen. But I don't know ahead of time whether the file is Unicode format or ANSI format. I thought I could read the first byte (ha!). The BOM never gets returned when I open the file and read it. Do you know if there is a way to determine how the file is encoded? My MBCS app has to be able to read both Unicode and Multibyte (ANSI) files.
0
evilrixSenior Software Engineer (Avast)Commented:
>> But I don't know ahead of time whether the file is Unicode format or ANSI format.
That's what the BOM is there for - to help you figure this out. You should open the file and read it as a series of bytes. Process the BOM and then tread that series of bytes either as a series of chars or a series of wchar_t.
But, I say again - look at using ICU as it will take care of all of this for you... and it's really simple to use.
>> My MBCS app has to be able to read both Unicode and Multibyte (ANSI) files.
As I said above, it can. Forget it's a MBCS app... it's not relevant and is just confusing you. Think only about the file. It's a Unicode file, with a BOM. You need to open it and handle it in this way - the fact your app is MBCS doesn't change or even hinder that.
0
ForehandAuthor Commented:
I have tried every method of opening this file: fopen, CFile, _open, Windows CreateFile. No matter what I try, I never get the BOM. I only get garbage encoding. Both of my test apps were created with Visual Studio defaults. I would love to be able to read the BOM!! I thought fopen(filename, "rb") would read the file as a series of bytes. Nope! It uses the BOM to encode the file according to your locale and code page (I guess). But even if I change the locale it doesn't matter. I NEVER GET THE BOM!
I am going to try now to read the file using your suggestion to use unicode functions. I hesitate to use site.icu because I work for a corporation that doesn't like programmers to use 3rd party tools without permission. I will give you partial credit if your advice succeeds. I would also like to mark your suggestions as helpful, but I don't know if that will close my question, and I haven't solved the problem yet.
0
evilrixSenior Software Engineer (Avast)Commented:
0
evilrixSenior Software Engineer (Avast)Commented:
>> I have tried every method of opening this file
You should just be opening it as a binary file.
fstream in("myfile.txt", std::ios::binary);
or
fopen("myfile.txt", "rb");
0
evilrixSenior Software Engineer (Avast)Commented:
>> I will give you partial credit if your advice succeeds.
There is no rush to close this -- I'm not in it for the points, so take your time. We'll work it out together and get to a point (I hope) where you understand what is going on.
0
evilrixSenior Software Engineer (Avast)Commented:
A very quick and dirty example of reading the file. Your BOM will be the first 2 bytes in intext.
#include <iostream>
#include <fstream>
#include <iomanip>
wchar_t const outtext[] = L"hello world";
char const BOM[] = { 0xFF, 0xFE };
size_t const insize = sizeof(outtext) + sizeof(BOM);
int main()
{
std::ofstream out("c:/temp/myfile.txt", std::ios::binary);
out.write(BOM, sizeof(BOM));
out.write((char *)outtext, sizeof(outtext));
out.close();
wchar_t intext[insize];
std::ifstream in("c:/temp/myfile.txt", std::ios::binary);
in.read((char *)intext, insize);
in.close();
std::cout.write((char *)intext, insize); // wide stream
std::cout << "\n";
char * ptext = (char *)intext;
for(size_t i = 0 ; i < insize ; ++i)
{
std::cout << std::hex << (0xFF & (int)ptext[i]);
}
}
Open in new window
0
ForehandAuthor Commented:
Results of fread:
FILE *fh = fopen(pathName, "rb");
const int MAX_COUNT = 100;
char buffer[MAX_COUNT];
memset(buffer, 0, MAX_COUNT);
fread(buffer, 1, 1, fh); <-- buffer[0] contains an asterisk
The first line of the Unicode file begins with
FF FE 2A 00 42 00
FF FE is the BOM. After that comes the string, "*BEGINDATA*". As you see, fread, even with "rb" skips the BOM. Also, I can't override the encoding with the ccs option. If I try ANSI, the program crashes because you aren't allowed to have ANSI if the BOM is FF FE.
Next I tried fstream. In this case, I seem to always get 0xcc or 204 no matter what.
CString pathName = fileDlg.GetPathName();
fstream in(pathName, std::ios::binary);
byte by;
in.read((char *)&by, 1);
in.read((char *)&by, 1);
in.read((char *)&by, 1);
in.close();
0
ForehandAuthor Commented:
Maybe I have to try a different app type. My test app is built using the default for MFC app in Visual Studio 2005. I will try your example later this weekend or Monday. Thanks a lot.
0
evilrixSenior Software Engineer (Avast)Commented:
Your fread is wrong. Look at what you wrote
fread(buffer, 1, 1, fh);
This will read in 1 byte only.
The spec for fread is as follows.
size_t fread ( void * ptr, size_t size, size_t count, FILE * stream );
http://www.cplusplus.com/reference/clibrary/cstdio/fread/
Your code should be either
fread(buffer, sizeof(buffer), 1, fh);
or
fread(buffer, 1, sizeof(buffer), fh);
Try the code I posted above, it works -- I know, I tested it :)
>> Maybe I have to try a different app type.
Please trust me... it is nothing to do with the app type... forget about this as you are just confusing yourself. Nothing, I repeat nothing about the app type is going to prevent you reading the file as a series of bytes that you can then treat as UTF16.
0
evilrixSenior Software Engineer (Avast)Commented:
>> In this case, I seem to always get 0xcc
This is the default value assigned by the debugger to an uninitialised char -- your file stream is NOT being opened successfully. In other words, the reason it's failing is because you are not reading anything.
0
ForehandAuthor Commented:
I have copied your code into my project. I'm still getting 0xcc for intext. You have been incredibly patient. About reading 1 byte-I thought why should I read more? If the first byte is 0xFF, then I have a Unicode file. It seems as though the failure to read is based on something else besides the size of the variable. I feel as though your help has brought me so close to a solution! And yet somehow the
read is not working! insize is 26 which is not quite correct. The size should be 24. Because outtext is 11 chars * 2 = 22. 0xFF, 0xFE is probably counted as 4 bytes but should be counted as 2 bytes.
CString pathName = fileDlg.GetPathName();
fstream in(pathName, std::ios::binary);
wchar_t const outtext[] = L"*BEGINDATA*";
char const BOM[] = { 0xFF, 0xFE };
size_t const insize = sizeof(outtext) + sizeof(BOM);
wchar_t intext[insize];
char * ptext = (char *)intext;
in.read((char *)intext, insize);
in.close();
0
evilrixSenior Software Engineer (Avast)Commented:
>> I have copied your code into my project. I'm still getting 0xcc for intext
Verbatim? I tested it with VS2008 and it does exactly what I would expect. You should see it output "hello world" followed by another line with the hex that represents the wide chars.
>> If the first byte is 0xFF, then I have a Unicode file.
Maybe... but not necessarily.
>> And yet somehow the read is not working!
It would seem so... try putting in some additional code to check the file is open and also that the stream has not gone into an error state.
>> insize is 26 which is not quite correct.
Sure it is... don't forget there is a null at the end of L"hello world"
0
ForehandAuthor Commented:
OK I had used fstream instead of ifstream. When I corrected this call, I got the correct text but still no BOM. ptext (defined as char*) contains
0x0012f1d4 "*BEGINDATA*"All RespondeÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌÌ"
intext defined as wchar contains garbage Chinese characters. The first character is
0x422a L'¿'
I also tried this in a Unicode app. You are right there is no difference.
I looked at your file "mytext.txt" in a hex editor. The first 3 bytes were FF FE 68 00 65 00
Your file reads great. The first byte of infile is 0xFFFE as expected.
My file in the hex editor is FF FE 42 00 62 00
My file reads like garbage in my apps. I am very puzzled.
0
evilrixSenior Software Engineer (Avast)Commented:
>> When I corrected this call, I got the correct text but still no BOM.
How are you reaching this conclusion? When I step through the debugger the two bytes are clearly there. You are just reading a binary file. As long as you have opened it as a binary file C++ makes absolutely no translations on any of the content read. I can only assume you are not correctly opening the file -- do you check this?
>> I also tried this in a Unicode app. You are right there is no difference.
Ta daah :)
>> My file reads like garbage in my apps. I am very puzzled.
Ok, please attach your file and your code (full, so I can compile it and test it).
0
ForehandAuthor Commented:
The hex dump of my file was inaccurate! I was relying on a text processor, UltraEdit, to display files in hex. The file that I was reading, chinacd.vpd, DOES NOT HAVE A BOM. It displays properly if I open it binary mode in Visual Studio V6.0. I guess UltraEdit somehow detected that this file needed translation into Chinese, translated it, and then displayed the results of the translation in hex instead of the actual bytes of the file. chinacd.txt I wish I could do that translation.
I still have a problem, but it is not the problem I thought it was. I thought that my source code was reading the file improperly. Instead, the source code was reading correctly. It was the hex dump from UltraEdit that was incorrect.
I attach the file and source code as you requested, but the source code works. It reads my file as a Unicode file and reverses each 2 character byte, which results in garbage. This file is not a Unicode file so I shouldn't read it as Unicode, I guess. But now I'm puzzled. How can this file be distinguished from a multibyte character set file. I need to be able to read both files and display them properly. C# .NET can read the first one ok. C++ multibyte app using CFile and CArchive can read the second one ok. How can I know how to tell the difference between these files when they both start the same way? chinvp.txt
ChinaCD.txt can be translated correctly into Chinese characters by Excel, Outlook, UltraEdit, Notepad.
ChinVP.txt also seems to display "properly" by Notepad, etc. It looks funny with an English (United States) locale. But it displays Chinese characters fine with Hong Kong S.A.R locale. Do you think I can read both files in the same application? Will your classes that you recommended earlier do this job?
// UnicodeToMultibyte.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <iostream>
#include <fstream>
#include <iomanip>
wchar_t const outtext[] = L"*BEGINDATA*";
char const BOM[] = { 0xFF, 0xFE };
char const MALE[] = { 0x37, 0x75 };
size_t const insize = sizeof(outtext) + sizeof(BOM) + sizeof(MALE);
int _tmain(int argc, _TCHAR* argv[])
{
std::ofstream out("c:/temp/myfile2.txt", std::ios::binary);
out.write(BOM, sizeof(BOM));
out.write((char *)outtext, sizeof(outtext));
out.write(MALE, sizeof(MALE));
out.close();
wchar_t intext[300]; //big enough to hold all of chinacd.vpd
std::ifstream in("c:/temp/myfile2.txt", std::ios::binary);
in.read((char *)intext, insize);
in.close();
char * ptext = (char *)intext;
/* std::cout.write((char *)intext, insize); // wide stream
std::cout << "\n";
char * ptext = (char *)intext;
for(size_t i = 0 ; i < insize ; ++i)
{
std::cout << std::hex << (0xFF & (int)ptext[i]);
}
*/
std::ifstream chinaIn("c:/imswin/data/chinacd.vpd", std::ios::binary);
chinaIn.read((char *)intext, 296); //295 is sizeof chinacd.vpd
chinaIn.close();
return 0;
}
Open in new window
0
evilrixSenior Software Engineer (Avast)Commented:
>> How can this file be distinguished from a multibyte character set file.
I refer you back to this: http:#34125019
You have to figure it out by analysing the content. It is for this reason I strongly suggest you consider ICU. Trying to write a Unicode decoder is not a trivial task -- this is why ICU is used by so many big named companies.
http://site.icu-project.org/#TOC-Who-Uses-ICU-
Consider the various possible encodings you need to try and detect. Now consider that a BOM is completely optional... it might not even exist (as you've discovered). The only way to know how it's encoded is to parse it and figure it out.
I appreciate what you said about needing to get this cleared but the effort in trying to code a proper Unicode parser is going to be significant if you need to handle any possible combination. It's not so painful if you can assume it'll always be a specific format but from what you've said I don't think that is the case for you.
0
evilrixSenior Software Engineer (Avast)Commented:
Just to point out in case you had not realised, this started out as a C++ question (although I realise the files are created in C#) and I know almost nothing about C# so I'm afraid I cannot comment or provide you with any sensible suggestions in that area.
Also, I have no objection if you want to keep this question open whilst you still try and figure out what you are doing in the C++ side of things but as from now I will be offline for the next 5 days (it's my birthday and I'm going to party it up for a few days on a mini-holiday). I will post an alert to some other C++ experts to hopefully keep an eye on things here for you.
-Rx.
0
evilrixSenior Software Engineer (Avast)Commented:
Forehand,
Thank you for your kind words in your closing comment. The appreciation means more than any points (although those are nice too) :)
not-so-evilrix.
0
ForehandAuthor Commented:
Evilrix truly deserves his genius rating and in addition should get an Angel rating because he helped me so much. (But maybe that would cancel out Evil?) I spoke to a representative to give advice on how to grade. I wanted to give fewer points and an A grade because there is no complete solution in the sense that there is no easy way to get encoding from a file. Everything that Evilrx said was true, but didn't work for me because UltraEdit hex representation of my file didn't match the way it was actually stored. I decided it was easier to control the way the files were written which I CAN control rather than to spend the effort modifying an older app to be able to read and detect everything.
0
Question has a verified solution.
Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.
Have a better answer? Share it in a comment.
All Courses
From novice to tech pro — start learning today.
|
{
"url": "https://www.experts-exchange.com/questions/26611612/How-to-read-Unicode-files-in-Visual-C-Multibyte-Application.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "237809",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X4LZFR2554AVI5AQBCV4NXAQ3DFCSUZX",
"WARC-Concurrent-To": "<urn:uuid:a2e67a4d-6a88-405c-85ae-e5a50cf82570>",
"WARC-Date": "2018-06-21T22:51:21Z",
"WARC-IP-Address": "104.20.168.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FOF6WEY5WAR4XMH4WJXLY44P2VV54AS6",
"WARC-Record-ID": "<urn:uuid:5ff55f77-fd8c-450d-8abe-0e70e901b93a>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/26611612/How-to-read-Unicode-files-in-Visual-C-Multibyte-Application.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:76913de4-bada-481b-bcae-d8f4d244e7a5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-138-204-92.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
62,
63,
172,
362,
418,
513,
580,
639,
709,
1033,
1079,
1158,
1216,
1255,
1285,
1312,
1345,
1385,
1386,
1455,
1519,
1533,
1567,
1605,
1622,
1672,
1673,
2223,
2238,
2260,
2262,
2288,
2465,
2547,
2638,
2700,
2741,
2766,
2970,
3038,
3090,
3146,
3175,
3488,
3489,
3569,
3766,
3851,
3944,
4031,
4033,
4075,
4134,
4135,
4384,
4490,
4553,
4620,
4701,
4776,
4778,
4780,
4830,
4950,
4951,
5138,
5139,
5328,
5329,
5689,
5690,
5885,
5886,
5915,
5917,
5919,
5945,
6365,
6691,
7127,
7129,
7180,
7181,
7365,
7366,
7368,
7418,
7462,
7463,
7501,
7502,
7724,
7725,
7980,
7981,
8187,
8188,
8340,
8341,
8835,
8836,
8884,
8886,
8888,
8914,
9339,
9341,
9343,
9393,
9479,
9480,
9707,
9708,
9823,
9824,
9903,
9904,
10170,
10172,
10174,
10200,
10712,
11133,
11135,
11137,
11187,
11189,
11191,
11241,
11291,
11339,
11340,
11384,
11385,
11388,
11389,
11416,
11418,
11420,
11470,
11530,
11531,
11708,
11710,
11712,
11762,
11860,
11880,
11899,
11918,
11919,
11961,
11996,
12049,
12050,
12061,
12063,
12125,
12157,
12205,
12221,
12222,
12249,
12250,
12311,
12347,
12362,
12363,
12422,
12444,
12445,
12479,
12519,
12524,
12579,
12584,
12586,
12587,
12606,
12607,
12609,
12611,
12637,
12655,
12691,
12719,
12744,
12775,
12836,
12883,
12901,
13169,
13170,
13256,
13301,
13344,
13356,
13384,
13412,
13440,
13455,
13457,
13459,
13485,
13672,
13674,
13676,
13726,
13770,
13771,
13796,
13797,
13828,
13829,
13863,
13934,
13992,
13993,
14020,
14021,
14059,
14060,
14063,
14064,
14102,
14103,
14167,
14168,
14169,
14214,
14215,
14470,
14472,
14474,
14524,
14567,
14568,
14779,
14781,
14783,
14809,
15223,
15426,
15427,
15471,
15514,
15559,
15597,
15653,
15680,
15714,
15750,
15765,
15767,
15769,
15819,
15898,
15899,
16083,
16084,
16143,
16144,
16174,
16175,
16219,
16220,
16361,
16362,
16407,
16408,
16480,
16482,
16484,
16510,
16658,
16727,
16812,
16824,
16899,
16993,
17065,
17112,
17171,
17173,
17175,
17225,
17297,
17298,
17629,
17630,
17708,
17709,
17720,
17721,
17783,
17784,
17867,
17869,
17871,
17897,
18391,
18628,
19261,
19364,
19675,
19756,
19759,
19760,
19780,
19800,
19819,
19838,
19845,
19889,
19926,
19964,
20034,
20035,
20072,
20074,
20137,
20172,
20220,
20254,
20270,
20271,
20336,
20337,
20399,
20435,
20450,
20484,
20545,
20567,
20601,
20641,
20646,
20701,
20706,
20709,
20783,
20852,
20872,
20876,
20889,
20891,
20892,
20911,
20912,
20914,
20916,
20966,
21041,
21042,
21083,
21084,
21310,
21311,
21358,
21359,
21597,
21598,
21929,
21931,
21933,
21983,
22240,
22241,
22619,
22620,
22625,
22627,
22629,
22679,
22689,
22690,
22822,
22823,
22839,
22841,
22843,
22869,
23576,
23578,
23612,
23613,
23714,
23715,
23760,
23761,
23773,
23774
],
"line_end_idx": [
62,
63,
172,
362,
418,
513,
580,
639,
709,
1033,
1079,
1158,
1216,
1255,
1285,
1312,
1345,
1385,
1386,
1455,
1519,
1533,
1567,
1605,
1622,
1672,
1673,
2223,
2238,
2260,
2262,
2288,
2465,
2547,
2638,
2700,
2741,
2766,
2970,
3038,
3090,
3146,
3175,
3488,
3489,
3569,
3766,
3851,
3944,
4031,
4033,
4075,
4134,
4135,
4384,
4490,
4553,
4620,
4701,
4776,
4778,
4780,
4830,
4950,
4951,
5138,
5139,
5328,
5329,
5689,
5690,
5885,
5886,
5915,
5917,
5919,
5945,
6365,
6691,
7127,
7129,
7180,
7181,
7365,
7366,
7368,
7418,
7462,
7463,
7501,
7502,
7724,
7725,
7980,
7981,
8187,
8188,
8340,
8341,
8835,
8836,
8884,
8886,
8888,
8914,
9339,
9341,
9343,
9393,
9479,
9480,
9707,
9708,
9823,
9824,
9903,
9904,
10170,
10172,
10174,
10200,
10712,
11133,
11135,
11137,
11187,
11189,
11191,
11241,
11291,
11339,
11340,
11384,
11385,
11388,
11389,
11416,
11418,
11420,
11470,
11530,
11531,
11708,
11710,
11712,
11762,
11860,
11880,
11899,
11918,
11919,
11961,
11996,
12049,
12050,
12061,
12063,
12125,
12157,
12205,
12221,
12222,
12249,
12250,
12311,
12347,
12362,
12363,
12422,
12444,
12445,
12479,
12519,
12524,
12579,
12584,
12586,
12587,
12606,
12607,
12609,
12611,
12637,
12655,
12691,
12719,
12744,
12775,
12836,
12883,
12901,
13169,
13170,
13256,
13301,
13344,
13356,
13384,
13412,
13440,
13455,
13457,
13459,
13485,
13672,
13674,
13676,
13726,
13770,
13771,
13796,
13797,
13828,
13829,
13863,
13934,
13992,
13993,
14020,
14021,
14059,
14060,
14063,
14064,
14102,
14103,
14167,
14168,
14169,
14214,
14215,
14470,
14472,
14474,
14524,
14567,
14568,
14779,
14781,
14783,
14809,
15223,
15426,
15427,
15471,
15514,
15559,
15597,
15653,
15680,
15714,
15750,
15765,
15767,
15769,
15819,
15898,
15899,
16083,
16084,
16143,
16144,
16174,
16175,
16219,
16220,
16361,
16362,
16407,
16408,
16480,
16482,
16484,
16510,
16658,
16727,
16812,
16824,
16899,
16993,
17065,
17112,
17171,
17173,
17175,
17225,
17297,
17298,
17629,
17630,
17708,
17709,
17720,
17721,
17783,
17784,
17867,
17869,
17871,
17897,
18391,
18628,
19261,
19364,
19675,
19756,
19759,
19760,
19780,
19800,
19819,
19838,
19845,
19889,
19926,
19964,
20034,
20035,
20072,
20074,
20137,
20172,
20220,
20254,
20270,
20271,
20336,
20337,
20399,
20435,
20450,
20484,
20545,
20567,
20601,
20641,
20646,
20701,
20706,
20709,
20783,
20852,
20872,
20876,
20889,
20891,
20892,
20911,
20912,
20914,
20916,
20966,
21041,
21042,
21083,
21084,
21310,
21311,
21358,
21359,
21597,
21598,
21929,
21931,
21933,
21983,
22240,
22241,
22619,
22620,
22625,
22627,
22629,
22679,
22689,
22690,
22822,
22823,
22839,
22841,
22843,
22869,
23576,
23578,
23612,
23613,
23714,
23715,
23760,
23761,
23773,
23774,
23821
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 23821,
"ccnet_original_nlines": 392,
"rps_doc_curly_bracket": 0.0007556399796158075,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3387281000614166,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06264279782772064,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23591013252735138,
"rps_doc_frac_unique_words": 0.23171691596508026,
"rps_doc_mean_word_length": 4.641939640045166,
"rps_doc_num_sentences": 329,
"rps_doc_symbol_to_word_ratio": 0.005521710030734539,
"rps_doc_unigram_entropy": 5.758115291595459,
"rps_doc_word_count": 3815,
"rps_doc_frac_chars_dupe_10grams": 0.0821051374077797,
"rps_doc_frac_chars_dupe_5grams": 0.20582754909992218,
"rps_doc_frac_chars_dupe_6grams": 0.15901519358158112,
"rps_doc_frac_chars_dupe_7grams": 0.12807047367095947,
"rps_doc_frac_chars_dupe_8grams": 0.11722853034734726,
"rps_doc_frac_chars_dupe_9grams": 0.10356315970420837,
"rps_doc_frac_chars_top_2gram": 0.010277260094881058,
"rps_doc_frac_chars_top_3gram": 0.022926200181245804,
"rps_doc_frac_chars_top_4gram": 0.03399401158094406,
"rps_doc_books_importance": -2079.036376953125,
"rps_doc_books_importance_length_correction": -2079.036376953125,
"rps_doc_openwebtext_importance": -1238.480224609375,
"rps_doc_openwebtext_importance_length_correction": -1238.480224609375,
"rps_doc_wikipedia_importance": -880.7798461914062,
"rps_doc_wikipedia_importance_length_correction": -880.7798461914062
},
"fasttext": {
"dclm": 0.42400604486465454,
"english": 0.8937261700630188,
"fineweb_edu_approx": 1.965975046157837,
"eai_general_math": 0.20750278234481812,
"eai_open_web_math": 0.26796478033065796,
"eai_web_code": 0.7171910405158997
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.422",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.738",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,068,983,580,727,980,000 |
What Is Beta Software?
Definition of Beta Software, Plus How to Be a Beta Software Tester
Picture of a cloud on a blue circle that says beta
Beta refers to the phase in software development between the alpha phase and the release candidate phase.
Beta software is generally considered "complete" by the developer but still not ready for general use due to a lack of testing "in the wild." Websites, operating systems, and programs alike are often said to be in beta at some point during development.
Beta software is either released to everyone (called an open beta) or a controlled group (called a closed beta) for testing.
What Is the Purpose of Beta Software?
Beta software serves one main purpose: to test performance and identify issues, sometimes called bugs.
Allowing beta testers to try out software and provide feedback to the developer is a great way for the program to get some real world experience and to identify how it will work when it's out of beta.
Just like regular software, beta software runs alongside all the other tools that a computer or device is using, which is often the entire point - to test compatibility.
Beta testers are usually asked to give as much feedback as they can about the beta software - what sort of crashes are occurring, if the beta software or other parts of their computer or device are behaving strangely, etc.
Beta testing feedback might just include bugs and other issues that testers experience, but often it's also a chance for the developer to take suggestions for features and other ideas for improving the software.
Feedback may be given in a number of ways depending on the developer's request or the software that's being tested. This could include email, social media, a built-in contact tool, and/or a web forum.
Another common reason someone may intentionally download something that's only in the beta stage is to preview the newer, updated software.
Instead of waiting for the final release, a user (like you) could download the beta version of a program, for example, to check out all the new features and improvements that will likely make it into the final release.
Is It Safe to Try Beta Software?
Yes, it's generally safe to download and test beta software, but be sure that you understand the risks that come with it.
Remember that the program or website, or whatever it is that you're beta testing, is in the beta stage for a reason: the bugs need to be identified so that they can be fixed. This means you're more likely to find inconsistencies and hiccups in the software than you would if it were out of beta.
I've used lots of beta software on my computer and have never run into any issues, but this of course isn't going to be true for every beta service you take part in. I'm usually pretty conservative with my beta testing.
If you're worried that your computer may crash or that the beta software may cause some other unsavory problem with your computer, I recommend using the software in an isolated, virtual environment. VirtualBox and VMWare are two programs that can do this, or you could use the beta software on a computer or device that you don't use every day.
If you're using Windows, you should also consider creating a restore point before you try out beta software so that you can restore your computer back to an earlier time if it happens to corrupt important system files while you're testing it.
What's the Difference in an Open Beta & a Closed Beta?
Not all beta software is available for downloading or purchasing like regular software. Some developers release their software for testing purposes in what's referred to as closed beta.
Software that's in open beta, also called public beta, is free for anyone to download without an invite or special permission from the developers.
In contrast to open beta, closed beta requires an invitation before you can access the beta software. This generally works by requesting an invitation through the developer's website. If accepted, you'll be given instructions on how to download the software.
How Do I Become a Beta Tester?
There isn't a single place where you sign up to be a beta tester for all kinds of software. Being a beta tester just means that you're someone who tests beta software.
Download links to software in open beta are usually found alongside the stable releases at the developer's website or possibly in a separate section where other types of downloads are found like portable versions and archives.
For example, the beta version of popular web browsers like Mozilla Firefox, Google Chrome, and Opera can all be downloaded for free from their respective download pages. Apple offers beta software too, including beta versions of MacOS X and iOS.
Those are just a few examples, there are many, many more. You'd be surprised how many developers release their software to the public for beta testing purposes. Just keep your eyes out for it - you'll find it.
As I mentioned above, information about closed beta software downloads are also usually found on the developer's website, but require some kind of permission before use. You should see instructions on how to request that permission on the website.
If you're looking for a beta version for a specific piece of software but can't find the download link, just do a search for "beta" on the developer's website or on their official blog.
An even easier way to find beta versions of the software you already have on your computer is to use a free software updater. These tools will scan your computer to find outdated software, some of which can identify which programs have a beta option and even install the beta version for you.
More Information on Beta
The term beta comes from the Greek alphabet - alpha is the first letter of the alphabet (and the first stage of a software's release cycle) and beta is the second letter (and follows the alpha phase).
The beta phase can last anywhere from weeks to years, but normally falls somewhere in between. Software that has been in beta for a very long time is said to be in perpetual beta.
Beta versions of websites and software programs will normally have beta written across the heading image or the title of the main program window.
Paid software can also be available for beta testing, but those are normally programmed in a way where they stop working after a set amount of time. This may be configured in the software from the time of the download or may be a setting that gets enabled when you use a beta-specific product key.
There might be many updates made to beta software before it's ready for final release - dozens, hundreds... maybe thousands. This is because as more and more bugs are found and corrected, newer versions (without the previous bugs) are released and continually tested until the developers are comfortable enough to consider it a stable release.
Was this page helpful?
|
{
"url": "http://trithiscoaching.com/?url=what-is-beta-software-2625812",
"source_domain": "trithiscoaching.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "130060",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4RFV4UH5JQURLGLWYSCTOD4NQCKJGOSQ",
"WARC-Concurrent-To": "<urn:uuid:60bc3197-0392-4087-b903-5d6659d5414b>",
"WARC-Date": "2018-02-24T03:56:05Z",
"WARC-IP-Address": "69.89.31.109",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SWUHL3IBC7RSOEYDPHBUVPAPSHMJOMVU",
"WARC-Record-ID": "<urn:uuid:cbc0fe38-c50b-4d2f-a5d4-69485bafa009>",
"WARC-Target-URI": "http://trithiscoaching.com/?url=what-is-beta-software-2625812",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c847f253-4794-480c-9fd5-cc1afa025e95>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-102-27.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,
23,
24,
91,
92,
143,
144,
250,
251,
504,
505,
630,
631,
669,
670,
773,
774,
975,
976,
1146,
1147,
1370,
1371,
1583,
1584,
1785,
1786,
1926,
1927,
2146,
2147,
2180,
2181,
2303,
2304,
2600,
2601,
2821,
2822,
3167,
3168,
3411,
3412,
3467,
3468,
3654,
3655,
3802,
3803,
4062,
4063,
4094,
4095,
4263,
4264,
4491,
4492,
4738,
4739,
4949,
4950,
5198,
5199,
5385,
5386,
5679,
5680,
5705,
5706,
5907,
5908,
6088,
6089,
6235,
6236,
6534,
6535,
6879,
6880
],
"line_end_idx": [
23,
24,
91,
92,
143,
144,
250,
251,
504,
505,
630,
631,
669,
670,
773,
774,
975,
976,
1146,
1147,
1370,
1371,
1583,
1584,
1785,
1786,
1926,
1927,
2146,
2147,
2180,
2181,
2303,
2304,
2600,
2601,
2821,
2822,
3167,
3168,
3411,
3412,
3467,
3468,
3654,
3655,
3802,
3803,
4062,
4063,
4094,
4095,
4263,
4264,
4491,
4492,
4738,
4739,
4949,
4950,
5198,
5199,
5385,
5386,
5679,
5680,
5705,
5706,
5907,
5908,
6088,
6089,
6235,
6236,
6534,
6535,
6879,
6880,
6902
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6902,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4737609326839447,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004373180214315653,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11370261758565903,
"rps_doc_frac_unique_words": 0.34433165192604065,
"rps_doc_mean_word_length": 4.666666507720947,
"rps_doc_num_sentences": 55,
"rps_doc_symbol_to_word_ratio": 0.0007288599736057222,
"rps_doc_unigram_entropy": 5.1864824295043945,
"rps_doc_word_count": 1182,
"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.05003625899553299,
"rps_doc_frac_chars_top_3gram": 0.013596810400485992,
"rps_doc_frac_chars_top_4gram": 0.0032632299698889256,
"rps_doc_books_importance": -643.8296508789062,
"rps_doc_books_importance_length_correction": -643.8296508789062,
"rps_doc_openwebtext_importance": -386.9701843261719,
"rps_doc_openwebtext_importance_length_correction": -386.9701843261719,
"rps_doc_wikipedia_importance": -251.1698760986328,
"rps_doc_wikipedia_importance_length_correction": -251.1698760986328
},
"fasttext": {
"dclm": 0.6028145551681519,
"english": 0.9545384049415588,
"fineweb_edu_approx": 2.2689995765686035,
"eai_general_math": 0.6148785948753357,
"eai_open_web_math": 0.3381837010383606,
"eai_web_code": 0.4913029074668884
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-3,601,234,322,578,790,000 |
Skip to main content
Curved Surface Shader [ Unity Implementation ]
Curved Surface Shader
This is the shader that we will be having at the end of this tutorial.
Endless Runner Example
Gravity Visualizer
The curved surface shader is capable of achieving really varied visual effects from showing space-time curve due to gravity to a generic curved world shader that is seen in endless runners like Subway Surfers.
The concepts that you learn here can open you up to a new way of looking at shaders and if you didn't think they were the coolest thing ever already, hopefully let this be the turning point.😝.
Both the examples show above use the same exact material is just that different values have been passed to the shader.
Start by creating a new unlit shader in Unity and we will work our way from there.
First we define what the properties are:
_MainTex("Texture", 2D) = "white" {}
_BendAmount("Bend Amount", Vector) = (1,1,1,1)
_BendOrigin("Bend Origin", Vector) = (0,0,0,0)
_BendFallOff("Bend Falloff", float) = 1.0
_BendFallOffStr("Falloff strength", Range(0.00001,10)) = 1.0
This is how they are defined in the CG Program section :
float3 _BendAmount;
float3 _BendOrigin;
float _BendFallOff;
float _BendFallOffStr;
Now let's look at the vertex shader:
v2f vert(appdata v)
{
v2f o;
o.vertex = UnityObjectToClipPos(curveIt(v.vertex));
o.uv = v.uv;
UNITY_TRANSFER_FOG(o,o.vertex);
return o;
}
As you can we have a function called 'curveIt' which processes the input vertex values and passes it onto to be converted to clip space.
Now the gravy of the entire shader - The CurveIt Function:
float4 curveIt(float4 v)
{
/*1*/float4 world = mul(unity_ObjectToWorld, v);
/*2*/float dist = length(world.xyz - _BendOrigin.xyz);
/*3*/dist = max(0, dist - _BendFallOff);
/*4*/dist = pow(dist, _BendFallOffStr);
/*5*/world.xyz += dist * _BendAmount;
/*6*/return mul(unity_WorldToObject, world);
}
We will now go through those 6 lines of code that do all the magic.
1. Getting world space location of a particular vertex and save it in 'world'
2. Calculating the distance between the vertex position and where the _BendOrigin is.
3. dist value is prevented from going below 0, This prevents undefined behaviour when using pow function (-ve values don't work with pow).
4. dist value is raised to _BendFallOffStr value, which defines the steepness of the curve itself.
5. _BendAmount should be dependent on the distance value(dist) so as to have a falloff curve, So we simply multiply it with dist and add to 'world' (position of vertex in world).
6. convert the new world space of vertex and convert back to local( object ) space.
There are no changes to fragment shader in our case.
Now it's just a matter of playing around with the material properties. This shader works best when there are enough vertices to work with. So the default Unity cube is not a good candidate. The Unity plane is a better option but still it's not enough vertices to work with... so multiple Unity planes arranged in a grid with the Curved Surface shader applied on them is the best way to test it out quickly.... or you can make a high poly plane in Blender then import it.
To make the Gravity Displacement example shown above it's just a couple lines of code and attaching that to a sphere primitive.
using UnityEngine;
public class CurvedShaderTester : MonoBehaviour
{
[SerializeField] private Material curvedSurfaceMat;
void Start()
{
curvedSurfaceMat.SetVector("_BendAmount", new Vector3(0, 0.01f, 0));
curvedSurfaceMat.SetFloat("_BendFallOff", -9.8f);
curvedSurfaceMat.SetFloat("_BendFallOffStr", 2.0f);
}
void Update()
{
curvedSurfaceMat.SetVector("_BendOrigin", transform.position);
}
}
That's literally it.
To make the Endless Runner example,we just have to modify the _BendAmount by keeping the y-axis bend as constant and changing the value either on the x-axis or z-axis depends on your case. This time instead of a sphere, We attach the script on the Camera itself.
using UnityEngine;
public class CurvedShaderTester : MonoBehaviour
{
[SerializeField] private Material curvedSurfaceMat;
void Start()
{
curvedSurfaceMat.SetFloat("_BendFallOff", 17.0f);
curvedSurfaceMat.SetFloat("_BendFallOffStr", 2.0f);
}
void Update()
{
curvedSurfaceMat.SetVector("_BendOrigin", transform.position);
curvedSurfaceMat.SetVector("_BendAmount", new Vector3(0, -0.01f, (Mathf.Sin(Time.time) * 0.03f)));
}
}
Support Bitshift Programmer by leaving a like on Bitshift Programmer Facebook Page and be updated as soon as there is a new blog post.
If you have any questions that you might have about shaders, C# or Unity development in general don't be shy and leave a message on my facebook page or down in the comments.
For more shader goodness, Go HERE.
For Unity game development stuff, Go HERE.
Comments
Assets Worth Checking Out
POPULAR POSTS
Shader Optimization Part 1
The process of shader optimization can seem like trial and error... in fact, that's how it is most of the time.
Most of the time shader optimizations could be boiled down to educated guesses because each time a shader gets compiled, the GPU driver of that specific hardware is what converts your code into actual machine code, therefore, the machine code generated will be different for each GPU and the driver itself might perform some optimizations on top of your's which won't be available on another GPU, thereby making it difficult to have a standard way of writing optimal shader code.
So the best way to know for sure is to actually test it on the hardware you are targeting.
With that said, Here are some universal best ways of getting your shader to perform better.😅 Do Calculations On Vertex Shader The most commonly used case for this is lighting, an example would be Gouraud lighting, where lighting calculations are done per vertex but at the loss of quality.
Some calculatio…
Toon Liquid Shader - Unity Shader
Toon Liquid Shader This is how the shader will end up looking :
This shader is pretty neat and somewhat easy to implement as well as to understand. Since we will be adding some basic physics to the toon water as it is moved about we will have to support that in the vertex shader as well.
So let's start by looking at the properties :
Properties { _Colour ("Colour", Color) = (1,1,1,1) _FillAmount ("Fill Amount", Range(-10,10)) = 0.0 [HideInInspector] _WobbleX ("WobbleX", Range(-1,1)) = 0.0 [HideInInspector] _WobbleZ ("WobbleZ", Range(-1,1)) = 0.0 _TopColor ("Top Color", Color) = (1,1,1,1) _FoamColor ("Foam Line Color", Color) = (1,1,1,1) _Rim ("Foam Line Width", Range(0,0.1)) = 0.0 _RimColor ("Rim Color", Color) = (1,1,1,1) _RimPower ("Rim Power", Range(0,10)) = 0.0 } Just the usual stuff that we are used to. The only thing that may stand out is the [HideInInspector] tag, This works j…
Alto's Adventure Style Procedural Surface Generation Part 1
Alto's Adventure Style - Procedural Surface Generation This game appears to be a strictly 2D game but if you have played it enough you will notice that some of the art assets used look like it's 3D ( I don't know if they are tho ). If you haven't played the game you are missing out on one the most visually pleasing and calming games out there ( There is literally a mode called Zen mode in the game ).
Anyway, I am going to show you how to make a procedural 2D world ( without the trees, buildings and background ) like in Alto's Adventure.
But you may notice I have a plane which is in in the Z-axis giving a depth to the surface which is not there in Alto's Adventure but if you want to know how to do it then that will be in part 2.
To achieve the same effect of Alto's Adventure ( I'm leaving that up to you ) only minimal changes are needed to the code that I am going to explain.
We are going to be using the plane mesh in unity for creating the 2D surface as th…
Gift Wrapping Convex Hull Algorithm With Unity Implementation
Convex Hull Algorithm Convex Hull algorithms are one of those algorithms that keep popping up from time to time in seemingly unrelated fields from big data to image processing to collision detection in physics engines, It seems to be all over the place. Why should you care? Cus you can do magic with it and it seems so simple to implement when you first hear about it, but when you start thinking about it, you will realize why it's not such a straightforward thing to do.
Now that I got you interested (hopefully) and now we will see just what a convex hull is.
As you may have noticed a perimeter was made with the same points that was given and these perimeter points enclose the entire set of points.
Now we have to clear up the term 'Convex'.
Convex means no part of the object is caved inwards or that none of the internal angles made by the points exceed 180 degrees.
In this example of a concave shape internal angles go beyond 180 degrees.
What are those red lines for? Well...…
Pixelation Shader - Unity Shader
Pixelation Shader This is the correct way (one of many) of showing pixelation as a post-processing effect. This effect will work in any aspect ratio without any pixel size scaling issues as well as it is very minimal in terms of coding it up.
In order to get this to work 2 components have to be set up:
1) The pixelation image effect
2) The script - which will be attached to the camera
So let's get started by creating a new image effect shader.
We will take a look at our Shaderlab properties :
_MainTex("Texture", 2D) = "white" {} That's it, Everything else will be private and not shown in the editor.
Now we will see what are defined along with the _MainTex but are private.
sampler2D _MainTex; int _PixelDensity; float2 _AspectRatioMultiplier; We will pass _PixelDensity & _AspectRatioMultiplier values from the script.
As this is an image effect there is no need to play around with the vertex shader.
Let's take a look at our fragment shader:
fixed4 frag (…
|
{
"url": "https://www.bitshiftprogrammer.com/2018/04/curved-surface-shader-unity.html",
"source_domain": "www.bitshiftprogrammer.com",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "151406",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z3BAIEQZFCKX4OTOF2XSHFW5WTUSXWO5",
"WARC-Concurrent-To": "<urn:uuid:2e52a685-b76e-42d2-951f-6eab7e887068>",
"WARC-Date": "2019-03-25T15:43:54Z",
"WARC-IP-Address": "172.217.7.243",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:OMIHVXA5SUNKCLUSPM5EHHKRIAW27LL7",
"WARC-Record-ID": "<urn:uuid:ac134546-38a7-49fe-84cf-fede6decf6fe>",
"WARC-Target-URI": "https://www.bitshiftprogrammer.com/2018/04/curved-surface-shader-unity.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8def1d51-2e09-4758-b1e2-2547d6aa9723>"
},
"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-184-109-84.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,
69,
70,
92,
163,
186,
205,
416,
609,
610,
729,
812,
853,
890,
937,
984,
1026,
1087,
1144,
1164,
1184,
1204,
1227,
1264,
1284,
1286,
1294,
1347,
1361,
1394,
1405,
1407,
1544,
1603,
1628,
1630,
1680,
1736,
1778,
1779,
1820,
1859,
1905,
1907,
1975,
2055,
2143,
2284,
2385,
2566,
2652,
2705,
3176,
3177,
3305,
3324,
3372,
3374,
3430,
3447,
3453,
3530,
3588,
3648,
3654,
3672,
3678,
3749,
3755,
3757,
3778,
4041,
4060,
4108,
4110,
4166,
4183,
4189,
4247,
4307,
4313,
4314,
4332,
4338,
4409,
4516,
4522,
4524,
4659,
4833,
4834,
4869,
4912,
4913,
4922,
4923,
4949,
4950,
4964,
4965,
4992,
4993,
5105,
5585,
5586,
5677,
5967,
5968,
5985,
5986,
6020,
6021,
6085,
6310,
6356,
6918,
6919,
6979,
6980,
7384,
7523,
7718,
7868,
7952,
7953,
8015,
8016,
8490,
8580,
8722,
8765,
8892,
8966,
9005,
9006,
9039,
9040,
9283,
9284,
9345,
9376,
9429,
9430,
9490,
9540,
9649,
9723,
9869,
9952,
9994
],
"line_end_idx": [
21,
22,
69,
70,
92,
163,
186,
205,
416,
609,
610,
729,
812,
853,
890,
937,
984,
1026,
1087,
1144,
1164,
1184,
1204,
1227,
1264,
1284,
1286,
1294,
1347,
1361,
1394,
1405,
1407,
1544,
1603,
1628,
1630,
1680,
1736,
1778,
1779,
1820,
1859,
1905,
1907,
1975,
2055,
2143,
2284,
2385,
2566,
2652,
2705,
3176,
3177,
3305,
3324,
3372,
3374,
3430,
3447,
3453,
3530,
3588,
3648,
3654,
3672,
3678,
3749,
3755,
3757,
3778,
4041,
4060,
4108,
4110,
4166,
4183,
4189,
4247,
4307,
4313,
4314,
4332,
4338,
4409,
4516,
4522,
4524,
4659,
4833,
4834,
4869,
4912,
4913,
4922,
4923,
4949,
4950,
4964,
4965,
4992,
4993,
5105,
5585,
5586,
5677,
5967,
5968,
5985,
5986,
6020,
6021,
6085,
6310,
6356,
6918,
6919,
6979,
6980,
7384,
7523,
7718,
7868,
7952,
7953,
8015,
8016,
8490,
8580,
8722,
8765,
8892,
8966,
9005,
9006,
9039,
9040,
9283,
9284,
9345,
9376,
9429,
9430,
9490,
9540,
9649,
9723,
9869,
9952,
9994,
10008
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10008,
"ccnet_original_nlines": 151,
"rps_doc_curly_bracket": 0.0021982400212436914,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36768150329589844,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010772829875349998,
"rps_doc_frac_lines_end_with_ellipsis": 0.032894741743803024,
"rps_doc_frac_no_alph_words": 0.24637001752853394,
"rps_doc_frac_unique_words": 0.3674775958061218,
"rps_doc_mean_word_length": 4.87708044052124,
"rps_doc_num_sentences": 101,
"rps_doc_symbol_to_word_ratio": 0.004683840088546276,
"rps_doc_unigram_entropy": 5.664689540863037,
"rps_doc_word_count": 1562,
"rps_doc_frac_chars_dupe_10grams": 0.029404040426015854,
"rps_doc_frac_chars_dupe_5grams": 0.07902336865663528,
"rps_doc_frac_chars_dupe_6grams": 0.07534786313772202,
"rps_doc_frac_chars_dupe_7grams": 0.029404040426015854,
"rps_doc_frac_chars_dupe_8grams": 0.029404040426015854,
"rps_doc_frac_chars_dupe_9grams": 0.029404040426015854,
"rps_doc_frac_chars_top_2gram": 0.007088469807058573,
"rps_doc_frac_chars_top_3gram": 0.009976370260119438,
"rps_doc_frac_chars_top_4gram": 0.003938040230423212,
"rps_doc_books_importance": -1030.0953369140625,
"rps_doc_books_importance_length_correction": -1030.0953369140625,
"rps_doc_openwebtext_importance": -574.2968139648438,
"rps_doc_openwebtext_importance_length_correction": -574.2968139648438,
"rps_doc_wikipedia_importance": -374.6551208496094,
"rps_doc_wikipedia_importance_length_correction": -374.6551208496094
},
"fasttext": {
"dclm": 0.5180284976959229,
"english": 0.8857532143592834,
"fineweb_edu_approx": 2.2771382331848145,
"eai_general_math": 0.8706891536712646,
"eai_open_web_math": 0.18684405088424683,
"eai_web_code": 0.5672012567520142
}
}
|
{
"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": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,290,956,014,340,930,000 |
Logo Khaganat
Translations of this page?:
Create a universe
In this section, we will discuss the data that allows a universe to exist!(Unlike the server system which makes it possible for the universe to be available for the client that connects to it).
The different types of data used
Base MySQL
This database system is used for services and the administration of the server, this does not therefore directly concern the world EXCEPT the determination of player accounts and their privileges.
The Georges Sheets
These files(stored in sources in code/ryzom/common/data_leveldesign/leveldesign) contains the definition of all the elements to be defined, like: objects, spells, creatures… and also the basic encyclopedia which contains all the definitions of all the elements that can be called, and importantly all the bricks that will be used to build the world. Ryzom Core stores data in the form of “xml” files(with variable extensions, like: .txt, .dfn, .cfg, .continent etc…
They are designed to adopt a “hierarchy and parenting” that allows the increasing accuracy of the different elements.
These xml files can be edited manually, but there is an dedicated editor: Georges Editor.
Once defined, these files are compressed into packed sheets files, this is a compact binary version for use by the game server. If you delete the files, the server will recreate them at startup!
The Primitives
Once all your items, spells, actions, and skills are defined in the Georges Sheets, you have to assemble all the “bricks” for world making. This is a job for the World Editor!! This one is much more than a software for map creation, because it also makes it possible to compose the world in sections.
Once again, the data is stored as xml files, with different extensions depending on their destination. The server stores them in code/ryzom/common/data_leveldesign/primitives.
Now, This is where it becomes possible to create a specific character that's assigned to a task in a given place. This is because the different bricks(composed in the Georges Sheets) are used for this purpose. The hierarchy system allows you to define groups of NPCs, creatures, and so on in a nice and tidy manner… so you then can place elements of these groups without having to redefine(individually) each object/creature/character.
Again, the server generates the packed sheets at startup in case it is missing.
The Persistent Data Record
With the Georges Sheets and Primitives, we get a “world state” when the server starts(for the moment 0). But it will immediately change(begin to live) because of the players through their characters, modifications made, interaction etc… To save the world's evolution, and keeping the memory of the last state of each and every thing, the Ryzom Core server write files to the disk(without going through a database system).
This is where all the: characters, guilds, inventories, creatures position, quest statuses are stored…
This kind of data is stored in code/ryzom/server/save_shard, in the form of binary files.
Although, this is not normally necessary, because it is possible to edit the data using the pdr_util utility, which transforms the binary “pdr” into an “editable xml”. It can then be reassembled with the same tool. This can be used to massively update data on a large number of characters or creatures.
Let's take a sample file: code/ryzom/server/save_shard/characters/001/account_1_0_pdr.bin.
We see that we are in the part devoted to the characters(“characters” in English). The subfolder, 001, is used only to prevent too much data from being stored in the same directory, so the system automatically organizes them into sub directories. Then we see “account”, this means a player account, then “1”, means account with ID 1. Then we read 0, this is the first character slot(out of 4 possible ). Ie: This binary file contains all the data of the first character of the server's first player: inventory, position, skills etc.
CC Attribution-Share Alike 4.0 International Driven by DokuWiki
en/creer_un_univers.txt · Last modified: 2021/12/03 19:19 (external edit)
Licences Mentions légales Accueil du site Contact
|
{
"url": "https://khaganat.net/wikhan/en:creer_un_univers",
"source_domain": "khaganat.net",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "37952",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U2CH2HVJJUHBYSFCNRXFUURAJ3NNBANN",
"WARC-Concurrent-To": "<urn:uuid:1d29decc-d9af-46a1-be57-1e45c9cc3f5e>",
"WARC-Date": "2022-01-21T15:12:48Z",
"WARC-IP-Address": "62.210.99.71",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:G65NULCPW2X6T3QZ5DLWZK67RN5AJBLW",
"WARC-Record-ID": "<urn:uuid:7cc5a443-993a-4698-a906-6045e6ef5bfa>",
"WARC-Target-URI": "https://khaganat.net/wikhan/en:creer_un_univers",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2a6a099e-1813-42fa-b91a-2dcbd092dccd>"
},
"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-27\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,
14,
42,
43,
61,
62,
256,
257,
290,
291,
302,
303,
500,
501,
520,
521,
522,
988,
1106,
1196,
1391,
1392,
1407,
1408,
1709,
1885,
2321,
2401,
2402,
2429,
2430,
2852,
2955,
3045,
3348,
3349,
3440,
3973,
3974,
4038,
4112,
4113
],
"line_end_idx": [
14,
42,
43,
61,
62,
256,
257,
290,
291,
302,
303,
500,
501,
520,
521,
522,
988,
1106,
1196,
1391,
1392,
1407,
1408,
1709,
1885,
2321,
2401,
2402,
2429,
2430,
2852,
2955,
3045,
3348,
3349,
3440,
3973,
3974,
4038,
4112,
4113,
4162
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4162,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39600470662117004,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003525259904563427,
"rps_doc_frac_lines_end_with_ellipsis": 0.0476190485060215,
"rps_doc_frac_no_alph_words": 0.19858989119529724,
"rps_doc_frac_unique_words": 0.4496951103210449,
"rps_doc_mean_word_length": 5.089939117431641,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0.00587543984875083,
"rps_doc_unigram_entropy": 5.059262275695801,
"rps_doc_word_count": 656,
"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.01257861964404583,
"rps_doc_frac_chars_top_3gram": 0.019167419523000717,
"rps_doc_frac_chars_top_4gram": 0.009583709761500359,
"rps_doc_books_importance": -365.8305358886719,
"rps_doc_books_importance_length_correction": -365.8305358886719,
"rps_doc_openwebtext_importance": -261.03802490234375,
"rps_doc_openwebtext_importance_length_correction": -261.03802490234375,
"rps_doc_wikipedia_importance": -214.04786682128906,
"rps_doc_wikipedia_importance_length_correction": -214.04786682128906
},
"fasttext": {
"dclm": 0.30576539039611816,
"english": 0.8911387324333191,
"fineweb_edu_approx": 3.0454437732696533,
"eai_general_math": 0.9151027798652649,
"eai_open_web_math": 0.39680516719818115,
"eai_web_code": 0.6212893724441528
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,995,437,581,812,813,800 |
Skip to content
HTTPS clone URL
Subversion checkout URL
You can clone with
or
.
Download ZIP
Fetching contributors…
Cannot retrieve contributors at this time
283 lines (251 sloc) 11 KB
<?php
require_once('admin.php');
$title = 'Profile';
$parent_file = 'profile.php';
$wpvarstoreset = array('action', 'profile', 'user');
for ($i=0; $i<count($wpvarstoreset); $i += 1) {
$wpvar = $wpvarstoreset[$i];
if (!isset($$wpvar)) {
if (empty($_POST["$wpvar"])) {
if (empty($_GET["$wpvar"])) {
$$wpvar = '';
} else {
$$wpvar = $_GET["$wpvar"];
}
} else {
$$wpvar = $_POST["$wpvar"];
}
}
}
require_once('../wp-config.php');
auth_redirect();
switch($action) {
case 'update':
get_currentuserinfo();
/* checking the nickname has been typed */
if (empty($_POST["newuser_nickname"])) {
die (__("<strong>ERROR</strong>: please enter your nickname (can be the same as your username)"));
return false;
}
/* if the ICQ UIN has been entered, check to see if it has only numbers */
if (!empty($_POST["newuser_icq"])) {
if ((ereg("^[0-9]+$",$_POST["newuser_icq"]))==false) {
die (__("<strong>ERROR</strong>: your ICQ UIN can only be a number, no letters allowed"));
return false;
}
}
/* checking e-mail address */
if (empty($_POST["newuser_email"])) {
die (__("<strong>ERROR</strong>: please type your e-mail address"));
return false;
} else if (!is_email($_POST["newuser_email"])) {
die (__("<strong>ERROR</strong>: the e-mail address isn't correct"));
return false;
}
$pass1 = $_POST["pass1"];
$pass2 = $_POST["pass2"];
do_action('check_passwords', array($user_login, &$pass1, &$pass2));
if ( '' == $pass1 ) {
if ( '' != $pass2 )
die (__("<strong>ERROR</strong>: you typed your new password only once. Go back to type it twice."));
$updatepassword = "";
} else {
if ('' == $pass2)
die (__("<strong>ERROR</strong>: you typed your new password only once. Go back to type it twice."));
if ( $pass1 != $pass2 )
die (__("<strong>ERROR</strong>: you typed two different passwords. Go back to correct that."));
$newuser_pass = $pass1;
$updatepassword = "user_pass=MD5('$newuser_pass'), ";
wp_clearcookie();
wp_setcookie($user_login, $newuser_pass);
}
$newuser_firstname = wp_specialchars($_POST['newuser_firstname']);
$newuser_lastname = wp_specialchars($_POST['newuser_lastname']);
$newuser_nickname = $_POST['newuser_nickname'];
$newuser_nicename = sanitize_title($newuser_nickname);
$newuser_icq = wp_specialchars($_POST['newuser_icq']);
$newuser_aim = wp_specialchars($_POST['newuser_aim']);
$newuser_msn = wp_specialchars($_POST['newuser_msn']);
$newuser_yim = wp_specialchars($_POST['newuser_yim']);
$newuser_email = wp_specialchars($_POST['newuser_email']);
$newuser_url = wp_specialchars($_POST['newuser_url']);
$newuser_url = preg_match('/^(https?|ftps?|mailto|news|gopher):/is', $newuser_url) ? $newuser_url : 'http://' . $newuser_url;
$newuser_idmode = wp_specialchars($_POST['newuser_idmode']);
$user_description = $_POST['user_description'];
$result = $wpdb->query("UPDATE $wpdb->users SET user_firstname='$newuser_firstname', $updatepassword user_lastname='$newuser_lastname', user_nickname='$newuser_nickname', user_icq='$newuser_icq', user_email='$newuser_email', user_url='$newuser_url', user_aim='$newuser_aim', user_msn='$newuser_msn', user_yim='$newuser_yim', user_idmode='$newuser_idmode', user_description = '$user_description', user_nicename = '$newuser_nicename' WHERE ID = $user_ID");
wp_redirect('profile.php?updated=true');
break;
case 'IErightclick':
$bookmarklet_height= 550;
?>
<div class="menutop"> IE one-click bookmarklet</div>
<table width="100%" cellpadding="20">
<tr><td>
<p>To have a one-click bookmarklet, just copy and paste this<br />into a new text file:</p>
<?php
$regedit = "REGEDIT4\r\n[HKEY_CURRENT_USER\Software\Microsoft\Internet Explorer\MenuExt\Post To &WP : ". get_settings('blogname') ."]\r\n@=\"javascript:doc=external.menuArguments.document;Q=doc.selection.createRange().text;void(btw=window.open('". get_settings('siteurl') ."/wp-admin/bookmarklet.php?text='+escape(Q)+'".$bookmarklet_tbpb."&popupurl='+escape(doc.location.href)+'&popuptitle='+escape(doc.title),'bookmarklet','scrollbars=no,width=480,height=".$bookmarklet_height.",left=100,top=150,status=yes'));btw.focus();\"\r\n\"contexts\"=hex:31\"";
?>
<pre style="margin: 20px; background-color: #cccccc; border: 1px dashed #333333; padding: 5px; font-size: 12px;"><?php echo $regedit; ?></pre>
<p>Save it as wordpress.reg, and double-click on this file in an Explorer<br />
window. Answer Yes to the question, and restart Internet Explorer.<br /><br />
That's it, you can now right-click in an IE window and select <br />
'Post to WP' to make the bookmarklet appear. :)</p>
<p align="center">
<form>
<input class="search" type="button" value="1" name="Close this window" />
</form>
</p>
</td></tr>
</table>
<?php
break;
default:
$parent_file = 'profile.php';
include_once('admin-header.php');
$profiledata=get_userdata($user_ID);
$bookmarklet_height= 440;
if (isset($updated)) { ?>
<div class="updated">
<p><strong><?php _e('Profile updated.') ?></strong></p>
</div>
<?php } ?>
<div class="wrap">
<h2><?php _e('Profile'); ?></h2>
<form name="profile" id="profile" action="profile.php" method="post">
<p>
<input type="hidden" name="action" value="update" />
<input type="hidden" name="checkuser_id" value="<?php echo $user_ID ?>" />
</p>
<table width="99%" border="0" cellspacing="2" cellpadding="3" class="editform">
<tr>
<th width="33%" scope="row"><?php _e('Username:') ?></th>
<td width="67%"><?php echo $profiledata->user_login; ?></td>
</tr>
<tr>
<th scope="row"><?php _e('Level:') ?></th>
<td><?php echo $profiledata->user_level; ?></td>
</tr>
<tr>
<th scope="row"><?php _e('Posts:') ?></th>
<td> <?php
$posts = get_usernumposts($user_ID);
echo $posts;
?></td>
</tr>
<tr>
<th scope="row"><?php _e('First name:') ?></th>
<td><input type="text" name="newuser_firstname" id="newuser_firstname" value="<?php echo $profiledata->user_firstname ?>" /></td>
</tr>
<tr>
<th scope="row"><?php _e('Last name:') ?></th>
<td><input type="text" name="newuser_lastname" id="newuser_lastname2" value="<?php echo $profiledata->user_lastname ?>" /></td>
</tr>
<tr>
<th scope="row"><?php _e('Nickname:') ?></th>
<td><input type="text" name="newuser_nickname" id="newuser_nickname2" value="<?php echo $profiledata->user_nickname ?>" /></td>
</tr>
<tr>
<th scope="row"><?php _e('How to display name:') ?> </th>
<td><select name="newuser_idmode">
<option value="nickname"<?php
if ($profiledata->user_idmode == 'nickname')
echo ' selected="selected"'; ?>><?php echo $profiledata->user_nickname ?></option>
<option value="login"<?php
if ($profiledata->user_idmode=="login")
echo ' selected="selected"'; ?>><?php echo $profiledata->user_login ?></option>
<?php if ( !empty( $profiledata->user_firstname ) ) : ?>
<option value="firstname"<?php
if ($profiledata->user_idmode=="firstname")
echo ' selected="selected"'; ?>><?php echo $profiledata->user_firstname ?></option>
<?php endif; ?>
<?php if ( !empty( $profiledata->user_lastname ) ) : ?>
<option value="lastname"<?php
if ($profiledata->user_idmode=="lastname")
echo ' selected="selected"'; ?>><?php echo $profiledata->user_lastname ?></option>
<?php endif; ?>
<?php if ( !empty( $profiledata->user_firstname ) && !empty( $profiledata->user_lastname ) ) : ?>
<option value="namefl"<?php
if ($profiledata->user_idmode=="namefl")
echo ' selected="selected"'; ?>><?php echo $profiledata->user_firstname." ".$profiledata->user_lastname ?></option>
<?php endif; ?>
<?php if ( !empty( $profiledata->user_firstname ) && !empty( $profiledata->user_lastname ) ) : ?>
<option value="namelf"<?php
if ($profiledata->user_idmode=="namelf")
echo ' selected="selected"'; ?>><?php echo $profiledata->user_lastname." ".$profiledata->user_firstname ?></option>
<?php endif; ?>
</select> </td>
</tr>
<tr>
<th scope="row"><?php _e('E-mail:') ?></th>
<td><input type="text" name="newuser_email" id="newuser_email2" value="<?php echo $profiledata->user_email ?>" /></td>
</tr>
<tr>
<th scope="row"><?php _e('Website:') ?></th>
<td><input type="text" name="newuser_url" id="newuser_url2" value="<?php echo $profiledata->user_url ?>" /></td>
</tr>
<tr>
<th scope="row"><?php _e('ICQ:') ?></th>
<td><input type="text" name="newuser_icq" id="newuser_icq2" value="<?php if ($profiledata->user_icq > 0) { echo $profiledata->user_icq; } ?>" /></td>
</tr>
<tr>
<th scope="row"><?php _e('AIM:') ?></th>
<td><input type="text" name="newuser_aim" id="newuser_aim2" value="<?php echo $profiledata->user_aim ?>" /></td>
</tr>
<tr>
<th scope="row"><?php _e('MSN IM:') ?> </th>
<td><input type="text" name="newuser_msn" id="newuser_msn2" value="<?php echo $profiledata->user_msn ?>" /></td>
</tr>
<tr>
<th scope="row"><?php _e('Yahoo IM:') ?> </th>
<td> <input type="text" name="newuser_yim" id="newuser_yim2" value="<?php echo $profiledata->user_yim ?>" /> </td>
</tr>
<tr>
<th scope="row"><?php _e('Profile:') ?></th>
<td><textarea name="user_description" rows="5" id="textarea2" style="width: 99%; "><?php echo $profiledata->user_description ?></textarea></td>
</tr>
<?php
$show_password_fields = apply_filters('show_password_fields', true);
if ( $show_password_fields ) :
?>
<tr>
<th scope="row"><?php _e('New <strong>Password</strong> (Leave blank to stay the same.)') ?></th>
<td><input type="password" name="pass1" size="16" value="" />
<br />
<input type="password" name="pass2" size="16" value="" /></td>
</tr>
<?php endif; ?>
</table>
<p class="submit">
<input type="submit" value="<?php _e('Update Profile »') ?>" name="submit" />
</p>
</form>
</div>
<?php if ($is_gecko && $profiledata->user_level != 0) { ?>
<div class="wrap">
<script type="text/javascript">
//<![CDATA[
function addPanel()
{
if ((typeof window.sidebar == "object") && (typeof window.sidebar.addPanel == "function"))
window.sidebar.addPanel("WordPress Post: <?php echo get_settings('blogname'); ?>","<?php echo get_settings('siteurl'); ?>/wp-admin/sidebar.php","");
else
alert(<?php __("'No Sidebar found! You must use Mozilla 0.9.4 or later!'") ?>);
}
//]]>
</script>
<strong><?php _e('SideBar') ?></strong><br />
<?php _e('Add the <a href="#" onclick="addPanel()">WordPress Sidebar</a>!') ?>
<?php } elseif (($is_winIE) || ($is_macIE)) { ?>
<strong><?php _e('SideBar') ?></strong><br />
<?php __('Add this link to your favorites:') ?><br />
<a href="javascript:Q='';if(top.frames.length==0)Q=document.selection.createRange().text;void(_search=open('<?php echo get_settings('siteurl');
?>/wp-admin/sidebar.php?text='+escape(Q)+'&popupurl='+escape(location.href)+'&popuptitle='+escape(document.title),'_search'))"><?php _e('WordPress Sidebar') ?></a>.
</div>
<?php } ?>
</div>
<?php
break;
}
/* </Profile | My Profile> */
include('admin-footer.php');
?>
Jump to Line
Something went wrong with that request. Please try again.
|
{
"url": "https://github.com/WordPress/WordPress/blob/1.5.1.2/wp-admin/profile.php",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "203484",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7LNEBULPUPSOPDETNUXBBXOX73MGSA45",
"WARC-Concurrent-To": "<urn:uuid:09aee004-2c93-4d65-89a3-42c970d6f62e>",
"WARC-Date": "2015-11-25T12:17:19Z",
"WARC-IP-Address": "192.30.252.131",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DBGCD3I2XUQVNE6GWM4XYGUPD53XO6XW",
"WARC-Record-ID": "<urn:uuid:2c9414c8-ddc8-445c-aa6f-8be4ba87cb24>",
"WARC-Target-URI": "https://github.com/WordPress/WordPress/blob/1.5.1.2/wp-admin/profile.php",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:719afaae-cc57-47e1-8a29-5acd59f1e61b>"
},
"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,
16,
17,
33,
34,
58,
59,
78,
81,
83,
96,
119,
161,
188,
194,
221,
241,
271,
324,
372,
401,
424,
455,
485,
499,
508,
535,
537,
546,
574,
576,
578,
580,
614,
631,
649,
664,
687,
730,
771,
870,
884,
886,
961,
998,
1053,
1144,
1158,
1160,
1162,
1192,
1230,
1299,
1313,
1362,
1432,
1446,
1448,
1474,
1500,
1568,
1590,
1610,
1712,
1734,
1743,
1761,
1863,
1887,
1984,
2008,
2062,
2080,
2122,
2124,
2191,
2256,
2304,
2359,
2414,
2469,
2524,
2579,
2638,
2693,
2819,
2880,
2928,
3383,
3424,
3431,
3452,
3478,
3481,
3539,
3577,
3586,
3678,
3684,
4237,
4240,
4383,
4463,
4542,
4611,
4663,
4682,
4689,
4763,
4771,
4776,
4787,
4796,
4802,
4809,
4818,
4848,
4882,
4919,
4945,
4971,
4993,
5049,
5056,
5067,
5086,
5119,
5189,
5193,
5246,
5321,
5326,
5406,
5411,
5469,
5530,
5536,
5541,
5584,
5633,
5639,
5644,
5687,
5698,
5735,
5748,
5756,
5762,
5767,
5815,
5945,
5951,
5956,
6003,
6131,
6137,
6142,
6188,
6316,
6322,
6327,
6385,
6420,
6450,
6495,
6578,
6605,
6645,
6725,
6782,
6813,
6857,
6941,
6957,
7013,
7043,
7086,
7169,
7185,
7283,
7311,
7352,
7468,
7484,
7582,
7610,
7651,
7767,
7783,
7799,
7805,
7810,
7854,
7973,
7979,
7984,
8029,
8142,
8148,
8153,
8194,
8344,
8350,
8355,
8396,
8509,
8515,
8520,
8565,
8678,
8684,
8689,
8736,
8851,
8857,
8862,
8907,
9051,
9057,
9063,
9132,
9163,
9166,
9171,
9269,
9331,
9338,
9401,
9407,
9423,
9432,
9451,
9535,
9540,
9548,
9555,
9614,
9633,
9665,
9677,
9697,
9699,
9790,
9939,
9944,
10024,
10026,
10032,
10042,
10088,
10167,
10216,
10262,
10316,
10460,
10625,
10632,
10643,
10650,
10656,
10663,
10665,
10695,
10724,
10727,
10740
],
"line_end_idx": [
16,
17,
33,
34,
58,
59,
78,
81,
83,
96,
119,
161,
188,
194,
221,
241,
271,
324,
372,
401,
424,
455,
485,
499,
508,
535,
537,
546,
574,
576,
578,
580,
614,
631,
649,
664,
687,
730,
771,
870,
884,
886,
961,
998,
1053,
1144,
1158,
1160,
1162,
1192,
1230,
1299,
1313,
1362,
1432,
1446,
1448,
1474,
1500,
1568,
1590,
1610,
1712,
1734,
1743,
1761,
1863,
1887,
1984,
2008,
2062,
2080,
2122,
2124,
2191,
2256,
2304,
2359,
2414,
2469,
2524,
2579,
2638,
2693,
2819,
2880,
2928,
3383,
3424,
3431,
3452,
3478,
3481,
3539,
3577,
3586,
3678,
3684,
4237,
4240,
4383,
4463,
4542,
4611,
4663,
4682,
4689,
4763,
4771,
4776,
4787,
4796,
4802,
4809,
4818,
4848,
4882,
4919,
4945,
4971,
4993,
5049,
5056,
5067,
5086,
5119,
5189,
5193,
5246,
5321,
5326,
5406,
5411,
5469,
5530,
5536,
5541,
5584,
5633,
5639,
5644,
5687,
5698,
5735,
5748,
5756,
5762,
5767,
5815,
5945,
5951,
5956,
6003,
6131,
6137,
6142,
6188,
6316,
6322,
6327,
6385,
6420,
6450,
6495,
6578,
6605,
6645,
6725,
6782,
6813,
6857,
6941,
6957,
7013,
7043,
7086,
7169,
7185,
7283,
7311,
7352,
7468,
7484,
7582,
7610,
7651,
7767,
7783,
7799,
7805,
7810,
7854,
7973,
7979,
7984,
8029,
8142,
8148,
8153,
8194,
8344,
8350,
8355,
8396,
8509,
8515,
8520,
8565,
8678,
8684,
8689,
8736,
8851,
8857,
8862,
8907,
9051,
9057,
9063,
9132,
9163,
9166,
9171,
9269,
9331,
9338,
9401,
9407,
9423,
9432,
9451,
9535,
9540,
9548,
9555,
9614,
9633,
9665,
9677,
9697,
9699,
9790,
9939,
9944,
10024,
10026,
10032,
10042,
10088,
10167,
10216,
10262,
10316,
10460,
10625,
10632,
10643,
10650,
10656,
10663,
10665,
10695,
10724,
10727,
10740,
10797
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10797,
"ccnet_original_nlines": 265,
"rps_doc_curly_bracket": 0.003519499907270074,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0921248123049736,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022659730166196823,
"rps_doc_frac_lines_end_with_ellipsis": 0.003759399987757206,
"rps_doc_frac_no_alph_words": 0.5215452909469604,
"rps_doc_frac_unique_words": 0.4813953638076782,
"rps_doc_mean_word_length": 8.175580978393555,
"rps_doc_num_sentences": 214,
"rps_doc_symbol_to_word_ratio": 0.0014858799986541271,
"rps_doc_unigram_entropy": 5.432827949523926,
"rps_doc_word_count": 860,
"rps_doc_frac_chars_dupe_10grams": 0.051770731806755066,
"rps_doc_frac_chars_dupe_5grams": 0.12046650797128677,
"rps_doc_frac_chars_dupe_6grams": 0.05518418177962303,
"rps_doc_frac_chars_dupe_7grams": 0.051770731806755066,
"rps_doc_frac_chars_dupe_8grams": 0.051770731806755066,
"rps_doc_frac_chars_dupe_9grams": 0.051770731806755066,
"rps_doc_frac_chars_top_2gram": 0.008533639833331108,
"rps_doc_frac_chars_top_3gram": 0.029867729172110558,
"rps_doc_frac_chars_top_4gram": 0.0147916404530406,
"rps_doc_books_importance": -1363.9219970703125,
"rps_doc_books_importance_length_correction": -1363.9219970703125,
"rps_doc_openwebtext_importance": -811.7323608398438,
"rps_doc_openwebtext_importance_length_correction": -811.7323608398438,
"rps_doc_wikipedia_importance": -588.9420776367188,
"rps_doc_wikipedia_importance_length_correction": -588.9420776367188
},
"fasttext": {
"dclm": 0.9477185606956482,
"english": 0.30185961723327637,
"fineweb_edu_approx": 2.3573405742645264,
"eai_general_math": 0.014968570321798325,
"eai_open_web_math": 0.3885858654975891,
"eai_web_code": 0.426114559173584
}
}
|
{
"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": "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": "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
|
-5,113,756,800,907,630,000 |
eduSTEMlab: Employee Database System By Jeida
October 27, 2023
Jeida’s project is a web application created using Python framework for building web applications. It provides three main functions through a user-friendly interface.
Register Staff: You can input and save employee information, including their names, email, gender, department, job title, contract status, salary, education level, and employment date. Clicking “Submit Employee Data” saves this information to a CSV file.
Staff Database: View and manage employee data. It displays the data from the CSV file in an organized format for easy access and search.
Staff File: Find detailed information about a specific employee by entering their unique Employee ID. It retrieves and displays their name, email, gender, department, date of employment, seniority level, contract status, and salary. The project creates a user-friendly interface for efficient employee data management.
More Lifehack Videos
|
{
"url": "https://edustemlab.com/videos/edustemlab-employee-database-system-by-jeida/",
"source_domain": "edustemlab.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "120053",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TFX5YZNVWXRBLBMV55JYNTQOB4VH5GIA",
"WARC-Concurrent-To": "<urn:uuid:fddaa5ee-c664-48fb-b239-fe83bc19e5f8>",
"WARC-Date": "2024-04-24T02:31:46Z",
"WARC-IP-Address": "185.202.236.95",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6KO6CGK4RLIT54V2TXTV2X66LLSEVAGE",
"WARC-Record-ID": "<urn:uuid:bbc5e5c8-bc28-44d6-b5d3-25aa443a3637>",
"WARC-Target-URI": "https://edustemlab.com/videos/edustemlab-employee-database-system-by-jeida/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5b957c27-c9a3-4c4e-bd03-093eb695abab>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-180\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
46,
47,
64,
65,
232,
233,
488,
489,
626,
627,
946,
947
],
"line_end_idx": [
46,
47,
64,
65,
232,
233,
488,
489,
626,
627,
946,
947,
967
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 967,
"ccnet_original_nlines": 12,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1977401077747345,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01694915071129799,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20903955399990082,
"rps_doc_frac_unique_words": 0.6546762585639954,
"rps_doc_mean_word_length": 5.690647602081299,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.342007637023926,
"rps_doc_word_count": 139,
"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.032869789749383926,
"rps_doc_frac_chars_top_3gram": 0.0556257888674736,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -71.37482452392578,
"rps_doc_books_importance_length_correction": -71.37482452392578,
"rps_doc_openwebtext_importance": -44.10428237915039,
"rps_doc_openwebtext_importance_length_correction": -30.487743377685547,
"rps_doc_wikipedia_importance": -15.486250877380371,
"rps_doc_wikipedia_importance_length_correction": -15.486250877380371
},
"fasttext": {
"dclm": 0.2605026364326477,
"english": 0.8875982165336609,
"fineweb_edu_approx": 1.5223515033721924,
"eai_general_math": 0.007397890090942383,
"eai_open_web_math": 0.031055329367518425,
"eai_web_code": 0.06910836696624756
}
}
|
{
"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.3",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,594,851,690,846,350,000 |
关闭
如何更高效的使用MVP以及官方MVP架构解析
标签： 设计模式androidmvp架构
21670人阅读 评论(22) 收藏 举报
分类：
转载请标明出处：
http://blog.csdn.net/dantestones/article/details/51445208
Android mvp 架构的自述中我简单的介绍了mvp，以及怎么写mvp。我自己也将mvp运用到了项目中，其实mvp并没有固定的写法，正确的去理解架构的思想，都可以有自己独特的mvp写法。git上也有很多例子，比如google的android-architecture，simple哥的Android 源码设计模式解析与实战中也有mvp的讨论。这里参考了simple哥做了一个通用版的mvp，并对google的MVP做了一点自己的解析。
关于presenter一直持有Activity对象导致的内存泄漏问题
只要用过mvp这个问题可能很多人都知道。写mvp的时候，presenter会持有view，如果presenter有后台异步的长时间的动作，比如网络请求，这时如果返回退出了Activity，后台异步的动作不会立即停止，这里就会有内存泄漏的隐患，所以会在presenter中加入一个销毁view的方法。现在就在之前的项目中做一下修改
//presenter中添加mvpView 置为null的方法
public void onDestroy(){
mvpView = null;
}
//退出时销毁持有Activity
@Override
protected void onDestroy() {
mvpPresenter.onDestroy();
super.onDestroy();
}
presenter中增加了类似的生命周期的方法，用来在退出Activity的时候取消持有Activity。
但是在销毁后需要思考一点，后台的延时操作返回时，这个时候view被销毁了，如果接着去调用view的方法就 会抛出空指针异常。所以在后台的延时操作中需要考虑到这种可能产生空指针的情况，尤其是网络请求。
BasePresenter
如果每一个Activity都需要做绑定和解绑操作就太麻烦了，现在我希望可以有一个通用的presenter来为我们添加view的绑定与销毁。
public abstract class BasePresenter<T> {
public T mView;
public void attach(T mView) {
this.mView = mView;
}
public void dettach() {
mView = null;
}
}
因为不能限定死传入的View，所以使用泛型来代替传入的对象。通过这个通用的presenter我就可以把原来的MvpPresenter简化成下面的样子
public class NewMvpPresenter extends BasePresenter<NewMvpView> {
private RequestBiz requestBiz;
private Handler mHandler;
public NewMvpPresenter() {
requestBiz = new RequestBiziml();
mHandler = new Handler(Looper.getMainLooper());
}
public void onResume(){
requestBiz.requestForData(new OnRequestListener() {
@Override
public void onSuccess(final List<String> data) {
mHandler.post(new Runnable() {
@Override
public void run() {
mView.hideLoading();
mView.setListItem(data);
}
});
}
@Override
public void onFailed() {
mView.showMessage("请求失败");
}
});
}
public void onItemClick(int position){
mView.showMessage("点击了item"+position);
}
}
BaseView
界面需要提供的UI方法中会有很多类似的UI方法，可以把它们提取到一个公共的父类接口中。比如提取显示loading界面和隐藏loading界面的方法，其他的view层接口就可以直接继承BaseView接口，不必重复的写显示和隐藏loading界面方法。
public interface BaseView {
void showLoading();
void hideLoading();
}
BaseMvpActivity
presenter绑定到activity和View的绑定和解绑操作是每个Activity都会去做的，同样这里我也希望能有一个父类来完成这个统一的操作。
public abstract class BaseMvpActivity<V,T extends BasePresenter<V>> extends AppCompatActivity {
public T presenter;
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
presenter = initPresenter();
}
@Override
protected void onResume() {
super.onResume();
presenter.attach((V)this);
}
@Override
protected void onDestroy() {
presenter.dettach();
super.onDestroy();
}
// 实例化presenter
public abstract T initPresenter();
}
同样使用泛型来提取通用的逻辑，presenter的初始化，以及view的绑定和解绑操作都提取到父类Activity中。向外部提供了一个 initPresenter(); 方法用来初始化presenter，如果想创建不同参数的构造函数都可以随意去创建。
更加通用的例子
通过上面的base父类，对之前的例子进行优化，写一个更加好用的例子。
• NewMvpView 继承BaseView接口，添加自己的初始化ListView和Toast信息方法
public interface NewMvpView extends BaseView {
void setListItem(List<String> data);
void showMessage(String message);
}
• NewMvpPresenter 继承BasePresenter类，增加网络请求和处理点击事件的方法
public class NewMvpPresenter extends BasePresenter<NewMvpView> {
private RequestBiz requestBiz;
private Handler mHandler;
public NewMvpPresenter() {
requestBiz = new RequestBiziml();
mHandler = new Handler(Looper.getMainLooper());
}
public void onResume(){
requestBiz.requestForData(new OnRequestListener() {
@Override
public void onSuccess(final List<String> data) {
mHandler.post(new Runnable() {
@Override
public void run() {
mView.hideLoading();
mView.setListItem(data);
}
});
}
@Override
public void onFailed() {
mView.showMessage("请求失败");
}
});
}
public void onItemClick(int position){
mView.showMessage("点击了item"+position);
}
}
• NewMvpActivity
public class NewMvpActivity extends BaseMvpActivity<NewMvpView,NewMvpPresenter> implements NewMvpView,AdapterView.OnItemClickListener{
ListView mvpListView;
ProgressBar pb;
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_mvp);
mvpListView = (ListView)findViewById(R.id.mvp_listview);
mvpListView.setOnItemClickListener(this);
pb = (ProgressBar) findViewById(R.id.mvp_loading);
}
@Override
protected void onResume() {
super.onResume();
presenter.onResume();
}
@Override
public NewMvpPresenter initPresenter() {
return new NewMvpPresenter();
}
@Override
public void onItemClick(AdapterView<?> parent, View view, int position, long id) {
presenter.onItemClick(position);
}
@Override
public void setListItem(List<String> data) {
ArrayAdapter adapter = new ArrayAdapter(this,android.R.layout.simple_list_item_1,data);
mvpListView.setAdapter(adapter);
}
@Override
public void showMessage(String message) {
Toast.makeText(this,message,Toast.LENGTH_SHORT).show();
}
@Override
public void showLoading() {
pb.setVisibility(View.VISIBLE);
}
@Override
public void hideLoading() {
pb.setVisibility(View.GONE);
}
}
最终的成果，我们只需要在Acitivity中传入泛型对象，并写好initPresenter() Presenter的初始化的方法就可以直接去使用presenter，当然View的接口还是要自己去实现。
以上的方法只是一些比较简单的封装，下面来看看官方的MVP架构是怎么写的。
官方的MVP架构
先来看看官方的代码目录(这里只是功能模块的目录，不包括测试模块，毕竟这里分析的是官方的实现代码)
这里写图片描述
谷歌的todomvp工程实现了一个类似记事本的功能，整体的目录结构：
• tasks 包可以显示任务列表
• taskdetail包显示任务详情
• addedittask包添加和编辑任务
• statistics包用来显示任务的完成情况
• data包数据模块对应mvp的M
• Util包就是通用的方法。
这里todomvp也有BasePresenter和BaseView2个基类，不过看的出来这2个都是接口。先来看看这2个接口
public interface BasePresenter {
void start();
}
public interface BaseView<T> {
void setPresenter(T presenter);
}
各自简单的声明了一个方法，start()方法用来给Presenter做一些初始化的操作不用特别在意，BaseView声明的方法就很有意思了，setPresenter(T presenter) 很明显是给View绑定Presenter，而前文我们使用的方式给Presenter传入View的方式来完成View和Presenter绑定的操作，这里谷歌采用了相反的方式来操作，为什么呢？
先把这个问题留下，看看单个模块的具体的文件结构。
这里写图片描述
有Activity，Fragment，Presenter，View哪里去了？ 其实谷歌的mvp是将Fragment作为View层来实现的，这一点在官方的Readme中也有说明，为什么要用Fragment？
官方认为Fragement和Activity相比更像是MVP中的的View层，刚好可以满足MVP的View层的要求，Activity则作为最高指挥官用来创建和联系View和Presenter。
Fragment在平板或者屏幕上有多个View时更有优势
Activity只作为创建和联系View和PresenterView而存在，将Fragment作为显示UI而存在。Activity主指挥，Fragment主显示。这也是谷歌的sample中的一贯做法。
View的问题解释完了，再看看TaskDetailContract 这种**Contract 接口，这也是官方独有的管理方法
Contract
google的todomvp 工程中每个模块都会有一个 **Contract 接口，来看看他的代码
public interface TaskDetailContract {
interface View extends BaseView<Presenter> {
void setLoadingIndicator(boolean active);
void showMissingTask();
void hideTitle();
void showTitle(String title);
void hideDescription();
void showDescription(String description);
void showCompletionStatus(boolean complete);
void showEditTask(String taskId);
void showTaskDeleted();
void showTaskMarkedComplete();
void showTaskMarkedActive();
boolean isActive();
}
interface Presenter extends BasePresenter {
void editTask();
void deleteTask();
void completeTask();
void activateTask();
}
}
Contract其实就是一个包涵了Presenter和View的接口，Presenter实现的逻辑层方法，View实现的UI层的方法都能在Contract接口中一目了然的看明白，具体的Presenter和View的实现类都是通过实现Contract接口来完成。这种方式既方便了管理和维护，也给开发点了一个导航灯。
下面来看看Presenter如何引用到Fragment中以及View如何与Presenter建立联系
TaskDetailActivity
/**
* Displays task details screen.
*/
public class TaskDetailActivity extends AppCompatActivity {
public static final String EXTRA_TASK_ID = "TASK_ID";
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.taskdetail_act);
// Set up the toolbar.
//.... 设置toolbar 代码省略
// Get the requested task id
String taskId = getIntent().getStringExtra(EXTRA_TASK_ID);
// 实例化taskDetailFragment
TaskDetailFragment taskDetailFragment = (TaskDetailFragment) getSupportFragmentManager()
.findFragmentById(R.id.contentFrame);
if (taskDetailFragment == null) {
//taskDetailFragment 添加到Activity
taskDetailFragment = TaskDetailFragment.newInstance(taskId);
ActivityUtils.addFragmentToActivity(getSupportFragmentManager(),
taskDetailFragment, R.id.contentFrame);
}
// Create the presenter 初始化Presenter
new TaskDetailPresenter(taskId，Injection.provideTasksRepository(getApplicationContext()),
taskDetailFragment);
}
..... 省去不重要代码
TaskDetailActivity主要做了taskDetailFragment 初始化和TaskDetailPresenter的初始化操作，在做TaskDetailPresenter初始化时直接将taskDetailFragment作为参数传入，因为taskDetailFragment实现了View层的接口，看到这里有一个疑问，new TaskDetailPresenter()可以实例化一个Presenter，但是怎么传入到taskDetailFragment中呢？为了解开疑惑我查看了TaskDetailPresenterde 构造方法
public class TaskDetailPresenter implements TaskDetailContract.Presenter {
//....省去不重要的变量声明
public TaskDetailPresenter(@Nullable String taskId,
@NonNull TasksRepository tasksRepository,
@NonNull TaskDetailContract.View taskDetailView) {
this.mTaskId = taskId;
mTasksRepository = checkNotNull(tasksRepository, "tasksRepository cannot be null!");
mTaskDetailView = checkNotNull(taskDetailView, "taskDetailView cannot be null!");
//实现绑定Presenter的关键方法
mTaskDetailView.setPresenter(this);
}
关键方法就是在BaseView中声明的void setPresenter(T presenter); 方法实现的绑定，当然这里只是调用View的方法，具体的绑定还要追踪到实体类中，来看TaskDetailFragment
TaskDetailFragment
public class TaskDetailFragment extends Fragment implements TaskDetailContract.View {
......省去不重要代码
//声明了一个mPresenter
private TaskDetailContract.Presenter mPresenter;
public View onCreateView(LayoutInflater inflater, ViewGroup container, Bundle savedInstanceState) {
View root = inflater.inflate(R.layout.taskdetail_frag, container, false);
....省去初始化代码
return root;
}
@Override
public void setPresenter(@NonNull TaskDetailContract.Presenter presenter) {
//完成mPresenter的绑定
mPresenter = checkNotNull(presenter);
}
.....
}
TaskDetailFragment 实现了TaskDetailContract接口中的View接口，这样在TaskDetailPresenter 构造方法中调用mTaskDetailView.setPresenter(this)方法后，TaskDetailFragment 的setPresenter也会调用，TaskDetailPresenter 就成功绑定到了TaskDetailFragment 中。
这种绑定方式也解释了上文提到的问题，为什么谷歌采用了相反的方式操作，就是为了这后面的绑定操作。
Acitivity对象内存泄漏的问题
谷歌的项目同样会有当有后台异步任务时可能导致Acitivity内存泄漏的问题。谷歌也有自己的处理方法，上面提到的TaskDetailContract 接口有声明一个方法 isActive()
public interface TaskDetailContract {
interface View extends BaseView<Presenter> {
....省去其他的方法
boolean isActive();
}
看看这方法的具体实现类
public class TaskDetailFragment extends Fragment implements TaskDetailContract.View {
.....
@Override
public boolean isActive() {
return isAdded();
}
isAdded()方法如果返回true代表Fragment添加到了Activity，false代表没有添加，通过调用isActive()方法就可以给后台异步任务添加判断避免内存泄漏。
UML结构图
到这里整体的架构就已经清楚了配上这张UML图可以更好的理解。
这里写图片描述
1. Activity最外层负责Presenter和View的创建和联系。
2. Fragment实现了View的接口并与Presenter绑定
3. Presenter从数据层中获取数据与View进行交互
google的todomvp不光给了我们一个mvp的架构演示，还附带了一个测试模块，整体的架构非常适合用来开发。强烈建议大家去github上下载源码来看看，效果更佳
相关代码
https://github.com/haibuzou/MVPSample
https://github.com/googlesamples/android-architecture/tree/todo-mvp/
14
0
查看评论
* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：69167次
• 积分：901
• 等级：
• 排名：千里之外
• 原创：22篇
• 转载：0篇
• 译文：0篇
• 评论：53条
最新评论
|
{
"url": "http://blog.csdn.net/dantestones/article/details/51445208",
"source_domain": "blog.csdn.net",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "87091",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GKR2YDZBGC7HA5C6557LNOMCPUGO24JS",
"WARC-Concurrent-To": "<urn:uuid:47eb26b7-7a5f-4770-9174-c741b8ba8a54>",
"WARC-Date": "2017-10-18T07:46:51Z",
"WARC-IP-Address": "47.95.49.160",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:DMYO2QEPH32NVKP5HKB6L33VXZ4PZ2QA",
"WARC-Record-ID": "<urn:uuid:62ee1597-bc90-45f9-81e1-5f7307c2ec29>",
"WARC-Target-URI": "http://blog.csdn.net/dantestones/article/details/51445208",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:afde20cd-c0b5-41c9-adf3-d8c32b8f0a68>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-203-171-252.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,
3,
4,
27,
28,
49,
71,
75,
76,
85,
143,
144,
364,
365,
400,
401,
566,
567,
599,
628,
648,
650,
651,
669,
679,
712,
746,
769,
771,
772,
826,
827,
927,
928,
942,
943,
1013,
1014,
1058,
1059,
1084,
1085,
1127,
1160,
1171,
1172,
1209,
1236,
1243,
1245,
1246,
1321,
1322,
1390,
1391,
1430,
1464,
1465,
1504,
1553,
1613,
1622,
1623,
1659,
1743,
1778,
1856,
1924,
1973,
2036,
2105,
2174,
2210,
2241,
2267,
2268,
2303,
2357,
2413,
2436,
2452,
2464,
2465,
2516,
2567,
2573,
2575,
2576,
2585,
2586,
2712,
2713,
2745,
2772,
2796,
2798,
2799,
2815,
2816,
2892,
2893,
2992,
2993,
3021,
3022,
3040,
3106,
3159,
3200,
3211,
3212,
3231,
3272,
3308,
3349,
3360,
3361,
3380,
3421,
3458,
3489,
3499,
3500,
3521,
3561,
3562,
3564,
3565,
3691,
3692,
3700,
3701,
3736,
3737,
3792,
3843,
3892,
3934,
3936,
3990,
4059,
4102,
4140,
4141,
4184,
4237,
4300,
4314,
4315,
4355,
4431,
4469,
4550,
4620,
4672,
4739,
4811,
4883,
4925,
4961,
4992,
4993,
5032,
5090,
5150,
5177,
5197,
5209,
5210,
5265,
5323,
5333,
5335,
5354,
5493,
5527,
5555,
5556,
5578,
5647,
5705,
5766,
5854,
5917,
5986,
5999,
6000,
6021,
6065,
6104,
6143,
6157,
6158,
6178,
6234,
6281,
6294,
6295,
6315,
6414,
6466,
6478,
6479,
6499,
6559,
6666,
6714,
6727,
6728,
6748,
6805,
6876,
6889,
6890,
6910,
6953,
7000,
7013,
7014,
7035,
7078,
7121,
7129,
7131,
7132,
7233,
7270,
7271,
7280,
7281,
7330,
7331,
7339,
7374,
7375,
7395,
7417,
7441,
7468,
7489,
7507,
7508,
7570,
7571,
7608,
7626,
7628,
7663,
7699,
7701,
7702,
7893,
7894,
7919,
7920,
7928,
7929,
8032,
8033,
8130,
8131,
8160,
8161,
8262,
8263,
8326,
8327,
8336,
8337,
8387,
8388,
8430,
8487,
8545,
8585,
8619,
8665,
8705,
8763,
8824,
8874,
8914,
8961,
9002,
9030,
9037,
9093,
9126,
9161,
9198,
9231,
9237,
9239,
9240,
9397,
9398,
9449,
9450,
9469,
9470,
9474,
9507,
9511,
9571,
9629,
9630,
9644,
9701,
9745,
9794,
9795,
9826,
9856,
9893,
9960,
9961,
9995,
10092,
10183,
10225,
10270,
10343,
10420,
10472,
10482,
10483,
10529,
10626,
10678,
10680,
10694,
10695,
10968,
10969,
11048,
11070,
11071,
11158,
11262,
11351,
11390,
11491,
11589,
11618,
11666,
11668,
11669,
11780,
11781,
11800,
11801,
11887,
11906,
11907,
11929,
11982,
11983,
12087,
12170,
12191,
12213,
12219,
12220,
12234,
12317,
12344,
12391,
12397,
12398,
12404,
12406,
12407,
12612,
12613,
12661,
12662,
12681,
12682,
12778,
12779,
12818,
12867,
12887,
12915,
12917,
12918,
12930,
12931,
13017,
13028,
13043,
13080,
13108,
13115,
13116,
13208,
13209,
13216,
13217,
13248,
13249,
13257,
13258,
13298,
13335,
13368,
13369,
13452,
13453,
13458,
13496,
13565,
13566,
13569,
13571,
13572,
13577,
13610,
13619,
13635,
13648,
13658,
13672,
13685,
13697,
13709,
13722
],
"line_end_idx": [
3,
4,
27,
28,
49,
71,
75,
76,
85,
143,
144,
364,
365,
400,
401,
566,
567,
599,
628,
648,
650,
651,
669,
679,
712,
746,
769,
771,
772,
826,
827,
927,
928,
942,
943,
1013,
1014,
1058,
1059,
1084,
1085,
1127,
1160,
1171,
1172,
1209,
1236,
1243,
1245,
1246,
1321,
1322,
1390,
1391,
1430,
1464,
1465,
1504,
1553,
1613,
1622,
1623,
1659,
1743,
1778,
1856,
1924,
1973,
2036,
2105,
2174,
2210,
2241,
2267,
2268,
2303,
2357,
2413,
2436,
2452,
2464,
2465,
2516,
2567,
2573,
2575,
2576,
2585,
2586,
2712,
2713,
2745,
2772,
2796,
2798,
2799,
2815,
2816,
2892,
2893,
2992,
2993,
3021,
3022,
3040,
3106,
3159,
3200,
3211,
3212,
3231,
3272,
3308,
3349,
3360,
3361,
3380,
3421,
3458,
3489,
3499,
3500,
3521,
3561,
3562,
3564,
3565,
3691,
3692,
3700,
3701,
3736,
3737,
3792,
3843,
3892,
3934,
3936,
3990,
4059,
4102,
4140,
4141,
4184,
4237,
4300,
4314,
4315,
4355,
4431,
4469,
4550,
4620,
4672,
4739,
4811,
4883,
4925,
4961,
4992,
4993,
5032,
5090,
5150,
5177,
5197,
5209,
5210,
5265,
5323,
5333,
5335,
5354,
5493,
5527,
5555,
5556,
5578,
5647,
5705,
5766,
5854,
5917,
5986,
5999,
6000,
6021,
6065,
6104,
6143,
6157,
6158,
6178,
6234,
6281,
6294,
6295,
6315,
6414,
6466,
6478,
6479,
6499,
6559,
6666,
6714,
6727,
6728,
6748,
6805,
6876,
6889,
6890,
6910,
6953,
7000,
7013,
7014,
7035,
7078,
7121,
7129,
7131,
7132,
7233,
7270,
7271,
7280,
7281,
7330,
7331,
7339,
7374,
7375,
7395,
7417,
7441,
7468,
7489,
7507,
7508,
7570,
7571,
7608,
7626,
7628,
7663,
7699,
7701,
7702,
7893,
7894,
7919,
7920,
7928,
7929,
8032,
8033,
8130,
8131,
8160,
8161,
8262,
8263,
8326,
8327,
8336,
8337,
8387,
8388,
8430,
8487,
8545,
8585,
8619,
8665,
8705,
8763,
8824,
8874,
8914,
8961,
9002,
9030,
9037,
9093,
9126,
9161,
9198,
9231,
9237,
9239,
9240,
9397,
9398,
9449,
9450,
9469,
9470,
9474,
9507,
9511,
9571,
9629,
9630,
9644,
9701,
9745,
9794,
9795,
9826,
9856,
9893,
9960,
9961,
9995,
10092,
10183,
10225,
10270,
10343,
10420,
10472,
10482,
10483,
10529,
10626,
10678,
10680,
10694,
10695,
10968,
10969,
11048,
11070,
11071,
11158,
11262,
11351,
11390,
11491,
11589,
11618,
11666,
11668,
11669,
11780,
11781,
11800,
11801,
11887,
11906,
11907,
11929,
11982,
11983,
12087,
12170,
12191,
12213,
12219,
12220,
12234,
12317,
12344,
12391,
12397,
12398,
12404,
12406,
12407,
12612,
12613,
12661,
12662,
12681,
12682,
12778,
12779,
12818,
12867,
12887,
12915,
12917,
12918,
12930,
12931,
13017,
13028,
13043,
13080,
13108,
13115,
13116,
13208,
13209,
13216,
13217,
13248,
13249,
13257,
13258,
13298,
13335,
13368,
13369,
13452,
13453,
13458,
13496,
13565,
13566,
13569,
13571,
13572,
13577,
13610,
13619,
13635,
13648,
13658,
13672,
13685,
13697,
13709,
13722,
13730
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13730,
"ccnet_original_nlines": 426,
"rps_doc_curly_bracket": 0.0077203200198709965,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.019897300750017166,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021822849288582802,
"rps_doc_frac_lines_end_with_ellipsis": 0.004683840088546276,
"rps_doc_frac_no_alph_words": 0.5025674104690552,
"rps_doc_frac_unique_words": 0.48599672317504883,
"rps_doc_mean_word_length": 14.698516845703125,
"rps_doc_num_sentences": 89,
"rps_doc_symbol_to_word_ratio": 0.005776640027761459,
"rps_doc_unigram_entropy": 5.053083419799805,
"rps_doc_word_count": 607,
"rps_doc_frac_chars_dupe_10grams": 0.10894417762756348,
"rps_doc_frac_chars_dupe_5grams": 0.17933198809623718,
"rps_doc_frac_chars_dupe_6grams": 0.1699170619249344,
"rps_doc_frac_chars_dupe_7grams": 0.1416722685098648,
"rps_doc_frac_chars_dupe_8grams": 0.10894417762756348,
"rps_doc_frac_chars_dupe_9grams": 0.10894417762756348,
"rps_doc_frac_chars_top_2gram": 0.021295670419931412,
"rps_doc_frac_chars_top_3gram": 0.024209819734096527,
"rps_doc_frac_chars_top_4gram": 0.011768659576773643,
"rps_doc_books_importance": -776.8834838867188,
"rps_doc_books_importance_length_correction": -776.8834838867188,
"rps_doc_openwebtext_importance": -400.97027587890625,
"rps_doc_openwebtext_importance_length_correction": -400.97027587890625,
"rps_doc_wikipedia_importance": -358.7389221191406,
"rps_doc_wikipedia_importance_length_correction": -358.7389221191406
},
"fasttext": {
"dclm": 0.912138819694519,
"english": 0.08601275086402893,
"fineweb_edu_approx": 2.839816093444824,
"eai_general_math": 0.036834899336099625,
"eai_open_web_math": 0.003984389826655388,
"eai_web_code": 0.9068101048469543
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,500,881,821,080,398,000 |
What is meta? ×
Meta Stack Exchange is where users like you discuss bugs, features, and support issues that affect the software powering all 133 Stack Exchange communities.
Currently, Stack Exchange’s Markdown parser only allows four-space indents to represent code blocks:
// some code
// another line of code
GitHub Flavored Markdown and other Markdown implementations allow for an alternative syntax, that doesn’t require indenting each code line:
```
// some code
// another line of code
```
This is much more convenient to type out. It would be super useful if Stack Exchange could support this syntax.
By extension, this syntax also allow you to specify the source language right after the opening ```:
```js
// some code
// another line of code
```
…which would then enable syntax highlighting for that specific language. Although it’s interesting metadata, I don’t think this feature is needed on Stack Overflow, as the syntax highlighting library works pretty well for various languages.
So, even if you would allow this syntax but ignore the ```language, this would greatly improve my productivity on Stack Exchange.
What do you think?
The moderators are currently collecting feedback regarding this feature, so please post a comment with your thoughts. Good idea? Bad idea? Don’t really care? What do you think are the benefits/drawbacks? Experiences? Let them know! Thanks!
share|improve this question
36
+1 I think this would be great. Not having to worry about an extra 4-space indent when editing code the textbox would make it less necessary to pull it out into an external editor and then paste it back in. – cdeszaq Mar 9 '12 at 13:20
1
Yes, I am aware of this, but for editing existing code, it would make things easier. – cdeszaq Mar 9 '12 at 13:23
7
@BoltClock'saUnicorn: This feature wouldn't be intended for people who accidentally stumble across it, but for people who actually know it's there and find it is a more convenient method of posting code than indenting by four spaces (I would probably use it). – Greg Hewgill Mar 9 '12 at 20:35
4
+1 This also makes it easier to edit posts that forgot code blocks. – Tom Wijsman Mar 10 '12 at 6:14
13
This is a reasonable suggestion, we're considering it. A nice side effect would be that this kind of code block wouldn't have a "placed after a list" problem. – balpha Mar 11 '12 at 15:33
2
When adding it, please consider handling four-backtick "fences" just like the regular three-backtick fences. On a German keyboard it's extremely annoying to enter an odd number of backticks since it's a deadkey and you cannot change it without side-effects. – ThiefMaster May 17 '12 at 10:03
1
@Tom: selecting code and pressing Ctrl+K (or the {} button in editor toolbar) seems easier than typing backticks six times at two different places. – BalusC Aug 9 '12 at 14:56
1
@Chichiray: Clicking is easier than dragging as the latter requires you to aim such that you select the text right, and ` is a single key where Ctrl+K is not; as a result click ``` click ``` is faster to perform. – Tom Wijsman Aug 9 '12 at 15:31
2
I can't count how many times I've gone through and put 4 spaces on the clipboard, then flew down the lines of code repeatedly hitting Ctrl+V, DownArrow, Home to indent the entire block. – gobernador Aug 9 '12 at 17:38
2
@gobernador what text editor are you using?, it is usually possible to indent the whole thing if it is selected and then insert some tabs. Or in the editor of this site, just select the whole thing and click the 'code' icon and will indent for you – ajax333221 Aug 9 '12 at 22:58
1
6
Any update on this, it's nearly a year! – Pineapple Under the Sea Jul 17 '13 at 20:03
1
Seems like the community has spoken here and would like to see it implemented. Coming up on a year now, is it gonna happen? – jcollum Jul 25 '13 at 15:56
1
Is there something we can do to make this happen? – Alan H. Feb 20 at 19:50
3
+1 Please implement this. It's really inconvenient to add 4 spaces (not even a tab) for each line of code I write in SO. – raviolicode Mar 10 at 13:05
6 Answers 6
Benefits
• Compatibility with GitHub-Flavored Markdown and other Markdown libraries that support this de facto standard (and possibly its variants). This enables copy-pasting from gists or Markdown files within repositories, which can be useful on programming-related sites like Stack Overflow.
• The triple backtick syntax is easier and faster to type than indenting each line of code with four spaces.
• Saves some storage in the database, too! ;)
All the above benefits apply to the new syntax, even without the additional functionality to specify the programming language. With that functionality, I’ll add another (huge) benefit:
• As it’s much easier to specify the language of code blocks using this syntax (compared to the current syntax), I wouldn’t be surprised if this change caused more people to explicitly declare the programming language, so that the syntax highlighting can be more accurate. This is useful for answers that include, e.g. separate HTML and CSS code blocks.
Drawbacks
I honestly can’t think of any. It’s very likely no one is using the triple backtick-syntax at the moment as it doesn’t work; so I doubt it will break anything. If you don’t like the new syntax, feel free to stick to the old one.
Experiences
Ever since GitHub enabled this syntax, I’ve grown accustomed to it. I ♥ triple backtick syntax, and every time I’m forced to go back to the four-space-indent syntax, it feels awkward.
share|improve this answer
6
159 places have a triple-backtick (I was scared to search for a double-backtick, though): data.stackexchange.com/stackoverflow/query/edit/76842 As far as I can tell, none of them would be broken by implementing this. – U2744 SNOWFLAKE Aug 9 '12 at 15:20
1
@minitech Thanks for the query. I see a few that might cause problems, but with just 159 results it's not beyond the realm of possibility to manually verify that each one is correct, or is fixed, if this were implemented. – Servy Aug 9 '12 at 15:23
I don't really care either way whether this gets implemented: it's a superfluous extension to Markdown (unlike, say, inline HTML, spoiler markdown, or the as-yet-unimplemented-on-Stack-Exchange table syntax), but it is true the fenced code block has been added to pretty much every Markdown library that doesn't stick to just the original spec.
However, the triple backtick syntax is a GitHub extension, and it's not exactly the "de facto standard" Mathias Bynens portrays it as.
Fenced code blocks, as far as I understand it, were first introduced in the PHP Markdown Extra library as the following:
Fenced code blocks are like Markdown’s regular code blocks, except that they’re not indented and instead rely on a start and end fence lines to delimit the code block. The code block start with a line containing three or more tilde ~ characters, and ends with the first line with the same number of tilde ~. For instance:
This is a paragraph introducing:
~~~~~~~~~~~~~~~~~~~~~
a one-line code block
~~~~~~~~~~~~~~~~~~~~~
Other implementations followed suit, by either supporting only 3+ tildes or supporting both 3+ tildes and 3+ backticks. I ran through the implementations I know of, and Wikipedia's (incomplete) list of implementations (before GitHub went down), and found:
Supports only the 3+ tilde syntax:
Supports only the triple backtick syntax:
Supports both:
Supports neither, or is unspecified:
Based on this, I think Stack Exchange should support the tilde syntax, the triple backtick syntax, and the 3+ backtick syntax. Bonus: support of either the tilde syntax or the 3+ backtick syntax should solve the deadkey problem.
The syntax toolbar should continue to indent code with 4 spaces as per the original Markdown spec, or if that's not feasible, it should use the tilde syntax, which has the benefits of being the original version, compatible with GitHub, and marginally more supported by existing implementations.
share|improve this answer
3
Excellent research! Good point about supporting all variants of the syntax to eliminate the dead key problem. – Mathias Bynens Aug 16 '12 at 8:09
2
Thanks for the great research. I'm still not 100% sure we should do it, but this answer contains excellent information to base a decision on. – balpha Aug 17 '12 at 9:49
2
«Bonus: support of either the tilde syntax or the 3+ backtick syntax should solve the deadkey problem.»: while I agree with you say, this last one is false. In my standard Portuguese keyboard, both `` ` `` and ~ are deadkeys. – JMCF125 Feb 16 at 18:49
1
Both tilde and backtick is dead keys on Swedish keyboards too. – Emil Vikström Apr 2 at 18:00
You can currently specify a language to be syntax-highlighted.
Example:
<!-- language: lang-js -->
//JS code...
This should not discourage the question, it is even a plus because they don't need to code this feature anymore.
The only thing left to do is to implement the ```` code blocks system (which I believe, is not that hard)
share|improve this answer
Good to know — thanks! Sounds like a regular expression that converts the triple backtick-syntax into the existing syntax behind the curtains could be a quick fix. – Mathias Bynens Mar 10 '12 at 8:14
9
This is not as nice than the triple-backtick syntax though. – ThiefMaster Mar 23 '12 at 7:26
github supports the same using ```php for example – pocesar Apr 11 '13 at 20:35
Only drawback I could see is being unclear as to which is the 'right way'. But on a whole I think this would be a great feature to add for someone like me who doesn't want to be using either the button above or spacing in.
share|improve this answer
But there is not "right way". All ways that works are correct. – Emil Vikström Apr 2 at 18:01
On Stack Overflow, all the time I'm seeing this happen to people who don't know the syntax.
class Foo {
public static void main(String[] args) {
// y my code no is working
Sytem.out.println(qrew3r);
}
}
Some people stop there and never fix it because it's close enough. Others figure out that the first and last lines aren't part of the code block because they're not indented. So they indent those two lines - only those two lines - because the editor doesn't provide an apparent way to indent the whole block.
class Foo {
public static void main(String[] args) {
// y my code no is working
Sytem.out.println(qrew3r);
}
}
The result is that we have a site that systematically causes newbs to post questions with poorly-formatted code. Whether or not you like fenced code blocks, when you look at all of the mistakes that users are making, you've got to appreciate that the current UX is broken.
share|improve this answer
The main benefit I see coming from this is that you'll be able to see a little more of the code in the edit box without wrapping. Making it a little easier to specify language is nice too, but I find that the tags take care of it in a large majority of cases.
I'm certainly not opposed, but I don't think it will make fixing code formatting that much easier. You can already select the lines and hit the Code Sample button to add the first level of indent. From there on it's the same amount of work to add additional indents--either copy four spaces and use CTRL-V as a tab key for each line, or copy into editor, fix, and copy back. I think being able to select multiple lines and indent/unindent multiple times would be a lot more helpful than this.
On the downside, ``` would be one of the least intuitive bits of markdown. Doesn't really have the same WYSIWYG feel, at least for me. Using the same sequence to start and end the formatted section could also be a bit confusing, particularly when there are multiple code blocks in a post.
Something like {{{ to start and }}} to end would be clearer, or a custom html tag like, <codeblock></codeblock>, or just allow the <code> tag to span multiple lines to create a block. Or, combine with specifying the language, for example: <java></java>.
share|improve this answer
It's a big help when you have mixed tabs and spaces, too. – U2744 SNOWFLAKE Aug 9 '12 at 15:36
2
@bemace I know you can select the lines and then hit the Code button, but as a heavy keyboard user, I find typing three backticks, a line break, Cmd + V, another line break, and three closing backticks is much faster. – Mathias Bynens Aug 9 '12 at 15:36
I like the thought of the language tags <java></java>. – gobernador Aug 9 '12 at 17:35
3
But why invent a new syntax when several existing Markdown implementations already support the triple backtick syntax? Interoperability (and copy-pastability) with other Markdown flavors is a big plus IMHO! – Mathias Bynens Aug 9 '12 at 19:05
@MathiasBynens as I explained, with multiple code blocks delimited by ``` separated by a line or two of text (as is common on Stack Overflow) it could get very confusing trying to determine which ``` are starting a code block, and which are ending a code block-- or rather, which lines are code and which are text. – Brad Mace Aug 9 '12 at 19:08
1
@bemace There would be no confusion if the existing Markdown implementations that support this syntax are followed. Triple backtick code blocks need two line breaks before and after (unless they’re at the start or end of the input). – Mathias Bynens Aug 16 '12 at 8:06
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
{
"url": "http://meta.stackexchange.com/questions/125148/implement-style-markdown-code-blocks/142862",
"source_domain": "meta.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "134145",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GJXI2GA6QS5MPOODOVNUIA2XDI5GKXJI",
"WARC-Concurrent-To": "<urn:uuid:52b09a9b-da13-49db-985b-5ab7e199926f>",
"WARC-Date": "2014-12-21T02:55:20Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KM4QSUBKH743TPMDYEC2VHXNQMDF5F3U",
"WARC-Record-ID": "<urn:uuid:5f224b61-9024-4a2a-9438-363b40aa41ef>",
"WARC-Target-URI": "http://meta.stackexchange.com/questions/125148/implement-style-markdown-code-blocks/142862",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a6950a80-4765-4378-a7e4-79a56fe8f50f>"
},
"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,
16,
173,
174,
275,
276,
289,
313,
314,
454,
455,
459,
472,
496,
500,
501,
613,
614,
615,
716,
717,
723,
736,
760,
764,
765,
1006,
1007,
1137,
1138,
1157,
1158,
1398,
1399,
1427,
1432,
1669,
1673,
1788,
1792,
2087,
2091,
2193,
2198,
2387,
2391,
2684,
2688,
2865,
2869,
3116,
3120,
3339,
3343,
3624,
3628,
3632,
3719,
3723,
3878,
3882,
3959,
3963,
4115,
4116,
4128,
4129,
4138,
4139,
4427,
4538,
4586,
4587,
4772,
4773,
5129,
5130,
5140,
5141,
5370,
5371,
5383,
5384,
5568,
5569,
5595,
5599,
5854,
5858,
6108,
6109,
6454,
6455,
6590,
6591,
6712,
6713,
7035,
7036,
7069,
7070,
7092,
7114,
7136,
7137,
7393,
7394,
7429,
7430,
7472,
7473,
7488,
7489,
7526,
7527,
7756,
7757,
8052,
8053,
8079,
8083,
8230,
8234,
8405,
8409,
8662,
8666,
8761,
8762,
8825,
8826,
8835,
8836,
8863,
8864,
8881,
8882,
8995,
8996,
9102,
9103,
9129,
9134,
9335,
9339,
9433,
9438,
9519,
9520,
9743,
9744,
9770,
9775,
9870,
9871,
9963,
9964,
9976,
9977,
10018,
10049,
10080,
10082,
10083,
10085,
10086,
10395,
10396,
10408,
10409,
10450,
10481,
10512,
10514,
10516,
10517,
10790,
10791,
10817,
10818,
11078,
11079,
11572,
11573,
11862,
11863,
12117,
12118,
12144,
12149,
12245,
12249,
12504,
12509,
12597,
12601,
12845,
12850,
13197,
13201,
13471,
13472,
13513,
13514
],
"line_end_idx": [
16,
173,
174,
275,
276,
289,
313,
314,
454,
455,
459,
472,
496,
500,
501,
613,
614,
615,
716,
717,
723,
736,
760,
764,
765,
1006,
1007,
1137,
1138,
1157,
1158,
1398,
1399,
1427,
1432,
1669,
1673,
1788,
1792,
2087,
2091,
2193,
2198,
2387,
2391,
2684,
2688,
2865,
2869,
3116,
3120,
3339,
3343,
3624,
3628,
3632,
3719,
3723,
3878,
3882,
3959,
3963,
4115,
4116,
4128,
4129,
4138,
4139,
4427,
4538,
4586,
4587,
4772,
4773,
5129,
5130,
5140,
5141,
5370,
5371,
5383,
5384,
5568,
5569,
5595,
5599,
5854,
5858,
6108,
6109,
6454,
6455,
6590,
6591,
6712,
6713,
7035,
7036,
7069,
7070,
7092,
7114,
7136,
7137,
7393,
7394,
7429,
7430,
7472,
7473,
7488,
7489,
7526,
7527,
7756,
7757,
8052,
8053,
8079,
8083,
8230,
8234,
8405,
8409,
8662,
8666,
8761,
8762,
8825,
8826,
8835,
8836,
8863,
8864,
8881,
8882,
8995,
8996,
9102,
9103,
9129,
9134,
9335,
9339,
9433,
9438,
9519,
9520,
9743,
9744,
9770,
9775,
9870,
9871,
9963,
9964,
9976,
9977,
10018,
10049,
10080,
10082,
10083,
10085,
10086,
10395,
10396,
10408,
10409,
10450,
10481,
10512,
10514,
10516,
10517,
10790,
10791,
10817,
10818,
11078,
11079,
11572,
11573,
11862,
11863,
12117,
12118,
12144,
12149,
12245,
12249,
12504,
12509,
12597,
12601,
12845,
12850,
13197,
13201,
13471,
13472,
13513,
13514,
13580
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13580,
"ccnet_original_nlines": 203,
"rps_doc_curly_bracket": 0.001178200007416308,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3883594274520874,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020081689581274986,
"rps_doc_frac_lines_end_with_ellipsis": 0.004901960026472807,
"rps_doc_frac_no_alph_words": 0.2368958443403244,
"rps_doc_frac_unique_words": 0.3181225657463074,
"rps_doc_mean_word_length": 4.5367231369018555,
"rps_doc_num_sentences": 115,
"rps_doc_symbol_to_word_ratio": 0.0006807399913668633,
"rps_doc_unigram_entropy": 5.757195949554443,
"rps_doc_word_count": 2301,
"rps_doc_frac_chars_dupe_10grams": 0.028163619339466095,
"rps_doc_frac_chars_dupe_5grams": 0.06772679090499878,
"rps_doc_frac_chars_dupe_6grams": 0.058913689106702805,
"rps_doc_frac_chars_dupe_7grams": 0.04119168967008591,
"rps_doc_frac_chars_dupe_8grams": 0.028163619339466095,
"rps_doc_frac_chars_dupe_9grams": 0.028163619339466095,
"rps_doc_frac_chars_top_2gram": 0.008429929614067078,
"rps_doc_frac_chars_top_3gram": 0.006705619860440493,
"rps_doc_frac_chars_top_4gram": 0.008429929614067078,
"rps_doc_books_importance": -1510.2813720703125,
"rps_doc_books_importance_length_correction": -1510.2813720703125,
"rps_doc_openwebtext_importance": -968.9475708007812,
"rps_doc_openwebtext_importance_length_correction": -968.9475708007812,
"rps_doc_wikipedia_importance": -704.8582763671875,
"rps_doc_wikipedia_importance_length_correction": -704.8582763671875
},
"fasttext": {
"dclm": 0.16274935007095337,
"english": 0.9074297547340393,
"fineweb_edu_approx": 1.5212880373001099,
"eai_general_math": 0.8850733041763306,
"eai_open_web_math": 0.3868752121925354,
"eai_web_code": 0.10760623216629028
}
}
|
{
"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": "025.04",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "Library science",
"level_3": "Library administration"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"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
|
-5,485,571,340,249,424,000 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I have a little alloy specification as follows:
sig class {parents : set class}
fact f1{all p:class | not p in p.^parents}
run{} for exactly 4 class
First, I thought alloy would translate f1 into boolean matrix, then perform closure operation on it. But it seems it does not do this kind of translation (it looks like it runs something before boolean matrix creation.). So how exactly this f1 gets translated? Does it use relation predicate? I am just very curious about alloy's translation.
share|improve this question
add comment
1 Answer
up vote 3 down vote accepted
Boolean matrices are used to represent expression in Alloy. So, you start with a unary matrix for each sig, a binary matrix for each binary relation, a ternary matrix for each ternary relation, and so on. Then, translation of "complex" expression (e.g., involving relational algebra operators) is done by manipulating (composing) those matrices you started with. For each Alloy operator (e.g., transitive closure (^), relational join (.), in, not, etc.) there is a corresponding algorithm that performs a bunch of matrix operations such that the semantics of that operator is correctly implemented.
So in this example, the all quantifier is first unrolled, meaning that for each atom p of type class the body is translated (something like:
• m0 = matrix(p) //returns matrix corresponding to p
• m1 = matrix(parents) //returns matrix corresponding to parents
• m2 = ^m1
• m3 = m0.m2
• m4 = m0 in m3
• m5 = not m4
), and finally, all those body translations are AND'ed.
share|improve this answer
thanks...it is much clear now. – user1197891 Jan 25 '13 at 23:05
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/14526916/alloys-formula-translation",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "62198",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CHL6SKV6LAAWID4FOD2LI5JKYYCADQB7",
"WARC-Concurrent-To": "<urn:uuid:442a7db1-51fb-48fc-8a7b-7bd130408066>",
"WARC-Date": "2014-04-17T14:07:35Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5UUYZIHXVJNUXTZRUYZDF2FQYXYUSJYD",
"WARC-Record-ID": "<urn:uuid:ea6c3e47-011e-4cf2-ad04-7c6a9a958059>",
"WARC-Target-URI": "http://stackoverflow.com/questions/14526916/alloys-formula-translation",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e774f22b-014e-41e3-8242-ae357b226dca>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-4-33.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-15\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for April 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
206,
207,
239,
282,
308,
309,
652,
653,
681,
693,
694,
703,
704,
733,
734,
1333,
1334,
1475,
1476,
1531,
1598,
1611,
1626,
1644,
1660,
1661,
1717,
1718,
1744,
1749,
1815,
1827,
1828,
1840,
1841,
1843,
1851,
1852,
1930,
1931
],
"line_end_idx": [
25,
157,
158,
206,
207,
239,
282,
308,
309,
652,
653,
681,
693,
694,
703,
704,
733,
734,
1333,
1334,
1475,
1476,
1531,
1598,
1611,
1626,
1644,
1660,
1661,
1717,
1718,
1744,
1749,
1815,
1827,
1828,
1840,
1841,
1843,
1851,
1852,
1930,
1931,
2021
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2021,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0.002968830056488514,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35781991481781006,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009478669613599777,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2369668185710907,
"rps_doc_frac_unique_words": 0.5714285969734192,
"rps_doc_mean_word_length": 4.822981357574463,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.0023696699645370245,
"rps_doc_unigram_entropy": 4.970126152038574,
"rps_doc_word_count": 322,
"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.022537030279636383,
"rps_doc_frac_chars_top_3gram": 0.025112690404057503,
"rps_doc_frac_chars_top_4gram": 0.036059241741895676,
"rps_doc_books_importance": -187.92823791503906,
"rps_doc_books_importance_length_correction": -187.92823791503906,
"rps_doc_openwebtext_importance": -103.3502197265625,
"rps_doc_openwebtext_importance_length_correction": -103.3502197265625,
"rps_doc_wikipedia_importance": -57.845272064208984,
"rps_doc_wikipedia_importance_length_correction": -57.845272064208984
},
"fasttext": {
"dclm": 0.6650845408439636,
"english": 0.8972522616386414,
"fineweb_edu_approx": 2.063420057296753,
"eai_general_math": 0.0372433103621006,
"eai_open_web_math": 0.42856353521347046,
"eai_web_code": 0.001514730043709278
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,070,200,328,231,132,700 |
Bài giảng Chapter 5: Selection Statements
Tài liệu Bài giảng Chapter 5: Selection Statements: Chapter 5Selection Statements©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Chapter 5 ObjectivesAfter you have read and studied this chapter, you should be able toImplement selection control in a program by using if statements.Implement selection control in a program by using switch statements.Write boolean expressions with relational and boolean operators.Evaluate given boolean expressions correctly.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Chapter 5 Objectives, cont.After you have read and studied this chapter, you should be able toNest an if statement inside another if statement’s then or else part correctly.Describe how objects are compared.Choose the appropriate selection control statement for a given task.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.1 The if StatementStatements in programs are executed in sequence. We can add decision-making statements to a program to alter...
ppt76 trang | Chia sẻ: honghanh66 | Ngày: 19/03/2018 | Lượt xem: 56 | Lượt tải: 0download
Bạn đang xem trước 20 trang mẫu tài liệu Bài giảng Chapter 5: Selection Statements, để tải tài liệu gốc về máy bạn click vào nút DOWNLOAD ở trên
Chapter 5Selection Statements©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Chapter 5 ObjectivesAfter you have read and studied this chapter, you should be able toImplement selection control in a program by using if statements.Implement selection control in a program by using switch statements.Write boolean expressions with relational and boolean operators.Evaluate given boolean expressions correctly.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Chapter 5 Objectives, cont.After you have read and studied this chapter, you should be able toNest an if statement inside another if statement’s then or else part correctly.Describe how objects are compared.Choose the appropriate selection control statement for a given task.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.1 The if StatementStatements in programs are executed in sequence. We can add decision-making statements to a program to alter the control flow.The statement that alters the control flow is called a control statement. ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.1 The if StatementThe if statement is one type of selection statement. InputHandler input = new InputHandler(); int testScore = input.getInteger(“Enter test score:”); if (testScore ) else ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.1 The if StatementThe is a conditional expression that is evaluated to either true or false.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.1Mapping of the sample if statement to the general format.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.1 The if StatementThe six relational operators we can use in conditional expressions are: greater than>= greater than or equal to©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.2The diagram showing the control flow of the sample if statement.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.1 The if StatementThe if statement does not have to contain a block of code for the else condition. In the if-then structure, no special instructions are executed if the boolean expression evaluates to false. if (testScore >=95){ JOptionPane.showMessageDialog(“You are an honor student”);} else { }©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.3The diagram showing the control flow of the second version of the if statement. ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.2 Boolean Expressions and VariablesA boolean operator takes boolean values as its operands and returns a boolean value. The three boolean operators areand: &&or: ||not !©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.2 Boolean Expressions and VariablesBoolean operators and their meanings:©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.2 Boolean Expressions and VariablesThe result of a boolean expression is either true or false. These are the two values of data type boolean. We can declare a variable of data type boolean and assign a boolean value to it.boolean pass, done;pass = 70 = 70){ if (studentAge =70 and age >=10 }} else { //test score ){ : ... : }©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.5 The switch StatementThe data type of must be char, byte, short, or int. The value of is compared against the constant i of . If there is a matching case, its case body is executed. Otherwise, the execution continues to the statement following the switch statement. ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.5 The switch StatementThe break statement causes execution to skip the remaining portion of the switch statement and resume execution following the switch statement. The break statement is necessary to execute statements in one and only one case.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.7A diagram showing the control flow of the switch statement with and without the break statements.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.5 The switch StatementIt is good practice to implement a default case in a switch statement. The default case will be executed if there is no matching case. ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.6 Drawing GraphicsWe introduce four standard classes related to drawing geometric shapes on a window:java.awt.Graphicsjava.awt.Colorjava.awt.Pointjava.awt.Dimension©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.6 Drawing GraphicsWe can draw geometric shapes on a frame window by calling appropriate methods of the java.awt.Graphics class.//g is a Graphics object:g.drawRect(50, 50, 100, 30);©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.8How the position of the rectangle is determined by the drawRect method.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.9The distinction between the draw and fill methods. ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.6 Drawing GraphicsThe java.awt.Color class allows us to designate the color of an object.The RGB scheme combines three values ranging from 0 to 255 for red, green, and blue. Color pinkColor;pinkColor = new Color(255,175,175)©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.6 Drawing GraphicsThere are public class constants defined in the Color class for common colors:Color.blackColor.blueColor.greenColor.magentaColor.orangeand so on.g.setColor(Color.blue);g.drawRect(50, 50, 100, 30);©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.10A frame with a white background content pane and two colored squares.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.6 Drawing GraphicsA java.awt.Point object designates a point in two-dimensional space.Point pt = new Point();pt.x = 10;pt.y = 20;assigns the position (10, 20).©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.6 Drawing GraphicsThe java.awt.Dimension class can be used to create bounding rectangles that surround shapes. Dimension dim = new Dimension();dim.width = 40;dim.height = 70;©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.11Bounding rectangles of various shapes.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesWrite an application that simulates a screensaver by drawing various geometric shapes in different colors. The user has an option of choosing a type (ellipse or rectangle), color, and movement (stationary, smooth, or random).©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.12Two types of predefined classes: The first type requires us to use the predefined classes by calling their methods. ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.12, cont.Two types of predefined classes: The second type requires us to define helper classes for the predefined classes we want to use.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesProgram flow:Get the shape the user wants to draw.Get the color of the chosen shape.Get the type of movement the user wants to use.Start the drawing.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesProgram implementation:Start with a program skeleton. Explore the DrawingBoard class.Define an experimental DrawableShape class that draws a dummy shape.Add code to allow the user to select a shape. Extend the DrawableShape and other classes as necessary.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesAdd code to allow the user to specify the color. Extend the DrawableShape and other classes as necessary.Add code to allow the user to specify the motion type. Extend the DrawableShape and other classes as necessary.Finalize the code by tying up loose ends.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.Fig. 5.13The program diagram for the Ch5DrawShape program.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesStep 1 Development: Program SkeletonUse the DrawingBoard class to establish a launch pad for the development.Keep the code simple at this stage: Make the shape visible on the screen.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapes/** * Chapter 5 Sample Development: Drawing Shapes (Step 1) * * The instantiable main class of the program. */class Ch5DrawShape {/** The DrawingBoard object for simulating screensaver */ private DrawingBoard canvas; public Ch5DrawShape( ) { canvas = new DrawingBoard( ); } ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapespublic static void main( String[] args ) { Ch5DrawShape screensaver = new Ch5DrawShape(); screensaver.start(); } public void start( ) { canvas.setVisible(true); }}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesStep 2 Development: Draw a ShapeDefine the DrawableShape class with the specified set of methods:public void draw (java.awt.Graphics)public java.awt.Point getCenterPoint()public java.awt.Dimension getDimension ()public void setCenterPoint (java.awt.Point)©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapesimport java.awt.*;/** * Step 2: Add a preliminary DrawableShape class * * A class whose instances know how to draw themselves.*/class DrawableShape { private Point centerPoint;public DrawableShape( ) { centerPoint = null; }©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapespublic void draw(Graphics g) { g.setColor(Color.blue); g.fillOval(centerPoint.x-100, centerPoint.y-100, 200, 200); }public Point getCenterPoint( ) { return centerPoint; } public Dimension getDimension( ) { return new Dimension(200,200); } public void setCenterPoint(Point point) { centerPoint = point; }}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesThe Ch5DrawShape class with the modified start method:import java.awt.*;/** * Chapter 5 Sample Development: Start drawing shapes (Step 2) * * The instantiable main class of the program. */class Ch5DrawShape {... public void start( ) { DrawableShape shape1 = new DrawableShape(); DrawableShape shape2 = new DrawableShape(); DrawableShape shape3 = new DrawableShape(); ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapes shape1.setCenterPoint(new Point(250,300)); shape2.setCenterPoint(new Point(500,300)); shape3.setCenterPoint(new Point(750,300)); canvas.addShape(shape1); canvas.addShape(shape2); canvas.addShape(shape3); canvas.setMovement(DrawingBoard.SMOOTH); canvas.setVisible(true); canvas.start(); }...}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesStep 3 Development: Allow the User to Select a ShapeUse JOptionPane to allow the user to input a choice numerically, and to establish the height and width of the shape.Modify the DrawableShape class so it can draw three different geometric shapes.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapesimport java.awt.*;import javax.swing.*;/** ... * The instantiable main class of the program. */class Ch5DrawShape {... public void start( ) { DrawableShape shape1 = getShape(); canvas.addShape(shape1); canvas.setMovement(DrawingBoard.SMOOTH); canvas.setVisible(true); canvas.start(); }©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapesprivate DrawableShape getShape( ) { int type = inputShapeType(); Dimension dim = inputDimension(); Point centerPt = inputCenterPoint(); DrawableShape shape = new DrawableShape(type, dim, centerPt); return shape;}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapesprivate int inputShapeType( ) { String str = JOptionPane.showInputDialog(null, "Selection: Enter the Shape number\n" + " 1 - Ellipse \n" + " 2 - Rectangle \n" + " 3 - Rounded Rectangle \n" ); int selection = Integer.parseInt(str); int type; switch (selection) { case 1: type = DrawableShape.ELLIPSE; break; case 2: type = DrawableShape.RECTANGLE; break; ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapes case 3: type = DrawableShape.ROUNDED_RECTANGLE; break; default: type = DrawableShape.ELLIPSE; break; } return type;}private Dimension inputDimension( ) { String str = JOptionPane.showInputDialog(null, "Enter the width of the shape\n" + " between 100 and 500 inclusive"); int width = Integer.parseInt(str); if (width 500) { width = 100; }©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapes str = JOptionPane.showInputDialog(null, "Enter the height of the shape\n" + " between 100 and 500 inclusive"); int height = Integer.parseInt(str); if (height 500) { height = 100; } return new Dimension(width, height);}private Point inputCenterPoint( ) { String str = JOptionPane.showInputDialog(null, "Enter the x value of the center point\n" + " between 200 and 800 inclusive"); ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapes int x = Integer.parseInt(str); if (x 800) { x = 200; } str = JOptionPane.showInputDialog(null, "Enter the y value of the center point\n" + “ between 100 and 500 inclusive"); int y = Integer.parseInt(str); if (y 500) { y = 100; } return new Point(x, y); }...}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesThe DrawableShape class is now modified toimport java.awt.*;/**... * A class whose instances know how to draw themselves.*/class DrawableShape {public static final int ELLIPSE = 0;public static final int RECTANGLE = 1;public static final int ROUNDED_RECTANGLE = 2;private static final Dimension DEFAULT_DIMENSION = new Dimension(200, 200);©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapesprivate static final Point DEFAULT_CENTER_PT = new Point(350, 350);private Point centerPoint;private Dimension dimension;private int type;public DrawableShape( ) { this(ELLIPSE, DEFAULT_DIMENSION, DEFAULT_CENTER_PT);}public DrawableShape(int sType, Dimension sDim, Point sCenter) { type = sType; dimension = sDim; centerPoint = sCenter;}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapespublic void draw(Graphics g) { g.setColor(Color.blue); drawShape(g);}...public void setType(int shapeType) { type = shapeType;}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapesprivate void drawShape(Graphics g) { switch (type) { case ELLIPSE: g.fillOval(centerPoint.x - dimension.width/2, centerPoint.y - dimension.height/2, dimension.width, dimension.height); break; case RECTANGLE: g.fillRect(centerPoint.x - dimension.width/2, centerPoint.y - dimension.height/2, dimension.width, dimension.height); break; ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapescase ROUNDED_RECTANGLE: g.fillRoundRect(centerPoint.x - dimension.width/2, centerPoint.y - dimension.height/2, dimension.width, dimension.height, (int) (dimension.width * 0.3), (int) (dimension.height * 0.3)); break; } }}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesStep 4 Development: Allow the User to Select a ColorAdopt the same input style for accepting the shape in Step 3.Add a method named inputColor to the Ch5DrawShape class.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapesimport java.awt.*;import javax.swing.*;/** * Chapter 5 Sample Development: Color selection (Step 4) * * The instantiable main class of the program. */class Ch5DrawShape {... public void start( ) { DrawableShape shape1 = getShape(); shape1.setColor(inputColor()); canvas.addShape(shape1);©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapes canvas.setMovement(DrawingBoard.SMOOTH); canvas.setVisible(true); canvas.start(); } ... private Color inputColor( ) { String str = JOptionPane.showInputDialog(null, "Selection: Enter the Color number\n" + " 1 - Red \n" + " 2 - Green \n" + " 3 - Blue \n" + " 4 - Yellow \n" + " 5 - Magenta \n" ); int selection = Integer.parseInt(str); ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesColor color; switch (selection) { case 1: color = Color.red; break; case 2: color = Color.green; break; case 3: color = Color.blue; break; case 4: color = Color.yellow; break; case 5: color = Color.magenta; break; ©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapes default: color = Color.red; break; } return color;}...}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesThe DrawableShape class is now modified toimport java.awt.*;/** * Step 4: Adds the color choice * * A class whose instances know how to draw themselves. **/class DrawableShape {...private static final Color DEFAULT_COLOR = Color.blue; ... private Color fillColor;©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapespublic DrawableShape(int sType, Dimension sDim, Point sCenter) { type = sType; dimension = sDim; centerPoint = sCenter; fillColor = DEFAULT_COLOR; }public void draw(Graphics g) { g.setColor(fillColor); drawShape(g); }...public void setColor(Color color) { fillColor = color; }...}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesStep 5 Development: Allow the user to select a motion type. Adopt the same design as used in Steps 3 and 4 for the motion selection.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapesimport java.awt.*;import javax.swing.*;/** * Chapter 5 Sample Development: Color selection (Step 5) * * The instantiable main class of the program. */class Ch5DrawShape {... public void start( ) { DrawableShape shape1 = getShape(); shape1.setColor(inputColor()); canvas.addShape(shape1); canvas.setMovement(inputMotionType()); canvas.setVisible(true); canvas.start(); }...©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing Shapes private int inputMotionType( ) { String str = JOptionPane.showInputDialog(null, "Selection: Enter the Motion number\n" + " 1 - Stationary (no movement) \n" + " 2 - Random Movement\n" + " 3 - Smooth Movement \n" ); int selection = Integer.parseInt(str); int type; switch (selection) { case 1: type = DrawingBoard.STATIONARY; break; case 2: type = DrawingBoard.RANDOM; break; case 3: type = DrawingBoard.SMOOTH; break; default: type = DrawingBoard.SMOOTH; break; } return type; } ...}©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesNo changes are required for the DrawableShape class, as the DrawingBoard class is the one responsible for shape movement.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.5.7 Sample Development: Drawing ShapesStep 6 Development: FinalizePerform a critical program review, looking for unfinished methods, inconsistency or error in the methods, missing comments, etc.Make extensions to the program if desired.©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display.
Các file đính kèm theo tài liệu này:
• pptchap_5_1976.ppt
Tài liệu liên quan
|
{
"url": "http://www.thuvientailieu.vn/tai-lieu/bai-giang-chapter-5-selection-statements-41919/",
"source_domain": "www.thuvientailieu.vn",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "32099",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HY2VMIBNDNIJLOOXSMDIWWOGT3JI5MZA",
"WARC-Concurrent-To": "<urn:uuid:04cb08bd-2ca2-4632-ad80-8813c2cc2d4b>",
"WARC-Date": "2018-08-14T09:03:58Z",
"WARC-IP-Address": "203.162.166.54",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:CTCJ6MN3QBQIBWZA7CGCWYW2UID3I3PB",
"WARC-Record-ID": "<urn:uuid:50934ad3-033f-469f-a94e-6c663f065913>",
"WARC-Target-URI": "http://www.thuvientailieu.vn/tai-lieu/bai-giang-chapter-5-selection-statements-41919/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fe6bdbec-848c-407e-8c8c-d8043ca730b0>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-178-124-6.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
42,
43,
1099,
1100,
1190,
1335,
22216,
22217,
22254,
22255,
22278
],
"line_end_idx": [
42,
43,
1099,
1100,
1190,
1335,
22216,
22217,
22254,
22255,
22278,
22296
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 22296,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0.004215999972075224,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1682119220495224,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006843269802629948,
"rps_doc_frac_lines_end_with_ellipsis": 0.0833333283662796,
"rps_doc_frac_no_alph_words": 0.35982340574264526,
"rps_doc_frac_unique_words": 0.23479600250720978,
"rps_doc_mean_word_length": 6.88529634475708,
"rps_doc_num_sentences": 475,
"rps_doc_symbol_to_word_ratio": 0.004194260109215975,
"rps_doc_unigram_entropy": 5.3552961349487305,
"rps_doc_word_count": 2598,
"rps_doc_frac_chars_dupe_10grams": 0.43733230233192444,
"rps_doc_frac_chars_dupe_5grams": 0.555064857006073,
"rps_doc_frac_chars_dupe_6grams": 0.5394119024276733,
"rps_doc_frac_chars_dupe_7grams": 0.5165473818778992,
"rps_doc_frac_chars_dupe_8grams": 0.4964780807495117,
"rps_doc_frac_chars_dupe_9grams": 0.46237701177597046,
"rps_doc_frac_chars_top_2gram": 0.04366055130958557,
"rps_doc_frac_chars_top_3gram": 0.08609122782945633,
"rps_doc_frac_chars_top_4gram": 0.11739713698625565,
"rps_doc_books_importance": -2225.64306640625,
"rps_doc_books_importance_length_correction": -2225.64306640625,
"rps_doc_openwebtext_importance": -1188.06787109375,
"rps_doc_openwebtext_importance_length_correction": -1188.06787109375,
"rps_doc_wikipedia_importance": -1347.5924072265625,
"rps_doc_wikipedia_importance_length_correction": -1347.5924072265625
},
"fasttext": {
"dclm": 0.08279716968536377,
"english": 0.6454079747200012,
"fineweb_edu_approx": 2.222576141357422,
"eai_general_math": 0.4311867952346802,
"eai_open_web_math": 0.08981406688690186,
"eai_web_code": 0.8070341348648071
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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
|
9,130,378,078,466,280,000 |
Unity NavMeshComponents Errors
Hi. I’m trying to build my game that uses the Unity NavMeshComponents and I’m having a lot of errors.
First of all, it seems that i’m missing NUnit:
*The type or namespace name `NUnit' could not be found.*
Second of all, i’m missing TestTools:
*The type or namespace name `TestTools' could not be found.*
If I download TestTools off of the Asset Store I get this error upon building the game:
*The type or namespace name `ExpectedException' could not be found.*
Does anyone know how to fix this?
Thanks in advance.
(I know this is an old thread, but I’m answering anyway for posterity :D)
If you’re using “NavMeshComponents-2017.1”, there’s a folder in “Assets\NavMeshComponents-2017.1\Assets” named “Tests”.
You can try deleting the whole “Tests” folder, it contains the conflicting scripts. It worked for me.
|
{
"url": "https://discussions.unity.com/t/unity-navmeshcomponents-errors/193021",
"source_domain": "discussions.unity.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "24944",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2G74M22O265E6DF7F4TKMNFOWDZIKE3H",
"WARC-Concurrent-To": "<urn:uuid:c6b9f3f5-65b3-4b6e-b94d-72eb624ed61d>",
"WARC-Date": "2024-05-28T14:28:32Z",
"WARC-IP-Address": "184.104.178.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6MFY7UBDVA2FYW264QMMZBSYYBMUPCMI",
"WARC-Record-ID": "<urn:uuid:13d0541e-4eb0-46b7-9e47-7dd9e26ebaae>",
"WARC-Target-URI": "https://discussions.unity.com/t/unity-navmeshcomponents-errors/193021",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0c6e8e76-7374-4583-90a2-4e764a4ace2d>"
},
"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-28\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
31,
32,
134,
135,
182,
183,
241,
242,
280,
281,
343,
344,
432,
433,
503,
504,
538,
557,
558,
632,
633,
753,
754
],
"line_end_idx": [
31,
32,
134,
135,
182,
183,
241,
242,
280,
281,
343,
344,
432,
433,
503,
504,
538,
557,
558,
632,
633,
753,
754,
855
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 855,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38383838534355164,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03535354137420654,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26767677068710327,
"rps_doc_frac_unique_words": 0.6029411554336548,
"rps_doc_mean_word_length": 4.904411792755127,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.236488342285156,
"rps_doc_word_count": 136,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09895052015781403,
"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.03148426115512848,
"rps_doc_frac_chars_top_3gram": 0.040479760617017746,
"rps_doc_frac_chars_top_4gram": 0.08095952123403549,
"rps_doc_books_importance": -67.19995880126953,
"rps_doc_books_importance_length_correction": -67.19995880126953,
"rps_doc_openwebtext_importance": -29.888465881347656,
"rps_doc_openwebtext_importance_length_correction": -26.32577133178711,
"rps_doc_wikipedia_importance": -37.28007507324219,
"rps_doc_wikipedia_importance_length_correction": -37.28007507324219
},
"fasttext": {
"dclm": 0.040604110807180405,
"english": 0.8415207862854004,
"fineweb_edu_approx": 0.8997309803962708,
"eai_general_math": 0.9091650247573853,
"eai_open_web_math": 0.1420542597770691,
"eai_web_code": 0.8773790001869202
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,016,665,446,706,098,000 |
How to implement TOC legends for custom feature renderers
Summary
A custom feature renderer can be developed to control the way features of a feature layer are drawn. When you develop a custom feature renderer, it is essential to implement table of contents (TOC) legends for your custom renderer. Implementing TOC legends ensures that the TOCs, and legends in your map documents and ArcMap show a list of the symbols, labels, and headings that correspond to your custom feature renderer. This topic describes how you can create TOC legends for custom renderers and preserve the state of your legend in map documents and layer files.
In this topic
About implementing TOC legends for custom feature renderers
TOC legends can be created for custom feature renderers by implementing the ILegendInfo interface. The custom feature renderer should have at least one LegendGroup with at least one LegendClass.
The LegendGroup manages an array of LegendClass objects. Each LegendClass object corresponds to one symbol. Store all required symbols for rendering the feature layer in the LegendClass objects. LegendClass objects, apart from symbols, also contain descriptive text strings for the label and description (the label shows in the table of contents).
The following illustration shows the legend groups, legend class, and symbols as applicable to the standard ArcGIS feature renderer, BiUniqueValueRenderer:
Implementing TOC legends
To implement a TOC legend for a custom feature renderer, the custom feature renderer Java class should implement the ILegendInfo interface. Create LegendGroups and LegendClasses to suit your custom feature renderer.
When applying the custom feature renderer to the GOLF feature layer, appropriate labels and symbols for the custom renderer are applied to the legends. The following illustration shows a custom TOC legend implemented for the PointDispersalRenderer custom feature renderer:
The following code example shows the implementation of the custom TOC legend for the preceding PointDispersalRenderer illustration:
[Java]
//See the PointDispersalRenderer sample.
//Step 1: The custom renderer Java class implements ILegendInfo.
@ArcGISExtension public class PointDispersalRenderer implements IFeatureRenderer,
ILegendInfo, java.io.Externalizable, IDocumentVersionSupportGEN{
private ILegendGroup legendGroup;
private double dispersalRatio = 3.0;
public PointDispersalRenderer(){
try{
//Legends are created when the object is created.
createLegend();
}
catch (Exception e){
e.printStackTrace();
}
}
//The method that creates the TOC legend.
public void createLegend()throws Exception{
//Step 2: Create a legend group.
legendGroup = new LegendGroup();
legendGroup.setHeading("My Legend");
legendGroup.setEditable(true);
legendGroup.setVisible(true);
//Step 3: Create a legend class.
ILegendClass legendClass = new LegendClass();
legendClass.setLabel("dispersed");
// Make a default marker symbol.
ISimpleMarkerSymbol simpleMarkerSym = new SimpleMarkerSymbol();
simpleMarkerSym.setStyle(esriSimpleFillStyle.esriSFSSolid);
simpleMarkerSym.setOutline(true);
simpleMarkerSym.setSize(7);
IColor color = new RgbColor();
color.setRGB(255);
simpleMarkerSym.setColor(color);
//Add symbol to legend Class
legendClass.setSymbolByRef((ISymbol)simpleMarkerSym);
//Step 4: Add the legend class to the legend group.
legendGroup.addClass(legendClass);
}
//Implement applicable methods of ILegendInfo according to your implementation.
//Returns the associated LegendGroup.
public ILegendGroup getLegendGroup(int arg0)throws IOException,
AutomationException{
if (legendGroup.esri_getClass(0).getSymbol() != null)
return legendGroup;
else
return null;
}
//Returns the number (it is 1) of legend groups for PointDispersalRenderer.
public int getLegendGroupCount()throws IOException, AutomationException{
if (legendGroup != null)
return 1;
else
return 0;
}
//Define further legend formatting for the layer in ArcMap.
//Not implemented for PointDispersalRenderer.
public ILegendItem getLegendItem()throws IOException, AutomationException{
return null;
}
//Indicates whether the symbols used for a layer or renderer's legend vary by size.
//For example, the proportional symbol renderer returns true for this property.
//For PointDispersalRenderer, return false.
public boolean isSymbolsAreGraduated()throws IOException, AutomationException{
return false;
}
}
Persisting TOC legends
If you want users to change the symbology of your custom renderer, persist the symbology in a .mxd document or .lyr file. Instead of persisting the symbols independently, persist them as legend groups.
When persisting legend groups, the IFeatureRenderer.draw() method extracts symbols from the legend group to render the feature layer appropriately.
The following code example shows how to persist the legend group in the java.io.Externalizable.readExternal() and java.io.Externalizable.writeExternal() methods, and how to extract the symbols of the legend group in the IFeatureRenderer.draw() method to draw the feature layer. For more information, see the sample, PointDispersalRenderer.
[Java]
@ArcGISExtension public class PointDispersalRenderer implements IFeatureRenderer,
ILegendInfo, java.io.Externalizable, IDocumentVersionSupportGEN{
ILegendGroup grp;
//Read values from the persisted medium.
public void readExternal(ObjectInput in)throws IOException,
ClassNotFoundException{
legendGroup = (ILegendGroup)in.readObject();
dispersalRatio = in.readDouble();
}
//Write values to the persisted medium.
public void writeExternal(ObjectOutput out)throws IOException{
out.writeObject(legendGroup);
out.writeDouble(dispersalRatio);
}
public void draw(IFeatureCursor featureCursor, int drawPhase, IDisplay display,
ITrackCancel trackCancel)throws IOException, AutomationException{
//See the PointDispersalRenderer sample.
//The symbol is derived from its legend class.
//LegendGroup.esri_getClass(0) returns the legend class at 0 position.
ISymbol pSym = legendGroup.esri_getClass(0).getSymbol();
if (pSym == null){
return ;
}
IDisplayTransformation displayTrans = display.getDisplayTransformation();
IMarkerSymbol markerSym = (IMarkerSymbol)pSym;
double dispersalDist = displayTrans.fromPoints(markerSym.getSize()) *
dispersalRatio;
//Set the symbol on the display
display.setSymbol(pSym);
//Loop through the features and draw them using the symbol.
//Build a GeometryBag.
//See the PointDispersalRenderer sample for the remaining code.
}
//See the PointDispersalRenderer sample for additional method implementation.
}
See Also:
Implementing persistence for a custom feature renderer
How to implement custom property pages for custom feature renderers
Development licensingDeployment licensing
Engine Developer KitEngine
ServerServer
ArcGIS for Desktop BasicArcGIS for Desktop Basic
ArcGIS for Desktop StandardArcGIS for Desktop Standard
ArcGIS for Desktop AdvancedArcGIS for Desktop Advanced
|
{
"url": "https://desktop.arcgis.com/en/arcobjects/latest/java/b72547d1-97da-41c5-8d38-118eb803ba8a.htm",
"source_domain": "desktop.arcgis.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "15937",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LRI4J2NKYFSWKL7CSZISZJGX7DQTJUVL",
"WARC-Concurrent-To": "<urn:uuid:624bfbf7-27d2-41ce-a4a6-8469c890cdd2>",
"WARC-Date": "2023-06-08T14:26:04Z",
"WARC-IP-Address": "198.102.60.60",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MIKZ2RRVTMD5M6REFHW3BV7VKSGDQRQO",
"WARC-Record-ID": "<urn:uuid:3c95d6ec-d318-4ba1-9abd-71d62c8309c9>",
"WARC-Target-URI": "https://desktop.arcgis.com/en/arcobjects/latest/java/b72547d1-97da-41c5-8d38-118eb803ba8a.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2f30b6d8-f290-440b-8197-01a82c8b99c2>"
},
"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-229\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,
58,
59,
60,
68,
636,
637,
651,
652,
653,
713,
714,
909,
1257,
1413,
1414,
1439,
1440,
1656,
1929,
2061,
2068,
2109,
2110,
2175,
2257,
2326,
2327,
2365,
2406,
2407,
2444,
2457,
2458,
2520,
2548,
2549,
2559,
2588,
2621,
2631,
2637,
2638,
2684,
2732,
2773,
2814,
2859,
2898,
2936,
2937,
2978,
3032,
3075,
3116,
3188,
3256,
3298,
3334,
3373,
3400,
3441,
3442,
3479,
3541,
3542,
3602,
3645,
3651,
3652,
3736,
3737,
3779,
3847,
3876,
3938,
3970,
3983,
4008,
4014,
4015,
4095,
4172,
4173,
4206,
4228,
4241,
4263,
4269,
4270,
4271,
4335,
4385,
4464,
4485,
4491,
4492,
4580,
4664,
4712,
4795,
4817,
4823,
4825,
4826,
4849,
4850,
5052,
5200,
5543,
5550,
5632,
5701,
5702,
5724,
5725,
5770,
5834,
5866,
5919,
5961,
5967,
5968,
6012,
6079,
6117,
6158,
6164,
6165,
6166,
6250,
6324,
6325,
6374,
6375,
6430,
6509,
6574,
6601,
6622,
6632,
6714,
6769,
6847,
6875,
6915,
6948,
6949,
7017,
7048,
7120,
7126,
7127,
7209,
7211,
7212,
7213,
7223,
7224,
7279,
7347,
7348,
7349,
7350,
7351,
7393,
7420,
7433,
7482,
7537
],
"line_end_idx": [
58,
59,
60,
68,
636,
637,
651,
652,
653,
713,
714,
909,
1257,
1413,
1414,
1439,
1440,
1656,
1929,
2061,
2068,
2109,
2110,
2175,
2257,
2326,
2327,
2365,
2406,
2407,
2444,
2457,
2458,
2520,
2548,
2549,
2559,
2588,
2621,
2631,
2637,
2638,
2684,
2732,
2773,
2814,
2859,
2898,
2936,
2937,
2978,
3032,
3075,
3116,
3188,
3256,
3298,
3334,
3373,
3400,
3441,
3442,
3479,
3541,
3542,
3602,
3645,
3651,
3652,
3736,
3737,
3779,
3847,
3876,
3938,
3970,
3983,
4008,
4014,
4015,
4095,
4172,
4173,
4206,
4228,
4241,
4263,
4269,
4270,
4271,
4335,
4385,
4464,
4485,
4491,
4492,
4580,
4664,
4712,
4795,
4817,
4823,
4825,
4826,
4849,
4850,
5052,
5200,
5543,
5550,
5632,
5701,
5702,
5724,
5725,
5770,
5834,
5866,
5919,
5961,
5967,
5968,
6012,
6079,
6117,
6158,
6164,
6165,
6166,
6250,
6324,
6325,
6374,
6375,
6430,
6509,
6574,
6601,
6622,
6632,
6714,
6769,
6847,
6875,
6915,
6948,
6949,
7017,
7048,
7120,
7126,
7127,
7209,
7211,
7212,
7213,
7223,
7224,
7279,
7347,
7348,
7349,
7350,
7351,
7393,
7420,
7433,
7482,
7537,
7591
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7591,
"ccnet_original_nlines": 169,
"rps_doc_curly_bracket": 0.0036885798908770084,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21287554502487183,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01201716996729374,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2635193169116974,
"rps_doc_frac_unique_words": 0.35499998927116394,
"rps_doc_mean_word_length": 7.097499847412109,
"rps_doc_num_sentences": 87,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.972096920013428,
"rps_doc_word_count": 800,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1067277193069458,
"rps_doc_frac_chars_dupe_6grams": 0.05847128853201866,
"rps_doc_frac_chars_dupe_7grams": 0.04614301025867462,
"rps_doc_frac_chars_dupe_8grams": 0.04614301025867462,
"rps_doc_frac_chars_dupe_9grams": 0.04614301025867462,
"rps_doc_frac_chars_top_2gram": 0.032053541392087936,
"rps_doc_frac_chars_top_3gram": 0.036984849721193314,
"rps_doc_frac_chars_top_4gram": 0.01761184073984623,
"rps_doc_books_importance": -740.197021484375,
"rps_doc_books_importance_length_correction": -740.197021484375,
"rps_doc_openwebtext_importance": -406.9227600097656,
"rps_doc_openwebtext_importance_length_correction": -406.9227600097656,
"rps_doc_wikipedia_importance": -296.9020690917969,
"rps_doc_wikipedia_importance_length_correction": -296.9020690917969
},
"fasttext": {
"dclm": 0.09981793165206909,
"english": 0.5379014015197754,
"fineweb_edu_approx": 1.9417928457260132,
"eai_general_math": 0.21917742490768433,
"eai_open_web_math": 0.03278106078505516,
"eai_web_code": 0.75127774477005
}
}
|
{
"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": "910.285",
"labels": {
"level_1": "History and Geography",
"level_2": "Geography and Voyages and travels",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
394,583,290,322,951,360 |
Results 1 to 4 of 4
Math Help - Prove by Contradiction
1. #1
Newbie
Joined
Dec 2012
From
Toronto, Canada
Posts
10
Prove by Contradiction
Help!:
Prove by contradiction. If a,b and c are consecutive integers s.t. a<b<c then a^3 + b^3 /=/ c^3 (Cannot equal to c^3).
Here are my steps... let me know if I am on the right track:
For the sake of contradiction: a^3 + b^3 = c^3
(at this point, a<b<c would still hold right?
It is the problem to find a^3 + b^3 = c^3 and find it contradicting the consecutive integer a<b<c?)
I would go on with stating: b = a+1 ; c = b+1 <=> c = (a+1)+1
From here I am somewhat stuck.
Thank you!
Follow Math Help Forum on Facebook and Google+
2. #2
Senior Member jakncoke's Avatar
Joined
May 2010
Posts
388
Thanks
80
Re: Prove by Contradiction
if a, b, c are consecutive integers, then if a is an even number, b is an odd number, and c is an even number.
a = 2k \text{ } b = 2k + 1 \text{ } c = 2k + 2
(even number)^3 = even number
a^2 = (2k)^3 = 8k^3 = 2(4k^3)
(odd number)^3 = odd number
[tex] (2k+1)^3 = (4k^2 + 4k + 1)(2k+1) = 8k^3 + 4k^2 + 8k^2 + 4k + 2k + 1 = 8k^3 + 12k^2 + 6k + 1 = 2(4k^3 +6k^2 + 3k) + 1
even number + odd number = odd number
2k + 2m + 1 = 2(k+m) + 1
but if c is an even number, (even)^3 = even, so then this cant hold.
if u start with an odd, even, odd
then just calculate,
(2k+1)^3 + (2k+2)^3 = 16k^3 + 36k^2 + 30k + 9
(2k+3)^3 = 8k^3 + 36k^2 + 54k + 27
So (2k+1)^3 + (2k+2)^3 - (2k+3)^3 = 8k^3 - 24k - 18 = 0
So if you calculate the discriminat, this eqn. has only 1 real root. Then you can use another test to see the one real root isn't an integer (remember k must be an integer)
The calculation is tedious, use wolfram alpha, just type in (2k+1)^3 and all is done for you.
Last edited by jakncoke; December 15th 2012 at 09:04 PM.
Follow Math Help Forum on Facebook and Google+
3. #3
Newbie
Joined
Dec 2012
From
Toronto, Canada
Posts
10
Re: Prove by Contradiction
That's great, thanks
+rep
Follow Math Help Forum on Facebook and Google+
4. #4
Newbie
Joined
Dec 2012
From
Toronto, Canada
Posts
10
Re: Prove by Contradiction
Could you also help me with these questions?:
Prove that there exists a unique real number x such that ln x = 2
&
Let a and b be non zero integers. Prove that a divides b and b divides a if and only if a = +/- b
Follow Math Help Forum on Facebook and Google+
Similar Math Help Forum Discussions
1. Replies: 1
Last Post: March 12th 2012, 10:12 PM
2. Replies: 2
Last Post: March 10th 2010, 03:29 PM
3. Prove by contradiction
Posted in the Number Theory Forum
Replies: 7
Last Post: November 20th 2009, 11:26 AM
4. Prove by contradiction
Posted in the Number Theory Forum
Replies: 2
Last Post: November 20th 2009, 10:05 AM
5. Prove by contradiction
Posted in the Number Theory Forum
Replies: 0
Last Post: November 13th 2009, 08:21 AM
Search Tags
/mathhelpforum @mathhelpforum
|
{
"url": "http://mathhelpforum.com/discrete-math/209901-prove-contradiction.html",
"source_domain": "mathhelpforum.com",
"snapshot_id": "crawl=CC-MAIN-2016-18",
"warc_metadata": {
"Content-Length": "38137",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WDNZZLRT56BV7ZR7XYWQEKWNTOJV4TZU",
"WARC-Concurrent-To": "<urn:uuid:815efd19-939a-4b55-8d7b-136568149bcb>",
"WARC-Date": "2014-03-07T11:37:43Z",
"WARC-IP-Address": "66.114.149.59",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FCBDHTJV2JLY6XSE7DQVWBZHWUBL2QIE",
"WARC-Record-ID": "<urn:uuid:c9e891d6-878b-4d15-bf0d-612bfe0be7cb>",
"WARC-Target-URI": "http://mathhelpforum.com/discrete-math/209901-prove-contradiction.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:10d88afd-aaf3-42c0-8b64-cafa0576a7c5>"
},
"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,
1,
2,
22,
23,
58,
59,
67,
78,
89,
102,
111,
131,
141,
148,
149,
176,
177,
188,
189,
312,
313,
314,
379,
430,
431,
481,
585,
586,
652,
653,
688,
689,
690,
691,
692,
707,
758,
759,
767,
803,
814,
827,
837,
845,
856,
863,
864,
895,
896,
1011,
1063,
1064,
1098,
1133,
1134,
1166,
1293,
1294,
1295,
1337,
1338,
1367,
1368,
1441,
1442,
1480,
1505,
1555,
1595,
1657,
1834,
1835,
1933,
1994,
2045,
2046,
2054,
2065,
2076,
2089,
2098,
2118,
2128,
2135,
2136,
2167,
2168,
2193,
2194,
2203,
2254,
2255,
2263,
2274,
2285,
2298,
2307,
2327,
2337,
2344,
2345,
2376,
2377,
2427,
2428,
2498,
2499,
2505,
2506,
2608,
2659,
2660,
2696,
2697,
2713,
2754,
2770,
2811,
2839,
2877,
2892,
2936,
2964,
3002,
3017,
3061,
3089,
3127,
3142,
3186,
3187,
3199,
3200,
3201
],
"line_end_idx": [
1,
2,
22,
23,
58,
59,
67,
78,
89,
102,
111,
131,
141,
148,
149,
176,
177,
188,
189,
312,
313,
314,
379,
430,
431,
481,
585,
586,
652,
653,
688,
689,
690,
691,
692,
707,
758,
759,
767,
803,
814,
827,
837,
845,
856,
863,
864,
895,
896,
1011,
1063,
1064,
1098,
1133,
1134,
1166,
1293,
1294,
1295,
1337,
1338,
1367,
1368,
1441,
1442,
1480,
1505,
1555,
1595,
1657,
1834,
1835,
1933,
1994,
2045,
2046,
2054,
2065,
2076,
2089,
2098,
2118,
2128,
2135,
2136,
2167,
2168,
2193,
2194,
2203,
2254,
2255,
2263,
2274,
2285,
2298,
2307,
2327,
2337,
2344,
2345,
2376,
2377,
2427,
2428,
2498,
2499,
2505,
2506,
2608,
2659,
2660,
2696,
2697,
2713,
2754,
2770,
2811,
2839,
2877,
2892,
2936,
2964,
3002,
3017,
3061,
3089,
3127,
3142,
3186,
3187,
3199,
3200,
3201,
3230
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3230,
"ccnet_original_nlines": 134,
"rps_doc_curly_bracket": 0.0012383899884298444,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24546554684638977,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010882710106670856,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.43651753664016724,
"rps_doc_frac_unique_words": 0.3968565762042999,
"rps_doc_mean_word_length": 3.937131643295288,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.00604595011100173,
"rps_doc_unigram_entropy": 4.96658182144165,
"rps_doc_word_count": 509,
"rps_doc_frac_chars_dupe_10grams": 0.14720559120178223,
"rps_doc_frac_chars_dupe_5grams": 0.28343313932418823,
"rps_doc_frac_chars_dupe_6grams": 0.2445109784603119,
"rps_doc_frac_chars_dupe_7grams": 0.2445109784603119,
"rps_doc_frac_chars_dupe_8grams": 0.2445109784603119,
"rps_doc_frac_chars_dupe_9grams": 0.1686626672744751,
"rps_doc_frac_chars_top_2gram": 0.03143712878227234,
"rps_doc_frac_chars_top_3gram": 0.08982036262750626,
"rps_doc_frac_chars_top_4gram": 0.0379241481423378,
"rps_doc_books_importance": -308.26507568359375,
"rps_doc_books_importance_length_correction": -308.26507568359375,
"rps_doc_openwebtext_importance": -198.18873596191406,
"rps_doc_openwebtext_importance_length_correction": -198.18873596191406,
"rps_doc_wikipedia_importance": -184.13287353515625,
"rps_doc_wikipedia_importance_length_correction": -184.13287353515625
},
"fasttext": {
"dclm": 0.1004895567893982,
"english": 0.8527830839157104,
"fineweb_edu_approx": 2.0201048851013184,
"eai_general_math": 0.3475470542907715,
"eai_open_web_math": 0.6995354294776917,
"eai_web_code": 0.000006320000011328375
}
}
|
{
"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": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,720,919,158,522,121,000 |
# Copyright 1999-2023 Gentoo Authors # Distributed under the terms of the GNU General Public License v2 EAPI=8 inherit flag-o-matic DESCRIPTION="Translate TEX into HTML" HOMEPAGE="http://hutchinson.belmont.ma.us/tth/" # mirror://sourceforge/${PN}/${PN}${PV}.tar.gz SRC_URI="http://hutchinson.belmont.ma.us/tth/tth-noncom/${PN}_${PV}.tgz" S="${WORKDIR}"/${PN}_C LICENSE="GPL-2" SLOT="0" KEYWORDS="amd64 arm arm64 ~hppa ppc ppc64 ~riscv x86" RDEPEND=" app-text/ghostscript-gpl media-libs/netpbm " PATCHES=( "${FILESDIR}"/${PN}-4.16-Fix-build-with-Clang-16.patch ) src_compile() { # Upstream support a wide variety of obsolete platforms and # are still active, so no point in patching these, bug #874744. # http://hutchinson.belmont.ma.us/tth/platform.html append-flags -std=gnu89 -Wno-strict-prototypes emake tth tthsplit } src_install() { dobin tth latex2gif ps2gif ps2png tthsplit dodoc CHANGES doman tth.1 }
|
{
"url": "https://packages.hetzner.com/gentoo-portage/dev-tex/tth/tth-4.16.ebuild",
"source_domain": "packages.hetzner.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "1175",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GFPM4WVSWSXMOCNUEB5LGBRNRSUDJRF6",
"WARC-Concurrent-To": "<urn:uuid:5bab41be-50da-4e9d-bca3-ecc1bfdec1fa>",
"WARC-Date": "2023-09-23T23:42:57Z",
"WARC-IP-Address": "213.239.239.167",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:7PNEKPA5UHWE3JUKNOHKHUDFGHHSP5ZX",
"WARC-Record-ID": "<urn:uuid:294290b8-b6f2-40ec-983e-18a008be851b>",
"WARC-Target-URI": "https://packages.hetzner.com/gentoo-portage/dev-tex/tth/tth-4.16.ebuild",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b7ca0ca0-b813-4379-8732-2e625c0e420c>"
},
"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-5\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
],
"line_end_idx": [
908
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 908,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.02422907017171383,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08085106313228607,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.10638298094272614,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.44255319237709045,
"rps_doc_frac_unique_words": 0.949999988079071,
"rps_doc_mean_word_length": 8.425000190734863,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.029787229374051094,
"rps_doc_unigram_entropy": 4.312711715698242,
"rps_doc_word_count": 80,
"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": -141.8589630126953,
"rps_doc_books_importance_length_correction": -141.8589630126953,
"rps_doc_openwebtext_importance": -63.76612854003906,
"rps_doc_openwebtext_importance_length_correction": -53.742652893066406,
"rps_doc_wikipedia_importance": -61.61170959472656,
"rps_doc_wikipedia_importance_length_correction": -61.61170959472656
},
"fasttext": {
"dclm": 0.1221010684967041,
"english": 0.41134363412857056,
"fineweb_edu_approx": 0.9076893329620361,
"eai_general_math": 0.6523125767707825,
"eai_open_web_math": 0.5109185576438904,
"eai_web_code": 0.13854986429214478
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,171,175,659,593,215,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.
This is a very general question, so I won't be providing any code as my project is fairly large.
I have an ASP.NET project, which I've been maintaining and adding to you for a year now. There's about 30 pages in total, each mostly having a couple of gridview's and SqlDataSource's, and usually not more than 10-15 methods in the codebehind. There is also a fairly hefty LINQ-to-SQL dbml file - with around 40-50 tables.
The application takes about 30-40 seconds to compile, which I suppose isn't too bad - but the main issue is that when deployed, it's slow at loading pages compared to other applications on the same server and app pool - it can take around 10 seconds to load a simple page. I'm very confident the issue isn't isolated to any specific page - it seems more of a global application issue.
I'm just wondering if there are any settings in the web.config etc I can use to help speed things up? Or just general tips on common 'mistakes' or issues developers encounter than can cause this. My application is close to completion, and the speed issues are really tainting the customer's view of it.
share|improve this question
is the debug attribute set? – Daniel A. White Dec 1 '11 at 18:53
First, ensure that you specify debug="false" (as pointed out by others.) If that doesn't help, then start up a profiler, see what's taking the most time, and then fix that. Repeat until the site is fast enough. – dlev Dec 1 '11 at 18:55
Also you can check if there are any nested loops. I guess you can use PLINQ. – Dimi Dec 1 '11 at 19:13
"Slow when deployed" means that it's fast in your development integrated server? If this is so, then something's wrong with your IIS. If not (slow in dev too), you can easily debug it and find all bottlenecks. – Wiktor Zychla Dec 1 '11 at 19:21
What can you tell us about your production server? How does the hardware and network compare to your development environment? – Larsenal Dec 1 '11 at 20:13
3 Answers 3
up vote 3 down vote accepted
As the first step find out source of the problem, either application or database side.
Application side:
Start by enabling trace for slow pages and see size of ViewState, sometimes large ViewState cause slow page load.
Database side:
Use Sql Profiler to see what exactly requires a lot of time to get done
Useful links:
share|improve this answer
Most common oversight probably: don't forget to turn off debugging in your web.config before deploying.
<compilation debug="false" targetFramework="4.0">
A few others:
• Don't enable session state or viewstate where you don't use it
• Use output caching where possible, consider a caching layer in general i.e. for database queries (memcached, redis, etc.)
• Minify and combine CSS
• Minify javascript
share|improve this answer
What to do now:
1. Look at page load in Firebug or Chrome developer tools. Check to make sure you're not sending a huge payload over the wire.
2. Turn on trace output to see how the server is spending its time.
3. Check network throughput to your server.
How to avoid this in the future:
Remember that speed is a feature. If your app is slow as a dog, customers can't help but think it sucks. This means you want to run your app on "production" hardware as soon as you can and deploy regularly so that you catch performance problems as they're introduced. It's no fun to have an almost-done app that takes 10 seconds to deliver a page. Hopefully, you get lucky and can fix most of this with config. If you're unlucky, you might have some serious refactoring to do.
For example, if you've used ViewState pretending it was magic and free, you may have to rework some of that dependency.
Keep perf on a short leash. Your app will be snappy, and people will think you are awesome.
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/8346619/asp-net-application-ideas-on-how-to-speed-it-up",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "84383",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JFBBOWIMHOLPCXSUPALXHL5O74USFIRW",
"WARC-Concurrent-To": "<urn:uuid:b6aaf8a6-db5d-4ad5-b844-4c7415a872f6>",
"WARC-Date": "2015-04-26T03:23:31Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BDS3GAXSWIIMZEKLA3RJAIZRK74YQF7C",
"WARC-Record-ID": "<urn:uuid:341f40b0-fb40-40eb-a06d-64cd66327dbb>",
"WARC-Target-URI": "http://stackoverflow.com/questions/8346619/asp-net-application-ideas-on-how-to-speed-it-up",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a8e2cc6b-6d91-4c50-95b1-f565f177f73b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
255,
256,
579,
580,
965,
966,
1269,
1270,
1298,
1303,
1369,
1374,
1612,
1617,
1721,
1726,
1972,
1977,
2134,
2135,
2147,
2148,
2177,
2178,
2265,
2266,
2284,
2285,
2399,
2400,
2415,
2416,
2488,
2489,
2503,
2504,
2530,
2531,
2635,
2636,
2686,
2687,
2701,
2702,
2769,
2895,
2922,
2944,
2970,
2971,
2987,
2988,
3117,
3187,
3233,
3234,
3267,
3268,
3745,
3746,
3866,
3867,
3959,
3960,
3986,
3987,
3999,
4000,
4002,
4010,
4011,
4089,
4090
],
"line_end_idx": [
25,
157,
158,
255,
256,
579,
580,
965,
966,
1269,
1270,
1298,
1303,
1369,
1374,
1612,
1617,
1721,
1726,
1972,
1977,
2134,
2135,
2147,
2148,
2177,
2178,
2265,
2266,
2284,
2285,
2399,
2400,
2415,
2416,
2488,
2489,
2503,
2504,
2530,
2531,
2635,
2636,
2686,
2687,
2701,
2702,
2769,
2895,
2922,
2944,
2970,
2971,
2987,
2988,
3117,
3187,
3233,
3234,
3267,
3268,
3745,
3746,
3866,
3867,
3959,
3960,
3986,
3987,
3999,
4000,
4002,
4010,
4011,
4089,
4090,
4180
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4180,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40064793825149536,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01835853047668934,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2181425541639328,
"rps_doc_frac_unique_words": 0.4744121730327606,
"rps_doc_mean_word_length": 4.452281951904297,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.4164557456970215,
"rps_doc_word_count": 723,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006213109940290451,
"rps_doc_frac_chars_top_3gram": 0.009319660253822803,
"rps_doc_frac_chars_top_4gram": 0.012426219880580902,
"rps_doc_books_importance": -416.68524169921875,
"rps_doc_books_importance_length_correction": -416.68524169921875,
"rps_doc_openwebtext_importance": -193.32986450195312,
"rps_doc_openwebtext_importance_length_correction": -193.32986450195312,
"rps_doc_wikipedia_importance": -133.1259307861328,
"rps_doc_wikipedia_importance_length_correction": -133.1259307861328
},
"fasttext": {
"dclm": 0.5666795372962952,
"english": 0.9373107552528381,
"fineweb_edu_approx": 1.7534568309783936,
"eai_general_math": 0.007290299981832504,
"eai_open_web_math": 0.1483783721923828,
"eai_web_code": 0.0007685400196351111
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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,399,888,340,672,848,000 |
Answers
Solutions by everydaycalculation.com
Everydaycalculation.com » Answers » Fraction simplifier
Reduce 1715/11 to lowest terms
1715/11 is already in the simplest form. It can be written as 155.909091 in decimal form (rounded to 6 decimal places).
Steps to simplifying fractions
1. Find the GCD (or HCF) of numerator and denominator
GCD of 1715 and 11 is 1
2. Divide both the numerator and denominator by the GCD
1715 ÷ 1/11 ÷ 1
3. Reduced fraction: 1715/11
Equivalent fractions:
More fractions:
Use fraction calculator with our all-in-one calculator app: Download for Android, Download for iOS
© everydaycalculation.com
|
{
"url": "https://answers.everydaycalculation.com/simplify-fraction/1715-11",
"source_domain": "answers.everydaycalculation.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "6307",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AHT7FLK6JZW6ZOJJ42B3LI7OHBHFH67W",
"WARC-Concurrent-To": "<urn:uuid:f14397e3-adb1-4c2a-b84d-06f70d8abab7>",
"WARC-Date": "2019-08-24T11:01:13Z",
"WARC-IP-Address": "96.126.107.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K5JIEP7XYVEH7EVDVA2UFBSYHAZXRJL3",
"WARC-Record-ID": "<urn:uuid:4555c96e-aba7-41e0-b744-c23e8103ff27>",
"WARC-Target-URI": "https://answers.everydaycalculation.com/simplify-fraction/1715-11",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f3ea48ca-e77d-46f7-955d-9a323a032015>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-36.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
46,
47,
103,
104,
135,
136,
256,
257,
288,
289,
345,
373,
431,
451,
482,
483,
505,
506,
522,
523,
622,
623
],
"line_end_idx": [
8,
9,
46,
47,
103,
104,
135,
136,
256,
257,
288,
289,
345,
373,
431,
451,
482,
483,
505,
506,
522,
523,
622,
623,
648
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 648,
"ccnet_original_nlines": 24,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26356589794158936,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03100774995982647,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3643410801887512,
"rps_doc_frac_unique_words": 0.6458333134651184,
"rps_doc_mean_word_length": 5.260416507720947,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.015324592590332,
"rps_doc_word_count": 96,
"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.023762380704283714,
"rps_doc_frac_chars_top_3gram": 0.09108910709619522,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -47.05344009399414,
"rps_doc_books_importance_length_correction": -56.85449981689453,
"rps_doc_openwebtext_importance": -23.456893920898438,
"rps_doc_openwebtext_importance_length_correction": -33.25795364379883,
"rps_doc_wikipedia_importance": -13.959577560424805,
"rps_doc_wikipedia_importance_length_correction": -23.760635375976562
},
"fasttext": {
"dclm": 0.0909808874130249,
"english": 0.8377795219421387,
"fineweb_edu_approx": 1.317773461341858,
"eai_general_math": 0.42281216382980347,
"eai_open_web_math": 0.8961055278778076,
"eai_web_code": -0.000009540000064589549
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "510.71",
"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": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
283,171,163,854,278,140 |
ëîãèí:
ïàðîëü:
5-kopeek.ru - çàðàáîòîê â ñåòè
Ñîâåòû áëîããåðó – êàê óëó÷øèòü äèçàéí áëîãà
Äèçàéí áëîãà – äîñòàòî÷íî âàæíàÿ ÷àñòü. Íåäîðàáîòêè â ýòîì âîïðîñå ìîãóò ñòîèòü âàì ìíîãèõ ïîñåòèòåëåé. ß íå áóäó êàñàòüñÿ ýñòåòè÷åñêîé ñîñòàâëÿþùåé – ýòî äåëî âêóñà. Ðàññìîòðèì òîëüêî òåõíè÷åñêîå îôîðìëåíèå áëîãà.
1. Èñïîëüçóéòå â ñâîèõ öåëÿõ íàèáîëåå çàìåòíûå ìåñòà íà âàøåì áëîãå.
Êàê ïðàâèëî, ýòî
• ìåñòî ìåæäó øàïêîé áëîãà è êîíòåíòîì. Çäåñü ìîæíî ðàçìåñòèòü ïðèâåòñòâèå, îïèñàíèå áëîãà. Ìîæíî íàéòè â èíòåðíåòå ïëàãèí, êîòîðûé ïîçâîëèò ïîìåùàòü öåííûå ñîâåòû, èçìåíÿþùèåñÿ â çàâèñèìîñòè îò ïîèñêîâîãî çàïðîñà, ïî êîòîðîìó ïîëüçîâàòåëü ïîïàë íà áëîã.
• ìåñòî ïîñëå ïîñòà ïåðåä êîììåíòàðèÿìè. Îíî ñ÷èòàåòñÿ çîíîé âûáîðà. Ïîñåòèòåëü ïîñëå ïðî÷òåíèÿ ïîñòà ðåøàåò, ÷òî ñäåëàòü äàëüøå – ïåðåéòè ê ñëåäóþùåìó ïîñòó, óéòè ñ áëîãà, îñòàâèòü êîììåíòàðèé. Âàøà çàäà÷à – óäåðæàòü åãî íà áëîãå. Ñ ýòîé öåëüþ â êîíöå ïîñòà ìîæíî âðó÷íóþ èëè ñ ïîìîùüþ ñïåöèàëüíîãî ïëàãèíà ïðîñòàâèòü ññûëêè íà èíòåðåñíûå ñòàòüè. Åñëè îñíîâíàÿ öåëü áëîãà – äîõîä ñ ðåêëàìû, òî ëîãè÷íî çäåñü ðàçìåñòèòü ðåêëàìíûå áëîêè.
• áîêîâûå ïàíåëè.  âåðõíåé ÷àñòè ëó÷øå ðàçìåñòèòü ôîðìó RSS-ïîäïèñêè è ïîäïèñêè íà îáíîâëåíèÿ ïî å-mail. Íèæå â óñòàíîâëåííîì âàìè ïîðÿäêå – ñïèñêè êàòåãîðèé, ìåòà-òåãè, ðåêëàìíûå áëîêè è ò.ä. Âàì ðåøàòü, êàêóþ èíôîðìàöèþ ëó÷øå âñåãî âûâåñòè íà áîêîâûå ïàíåëè. Êðîìå âñåãî ïðî÷åãî, îáÿçàòåëüíî ïðîñòàâüòå çäåñü ññûëêè íà íàèáîëåå âàæíûå ñòàòüè, à òàêæå àðõèâ áëîãà. Ýòî óâåëè÷èò êîëè÷åñòâî ïðîñìîòðîâ ñòðàíèö áëîãà.
• øàïêà áëîãà. Ýòî ïåðâîå, ÷òî âèäèò ïîñåòèòåëü. Åñëè øàïêà áëîãà çàâåøàíà ðåêëàìîé, åå òðóäíî çàïîìíèòü. Ñòàðàéòåñü îñòàâëÿòü ýòî ìåñòî ìàêñèìàëüíî ñâîáîäíûì îò ãðàôè÷åñêèõ ðåêëàìíûõ áëîêîâ.
2. Èñïîëüçóéòå ïîëíûå ôèäû â RSS-ëåíòàõ. Ïðåäîñòàâüòå ÷èòàòåëÿì ñâîáîäó âûáîðà - ÷èòàòü ñòàòüè íåïîñðåäñòâåííî â áëîãå èëè ñ ïîìîùüþ RSS-ðèäåðà. Åñëè ñòàòüÿ âûçâàëà èíòåðåñ, ÷èòàòåëè áóäóò ïåðåõîäèòü íà áëîã, ÷òîáû ïðî÷åñòü êîììåíòàðèè ê íåé. Åñëè æå èíòåðåñà íåò, òî êîðîòêèå àíîíñû òåì áîëåå íå ïîäíèìóò ïîñåùàåìîñòü.
3. Ïðèâëåêàéòå âíèìàíèå ê ñòàòüÿì ïîäõîäÿùèìè ïî ñìûñëó èëëþñòðàöèÿìè.  èíòåðíåòå åñòü ñòîê-ðåñóðñû, ñ êîòîðûõ ìîæíî áåñïëàòíî ñêà÷àòü ïîäõîäÿùèå èçîáðàæåíèÿ.
4. Ðàçíîîáðàçüòå îôîðìëåíèå òåêñòà: âðåçêè, öèòàòû, òå æå èëëþñòðàöèè, íóìåðîâàííûå è ìàðêèðîâàííûå ñïèñêè. Âñå ýòî, èñïîëüçîâàííîå ê ìåñòó, ïîâûøàåò ÷èòàáåëüíîñòü òåêñòà. Åäèíñòâåííîå îãðàíè÷åíèå – íå èñïîëüçóéòå ïîä÷åðêèâàíèÿ. Ïîä÷åðêíóòûé òåêñò âîñïðèíèìàåòñÿ êàê ãèïåðññûëêà è ñáèâàåò ñ òîëêó ÷èòàòåëåé.
|
{
"url": "http://www.5-kopeek.ru/stat/blog_design.shtml",
"source_domain": "www.5-kopeek.ru",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "13655",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AS3GRAWRSUFJWJ7QQGUZ4UXQCHVCA2ZG",
"WARC-Concurrent-To": "<urn:uuid:c9859b92-9549-4b22-95be-a8fa6c778938>",
"WARC-Date": "2023-12-01T23:44:53Z",
"WARC-IP-Address": "62.173.153.46",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:AZPRTIOV4LALEJVPMJJS2XFTP7LTKQKN",
"WARC-Record-ID": "<urn:uuid:2736f745-3245-433f-8d20-57d92e949e3e>",
"WARC-Target-URI": "http://www.5-kopeek.ru/stat/blog_design.shtml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ca1e0528-abaf-4457-8603-7ca95e705db4>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-66\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
7,
15,
16,
47,
48,
92,
93,
308,
309,
380,
381,
402,
403,
662,
1103,
1524,
1720,
2042,
2204
],
"line_end_idx": [
7,
15,
16,
47,
48,
92,
93,
308,
309,
380,
381,
402,
403,
662,
1103,
1524,
1720,
2042,
2204,
2513
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2513,
"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,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012422359548509121,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9875776171684265,
"rps_doc_frac_unique_words": 0.6916426420211792,
"rps_doc_mean_word_length": 11.299712181091309,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.245213508605957,
"rps_doc_word_count": 347,
"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.011221629567444324,
"rps_doc_frac_chars_top_3gram": 0.010711549781262875,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -157.5721893310547,
"rps_doc_books_importance_length_correction": -157.5721893310547,
"rps_doc_openwebtext_importance": -114.60508728027344,
"rps_doc_openwebtext_importance_length_correction": -114.60508728027344,
"rps_doc_wikipedia_importance": -68.38978576660156,
"rps_doc_wikipedia_importance_length_correction": -68.38978576660156
},
"fasttext": {
"dclm": 0.0561974011361599,
"english": 0.004617909900844097,
"fineweb_edu_approx": 2.0436434745788574,
"eai_general_math": 0.0013188100419938564,
"eai_open_web_math": 0.8735885620117188,
"eai_web_code": 0.5725112557411194
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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
|
-3,665,183,551,704,152,000 |
Your Apple ID code is: 393484. Do not share it with anyone.
Your Apple ID code is: 409753. Do not share it with anyone.
Your Apple ID Code is: 974773. Don't share it with anyone.
20877 es tu código de Facebook H29Q+Fsn4Sr
Your Apple ID Code is: 538259. Don't share it with anyone.
Your Apple ID code is: 357533. Do not share it with anyone.
535933 es tu código de Facebook H29Q+Fsn4Sr
805811 es tu código para restablecer la contraseña de Facebook
872328 es tu código para restablecer la contraseña de Facebook
Your Apple ID Code is: 752791. Don't share it with anyone.
Unlock the Power of Virtual Numbers for Doublelist in the Netherlands depop customer support
Unlock the Power of Virtual Numbers for Doublelist in the Netherlands
Today, privacy has become an essential aspect of our daily lives, especially when it comes to online registrations. Many services and sites request your personal phone number, which can lead to spam calls and unwanted messages. Luckily, with the availability of virtual numbers, like those offered for doublelist registrations in the Netherlands, you can keep your personal information secure. Imagine effortlessly signing up for those services while using a secondary number, allowing you to experience full online freedom. In this article, we will explore how you can navigate this growing trend and learn all that you need to know about the significance of using virtual numbers, especially when it comes to registering for platforms like doublelist. Did you know that the Denmark phone code can also affect how we communicate across different countries?
Understanding Virtual Numbers
Virtual numbers are not tied to a specific phone line; they are instead cloud-based services that provide users with an alternative contact number. This feature has gained popularity among individuals seeking anonymity online. Using a virtual number allows you to remain under the radar of telemarketers and avoid unnecessary spam. More importantly, virtual numbers are particularly useful when signing up for websites or applications that require phone verification.
Why Opt for a Virtual Number?
• Enhanced Privacy:By using a virtual number, your personal number remains undisclosed, ensuring your privacy.
• Reduce Spam:Minimize the chances of receiving unwanted messages or promotional texts.
• Convenience:Create multiple virtual numbers for different services, helping you manage various accounts more easily.
• Cost-Effective:Virtual numbers can often be cheaper than traditional phone services.
How to Use a Virtual Number for Doublelist in the Netherlands
Now that we've established the benefits of virtual numbers, let's delve into how to use them specifically for signing up for doublelist from the Netherlands.
Step 1: Choose a Reliable Service
Start by selecting a reputable service provider that offers virtual numbers. Make sure the provider supports SMS reception, which is essential for the registration process on platforms like doublelist. Review user feedback and the service's performance to ensure quality.
Step 2: Sign Up for a Virtual Number
Once you’ve chosen a provider, go through the registration process. This typically involves providing an email address and selecting your virtual number. Depending on the service, you may even get the option to pick a number with a specific area code.
Step 3: Register on Doublelist
With your virtual number ready, head over to the doublelist website to create an account. During the registration process, provide your newly acquired virtual number instead of your personal one.
Step 4: Confirm Your Registration
After completing the registration form, doublelist will send you a verification code via SMS to your virtual number. Access your virtual number inbox through your service provider to retrieve this code.
Step 5: Enjoy Your Privacy
Enter the verification code on the doublelist website, and you’re all set! You can now explore the platform without revealing your personal phone number, giving you peace of mind and control over your information.
Additional Benefits of Using Virtual Numbers
Aside from protecting your privacy, there are several other advantages to using virtual numbers in the Netherlands:
• International Accessibility:Virtual numbers can often be used internationally, allowing you to connect with services globally.
• Project Management:If you’re juggling multiple businesses or projects, separate virtual numbers can help keep everything organized.
• Enhanced Security:With a virtual number, your accounts are less linked to your identity, adding an extra layer of security.
The Growing Trend of Privacy-Centric Online Services
As awareness surrounding digital privacy grows, the demand for privacy-centric services continues to rise. Users of platforms like doublelist are becoming increasingly cautious about disclosing personal information. Virtual numbers represent a practical solution, allowing users to interact online without the worries associated with sharing their primary contact details.
Possible Drawbacks of Virtual Numbers
While there are numerous advantages, it’s also important to consider some possible downsides:
• Limited Features:Some virtual number services may not offer comprehensive functionalities found in traditional phone services.
• Cost Variability:Depending on the service and usage, costs can vary significantly among providers.
• Verification Issues:Not all services accept virtual numbers for verification, limiting their usability in some cases.
Conclusion
In a world where digital privacy is increasingly becoming a concern, the use of virtual numbers is a valuable tool for anyone looking to maintain anonymity online. Whether you’re registering for doublelist in the Netherlands or need an alternative number for any other purpose, virtual numbers provide a smart solution. Equip yourself with the right tools, make informed choices, and enjoy the freedom that comes with keeping your real phone number private.
By leveraging the potential of virtual numbers, you can navigate online spaces more comfortably, participate in various services, and ensure that your personal details remain your own. It’s time to take control of your online presence—start today with a virtual number and experience the difference.
More numbers from Netherlands
|
{
"url": "https://sms24.me/en/numbers/3197010204981",
"source_domain": "sms24.me",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "20897",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6FEHLXBQ4NRZJAGTH66FBLENDWWILYGF",
"WARC-Concurrent-To": "<urn:uuid:087e7f41-6bd6-4dbf-89ef-0bda39486234>",
"WARC-Date": "2024-09-18T09:24:03Z",
"WARC-IP-Address": "172.67.202.163",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ICQR33Z5KB43WYDPOVXTABTA3DVDCYIR",
"WARC-Record-ID": "<urn:uuid:6706badf-2e63-445e-9a64-79075dce4582>",
"WARC-Target-URI": "https://sms24.me/en/numbers/3197010204981",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6db49088-d811-422f-b523-300b4fa0a4ab>"
},
"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-88\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,
2,
62,
64,
124,
126,
185,
187,
230,
232,
291,
293,
353,
355,
399,
401,
464,
466,
529,
531,
590,
591,
684,
685,
755,
756,
757,
758,
1616,
1617,
1618,
1619,
1649,
1650,
1651,
2119,
2120,
2121,
2122,
2152,
2153,
2154,
2155,
2268,
2269,
2359,
2360,
2481,
2482,
2571,
2572,
2573,
2574,
2636,
2637,
2638,
2796,
2797,
2798,
2799,
2833,
2834,
3106,
3107,
3108,
3109,
3146,
3147,
3399,
3400,
3401,
3402,
3433,
3434,
3630,
3631,
3632,
3633,
3667,
3668,
3871,
3872,
3873,
3874,
3901,
3902,
4116,
4117,
4118,
4119,
4164,
4165,
4166,
4282,
4283,
4284,
4285,
4416,
4417,
4553,
4554,
4682,
4683,
4684,
4685,
4738,
4739,
4740,
5113,
5114,
5115,
5116,
5154,
5155,
5156,
5250,
5251,
5252,
5253,
5384,
5385,
5488,
5489,
5611,
5612,
5613,
5614,
5625,
5626,
5627,
6085,
6086,
6087,
6088,
6388,
6389
],
"line_end_idx": [
2,
62,
64,
124,
126,
185,
187,
230,
232,
291,
293,
353,
355,
399,
401,
464,
466,
529,
531,
590,
591,
684,
685,
755,
756,
757,
758,
1616,
1617,
1618,
1619,
1649,
1650,
1651,
2119,
2120,
2121,
2122,
2152,
2153,
2154,
2155,
2268,
2269,
2359,
2360,
2481,
2482,
2571,
2572,
2573,
2574,
2636,
2637,
2638,
2796,
2797,
2798,
2799,
2833,
2834,
3106,
3107,
3108,
3109,
3146,
3147,
3399,
3400,
3401,
3402,
3433,
3434,
3630,
3631,
3632,
3633,
3667,
3668,
3871,
3872,
3873,
3874,
3901,
3902,
4116,
4117,
4118,
4119,
4164,
4165,
4166,
4282,
4283,
4284,
4285,
4416,
4417,
4553,
4554,
4682,
4683,
4684,
4685,
4738,
4739,
4740,
5113,
5114,
5115,
5116,
5154,
5155,
5156,
5250,
5251,
5252,
5253,
5384,
5385,
5488,
5489,
5611,
5612,
5613,
5614,
5625,
5626,
5627,
6085,
6086,
6087,
6088,
6388,
6389,
6418
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6418,
"ccnet_original_nlines": 135,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34770888090133667,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008984729647636414,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14465409517288208,
"rps_doc_frac_unique_words": 0.40506330132484436,
"rps_doc_mean_word_length": 5.5168776512146,
"rps_doc_num_sentences": 55,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.326735019683838,
"rps_doc_word_count": 948,
"rps_doc_frac_chars_dupe_10grams": 0.03747610002756119,
"rps_doc_frac_chars_dupe_5grams": 0.11720840632915497,
"rps_doc_frac_chars_dupe_6grams": 0.0787762925028801,
"rps_doc_frac_chars_dupe_7grams": 0.06271511316299438,
"rps_doc_frac_chars_dupe_8grams": 0.06271511316299438,
"rps_doc_frac_chars_dupe_9grams": 0.06271511316299438,
"rps_doc_frac_chars_top_2gram": 0.05086041986942291,
"rps_doc_frac_chars_top_3gram": 0.02141490951180458,
"rps_doc_frac_chars_top_4gram": 0.017208410426974297,
"rps_doc_books_importance": -500.5429382324219,
"rps_doc_books_importance_length_correction": -500.5429382324219,
"rps_doc_openwebtext_importance": -291.5849914550781,
"rps_doc_openwebtext_importance_length_correction": -291.5849914550781,
"rps_doc_wikipedia_importance": -246.139404296875,
"rps_doc_wikipedia_importance_length_correction": -246.139404296875
},
"fasttext": {
"dclm": 0.35143303871154785,
"english": 0.8740953803062439,
"fineweb_edu_approx": 1.9905871152877808,
"eai_general_math": 0.0007222300046123564,
"eai_open_web_math": 0.05266869068145752,
"eai_web_code": 0.006714459974318743
}
}
|
{
"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": "352.4",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Local government"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,979,717,306,278,292,000 |
Class: PathFollower
Phaser. PathFollower
new PathFollower(path, follower [, speed] [, angleOffset] [, callbackAtEnd] [, physicsAdjustTime])
A PathFollower is a virtual entity that follows the Path. It is usually linked to a game object such as a Sprite and it will control either the position of that object, or its velocity if it is a physics object.
Callbacks will be triggered when certain events happen as the follower moves. These may be used to aid in the creation of complex behaviours for the game objects.
Parameters:
Name Type Argument Default Description
path Phaser.Path
The Path object which this follower is created on.
follower Phaser.Sprite | object
The game object which this follower controls. Requires public properties: x, y for position and rotation for angle control (if specified).
speed number <optional>
1
The current speed of this follower in pixels per frame. This value is multiplied with the Path segment speed to give the final value used.
angleOffset number <optional>
null
If null then the PathFollower won't rotate. Otherwise it will face in the paths direction plus this offset which is given in radians.
callbackAtEnd function <optional>
A callback to be invoked when the follower reaches the end of a path.
physicsAdjustTime number <optional>
0
If non-zero then the follower expects to control a physics object using "arcade.moveToObject" to control velocity.
Source:
src/plugins/path/PathFollower.js line 25
[email protected] is on GitHub and NPM
Documentation generated by JSDoc 3.5.4 on 2018-03-22 using Tomorrow.
|
{
"url": "https://photonstorm.github.io/phaser-ce/Phaser.PathFollower.html",
"source_domain": "photonstorm.github.io",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "23783",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B7O3CKJQMO4TNLUL2QGSIRT3XQ2AGUEM",
"WARC-Concurrent-To": "<urn:uuid:92c89d1a-1fd1-4213-b7c2-72f9b16ae13b>",
"WARC-Date": "2018-04-25T02:53:55Z",
"WARC-IP-Address": "185.199.109.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HAAHM2IVZLVSMFET2GWDU4BJ5K7KR4GX",
"WARC-Record-ID": "<urn:uuid:767ed6be-90c3-4653-abbf-6f5cf9df15d8>",
"WARC-Target-URI": "https://photonstorm.github.io/phaser-ce/Phaser.PathFollower.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:efc65b61-40f4-440a-adbd-6b913e9fe954>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-35-148-49.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
20,
21,
42,
43,
142,
143,
355,
356,
519,
520,
532,
571,
588,
589,
640,
641,
673,
674,
813,
814,
838,
840,
841,
980,
981,
1011,
1016,
1017,
1151,
1152,
1186,
1187,
1257,
1258,
1294,
1296,
1297,
1412,
1413,
1421,
1462,
1463,
1501,
1502
],
"line_end_idx": [
20,
21,
42,
43,
142,
143,
355,
356,
519,
520,
532,
571,
588,
589,
640,
641,
673,
674,
813,
814,
838,
840,
841,
980,
981,
1011,
1016,
1017,
1151,
1152,
1186,
1187,
1257,
1258,
1294,
1296,
1297,
1412,
1413,
1421,
1462,
1463,
1501,
1502,
1570
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1570,
"ccnet_original_nlines": 44,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3215433955192566,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009646300226449966,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23151125013828278,
"rps_doc_frac_unique_words": 0.540772557258606,
"rps_doc_mean_word_length": 5.356223106384277,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.514919281005859,
"rps_doc_word_count": 233,
"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.016826920211315155,
"rps_doc_frac_chars_top_3gram": 0.022435899823904037,
"rps_doc_frac_chars_top_4gram": 0.03685896843671799,
"rps_doc_books_importance": -152.13584899902344,
"rps_doc_books_importance_length_correction": -139.2415771484375,
"rps_doc_openwebtext_importance": -77.22364044189453,
"rps_doc_openwebtext_importance_length_correction": -77.22364044189453,
"rps_doc_wikipedia_importance": -57.99660873413086,
"rps_doc_wikipedia_importance_length_correction": -44.19705581665039
},
"fasttext": {
"dclm": 0.6352546215057373,
"english": 0.7795477509498596,
"fineweb_edu_approx": 3.0557587146759033,
"eai_general_math": 0.8606305718421936,
"eai_open_web_math": 0.0932803824543953,
"eai_web_code": 0.8803862929344177
}
}
|
{
"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,978,767,245,709,867,000 |
Apple say MBP is the "ultimate gaming laptop"???
Discussion in 'MacBook Pro' started by RX64MACBOOKPRO, May 21, 2009.
1. RX64MACBOOKPRO macrumors member
RX64MACBOOKPRO
Joined:
Oct 26, 2008
#1
tho the MBP is not really the "ultimate gaming laptop" here it is on their apple gaming page:
http://www.apple.com/games/hardware/index.html#road
text copied from page:
"Intel Core 2 Duo Mobile gaming has moved from the backseat to the drivers seat with the MacBook Pro. Experience the best games on a 15inch display with the amazing combined power of the Intel Core 2 Duo and two graphics processors to choose from: the NVIDIA GeForce 9600M and NVIDIA GeForce 9400M both included inside the same notebook, so you can choose between performance or power. The ultimate gaming laptop is just under 1 inch thick and weighs a mere 5.5 pounds a heavyweight in an ultra light body."
2. jmann macrumors 604
jmann
Joined:
Dec 8, 2007
Location:
bump on a log in a hole in the bottom of the sea
3. Sun Baked macrumors G5
Sun Baked
Joined:
May 19, 2002
#3
Probably in the ultra thin profile machines, if you want the ultimate gaming lugbook -- might try of of the portable desktop PCs in a lugbook case.
4. mikes70mustang macrumors 68000
mikes70mustang
Joined:
Nov 14, 2008
Location:
US
#4
Apparently you havnt been reading all of the threads with gamers crying that their macs cant run their fav fantasy games full bore.
5. Lone Deranger macrumors 65832
Lone Deranger
Joined:
Apr 23, 2006
Location:
Tokyo, Japan
#5
That is called Marketing. Of course Apple are going to say it is the ultimate gaming laptop.
6. Sun Baked macrumors G5
Sun Baked
Joined:
May 19, 2002
#6
Puffery aka, "Blowing smoke up your ass."
7. sammich macrumors 601
sammich
Joined:
Sep 26, 2006
Location:
Sarcasmville.
#7
Their words not yours.
"My treadmill is the ultimate gaming machine". So sue me.
8. crewrules101 macrumors member
Joined:
Aug 9, 2007
#8
Well you could always go buy, lord forgive me, a Dell or an HP or an AlienWare to play your oh so fav pc games, but as far as the macbook pro goes, it is the MOST ADVANCED MOBILE GAMING PLATFORM available for MAC OS X! If you want to play a PC game on boot camp, go get a friggin PC and be done with a mac. If you are so attached, then the Mac community dosent need you!
9. DirkBreeuwer macrumors member
Joined:
Oct 22, 2008
#9
There is nothing wrong with a user that wants to have an Excelent Operating System as OS X and to be able to once in a while play games in Bootcamp. I've had some pretty good results with games in Bootcamp, better than I thought it would be. (Just the problem of the 9600 card overheating too quickly, but that is not happening in every computer). Mac community need any Mac user.
10. magamo macrumors 6502
Joined:
Apr 6, 2009
#10
Obviously it's the ultimate gaming laptop for games than run on OS X. Apple doesn't need to take PC apps into account when they say their laptops are ultimate. The same goes for PCs. PC laptops can be "ultimate" even if they can't run Mac apps. Games may be a little different from other types of apps, but I think it's just marketing.
11. Sun Baked macrumors G5
Sun Baked
Joined:
May 19, 2002
#11
Obvious puffery, the FTC doesn't expect people to take these claims seriously.
Guess the only people that do always get trapped by all the pitchmen on tv, and keep hitting the buy button on the banner ads.
12. kolax macrumors G3
Joined:
Mar 20, 2007
#12
It is good for games - but obviously not the "ultimate" gaming machine.
I think what Apple is trying to get across is there is no better laptop for gaming at 1 inch thick than the MacBook Pro.
13. miles01110 macrumors Core
miles01110
Joined:
Jul 24, 2006
Location:
The Ivory Tower (I'm not coming down)
#13
What I don't get is why serious gamers are buying a) a laptop and b) a Mac. Boggling.
14. kolax macrumors G3
Joined:
Mar 20, 2007
#14
a) because there's no other laptop that matches the MacBook Pro's performance against the size, weight and thickness of it.
b) Mac's have been able to run Windows for some time now, gamers who buy a Mac know that :)
15. miles01110 macrumors Core
miles01110
Joined:
Jul 24, 2006
Location:
The Ivory Tower (I'm not coming down)
#15
That might be true, but your statement actually doesn't address the superiority and expandability of desktops vs. laptops for gaming.
If you are only going to run windows on a computer, why would you pay a premium for a Mac? Especially if you're just going to complain about it's [lack of] performance in the gaming area?
16. kolax macrumors G3
Joined:
Mar 20, 2007
#16
1. So? Desktops will always be better for gaming. We're not saying the MacBook Pro is the ultimate gaming computer it is the ultimate gaming laptop at the thickness and weight.
2. Never said people would only run Windows on it... I have Windows 7 installed solely for games. Big deal.. I use OS X as my main OS, and when I want to play a game, I simply reboot into Windows. As does countless others...
17. Firefly2002 macrumors 65816
Joined:
Jan 9, 2008
#17
Apple's not exactly known for being truthful... look at their touting the PPC over the x86 and talking about "why they'd never use Intel CPUs in their computers," etc.
Jobs especially, lol.
18. alphaod macrumors Core
alphaod
Joined:
Feb 9, 2008
Location:
NYC
#18
Apple could just mean the ultimate gaming laptop out of the computer they sell? That's not lying at all; they didn't specify, but everyone assumed it meant out of all laptop computers.
19. Firefly2002 macrumors 65816
Joined:
Jan 9, 2008
#19
It was an unconditional statement.
20. mobilehaathi macrumors G3
mobilehaathi
Joined:
Aug 19, 2008
Location:
The Anthropocene
#20
In the context of Apple laptops, then sure it is. The thing with marketing is, they have no obligation to qualify or back it up in anyway.
21. BornAgainMac macrumors 603
BornAgainMac
Joined:
Feb 4, 2004
Location:
Florida Resident
#21
Compared to my last 2 generations of Macbook Pros, it is much better. I never had a PC run games as good on my older desktop PCs. In my world of gaming, it is the ultimate gaming laptop. It compares better to my prior Powermac G5 when I had the GeForce 6800 card with the same games. That was my best gaming experience on a Mac or PC.
Perhaps my ignorance is bliss since I don't have a PC with upgraded graphics to compare.
22. Macmoney macrumors member
Macmoney
Joined:
Mar 11, 2009
Location:
na
#22
I hate having to use boot camp,crossover,etc.....just to play the
"pc games" Apple has a very low number of studios producing good games for
the platform. Its like all there marbles are in the app/game development for itouch/ipod games.
23. akm3 macrumors 68020
Joined:
Nov 15, 2007
#23
I would consider it such if I could game for more than 15 seconds without black-screen hard locking my MBP.
24. miles01110 macrumors Core
miles01110
Joined:
Jul 24, 2006
Location:
The Ivory Tower (I'm not coming down)
#24
Exactly.
You're right- "we" are not saying this, "you" are. The issue of the MBP being good/bad for gaming is a non-issue as far as im concerned, as desktops will always be better. The point is that serious gamers should not be looking into laptops at all.
Congratulations? Not sure what this has to do with anything. A serious gamer has no use for OS X. A serious gaming Desktop won't have OS X on it, and if it does (in the form of a Mac Pro) then they've wasted their money. If you'd like to do it yourself, all you have to do is learn some programming and find out how Apple's code works. Nobody's stopping you.
25. daneoni macrumors G4
daneoni
Joined:
Mar 24, 2006
#25
Complete BS. The 9600 is an average card...if that. Yet another attempted RDF statement
Share This Page
|
{
"url": "https://forums.macrumors.com/threads/apple-say-mbp-is-the-ultimate-gaming-laptop.704963/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "270003",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XUKLUA46KXGFLTNZOBEMT5XVLM6U6N2F",
"WARC-Concurrent-To": "<urn:uuid:6320f005-d343-436d-93f8-fd51c8a229f0>",
"WARC-Date": "2018-07-23T14:10:52Z",
"WARC-IP-Address": "162.254.116.248",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KPHD25H6HGFVZQPUXISAOTK7KNPW4SSY",
"WARC-Record-ID": "<urn:uuid:cd8b7fc5-8cc3-4d4e-b38e-25f877443d2d>",
"WARC-Target-URI": "https://forums.macrumors.com/threads/apple-say-mbp-is-the-ultimate-gaming-laptop.704963/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:34428e86-c014-42d2-b237-3d03278e75d3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-187-89-169.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,
49,
50,
119,
120,
157,
158,
177,
178,
190,
207,
214,
312,
368,
369,
396,
913,
919,
944,
945,
955,
956,
968,
984,
998,
1051,
1079,
1080,
1094,
1095,
1107,
1124,
1131,
1283,
1289,
1325,
1326,
1345,
1346,
1358,
1375,
1389,
1396,
1403,
1539,
1545,
1580,
1581,
1599,
1600,
1612,
1629,
1643,
1660,
1667,
1764,
1770,
1798,
1799,
1813,
1814,
1826,
1843,
1850,
1896,
1902,
1929,
1930,
1942,
1943,
1955,
1972,
1986,
2004,
2011,
2038,
2039,
2101,
2107,
2142,
2143,
2155,
2171,
2178,
2553,
2559,
2594,
2595,
2607,
2624,
2631,
3016,
3022,
3050,
3051,
3063,
3079,
3087,
3427,
3433,
3462,
3463,
3477,
3478,
3490,
3507,
3515,
3598,
3599,
3730,
3736,
3761,
3762,
3774,
3791,
3799,
3875,
3876,
4001,
4007,
4039,
4040,
4055,
4056,
4068,
4085,
4099,
4141,
4149,
4239,
4245,
4270,
4271,
4283,
4300,
4308,
4436,
4437,
4533,
4539,
4571,
4572,
4587,
4588,
4600,
4617,
4631,
4673,
4681,
4819,
4820,
5012,
5018,
5043,
5044,
5056,
5073,
5081,
5262,
5263,
5492,
5498,
5532,
5533,
5545,
5561,
5569,
5741,
5742,
5768,
5774,
5803,
5804,
5816,
5817,
5829,
5845,
5859,
5867,
5875,
6064,
6070,
6104,
6105,
6117,
6133,
6141,
6180,
6186,
6218,
6219,
6236,
6237,
6249,
6266,
6280,
6301,
6309,
6452,
6458,
6491,
6492,
6509,
6510,
6522,
6538,
6552,
6573,
6581,
6920,
6921,
7014,
7020,
7052,
7053,
7066,
7067,
7079,
7096,
7110,
7117,
7125,
7195,
7274,
7374,
7380,
7407,
7408,
7420,
7437,
7445,
7557,
7563,
7595,
7596,
7611,
7612,
7624,
7641,
7655,
7697,
7705,
7718,
7719,
7971,
7972,
8335,
8341,
8368,
8369,
8381,
8382,
8394,
8411,
8419,
8511,
8517,
8518
],
"line_end_idx": [
49,
50,
119,
120,
157,
158,
177,
178,
190,
207,
214,
312,
368,
369,
396,
913,
919,
944,
945,
955,
956,
968,
984,
998,
1051,
1079,
1080,
1094,
1095,
1107,
1124,
1131,
1283,
1289,
1325,
1326,
1345,
1346,
1358,
1375,
1389,
1396,
1403,
1539,
1545,
1580,
1581,
1599,
1600,
1612,
1629,
1643,
1660,
1667,
1764,
1770,
1798,
1799,
1813,
1814,
1826,
1843,
1850,
1896,
1902,
1929,
1930,
1942,
1943,
1955,
1972,
1986,
2004,
2011,
2038,
2039,
2101,
2107,
2142,
2143,
2155,
2171,
2178,
2553,
2559,
2594,
2595,
2607,
2624,
2631,
3016,
3022,
3050,
3051,
3063,
3079,
3087,
3427,
3433,
3462,
3463,
3477,
3478,
3490,
3507,
3515,
3598,
3599,
3730,
3736,
3761,
3762,
3774,
3791,
3799,
3875,
3876,
4001,
4007,
4039,
4040,
4055,
4056,
4068,
4085,
4099,
4141,
4149,
4239,
4245,
4270,
4271,
4283,
4300,
4308,
4436,
4437,
4533,
4539,
4571,
4572,
4587,
4588,
4600,
4617,
4631,
4673,
4681,
4819,
4820,
5012,
5018,
5043,
5044,
5056,
5073,
5081,
5262,
5263,
5492,
5498,
5532,
5533,
5545,
5561,
5569,
5741,
5742,
5768,
5774,
5803,
5804,
5816,
5817,
5829,
5845,
5859,
5867,
5875,
6064,
6070,
6104,
6105,
6117,
6133,
6141,
6180,
6186,
6218,
6219,
6236,
6237,
6249,
6266,
6280,
6301,
6309,
6452,
6458,
6491,
6492,
6509,
6510,
6522,
6538,
6552,
6573,
6581,
6920,
6921,
7014,
7020,
7052,
7053,
7066,
7067,
7079,
7096,
7110,
7117,
7125,
7195,
7274,
7374,
7380,
7407,
7408,
7420,
7437,
7445,
7557,
7563,
7595,
7596,
7611,
7612,
7624,
7641,
7655,
7697,
7705,
7718,
7719,
7971,
7972,
8335,
8341,
8368,
8369,
8381,
8382,
8394,
8411,
8419,
8511,
8517,
8518,
8533
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8533,
"ccnet_original_nlines": 257,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35355284810066223,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0421721488237381,
"rps_doc_frac_lines_end_with_ellipsis": 0.003875969909131527,
"rps_doc_frac_no_alph_words": 0.25129982829093933,
"rps_doc_frac_unique_words": 0.3614545464515686,
"rps_doc_mean_word_length": 4.341818332672119,
"rps_doc_num_sentences": 108,
"rps_doc_symbol_to_word_ratio": 0.017331020906567574,
"rps_doc_unigram_entropy": 5.614053249359131,
"rps_doc_word_count": 1375,
"rps_doc_frac_chars_dupe_10grams": 0.06331658363342285,
"rps_doc_frac_chars_dupe_5grams": 0.11842545866966248,
"rps_doc_frac_chars_dupe_6grams": 0.10552763938903809,
"rps_doc_frac_chars_dupe_7grams": 0.09195979684591293,
"rps_doc_frac_chars_dupe_8grams": 0.06331658363342285,
"rps_doc_frac_chars_dupe_9grams": 0.06331658363342285,
"rps_doc_frac_chars_top_2gram": 0.022110549733042717,
"rps_doc_frac_chars_top_3gram": 0.03417085111141205,
"rps_doc_frac_chars_top_4gram": 0.03082077018916607,
"rps_doc_books_importance": -797.297119140625,
"rps_doc_books_importance_length_correction": -797.297119140625,
"rps_doc_openwebtext_importance": -481.8385314941406,
"rps_doc_openwebtext_importance_length_correction": -481.8385314941406,
"rps_doc_wikipedia_importance": -346.9388122558594,
"rps_doc_wikipedia_importance_length_correction": -346.9388122558594
},
"fasttext": {
"dclm": 0.042930539697408676,
"english": 0.9370860457420349,
"fineweb_edu_approx": 1.230723261833191,
"eai_general_math": 0.007520739920437336,
"eai_open_web_math": 0.07096076011657715,
"eai_web_code": 0.00008689999958733097
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-671,739,748,109,560,000 |
How to use preflightChecks method in Appium
Best JavaScript code snippet using appium
abstract-bread-provider.js
Source:abstract-bread-provider.js Github
copy
Full Screen
1'use strict';2// Internal dependencies3const render = require('../helpers/render');4const forms = require('../helpers/forms');5const router = require('express').Router();6const getResourceErrorHandler = require('./resource-error-handler');7/**8 * This is a generic class to provide middleware for Browse/Read/Edit/Add/Delete9 * operations and forms. It comes with some baked-in pre-flight checks but needs10 * to be extended to do useful work. All default actions except reads require11 * being logged in.12 *13 * Use the bakery method to create standard BREAD routes. :)14 */15class AbstractBREADProvider {16 /**17 * @param {IncomingMessage} req18 * Express request19 * @param {ServerResponse} res20 * Express response21 * @param {Function} next22 * Express callback to move on to next middleware23 * @param {Object} [options]24 * What kind of route to create25 * @param {String} options.action='add'26 * one of 'browse', 'read' (view), 'add' (create), 'edit', 'delete'27 * @param {String} options.method='GET'28 * what HTTP method this route responds to29 * @param {String} options.id30 * if required, what object ID to look up31 * @param {String} options.someOtherID32 * will also be assigned to `this`33 */34 constructor(req, res, next, options) {35 if (new.target === AbstractBREADProvider)36 throw new TypeError('AbstractBREADProvider is an abstract class, please instantiate a derived class.');37 if (!req || !res || !next)38 throw new Error('Form needs at least req, res, and next functions from middleware.');39 this.actions = {40 browse: {41 // Function to call for GET requests42 GET: this.browse_GET,43 // Checks to perform before either of above functions are called.44 // If checks fail, they are not called (checks have to handle45 // the request).46 preFlightChecks: [],47 // Title for all "browse" actions48 titleKey: undefined49 },50 read: {51 GET: this.read_GET,52 preFlightChecks: [],53 // Function to call to load data and pass it to GET/POST function.54 // This must perform exclusion of deleted or stale revisions.55 loadData: this.loadData,56 titleKey: undefined57 },58 add: {59 GET: this.add_GET,60 // Function to call for POST requests61 POST: this.add_POST,62 preFlightChecks: [this.userIsSignedIn],63 titleKey: undefined64 },65 edit: {66 GET: this.edit_GET,67 POST: this.edit_POST,68 preFlightChecks: [this.userIsSignedIn],69 // Function to call to load data and pass it to GET/POST function70 loadData: this.loadData,71 // Function to call to validate that user can perform this action,72 // once we have a resource to check against.73 resourcePermissionCheck: this.userCanEdit,74 titleKey: undefined75 },76 delete: {77 GET: this.delete_GET,78 POST: this.delete_POST,79 preFlightChecks: [this.userIsSignedIn],80 loadData: this.loadData,81 resourcePermissionCheck: this.userCanDelete,82 titleKey: undefined83 }84 };85 // Middleware functions86 this.req = req;87 this.res = res;88 this.next = next;89 // This is used for "not found" messages that must be in the format90 // "x not found" (for the body) and "x not found title" (for the title)91 this.messageKeyPrefix = '';92 // Defaults93 options = Object.assign({94 action: 'add',95 method: 'GET',96 id: undefined // only for edit/delete operations97 }, options);98 Object.assign(this, options);99 // Shortcuts to common helpers, which also lets us override these with100 // custom methods if appropriate101 this.renderTemplate = render.template.bind(render, this.req, this.res);102 this.renderResourceError = render.resourceError.bind(render, this.req, this.res);103 this.renderPermissionError = render.permissionError.bind(render, this.req, this.res);104 this.renderSigninRequired = render.signinRequired.bind(render, this.req, this.res);105 this.getResourceErrorHandler = getResourceErrorHandler.bind(getResourceErrorHandler, this.req, this.res, this.next);106 this.parseForm = forms.parseSubmission.bind(forms, this.req);107 }108 execute() {109 let actions = Object.keys(this.actions);110 if (actions.indexOf(this.action) == -1)111 throw new Error('Did not recognize form action: ' + this.type);112 if (typeof this.actions[this.action][this.method] != 'function')113 throw new Error('No defined handler for this method.');114 // Perform pre-flight checks (e.g., permission checks). Pre-flight checks115 // are responsible for rendering failure/result messages, so no116 // additional rendering will take place if any checks fail.117 let mayProceed = true;118 for (let check of this.actions[this.action].preFlightChecks) {119 let result = Reflect.apply(check, this, []);120 if (!result) {121 mayProceed = false;122 break; // First check to fail will be responsible for rendering error123 }124 }125 if (!mayProceed)126 return;127 if (!this.actions[this.action].loadData)128 Reflect.apply(this.actions[this.action][this.method], this, []); // Call appropriate handler129 else {130 // Asynchronously load data and show 404 if not found131 Reflect.apply(this.actions[this.action].loadData, this, [])132 .then(data => {133 // If we have a permission check, only proceeds if it succeeds.134 // If we don't have a permission check, proceed.135 if (!this.actions[this.action].resourcePermissionCheck ||136 Reflect.apply(this.actions[this.action].resourcePermissionCheck, this, [data]))137 Reflect.apply(this.actions[this.action][this.method], this, [data]);138 })139 .catch(this.getResourceErrorHandler(this.messageKeyPrefix, this.id));140 }141 }142 userIsSignedIn() {143 if (!this.req.user) {144 this.renderSigninRequired({145 titleKey: this.actions[this.action].titleKey146 });147 return false;148 } else149 return true;150 }151 userIsTrusted() {152 if (!this.req.user || !this.req.user.isTrusted) {153 this.renderPermissionError({154 titleKey: this.actions[this.action].titleKey,155 detailsKey: "must be trusted",156 });157 return false;158 } else159 return true;160 }161 userCan(action, data) {162 data.populateUserInfo(this.req.user);163 if (action == 'edit' && data.userCanEdit)164 return true;165 else if (action == 'delete' && data.userCanDelete)166 return true;167 else {168 this.renderPermissionError({169 titleKey: this.actions[this.action].titleKey170 });171 return false;172 }173 }174 userCanEdit(data) {175 return this.userCan('edit', data);176 }177 userCanDelete(data) {178 return this.userCan('delete', data);179 }180 // Adds a pre-flight check to all actions in provided array.181 // If not defined, adds to all actions182 addPreFlightCheck(actions, check) {183 if (!actions)184 actions = Object.keys(this.actions);185 for (let action of actions)186 this.actions[action].preFlightChecks.push(check);187 }188}189AbstractBREADProvider.getDefaultRoutes = function(resource) {190 // The default does not (yet) include a browse route.191 // The code below parses the IDs in the route, so be careful adding192 // non-standard patterns.193 return {194 add: {195 path: `/new/${resource}`,196 methods: ['GET', 'POST']197 },198 read: {199 path: `/${resource}/:id`,200 methods: ['GET']201 },202 edit: {203 path: `/${resource}/:id/edit`,204 methods: ['GET', 'POST']205 },206 delete: {207 path: `/${resource}/:id/delete`,208 methods: ['GET', 'POST']209 }210 };211};212// This registers default routes that are common for editable resources,213// following a standard pattern.214//215// resource -- the identifier used in URLs for the resource216// that is being configured.217//218// routes (optional) -- actions and associated Express routes that we want to219// set up. POST routes will only be created for add/edit/delete actions.220AbstractBREADProvider.bakeRoutes = function(resource, routes) {221 let Provider = this;222 if (!routes)223 routes = this.getDefaultRoutes(resource);224 function _bakeRoute(action, method, idArray) {225 return function(req, res, next) {226 let options = {227 action,228 method229 };230 // We always initialize each provider with the provided IDs,231 // ready for use as object properties.232 idArray.forEach(id => (options[id] = req.params[id]));233 let provider = new Provider(req, res, next, options);234 provider.execute();235 };236 }237 for (let action in routes) {238 // Extract variable placeholders239 let idMatches = routes[action].path.match(/\/:(.*?)(\/|$)/g);240 // Extract variable names241 let idArray = idMatches ? idMatches.map(id => id.match(/\w+/)[0]) : [];242 // Register router function for each specified method (GET, POST, etc.).243 // The router methods like router.get() are lower case.244 for (let method of routes[action].methods)245 router[method.toLowerCase()](routes[action].path,246 _bakeRoute(action, method, idArray));247 }248 return router;249};...
Full Screen
Full Screen
Builder.js
Source:Builder.js Github
copy
Full Screen
1var devopsmodeller = require('./modeller.js')2var ent = require('@bluefin605/entmodeller')3var enumBuilder = require('@bluefin605/entmodeller-devops-enumerator')4const DevOpsModeller = (function () {5 const _private = new WeakMap()6 const internal = (key) => {7 // Initialize if not created8 if (!_private.has(key)) {9 _private.set(key, {})10 }11 // Return private properties object12 return _private.get(key)13 }14 class DevOpsModeller {15 constructor(devOpsEnumBuilder, entModellerBuilder, attachmentMappers, releaseMappers, environmentMappers, transformers, preflightChecks) {16 internal(this).devOpsEnumBuilder = devOpsEnumBuilder;17 internal(this).entModellerBuilder = entModellerBuilder;18 internal(this).attachmentMappers = attachmentMappers;19 internal(this).releaseMappers = releaseMappers;20 internal(this).environmentMappers = environmentMappers;21 internal(this).transformers = transformers;22 internal(this).preflightChecks = preflightChecks;23 }24 static get Builder() {25 class Builder {26 constructor() {27 internal(this).attachmentMappers = [];28 internal(this).environmentMappers = [];29 internal(this).releaseMappers = [];30 internal(this).transformers = [];31 internal(this).entModellerBuilder = new ent.EntModeller.Builder();32 internal(this).devOpsEnumBuilder = new enumBuilder.Builder();33 internal(this).PreflightBuilder = new PreflightBuilder();34 }35 addNameTransformation(transform) {36 internal(this).transformers.push(transform);37 return this;38 }39 addAttachmentMapping(id, mapper) {40 internal(this).attachmentMappers.push({id: id, mapper: mapper});41 return this;42 }43 addReleaseMapping(mapper) {44 internal(this).releaseMappers.push({mapper: mapper});45 return this;46 }47 addEnvironmentMapping(mapper) {48 internal(this).environmentMappers.push({mapper: mapper});49 return this;50 }51 addPreflightChecks(initial, checks) {52 internal(this).PreflightBuilder.setInitialPayload(initial);53 checks(internal(this).PreflightBuilder);54 return this;55 }56 //===============================================================================================57 // DevOps devOpsEnumBuilder builders58 setConfigFromFile(filename) {59 internal(this).devOpsEnumBuilder.setConfigFromFile(filename);60 return this61 }62 setPersonalAccessToken(pat) {63 internal(this).devOpsEnumBuilder.setPersonalAccessToken(pat);64 return this65 }66 setOrgaization(organization) {67 internal(this).devOpsEnumBuilder.setOrgaization(organization);68 return this69 }70 setProject(project) {71 internal(this).devOpsEnumBuilder.setProject(project);72 return this73 }74 useDefaultFilter(nameParser) {75 internal(this).devOpsEnumBuilder.useDefaultFilter(nameParser);76 return this77 }78 79 addAttachment(id, filename, filter, responseType) {80 internal(this).devOpsEnumBuilder.addAttachment(id, filename, filter, responseType);81 return this82 }83 retrieveEnvironmentVariables() {84 internal(this).devOpsEnumBuilder.retrieveEnvironmentVariables();85 return this86 } 87 //===============================================================================================88 // EntModeller builders89 addEntityOverrides(overrides) {90 internal(this).entModellerBuilder.addEntityOverrides(overrides);91 return this92 }93 addEntityFills(fills) {94 internal(this).entModellerBuilder.addEntityFills(fills);95 return this96 }97 addRelationshipFills(fills) {98 internal(this).entModellerBuilder.addRelationshipFills(fills);99 return this100 }101 outputAsDOTDefaultServices(styles) {102 internal(this).entModellerBuilder.outputAsDOTDefaultServices(styles);103 return this104 }105 outputAsDOT(serviceShapes, styles) {106 internal(this).entModellerBuilder.outputAsDOT(serviceShapes, styles);107 return this108 }109 build() {110 var tracer = new DevOpsModeller(internal(this).devOpsEnumBuilder, internal(this).entModellerBuilder, internal(this).attachmentMappers, internal(this).releaseMappers, internal(this).environmentMappers, internal(this).transformers, internal(this).PreflightBuilder.build());111 return tracer;112 }113 }114 class PreflightBuilder {115 constructor() {116 internal(this).attachmentChecks = [];117 internal(this).environmentChecks = [];118 internal(this).releaseChecks = [];119 }120 setInitialPayload(initialValue) {121 internal(this).initialValue = initialValue;122 return this;123 }124 addAttachmentChecks(id, checker) {125 internal(this).attachmentChecks.push({id: id, checker: checker});126 return this;127 }128 addReleaseChecks(checker) {129 internal(this).releaseChecks.push({checker: checker});130 return this;131 }132 addEnvironmentChecks(checker) {133 internal(this).environmentChecks.push({checker: checker});134 return this;135 }136 build() {137 return {138 payload: internal(this).initialValue, 139 envChecks: internal(this).environmentChecks, 140 attChecks: internal(this).attachmentChecks, 141 relChecks: internal(this).releaseChecks142 }143 }144 }145 return Builder146 }147 async modelDevOps() {148 let results = devopsmodeller(internal(this).devOpsEnumBuilder, internal(this).entModellerBuilder, internal(this).attachmentMappers, internal(this).releaseMappers, internal(this).environmentMappers, internal(this).transformers, internal(this).preflightChecks);149 return results;150 }151 }152 return DevOpsModeller153}())154module.exports = {155 Builder: DevOpsModeller.Builder,156 mappers: require('./Helpers'),157 DotShapes: ent.EntModeller.DotShapes...
Full Screen
Full Screen
modeller.js
Source:modeller.js Github
copy
Full Screen
1class myAzureSource {2 constructor(devOpsEnum, attachmentMappers, releaseMappers, environmentMappers, transformers, preflightChecks) {3 this.devOpsEnum = devOpsEnum;4 this.attachmentMappers = attachmentMappers;5 this.releaseMappers = releaseMappers;6 this.environmentMappers = environmentMappers;7 this.transformers = transformers8 this.preflightChecks = preflightChecks;9 }10 generateSourceConnections() {11 return new Promise((resolve, reject) => {12 resolve(enumerateAzureReleases(this.devOpsEnum, this.attachmentMappers, this.releaseMappers, this.environmentMappers, this.transformers, this.preflightChecks))13 });14 }15}16async function modelAzureReleases(devOpsEnumBuilder, entModellerBuilder, attachmentMappers, releaseMappers, environmentMappers, transformers, preflightChecks) {17 var enumerator = devOpsEnumBuilder.latestReleasesOnly().build();18 var modeller = entModellerBuilder 19 .addSource("Azure", new myAzureSource(enumerator, attachmentMappers, releaseMappers, environmentMappers, transformers, preflightChecks), null)20 .build();21 let output = await modeller.generateOutput();22 return output;23}24async function enumerateAzureReleases(devOpsEnum, attachmentMappers, releaseMappers, environmentMappers, transformers, preflightChecks) {25 let allReleases = await devOpsEnum.enumerateDevOps()26 let releases = allReleases.reduce((acc, val) => acc.concat(val.items), []);27 // console.log('---------------------------------------------------------------')28 // console.log(JSON.stringify(releases));29 // console.log('---------------------------------------------------------------')30 let releasesWithAttachments = releases.filter(r => r.attachments.size > 0);31 let releasesWithEnvironment = releases.filter(r => r.environment?.variables != null);32 let results = [];33 let payload = preflightChecks?.payload;34 // call preflight checks35 //=======================================================36 preflightChecks.attChecks.forEach(checker => {37 let matches = releasesWithAttachments.filter(r => r.attachments.has(checker.id));38 matches.forEach(m => {39 let attachment = m.attachments.get(checker.id);40 checker.checker(payload, m.release, attachment, m.environment?.variables);41 });42 });43 preflightChecks.envChecks.forEach(checker => {44 releasesWithEnvironment.forEach(m => {45 checker.checker(payload, m.release, m.environment?.variables);46 });47 });48 preflightChecks.relChecks.forEach(checker => {49 releases.forEach(m => {50 checker.checker(payload, m.release, m.environment?.variables);51 });52 });53 // call mappers54 //===================================================55 attachmentMappers.forEach(mapper => {56 let matches = releasesWithAttachments.filter(r => r.attachments.has(mapper.id));57 matches.forEach(m => {58 let attachment = m.attachments.get(mapper.id);59 let mapped = mapper.mapper(payload, m.release, attachment, m.environment?.variables);60 if (mapped != null) {61 if (Array.isArray(mapped))62 results = results.concat(mapped);63 else64 results.push(mapped);65 }66 });67 });68 environmentMappers.forEach(mapper => {69 releasesWithEnvironment.forEach(m => {70 let mapped = mapper.mapper(payload, m.release, m.environment?.variables);71 if (mapped != null) {72 if (Array.isArray(mapped))73 results = results.concat(mapped);74 else75 results.push(mapped);76 }77 });78 });79 releaseMappers.forEach(mapper => {80 let mapped = mapper.mapper(payload, m.release, m.environment?.variables, r.attachments);81 if (mapped != null) {82 if (Array.isArray(mapped))83 results = results.concat(mapped);84 else85 results.push(mapped);86 }87 });88 //transform all the names89 results.forEach(r => {90 transformers.forEach(t => {91 r.from.name = t(r.from.name);92 r.to.name = t(r.to.name);93 })94 });95 return results;96}...
Full Screen
Full Screen
main.js
Source:main.js Github
copy
Full Screen
...86 if (!args) {87 args = parser.parseArgs();88 }89 await logsinkInit(args);90 await preflightChecks(parser, args);91 await logStartupInfo(parser, args);92 let router = getAppiumRouter(args);93 let server = await baseServer(router, args.port, args.address);94 try {95 // TODO prelaunch if args.launch is set96 // TODO: startAlertSocket(server, appiumServer);97 // configure as node on grid, if necessary98 if (args.nodeconfig !== null) {99 await registerNode(args.nodeconfig, args.address, args.port);100 }101 } catch (err) {102 server.close();103 throw err;104 }...
Full Screen
Full Screen
PreflightChecks.jsx
Source:PreflightChecks.jsx Github
copy
Full Screen
1import _ from 'underscore';2import { createTestHook } from 'util/test_support';3import React from 'react';4import PropTypes from 'prop-types';5import Success from '@splunk/react-icons/Success';6import Error from '@splunk/react-icons/Error';7import Button from '@splunk/react-ui/Button';8import Heading from '@splunk/react-ui/Heading';9import Menu from '@splunk/react-ui/Menu';10import WaitSpinner from '@splunk/react-ui/WaitSpinner';11import css from './WorkloadManagement.pcssm';12const PreflightChecks = (props) => {13 const {14 enableSettingsViewBtn,15 handleReRunPreflightCheck,16 handleShowSettingsView,17 isPreflightCheckLoading,18 checks,19 } = props;20 return (21 <div {...createTestHook(module.id)} className={css.table}>22 <Heading className={`${css.preFlightCheckHeading}`}>23 {_('Preflight Checks').t()}24 </Heading>25 <Menu>26 {checks.map(row => (27 <Menu.Item28 className={`${row.id} ${css.preFlightCheckMenuBtn}`}29 description={row.preflight_check_status ? '' : _(row.mitigation).t()}30 key={row.id}31 >32 {row.preflight_check_status ?33 <div className={css.successIcon}>34 <Success size="21px" />35 {_(row.title).t()}36 </div>37 :38 <div className={css.errorIcon}>39 <Error size="21px" />40 {_(row.title).t()}41 </div>42 }43 </Menu.Item>44 ))}45 </Menu>46 <Button47 style={{ marginTop: '5px' }}48 label={_('Rerun preflight checks').t()}49 onClick={handleReRunPreflightCheck}50 />51 <Button52 style={{ marginTop: '5px' }}53 disabled={!enableSettingsViewBtn}54 label={_('Settings View').t()}55 onClick={handleShowSettingsView}56 appearance="primary"57 />58 {isPreflightCheckLoading ?59 <WaitSpinner size="medium" style={{ padding: '6px' }} /> :60 null61 }62 </div>63 );64};65PreflightChecks.propTypes = {66 enableSettingsViewBtn: PropTypes.bool.isRequired,67 handleReRunPreflightCheck: PropTypes.func.isRequired,68 handleShowSettingsView: PropTypes.func.isRequired,69 isPreflightCheckLoading: PropTypes.bool.isRequired,70 checks: PropTypes.arrayOf(PropTypes.shape({})).isRequired,71};...
Full Screen
Full Screen
processHandler.js
Source:processHandler.js Github
copy
Full Screen
...27ProcessHandler.startTimer = () => {28 global.setInterval(ProcessHandler.runTasks, Config.processHandler.timerLength)29}30ProcessHandler.runTasks = () => { // TODO: Complete this function31 ProcessHandler.preflightChecks()32 .then(() => {33 })34 .catch((err) => {35 ProcessHandler.setTimerPaused(true)36 Logger.writeLog('PH_002', 'Failed to pass preflightChecks', err, true)37 })38}39ProcessHandler.preflightChecks = () => { // TODO: Complete this function40 return new Promise((fulfill, reject) => {41 if (!ProcessHandler.timerPaused && !ProcessHandler.tasksRunning) {42 fulfill()43 } else {44 reject(new Error('Preflight checks failed'))45 }...
Full Screen
Full Screen
test.preflightChecks.js
Source:test.preflightChecks.js Github
copy
Full Screen
...8 });9 it('should fail when path to inkscape is invalid', () => {10 config.pathToInkscape = '/some/random/stuff/that/will/never/exist';11 expect(() => {12 utils.preflightChecks(config);13 }).to.throw();14 });15 it('should fail when input directory is invalid', () => {16 config.inputDirectory = '/some/random/stuff/that/will/never/exist';17 expect(() => {18 utils.preflightChecks(config);19 }).to.throw();20 });21 it('should fail when output directory is invalid', () => {22 config.outputDirectory = '/some/random/stuff/that/will/never/exist';23 expect(() => {24 utils.preflightChecks(config);25 }).to.throw();26 });27 it('should fail when input is defined, but output not', () => {28 config.inputDirectory = __dirname + '/input';29 expect(() => {30 utils.preflightChecks(config);31 }).to.throw();32 });33 it('should work when input & output directory is defined', () => {34 config.outputDirectory = __dirname + '/output';35 config.inputDirectory = __dirname + '/input';36 expect(() => {37 utils.preflightChecks(config);38 }).to.not.throw();39 });...
Full Screen
Full Screen
index.js
Source:index.js Github
copy
Full Screen
1const defaultConfig = require('./defaultConfig');2const preflightChecks = require('./preflightChecks');3const commandParser = require('./commandParser');4const svg2pdf = require('./svg2pdf');5exports.preflightChecks = preflightChecks;6exports.defaultConfig = defaultConfig;7exports.commandParser = commandParser;...
Full Screen
Full Screen
Using AI Code Generation
copy
Full Screen
1driver.preflightChecks();2driver.postflightChecks();3driver.launchApp();4driver.closeApp();5driver.resetApp();6driver.isAppInstalled("com.whatsapp");7driver.installApp("C:/Users/Downloads/whatsapp.apk");8driver.removeApp("com.whatsapp");9driver.launchApp();10driver.runAppInBackground(5);11driver.startActivity("com.android.settings", ".Settings");12driver.endTestCoverage("com.android.settings", "coverage.ec");13driver.startRecordingScreen();14driver.stopRecordingScreen();15driver.lock();16driver.unlock();17driver.isLocked();18driver.shake();19driver.hideKeyboard();20driver.pressKeyCode(3);21driver.longPressKeyCode(3);22driver.getCurrentPackage();23driver.getCurrentActivity();24driver.getDeviceTime();25driver.pushFile("/data/local/tmp/test.txt", "Hello World");26driver.pullFile("/data/local/tmp/test.txt");27driver.pullFolder("/data/local/tmp/test.txt");
Full Screen
Using AI Code Generation
copy
Full Screen
1var AppiumServiceBuilder = require('appium').AppiumServiceBuilder;2var appiumServiceBuilder = new AppiumServiceBuilder();3appiumServiceBuilder.withPreLaunch(preLaunch);4appiumServiceBuilder.build().start();5var AppiumServiceBuilder = require('appium').AppiumServiceBuilder;6var appiumServiceBuilder = new AppiumServiceBuilder();7appiumServiceBuilder.withLogFile(logFile);8appiumServiceBuilder.build().start();9var AppiumServiceBuilder = require('appium').AppiumServiceBuilder;10var appiumServiceBuilder = new AppiumServiceBuilder();11appiumServiceBuilder.withLogTimestamp(logTimestamp);12appiumServiceBuilder.build().start();13var AppiumServiceBuilder = require('appium').AppiumServiceBuilder;14var appiumServiceBuilder = new AppiumServiceBuilder();15appiumServiceBuilder.withLogFile(logFile);16appiumServiceBuilder.build().start();17var AppiumServiceBuilder = require('appium').AppiumServiceBuilder;18var appiumServiceBuilder = new AppiumServiceBuilder();19appiumServiceBuilder.withLogTimestamp(logTimestamp);20appiumServiceBuilder.build().start();21var AppiumServiceBuilder = require('appium').AppiumServiceBuilder;22var appiumServiceBuilder = new AppiumServiceBuilder();23appiumServiceBuilder.withLogNoColors(logNoColors
Full Screen
Using AI Code Generation
copy
Full Screen
1var wd = require('wd');2var appium = require('appium');3var assert = require('assert');4var desiredCaps = {5};6var driver = wd.promiseChainRemote('localhost', 4723);7driver.init(desiredCaps)8 .then(function() {9 return driver.preflightChecks();10 })11 .then(function() {12 console.log("Preflight checks passed");13 })14 .nodeify(done);15var wd = require('wd');16var appium = require('appium');17var assert = require('assert');18var desiredCaps = {19};20var driver = wd.promiseChainRemote('localhost', 4723);21driver.init(desiredCaps)22 .then(function() {23 return driver.preflightChecks();24 })25 .then(function() {26 console.log("Preflight checks passed");27 })28 .nodeify(done);29var wd = require('wd');30var appium = require('appium');31var assert = require('assert');32var desiredCaps = {33};34var driver = wd.promiseChainRemote('localhost', 4723);35driver.init(desiredCaps)36 .then(function() {37 })38 .then(function(element) {39 return element.preflightChecks();40 })41 .then(function() {42 console.log("Preflight checks passed");43 })44 .nodeify(done);45var wd = require('wd');46var appium = require('appium');47var assert = require('assert');48var desiredCaps = {
Full Screen
Using AI Code Generation
copy
Full Screen
1let appiumServer = new AppiumServer();2appiumServer.preflightChecks();3class AppiumServer {4 preflightChecks() {5 console.log("preflightChecks");6 }7}8class AppiumServer {9 preflightChecks() {10 console.log("preflightChecks");11 }12}
Full Screen
Using AI Code Generation
copy
Full Screen
1var AppiumServer = require('appium-server');2var appiumServer = new AppiumServer();3appiumServer.preflightChecks();4var AppiumServer = require('appium-server');5var appiumServer = new AppiumServer();6appiumServer.start().then(function(){7 console.log('Appium server started');8});9var AppiumServer = require('appium-server');10var appiumServer = new AppiumServer();11appiumServer.stop().then(function(){12 console.log('Appium server stopped');13});14var AppiumServer = require('appium-server');15var appiumServer = new AppiumServer();16appiumServer.restart().then(function(){17 console.log('Appium server restarted');18});19var AppiumServer = require('appium-server');20var appiumServer = new AppiumServer();21appiumServer.isRunning().then(function(isRunning){22 console.log('Appium server running: ' + isRunning);23});24A sample project is available in the [sample](
Full Screen
Using AI Code Generation
copy
Full Screen
1var AppiumDriver = require("appium_driver");2var driver = new AppiumDriver();3driver.preflightChecks();4I have used the following code to use the preflightChecks() method of AppiumDriver in my project:5I have used the following code to use the preflightChecks() method of AppiumDriver in my project:6var AppiumDriver = require("appium_driver");7var driver = new AppiumDriver();8driver.preflightChecks();9I have used the following code to use the preflightChecks() method of AppiumDriver in my project:10var AppiumDriver = require("appium_driver");11var driver = new AppiumDriver();12driver.preflightChecks();13I have used the following code to use the preflightChecks() method of AppiumDriver in my project:14var AppiumDriver = require("appium_driver");15var driver = new AppiumDriver();16driver.preflightChecks();17I have used the following code to use the preflightChecks() method of AppiumDriver in my project:18var AppiumDriver = require("appium_driver");19var driver = new AppiumDriver();20driver.preflightChecks();21I have used the following code to use the preflightChecks() method of AppiumDriver in my project:22var AppiumDriver = require("appium_driver");23var driver = new AppiumDriver();24driver.preflightChecks();25I have used the following code to use the preflightChecks() method of AppiumDriver in my project:26var AppiumDriver = require("appium_driver");27var driver = new AppiumDriver();28driver.preflightChecks();29I have used the following code to use the preflightChecks() method of AppiumDriver in my project:30var AppiumDriver = require("appium_driver");31var driver = new AppiumDriver();32driver.preflightChecks();33I have used the following code to use the preflightChecks() method of AppiumDriver in my project:34var AppiumDriver = require("appium_driver");35var driver = new AppiumDriver();36driver.preflightChecks();37I have used the following code to use the preflightChecks() method of AppiumDriver in my project:38var AppiumDriver = require("appium_driver");39var driver = new AppiumDriver();40driver.preflightChecks();41I have used the following code to use the preflightChecks() method of AppiumDriver in my project:
Full Screen
Using AI Code Generation
copy
Full Screen
1var preflightChecks = require('appium').preflightChecks;2preflightChecks({3}, function(err, result) {4 if (err) {5 console.log('Error: ' + err);6 } else {7 console.log('Result: ' + result);8 }9});
Full Screen
Using AI Code Generation
copy
Full Screen
1const { AppiumDriver } = require('appium-base-driver');2let driver = new AppiumDriver();3let caps = {app:'path/to/my/app'};4driver.preflightChecks(caps);5var wd = require('wd');6I would like to know how to = require('appium');7var assert = require('assert');8var desiredCaps = {9};10var driver = wd.promiseChainRemote('localhost', 4723);11driver.init(desiredCaps)12 .then(function() {13 return driver.preflightChecks();14 })15 .then(function() {16 console.log("Preflight checks passed");17 })18 .nodeify(done);19var wd = require('wd');20var appium = require('appium');21var assert = require('assert');22var desiredCaps = {23 .then(function() {24 })25 .then(function(element) {26 return element.preflightChecks();27 })28 .then(function() {29 console.log("Preflight checks passed");30 })31 .nodeify(done);32var wd = require('wd');33var appium = require('appium');34var assert = require('assert');35var desiredCaps = {
Full Screen
Using AI Code Generation
copy
Full Screen
1var wd = require('wd');2var appium = require('appium');3var assert = require('assert');4var desiredCaps = {5};6var driver = wd.promiseChainRemote('localhost', 4723);7driver.init(desiredCaps)8 .then(function() {9 return driver.preflightChecks();10 })11 .then(function() {12 console.log("Preflight checks passed");13 })14 .nodeify(done);15var wd = require('wd');16var appium = require('appium');17var assert = require('assert');18var desiredCaps = {19};20var driver = wd.promiseChainRemote('localhost', 4723);21driver.init(desiredCaps)22 .then(function() {23 return driver.preflightChecks();24 })25 .then(function() {26 console.log("Preflight checks passed");27 })28 .nodeify(done);29var wd = require('wd');30var appium = require('appium');31var assert = require('assert');32var desiredCaps = {33};34var driver = wd.promiseChainRemote('localhost', 4723);35driver.init(desiredCaps)36 .then(function() {37 })38 .then(function(element) {39 return element.preflightChecks();40 })41 .then(function() {42 console.log("Preflight checks passed");43 })44 .nodeify(done);45var wd = require('wd');46var appium = require('appium');47var assert = require('assert');48var desiredCaps = {
Full Screen
Using AI Code Generation
copy
Full Screen
1let appiumServer = new AppiumServer();2appiumServer.preflightChecks();3class AppiumServer {4 preflightChecks() {5 console.log("preflightChecks");6 }7}8class AppiumServer {9 preflightChecks() {10 console.log("preflightChecks");11 }12}
Full Screen
Using AI Code Generation
copy
Full Screen
1var AppiumDriver = require("appium_driver");2var driver = new AppiumDriver();3driver.preflightChecks();4I have used the following code to use the preflightChecks() method of AppiumDriver in my project:5I have used the following code to use the preflightChecks() method of AppiumDriver in my project:6var AppiumDriver = require("appium_driver");7var driver = new AppiumDriver();8driver.preflightChecks();9I have used the following code to use the preflightChecks() method of AppiumDriver in my project:10var AppiumDriver = require("appium_driver");11var driver = new AppiumDriver();12driver.preflightChecks();13I have used the following code to use the preflightChecks() method of AppiumDriver in my project:14var AppiumDriver = require("appium_driver");15var driver = new AppiumDriver();16driver.preflightChecks();17I have used the following code to use the preflightChecks() method of AppiumDriver in my project:18var AppiumDriver = require("appium_driver");19var driver = new AppiumDriver();20driver.preflightChecks();21I have used the following code to use the preflightChecks() method of AppiumDriver in my project:22var AppiumDriver = require("appium_driver");23var driver = new AppiumDriver();24driver.preflightChecks();25I have used the following code to use the preflightChecks() method of AppiumDriver in my project:26var AppiumDriver = require("appium_driver");27var driver = new AppiumDriver();28driver.preflightChecks();29I have used the following code to use the preflightChecks() method of AppiumDriver in my project:30var AppiumDriver = require("appium_driver");31var driver = new AppiumDriver();32driver.preflightChecks();33I have used the following code to use the preflightChecks() method of AppiumDriver in my project:34var AppiumDriver = require("appium_driver");35var driver = new AppiumDriver();36driver.preflightChecks();37I have used the following code to use the preflightChecks() method of AppiumDriver in my project:38var AppiumDriver = require("appium_driver");39var driver = new AppiumDriver();40driver.preflightChecks();41I have used the following code to use the preflightChecks() method of AppiumDriver in my project:
Full Screen
Using AI Code Generation
copy
Full Screen
1var AppiumDriver = require("appium_driver");2var driver = new AppiumDriver();3driver.preflightChecks();4I have used the following code to use the preflightChecks() method of AppiumDriver in my project:5I have used the following code to use the preflightChecks() method of AppiumDriver in my project:6var AppiumDriver = require("appium_driver");7var driver = new AppiumDriver();8driver.preflightChecks();9I have used the following code to use the preflightChecks() method of AppiumDriver in my project:10var AppiumDriver = require("appium_driver");11var driver = new AppiumDriver();12driver.preflightChecks();13I have used the following code to use the preflightChecks() method of AppiumDriver in my project:14var AppiumDriver = require("appium_driver");ing lk
Full Screen
Using AI Code Generation
copy
Full Screen
1const { AppiumDriver } = require('appium-base-driver');2letdriver = new AppiumDriver();3et caps = {app:'path/to/my/app'};4drver.preflightChecks(caps);5var driver = new AppiumDriver();6driver.preflightChecks();7I have used the following code to use the preflightChecks() method of AppiumDriver in my project:8var AppiumDriver = require("appium_driver");9var driver = new AppiumDriver();10driver.preflightChecks();11I have used the following code to use the preflightChecks() method of AppiumDriver in my project:12var AppiumDriver = require("appium_driver");13var driver = new AppiumDriver();14driver.preflightChecks();15I have used the following code to use the preflightChecks() method of AppiumDriver in my project:16var AppiumDriver = require("appium_driver");17var driver = new AppiumDriver();18driver.preflightChecks();19I have used the following code to use the preflightChecks() method of AppiumDriver in my project:20var AppiumDriver = require("appium_driver");21var driver = new AppiumDriver();22driver.preflightChecks();23I have used the following code to use the preflightChecks() method of AppiumDriver in my project:24var AppiumDriver = require("appium_driver");25var driver = new AppiumDriver();26driver.preflightChecks();27I have used the following code to use the preflightChecks() method of AppiumDriver in my project:28var AppiumDriver = require("appium_driver");29var driver = new AppiumDriver();30driver.preflightChecks();31I have used the following code to use the preflightChecks() method of AppiumDriver in my project:
Full Screen
Using AI Code Generation
copy
Full Screen
1var preflightChecks = require('appium').preflightChecks;2preflightChecks({3}, function(err, result) {4 if (err) {5 console.log('Error: ' + err);6 } else {7 console.log('Result: ' + result);8 }9});
Full Screen
Automation Testing Tutorials
Learn to execute automation testing from scratch with LambdaTest Learning Hub. Right from setting up the prerequisites to run your first automation test, to following best practices and diving deeper into advanced test scenarios. LambdaTest Learning Hubs compile a list of step-by-step guides to help you be proficient with different test automation frameworks i.e. Selenium, Cypress, TestNG etc.
LambdaTest Learning Hubs:
YouTube
You could also refer to video tutorials over LambdaTest YouTube channel to get step by step demonstration from industry experts.
Run Appium automation tests on LambdaTest cloud grid
Perform automation testing on 3000+ real desktop and mobile devices online.
Try LambdaTest Now !!
Get 100 minutes of automation test minutes FREE!!
Next-Gen App & Browser Testing Cloud
Was this article helpful?
Helpful
NotHelpful
|
{
"url": "https://www.lambdatest.com/automation-testing-advisor/javascript/appium-preflightChecks",
"source_domain": "www.lambdatest.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "440821",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QP4OQOSGADL3MQK64V7SI2W2XRX5TVS5",
"WARC-Concurrent-To": "<urn:uuid:5b22b0a5-82fa-4aa2-9222-89d186f8b05f>",
"WARC-Date": "2023-06-07T01:10:32Z",
"WARC-IP-Address": "104.18.5.65",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FYPOIYYKRZ6SDAVP6FIREEZDEJO446R2",
"WARC-Record-ID": "<urn:uuid:18e7fc9a-9abb-40f9-9280-f5497f1d7242>",
"WARC-Target-URI": "https://www.lambdatest.com/automation-testing-advisor/javascript/appium-preflightChecks",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a2027109-17f2-4d39-90f2-1fcece80e24a>"
},
"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-52\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,
44,
45,
87,
88,
115,
116,
157,
158,
163,
164,
176,
177,
9694,
9695,
9707,
9708,
9720,
9721,
9732,
9733,
9758,
9759,
9764,
9765,
9777,
9778,
17433,
17434,
17446,
17447,
17459,
17460,
17472,
17473,
17499,
17500,
17505,
17506,
17518,
17519,
21926,
21927,
21939,
21940,
21952,
21953,
21961,
21962,
21984,
21985,
21990,
21991,
22003,
22004,
22612,
22613,
22625,
22626,
22638,
22639,
22659,
22660,
22694,
22695,
22700,
22701,
22713,
22714,
25542,
25543,
25555,
25556,
25568,
25569,
25587,
25588,
25620,
25621,
25626,
25627,
25639,
25640,
26323,
26324,
26336,
26337,
26349,
26350,
26374,
26375,
26413,
26414,
26419,
26420,
26432,
26433,
27571,
27572,
27584,
27585,
27597,
27598,
27607,
27608,
27631,
27632,
27637,
27638,
27650,
27651,
27968,
27969,
27981,
27982,
27994,
27995,
28020,
28021,
28026,
28027,
28039,
28040,
28905,
28906,
28918,
28919,
28944,
28945,
28950,
28951,
28963,
28964,
30189,
30190,
30202,
30203,
30228,
30229,
30234,
30235,
30247,
30248,
31514,
31515,
31527,
31528,
31553,
31554,
31559,
31560,
31572,
31573,
31818,
31819,
31831,
31832,
31857,
31858,
31863,
31864,
31876,
31877,
32758,
32759,
32771,
32772,
32797,
32798,
32803,
32804,
32816,
32817,
34968,
34969,
34981,
34982,
35007,
35008,
35013,
35014,
35026,
35027,
35248,
35249,
35261,
35262,
35287,
35288,
35293,
35294,
35306,
35307,
36288,
36289,
36301,
36302,
36327,
36328,
36333,
36334,
36346,
36347,
37613,
37614,
37626,
37627,
37652,
37653,
37658,
37659,
37671,
37672,
37917,
37918,
37930,
37931,
37956,
37957,
37962,
37963,
37975,
37976,
40127,
40128,
40140,
40141,
40166,
40167,
40172,
40173,
40185,
40186,
40947,
40948,
40960,
40961,
40986,
40987,
40992,
40993,
41005,
41006,
42549,
42550,
42562,
42563,
42588,
42589,
42594,
42595,
42607,
42608,
42829,
42830,
42842,
42843,
42872,
42873,
43270,
43271,
43297,
43298,
43306,
43307,
43436,
43437,
43490,
43491,
43567,
43568,
43590,
43591,
43641,
43642,
43679,
43680,
43706,
43707,
43715,
43716
],
"line_end_idx": [
44,
45,
87,
88,
115,
116,
157,
158,
163,
164,
176,
177,
9694,
9695,
9707,
9708,
9720,
9721,
9732,
9733,
9758,
9759,
9764,
9765,
9777,
9778,
17433,
17434,
17446,
17447,
17459,
17460,
17472,
17473,
17499,
17500,
17505,
17506,
17518,
17519,
21926,
21927,
21939,
21940,
21952,
21953,
21961,
21962,
21984,
21985,
21990,
21991,
22003,
22004,
22612,
22613,
22625,
22626,
22638,
22639,
22659,
22660,
22694,
22695,
22700,
22701,
22713,
22714,
25542,
25543,
25555,
25556,
25568,
25569,
25587,
25588,
25620,
25621,
25626,
25627,
25639,
25640,
26323,
26324,
26336,
26337,
26349,
26350,
26374,
26375,
26413,
26414,
26419,
26420,
26432,
26433,
27571,
27572,
27584,
27585,
27597,
27598,
27607,
27608,
27631,
27632,
27637,
27638,
27650,
27651,
27968,
27969,
27981,
27982,
27994,
27995,
28020,
28021,
28026,
28027,
28039,
28040,
28905,
28906,
28918,
28919,
28944,
28945,
28950,
28951,
28963,
28964,
30189,
30190,
30202,
30203,
30228,
30229,
30234,
30235,
30247,
30248,
31514,
31515,
31527,
31528,
31553,
31554,
31559,
31560,
31572,
31573,
31818,
31819,
31831,
31832,
31857,
31858,
31863,
31864,
31876,
31877,
32758,
32759,
32771,
32772,
32797,
32798,
32803,
32804,
32816,
32817,
34968,
34969,
34981,
34982,
35007,
35008,
35013,
35014,
35026,
35027,
35248,
35249,
35261,
35262,
35287,
35288,
35293,
35294,
35306,
35307,
36288,
36289,
36301,
36302,
36327,
36328,
36333,
36334,
36346,
36347,
37613,
37614,
37626,
37627,
37652,
37653,
37658,
37659,
37671,
37672,
37917,
37918,
37930,
37931,
37956,
37957,
37962,
37963,
37975,
37976,
40127,
40128,
40140,
40141,
40166,
40167,
40172,
40173,
40185,
40186,
40947,
40948,
40960,
40961,
40986,
40987,
40992,
40993,
41005,
41006,
42549,
42550,
42562,
42563,
42588,
42589,
42594,
42595,
42607,
42608,
42829,
42830,
42842,
42843,
42872,
42873,
43270,
43271,
43297,
43298,
43306,
43307,
43436,
43437,
43490,
43491,
43567,
43568,
43590,
43591,
43641,
43642,
43679,
43680,
43706,
43707,
43715,
43716,
43726
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 43726,
"ccnet_original_nlines": 280,
"rps_doc_curly_bracket": 0.010062660090625286,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1316641867160797,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010712509974837303,
"rps_doc_frac_lines_end_with_ellipsis": 0.02846975065767765,
"rps_doc_frac_no_alph_words": 0.47421523928642273,
"rps_doc_frac_unique_words": 0.40802037715911865,
"rps_doc_mean_word_length": 9.4420747756958,
"rps_doc_num_sentences": 700,
"rps_doc_symbol_to_word_ratio": 0.001494770054705441,
"rps_doc_unigram_entropy": 6.262630939483643,
"rps_doc_word_count": 3142,
"rps_doc_frac_chars_dupe_10grams": 0.2581656277179718,
"rps_doc_frac_chars_dupe_5grams": 0.28597432374954224,
"rps_doc_frac_chars_dupe_6grams": 0.2782890200614929,
"rps_doc_frac_chars_dupe_7grams": 0.25968247652053833,
"rps_doc_frac_chars_dupe_8grams": 0.25968247652053833,
"rps_doc_frac_chars_dupe_9grams": 0.25968247652053833,
"rps_doc_frac_chars_top_2gram": 0.01752788946032524,
"rps_doc_frac_chars_top_3gram": 0.012235820293426514,
"rps_doc_frac_chars_top_4gram": 0.022246940061450005,
"rps_doc_books_importance": -3587.998779296875,
"rps_doc_books_importance_length_correction": -3587.998779296875,
"rps_doc_openwebtext_importance": -2525.78759765625,
"rps_doc_openwebtext_importance_length_correction": -2525.78759765625,
"rps_doc_wikipedia_importance": -1661.47705078125,
"rps_doc_wikipedia_importance_length_correction": -1661.47705078125
},
"fasttext": {
"dclm": 0.7769531011581421,
"english": 0.39954161643981934,
"fineweb_edu_approx": 3.2400968074798584,
"eai_general_math": 0.5777176022529602,
"eai_open_web_math": 0.15701168775558472,
"eai_web_code": 0.8013581037521362
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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,576,862,886,734,406,700 |
summaryrefslogtreecommitdiffstats
path: root/contrib
Commit message (Expand)AuthorAgeFilesLines
* RPM: Allow running 'make rpms' on RHEL 5 machinesStephen Gallagher2012-05-151-5/+7
* Build experimental features by default in RPMsStephen Gallagher2012-03-081-0/+2
* Make RPM spec more explicitStephen Gallagher2012-03-081-2/+20
* Prune python provides correctlyStephen Gallagher2012-03-081-5/+8
* Eliminate build-time requirement for nscdStephen Gallagher2012-02-271-1/+0
* Add tool to convert debug levelsStephen Gallagher2012-02-221-0/+100
* Fix missing %endif in sssd.spec.insssd-1_8_0_beta3sssd-1_7_93Stephen Gallagher2012-02-151-0/+1
* Move sss_ssh_* binaries to the main 'sssd' packageStephen Gallagher2012-02-151-6/+7
* SSH: Build man pages conditionallyJan Cholasta2012-02-141-1/+1
* Make sudo installation path configurable, install into libdir by defaultJakub Hrozek2012-02-071-2/+2
* SSH: OpenSSH known_hosts clientJan Cholasta2012-02-071-0/+2
* SSH: OpenSSH authorized_keys clientJan Cholasta2012-02-071-0/+4
* AUTOFS: a client libraryJakub Hrozek2012-02-051-0/+13
* SUDO: Provide documentation for the SUDO APIJakub Hrozek2012-01-301-0/+6
* SSSDConfigAPI: Move sssd.api.* to /usr/share/sssdStephen Gallagher2012-01-301-6/+3
* Add a new Makefile target to build RPMs with the experimental flagJakub Hrozek2012-01-171-1/+37
* Update spec file to build with Glib on RHEL 5Stephen Gallagher2011-12-121-2/+9
* Fix typo in specfileStephen Gallagher2011-09-151-2/+2
* Do not build documentation on RHEL 5Stephen Gallagher2011-09-151-1/+17
* Add libipa_hbac documentation to the -devel packageStephen Gallagher2011-09-081-1/+5
* Remove all libtool .la files from RPMStephen Gallagher2011-09-061-13/+2
* sss_debuglevel - change the debug levels on the flyPavel Březina2011-09-062-0/+4
* Fix typo in %configureStephen Gallagher2011-09-021-1/+1
* Add option to specify the kerberos replay cache dirStephen Gallagher2011-09-021-0/+2
* Fix broken RHEL5 buildStephen Gallagher2011-08-111-0/+1
* Remove private shared object Provides: for pysss.so and pyhbac.soStephen Gallagher2011-08-101-0/+6
* Include the configuration file as a %ghost entryStephen Gallagher2011-08-101-0/+1
* Rename sssd.conf to sssd-example.confStephen Gallagher2011-08-081-4/+3
* Require matched version and release for libipa_hbacStephen Gallagher2011-08-011-0/+1
* libipa_hbac: Support case-insensitive comparisons with UTF8Stephen Gallagher2011-07-291-0/+1
* Provide python bindings for the HBAC evaluator libraryJakub Hrozek2011-07-081-1/+16
* Add HBAC evaluator and testsStephen Gallagher2011-07-081-0/+29
* Ensure that SSSD always Requires: the primary-arch sssd-clientStephen Gallagher2011-05-311-1/+1
* Add support for openldap24 package on RHEL 5.7Sumit Bose2011-05-061-0/+8
* Include manpage for sss_cacheStephen Gallagher2011-05-041-0/+1
* Cache cleaning toolJan Zeleny2011-05-041-0/+1
* Fix specfile for RHEL5Stephen Gallagher2011-02-161-0/+10
* Detect the proper location for memberof.soStephen Gallagher2011-02-141-2/+6
* Minor specfile changesStephen Gallagher2011-02-141-1/+2
* Make SSSDConfig API configuration readableStephen Gallagher2011-02-031-4/+4
* Fix handling of translated man pages in spec fileSumit Bose2011-01-311-4/+15
* Add missing gettext BuildRequiresStephen Gallagher2011-01-251-0/+1
* Add uk translation to specfileStephen Gallagher2011-01-241-0/+1
* Remove unnecessary po4a BuildRequiresStephen Gallagher2010-12-231-1/+0
* Build and install translated man pages by defaultSumit Bose2010-12-231-1/+0
* Add Czech translationJakub Hrozek2010-12-221-0/+2
* Make manual pages translatableJakub Hrozek2010-12-221-0/+2
* Move sss_* tools into their own subpackageStephen Gallagher2010-12-061-16/+33
* Assorted specfile changesStephen Gallagher2010-10-131-8/+10
* Rename upgrade_config.py and build it properlyStephen Gallagher2010-10-131-4/+0
|
{
"url": "https://fedorapeople.org/cgit/jhrozek/public_git/sssd.git/log/contrib?h=sssd-1_8_6",
"source_domain": "fedorapeople.org",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "25917",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SPUV7DUN24ATBECFBPZSDS66I3YEY4QM",
"WARC-Concurrent-To": "<urn:uuid:588d7fd6-c250-4e1d-b521-4fc9b1a2bf98>",
"WARC-Date": "2022-05-22T17:11:41Z",
"WARC-IP-Address": "152.19.134.199",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Q4RVAFFAPILIC5EMDXHARQVIPSRIRH7Y",
"WARC-Record-ID": "<urn:uuid:1b4ee186-778c-4e87-b617-d322e9387eb8>",
"WARC-Target-URI": "https://fedorapeople.org/cgit/jhrozek/public_git/sssd.git/log/contrib?h=sssd-1_8_6",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:21b70dde-47ea-4c74-8045-c5ce3f3add5e>"
},
"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-253\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
34,
53,
96,
181,
263,
327,
394,
471,
541,
638,
724,
789,
892,
954,
1020,
1076,
1151,
1236,
1334,
1415,
1471,
1544,
1631,
1705,
1788,
1846,
1933,
1991,
2092,
2176,
2249,
2336,
2431,
2517,
2582,
2680,
2755,
2820,
2868,
2927,
3005,
3063,
3141,
3220,
3289,
3355,
3428,
3506,
3558,
3619,
3699,
3761
],
"line_end_idx": [
34,
53,
96,
181,
263,
327,
394,
471,
541,
638,
724,
789,
892,
954,
1020,
1076,
1151,
1236,
1334,
1415,
1471,
1544,
1631,
1705,
1788,
1846,
1933,
1991,
2092,
2176,
2249,
2336,
2431,
2517,
2582,
2680,
2755,
2820,
2868,
2927,
3005,
3063,
3141,
3220,
3289,
3355,
3428,
3506,
3558,
3619,
3699,
3761,
3842
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3842,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08105023205280304,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019406389445066452,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5707762837409973,
"rps_doc_frac_unique_words": 0.6610644459724426,
"rps_doc_mean_word_length": 8.602240562438965,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.2223615646362305,
"rps_doc_word_count": 357,
"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.007815039716660976,
"rps_doc_frac_chars_top_3gram": 0.0091175502166152,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -330.1412353515625,
"rps_doc_books_importance_length_correction": -330.1412353515625,
"rps_doc_openwebtext_importance": -146.2440185546875,
"rps_doc_openwebtext_importance_length_correction": -146.2440185546875,
"rps_doc_wikipedia_importance": -132.4076385498047,
"rps_doc_wikipedia_importance_length_correction": -132.4076385498047
},
"fasttext": {
"dclm": 0.8081634640693665,
"english": 0.47129949927330017,
"fineweb_edu_approx": 0.9117293953895569,
"eai_general_math": 0.014170889742672443,
"eai_open_web_math": 0.18910151720046997,
"eai_web_code": 0.9940093755722046
}
}
|
{
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,139,634,598,300,995,100 |
Search results
1. C
2 year contract. Why?
I was just thinking the other night about the renewal of the 2 yr contract because of the purchase of the iPhone on day of release. WHY were we required to agree to a new 2 year contract? Other than the "exclusivity" of having an iPhone, there was no other incentive. We all paid full price of...
2. C
What do you want fixed on your Gen 1 iPhone?
Thought I'd start a thread here of what changes we'd like to see in software upgrades and/or future models. Here are my wishes so far: 1. Include soft case. 2. Ability to send text to multiple recipients. 3. Create groups in contacts. 4. Allow ringtone assignment for groups. 5. Adjust size of...
3. C
Is Yahoo! really push email?
I understand the word "push" as real time email reception, right? Well, I just tested my Yahoo! account and it's not pushing. In other words, email doesn't show up there in real time, it's still governed by the setting on the phone. Can someone confirm or deny that Yahoo! is push email?
4. C
Password Keeper type app?
I need an app that will keep all of my passwords both for easy access and added security if I should lose my iPhone. Anyone know of one they can recommend?
|
{
"url": "http://forums.everythingicafe.com/search/660187/",
"source_domain": "forums.everythingicafe.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "66179",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WPBIIM2GRBDPQFFIF5G7JJ7IKLAI2BUA",
"WARC-Concurrent-To": "<urn:uuid:b7e230d7-a242-41e1-9527-88d5d7a0bdb4>",
"WARC-Date": "2020-04-01T11:23:45Z",
"WARC-IP-Address": "67.225.188.206",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BNDXVIA7V5MFT3R2PMMYSMENY7HABVTE",
"WARC-Record-ID": "<urn:uuid:f0213ba7-ce67-4675-b70e-315a222a1d30>",
"WARC-Target-URI": "http://forums.everythingicafe.com/search/660187/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:08bad9e1-ca2f-4277-920f-af1e41989b9b>"
},
"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-20.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,
15,
16,
23,
24,
50,
51,
352,
359,
360,
409,
410,
711,
718,
719,
752,
753,
1045,
1052,
1053,
1083,
1084
],
"line_end_idx": [
15,
16,
23,
24,
50,
51,
352,
359,
360,
409,
410,
711,
718,
719,
752,
753,
1045,
1052,
1053,
1083,
1084,
1243
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1243,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.375,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03928570821881294,
"rps_doc_frac_lines_end_with_ellipsis": 0.09090909361839294,
"rps_doc_frac_no_alph_words": 0.22142857313156128,
"rps_doc_frac_unique_words": 0.644444465637207,
"rps_doc_mean_word_length": 4.075555324554443,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.007142859976738691,
"rps_doc_unigram_entropy": 4.755756378173828,
"rps_doc_word_count": 225,
"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.01635769009590149,
"rps_doc_frac_chars_top_3gram": 0.028353329747915268,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -98.36612701416016,
"rps_doc_books_importance_length_correction": -98.36612701416016,
"rps_doc_openwebtext_importance": -64.31268310546875,
"rps_doc_openwebtext_importance_length_correction": -64.31268310546875,
"rps_doc_wikipedia_importance": -51.93001174926758,
"rps_doc_wikipedia_importance_length_correction": -51.93001174926758
},
"fasttext": {
"dclm": 0.7950242161750793,
"english": 0.962512731552124,
"fineweb_edu_approx": 0.922615110874176,
"eai_general_math": 0.09491313248872757,
"eai_open_web_math": 0.13590162992477417,
"eai_web_code": 0.011206570081412792
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-600,346,658,142,634,100 |
Custom document with signature
Hi everyone,
Is it possible to create a document that we could print with the T1 package so that it gets sent to the customer for e-signature with other forms and it automatically places the signature fields just like it does for the other forms? I am using docusign and this would be helpful for T1s with T2125 as we could send the whole package, including the HST return for signature in just one click.
Yes, you can do that.
1 Like
You can create a new template or clone/update an existing one. This is the format for the signature anchor:
1 Like
|
{
"url": "https://www.protaxcommunity.com/t/custom-document-with-signature/6782",
"source_domain": "www.protaxcommunity.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "22720",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V76G4GMMMJTR7UNSLWC3QP43NIBVFKKC",
"WARC-Concurrent-To": "<urn:uuid:984b9e65-eb2e-4491-9bb0-a5ee11ed4e3c>",
"WARC-Date": "2023-06-06T00:40:55Z",
"WARC-IP-Address": "184.105.99.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2QW77VTUL72CJWFEHR3V7YNRT7KMFLWY",
"WARC-Record-ID": "<urn:uuid:d2714b58-4198-4917-b1de-40d242cc206a>",
"WARC-Target-URI": "https://www.protaxcommunity.com/t/custom-document-with-signature/6782",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fa839644-beb4-4c63-bd63-6edd5fc79545>"
},
"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,
45,
46,
439,
440,
462,
463,
470,
471,
579,
580
],
"line_end_idx": [
31,
32,
45,
46,
439,
440,
462,
463,
470,
471,
579,
580,
586
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 586,
"ccnet_original_nlines": 12,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5378151535987854,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.033613450825214386,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10084033757448196,
"rps_doc_frac_unique_words": 0.6168224215507507,
"rps_doc_mean_word_length": 4.336448669433594,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.004820346832275,
"rps_doc_word_count": 107,
"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.030172409489750862,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -69.08951568603516,
"rps_doc_books_importance_length_correction": -83.29773712158203,
"rps_doc_openwebtext_importance": -36.63596725463867,
"rps_doc_openwebtext_importance_length_correction": -50.84419250488281,
"rps_doc_wikipedia_importance": -31.27662467956543,
"rps_doc_wikipedia_importance_length_correction": -45.4848518371582
},
"fasttext": {
"dclm": 0.24284416437149048,
"english": 0.919519305229187,
"fineweb_edu_approx": 1.0544641017913818,
"eai_general_math": 0.8590986728668213,
"eai_open_web_math": 0.20341020822525024,
"eai_web_code": 0.14924228191375732
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
-9,012,515,778,909,906,000 |
3. Enter data
4. View results
Quantify agreement with kappa
This calculator assesses how well two observers, or two methods, classify subjects into groups. The degree of agreement is quantified by kappa.
1. How many categories?
Caution: Changing number of categories will erase your data.
Into how many categories does each observer classify the subjects? For example, choose 3 if each subject is categorized into 'mild', 'moderate' and 'severe'.
2. Enter data
Each cell in the table is defined by its row and column. The rows designate how each subject was classified by the first observer (or method). The columns designate how the other observer (or method) classified the subjects. For example, enter into the second row of the first column the number of subjects that the first observer classified into category 'B' and the second observer classified into category 'A'. Enter into the second column of the second row the number of subjects classified by both observers into category 'B'. Subjects categorized identically by both observers are always tallied in the diagonal of the table.
A B C D E
A
B
C
D
E
3. View the results
Analyze, graph and present your scientific work easily with GraphPad Prism. No coding required.
|
{
"url": "https://www.graphpad.com/quickcalcs/kappa1/?K=5",
"source_domain": "www.graphpad.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "32446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QIQVSZYY7JVWHICXX3BY5WY656WK5JLT",
"WARC-Concurrent-To": "<urn:uuid:69f94c5e-f781-41ca-aff3-7639cd37c0be>",
"WARC-Date": "2023-03-21T10:37:13Z",
"WARC-IP-Address": "3.209.27.59",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QZ5UTYZZEAIW65DKRBKKEBN6FR2AIRQT",
"WARC-Record-ID": "<urn:uuid:e2fc11f7-3219-4b59-96c0-7aa012885aeb>",
"WARC-Target-URI": "https://www.graphpad.com/quickcalcs/kappa1/?K=5",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c56ed6c1-3f0a-4611-9c26-49e8d5f08ad0>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-134\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
14,
30,
31,
61,
62,
206,
207,
231,
232,
293,
294,
452,
453,
467,
468,
1100,
1101,
1111,
1113,
1115,
1117,
1119,
1121,
1122,
1142,
1143
],
"line_end_idx": [
14,
30,
31,
61,
62,
206,
207,
231,
232,
293,
294,
452,
453,
467,
468,
1100,
1101,
1111,
1113,
1115,
1117,
1119,
1121,
1122,
1142,
1143,
1238
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1238,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3443983495235443,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05394190922379494,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17842324078083038,
"rps_doc_frac_unique_words": 0.45098039507865906,
"rps_doc_mean_word_length": 4.81862735748291,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.212587356567383,
"rps_doc_word_count": 204,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.010172939859330654,
"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.036622580140829086,
"rps_doc_frac_chars_top_3gram": 0.03458800166845322,
"rps_doc_frac_chars_top_4gram": 0.04272634908556938,
"rps_doc_books_importance": -95.1462631225586,
"rps_doc_books_importance_length_correction": -95.1462631225586,
"rps_doc_openwebtext_importance": -67.80575561523438,
"rps_doc_openwebtext_importance_length_correction": -67.80575561523438,
"rps_doc_wikipedia_importance": -38.368377685546875,
"rps_doc_wikipedia_importance_length_correction": -38.368377685546875
},
"fasttext": {
"dclm": 0.8471044898033142,
"english": 0.8910086750984192,
"fineweb_edu_approx": 3.3415377140045166,
"eai_general_math": 0.9761396050453186,
"eai_open_web_math": 0.5292599201202393,
"eai_web_code": 0.8364589214324951
}
}
|
{
"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": "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
|
-980,887,729,363,242,000 |
fbpx
Customer Support
+353 (01) 620 5500
Sales Enquires
+353 (01) 233 8686
A Business Guide to Penetration Testing in Ireland
Team of hackers hired by government to test their firewall
In today’s interconnected digital environment, cybersecurity is no longer an optional luxury but a critical necessity. For businesses operating in Ireland, as is the case globally, the escalating instances of cyber threats only reiterate the need for solid digital defenses. One strategy, essential to understanding and bolstering these defenses, is penetration testing. But what is it, why is it crucial for Irish businesses, and how should they go about it? Let’s delve in.
What is Penetration Testing?
Penetration testing, often referred to as ‘pen testing’ or ‘ethical hacking’, is a cyber-security practice wherein professional ethical hackers attempt to breach an organization’s digital defenses. This is done to identify vulnerabilities that might be exploited by malicious entities. Rather than waiting for a real attacker, companies can proactively discover weaknesses and address them.
Why is Penetration Testing Essential for Irish Businesses?
1. Growing Digital Economy: Ireland has emerged as a hub for tech businesses and startups. With an increasingly digital economy, the stakes are higher when it comes to data breaches.
2. Regulatory Compliance: GDPR, which affects all EU member states including Ireland, mandates businesses to ensure personal data is protected. Penetration testing can help businesses meet (and demonstrate) these regulatory standards.
3. Increasing Sophistication of Cyber Attacks: From ransomware to phishing scams, cyber threats are becoming more intricate and challenging to prevent. Penetration testing equips businesses with insights to combat these threats.
Steps to Undertake Penetration Testing in Ireland:
1. Define the Scope: Determine what you want the test to cover. Is it your entire digital infrastructure or just specific systems? Clearly defining the scope ensures the test is both efficient and effective.
2. Choose the Right Pen Testing Firm: Ireland boasts numerous cybersecurity firms. Ensure you select a reputable one with a track record of delivering actionable insights.
3. Conduct the Test: The ethical hackers will attempt to breach your systems during an agreed-upon period.
4. Review and Analyse the Results: Once the test is complete, the firm will provide a comprehensive report detailing the vulnerabilities discovered and the potential impact of these vulnerabilities.
5. Address the Vulnerabilities: This is the most crucial step. Use the insights from the report to patch vulnerabilities, enhance defenses, and better train your staff.
6. Repeat Periodically: Cyber threats evolve. Regularly scheduled penetration tests ensure that businesses stay one step ahead.
Conclusion:
Penetration testing is more than just a security measure; it’s a business imperative. For Irish enterprises aiming to protect their data, reputation, and bottom line, understanding the nuances of ‘pen testing’ is a must.
In the rapidly evolving landscape of cyber threats, staying passive is not an option. By proactively seeking out and rectifying vulnerabilities, businesses in Ireland can ensure they are well-equipped to tackle whatever the digital age throws at them.
NEED IT SUPPORT?
Don’t let IT complexity slow down your business growth. Request a complimentary business IT Audit and consultation with a Landmark expert.
Our experts will analyze your current IT infrastructure, identify areas for improvement, and propose tailored, scalable solutions that boost efficiency, secure your data, and support your business as it grows.
Share this post with your friends
Need Help?
Schedule A Callback
Book a free 15 min call with an IT consultant today!
Our experts can help you understand your IT needs, risks and most appropriate solutions.
Landmark Technologies, are subject to the company’s privacy policy
|
{
"url": "https://landmark.ie/a-business-guide-to-penetration-testing-in-ireland/",
"source_domain": "landmark.ie",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "269684",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:R7KTXD3MQFMMEV4UOCSV7U27TMZNCDC6",
"WARC-Concurrent-To": "<urn:uuid:4bf7ebbc-b5d9-42c0-b484-cd43c48bb109>",
"WARC-Date": "2024-08-08T03:44:10Z",
"WARC-IP-Address": "35.197.245.96",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3IVTKG7AFBPESBJP4B5SKVOKAAYXDOKP",
"WARC-Record-ID": "<urn:uuid:c7af9a13-40a2-4e63-a3a8-d05427632041>",
"WARC-Target-URI": "https://landmark.ie/a-business-guide-to-penetration-testing-in-ireland/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4a3580fd-9937-4ac6-928e-d9c1319fa0bb>"
},
"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-197\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
5,
6,
23,
24,
43,
44,
59,
60,
79,
80,
131,
132,
191,
192,
668,
669,
698,
699,
1090,
1091,
1150,
1151,
1336,
1573,
1804,
1805,
1856,
1857,
2067,
2241,
2350,
2551,
2722,
2852,
2853,
2865,
2866,
3087,
3088,
3340,
3341,
3358,
3359,
3498,
3499,
3709,
3710,
3744,
3745,
3757,
3758,
3778,
3779,
3832,
3833,
3922,
3923
],
"line_end_idx": [
5,
6,
23,
24,
43,
44,
59,
60,
79,
80,
131,
132,
191,
192,
668,
669,
698,
699,
1090,
1091,
1150,
1151,
1336,
1573,
1804,
1805,
1856,
1857,
2067,
2241,
2350,
2551,
2722,
2852,
2853,
2865,
2866,
3087,
3088,
3340,
3341,
3358,
3359,
3498,
3499,
3709,
3710,
3744,
3745,
3757,
3758,
3778,
3779,
3832,
3833,
3922,
3923,
3989
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3989,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3145275115966797,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016925249248743057,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18053597211837769,
"rps_doc_frac_unique_words": 0.5254237055778503,
"rps_doc_mean_word_length": 5.520339012145996,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.275966167449951,
"rps_doc_word_count": 590,
"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.04973902180790901,
"rps_doc_frac_chars_top_3gram": 0.01842186041176319,
"rps_doc_frac_chars_top_4gram": 0.01657967083156109,
"rps_doc_books_importance": -297.0691223144531,
"rps_doc_books_importance_length_correction": -297.0691223144531,
"rps_doc_openwebtext_importance": -141.74188232421875,
"rps_doc_openwebtext_importance_length_correction": -141.74188232421875,
"rps_doc_wikipedia_importance": -146.5189208984375,
"rps_doc_wikipedia_importance_length_correction": -146.5189208984375
},
"fasttext": {
"dclm": 0.5345264077186584,
"english": 0.9123191833496094,
"fineweb_edu_approx": 2.22843599319458,
"eai_general_math": 0.004325089976191521,
"eai_open_web_math": 0.05723452940583229,
"eai_web_code": 0.010621730238199234
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.4038",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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
|
-3,342,424,521,560,092,000 |
Lesson 4
Solutions in Context
These materials, when encountered before Algebra 1, Unit 2, Lesson 4 support success in that lesson.
Lesson Narrative
The main mathematical ideas in the lesson are connecting expressions and equations with situations, and making sense of solutions in the context of both the equation and the situation.
The work of this lesson connects to previous work done in grades 7 and 8 as students represent situations characterized by linear relationships symbolically.
This lesson prepares students for the associated Algebra 1 lesson by re-introducing the idea of a solution to an equation in a context, and helping students understand what it means for a number, or numbers, to be a solution to an equation. It also reviews skills for representing situations with equations and solving equations.
Students reason abstractly and quantitatively (MP2) by considering the meaning of represented quantities in context, and by using expressions and equations to reason about contexts.
Learning Goals
Teacher Facing
• Create expressions or equations given a situation.
• Understand what the solution to an equation in two variables represents.
Student Facing
• Let’s use equations to describe situations.
CCSS Standards
Addressing
Building Towards
|
{
"url": "https://curriculum.illustrativemathematics.org/HS/teachers/4/2/4/preparation.html",
"source_domain": "curriculum.illustrativemathematics.org",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "43091",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W7CSPVJGVVOGQQKVPKUI23YIXZK6VNJA",
"WARC-Concurrent-To": "<urn:uuid:ca8dba23-7005-4f6c-b443-65e114dd25ac>",
"WARC-Date": "2021-04-17T15:12:04Z",
"WARC-IP-Address": "52.21.175.83",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WAHPQHQ7F2JKEVYAJKX5GNSLGHZUTBTP",
"WARC-Record-ID": "<urn:uuid:96d9d257-dab9-43f7-ab69-1e92fe3f44e7>",
"WARC-Target-URI": "https://curriculum.illustrativemathematics.org/HS/teachers/4/2/4/preparation.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8489c0a1-b1bc-4742-a5db-90f97fbb8e8f>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-236.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
9,
10,
31,
32,
133,
134,
151,
152,
337,
338,
496,
497,
827,
828,
1010,
1011,
1026,
1027,
1042,
1043,
1098,
1175,
1176,
1191,
1192,
1240,
1241,
1256,
1257,
1268,
1269
],
"line_end_idx": [
9,
10,
31,
32,
133,
134,
151,
152,
337,
338,
496,
497,
827,
828,
1010,
1011,
1026,
1027,
1042,
1043,
1098,
1175,
1176,
1191,
1192,
1240,
1241,
1256,
1257,
1268,
1269,
1285
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1285,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3611111044883728,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009259260259568691,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14351852238178253,
"rps_doc_frac_unique_words": 0.5388600826263428,
"rps_doc_mean_word_length": 5.450777053833008,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.329263210296631,
"rps_doc_word_count": 193,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06273764371871948,
"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.028517110273241997,
"rps_doc_frac_chars_top_3gram": 0.034220531582832336,
"rps_doc_frac_chars_top_4gram": 0.057034220546483994,
"rps_doc_books_importance": -71.99214172363281,
"rps_doc_books_importance_length_correction": -71.99214172363281,
"rps_doc_openwebtext_importance": -54.6988639831543,
"rps_doc_openwebtext_importance_length_correction": -54.6988639831543,
"rps_doc_wikipedia_importance": -41.92582702636719,
"rps_doc_wikipedia_importance_length_correction": -41.92582702636719
},
"fasttext": {
"dclm": 0.03920125961303711,
"english": 0.9229335188865662,
"fineweb_edu_approx": 3.2670321464538574,
"eai_general_math": 0.99891197681427,
"eai_open_web_math": 0.5372080206871033,
"eai_web_code": 0.2951046824455261
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
8,755,409,505,916,214,000 |
Infomir
0
What is MAG?
What is MAG?
Infomir’s MAG is one the common IPTV devices in the world. After 2007, Infomir produces Set-Top Boxes following the brand name MAG. These Set-Top Boxes are multi-functional devices that allow you to ...
0
Suggestions for Purchase a MAG Box
Suggestions for Purchase a MAG Box
In this article we are going to give you some useful information to make the best decision before buy a MAG box.What is MAG? Note: The suggestions in this article can be changed by the time, so ...
0
How to setup IPTV on MAG Box?
How to setup IPTV on MAG Box?
In this tutorial, we are going to show you how to bring IPTV channels to your MAG device. How to setup IPTV on a MAG device Step 1: When the box is being loaded the main portal screen appears. ...
0
What is MAC address on MAG Box?
What is MAC address on MAG Box?
MAC, an acronym of Media Access Control address, is a unique feature which identifies device manufacturers’ registered number and will be usable when the device has to be utilized in network ...
0
How to update MAG?
How to update MAG?
Sometimes the best way to fix an issue is to update the MAG box to the latest version of the released firmware. The below instructions will guide you through on how to update your MAG box firmware. ...
0
How to change Portal address on MAG?
How to change Portal address on MAG?
Sometimes you may require changing your portal address to another IPTV provider and the steps below will guide you through the entire process of changing your portal address on your MAG box. How ...
0
MAG Box Problems
MAG Box Problems
We usually face with some specific issues in MAG boxes.The 2 prevalent error messages we meet are: STB blocked or Black Screen Page Loading Error Loading bar stuck In this article we ...
0
What is Android Box?
What is Android Box?
It is a mini PC device running the Android operating system which can be used for watching IPTV. There exist various Android TV Box brands including Nvidia Shield, Amazon Fire ...
error: Content is protected !!
REVOIPTV
Logo
Shopping cart
|
{
"url": "https://revoiptv.com/tag/infomir/",
"source_domain": "revoiptv.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "115117",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QLPD2OD3DHXUCK3QKVXGQHJNL32VSSGI",
"WARC-Concurrent-To": "<urn:uuid:593dda7b-3952-4adf-9128-158cbad40591>",
"WARC-Date": "2024-05-22T05:57:54Z",
"WARC-IP-Address": "104.21.24.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DU4CB2K6RNFUPSLYGEYPIHHIJXID2CCW",
"WARC-Record-ID": "<urn:uuid:425dec74-dec3-4de6-a41c-80f36bcf33f7>",
"WARC-Target-URI": "https://revoiptv.com/tag/infomir/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:87bd97af-b43d-4934-bc33-78f9707bb942>"
},
"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-184\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,
8,
10,
11,
24,
25,
38,
39,
242,
243,
245,
246,
281,
282,
317,
318,
516,
517,
519,
520,
550,
551,
581,
582,
779,
780,
782,
783,
815,
816,
848,
849,
1044,
1045,
1047,
1048,
1067,
1068,
1087,
1088,
1290,
1291,
1293,
1294,
1331,
1332,
1369,
1370,
1569,
1570,
1572,
1573,
1590,
1591,
1608,
1609,
1796,
1797,
1799,
1800,
1821,
1822,
1843,
1844,
2024,
2025,
2056,
2065,
2070
],
"line_end_idx": [
8,
10,
11,
24,
25,
38,
39,
242,
243,
245,
246,
281,
282,
317,
318,
516,
517,
519,
520,
550,
551,
581,
582,
779,
780,
782,
783,
815,
816,
848,
849,
1044,
1045,
1047,
1048,
1067,
1068,
1087,
1088,
1290,
1291,
1293,
1294,
1331,
1332,
1369,
1370,
1569,
1570,
1572,
1573,
1590,
1591,
1608,
1609,
1796,
1797,
1799,
1800,
1821,
1822,
1843,
1844,
2024,
2025,
2056,
2065,
2070,
2083
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2083,
"ccnet_original_nlines": 68,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33806148171424866,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08983451873064041,
"rps_doc_frac_lines_end_with_ellipsis": 0.11594203114509583,
"rps_doc_frac_no_alph_words": 0.13711583614349365,
"rps_doc_frac_unique_words": 0.4324324429035187,
"rps_doc_mean_word_length": 4.354053974151611,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.018912529572844505,
"rps_doc_unigram_entropy": 4.548460483551025,
"rps_doc_word_count": 370,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.13904407620429993,
"rps_doc_frac_chars_dupe_6grams": 0.1291123479604721,
"rps_doc_frac_chars_dupe_7grams": 0.0931098684668541,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04096833989024162,
"rps_doc_frac_chars_top_3gram": 0.019863439723849297,
"rps_doc_frac_chars_top_4gram": 0.026070760563015938,
"rps_doc_books_importance": -192.70474243164062,
"rps_doc_books_importance_length_correction": -192.70474243164062,
"rps_doc_openwebtext_importance": -128.67068481445312,
"rps_doc_openwebtext_importance_length_correction": -128.67068481445312,
"rps_doc_wikipedia_importance": -99.5802993774414,
"rps_doc_wikipedia_importance_length_correction": -99.5802993774414
},
"fasttext": {
"dclm": 0.034265220165252686,
"english": 0.8826674818992615,
"fineweb_edu_approx": 1.7478539943695068,
"eai_general_math": 0.0004694499948527664,
"eai_open_web_math": 0.058545950800180435,
"eai_web_code": 0.00019937999604735523
}
}
|
{
"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": "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": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
243,430,143,331,728,770 |
USER32: Hide cursor when calling SetCursor with NULL HCURSOR
Andreas Mohr andi at rhlx01.fht-esslingen.de
Wed Feb 8 07:11:37 CST 2006
Hi,
On Fri, Feb 03, 2006 at 07:50:51PM -0500, Justin Chevrier wrote:
> Changelog:
> Hide cursor if SetCursor is called with a NULL HCURSOR
Which obviously implies the question:
What if the program does a SetCursor(something) later? Should it then re-show a
cursor previously hidden by a NULL handle? And if so, does Wine handle that
re-showing properly?
I'd better have a program with duplicate cursor than one without any cursor any
more at all ;)
Andreas
More information about the wine-devel mailing list
|
{
"url": "https://www.winehq.org/pipermail/wine-devel/2006-February/044753.html",
"source_domain": "www.winehq.org",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "3163",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:N3FHR24NHRIY4K6ZV7CPUG7BBTSHVZ3Z",
"WARC-Concurrent-To": "<urn:uuid:5780832c-f81e-4661-be64-06168b6b01b5>",
"WARC-Date": "2017-07-27T09:31:19Z",
"WARC-IP-Address": "209.46.25.134",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZEOORANGHVL26TPBOJRWFSR4I34OZW54",
"WARC-Record-ID": "<urn:uuid:865e3230-4269-4f49-a896-2299d1b15685>",
"WARC-Target-URI": "https://www.winehq.org/pipermail/wine-devel/2006-February/044753.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b1369d9e-3d6a-4f46-be68-8711adaecf51>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-169-199.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,
61,
62,
107,
135,
136,
137,
141,
142,
207,
220,
277,
315,
395,
471,
492,
572,
587,
588,
596,
597,
598,
599
],
"line_end_idx": [
61,
62,
107,
135,
136,
137,
141,
142,
207,
220,
277,
315,
395,
471,
492,
572,
587,
588,
596,
597,
598,
599,
649
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 649,
"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.2937062978744507,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06293705850839615,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27272728085517883,
"rps_doc_frac_unique_words": 0.7156862616539001,
"rps_doc_mean_word_length": 4.970588207244873,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.156121730804443,
"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.03944772854447365,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -58.723968505859375,
"rps_doc_books_importance_length_correction": -68.40377807617188,
"rps_doc_openwebtext_importance": -26.89403533935547,
"rps_doc_openwebtext_importance_length_correction": -36.5738410949707,
"rps_doc_wikipedia_importance": -27.243059158325195,
"rps_doc_wikipedia_importance_length_correction": -36.92286682128906
},
"fasttext": {
"dclm": 0.08472204208374023,
"english": 0.8508189916610718,
"fineweb_edu_approx": 1.128225326538086,
"eai_general_math": 0.02740282006561756,
"eai_open_web_math": 0.11064893007278442,
"eai_web_code": 0.00004529999932856299
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.458",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "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": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-706,389,009,324,542,000 |
Skip to content
Google BigQuery
Skip to the problems!
BigQuery is a serverless, cost-effective and multicloud data warehouse designed to help you turn big data into valuable business insights.
See the official BigQuery site for details and documentation.
Setup
1. Head over to cloud.google.com/bigquery
2. Click "Try BigQuery free" or "Go to console", depending on whether you've already signed up for Google Cloud
3. If you haven't already signed up for Google Cloud Platform, follow the steps to sign up.
Important: You must provide a credit card to use Google Cloud Platform. However, BigQuery has a pretty generous free tier which won't be exceeded by the following practice problems.
Pricing
BigQuery charges for data storage and processing (details). However, it has a generous free tier that lets you store up to 10GB of data and process up to 1TB of data per month. If you exceed these limits, you will be charged (~$0.02 per GB of storage and $0.005 per GB of data processed, as of July 2022).
|
{
"url": "https://www.practiceprobs.com/problemsets/google-bigquery/",
"source_domain": "www.practiceprobs.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "319328",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4W7LKNNGWSPHAVGVF5Y3KYELPBNXURFC",
"WARC-Concurrent-To": "<urn:uuid:e302aed8-66c2-4d7a-80d6-a3535c62f8e9>",
"WARC-Date": "2022-11-29T05:12:57Z",
"WARC-IP-Address": "34.148.19.16",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:B3LSIZLE3T35G2ESIR474S4PKBRFBQAH",
"WARC-Record-ID": "<urn:uuid:427a2414-b831-4ce6-ad8d-767a9f110ed6>",
"WARC-Target-URI": "https://www.practiceprobs.com/problemsets/google-bigquery/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:44c08d1a-624c-4ed2-bb57-a5a72f0cd5e4>"
},
"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-125\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
17,
33,
34,
56,
57,
196,
197,
259,
260,
266,
267,
311,
425,
519,
520,
702,
703,
711,
712
],
"line_end_idx": [
16,
17,
33,
34,
56,
57,
196,
197,
259,
260,
266,
267,
311,
425,
519,
520,
702,
703,
711,
712,
1017
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1017,
"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.3349056541919708,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018867919221520424,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20283019542694092,
"rps_doc_frac_unique_words": 0.6011905074119568,
"rps_doc_mean_word_length": 4.732142925262451,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.364174842834473,
"rps_doc_word_count": 168,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07295597344636917,
"rps_doc_frac_chars_dupe_6grams": 0.07295597344636917,
"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.04150943085551262,
"rps_doc_frac_chars_top_3gram": 0.03773584961891174,
"rps_doc_frac_chars_top_4gram": 0.04528301954269409,
"rps_doc_books_importance": -114.20687103271484,
"rps_doc_books_importance_length_correction": -114.20687103271484,
"rps_doc_openwebtext_importance": -54.213497161865234,
"rps_doc_openwebtext_importance_length_correction": -40.378761291503906,
"rps_doc_wikipedia_importance": -52.44943618774414,
"rps_doc_wikipedia_importance_length_correction": -52.44943618774414
},
"fasttext": {
"dclm": 0.2647000551223755,
"english": 0.9280747771263123,
"fineweb_edu_approx": 0.9966167211532593,
"eai_general_math": 0.0022299299016594887,
"eai_open_web_math": 0.01395845040678978,
"eai_web_code": 0.0009104000055231154
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,143,708,819,220,177,400 |
capsule review
Marked excels at previewing Markdown and HTML documents
At a Glance
• Brett Terpstra Marked 1.3.2
Macworld Rating
Here at Macworld, we’re big fans of Markdown, a nifty markup language that lets you write for the Web using plain text and a simple formatting syntax. In fact, many of the articles you read here on Macworld.com were written using Markdown and later converted to XHTML for publication. Why do we like it? It’s easy to write in Markdown; it’s easy to read the code (especially if you use one of the many text editors that include Markdown syntax highlighting); and because Markdown files are plain text, you can use any text editor or word processor, on any platform.
But the topic of today’s Mac Gems review isn’t Markdown. Rather, it’s Marked (Mac App Store link), a standout utility that provides live previews of Markdown-formatted files—in other words, it shows you what such files will look like when converted to HTML or XHTML. (Marked also supports text, HTML, and MultiMarkdown files. MultiMarkdown is an extension of Markdown that offers more-complex formatting and additional output/export formats.) Suffice it to say that if you don’t use Markdown, or if you aren’t at least interested in it, today’s Gem isn’t for you; I’ll see you on Friday. If you are a Markdown user, or if the first couple paragraphs here have piqued your interest, read on.
Drag any Markdown-formatted document (or, again, a text, HTML, or MultiMarkdown document) onto the Marked icon in the Finder or the Dock, and Marked opens a window showing a preview of what that document will look like when rendered in HTML. Regardless of which app you're using to edit that document, whenever you save changes, Marked automatically updates its preview to reflect those changes.
So far, Marked probably doesn’t sound much different than the built-in Markdown-preview feature of a growing number of Markdown-enabled OS X text editors, such as BBEdit and iA Writer. But Marked’s previews are much more flexible and customizable, and Marked provides a number of writing-focused tools for analyzing your documents and for exporting their content.
Marked's Antique style
For example, Marked offers several preview styles, including an attractive multi-column view, and you can add your own CSS templates. (I use a template that mimics the Macworld website so I can see how an article will look once I import it into our content-management system and publish it on the site.) You can quickly switch between preview styles—say, the standard and mobile versions of your website—using keyboard shortcuts. You can also easily make your preview text larger or smaller, or invert the preview’s colors.
Each Marked window can behave as a normal window or float above all other windows, and you can configure Marked to make its preview windows partially transparent whenever they're not the active (frontmost) window.
If your document has section headers (h2 through h6), a button at the bottom of the Marked window shows a hierarchical list of those sections, letting you quickly jump to any part of the document; Marked momentarily highlights the chosen header. You can also add up to nine arbitrary bookmarks anywhere in the document by placing the cursor at a desired location and pressing Shift-# (where # is a number from 1 to 9); you can jump to a bookmark by pressing just the bookmark number (1 to 9), and you can progress through bookmarks using the N (next) and P (previous) keys. (Forget a keyboard shortcut? Just press H—for help—and a convenient overlay displays Marked’s document-navigation shortcuts.) While previewing your document, you can use the Find command to locate particular words and phrases in the text.
Marked's multiple-columns style
While previewing a file, Marked provides a number of useful statistics. For example, the document’s word count is displayed at the bottom of the window; click the word count to show the line, word, and character counts. These counts are updated in real time, and they helpfully omit formatting characters. Select a block of text in the preview, and a popover displays the same three metrics, but for just the selected text. The Readability Statistics option shows you Reading Ease and Grade Level (based on the Flesch-Kincaid readability test) and Fog Index scores.
Marked also offers a unique Visualize Word Repetition feature that shows your document with repeated words in bold; you choose whether Marked looks for repetition at the paragraph or document level. Move the pointer over a bolded word, and all other instances of that word are highlighted; click a bold word for a higher-contrast view that dims the entire document except for instances of that word. It’s a great tool for avoiding repetition in your writing.
Marked's Visualize Word Repetition view
At any time, you can click the HTML button at the bottom of the Marked window to view the HTML source code that corresponds to your Markdown text and formatting.
When you’re done writing, Marked makes it easy to export or convert your Markdown to other formats. Pressing Shift-Command-C (or choosing Copy HTML from Marked's action or menu-bar menu) copies the document’s generated HTML code to the clipboard for pasting elsewhere—for example, into your blogging software or content-management system. You can also copy part or all of the preview view to paste the rendered text into any rich-text document or email message.
Alternatively, you can save the document's rendered HTML code to a new HTML document—with or without your chosen preview style included—or save the rendered preview to a formatted RTF file. Finally, you can print the preview version of the document, or you can save it as a rendered PDF without the hassle of going through OS X’s printing dialog box. (Marked uses the chosen preview style for printing and PDF saving.)
As noted above, Marked also supports MultiMarkdown (including math syntax), and screenplay writers may be interested in Screenplay Markdown and using that syntax in Marked. You can also use Marked with other Markdown processors—or even non-Markdown syntax processors—by adding them in Marked’s preferences dialog. (The program also offers a number of advanced options that determine how code is processed.) And while Marked’s AppleScript dictionary is relatively basic, it allows you to integrate Marked into an automated workflow—or, in my case, to create an Open In Marked script that opens the current BBEdit document in Marked using a keyboard shortcut.
When I first saw Marked, I questioned the need for it, given that my favorite text editor, BBEdit, offered its own preview feature. But after using Marked for a few months, I’m a convert. It’s so much better than the built-in preview feature of most Markdown-focused writing apps that it’s worth running in addition to those apps. And because it’s not tied to any particular text editor, you can take advantage of Marked’s features regardless of which editor—or editors—you choose to use.
Want to stay up to date with the latest Gems? Sign up for the Mac Gems newsletter for a weekly email summary of Gems reviews sent directly to your Inbox. You can also follow Mac Gems on Twitter.
At a Glance
• Brett Terpstra Marked 1.3.2
Macworld Rating
Shop Tech Products at Amazon
|
{
"url": "http://www.macworld.com/article/1164744/marked_excels_at_previewing_markdown_and_html_documents.html",
"source_domain": "www.macworld.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "123292",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:76TGTFNJSUXSKJB667LX4GVZUSOW36E3",
"WARC-Concurrent-To": "<urn:uuid:0e12dabc-9eca-4a5f-9e38-f00e58bc6518>",
"WARC-Date": "2017-06-26T07:21:14Z",
"WARC-IP-Address": "151.101.32.230",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WWMCJMLAMGEILGLUDCSMR6ZYCZA42HXP",
"WARC-Record-ID": "<urn:uuid:76f781ed-3fe2-41c4-940c-437d87c0dca4>",
"WARC-Target-URI": "http://www.macworld.com/article/1164744/marked_excels_at_previewing_markdown_and_html_documents.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dd86f780-ed8c-444c-9f4d-6b305456cb83>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-166-82-77.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
15,
16,
72,
73,
85,
117,
118,
138,
139,
705,
706,
1397,
1398,
1794,
1795,
2159,
2160,
2183,
2184,
2708,
2709,
2923,
2924,
3737,
3738,
3770,
3771,
4337,
4338,
4797,
4798,
4838,
4839,
5001,
5002,
5464,
5465,
5884,
5885,
6543,
6544,
7033,
7034,
7229,
7230,
7242,
7274,
7275,
7295
],
"line_end_idx": [
15,
16,
72,
73,
85,
117,
118,
138,
139,
705,
706,
1397,
1398,
1794,
1795,
2159,
2160,
2183,
2184,
2708,
2709,
2923,
2924,
3737,
3738,
3770,
3771,
4337,
4338,
4797,
4798,
4838,
4839,
5001,
5002,
5464,
5465,
5884,
5885,
6543,
6544,
7033,
7034,
7229,
7230,
7242,
7274,
7275,
7295,
7323
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7323,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4000000059604645,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021548820659518242,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15353535115718842,
"rps_doc_frac_unique_words": 0.40251046419143677,
"rps_doc_mean_word_length": 4.941422462463379,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.00134680001065135,
"rps_doc_unigram_entropy": 5.456715106964111,
"rps_doc_word_count": 1195,
"rps_doc_frac_chars_dupe_10grams": 0.015580019913613796,
"rps_doc_frac_chars_dupe_5grams": 0.03759526088833809,
"rps_doc_frac_chars_dupe_6grams": 0.027095679193735123,
"rps_doc_frac_chars_dupe_7grams": 0.027095679193735123,
"rps_doc_frac_chars_dupe_8grams": 0.027095679193735123,
"rps_doc_frac_chars_dupe_9grams": 0.015580019913613796,
"rps_doc_frac_chars_top_2gram": 0.017273500561714172,
"rps_doc_frac_chars_top_3gram": 0.008467400446534157,
"rps_doc_frac_chars_top_4gram": 0.006604569964110851,
"rps_doc_books_importance": -696.951416015625,
"rps_doc_books_importance_length_correction": -696.951416015625,
"rps_doc_openwebtext_importance": -465.95416259765625,
"rps_doc_openwebtext_importance_length_correction": -465.95416259765625,
"rps_doc_wikipedia_importance": -349.7568664550781,
"rps_doc_wikipedia_importance_length_correction": -349.7568664550781
},
"fasttext": {
"dclm": 0.020344670861959457,
"english": 0.8630611896514893,
"fineweb_edu_approx": 2.0300371646881104,
"eai_general_math": 0.6081045269966125,
"eai_open_web_math": 0.2827695608139038,
"eai_web_code": 0.342202365398407
}
}
|
{
"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": "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": "14",
"label": "Reviews/Critiques"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,721,883,370,723,877,000 |
Take the 2-minute tour ×
Server Fault is a question and answer site for professional system and network administrators. It's 100% free, no registration required.
when I change the partition table in Linux (busybox) and exit fdisk I'm still able to mount the old partitions, until I perform a reboot
for example
a) system is setup and has a /dev/sda1 and /dev/sda2
b) enter fdisk, delete both partition 1 and 2
c) save and exit
d) attempt to mount /dev/sda1, this succeeds when I think it should fail
I would assume d) would fail since the partition has been deleted? what am I missing?
share|improve this question
how about running "sync"? – mtm Aug 17 '12 at 16:21
1 Answer 1
up vote 1 down vote accepted
The OS must be "forced" to re-read the partition table once changes have been done. A reboot does this and hence you see fdisk changes after a reboot.
I've used the following command before to re-read partition table and I didn't have to reboot,
# partprobe
• partprobe is part of parted package
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://serverfault.com/questions/418676/how-to-sync-flush-after-fdisk-in-linux-busybox",
"source_domain": "serverfault.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "67093",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DBWLDUSONET3MTSVEGSQU7T4RQXY66UP",
"WARC-Concurrent-To": "<urn:uuid:e8662166-04f5-4e1e-ad43-657a2bb289e5>",
"WARC-Date": "2014-12-22T20:21:01Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MYWJF65ZYBBLWHWSJBNMKP4UITQ4DY6K",
"WARC-Record-ID": "<urn:uuid:4b244811-2239-49c9-9448-428391075b32>",
"WARC-Target-URI": "http://serverfault.com/questions/418676/how-to-sync-flush-after-fdisk-in-linux-busybox",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3a2acf48-8af9-4735-9bdb-56783a80b6ac>"
},
"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,
25,
162,
163,
300,
301,
313,
314,
370,
418,
437,
511,
512,
598,
599,
627,
632,
685,
686,
697,
698,
727,
728,
879,
880,
975,
976,
988,
1028,
1054,
1055,
1067,
1068,
1070,
1078,
1079,
1157,
1158
],
"line_end_idx": [
25,
162,
163,
300,
301,
313,
314,
370,
418,
437,
511,
512,
598,
599,
627,
632,
685,
686,
697,
698,
727,
728,
879,
880,
975,
976,
988,
1028,
1054,
1055,
1067,
1068,
1070,
1078,
1079,
1157,
1158,
1248
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1248,
"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.3759123980998993,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036496348679065704,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21897810697555542,
"rps_doc_frac_unique_words": 0.6261681914329529,
"rps_doc_mean_word_length": 4.462616920471191,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.0036496398970484734,
"rps_doc_unigram_entropy": 4.640676498413086,
"rps_doc_word_count": 214,
"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.037696339190006256,
"rps_doc_frac_chars_top_3gram": 0.03560208901762962,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -141.68003845214844,
"rps_doc_books_importance_length_correction": -141.68003845214844,
"rps_doc_openwebtext_importance": -75.0253677368164,
"rps_doc_openwebtext_importance_length_correction": -75.0253677368164,
"rps_doc_wikipedia_importance": -41.93089294433594,
"rps_doc_wikipedia_importance_length_correction": -41.93089294433594
},
"fasttext": {
"dclm": 0.04401266947388649,
"english": 0.9375054240226746,
"fineweb_edu_approx": 0.9998061656951904,
"eai_general_math": -0.0000016699999605407356,
"eai_open_web_math": 0.07390760630369186,
"eai_web_code": -0.000009540000064589549
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
721,140,513,573,264,100 |
Skip to main content
Store and access your passwords safely.
Project description
=======================================
Installing and Using Python Keyring Lib
=======================================
.. contents:: **Table of Contents**
---------------------------
What is Python keyring lib?
---------------------------
The Python keyring lib provides a easy way to access the system keyring service
from python. It can be used in any application that needs safe password storage.
The keyring library is licensed under both the `MIT license
<http://opensource.org/licenses/MIT>`_ and the PSF license.
These recommended keyring backends are supported by the Python keyring lib:
* Mac OS X `Keychain
<https://en.wikipedia.org/wiki/Keychain_%28software%29>`_
* Freedesktop `Secret Service
<http://standards.freedesktop.org/secret-service/>`_ (requires
`secretstorage <https://pypi.python.org/pypi/secretstorage>`_)
* `KWallet <https://en.wikipedia.org/wiki/KWallet>`_
(requires `dbus <https://pypi.python.org/pypi/dbus-python>`_)
* `Windows Credential Vault
<http://windows.microsoft.com/en-us/windows7/what-is-credential-manager>`_
Other keyring implementations are provided in the `keyrings.alt
package <https://pypi.python.org/pypi/keyrings.alt>`_.
-------------------------
Installation Instructions
-------------------------
Install from Index
==================
Install using your favorite installer. For example:
$ pip install keyring
Linux
-----
On Linux, the recommended keyring relies on SecretStorage, which in
turn relies on dbus-python, but dbus-python does not install correctly
when using the Python installers, so dbus-python must be installed
as a system package. See `SecretStorage
<https://github.com/mitya57/secretstorage>`_ for details.
-------------
Using Keyring
-------------
The basic usage of keyring is pretty simple: just call `keyring.set_password`
and `keyring.get_password`:
>>> import keyring
>>> keyring.set_password("system", "username", "password")
>>> keyring.get_password("system", "username")
'password'
Command-line Utility
====================
Keyring supplies a ``keyring`` command which is installed with the
package. After installing keyring in most environments, the
command should be available for setting, getting, and deleting
passwords. For more information on usage, invoke with no arguments
or with ``--help`` as so::
$ keyring --help
$ keyring set system username
Password for 'username' in 'system':
$ keyring get system username
password
The command-line functionality is also exposed as an executable
package, suitable for invoking from Python like so::
$ python -m keyring --help
$ python -m keyring set system username
Password for 'username' in 'system':
$ python -m keyring get system username
password
--------------------------
Configure your keyring lib
--------------------------
The python keyring lib contains implementations for several backends. The
library will
automatically choose the keyring that is most suitable for your current
environment. You can also specify the keyring you like to be used in the
config file or by calling the ``set_keyring()`` function.
Customize your keyring by config file
=====================================
This section describes how to change your option in the config file.
Config file path
----------------
The configuration of the lib is stored in a file named "keyringrc.cfg". This
file must be found in a platform-specific location. To determine
where the config file is stored, run the following::
python -c "import keyring.util.platform_; print(keyring.util.platform_.config_root())"
Some keyrings also store the keyring data in the file system. To determine
where the data files are stored, run this command::
python -c "import keyring.util.platform_; print(keyring.util.platform_.data_root())"
Config file content
-------------------
To specify a keyring backend, set the **default-keyring** option to the
full path of the class for that backend, such as
``keyring.backends.OS_X.Keyring``.
If **keyring-path** is indicated, keyring will add that path to the Python
module search path before loading the backend.
For example, this config might be used to load the SimpleKeyring from the demo
directory in the project checkout::
[backend]
default-keyring=simplekeyring.SimpleKeyring
keyring-path=/home/kang/pyworkspace/python-keyring-lib/demo/
Write your own keyring backend
==============================
The interface for the backend is defined by ``keyring.backend.KeyringBackend``.
Every backend should derive from that base class and define a ``priority``
attribute and three functions: ``get_password()``, ``set_password()``, and
``delete_password()``.
See the ``backend`` module for more detail on the interface of this class.
Set the keyring in runtime
==========================
Keyring additionally allows programmatic configuration of the
backend calling the api ``set_keyring()``. The indicated backend
will subsequently be used to store and retrieve passwords.
Here's an example demonstrating how to invoke ``set_keyring``::
# define a new keyring class which extends the KeyringBackend
import keyring.backend
class TestKeyring(keyring.backend.KeyringBackend):
"""A test keyring which always outputs same password
"""
priority = 1
def set_password(self, servicename, username, password):
pass
def get_password(self, servicename, username):
return "password from TestKeyring"
def delete_password(self, servicename, username, password):
pass
# set the keyring for keyring lib
keyring.set_keyring(TestKeyring())
# invoke the keyring lib
try:
keyring.set_password("demo-service", "tarek", "passexample")
print("password stored sucessfully")
except keyring.errors.PasswordSetError:
print("failed to store password")
print("password", keyring.get_password("demo-service", "tarek"))
Using Keyring on Ubuntu 16.04
=============================
The following is a complete transcript for installing keyring in a
virtual environment on Ubuntu 16.04. No config file was used.::
$ sudo apt install python3-venv libdbus-glib-1-dev
$ cd /tmp
$ pyvenv py3
$ source py3/bin/activate
$ pip install -U pip
$ pip install secretstorage dbus-python
$ pip install keyring
$ python
>>> import keyring
>>> keyring.get_keyring()
<keyring.backends.SecretService.Keyring object at 0x7f9b9c971ba8>
>>> keyring.set_password("system", "username", "password")
>>> keyring.get_password("system", "username")
'password'
Using Keyring on headless Linux systems
=======================================
It is possible to use the SecretService backend on Linux systems without
X11 server available (only D-Bus is required). To do that, you need the
following:
* Install the `GNOME Keyring`_ daemon.
* Start a D-Bus session, e.g. run ``dbus-run-session -- sh`` and run
the following commands inside that shell.
* Run ``gnome-keyring-daemon`` with ``--unlock`` option. The description of
that option says:
Read a password from stdin, and use it to unlock the login keyring
or create it if the login keyring does not exist.
When that command is started, enter your password into stdin and
press Ctrl+D (end of data). After that the daemon will fork into
background (use ``--foreground`` option to prevent that).
* Now you can use the SecretService backend of Keyring. Remember to
run your application in the same D-Bus session as the daemon.
.. _GNOME Keyring: https://wiki.gnome.org/Projects/GnomeKeyring
-----------------------------------------------
Integrate the keyring lib with your application
-----------------------------------------------
API interface
=============
The keyring lib has a few functions:
* ``get_keyring()``: Return the currently-loaded keyring implementation.
* ``get_password(service, username)``: Returns the password stored in the
active keyring. If the password does not exist, it will return None.
* ``set_password(service, username, password)``: Store the password in the
keyring.
* ``delete_password(service, username)``: Delete the password stored in
keyring. If the password does not exist, it will raise an exception.
------------
Get involved
------------
Python keyring lib is an open community project and highly welcomes new
contributors.
* Repository: https://github.com/jaraco/keyring/
* Bug Tracker: https://github.com/jaraco/keyring/issues/
* Mailing list: http://groups.google.com/group/python-keyring
Making Releases
===============
Python keyring lib uses a simple tag and release process. The simplified
workflow is first tag a release, then invoke ``setup.py release``.
Other things to consider when making a release:
- first ensure that tests pass (preferably on Windows and Linux)
- check that the changelog is current for the intended release
- after tagging, but before releasing, push the changes to the repository
Running Tests
=============
Tests are `continuously run <https://travis-ci.org/#!/jaraco/keyring>`_ using
Travis-CI.
|BuildStatus|_
.. |BuildStatus| image:: https://secure.travis-ci.org/jaraco/keyring.png
.. _BuildStatus: http://travis-ci.org/jaraco/keyring
To run the tests yourself, you'll want keyring installed to some environment
in which it can be tested. Recommended techniques are described below.
Using pytest runner
-------------------
Keyring is instrumented with `pytest runner
<https://bitbucket.org/jaraco/pytest-runner>`_. Thus, you may invoke the tests
from any supported Python (with setuptools installed) using this command::
python setup.py test
pytest runner will download any unmet dependencies and run the tests using
`pytest <https://bitbucket.org/hpk42/pytest>`_.
This technique is the one used by the Travis-CI script.
Using virtualenv and pytest/nose/unittest
-----------------------------------------
Pytest and Nose are two popular test runners that will discover tests and run
them. Unittest also has a mode to discover tests.
First, however, these test runners typically need a test environment in which
to run. It is recommended that you install keyring to a virtual environment
to avoid interfering with your system environment. For more information, see
the `venv documentation <https://docs.python.org/dev/library/venv.html>`_ or
the `virtualenv homepage <http://www.virtualenv.org>`_.
After you've created (or designated) your environment, install keyring into
the environment by running::
python setup.py develop
You then need to install the test requirements with something like::
pip install $( python -c "import setup, subprocess; print(subprocess.list2cmdline(setup.test_requirements))" )
Then, invoke your favorite test runner, e.g.::
py.test
or::
nosetests
----------
Background
----------
The project was based on Tarek Ziade's idea in `this post`_. Kang Zhang
initially carried it out as a `Google Summer of Code`_ project, and Tarek
mentored Kang on this project.
.. _this post: http://tarekziade.wordpress.com/2009/03/27/pycon-hallway-session-1-a-keyring-library-for-python/
.. _Google Summer of Code: http://socghop.appspot.com/
Project details
Release history Release notifications | RSS feed
This version
9.3
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Files for keyring, version 9.3
Filename, size File type Python version Upload date Hashes
Filename, size keyring-9.3-py2.py3-none-any.whl (34.9 kB) File type Wheel Python version 2.7 Upload date Hashes View
Filename, size keyring-9.3.tar.gz (40.3 kB) File type Source Python version None Upload date Hashes View
Supported by
Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page
|
{
"url": "https://pypi.org/project/keyring/9.3/",
"source_domain": "pypi.org",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "198639",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K6S6I557VUMXCGANA27EESMXB4XFIK6O",
"WARC-Concurrent-To": "<urn:uuid:569081c1-14ac-47e4-9bc9-4e55ac0b0a40>",
"WARC-Date": "2020-08-08T09:20:25Z",
"WARC-IP-Address": "151.101.128.223",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ROTDBOQHFYHCV766S5NMLLAGPGWQ2QIQ",
"WARC-Record-ID": "<urn:uuid:9ebfc917-cd92-4134-8012-b15e1b6e7ce3>",
"WARC-Target-URI": "https://pypi.org/project/keyring/9.3/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e391d673-a894-457d-953e-0ad4201c6bf0>"
},
"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-181.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,
21,
22,
62,
63,
83,
84,
124,
164,
204,
205,
241,
242,
270,
298,
326,
327,
407,
488,
489,
549,
609,
610,
686,
687,
708,
766,
796,
859,
922,
975,
1037,
1065,
1140,
1141,
1205,
1260,
1261,
1287,
1313,
1339,
1340,
1359,
1378,
1379,
1431,
1432,
1454,
1455,
1461,
1467,
1468,
1536,
1607,
1674,
1714,
1772,
1773,
1787,
1801,
1815,
1816,
1894,
1922,
1923,
1942,
2001,
2048,
2059,
2060,
2081,
2102,
2103,
2170,
2230,
2293,
2360,
2387,
2388,
2405,
2435,
2472,
2502,
2511,
2512,
2576,
2629,
2630,
2657,
2697,
2734,
2774,
2783,
2784,
2811,
2838,
2865,
2866,
2940,
2953,
3025,
3098,
3156,
3157,
3195,
3233,
3234,
3303,
3304,
3321,
3338,
3339,
3416,
3481,
3534,
3535,
3622,
3623,
3698,
3750,
3751,
3836,
3837,
3838,
3858,
3878,
3879,
3951,
4000,
4035,
4036,
4111,
4158,
4159,
4238,
4274,
4275,
4285,
4329,
4390,
4391,
4392,
4423,
4454,
4455,
4535,
4610,
4685,
4708,
4709,
4784,
4785,
4786,
4813,
4840,
4841,
4903,
4968,
5027,
5028,
5092,
5093,
5155,
5178,
5179,
5230,
5283,
5287,
5300,
5301,
5358,
5363,
5364,
5411,
5446,
5447,
5507,
5512,
5513,
5547,
5582,
5583,
5608,
5613,
5674,
5711,
5751,
5785,
5850,
5851,
5852,
5882,
5912,
5913,
5980,
6044,
6045,
6096,
6106,
6119,
6145,
6166,
6206,
6228,
6237,
6256,
6282,
6348,
6407,
6454,
6465,
6466,
6467,
6468,
6508,
6548,
6549,
6622,
6694,
6705,
6706,
6745,
6814,
6856,
6932,
6950,
6951,
7018,
7068,
7069,
7134,
7199,
7257,
7325,
7387,
7388,
7452,
7453,
7501,
7549,
7597,
7598,
7612,
7626,
7627,
7664,
7665,
7738,
7812,
7881,
7956,
7965,
8037,
8106,
8107,
8120,
8133,
8146,
8147,
8219,
8233,
8234,
8283,
8340,
8402,
8403,
8419,
8435,
8436,
8509,
8576,
8577,
8625,
8626,
8691,
8754,
8828,
8829,
8843,
8857,
8858,
8936,
8947,
8948,
8963,
8964,
9037,
9090,
9091,
9168,
9239,
9240,
9260,
9280,
9281,
9325,
9404,
9479,
9480,
9501,
9502,
9577,
9625,
9626,
9682,
9683,
9725,
9767,
9768,
9846,
9896,
9897,
9975,
10051,
10128,
10205,
10261,
10262,
10338,
10367,
10368,
10392,
10393,
10462,
10463,
10574,
10575,
10622,
10623,
10631,
10632,
10637,
10638,
10648,
10649,
10660,
10671,
10682,
10683,
10755,
10829,
10860,
10861,
10973,
11028,
11029,
11045,
11046,
11047,
11096,
11097,
11110,
11111,
11115,
11116,
11131,
11132,
11243,
11244,
11275,
11334,
11451,
11556,
11557,
11570,
11571
],
"line_end_idx": [
21,
22,
62,
63,
83,
84,
124,
164,
204,
205,
241,
242,
270,
298,
326,
327,
407,
488,
489,
549,
609,
610,
686,
687,
708,
766,
796,
859,
922,
975,
1037,
1065,
1140,
1141,
1205,
1260,
1261,
1287,
1313,
1339,
1340,
1359,
1378,
1379,
1431,
1432,
1454,
1455,
1461,
1467,
1468,
1536,
1607,
1674,
1714,
1772,
1773,
1787,
1801,
1815,
1816,
1894,
1922,
1923,
1942,
2001,
2048,
2059,
2060,
2081,
2102,
2103,
2170,
2230,
2293,
2360,
2387,
2388,
2405,
2435,
2472,
2502,
2511,
2512,
2576,
2629,
2630,
2657,
2697,
2734,
2774,
2783,
2784,
2811,
2838,
2865,
2866,
2940,
2953,
3025,
3098,
3156,
3157,
3195,
3233,
3234,
3303,
3304,
3321,
3338,
3339,
3416,
3481,
3534,
3535,
3622,
3623,
3698,
3750,
3751,
3836,
3837,
3838,
3858,
3878,
3879,
3951,
4000,
4035,
4036,
4111,
4158,
4159,
4238,
4274,
4275,
4285,
4329,
4390,
4391,
4392,
4423,
4454,
4455,
4535,
4610,
4685,
4708,
4709,
4784,
4785,
4786,
4813,
4840,
4841,
4903,
4968,
5027,
5028,
5092,
5093,
5155,
5178,
5179,
5230,
5283,
5287,
5300,
5301,
5358,
5363,
5364,
5411,
5446,
5447,
5507,
5512,
5513,
5547,
5582,
5583,
5608,
5613,
5674,
5711,
5751,
5785,
5850,
5851,
5852,
5882,
5912,
5913,
5980,
6044,
6045,
6096,
6106,
6119,
6145,
6166,
6206,
6228,
6237,
6256,
6282,
6348,
6407,
6454,
6465,
6466,
6467,
6468,
6508,
6548,
6549,
6622,
6694,
6705,
6706,
6745,
6814,
6856,
6932,
6950,
6951,
7018,
7068,
7069,
7134,
7199,
7257,
7325,
7387,
7388,
7452,
7453,
7501,
7549,
7597,
7598,
7612,
7626,
7627,
7664,
7665,
7738,
7812,
7881,
7956,
7965,
8037,
8106,
8107,
8120,
8133,
8146,
8147,
8219,
8233,
8234,
8283,
8340,
8402,
8403,
8419,
8435,
8436,
8509,
8576,
8577,
8625,
8626,
8691,
8754,
8828,
8829,
8843,
8857,
8858,
8936,
8947,
8948,
8963,
8964,
9037,
9090,
9091,
9168,
9239,
9240,
9260,
9280,
9281,
9325,
9404,
9479,
9480,
9501,
9502,
9577,
9625,
9626,
9682,
9683,
9725,
9767,
9768,
9846,
9896,
9897,
9975,
10051,
10128,
10205,
10261,
10262,
10338,
10367,
10368,
10392,
10393,
10462,
10463,
10574,
10575,
10622,
10623,
10631,
10632,
10637,
10638,
10648,
10649,
10660,
10671,
10682,
10683,
10755,
10829,
10860,
10861,
10973,
11028,
11029,
11045,
11046,
11047,
11096,
11097,
11110,
11111,
11115,
11116,
11131,
11132,
11243,
11244,
11275,
11334,
11451,
11556,
11557,
11570,
11571,
11813
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11813,
"ccnet_original_nlines": 365,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21846553683280945,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009969660080969334,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3107932507991791,
"rps_doc_frac_unique_words": 0.37031593918800354,
"rps_doc_mean_word_length": 6.306392192840576,
"rps_doc_num_sentences": 164,
"rps_doc_symbol_to_word_ratio": 0.0017338499892503023,
"rps_doc_unigram_entropy": 5.507957935333252,
"rps_doc_word_count": 1361,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05359430983662605,
"rps_doc_frac_chars_dupe_6grams": 0.04613770917057991,
"rps_doc_frac_chars_dupe_7grams": 0.020738670602440834,
"rps_doc_frac_chars_dupe_8grams": 0.020738670602440834,
"rps_doc_frac_chars_dupe_9grams": 0.020738670602440834,
"rps_doc_frac_chars_top_2gram": 0.013981129974126816,
"rps_doc_frac_chars_top_3gram": 0.013049050234258175,
"rps_doc_frac_chars_top_4gram": 0.006641029845923185,
"rps_doc_books_importance": -899.6707153320312,
"rps_doc_books_importance_length_correction": -899.6707153320312,
"rps_doc_openwebtext_importance": -501.135986328125,
"rps_doc_openwebtext_importance_length_correction": -501.135986328125,
"rps_doc_wikipedia_importance": -427.7496032714844,
"rps_doc_wikipedia_importance_length_correction": -427.7496032714844
},
"fasttext": {
"dclm": 0.03464728966355324,
"english": 0.7407317757606506,
"fineweb_edu_approx": 2.4304609298706055,
"eai_general_math": 0.3038613200187683,
"eai_open_web_math": 0.10799700021743774,
"eai_web_code": 0.43979209661483765
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "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,543,798,225,861,489,000 |
Is there a plugin to track progress in a program?
I’m looking for a way to let students track their progress through the lessons in a program. I’m using the Membership plugin to manage access to the program itself, but wondering if there is a way to also be able to track their progress through the lessons, so that they can check off the lessons as they complete them and then be able to see exactly where to pick back up when they login the next time.
Is there a WPMU Dev plugin that might be able to do this? Or any other suggestions on how to do this?
Thanks! :slight_smile:
• Ash
• WordPress Hacker
Hello @jessilicious
Welcome to WPMU community!
I hope you are well today and thanks for asking the question.
I am afraid there is no such plugin that can match your criteria. There might be some progress report plugin but that still needs to be customized to fit your needs. As you are already offering courses, it will be best if you custom develop the plugin, so that it can adjust with your criteria.
Also, you can post a job in our job board where you can hire a developer to assist further: https://premium.wpmudev.org/wpmu-jobs/
Cheers
Ash
• jessilicious
• Flash Drive
Thanks for the quick response, Ash! I appreciate it. :slight_smile:
I just found a non-WPMU Dev plugin that I think will do the trick, plus I’ve posted in the job board to find someone to help me on other projects as well. Thanks for your help!
Thank NAME, for their help.
Let NAME know exactly why they deserved these points.
Gift a custom amount of points.
|
{
"url": "https://premium.wpmudev.org/forums/topic/is-there-a-plugin-to-track-progress-in-a-program/",
"source_domain": "premium.wpmudev.org",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "266928",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UORCER5AN6VIO42SWPWQ7EQYRTNWMUR5",
"WARC-Concurrent-To": "<urn:uuid:ecadf99c-9cd4-4300-8bb2-d32f1e0ee02f>",
"WARC-Date": "2019-09-18T03:03:19Z",
"WARC-IP-Address": "104.16.220.51",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VK2L3A3V722KBF6WWUMTS6OQCW7EIXYY",
"WARC-Record-ID": "<urn:uuid:2f936076-28c3-457a-a9d9-a36071877f68>",
"WARC-Target-URI": "https://premium.wpmudev.org/forums/topic/is-there-a-plugin-to-track-progress-in-a-program/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:10520168-d513-43e4-878c-168e77345d0c>"
},
"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-151.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,
50,
51,
455,
456,
558,
559,
582,
583,
591,
614,
615,
639,
640,
671,
672,
738,
739,
1038,
1039,
1174,
1175,
1186,
1187,
1195,
1196,
1213,
1231,
1232,
1304,
1305,
1486,
1487,
1515,
1516,
1570,
1571
],
"line_end_idx": [
50,
51,
455,
456,
558,
559,
582,
583,
591,
614,
615,
639,
640,
671,
672,
738,
739,
1038,
1039,
1174,
1175,
1186,
1187,
1195,
1196,
1213,
1231,
1232,
1304,
1305,
1486,
1487,
1515,
1516,
1570,
1571,
1602
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1602,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5105105042457581,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.039039041846990585,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13813814520835876,
"rps_doc_frac_unique_words": 0.5,
"rps_doc_mean_word_length": 4.301418304443359,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.6383280754089355,
"rps_doc_word_count": 282,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05770815908908844,
"rps_doc_frac_chars_dupe_6grams": 0.05770815908908844,
"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.024732070043683052,
"rps_doc_frac_chars_top_3gram": 0.01978565938770771,
"rps_doc_frac_chars_top_4gram": 0.02143445983529091,
"rps_doc_books_importance": -174.8673553466797,
"rps_doc_books_importance_length_correction": -161.21310424804688,
"rps_doc_openwebtext_importance": -78.59393310546875,
"rps_doc_openwebtext_importance_length_correction": -78.59393310546875,
"rps_doc_wikipedia_importance": -84.61042022705078,
"rps_doc_wikipedia_importance_length_correction": -70.9728775024414
},
"fasttext": {
"dclm": 0.04112834110856056,
"english": 0.9455801248550415,
"fineweb_edu_approx": 0.8036791086196899,
"eai_general_math": 0.12122488021850586,
"eai_open_web_math": 0.11429017782211304,
"eai_web_code": 0.03751176968216896
}
}
|
{
"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": "371.3922",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Teachers, Teaching, and School management and organization"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
3,651,156,022,964,342,300 |
NETWORKDAYS
Returns the number of workdays between a start date and an end date. Holidays can be deducted.
note
The functions whose names end with _ADD or _EXCEL2003 return the same results as the corresponding Microsoft Excel 2003 functions without the suffix. Use the functions without suffix to get results based on international standards.
Sintaxe
NETWORKDAYS(StartDate; EndDate; Holidays; Workdays)
StartDate is the date from when the calculation is carried out. If the start date is a workday, the day is included in the calculation.
EndDate is the date up until when the calculation is carried out. If the end date is a workday, the day is included in the calculation.
Holidays is an optional list of holidays. These are non-working days. Enter a cell range in which the holidays are listed individually.
Workdays is an optional list of number values defining standard work week. This list starts by Sunday, workdays are indicated by zero and non-working days by non-zero value.
note
When entering dates as part of formulas, slashes or dashes used as date separators are interpreted as arithmetic operators. Therefore, dates entered in this format are not recognized as dates and result in erroneous calculations. To keep dates from being interpreted as parts of formulas use the DATE function, for example, DATE(1954;7;20), or place the date in quotation marks and use the ISO 8601 notation, for example, "1954-07-20". Avoid using locale dependent date formats such as "07/20/54", the calculation may produce errors if the document is loaded under different locale settings.
tip
Unambiguous conversion is possible for ISO 8601 dates and times in their extended formats with separators. If a #VALUE! error occurs, then unselect Generate #VALUE! error in - LibreOffice Calc - Formula, button Details... in section "Detailed Calculation Settings", Conversion from text to number list box.
Exemplo
How many workdays fall between 2001-12-15 and 2002-01-15? The start date is located in C3 and the end date in D3. Cells F3 to J3 contain the following Christmas and New Year holidays: "2001-12-24", "2001-12-25", "2001-12-26", "2001-12-31", "2002-01-01".
=NETWORKDAYS(C3;D3;F3:J3) returns 17 workdays.
How many workdays fall between September 12nd and 25th in 2016 if only Mondays, Tuesdays and Wednesdays are considered as workdays?
=NETWORKDAYS(DATE(2016;9;12); DATE(2016;9;25); ; {1;0;0;0;1;1;1}) returns 6 workdays.
D'oh! You found a bug (text/scalc/01/func_workday.xhp#workday not found).
Date functions
Precisamos da súa axuda!
|
{
"url": "https://help.libreoffice.org/6.4/gl/text/scalc/01/func_networkdays.html",
"source_domain": "help.libreoffice.org",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "11147",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HKE3SF2OXCCTG2VMUI325GLZVI6JJTB5",
"WARC-Concurrent-To": "<urn:uuid:c065aea7-45ba-4e4b-b775-e4bc092c9ca4>",
"WARC-Date": "2020-07-11T02:56:43Z",
"WARC-IP-Address": "89.238.68.190",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A7SPURPRZF54WBR664YHVK64R4PPZ4N6",
"WARC-Record-ID": "<urn:uuid:16b5d991-be07-42c6-b99f-a064e7eb52ee>",
"WARC-Target-URI": "https://help.libreoffice.org/6.4/gl/text/scalc/01/func_networkdays.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f3f2f695-3df1-4a2c-8706-ef12783c4e69>"
},
"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,
12,
13,
108,
109,
114,
115,
347,
348,
349,
357,
358,
410,
411,
547,
548,
684,
685,
821,
822,
996,
997,
1002,
1003,
1595,
1596,
1597,
1601,
1602,
1909,
1910,
1911,
1919,
1920,
2174,
2175,
2222,
2223,
2355,
2356,
2442,
2443,
2517,
2518,
2533,
2534
],
"line_end_idx": [
12,
13,
108,
109,
114,
115,
347,
348,
349,
357,
358,
410,
411,
547,
548,
684,
685,
821,
822,
996,
997,
1002,
1003,
1595,
1596,
1597,
1601,
1602,
1909,
1910,
1911,
1919,
1920,
2174,
2175,
2222,
2223,
2355,
2356,
2442,
2443,
2517,
2518,
2533,
2534,
2558
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2558,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0.0007818600279279053,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28028932213783264,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04159132018685341,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.314647376537323,
"rps_doc_frac_unique_words": 0.5223097205162048,
"rps_doc_mean_word_length": 5.275590419769287,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.007233269978314638,
"rps_doc_unigram_entropy": 4.871236324310303,
"rps_doc_word_count": 381,
"rps_doc_frac_chars_dupe_10grams": 0.04577114060521126,
"rps_doc_frac_chars_dupe_5grams": 0.12437810748815536,
"rps_doc_frac_chars_dupe_6grams": 0.08059701323509216,
"rps_doc_frac_chars_dupe_7grams": 0.08059701323509216,
"rps_doc_frac_chars_dupe_8grams": 0.08059701323509216,
"rps_doc_frac_chars_dupe_9grams": 0.04577114060521126,
"rps_doc_frac_chars_top_2gram": 0.03482586890459061,
"rps_doc_frac_chars_top_3gram": 0.008955219760537148,
"rps_doc_frac_chars_top_4gram": 0.019900500774383545,
"rps_doc_books_importance": -229.6891326904297,
"rps_doc_books_importance_length_correction": -229.6891326904297,
"rps_doc_openwebtext_importance": -148.0993194580078,
"rps_doc_openwebtext_importance_length_correction": -148.0993194580078,
"rps_doc_wikipedia_importance": -125.76803588867188,
"rps_doc_wikipedia_importance_length_correction": -125.76803588867188
},
"fasttext": {
"dclm": 0.2173466682434082,
"english": 0.8678310513496399,
"fineweb_edu_approx": 2.5138094425201416,
"eai_general_math": 0.7654141783714294,
"eai_open_web_math": 0.4143463969230652,
"eai_web_code": 0.7870492339134216
}
}
|
{
"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": "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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,380,393,466,449,129,000 |
Boost C++ Libraries
...one of the most highly regarded and expertly designed C++ library projects in the world. Herb Sutter and Andrei Alexandrescu, C++ Coding Standards
This is the documentation for an old version of Boost. Click here to view this page for the latest version.
boost/math/special_functions/fpclassify.hpp
// Copyright John Maddock 2005-2008.
// Copyright (c) 2006-2008 Johan Rade
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifndef BOOST_MATH_FPCLASSIFY_HPP
#define BOOST_MATH_FPCLASSIFY_HPP
#ifdef _MSC_VER
#pragma once
#endif
#include <math.h>
#include <boost/config/no_tr1/cmath.hpp>
#include <boost/limits.hpp>
#include <boost/math/tools/real_cast.hpp>
#include <boost/type_traits/is_floating_point.hpp>
#include <boost/math/special_functions/math_fwd.hpp>
#include <boost/math/special_functions/detail/fp_traits.hpp>
/*!
\file fpclassify.hpp
\brief Classify floating-point value as normal, subnormal, zero, infinite, or NaN.
\version 1.0
\author John Maddock
*/
/*
1. If the platform is C99 compliant, then the native floating point
classification functions are used. However, note that we must only
define the functions which call std::fpclassify etc if that function
really does exist: otherwise a compiler may reject the code even though
the template is never instantiated.
2. If the platform is not C99 compliant, and the binary format for
a floating point type (float, double or long double) can be determined
at compile time, then the following algorithm is used:
If all exponent bits, the flag bit (if there is one),
and all significand bits are 0, then the number is zero.
If all exponent bits and the flag bit (if there is one) are 0,
and at least one significand bit is 1, then the number is subnormal.
If all exponent bits are 1 and all significand bits are 0,
then the number is infinity.
If all exponent bits are 1 and at least one significand bit is 1,
then the number is a not-a-number.
Otherwise the number is normal.
This algorithm works for the IEEE 754 representation,
and also for several non IEEE 754 formats.
Most formats have the structure
sign bit + exponent bits + significand bits.
A few have the structure
sign bit + exponent bits + flag bit + significand bits.
The flag bit is 0 for zero and subnormal numbers,
and 1 for normal numbers and NaN.
It is 0 (Motorola 68K) or 1 (Intel) for infinity.
To get the bits, the four or eight most significant bytes are copied
into an uint32_t or uint64_t and bit masks are applied.
This covers all the exponent bits and the flag bit (if there is one),
but not always all the significand bits.
Some of the functions below have two implementations,
depending on whether all the significand bits are copied or not.
3. If the platform is not C99 compliant, and the binary format for
a floating point type (float, double or long double) can not be determined
at compile time, then comparison with std::numeric_limits values
is used.
*/
#if defined(_MSC_VER) || defined(__BORLANDC__)
#include <float.h>
#endif
#ifdef BOOST_NO_STDC_NAMESPACE
namespace std{ using ::abs; using ::fabs; }
#endif
namespace boost{
//
// This must not be located in any namespace under boost::math
// otherwise we can get into an infinite loop if isnan is
// a #define for "isnan" !
//
namespace math_detail{
template <class T>
inline bool is_nan_helper(T t, const boost::true_type&)
{
#ifdef isnan
return isnan(t);
#elif defined(BOOST_MATH_DISABLE_STD_FPCLASSIFY) || !defined(BOOST_HAS_FPCLASSIFY)
return false;
#else // BOOST_HAS_FPCLASSIFY
return (BOOST_FPCLASSIFY_PREFIX fpclassify(t) == (int)FP_NAN);
#endif
}
template <class T>
inline bool is_nan_helper(T, const boost::false_type&)
{
return false;
}
}
namespace math{
namespace detail{
#ifdef BOOST_MATH_USE_STD_FPCLASSIFY
template <class T>
inline int fpclassify_imp BOOST_NO_MACRO_EXPAND(T t, const native_tag&)
{
return (std::fpclassify)(t);
}
#endif
template <class T>
inline int fpclassify_imp BOOST_NO_MACRO_EXPAND(T t, const generic_tag<true>&)
{
BOOST_MATH_INSTRUMENT_VARIABLE(t);
// whenever possible check for Nan's first:
#if defined(BOOST_HAS_FPCLASSIFY) && !defined(BOOST_MATH_DISABLE_STD_FPCLASSIFY)
if(::boost::math_detail::is_nan_helper(t, ::boost::is_floating_point<T>()))
return FP_NAN;
#elif defined(isnan)
if(boost::math_detail::is_nan_helper(t, ::boost::is_floating_point<T>()))
return FP_NAN;
#elif defined(_MSC_VER) || defined(__BORLANDC__)
if(::_isnan(boost::math::tools::real_cast<double>(t)))
return FP_NAN;
#endif
// std::fabs broken on a few systems especially for long long!!!!
T at = (t < T(0)) ? -t : t;
// Use a process of exclusion to figure out
// what kind of type we have, this relies on
// IEEE conforming reals that will treat
// Nan's as unordered. Some compilers
// don't do this once optimisations are
// turned on, hence the check for nan's above.
if(at <= (std::numeric_limits<T>::max)())
{
if(at >= (std::numeric_limits<T>::min)())
return FP_NORMAL;
return (at != 0) ? FP_SUBNORMAL : FP_ZERO;
}
else if(at > (std::numeric_limits<T>::max)())
return FP_INFINITE;
return FP_NAN;
}
template <class T>
inline int fpclassify_imp BOOST_NO_MACRO_EXPAND(T t, const generic_tag<false>&)
{
#ifdef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
if(std::numeric_limits<T>::is_specialized)
return fpclassify_imp(t, generic_tag<true>());
#endif
//
// An unknown type with no numeric_limits support,
// so what are we supposed to do we do here?
//
BOOST_MATH_INSTRUMENT_VARIABLE(t);
return t == 0 ? FP_ZERO : FP_NORMAL;
}
template<class T>
int fpclassify_imp BOOST_NO_MACRO_EXPAND(T x, ieee_copy_all_bits_tag)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
BOOST_MATH_INSTRUMENT_VARIABLE(x);
BOOST_DEDUCED_TYPENAME traits::bits a;
traits::get_bits(x,a);
BOOST_MATH_INSTRUMENT_VARIABLE(a);
a &= traits::exponent | traits::flag | traits::significand;
BOOST_MATH_INSTRUMENT_VARIABLE((traits::exponent | traits::flag | traits::significand));
BOOST_MATH_INSTRUMENT_VARIABLE(a);
if(a <= traits::significand) {
if(a == 0)
return FP_ZERO;
else
return FP_SUBNORMAL;
}
if(a < traits::exponent) return FP_NORMAL;
a &= traits::significand;
if(a == 0) return FP_INFINITE;
return FP_NAN;
}
template<class T>
int fpclassify_imp BOOST_NO_MACRO_EXPAND(T x, ieee_copy_leading_bits_tag)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
BOOST_MATH_INSTRUMENT_VARIABLE(x);
BOOST_DEDUCED_TYPENAME traits::bits a;
traits::get_bits(x,a);
a &= traits::exponent | traits::flag | traits::significand;
if(a <= traits::significand) {
if(x == 0)
return FP_ZERO;
else
return FP_SUBNORMAL;
}
if(a < traits::exponent) return FP_NORMAL;
a &= traits::significand;
traits::set_bits(x,a);
if(x == 0) return FP_INFINITE;
return FP_NAN;
}
#if defined(BOOST_MATH_USE_STD_FPCLASSIFY) && defined(BOOST_MATH_NO_NATIVE_LONG_DOUBLE_FP_CLASSIFY)
template <>
inline int fpclassify_imp<long double> BOOST_NO_MACRO_EXPAND(long double t, const native_tag&)
{
return boost::math::detail::fpclassify_imp(t, generic_tag<true>());
}
#endif
} // namespace detail
template <class T>
inline int fpclassify BOOST_NO_MACRO_EXPAND(T t)
{
typedef typename detail::fp_traits<T>::type traits;
typedef typename traits::method method;
typedef typename tools::promote_args<T>::type value_type;
#ifdef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
if(std::numeric_limits<T>::is_specialized && detail::is_generic_tag_false(static_cast<method*>(0)))
return detail::fpclassify_imp(static_cast<value_type>(t), detail::generic_tag<true>());
return detail::fpclassify_imp(static_cast<value_type>(t), method());
#else
return detail::fpclassify_imp(static_cast<value_type>(t), method());
#endif
}
namespace detail {
#ifdef BOOST_MATH_USE_STD_FPCLASSIFY
template<class T>
inline bool isfinite_impl(T x, native_tag const&)
{
return (std::isfinite)(x);
}
#endif
template<class T>
inline bool isfinite_impl(T x, generic_tag<true> const&)
{
return x >= -(std::numeric_limits<T>::max)()
&& x <= (std::numeric_limits<T>::max)();
}
template<class T>
inline bool isfinite_impl(T x, generic_tag<false> const&)
{
#ifdef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
if(std::numeric_limits<T>::is_specialized)
return isfinite_impl(x, generic_tag<true>());
#endif
(void)x; // warning supression.
return true;
}
template<class T>
inline bool isfinite_impl(T x, ieee_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME detail::fp_traits<T>::type traits;
BOOST_DEDUCED_TYPENAME traits::bits a;
traits::get_bits(x,a);
a &= traits::exponent;
return a != traits::exponent;
}
#if defined(BOOST_MATH_USE_STD_FPCLASSIFY) && defined(BOOST_MATH_NO_NATIVE_LONG_DOUBLE_FP_CLASSIFY)
template <>
inline bool isfinite_impl<long double> BOOST_NO_MACRO_EXPAND(long double t, const native_tag&)
{
return boost::math::detail::isfinite_impl(t, generic_tag<true>());
}
#endif
}
template<class T>
inline bool (isfinite)(T x)
{ //!< \brief return true if floating-point type t is finite.
typedef typename detail::fp_traits<T>::type traits;
typedef typename traits::method method;
typedef typename boost::is_floating_point<T>::type fp_tag;
typedef typename tools::promote_args<T>::type value_type;
return detail::isfinite_impl(static_cast<value_type>(x), method());
}
//------------------------------------------------------------------------------
namespace detail {
#ifdef BOOST_MATH_USE_STD_FPCLASSIFY
template<class T>
inline bool isnormal_impl(T x, native_tag const&)
{
return (std::isnormal)(x);
}
#endif
template<class T>
inline bool isnormal_impl(T x, generic_tag<true> const&)
{
if(x < 0) x = -x;
return x >= (std::numeric_limits<T>::min)()
&& x <= (std::numeric_limits<T>::max)();
}
template<class T>
inline bool isnormal_impl(T x, generic_tag<false> const&)
{
#ifdef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
if(std::numeric_limits<T>::is_specialized)
return isnormal_impl(x, generic_tag<true>());
#endif
return !(x == 0);
}
template<class T>
inline bool isnormal_impl(T x, ieee_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME detail::fp_traits<T>::type traits;
BOOST_DEDUCED_TYPENAME traits::bits a;
traits::get_bits(x,a);
a &= traits::exponent | traits::flag;
return (a != 0) && (a < traits::exponent);
}
#if defined(BOOST_MATH_USE_STD_FPCLASSIFY) && defined(BOOST_MATH_NO_NATIVE_LONG_DOUBLE_FP_CLASSIFY)
template <>
inline bool isnormal_impl<long double> BOOST_NO_MACRO_EXPAND(long double t, const native_tag&)
{
return boost::math::detail::isnormal_impl(t, generic_tag<true>());
}
#endif
}
template<class T>
inline bool (isnormal)(T x)
{
typedef typename detail::fp_traits<T>::type traits;
typedef typename traits::method method;
typedef typename boost::is_floating_point<T>::type fp_tag;
typedef typename tools::promote_args<T>::type value_type;
return detail::isnormal_impl(static_cast<value_type>(x), method());
}
//------------------------------------------------------------------------------
namespace detail {
#ifdef BOOST_MATH_USE_STD_FPCLASSIFY
template<class T>
inline bool isinf_impl(T x, native_tag const&)
{
return (std::isinf)(x);
}
#endif
template<class T>
inline bool isinf_impl(T x, generic_tag<true> const&)
{
(void)x; // in case the compiler thinks that x is unused because std::numeric_limits<T>::has_infinity is false
return std::numeric_limits<T>::has_infinity
&& ( x == std::numeric_limits<T>::infinity()
|| x == -std::numeric_limits<T>::infinity());
}
template<class T>
inline bool isinf_impl(T x, generic_tag<false> const&)
{
#ifdef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
if(std::numeric_limits<T>::is_specialized)
return isinf_impl(x, generic_tag<true>());
#endif
(void)x; // warning supression.
return false;
}
template<class T>
inline bool isinf_impl(T x, ieee_copy_all_bits_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
BOOST_DEDUCED_TYPENAME traits::bits a;
traits::get_bits(x,a);
a &= traits::exponent | traits::significand;
return a == traits::exponent;
}
template<class T>
inline bool isinf_impl(T x, ieee_copy_leading_bits_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
BOOST_DEDUCED_TYPENAME traits::bits a;
traits::get_bits(x,a);
a &= traits::exponent | traits::significand;
if(a != traits::exponent)
return false;
traits::set_bits(x,0);
return x == 0;
}
#if defined(BOOST_MATH_USE_STD_FPCLASSIFY) && defined(BOOST_MATH_NO_NATIVE_LONG_DOUBLE_FP_CLASSIFY)
template <>
inline bool isinf_impl<long double> BOOST_NO_MACRO_EXPAND(long double t, const native_tag&)
{
return boost::math::detail::isinf_impl(t, generic_tag<true>());
}
#endif
} // namespace detail
template<class T>
inline bool (isinf)(T x)
{
typedef typename detail::fp_traits<T>::type traits;
typedef typename traits::method method;
typedef typename boost::is_floating_point<T>::type fp_tag;
typedef typename tools::promote_args<T>::type value_type;
return detail::isinf_impl(static_cast<value_type>(x), method());
}
//------------------------------------------------------------------------------
namespace detail {
#ifdef BOOST_MATH_USE_STD_FPCLASSIFY
template<class T>
inline bool isnan_impl(T x, native_tag const&)
{
return (std::isnan)(x);
}
#endif
template<class T>
inline bool isnan_impl(T x, generic_tag<true> const&)
{
return std::numeric_limits<T>::has_infinity
? !(x <= std::numeric_limits<T>::infinity())
: x != x;
}
template<class T>
inline bool isnan_impl(T x, generic_tag<false> const&)
{
#ifdef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
if(std::numeric_limits<T>::is_specialized)
return isnan_impl(x, generic_tag<true>());
#endif
(void)x; // warning supression
return false;
}
template<class T>
inline bool isnan_impl(T x, ieee_copy_all_bits_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
BOOST_DEDUCED_TYPENAME traits::bits a;
traits::get_bits(x,a);
a &= traits::exponent | traits::significand;
return a > traits::exponent;
}
template<class T>
inline bool isnan_impl(T x, ieee_copy_leading_bits_tag const&)
{
typedef BOOST_DEDUCED_TYPENAME fp_traits<T>::type traits;
BOOST_DEDUCED_TYPENAME traits::bits a;
traits::get_bits(x,a);
a &= traits::exponent | traits::significand;
if(a < traits::exponent)
return false;
a &= traits::significand;
traits::set_bits(x,a);
return x != 0;
}
} // namespace detail
template<class T> bool (isnan)(T x)
{ //!< \brief return true if floating-point type t is NaN (Not A Number).
typedef typename detail::fp_traits<T>::type traits;
typedef typename traits::method method;
typedef typename boost::is_floating_point<T>::type fp_tag;
return detail::isnan_impl(x, method());
}
#ifdef isnan
template <> inline bool isnan BOOST_NO_MACRO_EXPAND<float>(float t){ return ::boost::math_detail::is_nan_helper(t, boost::true_type()); }
template <> inline bool isnan BOOST_NO_MACRO_EXPAND<double>(double t){ return ::boost::math_detail::is_nan_helper(t, boost::true_type()); }
template <> inline bool isnan BOOST_NO_MACRO_EXPAND<long double>(long double t){ return ::boost::math_detail::is_nan_helper(t, boost::true_type()); }
#endif
} // namespace math
} // namespace boost
#endif // BOOST_MATH_FPCLASSIFY_HPP
|
{
"url": "http://www.boost.org/doc/libs/1_52_0/boost/math/special_functions/fpclassify.hpp",
"source_domain": "www.boost.org",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "21446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:46EZ5R6CZXCX4VIEFN6GXS6L4Y4UN34V",
"WARC-Concurrent-To": "<urn:uuid:a0607c78-7f7c-4b6a-952a-1ba8a7386da4>",
"WARC-Date": "2017-05-23T10:57:51Z",
"WARC-IP-Address": "146.20.110.251",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:OBRU4B2RSCZ7GR2ZJWOS4VVVXD4D5EK5",
"WARC-Record-ID": "<urn:uuid:982d250e-ceaf-4bf8-958a-a7d787c0e6a6>",
"WARC-Target-URI": "http://www.boost.org/doc/libs/1_52_0/boost/math/special_functions/fpclassify.hpp",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e898a435-01e0-4034-8f85-64b8caecd397>"
},
"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,
20,
21,
171,
172,
280,
281,
325,
326,
364,
403,
461,
525,
594,
595,
629,
663,
664,
680,
693,
700,
701,
719,
760,
788,
830,
881,
934,
995,
999,
1022,
1107,
1122,
1145,
1149,
1150,
1153,
1154,
1222,
1290,
1359,
1431,
1467,
1468,
1535,
1606,
1661,
1662,
1725,
1790,
1791,
1863,
1940,
1941,
2009,
2046,
2047,
2121,
2164,
2165,
2205,
2206,
2268,
2319,
2320,
2356,
2409,
2414,
2443,
2507,
2561,
2603,
2661,
2662,
2735,
2795,
2869,
2914,
2972,
3041,
3042,
3109,
3184,
3249,
3258,
3259,
3262,
3263,
3310,
3329,
3336,
3337,
3368,
3414,
3421,
3422,
3440,
3441,
3444,
3507,
3565,
3592,
3595,
3618,
3619,
3638,
3694,
3696,
3709,
3729,
3812,
3829,
3859,
3925,
3932,
3934,
3935,
3954,
4009,
4011,
4028,
4030,
4031,
4033,
4034,
4050,
4051,
4069,
4070,
4107,
4126,
4198,
4200,
4232,
4234,
4241,
4242,
4261,
4340,
4342,
4380,
4381,
4428,
4510,
4589,
4610,
4631,
4708,
4729,
4778,
4836,
4857,
4864,
4933,
4964,
4965,
5012,
5060,
5104,
5146,
5189,
5239,
5284,
5289,
5337,
5364,
5413,
5418,
5467,
5493,
5511,
5513,
5514,
5533,
5613,
5615,
5661,
5707,
5760,
5767,
5774,
5828,
5876,
5882,
5920,
5921,
5961,
5963,
5964,
5983,
6053,
6055,
6116,
6117,
6155,
6156,
6198,
6224,
6262,
6325,
6417,
6455,
6456,
6490,
6507,
6532,
6543,
6573,
6578,
6579,
6625,
6626,
6655,
6689,
6690,
6708,
6710,
6711,
6730,
6804,
6806,
6867,
6868,
6906,
6907,
6949,
6976,
7039,
7040,
7074,
7091,
7116,
7127,
7157,
7162,
7163,
7209,
7210,
7239,
7265,
7299,
7300,
7318,
7320,
7321,
7421,
7433,
7528,
7530,
7601,
7603,
7610,
7611,
7634,
7635,
7654,
7703,
7705,
7760,
7803,
7864,
7910,
8013,
8107,
8179,
8185,
8257,
8264,
8266,
8267,
8286,
8287,
8324,
8347,
8401,
8407,
8442,
8448,
8455,
8456,
8479,
8540,
8546,
8599,
8652,
8658,
8659,
8682,
8744,
8750,
8796,
8845,
8900,
8907,
8946,
8966,
8972,
8973,
8996,
9048,
9054,
9128,
9175,
9206,
9237,
9275,
9281,
9282,
9382,
9394,
9489,
9491,
9561,
9563,
9570,
9571,
9573,
9574,
9593,
9621,
9683,
9738,
9781,
9843,
9904,
9975,
9977,
9978,
10059,
10060,
10079,
10080,
10117,
10140,
10194,
10200,
10235,
10241,
10248,
10249,
10272,
10333,
10339,
10365,
10417,
10470,
10476,
10477,
10500,
10562,
10568,
10614,
10663,
10718,
10725,
10750,
10756,
10757,
10780,
10832,
10838,
10912,
10959,
10990,
11036,
11087,
11093,
11094,
11194,
11206,
11301,
11303,
11373,
11375,
11382,
11383,
11385,
11386,
11405,
11433,
11435,
11490,
11533,
11595,
11656,
11727,
11729,
11730,
11811,
11812,
11831,
11832,
11869,
11892,
11943,
11949,
11981,
11987,
11994,
11995,
12018,
12076,
12082,
12201,
12254,
12311,
12374,
12380,
12381,
12404,
12463,
12469,
12515,
12564,
12616,
12623,
12663,
12685,
12691,
12692,
12715,
12778,
12784,
12850,
12851,
12898,
12929,
12982,
13020,
13026,
13027,
13050,
13117,
13123,
13189,
13190,
13237,
13268,
13321,
13355,
13381,
13382,
13413,
13436,
13442,
13443,
13543,
13555,
13647,
13649,
13716,
13718,
13725,
13726,
13750,
13751,
13770,
13795,
13797,
13852,
13895,
13957,
14018,
14086,
14088,
14089,
14170,
14171,
14190,
14191,
14228,
14251,
14302,
14308,
14340,
14346,
14353,
14354,
14377,
14435,
14441,
14493,
14550,
14572,
14578,
14579,
14602,
14661,
14667,
14713,
14762,
14814,
14821,
14860,
14882,
14888,
14889,
14912,
14975,
14981,
15047,
15048,
15095,
15126,
15179,
15216,
15222,
15223,
15246,
15313,
15319,
15385,
15386,
15433,
15464,
15465,
15518,
15551,
15577,
15578,
15612,
15643,
15666,
15672,
15673,
15697,
15698,
15734,
15808,
15863,
15906,
15968,
16011,
16013,
16014,
16027,
16165,
16305,
16455,
16462,
16463,
16483,
16504,
16505
],
"line_end_idx": [
20,
21,
171,
172,
280,
281,
325,
326,
364,
403,
461,
525,
594,
595,
629,
663,
664,
680,
693,
700,
701,
719,
760,
788,
830,
881,
934,
995,
999,
1022,
1107,
1122,
1145,
1149,
1150,
1153,
1154,
1222,
1290,
1359,
1431,
1467,
1468,
1535,
1606,
1661,
1662,
1725,
1790,
1791,
1863,
1940,
1941,
2009,
2046,
2047,
2121,
2164,
2165,
2205,
2206,
2268,
2319,
2320,
2356,
2409,
2414,
2443,
2507,
2561,
2603,
2661,
2662,
2735,
2795,
2869,
2914,
2972,
3041,
3042,
3109,
3184,
3249,
3258,
3259,
3262,
3263,
3310,
3329,
3336,
3337,
3368,
3414,
3421,
3422,
3440,
3441,
3444,
3507,
3565,
3592,
3595,
3618,
3619,
3638,
3694,
3696,
3709,
3729,
3812,
3829,
3859,
3925,
3932,
3934,
3935,
3954,
4009,
4011,
4028,
4030,
4031,
4033,
4034,
4050,
4051,
4069,
4070,
4107,
4126,
4198,
4200,
4232,
4234,
4241,
4242,
4261,
4340,
4342,
4380,
4381,
4428,
4510,
4589,
4610,
4631,
4708,
4729,
4778,
4836,
4857,
4864,
4933,
4964,
4965,
5012,
5060,
5104,
5146,
5189,
5239,
5284,
5289,
5337,
5364,
5413,
5418,
5467,
5493,
5511,
5513,
5514,
5533,
5613,
5615,
5661,
5707,
5760,
5767,
5774,
5828,
5876,
5882,
5920,
5921,
5961,
5963,
5964,
5983,
6053,
6055,
6116,
6117,
6155,
6156,
6198,
6224,
6262,
6325,
6417,
6455,
6456,
6490,
6507,
6532,
6543,
6573,
6578,
6579,
6625,
6626,
6655,
6689,
6690,
6708,
6710,
6711,
6730,
6804,
6806,
6867,
6868,
6906,
6907,
6949,
6976,
7039,
7040,
7074,
7091,
7116,
7127,
7157,
7162,
7163,
7209,
7210,
7239,
7265,
7299,
7300,
7318,
7320,
7321,
7421,
7433,
7528,
7530,
7601,
7603,
7610,
7611,
7634,
7635,
7654,
7703,
7705,
7760,
7803,
7864,
7910,
8013,
8107,
8179,
8185,
8257,
8264,
8266,
8267,
8286,
8287,
8324,
8347,
8401,
8407,
8442,
8448,
8455,
8456,
8479,
8540,
8546,
8599,
8652,
8658,
8659,
8682,
8744,
8750,
8796,
8845,
8900,
8907,
8946,
8966,
8972,
8973,
8996,
9048,
9054,
9128,
9175,
9206,
9237,
9275,
9281,
9282,
9382,
9394,
9489,
9491,
9561,
9563,
9570,
9571,
9573,
9574,
9593,
9621,
9683,
9738,
9781,
9843,
9904,
9975,
9977,
9978,
10059,
10060,
10079,
10080,
10117,
10140,
10194,
10200,
10235,
10241,
10248,
10249,
10272,
10333,
10339,
10365,
10417,
10470,
10476,
10477,
10500,
10562,
10568,
10614,
10663,
10718,
10725,
10750,
10756,
10757,
10780,
10832,
10838,
10912,
10959,
10990,
11036,
11087,
11093,
11094,
11194,
11206,
11301,
11303,
11373,
11375,
11382,
11383,
11385,
11386,
11405,
11433,
11435,
11490,
11533,
11595,
11656,
11727,
11729,
11730,
11811,
11812,
11831,
11832,
11869,
11892,
11943,
11949,
11981,
11987,
11994,
11995,
12018,
12076,
12082,
12201,
12254,
12311,
12374,
12380,
12381,
12404,
12463,
12469,
12515,
12564,
12616,
12623,
12663,
12685,
12691,
12692,
12715,
12778,
12784,
12850,
12851,
12898,
12929,
12982,
13020,
13026,
13027,
13050,
13117,
13123,
13189,
13190,
13237,
13268,
13321,
13355,
13381,
13382,
13413,
13436,
13442,
13443,
13543,
13555,
13647,
13649,
13716,
13718,
13725,
13726,
13750,
13751,
13770,
13795,
13797,
13852,
13895,
13957,
14018,
14086,
14088,
14089,
14170,
14171,
14190,
14191,
14228,
14251,
14302,
14308,
14340,
14346,
14353,
14354,
14377,
14435,
14441,
14493,
14550,
14572,
14578,
14579,
14602,
14661,
14667,
14713,
14762,
14814,
14821,
14860,
14882,
14888,
14889,
14912,
14975,
14981,
15047,
15048,
15095,
15126,
15179,
15216,
15222,
15223,
15246,
15313,
15319,
15385,
15386,
15433,
15464,
15465,
15518,
15551,
15577,
15578,
15612,
15643,
15666,
15672,
15673,
15697,
15698,
15734,
15808,
15863,
15906,
15968,
16011,
16013,
16014,
16027,
16165,
16305,
16455,
16462,
16463,
16483,
16504,
16505,
16540
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16540,
"ccnet_original_nlines": 543,
"rps_doc_curly_bracket": 0.00592502998188138,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1503351330757141,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06670922040939331,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.407277375459671,
"rps_doc_frac_unique_words": 0.26007068157196045,
"rps_doc_mean_word_length": 7.668551445007324,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0.019470160827040672,
"rps_doc_unigram_entropy": 5.167691230773926,
"rps_doc_word_count": 1415,
"rps_doc_frac_chars_dupe_10grams": 0.2271679937839508,
"rps_doc_frac_chars_dupe_5grams": 0.5347894430160522,
"rps_doc_frac_chars_dupe_6grams": 0.49304211139678955,
"rps_doc_frac_chars_dupe_7grams": 0.4052160978317261,
"rps_doc_frac_chars_dupe_8grams": 0.33360981941223145,
"rps_doc_frac_chars_dupe_9grams": 0.29388996958732605,
"rps_doc_frac_chars_top_2gram": 0.0267256498336792,
"rps_doc_frac_chars_top_3gram": 0.02331582084298134,
"rps_doc_frac_chars_top_4gram": 0.046447329223155975,
"rps_doc_books_importance": -1310.3555908203125,
"rps_doc_books_importance_length_correction": -1310.3555908203125,
"rps_doc_openwebtext_importance": -569.8052368164062,
"rps_doc_openwebtext_importance_length_correction": -569.8052368164062,
"rps_doc_wikipedia_importance": -504.0424499511719,
"rps_doc_wikipedia_importance_length_correction": -504.0424499511719
},
"fasttext": {
"dclm": 0.8149174451828003,
"english": 0.2521163523197174,
"fineweb_edu_approx": 1.7487318515777588,
"eai_general_math": 0.9975430965423584,
"eai_open_web_math": 0.28069180250167847,
"eai_web_code": 0.9163045883178711
}
}
|
{
"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.4",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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,885,905,182,624,171,300 |
Index index by Group index by Distribution index by Vendor index by creation date index by Name Mirrors Help Search
labrea-2.5b-2 RPM for i386
From SourceForge / l / la / labrea / labrea / 2.5-stable-1
Name: labrea Distribution: SuSE Linux 8.2 (i586)
Version: 2.5b Vendor: SuSE Linux AG, Nuernberg, Germany
Release: 2 Build date: Tue Oct 7 08:17:06 2003
Group: System/Daemons Build host: cipher.linux-howtos.com
Size: 427855 Source RPM: labrea-2.5b-2.src.rpm
Packager: http://www.linux-howtos.com
Summary: a "Sticky" Honeypot and Intrusion Detection System
LaBrea takes over unused IP addresses, and creates virtual servers
that are attractive to worms, hackers, and other denizens of the
Internet. The program answers connection attempts in such a way that
the machine at the other end gets "stuck", sometimes for a very long
time.
Provides
Requires
License
GPL
Changelog
* Wed Sep 10 2003 moi-meme <[email protected]>
- src/ctl.c (ctl_init_arrays): Remove call to sleep since not
supposed to mix with alarm calls on linux.
- src/utils.c (util_alarm), src/labrea.c: Set alarm and signal
handlers after going into daemon mode so that child will get
signal
- src/labrea_init.c, src/lbio.c: Take out fudge code since
libdnet 1.7 ethopen now uses the libdnet device names (ie eth1,
etc).
* Fri Jul 18 2003 moi-meme <[email protected]>
- src/labrea_init.c: Tighten checking on invalid numbers input for
throttlesize, max bandwidth, etc.
- src/utils.c: Correct timer handling so that bandwidth usage will
be properly reported.
- src/utils.c, labrea_init.c, pkt_handler.c: Change maxbw to Kbytes so
as to avoid problems with large bandwidths.
* Thu Aug 29 2002 moi-meme <[email protected]>
- src/labrea_init.c (labrea_init): Turn off arp sweep if capture
subnet is too large. Also give a msg if subnet is large.
* Fri Aug 09 2002 moi-meme <[email protected]>
- pkt_handler.c (pkt_handler): Set up a "new kid" elt if someone
replies to an arp request.
* Thu Aug 08 2002 moi-meme <[email protected]>
- pkt_handler.c (ip_handler): Move firewalling code outside so as
to check dest port of all incoming TCP packets.
* Wed Aug 07 2002 moi-meme <[email protected]>
- labrea_init.c (labrea_init): Change basic bpf filter to listen
to pkts -sent- to the bogus MAC address only.
- lbio.c (lbio_send_ip_pkt): Make responses appear to come from
bogus virtual machine.
* Tue Aug 06 2002 moi-meme <[email protected]>
- labrea_init.c, pkt_handler.c, ctl.c, utils.c: Add arp sweep logic to detect live
IPs. Replace nk list by a ptr array.
* Thu Aug 01 2002 moi-meme <[email protected]>
- labrea_init.c (labrea_init): Change test mode to log on stdout,
and not fork a child. Eliminate notes on Usage message to improve
readability.
* Tue Jul 30 2002 moi-meme <[email protected]>
- pkt_handler.c (check_ip_ignore_or_new_kid): Remove culling
logic. Only cull inactive entries at each timer pop.
* Sat Jul 27 2002 moi-meme <[email protected]>
- labrea_init.c (labrea_init): Now will accept long options. Add
read_number rtn to check input integer validity and prevent buffer
overflows. Add new --init-file option to allow user-specified
configuration file. Add code to parse all input before bailing
out.
- labrea.h: Move defines.h to this member. Move prototype
definitions to each individual include member (eg utils.h has
prototypes for util.c).
- includes.h: Move all includes to the corresonding .c source
where the include is needed. This simplifies housekeeping on includes.
* Fri Jul 26 2002 moi-meme <[email protected]>
- pkt_handler.c (throttle_data): Change newthisminute to depend on
b/w from each connection and not just # of connections.
- ctl.h, utils.c, ctl.c: Change history array to depend on a
defined constant. Change code in same way.
* Mon Jul 08 2002 moi-meme <[email protected]>
- pkt_handler.c (ip_handler): Change port firewalling logic to use
dynamic port algorithm. That is, ports don't respond to incoming
SYNs until they have seen sufficient activity. Then they start
giving back a SYN-ACK.
- defines.h: Change some defines to enums as per GNU coding
standards.
- utils.c: Move code to run "new kids" list into timer signal
handler so that code will be invoked on a regular basis, but not
at each arp. Also add code in same rtn for dynamic port logic so
that if a port shows activity, it will automatically be monitored.
- labrea.c: Change pcap_loop to pcap_dispatch so that mainline
signal handler code can be called regularly.
* Tue Jun 25 2002 moi-meme <[email protected]>
- labrea_init.c (labrea_init): Change -n, -m parameters so that
can use libdnet input conversion. User has to enter net/mask in
standard CIDR format. -m parameter no longer supported.
* Thu Jun 20 2002 moi-meme <[email protected]>
- Utils.c (CleanExit): Split into 2 rtn so that can generate error
code if terminating on error.
* Wed Jun 19 2002 moi-meme <[email protected]>
- labrea.h, -.c: Move control flags and variables to main ctx
structure. Move signal handlers and utility routines to new util.c
member. Centralize logging.
* Tue Jun 18 2002 moi-meme <[email protected]>
- PacketHandler.c, FixArrays.c, LaBrea.c, LaBrea_init.c: Replace
u_.. types by libdnet std types. Continue working on replacing
hardcoded pkt manipulation by libdnet structures and functions.
* Sun Jun 16 2002 moi-meme <[email protected]>
- pkt.h, pkt.c: Rework this code to eliminate fragroute-specific
stuff, and to handle arps.
- PacketHandler.c: Got rid of gotos.
* Sat Jun 15 2002 moi-meme <[email protected]>
- PacketHandler.c, LaBrea.c, LaBrea_init.c, CleanExit.c: Replace
the kotb structure by a TAILQ (vrtq). Each virtual server element
is a structure of standard libdnet constructs.
* Wed Jun 05 2002 <[email protected]> [email protected]
- Data.c: Move constant strings back into pgms to improve
readability. This also prepares for possible gettext
internationalisation implementation. Eliminate the Data.c file.
- LaBrea.c: Use warnx to generate error messages. Eliminate goto
calls for error handling.
- LaBrea_init.c: Move initialisation stuff to new stand-alone
routine. Get rid of gotos.
- labrea.h: Move globals into this include file. Eliminate extern
declarations in functions.
- defines.h: Define file names to dynamically build msgs /
determine file names depending on op system.
- KOTB.c, IPHandler.c: Move functions into PacketHandler to
eliminate -.c includes.
- GoDaemon.c: Eliminate another -c include by moving this code to
LaBrea_init.c
- LaBrea.c, LaBrea_init.c, PacketHandler.c, FixArrays.c,
CleanExit.c: Start replacing libnet by libdnet. Replace randqueue1
logic by calls to libdnet rand fn.
- FixArrays.c: Eliminate code to parse old-style configuration
file syntax.
- defines.h: Change some defines to enum.
- FixArrays.c, LaBrea_init.c, PacketHandler.c: Add port_array
logic to dynamically add ports to be monitored. Also add PMN
directive which causes specific ports to be monitored. Simplify
FixArray parsing logic. Change IP ignore addresses to be a
linked list of addr structures so that a range of addresses is
expressed in CIDR notation (xx.xx.xx.xx/nn).
Files
/etc/labrea.conf
/usr/sbin/labrea
/usr/share/doc/packages/labrea/AUTHORS
/usr/share/doc/packages/labrea/COPYING
/usr/share/doc/packages/labrea/ChangeLog
/usr/share/doc/packages/labrea/INSTALL
/usr/share/doc/packages/labrea/NEWS
/usr/share/doc/packages/labrea/README
/usr/share/doc/packages/labrea/TODO
/usr/share/man/man1/labrea.1.gz
/usr/share/man/man5/labrea.conf.5.gz
Generated by rpm2html 1.8.1
Fabrice Bellet, Sun Apr 20 23:11:49 2014
|
{
"url": "http://www.rpmfind.net/linux/RPM/sourceforge/l/la/labrea/labrea/2.5-stable-1/labrea-2.5b-2.i386.html",
"source_domain": "www.rpmfind.net",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "11036",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XNTKJWOKKRAG6CSS3SPS42DI43WV7CN5",
"WARC-Concurrent-To": "<urn:uuid:c1525e94-b744-456c-852f-636535ede363>",
"WARC-Date": "2014-04-24T08:57:44Z",
"WARC-IP-Address": "195.220.108.108",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VVMELY2G76NOJ77YTTEQCJJPUAZRGBNO",
"WARC-Record-ID": "<urn:uuid:ea287112-d114-4d89-a046-ed3ba75ed95c>",
"WARC-Target-URI": "http://www.rpmfind.net/linux/RPM/sourceforge/l/la/labrea/labrea/2.5-stable-1/labrea-2.5b-2.i386.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:97b43d0a-d4a1-4591-965f-30b162e375ac>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-4-33.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-15\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for April 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
116,
117,
144,
145,
204,
205,
254,
310,
357,
415,
462,
500,
560,
627,
692,
761,
830,
836,
837,
846,
847,
856,
857,
865,
866,
870,
871,
881,
882,
938,
1003,
1050,
1053,
1118,
1183,
1194,
1197,
1258,
1326,
1336,
1392,
1461,
1499,
1502,
1571,
1597,
1600,
1673,
1721,
1774,
1841,
1902,
1955,
2022,
2053,
2106,
2174,
2226,
2279,
2346,
2396,
2399,
2465,
2492,
2545,
2630,
2671,
2724,
2792,
2862,
2879,
2932,
2995,
3052,
3105,
3172,
3243,
3309,
3376,
3385,
3388,
3448,
3514,
3542,
3545,
3609,
3684,
3737,
3806,
3866,
3869,
3932,
3979,
4032,
4101,
4170,
4237,
4264,
4267,
4329,
4344,
4347,
4411,
4480,
4549,
4620,
4623,
4688,
4737,
4790,
4856,
4924,
4984,
5037,
5106,
5140,
5193,
5257,
5328,
5360,
5412,
5479,
5546,
5614,
5667,
5734,
5765,
5768,
5807,
5860,
5927,
5997,
6048,
6119,
6179,
6236,
6304,
6307,
6374,
6404,
6407,
6471,
6502,
6505,
6573,
6604,
6607,
6668,
6717,
6720,
6782,
6810,
6813,
6881,
6899,
6902,
6961,
7032,
7071,
7074,
7139,
7156,
7159,
7203,
7206,
7270,
7335,
7403,
7466,
7533,
7582,
7583,
7589,
7590,
7607,
7624,
7663,
7702,
7743,
7782,
7818,
7856,
7892,
7924,
7961,
7962,
7963,
7991,
7992
],
"line_end_idx": [
116,
117,
144,
145,
204,
205,
254,
310,
357,
415,
462,
500,
560,
627,
692,
761,
830,
836,
837,
846,
847,
856,
857,
865,
866,
870,
871,
881,
882,
938,
1003,
1050,
1053,
1118,
1183,
1194,
1197,
1258,
1326,
1336,
1392,
1461,
1499,
1502,
1571,
1597,
1600,
1673,
1721,
1774,
1841,
1902,
1955,
2022,
2053,
2106,
2174,
2226,
2279,
2346,
2396,
2399,
2465,
2492,
2545,
2630,
2671,
2724,
2792,
2862,
2879,
2932,
2995,
3052,
3105,
3172,
3243,
3309,
3376,
3385,
3388,
3448,
3514,
3542,
3545,
3609,
3684,
3737,
3806,
3866,
3869,
3932,
3979,
4032,
4101,
4170,
4237,
4264,
4267,
4329,
4344,
4347,
4411,
4480,
4549,
4620,
4623,
4688,
4737,
4790,
4856,
4924,
4984,
5037,
5106,
5140,
5193,
5257,
5328,
5360,
5412,
5479,
5546,
5614,
5667,
5734,
5765,
5768,
5807,
5860,
5927,
5997,
6048,
6119,
6179,
6236,
6304,
6307,
6374,
6404,
6407,
6471,
6502,
6505,
6573,
6604,
6607,
6668,
6717,
6720,
6782,
6810,
6813,
6881,
6899,
6902,
6961,
7032,
7071,
7074,
7139,
7156,
7159,
7203,
7206,
7270,
7335,
7403,
7466,
7533,
7582,
7583,
7589,
7590,
7607,
7624,
7663,
7702,
7743,
7782,
7818,
7856,
7892,
7924,
7961,
7962,
7963,
7991,
7992,
8032
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8032,
"ccnet_original_nlines": 189,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19733184576034546,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012229019775986671,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.34296831488609314,
"rps_doc_frac_unique_words": 0.48967552185058594,
"rps_doc_mean_word_length": 5.8092427253723145,
"rps_doc_num_sentences": 190,
"rps_doc_symbol_to_word_ratio": 0.0005558599950745702,
"rps_doc_unigram_entropy": 5.742094993591309,
"rps_doc_word_count": 1017,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06533513963222504,
"rps_doc_frac_chars_dupe_6grams": 0.04739335924386978,
"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.0297901201993227,
"rps_doc_frac_chars_top_3gram": 0.08395396173000336,
"rps_doc_frac_chars_top_4gram": 0.035545021295547485,
"rps_doc_books_importance": -911.5543823242188,
"rps_doc_books_importance_length_correction": -911.5543823242188,
"rps_doc_openwebtext_importance": -537.2815551757812,
"rps_doc_openwebtext_importance_length_correction": -537.2815551757812,
"rps_doc_wikipedia_importance": -380.1148376464844,
"rps_doc_wikipedia_importance_length_correction": -380.1148376464844
},
"fasttext": {
"dclm": 0.02118433080613613,
"english": 0.6716229915618896,
"fineweb_edu_approx": 2.223083019256592,
"eai_general_math": 0.11761468648910522,
"eai_open_web_math": 0.23368537425994873,
"eai_web_code": 0.4659976363182068
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "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": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,555,522,170,918,098,400 |
Automate Cloud Backup Integration In #DPM With #AzureBackup And #PowerShell @SCDPM @AzureBackup
6 min read
Introduction
Azure Backup is the Azure-based service you can use to back up (or protect) and restore your data in the Microsoft cloud. Azure Backup replaces your existing on-premises or off-site backup solution with a cloud-based solution that is reliable, secure, and cost-competitive. System Center Data Protection Manager (SC DPM) and Microsoft Azure Backup Server (MABS) can be integrated with Azure Backup service so you can protect your data in the cloud without worrying about Ransomware attack and data corruption.
For more information about Azure Backup, please check my recent published Whitepaper here.
Cloud Backup Integration Process
When you are planning to integrate System Center Data Protection Manager (SC DPM) and Microsoft Azure Backup Server (MABS) with Azure Backup, there are multiple steps involved such as:
1. Having a healthy DPM environment.
2. Create a new Recovery Services Vault in Azure.
3. Set up the appropriate storage replication type (Geo-redundant / Locally-redundant).
4. Download the latest Microsoft Azure Recovery Services (MARS) agent.
5. Download Azure Recovery Vault Credentials file.
6. Install Microsoft Azure Recovery Services (MARS) agent.
7. Register DPM Server with Azure Backup Service.
8. Configure DPM cloud settings such as (cloud recovery staging area directory, networking, and passphrase encryption key)
9. Finally, keep the passphrase key safe and secure once it is set, because you will not be able to restore data from Azure without this passphrase.
So it’s a long process and time consuming especially if you have multiple DPM servers that you want to integrate with Azure Backup service.
Microsoft has a detailed document on how to prepare back up workloads to Azure with DPM, so if you are interested in the manual approach, please check the following guide.
In this blog post, I will share with you how to automate the entire Cloud Backup integration process in DPM and Azure Backup.
Automate Cloud Backup Integration
I was working lately on a PowerShell tool that will help me to automate the cloud backup integration process with Azure Backup. So instead of repeating the same steps above every time, I developed that tool to automate the entire process. When you run this tool on the DPM server, it will install the required PowerShell modules, then download the latest Microsoft Azure Recovery Services (MARS) agent, and then install it in silent mode if it’s not installed. You will be prompted to authenticate to Azure, the tool will create a new Recovery Services Vault and set it’s storage replication type. Then it will register DPM server with Azure Backup service for online protection, then configure DPM cloud settings, and finally store the Encryption Passphrase Key in Azure Key Vault.
You can run this tool as follows and watch it doing its magic:
.\Register-DPMCloud.ps1 -AzureSubscription "Subscription ABC" -ResourceGroupName "backup-dpm-rg" -KeyVault "BackupKeyVault" -StagingArea D: -StorageType LRS -Verbose
Open the Azure Portal and check your DPM server is registered successfully with Azure Backup service.
Browse to Azure Key Vaults and check the Passphrase Encryption Key is stored safely. Please remember that you will not be able to restore data from Azure without this passphrase key.
Finally, launch the DPM Administrator Console and you are good to go to start protecting your workloads to Azure Backup.
PowerShell Code
The complete script is detailed below to automate the entire cloud backup integration process:
<#
.SYNOPSIS
Register DPM in Azure Backup Service.
.DESCRIPTION
Automate Cloud Backup Integration With DPM and Azure Backup.
.NOTES
File Name : Register-DPMCloud.ps1
Author : Charbel Nemnom
Version : 1.0
Date : 03-September-2018
Update : 13-September-2018
Requires : PowerShell Version 5.1 or later
Module : AzureRM Version 6.8.1
.LINK
To provide feedback or for further assistance please visit:
https://charbelnemnom.com
.EXAMPLE
.\Register-DPMCloud.ps1 -AzureSubscription [Azure Subscription Name] -ResourceGroupName [Resource Group Name] -KeyVault [Azure Key Vault Name] -StagingArea [Volume] -StorageType [LRS/GRS] -Verbose
This example will install the required PowerShell modules, then download and install the latest Microsoft Azure Recovery Services (MARS) agent if it's not installed.
You will prompted to authenticate to Azure, the tool will create a new Recovery Services Vault and set it's storage replication type.
Then it will register DPM server with Azure Backup service for online protection, configure DPM cloud settings, and finally store the Encryption Passphrase Key in Azure Key Vault.
.EXAMPLE
.\Register-DPMCloud.ps1 -AzureSubscription "Subscription ABC" -ResourceGroupName "backup-dpm-rg" -KeyVault "BackupKeyVault" -StagingArea D: -StorageType LRS -Verbose
This example will install the required PowerShell modules, then download and install the latest Microsoft Azure Recovery Services (MARS) agent if it's not installed.
You will prompted to authenticate to Azure, the tool will create a new Recovery Services Vault and set it's storage replication type.
Then it will register DPM server with Azure Backup service for online protection, configure DPM cloud settings, and finally store the Encryption Passphrase Key in Azure Key Vault.
#>
[CmdletBinding()]
Param (
[Parameter(Position=0, Mandatory=$true, HelpMessage = 'Please Provide Azure Subscription Name')]
[Alias('AzureSub')]
[String]$AzureSubscription,
[Parameter(Position=1, Mandatory=$true, HelpMessage='Please Provide Azure Resource Group Name')]
[Alias('AzureRG')]
[String]$ResourceGroupName,
[Parameter(Position=2, Mandatory=$true, HelpMessage='Please Specify Azure Key Vault Name')]
[Alias('KeyVault')]
[String]$BackupKeyVault,
[Parameter(Position=3, Mandatory=$true, HelpMessage='Please Specify Cloud Recovery Staging Area Volume')]
[Alias('Volume')]
[String]$StagingArea,
[Parameter(Position=4, Mandatory=$true, HelpMessage='Please Specify Storage Replication Type')]
[ValidateSet("LRS", "GRS")]
[String]$StorageType
)
Function Install-NuGet {
Install-PackageProvider NuGet -Force -Confirm:$false -Verbose:$false
}
Function Install-PowerShellGet {
Set-PSRepository -Name PSGallery -InstallationPolicy Trusted -Verbose:$false
Install-Module -Name PowerShellGet -Force -Confirm:$false -Verbose:$false
}
Function Install-AzureRM {
Set-PSRepository -Name PSGallery -InstallationPolicy Trusted -Verbose:$false
Install-Module -Name AzureRM -Force -Confirm:$false -Verbose:$false
}
Function Check_MARS_Installed ( $programName ) {
$Check = ((Get-ChildItem "HKLM:\SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\") | `
Where-Object {$_.Name -like "*$programName*"}).Length -gt 0; return $Check}
#! Check volume drive letter
Try {
$Vol = ($StagingArea -replace (":|\\",''))
$CheckVolume = Get-PSDrive -Name $Vol -ErrorAction Stop
}
Catch {
Write-Warning -Message "No volume found for drive letter: `"$Vol`", Please specify a correct volume"
Break
}
#! Check NuGet Provider
Try {
Import-PackageProvider -Name NuGet -ErrorAction Stop -Verbose:$false | Out-Null
Write-Verbose "Importing NuGet Provider..."
}
Catch {
Write-Warning "NuGet Provider was not found..."
Write-Verbose "Installing NuGet Package Provider..."
Install-NuGet
}
#! Check PowerShellGet Module
Try {
Import-Module -Name PowerShellGet -ErrorAction Stop -Verbose:$false | Out-Null
Write-Verbose "Importing PowerShellGet Module..."
}
Catch {
Write-Warning "PowerShellGet Module was not found..."
Write-Verbose "Installing the latest PowerShellGet Module..."
Install-PowerShellGet
}
#! Check AzureRM PowerShell Module
Try {
Import-Module -Name AzureRM -ErrorAction Stop -Verbose:$false | Out-Null
Write-Verbose "Importing Azure RM PowerShell Module..."
}
Catch {
Write-Warning "Azure Resource Manager PowerShell Module was not found..."
Write-Verbose "Installing Azure Resource Manager PowerShell Module..."
Install-AzureRM
}
#! Check Azure Cloud Connection
Try {
Write-Verbose "Connecting to Azure Cloud..."
Login-AzureRmAccount -Environment AzureCloud -Subscription $AzureSubscription -ErrorAction Stop | Out-Null
}
Catch {
Write-Warning "Cannot connect to Azure environment. Please check your credentials. Exiting!"
Break
}
#! Check C:\Temp directory if exists and create if not
$TempDir = "C:\Temp"
if (!(Get-Item $TempDir -ErrorAction SilentlyContinue)) {
New-Item -ItemType Directory -Path $TempDir | Out-Null
}
#! Download the latest Microsoft Azure Recovery Services Agent (MARS)
Write-Verbose "Downloading Microsoft Azure Recovery Services Agent..."
$URL = 'http://aka.ms/azurebackup_agent'
$wc = New-Object System.Net.WebClient
$wc.DownloadFile($url, $($TempDir + "\MARSAgentInstaller.exe"))
# Installing MARS Agent in silent mode if it's not installed
$MARS = Check_MARS_Installed("Windows Azure Backup")
If (!$MARS) {Start-Process -FilePath $($TempDir + "\MARSAgentInstaller.exe") -ArgumentList "/q"}
While ($MARS -eq $false) {
Write-Verbose "Installing Microsoft Azure Recovery Services Agent in silent mode..."
$MARS = Check_MARS_Installed("Windows Azure Backup")
Sleep 10
}
#! Creating a new Recovery Services Vault and configure it's storage type
Write-Verbose "Creating a new Recovery Services Vault named $env:ComputerName"
New-AzureRmRecoveryServicesVault -Name $env:ComputerName -ResourceGroupName $ResourceGroupName `
-Location (Get-AzureRmResourceGroup -Name $ResourceGroupName).location -Confirm:$false -Verbose:$false | Out-Null
Write-Verbose "Configuring Storage Replication Redundancy to $StorageType..."
$RSVault = Get-AzureRmRecoveryServicesVault -ResourceGroupName $ResourceGroupName
If ($StorageType -eq "LRS" ) {
Set-AzureRmRecoveryServicesBackupProperties -Vault $RSVault -BackupStorageRedundancy LocallyRedundant }
#! Downloading Recovery Vault Credentials file
Write-Verbose "Downloading Azure Recovery Vault Credentials file..."
$RSVaultFile = Get-AzureRmRecoveryServicesVaultSettingsFile -Backup -Vault $RSVault -Path $TempDir
#! Registering DPM with Azure Backup Service
Write-Verbose "Registering DPM with Azure Backup Service..."
Start-DPMCloudRegistration -DPMServerName $env:ComputerName -VaultCredentialsFilePath (Get-ChildItem -Path $TempDir -Filter *.VaultCredentials).FullName
#! Configuring DPM Initial Cloud Settings
Write-Verbose "Cloud Initial configuration settings..."
$Setting = Get-DPMCloudSubscriptionSetting -DPMServerName $env:ComputerName
#! Configure Staging Area
Write-Verbose "Configuring Cloud Recovery Staging Area directory..."
$Destination = "$(($Vol)+":\")"+"StagingArea"
if (!(Get-Item $TempDir -ErrorAction SilentlyContinue)) {
$Destination = New-Item -Name "StagingArea" -Path $(($Vol)+":") -ItemType Directory -Force
Set-DPMCloudSubscriptionSetting -DPMServerName $env:ComputerName -SubscriptionSetting $Setting -StagingAreaPath $Destination.FullName
}
Else {
Set-DPMCloudSubscriptionSetting -DPMServerName $env:ComputerName -SubscriptionSetting $Setting -StagingAreaPath $Destination
}
#! Configure Proxy Settings
Write-Verbose "Configure DPM cloud networking..."
Set-DPMCloudSubscriptionSetting -DPMServerName $env:ComputerName -SubscriptionSetting $Setting -NoProxy
Set-DPMCloudSubscriptionSetting -DPMServerName $env:ComputerName -SubscriptionSetting $setting -NoThrottle
#! Configure Encryption Settings
Write-Verbose "Configuring Encryption Passphrase Key..."
$Passphrase = (New-Guid).Guid
$EncryptionPassPhrase = ConvertTo-SecureString -string $Passphrase -AsPlainText -Force
Set-DPMCloudSubscriptionSetting -DPMServerName $env:ComputerName -SubscriptionSetting $setting -EncryptionPassphrase $EncryptionPassPhrase
#! Commit the changes
Set-DPMCloudSubscriptionSetting -DPMServerName $env:ComputerName -SubscriptionSetting $setting -Commit
#! Add DPM Backup Encryption Key to Azure Key Vault
Try {
Write-Verbose "Adding DPM Backup Encryption Key to Azure Key Vault"
Set-AzureKeyVaultSecret -VaultName $BackupKeyVault -Name $env:ComputerName -SecretValue $EncryptionPassPhrase -ContentType "Passphrase Encryption Key" -ErrorAction Stop | Out-Null
}
Catch {
Write-Warning "$_ Exiting!"
Break
}
# Clean-up Temp Environment
Write-Verbose "Clean-up Temp Environment..."
Remove-Item -Path $TempDir -Recurse -Force
Roadmap
I am planning to improve this tool in the future. This is still version 1.0. If you have any feedback or changes that everyone should receive, please feel free to leave a comment below.
Until then… Stay protected and secure with DPM and Azure Backup.
__
Thank you for reading my blog.
If you have any questions or feedback, please leave a comment.
-Charbel Nemnom-
About Charbel Nemnom 550 Articles
Charbel Nemnom is a Cloud Architect, ICT Security Expert, Microsoft Most Valuable Professional (MVP), and Microsoft Certified Trainer (MCT), totally fan of the latest's IT platform solutions, accomplished hands-on technical professional with over 17 years of broad IT Infrastructure experience serving on and guiding technical teams to optimize the performance of mission-critical enterprise systems. Excellent communicator is adept at identifying business needs and bridging the gap between functional groups and technology to foster targeted and innovative IT project development. Well respected by peers through demonstrating passion for technology and performance improvement. Extensive practical knowledge of complex systems builds, network design, business continuity, and cloud security.
Be the first to comment
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
{
"url": "https://charbelnemnom.com/2018/09/automate-cloud-backup-integration-in-dpm-with-azurebackup-and-powershell-scdpm-azurebackup/",
"source_domain": "charbelnemnom.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "137023",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZUOJPKWPQFYVVXOIMV2UA3CSPE5KY4EL",
"WARC-Concurrent-To": "<urn:uuid:f5966884-0570-4ecb-add1-95dea343f42f>",
"WARC-Date": "2020-08-09T23:17:56Z",
"WARC-IP-Address": "104.26.3.138",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2MVR5BO77QMFRRMV6ITJLZOBPFQLFMTZ",
"WARC-Record-ID": "<urn:uuid:cea97d71-b326-4606-9a46-90719c7f278b>",
"WARC-Target-URI": "https://charbelnemnom.com/2018/09/automate-cloud-backup-integration-in-dpm-with-azurebackup-and-powershell-scdpm-azurebackup/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ce4d9c8e-a2db-4e56-ae1a-64c6be9d2b0c>"
},
"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-230.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,
96,
97,
108,
109,
122,
123,
633,
634,
725,
726,
759,
760,
945,
946,
985,
1037,
1127,
1200,
1253,
1314,
1366,
1491,
1642,
1643,
1783,
1784,
1956,
1957,
2083,
2084,
2118,
2119,
2902,
2903,
2966,
2967,
3133,
3134,
3236,
3237,
3420,
3421,
3542,
3543,
3559,
3560,
3655,
3656,
3659,
3669,
3707,
3708,
3721,
3782,
3783,
3790,
3824,
3851,
3867,
3897,
3927,
3971,
4005,
4006,
4012,
4072,
4098,
4099,
4108,
4305,
4471,
4605,
4785,
4786,
4795,
4961,
5127,
5261,
5441,
5444,
5445,
5463,
5471,
5572,
5596,
5628,
5633,
5734,
5757,
5789,
5790,
5886,
5910,
5939,
5940,
6050,
6072,
6098,
6099,
6199,
6231,
6256,
6257,
6259,
6260,
6285,
6362,
6364,
6365,
6398,
6479,
6557,
6559,
6560,
6587,
6668,
6740,
6742,
6743,
6792,
6883,
6959,
6960,
6989,
6995,
7040,
7097,
7100,
7109,
7211,
7218,
7221,
7222,
7246,
7252,
7336,
7384,
7390,
7398,
7450,
7507,
7525,
7527,
7528,
7558,
7564,
7647,
7701,
7707,
7715,
7773,
7839,
7865,
7867,
7868,
7903,
7909,
7986,
8046,
8052,
8060,
8138,
8213,
8233,
8235,
8236,
8268,
8274,
8323,
8434,
8438,
8446,
8543,
8553,
8555,
8556,
8611,
8632,
8690,
8753,
8755,
8757,
8827,
8900,
8941,
8979,
9044,
9045,
9106,
9159,
9256,
9283,
9368,
9421,
9430,
9433,
9434,
9508,
9587,
9684,
9798,
9876,
9958,
9989,
10093,
10094,
10141,
10210,
10309,
10310,
10355,
10416,
10569,
10570,
10612,
10668,
10744,
10745,
10771,
10840,
10886,
10944,
11038,
11175,
11177,
11184,
11309,
11311,
11312,
11340,
11390,
11494,
11601,
11602,
11635,
11692,
11722,
11809,
11948,
11949,
11971,
12075,
12076,
12128,
12134,
12206,
12390,
12392,
12400,
12432,
12442,
12444,
12445,
12473,
12518,
12561,
12562,
12570,
12571,
12757,
12758,
12823,
12824,
12827,
12858,
12859,
12922,
12923,
12940,
12941,
12975,
13770,
13771,
13795,
13796
],
"line_end_idx": [
96,
97,
108,
109,
122,
123,
633,
634,
725,
726,
759,
760,
945,
946,
985,
1037,
1127,
1200,
1253,
1314,
1366,
1491,
1642,
1643,
1783,
1784,
1956,
1957,
2083,
2084,
2118,
2119,
2902,
2903,
2966,
2967,
3133,
3134,
3236,
3237,
3420,
3421,
3542,
3543,
3559,
3560,
3655,
3656,
3659,
3669,
3707,
3708,
3721,
3782,
3783,
3790,
3824,
3851,
3867,
3897,
3927,
3971,
4005,
4006,
4012,
4072,
4098,
4099,
4108,
4305,
4471,
4605,
4785,
4786,
4795,
4961,
5127,
5261,
5441,
5444,
5445,
5463,
5471,
5572,
5596,
5628,
5633,
5734,
5757,
5789,
5790,
5886,
5910,
5939,
5940,
6050,
6072,
6098,
6099,
6199,
6231,
6256,
6257,
6259,
6260,
6285,
6362,
6364,
6365,
6398,
6479,
6557,
6559,
6560,
6587,
6668,
6740,
6742,
6743,
6792,
6883,
6959,
6960,
6989,
6995,
7040,
7097,
7100,
7109,
7211,
7218,
7221,
7222,
7246,
7252,
7336,
7384,
7390,
7398,
7450,
7507,
7525,
7527,
7528,
7558,
7564,
7647,
7701,
7707,
7715,
7773,
7839,
7865,
7867,
7868,
7903,
7909,
7986,
8046,
8052,
8060,
8138,
8213,
8233,
8235,
8236,
8268,
8274,
8323,
8434,
8438,
8446,
8543,
8553,
8555,
8556,
8611,
8632,
8690,
8753,
8755,
8757,
8827,
8900,
8941,
8979,
9044,
9045,
9106,
9159,
9256,
9283,
9368,
9421,
9430,
9433,
9434,
9508,
9587,
9684,
9798,
9876,
9958,
9989,
10093,
10094,
10141,
10210,
10309,
10310,
10355,
10416,
10569,
10570,
10612,
10668,
10744,
10745,
10771,
10840,
10886,
10944,
11038,
11175,
11177,
11184,
11309,
11311,
11312,
11340,
11390,
11494,
11601,
11602,
11635,
11692,
11722,
11809,
11948,
11949,
11971,
12075,
12076,
12128,
12134,
12206,
12390,
12392,
12400,
12432,
12442,
12444,
12445,
12473,
12518,
12561,
12562,
12570,
12571,
12757,
12758,
12823,
12824,
12827,
12858,
12859,
12922,
12923,
12940,
12941,
12975,
13770,
13771,
13795,
13796,
13876
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13876,
"ccnet_original_nlines": 275,
"rps_doc_curly_bracket": 0.0033150799572467804,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15168100595474243,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029710710048675537,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31665363907814026,
"rps_doc_frac_unique_words": 0.31755051016807556,
"rps_doc_mean_word_length": 6.856691837310791,
"rps_doc_num_sentences": 125,
"rps_doc_symbol_to_word_ratio": 0.01720093935728073,
"rps_doc_unigram_entropy": 5.56976842880249,
"rps_doc_word_count": 1584,
"rps_doc_frac_chars_dupe_10grams": 0.144830122590065,
"rps_doc_frac_chars_dupe_5grams": 0.3368014097213745,
"rps_doc_frac_chars_dupe_6grams": 0.2664579749107361,
"rps_doc_frac_chars_dupe_7grams": 0.1977718472480774,
"rps_doc_frac_chars_dupe_8grams": 0.18985359370708466,
"rps_doc_frac_chars_dupe_9grams": 0.15514224767684937,
"rps_doc_frac_chars_top_2gram": 0.0232943594455719,
"rps_doc_frac_chars_top_3gram": 0.015191970393061638,
"rps_doc_frac_chars_top_4gram": 0.018230369314551353,
"rps_doc_books_importance": -1558.9862060546875,
"rps_doc_books_importance_length_correction": -1558.9862060546875,
"rps_doc_openwebtext_importance": -1161.1973876953125,
"rps_doc_openwebtext_importance_length_correction": -1161.1973876953125,
"rps_doc_wikipedia_importance": -816.8377075195312,
"rps_doc_wikipedia_importance_length_correction": -816.8377075195312
},
"fasttext": {
"dclm": 0.023323949426412582,
"english": 0.6381536722183228,
"fineweb_edu_approx": 1.1954635381698608,
"eai_general_math": 0.014635680243372917,
"eai_open_web_math": 0.12863421440124512,
"eai_web_code": 0.004607260227203369
}
}
|
{
"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": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,811,060,253,626,410,500 |
I am finding it difficult to get through step 6
Tell us what’s happening:
Describe your issue in detail here.
**Your code so far**
<html>
<body>
<h1>CatPhotoApp</h1>
<main>
<h2>Cat Photos</h2>
<!-- TODO: Add link to cat photos -->
<p>Click here to view more cat photos.</p>
</main>
</body>
</html>
**Your browser information:**
User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/103.0.0.0 Safari/537.36
Challenge: Step 6
Link to the challenge:
Hey! you have to add two spaces " " before h2, the comment, p tag this is called indenting used for readability
You should restart the step to get the original formatting back since formatting is a very important part of this step. Do not make any changes other than to the three children of main. The only thing you want to do is use your space bar to add two more spaces before the opening tag of each child.
1 Like
|
{
"url": "https://forum.freecodecamp.org/t/i-am-finding-it-difficult-to-get-through-step-6/523827",
"source_domain": "forum.freecodecamp.org",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "26647",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5LOWJDIMLVY5I5MRB6OWECMPHEDOVUVE",
"WARC-Concurrent-To": "<urn:uuid:2c3cc1eb-9e5c-4fe7-9daf-0c7a28398c34>",
"WARC-Date": "2022-12-09T06:12:20Z",
"WARC-IP-Address": "64.71.144.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:L3N5N2JQTHYPN4WCOOQENNTQKOJNSYP6",
"WARC-Record-ID": "<urn:uuid:f1efffcf-2a95-48eb-a056-574a133f4cb8>",
"WARC-Target-URI": "https://forum.freecodecamp.org/t/i-am-finding-it-difficult-to-get-through-step-6/523827",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2b6b4ce1-c64e-403a-a77a-85c2db9c1a3d>"
},
"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-182\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,
48,
49,
75,
111,
112,
135,
142,
149,
172,
182,
204,
244,
289,
290,
300,
308,
316,
348,
349,
476,
477,
495,
496,
519,
520,
632,
633,
932,
933
],
"line_end_idx": [
48,
49,
75,
111,
112,
135,
142,
149,
172,
182,
204,
244,
289,
290,
300,
308,
316,
348,
349,
476,
477,
495,
496,
519,
520,
632,
633,
932,
933,
939
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 939,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29741379618644714,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017241379246115685,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.33620691299438477,
"rps_doc_frac_unique_words": 0.6821191906929016,
"rps_doc_mean_word_length": 4.5033111572265625,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.442562580108643,
"rps_doc_word_count": 151,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.014705879613757133,
"rps_doc_frac_chars_top_3gram": 0.023529410362243652,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -119.21434783935547,
"rps_doc_books_importance_length_correction": -119.21434783935547,
"rps_doc_openwebtext_importance": -59.101749420166016,
"rps_doc_openwebtext_importance_length_correction": -46.7278938293457,
"rps_doc_wikipedia_importance": -42.67623519897461,
"rps_doc_wikipedia_importance_length_correction": -42.67623519897461
},
"fasttext": {
"dclm": 0.10610902309417725,
"english": 0.76041579246521,
"fineweb_edu_approx": 1.293224811553955,
"eai_general_math": 0.14573150873184204,
"eai_open_web_math": 0.15338283777236938,
"eai_web_code": 0.06101251021027565
}
}
|
{
"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": "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": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,811,576,320,968,851,000 |
DOCX (WORD) to TCR Converter
Convert your docx files to tcr online & free
Drop files here. 100 MB maximum file size or Sign Up
to
Convert to DOCX
docx
Microsoft Office Open XML
Since 2007, Microsoft began to use a file format docx, which is created by using the Office Open XML. The format is a zip-file containing the text in the form of XML, graphics and other data that can be translated into a sequence of bits using patent-protected binary formats. At first it was assumed that this format will replace the doc, but both formats are still used today.
TCR Converter
tcr
Text Compression for Reader
Is an e-book format developed for the Psion Series 3 platform used in the 1990s. It contains text and its formatting parameters. This e-book format was used exclusively in Psion devices.
How to convert DOCX to TCR
Step 1
Upload docx-file(s)
Select files from Computer, Google Drive, Dropbox, URL or by dragging it on the page.
Step 2
Choose "to tcr"
Choose tcr or any other format you need as a result (more than 200 formats supported)
Step 3
Download your tcr
Let the file convert and you can download your tcr file right afterwards
DOCX to TCR Quality Rating
4.0 (11 votes)
You need to convert and download at least 1 file to provide feedback!
|
{
"url": "https://convertio.co/docx-tcr/",
"source_domain": "convertio.co",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "139654",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M4TMTU2K7WJ5BDGBQ2CBI6CERCPLN5DG",
"WARC-Concurrent-To": "<urn:uuid:3eef60d8-bb40-47aa-92d7-5e949cad84d2>",
"WARC-Date": "2021-06-20T12:36:42Z",
"WARC-IP-Address": "13.32.182.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VLDXMNMGYCBLKTWJ34ZXS6UUTN2G2PLJ",
"WARC-Record-ID": "<urn:uuid:eed185d8-d354-4c14-90fb-5e41c94fed19>",
"WARC-Target-URI": "https://convertio.co/docx-tcr/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:958670cd-c057-4fdb-b872-f797de793aa5>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-217.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
29,
30,
75,
76,
129,
132,
148,
149,
154,
155,
181,
182,
561,
575,
576,
580,
581,
609,
610,
797,
798,
825,
826,
833,
834,
854,
855,
941,
942,
949,
950,
966,
967,
1053,
1054,
1061,
1062,
1080,
1081,
1154,
1155,
1182,
1183,
1198
],
"line_end_idx": [
29,
30,
75,
76,
129,
132,
148,
149,
154,
155,
181,
182,
561,
575,
576,
580,
581,
609,
610,
797,
798,
825,
826,
833,
834,
854,
855,
941,
942,
949,
950,
966,
967,
1053,
1054,
1061,
1062,
1080,
1081,
1154,
1155,
1182,
1183,
1198,
1267
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1267,
"ccnet_original_nlines": 44,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3484848439693451,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05303030088543892,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1666666716337204,
"rps_doc_frac_unique_words": 0.5625,
"rps_doc_mean_word_length": 4.419642925262451,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.557600975036621,
"rps_doc_word_count": 224,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.025252530351281166,
"rps_doc_frac_chars_top_3gram": 0.02626262977719307,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -107.84759521484375,
"rps_doc_books_importance_length_correction": -107.84759521484375,
"rps_doc_openwebtext_importance": -55.263065338134766,
"rps_doc_openwebtext_importance_length_correction": -55.263065338134766,
"rps_doc_wikipedia_importance": -50.322505950927734,
"rps_doc_wikipedia_importance_length_correction": -50.322505950927734
},
"fasttext": {
"dclm": 0.029922310262918472,
"english": 0.866788387298584,
"fineweb_edu_approx": 2.3552639484405518,
"eai_general_math": 0.290374219417572,
"eai_open_web_math": 0.19688177108764648,
"eai_web_code": 0.011305750347673893
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,187,538,973,518,829,000 |
<![CDATA[QML Code modularization (re-use)]]>Hi
It looks like Qt is making some really nice strides under Digia. I thought I would start playing with QML. I'm wondering how to go about modularizing qml files. For instance, what if I have two screens that have very different functionality and I want to separate them into different QML files or I have some code that I want to re-use often? How do I pull it all together?
thnx
Brian
]]>
https://forum.qt.io/topic/35045/qml-code-modularization-re-useRSS for NodeFri, 17 Aug 2018 17:39:55 GMTTue, 03 Dec 2013 16:25:46 GMT60<![CDATA[Reply to QML Code modularization (re-use) on Tue, 03 Dec 2013 16:25:46 GMT]]>Hi
It looks like Qt is making some really nice strides under Digia. I thought I would start playing with QML. I'm wondering how to go about modularizing qml files. For instance, what if I have two screens that have very different functionality and I want to separate them into different QML files or I have some code that I want to re-use often? How do I pull it all together?
thnx
Brian
]]>
https://forum.qt.io/post/35043https://forum.qt.io/post/35043Tue, 03 Dec 2013 16:25:46 GMT
<![CDATA[Reply to QML Code modularization (re-use) on Wed, 04 Dec 2013 09:30:12 GMT]]>Put separate components into separate QML files. It's all written in the documentation. As long as the file name follows the convention (starts with upper case), QML will allow you to import that file and use it in your code straigt away.
There are also more advanced options available, like creating custom component sets.
]]>
https://forum.qt.io/post/206194https://forum.qt.io/post/206194Wed, 04 Dec 2013 09:30:12 GMT
|
{
"url": "https://forum.qt.io/topic/35045.rss",
"source_domain": "forum.qt.io",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "3137",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DXW2WQCC25Y2V3KGSYR6B6CFR4UOMERI",
"WARC-Concurrent-To": "<urn:uuid:feda6923-ad37-4ce0-9c6d-dad4b7ce616a>",
"WARC-Date": "2018-08-17T17:39:55Z",
"WARC-IP-Address": "52.30.103.119",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:3KDYWFSTM3QS7JID74AJXSLXWLLZGD6S",
"WARC-Record-ID": "<urn:uuid:656009db-7ee7-4a4b-84b7-0d137257887b>",
"WARC-Target-URI": "https://forum.qt.io/topic/35045.rss",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:effbd2e8-ab9a-439f-a6e7-bcfe724ff421>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-113-243-226.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,
47,
421,
422,
427,
428,
434,
435,
439,
662,
1036,
1037,
1042,
1043,
1049,
1050,
1054,
1144,
1469,
1470,
1555,
1556,
1560
],
"line_end_idx": [
47,
421,
422,
427,
428,
434,
435,
439,
662,
1036,
1037,
1042,
1043,
1049,
1050,
1054,
1144,
1469,
1470,
1555,
1556,
1560,
1651
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1651,
"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.29750001430511475,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08250000327825546,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3075000047683716,
"rps_doc_frac_unique_words": 0.4501991868019104,
"rps_doc_mean_word_length": 5.051792621612549,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.476983070373535,
"rps_doc_word_count": 251,
"rps_doc_frac_chars_dupe_10grams": 0.4810725748538971,
"rps_doc_frac_chars_dupe_5grams": 0.5283911824226379,
"rps_doc_frac_chars_dupe_6grams": 0.5283911824226379,
"rps_doc_frac_chars_dupe_7grams": 0.4810725748538971,
"rps_doc_frac_chars_dupe_8grams": 0.4810725748538971,
"rps_doc_frac_chars_dupe_9grams": 0.4810725748538971,
"rps_doc_frac_chars_top_2gram": 0.031545739620923996,
"rps_doc_frac_chars_top_3gram": 0.022082019597291946,
"rps_doc_frac_chars_top_4gram": 0.03548895940184593,
"rps_doc_books_importance": -166.72430419921875,
"rps_doc_books_importance_length_correction": -153.14051818847656,
"rps_doc_openwebtext_importance": -89.79743957519531,
"rps_doc_openwebtext_importance_length_correction": -89.79743957519531,
"rps_doc_wikipedia_importance": -78.92083740234375,
"rps_doc_wikipedia_importance_length_correction": -66.76551055908203
},
"fasttext": {
"dclm": 0.15416938066482544,
"english": 0.8967690467834473,
"fineweb_edu_approx": 1.3396847248077393,
"eai_general_math": 0.16613906621932983,
"eai_open_web_math": 0.2251337766647339,
"eai_web_code": 0.3240627646446228
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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,655,927,795,485,805,000 |
Domain esconet.org kaufen?
Produkte und Fragen zum Begriff Esconet:
• No products found for this domain.
Ähnliche Suchbegriffe für Esconet:
• Does the percussion clock always run fast?
No, the percussion clock does not always run fast. The speed at which the clock runs can vary depending on the specific design and mechanism of the clock. Factors such as the quality of the materials used, the maintenance of the clock, and the accuracy of the percussion mechanism can all influence the speed at which the clock runs. It is important to properly set and maintain the clock to ensure accurate timekeeping.
• How can I re-register my Herkules Matador?
To re-register your Herkules Matador, you will need to contact the relevant vehicle registration authority in your area. They will provide you with the necessary forms and instructions for re-registering your vehicle. You may need to provide proof of ownership, updated insurance information, and any required vehicle inspections. Once you have completed the re-registration process, you will receive updated registration documents for your Herkules Matador.
• What is the difference between drums and percussion?
Drums are a specific type of percussion instrument that typically have a hollow body and a membrane that is struck to produce sound. Percussion, on the other hand, is a broader category that includes a wide range of instruments that are struck, shaken, or scraped to produce sound. While drums are a subset of percussion instruments, percussion encompasses a variety of instruments such as cymbals, tambourines, maracas, and xylophones.
• What are the white spots on the spinach variety Matador?
The white spots on the spinach variety Matador are likely due to a condition called downy mildew. Downy mildew is a common fungal disease that affects spinach plants, causing white or grayish spots on the leaves. This disease can be detrimental to the plant's health and reduce its overall yield. It is important to monitor and manage downy mildew to prevent its spread and protect the spinach crop.
• What is a simple piece for trumpet and percussion?
A simple piece for trumpet and percussion could be a duet that features a repetitive melody or motif for the trumpet, accompanied by a steady rhythmic pattern on the percussion. The piece could be in a simple time signature, such as 4/4, and have a straightforward form, making it accessible for musicians of varying skill levels. The instrumentation allows for a clear interplay between the two instruments, creating a cohesive and engaging musical dialogue.
• What is the abbreviation for instruments in the field of percussion?
The abbreviation for instruments in the field of percussion is "perc." This abbreviation is commonly used in music notation and discussions to refer to percussion instruments such as drums, cymbals, and other rhythm instruments. It is a convenient shorthand for indicating the percussion section in musical scores and discussions.
• Can Xbox Series S games be played in Latin America?
Yes, Xbox Series S games can be played in Latin America. The Xbox Series S is not region-locked, so games purchased in any region can be played on the console. Additionally, Xbox Live services are available in Latin America, allowing players to access online multiplayer, digital game purchases, and other features. Therefore, gamers in Latin America can enjoy playing Xbox Series S games without any restrictions.
• What are some good Spanish series from Spain, not from Latin America?
Some good Spanish series from Spain, not from Latin America, include "Money Heist" (La Casa de Papel), "Elite," "Cable Girls" (Las Chicas del Cable), "Vis a Vis," and "Gran Hotel." These series have gained international popularity for their engaging storylines, strong performances, and high production values. They offer a diverse range of genres, from crime dramas to period pieces, providing something for every viewer's taste.
• What good Spanish series from Spain, not from Latin America, are there?
Some popular Spanish series from Spain include "Money Heist" (La Casa de Papel), "Elite," "Cable Girls" (Las Chicas del Cable), "Vis a Vis," and "Gran Hotel." These series have gained international acclaim for their engaging storylines, talented actors, and high production values. Each of these shows offers a unique perspective on Spanish culture and society, making them worth watching for fans of Spanish television.
• What are some good Spanish TV series from Spain, not from Latin America?
Some good Spanish TV series from Spain, not from Latin America, include "Money Heist" (La Casa de Papel), a popular crime drama series on Netflix that follows a group of robbers executing intricate heists; "Elite," a teen drama series set in an exclusive private school that delves into themes of class, privilege, and relationships; and "Vis a Vis" (Locked Up), a gripping prison drama that follows the story of a young woman navigating the challenges of life behind bars. These series showcase the diverse storytelling and high production quality of Spanish television from Spain.
• Can our Latin teacher teach Latin?
Yes, it is likely that our Latin teacher can teach Latin. Typically, a Latin teacher would have the necessary knowledge and expertise in the Latin language to effectively teach it to students. Additionally, the teacher would have likely undergone specific training and education in Latin language and literature in order to be qualified to teach it. Therefore, it is reasonable to assume that our Latin teacher can teach Latin.
• Are white Latin Americans privileged in Latin America compared to indigenous Latin Americans?
White Latin Americans are generally privileged in Latin America compared to indigenous Latin Americans. This privilege is often rooted in historical and systemic discrimination, as well as economic and social disparities. White Latin Americans often have better access to education, employment opportunities, and healthcare, while indigenous Latin Americans face higher rates of poverty, marginalization, and discrimination. This inequality is a result of colonial legacies and ongoing social hierarchies that continue to marginalize indigenous communities in many Latin American countries.
|
{
"url": "https://www.esconet.org/Latin-Percussion-Matador-Series",
"source_domain": "www.esconet.org",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "60493",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NLEDJFP7TW6ZXAEGT6A3GAIWH2QG77NF",
"WARC-Concurrent-To": "<urn:uuid:6e961c90-7108-4d64-a728-5f28f2e22716>",
"WARC-Date": "2024-09-13T08:16:29Z",
"WARC-IP-Address": "136.243.81.230",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WD3KMZJ4JZDVUXYFRU4CHGZ3PCU2K3TN",
"WARC-Record-ID": "<urn:uuid:80001470-d3b6-471e-bde3-94b11233394f>",
"WARC-Target-URI": "https://www.esconet.org/Latin-Percussion-Matador-Series",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6c1ce731-e773-4667-a8ec-22e027f58a06>"
},
"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-5\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
27,
28,
69,
70,
71,
110,
111,
146,
147,
148,
195,
196,
621,
622,
669,
670,
1133,
1134,
1191,
1192,
1633,
1634,
1695,
1696,
2100,
2101,
2156,
2157,
2621,
2622,
2695,
2696,
3031,
3032,
3088,
3089,
3508,
3509,
3583,
3584,
4019,
4020,
4096,
4097,
4522,
4523,
4600,
4601,
5188,
5189,
5228,
5229,
5661,
5662,
5760,
5761
],
"line_end_idx": [
27,
28,
69,
70,
71,
110,
111,
146,
147,
148,
195,
196,
621,
622,
669,
670,
1133,
1134,
1191,
1192,
1633,
1634,
1695,
1696,
2100,
2101,
2156,
2157,
2621,
2622,
2695,
2696,
3031,
3032,
3088,
3089,
3508,
3509,
3583,
3584,
4019,
4020,
4096,
4097,
4522,
4523,
4600,
4601,
5188,
5189,
5228,
5229,
5661,
5662,
5760,
5761,
6355
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6355,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3235294222831726,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006920420099049807,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1531141847372055,
"rps_doc_frac_unique_words": 0.3969542980194092,
"rps_doc_mean_word_length": 5.171573638916016,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.32510232925415,
"rps_doc_word_count": 985,
"rps_doc_frac_chars_dupe_10grams": 0.09030231833457947,
"rps_doc_frac_chars_dupe_5grams": 0.20592853426933289,
"rps_doc_frac_chars_dupe_6grams": 0.19729092717170715,
"rps_doc_frac_chars_dupe_7grams": 0.19414998590946198,
"rps_doc_frac_chars_dupe_8grams": 0.15724381804466248,
"rps_doc_frac_chars_dupe_9grams": 0.1419316828250885,
"rps_doc_frac_chars_top_2gram": 0.02591283991932869,
"rps_doc_frac_chars_top_3gram": 0.016489990055561066,
"rps_doc_frac_chars_top_4gram": 0.01766783930361271,
"rps_doc_books_importance": -608.4136962890625,
"rps_doc_books_importance_length_correction": -608.4136962890625,
"rps_doc_openwebtext_importance": -286.3933410644531,
"rps_doc_openwebtext_importance_length_correction": -286.3933410644531,
"rps_doc_wikipedia_importance": -239.4636993408203,
"rps_doc_wikipedia_importance_length_correction": -239.4636993408203
},
"fasttext": {
"dclm": 0.8252811431884766,
"english": 0.9423140287399292,
"fineweb_edu_approx": 2.6817212104797363,
"eai_general_math": 0.02875971980392933,
"eai_open_web_math": 0.1987782120704651,
"eai_web_code": 0.0027282200753688812
}
}
|
{
"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": "788.92",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Wind instruments"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "9",
"label": "FAQ"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,755,125,233,203,604,000 |
Programming
Scale Summit 2015: Testing in production session
One of the most interesting sessions I went to at Scale Summit 2015 was one about testing in production. It was not that well attended compared to the other sessions so I don't know if there was implied agreement with the topic.
One of the questions was why it is important to test in production. For me the biggest thing is that you can only really get realistically distributed traffic from genuine traffic. Most load-testing or replay strategies fail for me at the first hurdle by only creating load from a few points of presence, usually in the big Amazon availability zones. You also have to be careful that traffic is routed outside of Amazon's internal data connections if you want to get realistic numbers. Dealing with load from a few different locations with large data pipelines between them is very different from distributed clients on the public network.
Replay strategies allow for "realistic" traffic patterns and behaviours but one of the more interesting ideas discussed was to generate fake load during off-peak periods. This is generated alongside the genuine user traffic. The fake load exercises key revenue generating pathways with some procedural randomisation. Injecting this additional fake load allows capacity planning and scaling strategies to be tested to a known excess capacity.
Doing testing in production means being responsible so we talked about how to identify fake test traffic (HTML headers with verification seemed sensible) so that you can do things like circuit-break that traffic and also segment it in reporting.
During the conversation I realised that the Guardian's practice of asking native app users to join the beta programme was also an example of testing in production. Most users who enter the scheme don't leave so you are creating a large segment of users who are validating releases and features ahead of the wider user base.
In the past we've also used the Facebook trick of duplicating user requests into multiple systems to make sure that systems that are being developed can deal with production load. If you don't like doing that client-side you can do it server-side by using a simple proxy that queues up work with a variety of systems but offloads everything that isn't the user's genuine request. Essentially you throw away the additional responses but the services will still do the work.
We also talked about the concept of having advanced healthchecks that report on the status of things like the availability of dependencies. I've used this technique before but interestingly I've made the machines go into failure mode if their mandatory dependencies aren't available where as other people were simply dashboarding the failures (and presumably alerting on them).
At the end of the session I was pretty convinced that testing in production is not only sensible but that actually there are a number of weaknesses in pre-production testing approaches. The key one being that you should assume that pre-production testing represents the best case scenario. You are testing your assumed scenario in a controlled environment.
There is also a big overlap between good monitoring and production testing. You have to have the first before you can reasonably do the second. The monitoring needs to be freely accessible to everyone as well. There's no good reason to hide monitoring away in an operations group and developers and non-technical team members need to be able to see and understand what is actually happening in production if they are to have the same conversation.
Standard
Programming
Writing code without tests
This post is aimed at people who have mastered test-driven development and ideally also behaviour-driven development and who are familiar with XCheck testing. If you don’t have good basic steps then trying to jump onto some of these techniques are likely to backfire on you as you will probably struggle to assess the risks correctly.
There is a reason TDD was invented, it represents the refinement of good testing practice and the philosophy of good software design. TDD is a relatively simple practice to describe that requires effort to implement. Writing code driven by tests is safer that straight-coding.
Writing untested code is a kind of mastery technique. It is high-risk and relies on the skills and the knowledge of the programmer. I don’t think it is ever responsible if the programmer is not going to be the person supporting the result in production. Without this condition then the programmer’s interests are not properly aligned with the consumers of their code.
So with all those caveats in place what if we want to create code faster because we don’t have to write tests?
Well we have to understand where bugs come from and we will have to write code that doesn’t allow those situations to arise.
There are two important principles to start with. If you can rely on tested library code, then you can rely on the underlying quality of the tested code and leverage it in your own application. Secondly the code you don’t write will not have bugs.
Therefore we should be aiming to write the smallest amount of code possible and we should never try to code what others have coded for us.
The next point is about where bugs occur. I think we’re now at a consensus point that most bugs occur in the way we change and maintain state. In both procedural and functional languages it is rare to get a mistake in the order of steps that something must happen in for example. These kind of problems tend to be misunderstandings of the domain (that get written into test suites as well so testing doesn’t help catch them) rather than genuinely unexpected consequences of the programmer’s code. Object-orientated code is really hard to reason about from this point of view as objects don’t have an implied order of execution.
This is why quick scripts of less than 200 lines tend to do stable sterling service for years whereas larger applications are more tortured in their existence.
Therefore whatever language we are coding in we need to adopt the functional principle of operating only on our parameters and returning values that can be consumed by the caller.
Size matters, a lot, if whole program can fit into a single file and you can pretty much hold the whole thing in your head then it will be easy to reason about what the program is doing and see flaws in the logic of the program. A single complex line of code is better than many lines and is much better than many lines split across many files.
One way to bring down the size of code files is to be ruthless about concerns. For example recently in my Python programming I have been assigning only one purpose to each module: this module renders reports, this one provides JSON endpoints.
Another technique is to not persist any state, this is actually surprisingly easy in web programming since each request is completely separate event and by default you can trade CPU time for isolation.
If you are doing batch or server-side programming then it is worth considering using something like parallel to create many separate bubbles of execution rather than trying to write code yourself to distribute work.
Another aspect of state that causes issues are making global modifications, whether it be to a database or a filesystem. Try and defer all global changes to the final moment of a program and do all the manipulation in-memory instead. If you never change the world then you can run a program over and over again refining what it does.
Assertions are more powerful than logging in writing test-less code, it is better to kill a thread of execution rather than let it do something you weren’t expecting. Logging is really about helping build your intuition about what a program does and how it works.
Assertions allow you to create strong pre and post-conditions on the operation of the program. Essentially they allow you to guarantee the “happy path” execution of your code and avoid having to test all the negative situations that might occur.
Despite this you always want to code for failure, use short-circuit logic to abort code flow early and therefore simplify the context of the code in the rest of the function.
Remember all the basic rules of cyclomatic complexity, don’t nest, don’t do conditionals, do try and express your looping as list comprehensions.
Don’t write generic code, ever. The more potential inputs a function has, the more you end up needing unit-tests to verify the interactions. If something is meant to work on strings don’t try to make it work on strings and integers. Your detection code ends up being a potential source of bugs that needs testing.
If you write dynamic interpreted languages then you are going to have do some manual testing, unless you can remember the names and orders of the functions exactly. Don’t forget to dive into the shell or REPL and play around with the code in isolation. If you can verify the behaviour of individual parts of your program without having to wire together multiple components then you have the right level of granularity for your code.
Re-use code that is already working. Code re-use is generally best achieved by cut and pasting files and then importing the functions you need. Don’t try and synchronise your code, updating some library code ultimately means that you are going to know whether the new library code works as you expect with your functionality and that means you’ll need a test suite.
Don’t refactor your code, rewrite it. Refactoring requires unit tests. Don’t be afraid of things like myfunction2 (although once you have the new functionality you need to delete the old unused stuff). Re-writing allows you to ditch all your assumptions about the code and attempt to express your new understanding of the problem and the requirements as simply as possible.
Don’t work with large numbers of people on the same code base. The more people trying to modify and change the code the more you need tests to try and clarify your different intents for the code base. Again, try divide and conquer on the problem, rather than six people working on the same code can you get three sets of two people collaborating on three smaller codebases.
Finally don’t be afraid to write a test. Writing the right unit-test to prove you can rely on a base piece of functionality means that you then don’t have to write tests for all the pieces of code that use that underlying function. I like to try and write code without tests to maximise the flexibility of the code base when I’m tackling problems with unclear solutions. It is not an ideological thing to have no tests whatsoever, it is rather that when tempted to write a test I think “Could I do this in a way that is trivial and doesn’t require a test?”. Simplicity is the cornerstone of test-free code.
Standard
Software, Work
Up-front quality
There has been a great exchange on the London Clojurians mailing list recently talking about the impact of a good REPL on development cycles. The conversation kicks into high-gear with this post from Malcolm Sparks although it is worth reading it from the start (membership might be required I can’t remember). In his post Malcolm talks about the cost of up-front quality. This, broadly speaking, is the cost of the testing required to put a feature live, it is essentially a way of looking at the cost that automated testing adds to the development process. As Malcolm says later: “I’m a strong proponent of testing, but only when testing has the effect of driving down the cost of change.”.
Once upon a time we had to fight to introduce unit-testing and automated integration builds and tests. Now it is a kind of given that this is a good thing, rather like a pendulum, the issue is going too far in the opposite direction. If you’ve ever had to scrap more than one feature because it failed to perform then the up-front quality cost is something you consider as closely as the cost of up-front design and production failure.
Now the London Clojurians list is at that perfect time in its lifespan where it is full of engaged and knowledgeable technologists so Steve Freeman drops into the thread and sensibly points out that Malcolm is also guilty of excess by valuing feature mutability to the point of wanting to be able to change a feature in-flight in production, something that is cool but is probably in excess of any actual requirements. Steve adds that there are other benefits to automated testing, particularly unit testing, beyond guaranteeing quality.
However Steve mentions the Forward approach, which I also subscribe to, of creating very small codebases. So then Paul Ingles gets involved and posts the best description I’ve read of how you can use solution structure, monitoring and restrained codebases to avoid dealing with a lot of the issues of software complexity. It’s hard to boil the argument down because the post deserves reading in full. I would try and summarise it as the external contact points of a service are what matters and if you fulfil the contract of the service you can write a replacement in any technology or stack and put the replacement alongside the original service.
One the powerful aspects of this approach is that is generalises the “throw one away” rule and allows you to say that the current codebase can be discarded whenever your knowledge of the domain or your available tools change sufficiently to make it possible to write an improved version of the service.
Steve then points out some of the other rules that make this work, being able to track and ideally change consumers as well. Its an argument for always using keys on API services, even internal ones, to help see what is calling your service. Something that is moving towards being a standard at the Guardian.
So to summarise, a little thread of pure gold and the kind of thing that can only happen when the right people have the time to talk and share experiences. And when it comes to testing, ask whether your tests are making it cheaper to change the software when the real functionality is discovered in production.
Standard
Programming, Work
Optimizely testing like a hacker
At work we use Optimizely and I am a fan of the product; I think it has had a massive impact on the way we work and should really help guide us to decide what we choose to do.
However I am not a product manager, user testing expert or statistician (that last part is a lie, I’m a statistician who hasn’t done any stats for seventeen years) I am a dirty hacker programmer and I use Optimizely in a way that probably makes my colleagues weep but which I think actually makes it more valuable as a product. I want to talk about breaking some of the common rules that people put up around this testing.
Note that you need to understand what you’re doing here, I am not recommending this if you are new to the product or multi-variate testing. You also need a good stream of traffic to work on. I do, this is working out for me. One piece of good practice I would keep is: decide how you are going to judge the test before you start it and don’t change your measure once you’ve started. If it is clear your initial metrics aren’t helpful, design a new test. The knowledge you’ve gained is valuable for formulating the right measures.
Don’t change the test once you’ve started it
Only once the test has started can you understand what the problem you are dealing with is and what responses you can take to the issues. If you have a question about what is happening in the test feel free to create a new variation (always with a good name!) and throw it into the mix. I sometimes start with one variation and end the test with nine. It’s better to test immediately than speculate.
Changing a variation (no matter how tempting) is dangerous though as you’ll have to remember the differences and when you applied them. I prefer to spawn variations to changing an in-flight variation. Of course fixing bugs and unintentional consequences is fine. You’re looking at the long term rate not the initial performance.
Don’t change the traffic
I’m not sure this is a general shibboleth but I play around with traffic massively during the test. The great thing about Optimizely is that it takes care of the math so feel free to mix the allocation of traffic freely. If you have a run-away winner early on then don’t be afraid to feed the majority of traffic to it.
Make the test work for the whole audience
I don’t believe in this, make the test work for the easiest audience segment to access. I frequently only test on modern browsers. If you find a trend then shock, horror it often works for the whole audience. It’s about fast feedback not universal truth.
The biggest advantage is that you can use CORS-compliant browsers to do bigger changes to the pages under test.
Don’t change the underlying content
If you take your best performing variation and apply it to the page then the “Original” variation should trend to the variation. If it doesn’t then you know something is up with your measuring. I actually think it is really helpful to make a succession of changes to the base content, based on the tests until the Original variation is performing better than the individual variations.
Once Original is top performing variation you can stop testing the page.
A/A testing has problems
So what? Optimizely has a few issues, you need to deal in big numbers. A/A can be helpful but if you are working in five digit numbers or double-digit percentages then don’t worry about the noise.
Tests have to look good
If your theory is accurate it absolutely does not have to look good. If you are worried that your hypothesis is not working because of the visuals: get over yourself and admit that the idea was weak and you need to rethink it.
I like to start off all variations looking a bit crappy and then seeing whether they can be outperformed by an improved appearance. Often the answer is no; there is a rule of diminishing returns on the appearance of a variation. Things get over-designed on the web all the time. However by trying better looking variations in increments you know exactly how much effort to invest.
Standard
Web Applications
Good magic, bad magic
Philip Potter pinged me his post on Sinatra magic during the week. Mark Needham’s comment and code on solving the mocking problem is good advice to the problem as posed.
At Wazoku where we use the often equally magical Bottle framework we don’t use top-down TDD but instead outside-in functional tests (with no funky runners as we don’t need CI). This solves the whole magic issue by shifting the attention to what the public interactions of the application are. This is one of the massive benefits of using a microapp HTTP/JSON/REST-like architecture. I could flip the API from Bottle to Django or Compojure or Sinatra and my test suite can keep on rocking and telling me whether the behaviour my consumers are relying on is correct.
The major thing I felt when reading through Philip’s post was the massive amount of effort that was going into testing relatively simple behaviour. This is a bit of anti-pattern with Agile developers (or perhaps it is part of the mastery thing where rote “correct” behaviour is modified by experience and judgement). One of the massive advantages of using something like Sinatra is that you can get a whole web app with rich behaviour into less than 200 lines. If you then create thousands of lines of test code and battle with the magic for hours on end you’ve completely destroyed your productivity.
If you have a code base that you expect to be large and highly contested by a large development team you need good, layered testing and to use frameworks that support that. If you have an app that is small and when its done it is done then there is no need to agonise as to whether it was done “right”.
The idea that top-down TDD is the only correct way to write software is corrosive. When faced with a generally poorly skilled and educated workforce it is good to have rules. I have imposed a certain style of TDD on a group myself because it gives a good framework for work and achieves very consistent output.
However with skilled people on small scale projects you can kill yourself by imposing arbitrary rules. I love Sinatra and while I might be equivocal about magic I think it is ridiculous to moan about it if you are using something as unicorn-packed as Ruby. For example Philip was trying to use RSpec mocks and stubs to do his TDD. The result is kind of saying that you’re disappointed that your “good” magic for testing didn’t work with the “bad” magic of a DSL for web applications. Even if your RSpec code passed its tests you still haven’t said anything particularly deep about the production behaviour of your application as your unit testing environment was severely compromised by the manipulations of your mocking framework.
So my rule of thumb is: if its simple, do it; if it was simple, functionally test it; if it was never really simple then test-drive it with suitable tools.
Standard
Programming, Python
How does the patch decorator in Mock work?
I tend to use Mock more as a stubbing library rather than for mocking. The patch decorator is pretty handy in terms of this as it takes care of all the resetting once your stubbed test has run making it easy to have a test where a dependency returns an empty list, followed by a single-entry list and so on.
However I often forget how exactly it works so I’ve decided to write up my latest remembering of how to do this (via John Hartley’s help and reminders) so I have something to look up next time I forget.
The first thing is that the patch decorator takes a string that represents the fully qualified name of the stub/mock you want to create. In a Django app for example that means you should include the app name at the root. The name also reflects the local name of an imported item. Something I commonly do wrong is to bind to the absolute name, say ‘random.choice’ rather than ‘myapp.mymodule.random.choice’. If you are in the situation where your stub is correct when you call it directly but never happens when you run the code under test I am pretty sure that naming will be at the root of your problems 95% of the time.
For each string argument you have in patch you also need to define a parameter to the test function, this will contain the actual Mock object and is what you use to actually stub the value to what you want it to be for the test. Use names that make sense here, stub_db, fake_file_reader not just mock1, mock2 and so on.
With these relatively few reminders in place you should now be in a position to stub simply with Mock!
Standard
Software, Work
The Joy of Acceptance Testing: Is my bug fixed yet?
Here’s a question that should be a blast from the past: “Is my bug fixed yet?”.
I don’t know, is your acceptance test for the bug passing yet?
Acceptance tests are often sold as being the way that stakeholders know that their signed-off feature is not going to regress during iterative development. That’s true, they probably do that. What they also do though is dramatically improve communication between developers and testers. Instead of having to faf around with bug tracking, commit comment buggery and build artifact change lists you can have your test runner of choice tell you the current status of all the bugs as well as the features.
Running acceptance tests is one example where keeping the build green is not mandatory. This creates a need for a slightly more complicated build result visualisation. I like to see a simple bar split into green and red with the number of failing tests. There may be a good day or two when that bar is totally green but in general your test team should be way ahead of the developers so the red bar represents the technical deficit you are running at any given moment.
If it starts to grow you have a prompt to decide whether you need to change your priorities or developer quality bar. Asking whether a bug has been fixed or when the fix will be delivered are the wrong questions. For me the right questions are: should we fix it and how important is it?
If we are going to fix a bug we should have an acceptance test for it and its importance indicates what time frame that test should pass in.
Standard
|
{
"url": "https://rrees.me/tag/testing/",
"source_domain": "rrees.me",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "72282",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B5RWV47QHRSOKASIUNNVTGEAQOYUQPGB",
"WARC-Concurrent-To": "<urn:uuid:f2bee338-123f-4254-b7f0-3de91c6e0a1c>",
"WARC-Date": "2018-12-15T09:54:46Z",
"WARC-IP-Address": "192.0.78.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XVP5TOWYVEQZG3X5B745A4I3PKU5HUKO",
"WARC-Record-ID": "<urn:uuid:265d5e24-09a6-4829-8227-94ed2ffd4439>",
"WARC-Target-URI": "https://rrees.me/tag/testing/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1ea1a4b1-6ef9-4b76-8554-fa739f12ead2>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-143-18-132.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,
12,
13,
62,
63,
292,
293,
933,
934,
1376,
1377,
1623,
1624,
1948,
1949,
2422,
2423,
2801,
2802,
3159,
3160,
3608,
3609,
3618,
3630,
3631,
3658,
3659,
3994,
3995,
4272,
4273,
4641,
4642,
4753,
4754,
4879,
4880,
5128,
5129,
5268,
5269,
5897,
5898,
6058,
6059,
6239,
6240,
6585,
6586,
6829,
6830,
7032,
7033,
7249,
7250,
7584,
7585,
7849,
7850,
8096,
8097,
8272,
8273,
8419,
8420,
8734,
8735,
9168,
9169,
9535,
9536,
9910,
9911,
10285,
10286,
10893,
10894,
10903,
10918,
10919,
10936,
10937,
11630,
11631,
12067,
12068,
12606,
12607,
13255,
13256,
13559,
13560,
13869,
13870,
14181,
14182,
14191,
14209,
14210,
14243,
14244,
14420,
14421,
14844,
14845,
15375,
15376,
15421,
15422,
15822,
15823,
16152,
16153,
16178,
16179,
16499,
16500,
16542,
16543,
16798,
16799,
16911,
16912,
16948,
16949,
17335,
17336,
17409,
17410,
17435,
17436,
17633,
17634,
17658,
17659,
17886,
17887,
18268,
18269,
18278,
18295,
18296,
18318,
18319,
18489,
18490,
19055,
19056,
19658,
19659,
19962,
19963,
20274,
20275,
21007,
21008,
21164,
21165,
21174,
21194,
21195,
21238,
21239,
21547,
21548,
21751,
21752,
22374,
22375,
22695,
22696,
22799,
22800,
22809,
22824,
22825,
22877,
22878,
22958,
22959,
23022,
23023,
23525,
23526,
23995,
23996,
24283,
24284,
24425,
24426
],
"line_end_idx": [
12,
13,
62,
63,
292,
293,
933,
934,
1376,
1377,
1623,
1624,
1948,
1949,
2422,
2423,
2801,
2802,
3159,
3160,
3608,
3609,
3618,
3630,
3631,
3658,
3659,
3994,
3995,
4272,
4273,
4641,
4642,
4753,
4754,
4879,
4880,
5128,
5129,
5268,
5269,
5897,
5898,
6058,
6059,
6239,
6240,
6585,
6586,
6829,
6830,
7032,
7033,
7249,
7250,
7584,
7585,
7849,
7850,
8096,
8097,
8272,
8273,
8419,
8420,
8734,
8735,
9168,
9169,
9535,
9536,
9910,
9911,
10285,
10286,
10893,
10894,
10903,
10918,
10919,
10936,
10937,
11630,
11631,
12067,
12068,
12606,
12607,
13255,
13256,
13559,
13560,
13869,
13870,
14181,
14182,
14191,
14209,
14210,
14243,
14244,
14420,
14421,
14844,
14845,
15375,
15376,
15421,
15422,
15822,
15823,
16152,
16153,
16178,
16179,
16499,
16500,
16542,
16543,
16798,
16799,
16911,
16912,
16948,
16949,
17335,
17336,
17409,
17410,
17435,
17436,
17633,
17634,
17658,
17659,
17886,
17887,
18268,
18269,
18278,
18295,
18296,
18318,
18319,
18489,
18490,
19055,
19056,
19658,
19659,
19962,
19963,
20274,
20275,
21007,
21008,
21164,
21165,
21174,
21194,
21195,
21238,
21239,
21547,
21548,
21751,
21752,
22374,
22375,
22695,
22696,
22799,
22800,
22809,
22824,
22825,
22877,
22878,
22958,
22959,
23022,
23023,
23525,
23526,
23995,
23996,
24283,
24284,
24425,
24426,
24434
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 24434,
"ccnet_original_nlines": 190,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.49989601969718933,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01580370031297207,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09191100299358368,
"rps_doc_frac_unique_words": 0.27934935688972473,
"rps_doc_mean_word_length": 4.652050971984863,
"rps_doc_num_sentences": 197,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.900572776794434,
"rps_doc_word_count": 4242,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0058781797997653484,
"rps_doc_frac_chars_dupe_6grams": 0.0021283100359141827,
"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.008361199870705605,
"rps_doc_frac_chars_top_3gram": 0.002432350069284439,
"rps_doc_frac_chars_top_4gram": 0.0018242599908262491,
"rps_doc_books_importance": -2049.049560546875,
"rps_doc_books_importance_length_correction": -2049.049560546875,
"rps_doc_openwebtext_importance": -1447.4464111328125,
"rps_doc_openwebtext_importance_length_correction": -1447.4464111328125,
"rps_doc_wikipedia_importance": -962.3522338867188,
"rps_doc_wikipedia_importance_length_correction": -962.3522338867188
},
"fasttext": {
"dclm": 0.06621372699737549,
"english": 0.9522827863693237,
"fineweb_edu_approx": 2.1329758167266846,
"eai_general_math": 0.8652804493904114,
"eai_open_web_math": 0.2764485478401184,
"eai_web_code": 0.5683913826942444
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.13",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "-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": "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
|
-7,865,411,445,496,294,000 |
Road systems can be imagined as a graph of intersections connected by lines
Hi Team
I need help with this Write a function that takes as arguments:
A string representing JSON graph of the road system
The starting intersection (node)
The ending intersection (node)
And returns a dictionary containing information about the shortest path.
The return value should be a dictionary with keys distance and path.
distance should be the number that is the total sum of the distance metadata on each edge used.
// Test cases that checks this to make sure they all passes.
roads = """
{
"directed": false,
"nodes": [
{ "id": 0 },
{ "id": 1 },
{ "id": 2 },
{ "id": 3 },
{ "id": 4 },
{ "id": 5 },
{ "id": 6 },
{ "id": 7 },
{ "id": 8 },
{ "id": 9 }
],
"edges": [
{
"source": 1,
"target": 6,
"label": "Oak Street",
"metadata": {
"distance": 5
}
},
{
"source": 6,
"target": 8,
"label": "Oak Street",
"metadata": {
"distance": 6
}
},
{
"source": 8,
"target": 9,
"label": "Oak Street",
"metadata": {
"distance": 11
}
},
{
"source": 8,
"target": 7,
"label": "Robin Way",
"metadata": {
"distance": 3
}
},
{
"source": 7,
"target": 4,
"label": "Robin Way",
"metadata": {
"distance": 5
}
},
{
"source": 6,
"target": 7,
"label": "Mountain Road",
"metadata": {
"distance": 8
}
},
{
"source": 7,
"target": 9,
"label": "Mountain Road",
"metadata": {
"distance": 9
}
},
{
"source": 4,
"target": 3,
"label": "National Street",
"metadata": {
"distance": 6
}
},
{
"source": 1,
"target": 0,
"label": "Sunrise Drive",
"metadata": {
"distance": 4
}
},
{
"source": 0,
"target": 3,
"label": "Short Street",
"metadata": {
"distance": 3
}
},
{
"source": 5,
"target": 4,
"label": "Rickety Creek",
"metadata": {
"distance": 7
}
},
{
"source": 4,
"target": 0,
"label": "Rickety Creek",
"metadata": {
"distance": 5
}
},
{
"source": 9,
"target": 5,
"label": "Uphill Grove",
"metadata": {
"distance": 6
}
},
{
"source": 5,
"target": 2,
"label": "Uphill Grove",
"metadata": {
"distance": 5
}
},
{
"source": 2,
"target": 3,
"label": "Uphill Grove",
"metadata": {
"distance": 7
}
}
]
}
"""
Test.assert_equals(navigate(roads, 1, 5), {'distance': 16, 'path': [ 1, 0, 4, 5 ]})
Test.assert_equals(navigate(roads, 6, 2), {'distance': 19, 'path': [ 6, 1, 0, 3, 2 ]})
Test.assert_equals(navigate(roads, 3, 4), {'distance': 6, 'path': [ 3, 4 ]})
// Logic to achieve this but i get an error while compiling it.
import json
from collections import deque
from typing import Dict, List, Tuple, Union
def parse_roads(roads) -> Dict[int, List[Tuple[int, Dict[str, float]]]]:
graph = {}
if isinstance(roads, str):
roads = json.loads(roads)
for road in roads:
if isinstance(road, tuple):
src, dest, distance = road
elif isinstance(road, dict):
src, dest, distance = road["src"], road["dest"], road["distance"]
else:
raise ValueError("Invalid input format")
metadata = {"distance": distance}
if src not in graph:
graph[src] = []
if dest not in graph:
graph[dest] = []
graph[src].append((dest, metadata))
graph[dest].append((src, metadata))
return graph
def navigate(roads: str, start: int, end: int) -> Dict[str, Union[int, List[int]]]:
graph = parse_roads(roads)
if start not in graph or end not in graph:
return {"error": "Starting or ending node not found in graph"}
distances = {node: float("inf") for node in graph}
previous_nodes = {node: None for node in graph}
distances[start] = 0
unvisited_nodes = set(graph)
while unvisited_nodes:
current_node = min(
unvisited_nodes, key=lambda node: distances[node]
)
unvisited_nodes.remove(current_node)
if distances[current_node] == float("inf"):
break
for neighbor, metadata in graph[current_node]:
alternative_route = distances[current_node] + metadata["distance"]
if alternative_route < distances[neighbor]:
distances[neighbor] = alternative_route
previous_nodes[neighbor] = current_node
path, current_node = [], end
while previous_nodes[current_node] is not None:
path.append(current_node)
current_node = previous_nodes[current_node]
if path:
path.append(start)
return {"distance": distances[end], "path": list(reversed(path))}
// Error while compiling
ERROR: Traceback:
in <module>
in navigate
in parse_roads
ValueError: Invalid input format
It’s not an error while compiling, it’s an error while running.
I suspect that it’s due to isinstance(road, tuple). JSON doesn’t have tuples, it has lists.
|
{
"url": "https://discuss.python.org/t/road-systems-can-be-imagined-as-a-graph-of-intersections-connected-by-lines/25186",
"source_domain": "discuss.python.org",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "24399",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6AR24OVCZSYS22OPVYLCVFPMTLP2BTRG",
"WARC-Concurrent-To": "<urn:uuid:aae2b72a-fb0a-4285-95ed-96a2a06de415>",
"WARC-Date": "2023-10-02T11:07:23Z",
"WARC-IP-Address": "184.105.99.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YUSEFOTYURDVL7Z5NHGI3WNBJ5BGEI4R",
"WARC-Record-ID": "<urn:uuid:0153603c-5302-4da7-929b-93030f5d0fe6>",
"WARC-Target-URI": "https://discuss.python.org/t/road-systems-can-be-imagined-as-a-graph-of-intersections-connected-by-lines/25186",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b519ddfe-2bb6-4907-b0f6-03c25edf71d2>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-48\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
76,
77,
85,
86,
150,
151,
203,
236,
267,
340,
341,
410,
411,
507,
508,
569,
570,
582,
584,
605,
618,
635,
652,
669,
686,
703,
720,
737,
754,
771,
787,
792,
805,
811,
830,
849,
878,
898,
920,
928,
935,
941,
960,
979,
1008,
1028,
1050,
1058,
1065,
1071,
1090,
1109,
1138,
1158,
1181,
1189,
1196,
1202,
1221,
1240,
1268,
1288,
1310,
1318,
1325,
1331,
1350,
1369,
1397,
1417,
1439,
1447,
1454,
1460,
1479,
1498,
1530,
1550,
1572,
1580,
1587,
1593,
1612,
1631,
1663,
1683,
1705,
1713,
1720,
1726,
1745,
1764,
1798,
1818,
1840,
1848,
1855,
1861,
1880,
1899,
1931,
1951,
1973,
1981,
1988,
1994,
2013,
2032,
2063,
2083,
2105,
2113,
2120,
2126,
2145,
2164,
2196,
2216,
2238,
2246,
2253,
2259,
2278,
2297,
2329,
2349,
2371,
2379,
2386,
2392,
2411,
2430,
2461,
2481,
2503,
2511,
2518,
2524,
2543,
2562,
2593,
2613,
2635,
2643,
2650,
2656,
2675,
2694,
2725,
2745,
2767,
2775,
2781,
2785,
2787,
2791,
2792,
2876,
2963,
3040,
3041,
3105,
3106,
3118,
3148,
3192,
3193,
3194,
3267,
3282,
3313,
3347,
3370,
3406,
3445,
3482,
3560,
3574,
3627,
3669,
3698,
3726,
3756,
3785,
3829,
3873,
3878,
3895,
3896,
3980,
4011,
4015,
4062,
4133,
4134,
4189,
4241,
4266,
4267,
4300,
4301,
4328,
4356,
4418,
4428,
4473,
4474,
4526,
4544,
4545,
4600,
4679,
4735,
4791,
4847,
4848,
4881,
4933,
4967,
5019,
5032,
5059,
5060,
5130,
5133,
5158,
5176,
5191,
5206,
5224,
5257,
5258,
5322,
5323
],
"line_end_idx": [
76,
77,
85,
86,
150,
151,
203,
236,
267,
340,
341,
410,
411,
507,
508,
569,
570,
582,
584,
605,
618,
635,
652,
669,
686,
703,
720,
737,
754,
771,
787,
792,
805,
811,
830,
849,
878,
898,
920,
928,
935,
941,
960,
979,
1008,
1028,
1050,
1058,
1065,
1071,
1090,
1109,
1138,
1158,
1181,
1189,
1196,
1202,
1221,
1240,
1268,
1288,
1310,
1318,
1325,
1331,
1350,
1369,
1397,
1417,
1439,
1447,
1454,
1460,
1479,
1498,
1530,
1550,
1572,
1580,
1587,
1593,
1612,
1631,
1663,
1683,
1705,
1713,
1720,
1726,
1745,
1764,
1798,
1818,
1840,
1848,
1855,
1861,
1880,
1899,
1931,
1951,
1973,
1981,
1988,
1994,
2013,
2032,
2063,
2083,
2105,
2113,
2120,
2126,
2145,
2164,
2196,
2216,
2238,
2246,
2253,
2259,
2278,
2297,
2329,
2349,
2371,
2379,
2386,
2392,
2411,
2430,
2461,
2481,
2503,
2511,
2518,
2524,
2543,
2562,
2593,
2613,
2635,
2643,
2650,
2656,
2675,
2694,
2725,
2745,
2767,
2775,
2781,
2785,
2787,
2791,
2792,
2876,
2963,
3040,
3041,
3105,
3106,
3118,
3148,
3192,
3193,
3194,
3267,
3282,
3313,
3347,
3370,
3406,
3445,
3482,
3560,
3574,
3627,
3669,
3698,
3726,
3756,
3785,
3829,
3873,
3878,
3895,
3896,
3980,
4011,
4015,
4062,
4133,
4134,
4189,
4241,
4266,
4267,
4300,
4301,
4328,
4356,
4418,
4428,
4473,
4474,
4526,
4544,
4545,
4600,
4679,
4735,
4791,
4847,
4848,
4881,
4933,
4967,
5019,
5032,
5059,
5060,
5130,
5133,
5158,
5176,
5191,
5206,
5224,
5257,
5258,
5322,
5323,
5414
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5414,
"ccnet_original_nlines": 234,
"rps_doc_curly_bracket": 0.018470630049705505,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09098786860704422,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005199309904128313,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5589255094528198,
"rps_doc_frac_unique_words": 0.3769230842590332,
"rps_doc_mean_word_length": 5.465384483337402,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.786403179168701,
"rps_doc_word_count": 520,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1548205465078354,
"rps_doc_frac_chars_dupe_6grams": 0.02111189067363739,
"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.09007740765810013,
"rps_doc_frac_chars_top_3gram": 0.038705140352249146,
"rps_doc_frac_chars_top_4gram": 0.03237156942486763,
"rps_doc_books_importance": -391.8143615722656,
"rps_doc_books_importance_length_correction": -391.8143615722656,
"rps_doc_openwebtext_importance": -225.6062774658203,
"rps_doc_openwebtext_importance_length_correction": -225.6062774658203,
"rps_doc_wikipedia_importance": -157.177490234375,
"rps_doc_wikipedia_importance_length_correction": -157.177490234375
},
"fasttext": {
"dclm": 0.9984993934631348,
"english": 0.5547076463699341,
"fineweb_edu_approx": 2.5215115547180176,
"eai_general_math": 0.7948450446128845,
"eai_open_web_math": 0.13709354400634766,
"eai_web_code": 0.7581426501274109
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "511.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,306,025,071,827,943,000 |
Our website uses cookies to enhance your browsing experience.
Accept
to the top
close form
Fill out the form in 2 simple steps below:
Your contact information:
Step 1
Congratulations! This is your promo code!
Desired license type:
Step 2
Team license
Enterprise license
** By clicking this button you agree to our Privacy Policy statement
close form
Request our prices
New License
License Renewal
--Select currency--
USD
EUR
* By clicking this button you agree to our Privacy Policy statement
close form
Free PVS‑Studio license for Microsoft MVP specialists
* By clicking this button you agree to our Privacy Policy statement
close form
To get the licence for your open-source project, please fill out this form
* By clicking this button you agree to our Privacy Policy statement
close form
I am interested to try it on the platforms:
* By clicking this button you agree to our Privacy Policy statement
close form
check circle
Message submitted.
Your message has been sent. We will email you at
If you haven't received our response, please do the following:
check your Spam/Junk folder and click the "Not Spam" button for our message.
This way, you won't miss messages from our team in the future.
>
>
>
ChakraCore: analysis of JavaScript-engi…
ChakraCore: analysis of JavaScript-engine for Microsoft Edge
Jan 22 2016
On the JSConf US conference in December 2015 the developers announced that they were planning to make open the source code of Chakra key components, a JavaScript-engine, operating in Microsoft Edge. Recently the ChackraCore source code became available under the MIT license in the corresponding repository on GitHub. In this article you will find interesting code fragments that were detected with the help of PVS-Studio code analyzer.
0370_ChakraCore/image1.png
Introduction
ChakraCore is the core part of Chakra, the high-performance JavaScript engine that powers Microsoft Edge and Windows applications written in HTML/CSS/JS. ChakraCore supports Just-in-time (JIT) compilation of JavaScript for x86/x64/ARM, garbage collection, and a wide range of the latest JavaScript features.
PVS-Studio is a static analyzer for bug detection in the source code of programs, written in C, C++ and C#. PVS-Studio tool is designed for developers of contemporary applications and integrates into the Visual Studio environments of 2010-2015.
In an article on an open source project check, we report only about a limited number of all of the warnings issued by the analyzer, therefore we recommend the authors of the project to run the analyzer on their code themselves and study complete analysis results. We also provide developers of open source projects with a temporary key.
Various errors
0370_ChakraCore/image2.png
V501 There are identical sub-expressions 'this->propId == Js::PropertyIds::_superReferenceSymbol' to the left and to the right of the '||' operator. diagobjectmodel.cpp 123
IDiagObjectModelDisplay * ResolvedObject::CreateDisplay()
{
....
if (this->isConst ||
this->propId == Js::PropertyIds::_superReferenceSymbol ||
this->propId == Js::PropertyIds::_superReferenceSymbol)
{
pOMDisplay->SetDefaultTypeAttribute(....);
}
....
}
There two similar checks in the condition. Probably, while writing the code, a programmer accidentally chose the same constant in the IntelliSense menu, for instance, instead of "Js::PropertyIds:: _superCtorReferenceSymbol".
V501 There are identical sub-expressions 'GetVarSymID(srcIndexOpnd->GetStackSym())' to the left and to the right of the '==' operator. globopt.cpp 20795
void GlobOpt::EmitMemop(....)
{
....
IR::RegOpnd *srcBaseOpnd = nullptr;
IR::RegOpnd *srcIndexOpnd = nullptr;
IRType srcType;
GetMemOpSrcInfo(...., srcBaseOpnd, srcIndexOpnd, srcType);
Assert(GetVarSymID(srcIndexOpnd->GetStackSym()) == // <=
GetVarSymID(srcIndexOpnd->GetStackSym())); // <=
....
}
Two more identical comparisons. Most likely "srcIndexOpnd->GetStackSym()" was meant to be compared with "srcBaseOpnd ->GetStackSym()" .
V517 The use of 'if (A) {...} else if (A) {...}' pattern was detected. There is a probability of logical error presence. Check lines: 3220, 3231. lower.cpp 3220
bool Lowerer::GenerateFastBrSrEq(....,
IR::RegOpnd * srcReg1,
IR::RegOpnd * srcReg2,
....)
{
if (srcReg2 && IsConstRegOpnd(srcReg2))
{
....
}
else if (srcReg1 && IsConstRegOpnd(srcReg1))
{
....
}
else if (srcReg2 && (srcReg2->m_sym->m_isStrConst))
{
....
}
else if (srcReg1 && (srcReg1->m_sym->m_isStrConst)) // <=
{
....
}
else if (srcReg2 && (srcReg2->m_sym->m_isStrEmpty))
{
....
}
else if (srcReg1 && (srcReg1->m_sym->m_isStrConst)) // <=
{
....
}
return false;
}
The analyzer detected two similar checks in the cascade of conditional operators; as a result a code block in the last condition never gets control. Full code of the given example is very long and it's hard to notice a misprint. It is a good example, showing benefits from using a static code analyzer during the work with similar code, when the programmer gets quickly tired and lets his guard down.
Most likely, last two conditions were meant to be like this:
....
else if (srcReg2 && (srcReg2->m_sym->m_isStrEmpty))
{
....
}
else if (srcReg1 && (srcReg1->m_sym-> m_isStrEmpty)) // <=
{
....
}
V713 The pointer scriptContext was utilized in the logical expression before it was verified against nullptr in the same logical expression. diaghelpermethodwrapper.cpp 214
template <bool doCheckParentInterpreterFrame>
void HandleHelperOrLibraryMethodWrapperException(....)
{
....
if (!exceptionObject->IsDebuggerSkip() ||
exceptionObject == scriptContext->GetThreadContext()->.... ||
exceptionObject == scriptContext->GetThreadContext()->.... ||
!scriptContext) // <=
{
throw exceptionObject->CloneIfStaticExceptionObject(....);
}
....
}
Dereference of "scriptContext" pointer is done before its validity is checked. It was luck that such a bug wasn't noticed and didn't affect the program. Such bugs can live in the code for a very long time and show up in rare atypical situations.
V570 The 'this->isInlined' variable is assigned to itself. functioncodegenjittimedata.h 625
void SetupRecursiveInlineeChain(
Recycler *const recycler,
const ProfileId profiledCallSiteId)
{
if (!inlinees)
{
inlinees = RecyclerNewArrayZ(....);
}
inlinees[profiledCallSiteId] = this;
inlineeCount++;
this->isInlined = isInlined; // <=
}
It's very suspicious that the same value is stored in the 'isInlined' boolean variable. Most likely the programmer intended to write something else.
Here is one more fragment, where the variable is assigned to itself:
• V570 The 'sym->m_isTaggableIntConst' variable is assigned to itself. linearscan.cpp 3170
V590 Consider inspecting the 'sub[i] != '-' && sub[i] == '/'' expression. The expression is excessive or contains a misprint. rl.cpp 1388
const char *
stristr
(
const char * str,
const char * sub
)
{
....
for (i = 0; i < len; i++)
{
if (tolower(str[i]) != tolower(sub[i]))
{
if ((str[i] != '/' && str[i] != '-') ||
(sub[i] != '-' && sub[i] == '/')) { / <=
// if the mismatch is not between '/' and '-'
break;
}
}
}
....
}
The analyzer detected, that a part of the (sub[i] != '-') conditional expression doesn't influence the check result. To make sure, let's have a look at the truth table. Most likely there is a misprint here; it's hard to say how to write this code correctly.
0370_ChakraCore/image3.png
V603 The object was created but it is not being used. If you wish to call constructor, 'this->StringCopyInfo::StringCopyInfo(....)' should be used. stringcopyinfo.cpp 64
void StringCopyInfo::InstantiateForceInlinedMembers()
{
AnalysisAssert(false);
StringCopyInfo copyInfo;
JavascriptString *const string = nullptr;
wchar_t *const buffer = nullptr;
(StringCopyInfo()); // <=
(StringCopyInfo(string, buffer)); // <=
copyInfo.SourceString();
copyInfo.DestinationBuffer();
}
Programmers often make mistakes, trying to explicitly call the constructor to initialize the object. In this example we see new unnamed objects of "StringCopyInfo" type that get created and then immediately destroyed. As a result, the class fields are left uninitialized.
The correct solution would be to create an initialization function and call it from the constructors in this fragment as well.
V610 Undefined behavior. Check the shift operator '<<'. The left operand '-1' is negative. constants.h 39
class Constants
{
public:
....
static const int Int31MinValue = -1 << 30;
....
};
According to the latest standard of the C++ language, a shift of a negative number results in undefined behavior.
V557 Array overrun is possible. The value of 'i' index could reach 8. rl.cpp 2375
enum TestInfoKind::_TIK_COUNT = 9
const char * const TestInfoEnvLstFmt[] =
{
" TESTFILE=\"%s\"",
" BASELINE=\"%s\"",
" CFLAGS=\"%s\"",
" LFLAGS=\"%s\"",
NULL,
NULL,
NULL,
NULL // <= TestInfoEnvLstFmt[7]
};
void
WriteEnvLst
(
Test * pDir, TestList * pTestList
)
{
....
// print the other TIK_*
for(int i=0;i < _TIK_COUNT; i++) {
if (variants->testInfo.data[i] && TestInfoEnvLstFmt[i]){// <=
LstFilesOut->Add(TestInfoEnvLstFmt[i], // <=
variants->testInfo.data[i]);
}
....
}
....
}
The analyzer detected that array index is out of bounds. The things is that the for() loop performs 9 iterations, but there are only 8 elements in the "TestInfoEnvLstFmt[]" array.
Perhaps, one more NULL was forgotten in the end:
const char * const TestInfoEnvLstFmt[] =
{
" TESTFILE=\"%s\"",
" BASELINE=\"%s\"",
" CFLAGS=\"%s\"",
" LFLAGS=\"%s\"",
NULL,
NULL,
NULL,
NULL // <= TestInfoEnvLstFmt[7]
NULL // <= TestInfoEnvLstFmt[8]
};
But there is a chance that some string is missing in the middle of the array!
Dangerous pointers
0370_ChakraCore/image4.png
V595 diagnostic looks for such code fragments where the pointer is dereferenced before it is compared with null. Usually in the projects there are several of such warnings. Such an error holds the record in out error base according to the number of issues found (see examples). But in general V595 diagnostics are too boring to give a lot of examples from a project. Also the check and dereference of a pointer can be located quite far away from each other in the function, having dozens or even hundreds of strings between them; that makes the explanation of this bug more complicated in the scope of an article.
That's why I'll provide several short examples of the code that most probably contain an error related to the pointer handling.
V595 The 'instrLd' pointer was utilized before it was verified against nullptr. Check lines: 1823, 1831. flowgraph.cpp 1823
IR::Instr *
FlowGraph::PeepTypedCm(IR::Instr *instr)
{
....
if (instrLd && !instrLd->GetSrc1()->IsEqual(instr->GetDst()))
{
return nullptr;
}
if(instrLd2 && !instrLd2->GetSrc1()->IsEqual(instrLd->GetDst()))
{
return nullptr;
}
....
}
Have a look at the pointer with the name "instrLd". In the first case we see that it is dereferenced and compared with null, in the second case a programmer forgot to do so, that's why it can cause null pointer dereference.
V595 The 'src2Val' pointer was utilized before it was verified against nullptr. Check lines: 9717, 9725. globopt.cpp 9717
bool GlobOpt::TypeSpecializeIntBinary(....)
{
....
bool isIntConstMissingItem = src2Val->GetValueInfo()->....
if(isIntConstMissingItem)
{
isIntConstMissingItem = Js::SparseArraySegment<int>::....
}
if (!src2Val || !(src2Val->GetValueInfo()->IsLikelyInt()) ||
isIntConstMissingItem)
{
return false;
}
....
}
Pointer "Src2Val" is used at the beginning of the function, but then the developers actively began checking whether this pointer is equal to zero.
V595 The 'm_lastInstr' pointer was utilized before it was verified against nullptr. Check lines: 214, 228. irbuilderasmjs.cpp 214
void
IRBuilderAsmJs::AddInstr(IR::Instr * instr, uint32 offset)
{
m_lastInstr->InsertAfter(instr); // <=
if (offset != Js::Constants::NoByteCodeOffset)
{
....
}
else if (m_lastInstr) // <=
{
instr->SetByteCodeOffset(m_lastInstr->GetByteCodeOffset());
}
m_lastInstr = instr;
....
}
One more example of careless use of a pointer that can potentially be a null pointer.
A list of similar fragments:
• V595 The 'arrayData' pointer was utilized before it was verified against nullptr. Check lines: 868, 870. immutablelist.h 868
• V595 The 'pMembersList' pointer was utilized before it was verified against nullptr. Check lines: 2012, 2015. diagobjectmodel.cpp 2012
• V595 The 'walkerRef' pointer was utilized before it was verified against nullptr. Check lines: 3191, 3193. diagobjectmodel.cpp 3191
• V595 The 'block->loop' pointer was utilized before it was verified against nullptr. Check lines: 981, 1002. globopt.cpp 981
• V595 The 'src2Val' pointer was utilized before it was verified against nullptr. Check lines: 12528, 12536. globopt.cpp 12528
• V595 The 'symDst' pointer was utilized before it was verified against nullptr. Check lines: 1966, 1967. irbuilderasmjs.cpp 1966
• V595 The 'symDst' pointer was utilized before it was verified against nullptr. Check lines: 2010, 2011. irbuilderasmjs.cpp 2010
• V595 The 'symDst' pointer was utilized before it was verified against nullptr. Check lines: 2076, 2077. irbuilderasmjs.cpp 2076
• V595 The 'symDst' pointer was utilized before it was verified against nullptr. Check lines: 3591, 3592. irbuilderasmjs.cpp 3591
• V595 The 'symDst' pointer was utilized before it was verified against nullptr. Check lines: 4113, 4114. irbuilderasmjs.cpp 4113
• V595 The 'symDst' pointer was utilized before it was verified against nullptr. Check lines: 4510, 4511. irbuilderasmjs.cpp 4510
• V595 The 'm_lastInstr' pointer was utilized before it was verified against nullptr. Check lines: 1102, 1116. irbuilder.cpp 1102
This list shows some simplest and clearest examples. To examine all fragments like that, developers should have a look at the analysis result themselves.
V522 Dereferencing of the null pointer 'tempNumberTracker' might take place. backwardpass.cpp 578
void
BackwardPass::MergeSuccBlocksInfo(BasicBlock * block)
{
TempNumberTracker * tempNumberTracker = nullptr; // <= line 346
....
if (!block->isDead)
{
....
if(!IsCollectionPass())
{
....
if (this->DoMarkTempNumbers())
{
tempNumberTracker = JitAnew(....); // <= line 413
}
....
....
if (blockSucc->tempNumberTracker != nullptr)
{
....
tempNumberTracker->MergeData(....); // <= line 578
if (deleteData)
{
blockSucc->tempNumberTracker = nullptr;
}
}
....
}
Example of another diagnostic which is also connected with the pointers. Here is a code fragment of the MergeSuccBlocksInfo() function, which is quite long - 707 strings. But with the help of static analysis we managed to find "tempNumberTracker" pointer, whose initialization can potentially fail due to several conditions. As a result, if the odds are against the programmer, there will be dereference of a null pointer.
Stop! Check Assert!
0370_ChakraCore/image5.png
Assert, located in the program indicates that a programmer assumes that some expression is true for a correctly running program. But can these "successful checks be trusted"?
V547 Expression 'srcIndex - src->left >= 0' is always true. Unsigned type value is always >= 0. sparsearraysegment.inl 355
class SparseArraySegmentBase
{
public:
static const uint32 MaxLength;
....
uint32 size;
....
}
template<typename T>
SparseArraySegment<T>* SparseArraySegment<T>::CopySegment(....,
uint32 srcIndex, ....)
{
....
AssertMsg(srcIndex - src->left >= 0, // <=
"src->left > srcIndex resulting in \
negative indexing of src->elements");
js_memcpy_s(dst->elements + dstIndex - dst->left,
sizeof(T) * inputLen,
src->elements + srcIndex - src->left,
sizeof(T) * inputLen);
return dst;
}
Note the comparison "srcIndex-src-> left > = 0". Difference of two unsigned numbers will always be greater than or equal to zero. Further on this function is used for working with the memory. The result can be different from the one that the programmer expected.
V547 Expression is always true. Probably the '&&' operator should be used here. bytecodegenerator.cpp 805
void ByteCodeGenerator::AssignRegister(Symbol *sym)
{
AssertMsg(sym->GetDecl() == nullptr ||
sym->GetDecl()->nop != knopConstDecl || // <=
sym->GetDecl()->nop != knopLetDecl, "...."); // <=
if (sym->GetLocation() == Js::Constants::NoRegister)
{
sym->SetLocation(NextVarRegister());
}
}
In this Assert testing of some values is done only partially. If the expression "sym->GetDecl() == nullptr" is false, then the following conditions are always true. You can check it by building a truth table.
0370_ChakraCore/image6.png
V547 Expression 'callSiteId >= 0' is always true. Unsigned type value is always >= 0. inline.cpp 1181
typedef uint16 ProfileId;
Func * Inline::BuildInlinee(Js::FunctionBody* funcBody, ....)
{
....
Js::ProfileId callSiteId = static_cast<Js::ProfileId>(....);
Assert(callSiteId >= 0);
....
}
In this and couple of other fragments the analyzer detected incorrect comparison of an unsigned number with null:
• V547 Expression 'callSiteId >= 0' is always true. Unsigned type value is always >= 0. inline.cpp 2627
• V547 Expression 'callSiteId >= 0' is always true. Unsigned type value is always >= 0. inline.cpp 3657
Conclusion
Microsoft has a positive tendency to release their projects under free licenses. For us it is an additional opportunity to test the analyzer on new projects and also a way to demonstrate usefulness and effectiveness of static code analysis on the projects of such a large and well known software vendor.
You may be interested to see the full list of all scanned projects that includes other projects from Microsoft, such as .NET CoreCLR, CoreFX .NET and Microsoft Code Contracts.
Comments (0)
Next comments next comments
close comment form
|
{
"url": "https://pvs-studio.com/en/blog/posts/cpp/0370/",
"source_domain": "pvs-studio.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "217422",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UIQGLSACERKL7O4OHB3RXQHLTIILZTBB",
"WARC-Concurrent-To": "<urn:uuid:554b6c32-9192-4fa8-80c3-8bfd5e5464fa>",
"WARC-Date": "2024-04-23T01:20:22Z",
"WARC-IP-Address": "173.233.145.68",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3T7FF7GTGI5RQWZM5DKUPZOFGQDYJNNX",
"WARC-Record-ID": "<urn:uuid:7b53b23d-f118-4e17-bc8f-f03861e0784f>",
"WARC-Target-URI": "https://pvs-studio.com/en/blog/posts/cpp/0370/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9315dfe1-3b0d-4aa9-b409-98c18bdf3f96>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-191\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,
62,
69,
80,
91,
92,
135,
136,
162,
163,
170,
212,
213,
235,
236,
243,
256,
275,
344,
355,
374,
386,
402,
422,
426,
430,
498,
499,
510,
564,
632,
633,
644,
719,
787,
788,
799,
843,
911,
912,
923,
936,
955,
956,
1005,
1006,
1007,
1070,
1147,
1210,
1211,
1213,
1215,
1217,
1258,
1259,
1320,
1321,
1333,
1334,
1771,
1772,
1799,
1800,
1813,
1814,
2122,
2123,
2368,
2369,
2706,
2707,
2722,
2723,
2750,
2751,
2924,
2925,
2983,
2985,
2991,
3014,
3076,
3136,
3140,
3189,
3193,
3200,
3202,
3203,
3428,
3429,
3582,
3583,
3613,
3615,
3622,
3660,
3699,
3717,
3778,
3844,
3910,
3917,
3919,
3920,
4056,
4057,
4218,
4219,
4258,
4314,
4370,
4409,
4411,
4453,
4457,
4466,
4470,
4517,
4521,
4530,
4534,
4588,
4592,
4601,
4605,
4671,
4675,
4684,
4688,
4742,
4746,
4755,
4759,
4825,
4829,
4838,
4842,
4843,
4859,
4861,
4862,
5263,
5264,
5325,
5326,
5331,
5383,
5385,
5392,
5394,
5459,
5461,
5468,
5470,
5471,
5644,
5645,
5691,
5746,
5748,
5755,
5799,
5865,
5931,
5960,
5964,
6027,
6031,
6038,
6040,
6041,
6287,
6288,
6380,
6381,
6414,
6444,
6484,
6486,
6503,
6507,
6547,
6551,
6590,
6608,
6647,
6649,
6650,
6799,
6800,
6869,
6870,
6963,
6964,
7102,
7103,
7116,
7124,
7126,
7146,
7165,
7167,
7169,
7176,
7204,
7208,
7252,
7258,
7304,
7370,
7427,
7445,
7453,
7459,
7463,
7470,
7472,
7473,
7731,
7732,
7759,
7760,
7930,
7931,
7985,
7987,
8014,
8015,
8044,
8090,
8127,
8128,
8178,
8228,
8257,
8291,
8293,
8294,
8566,
8567,
8694,
8695,
8801,
8802,
8818,
8820,
8828,
8835,
8880,
8887,
8890,
8891,
9005,
9006,
9088,
9089,
9123,
9124,
9165,
9167,
9190,
9213,
9234,
9255,
9264,
9273,
9282,
9320,
9323,
9324,
9329,
9341,
9343,
9380,
9382,
9384,
9391,
9418,
9455,
9521,
9587,
9640,
9646,
9655,
9659,
9666,
9668,
9669,
9849,
9850,
9899,
9900,
9941,
9943,
9966,
9989,
10010,
10031,
10040,
10049,
10058,
10096,
10134,
10137,
10138,
10216,
10217,
10236,
10237,
10264,
10265,
10879,
10880,
11008,
11009,
11133,
11134,
11146,
11187,
11189,
11195,
11258,
11261,
11280,
11283,
11285,
11351,
11354,
11373,
11376,
11382,
11384,
11385,
11609,
11610,
11732,
11733,
11777,
11779,
11786,
11847,
11848,
11876,
11880,
11944,
11948,
11949,
12012,
12041,
12045,
12065,
12069,
12076,
12078,
12079,
12226,
12227,
12357,
12358,
12363,
12422,
12424,
12482,
12531,
12535,
12544,
12548,
12606,
12610,
12676,
12680,
12703,
12710,
12712,
12713,
12799,
12800,
12829,
12830,
12959,
13098,
13234,
13362,
13491,
13623,
13755,
13887,
14019,
14151,
14283,
14415,
14416,
14570,
14571,
14669,
14670,
14675,
14729,
14731,
14797,
14804,
14826,
14830,
14841,
14871,
14879,
14894,
14935,
14947,
15013,
15025,
15036,
15043,
15090,
15094,
15105,
15171,
15193,
15201,
15251,
15259,
15263,
15270,
15272,
15273,
15696,
15697,
15717,
15718,
15745,
15746,
15921,
15922,
16045,
16046,
16075,
16077,
16085,
16120,
16129,
16146,
16155,
16157,
16158,
16179,
16243,
16268,
16270,
16277,
16341,
16382,
16425,
16477,
16513,
16565,
16602,
16616,
16618,
16619,
16882,
16883,
16989,
16990,
17042,
17044,
17085,
17148,
17211,
17224,
17279,
17283,
17324,
17328,
17330,
17331,
17540,
17541,
17568,
17569,
17671,
17672,
17698,
17699,
17761,
17763,
17770,
17833,
17860,
17867,
17869,
17870,
17984,
17985,
18091,
18197,
18198,
18209,
18210,
18514,
18515,
18691,
18692,
18693,
18694,
18707,
18708,
18736
],
"line_end_idx": [
62,
69,
80,
91,
92,
135,
136,
162,
163,
170,
212,
213,
235,
236,
243,
256,
275,
344,
355,
374,
386,
402,
422,
426,
430,
498,
499,
510,
564,
632,
633,
644,
719,
787,
788,
799,
843,
911,
912,
923,
936,
955,
956,
1005,
1006,
1007,
1070,
1147,
1210,
1211,
1213,
1215,
1217,
1258,
1259,
1320,
1321,
1333,
1334,
1771,
1772,
1799,
1800,
1813,
1814,
2122,
2123,
2368,
2369,
2706,
2707,
2722,
2723,
2750,
2751,
2924,
2925,
2983,
2985,
2991,
3014,
3076,
3136,
3140,
3189,
3193,
3200,
3202,
3203,
3428,
3429,
3582,
3583,
3613,
3615,
3622,
3660,
3699,
3717,
3778,
3844,
3910,
3917,
3919,
3920,
4056,
4057,
4218,
4219,
4258,
4314,
4370,
4409,
4411,
4453,
4457,
4466,
4470,
4517,
4521,
4530,
4534,
4588,
4592,
4601,
4605,
4671,
4675,
4684,
4688,
4742,
4746,
4755,
4759,
4825,
4829,
4838,
4842,
4843,
4859,
4861,
4862,
5263,
5264,
5325,
5326,
5331,
5383,
5385,
5392,
5394,
5459,
5461,
5468,
5470,
5471,
5644,
5645,
5691,
5746,
5748,
5755,
5799,
5865,
5931,
5960,
5964,
6027,
6031,
6038,
6040,
6041,
6287,
6288,
6380,
6381,
6414,
6444,
6484,
6486,
6503,
6507,
6547,
6551,
6590,
6608,
6647,
6649,
6650,
6799,
6800,
6869,
6870,
6963,
6964,
7102,
7103,
7116,
7124,
7126,
7146,
7165,
7167,
7169,
7176,
7204,
7208,
7252,
7258,
7304,
7370,
7427,
7445,
7453,
7459,
7463,
7470,
7472,
7473,
7731,
7732,
7759,
7760,
7930,
7931,
7985,
7987,
8014,
8015,
8044,
8090,
8127,
8128,
8178,
8228,
8257,
8291,
8293,
8294,
8566,
8567,
8694,
8695,
8801,
8802,
8818,
8820,
8828,
8835,
8880,
8887,
8890,
8891,
9005,
9006,
9088,
9089,
9123,
9124,
9165,
9167,
9190,
9213,
9234,
9255,
9264,
9273,
9282,
9320,
9323,
9324,
9329,
9341,
9343,
9380,
9382,
9384,
9391,
9418,
9455,
9521,
9587,
9640,
9646,
9655,
9659,
9666,
9668,
9669,
9849,
9850,
9899,
9900,
9941,
9943,
9966,
9989,
10010,
10031,
10040,
10049,
10058,
10096,
10134,
10137,
10138,
10216,
10217,
10236,
10237,
10264,
10265,
10879,
10880,
11008,
11009,
11133,
11134,
11146,
11187,
11189,
11195,
11258,
11261,
11280,
11283,
11285,
11351,
11354,
11373,
11376,
11382,
11384,
11385,
11609,
11610,
11732,
11733,
11777,
11779,
11786,
11847,
11848,
11876,
11880,
11944,
11948,
11949,
12012,
12041,
12045,
12065,
12069,
12076,
12078,
12079,
12226,
12227,
12357,
12358,
12363,
12422,
12424,
12482,
12531,
12535,
12544,
12548,
12606,
12610,
12676,
12680,
12703,
12710,
12712,
12713,
12799,
12800,
12829,
12830,
12959,
13098,
13234,
13362,
13491,
13623,
13755,
13887,
14019,
14151,
14283,
14415,
14416,
14570,
14571,
14669,
14670,
14675,
14729,
14731,
14797,
14804,
14826,
14830,
14841,
14871,
14879,
14894,
14935,
14947,
15013,
15025,
15036,
15043,
15090,
15094,
15105,
15171,
15193,
15201,
15251,
15259,
15263,
15270,
15272,
15273,
15696,
15697,
15717,
15718,
15745,
15746,
15921,
15922,
16045,
16046,
16075,
16077,
16085,
16120,
16129,
16146,
16155,
16157,
16158,
16179,
16243,
16268,
16270,
16277,
16341,
16382,
16425,
16477,
16513,
16565,
16602,
16616,
16618,
16619,
16882,
16883,
16989,
16990,
17042,
17044,
17085,
17148,
17211,
17224,
17279,
17283,
17324,
17328,
17330,
17331,
17540,
17541,
17568,
17569,
17671,
17672,
17698,
17699,
17761,
17763,
17770,
17833,
17860,
17867,
17869,
17870,
17984,
17985,
18091,
18197,
18198,
18209,
18210,
18514,
18515,
18691,
18692,
18693,
18694,
18707,
18708,
18736,
18754
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 18754,
"ccnet_original_nlines": 508,
"rps_doc_curly_bracket": 0.005118910223245621,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2584841549396515,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025735290721058846,
"rps_doc_frac_lines_end_with_ellipsis": 0.08447936922311783,
"rps_doc_frac_no_alph_words": 0.3373868763446808,
"rps_doc_frac_unique_words": 0.3553047478199005,
"rps_doc_mean_word_length": 6.0049662590026855,
"rps_doc_num_sentences": 243,
"rps_doc_symbol_to_word_ratio": 0.018382349982857704,
"rps_doc_unigram_entropy": 5.850539207458496,
"rps_doc_word_count": 2215,
"rps_doc_frac_chars_dupe_10grams": 0.14299677312374115,
"rps_doc_frac_chars_dupe_5grams": 0.17013758420944214,
"rps_doc_frac_chars_dupe_6grams": 0.15269528329372406,
"rps_doc_frac_chars_dupe_7grams": 0.1502142697572708,
"rps_doc_frac_chars_dupe_8grams": 0.14299677312374115,
"rps_doc_frac_chars_dupe_9grams": 0.14299677312374115,
"rps_doc_frac_chars_top_2gram": 0.007518230006098747,
"rps_doc_frac_chars_top_3gram": 0.013232089579105377,
"rps_doc_frac_chars_top_4gram": 0.022855419665575027,
"rps_doc_books_importance": -1438.5106201171875,
"rps_doc_books_importance_length_correction": -1438.5106201171875,
"rps_doc_openwebtext_importance": -816.822998046875,
"rps_doc_openwebtext_importance_length_correction": -816.822998046875,
"rps_doc_wikipedia_importance": -614.9861450195312,
"rps_doc_wikipedia_importance_length_correction": -614.9861450195312
},
"fasttext": {
"dclm": 0.2510271668434143,
"english": 0.7779192328453064,
"fineweb_edu_approx": 2.2580692768096924,
"eai_general_math": 0.37042975425720215,
"eai_open_web_math": 0.05737096071243286,
"eai_web_code": 0.3857051134109497
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,145,347,857,283,862,000 |
Meta Question
RedPowerLady's avatar
My Fluther Screen is Really Small. Do you have any ideas on how to fix it?
Asked by RedPowerLady (12452 points ) April 26th, 2009
Yesterday when Fluthering I pushed some random button(s) on accident and now my Fluther screen is really small. There is a lot of blue background and a small fluther screen. Any ideas on how to fix this??
Observing members: 0 Composing members: 0
15 Answers
_bob's avatar
Get a bigger monitor.
sandystrachan's avatar
Press ” ctrl + +
OR ” ctrl 0
Or go to view and click zoom this is for firefox
For Internet explorer Press ” ctrl + or page and go to zoom
RedPowerLady's avatar
@sandystrachan That’s it. Thank you so much. Your a genius!! Now how did I make it small so I don’t do that again?? Was it ctrl—??
asmonet's avatar
If you’re hitting control and using your scroll wheel on your mouse that can change it too. :)
sandystrachan's avatar
Control . Don’t press random buttons
RedPowerLady's avatar
@sandystrachan I didn’t mean to press random buttons. As I said, it was an accident.
@asmonet Thanx. I have no idea what it was that caused it to go small. I’ll keep that in mind for sure.
sandystrachan's avatar
@RedPowerLady Even i press random buttons it helps with boredom, and i think everyone has had this happen to them at some stage including me.
YARNLADY's avatar
@RedPowerLady I had a cat walk across my keyboard, and somehow the entire screen turned sideways. It was really funny. It turns out there is a button with a wavy flag on it (no letters or words) that actually causes that. I have no idea why.
RedPowerLady's avatar
@YARNLADY OMG that is too funny. I don’t know what I’d do if that happened. LOL
sandystrachan's avatar
@YARNLADY That is a shortcut key to your start menu !
YARNLADY's avatar
@sandystrachan I seldom use the extraneous keys on the keyboard, anyway. Just the alpha/numeral ones and the mouse. I have no idea what they are for, and it doesn’t seem to matter, since I get everything done I need to get done.
sandystrachan's avatar
@YARNLADY I was just informing you of what that key did and how it wasn’t for turning your screen sideways as you stated . If you mean however that your taskbar was on the side , rather than at the bottom that happened because you clicked and dragged it there .
YARNLADY's avatar
@sandystrachan OK, thanks. I see that it does that, but what happened, while I was in the kitchen about 20 feet away from my laptop, the cat ran across the board, and when I came back, the entire screen was sideways, with the top bar on the right side, the words facing that way, just as if I had turned my entire laptop on it’s side, but it was only the screen. I asked on the question site I used then, and they told me how to get it upright again. It was so long ago, I forgot how.
sandystrachan's avatar
@YARNLADY You would click on your ATI or similar icon ( depending your graphics card ) and select the correct orientation .
allergictoeverything's avatar
a fast way to zoom in and out when youre on firefox is to HOLD ctrl, and just scroll up to zoom in, and scroll down to zoom out =] you probably scrolled down while accidently holding onto ctrl
Answer this question
Login
or
Join
to answer.
Your answer will be saved while you login or join.
Have a question? Ask Fluther!
What do you know more about?
or
Knowledge Networking @ Fluther
|
{
"url": "http://www.fluther.com/42968/my-fluther-screen-is-really-small-do-you-have-any-ideas/",
"source_domain": "www.fluther.com",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "51728",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HYP4DOMOSVECTMG6JVCXCAHWOT6HJJN5",
"WARC-Concurrent-To": "<urn:uuid:ddd0e060-5f03-4a25-8d0d-c01b35fd39f2>",
"WARC-Date": "2014-08-31T07:38:44Z",
"WARC-IP-Address": "50.56.238.75",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:F67OJPKCJJ33XR6K52IFE4JM7NXI5IWJ",
"WARC-Record-ID": "<urn:uuid:9d11e9ae-685e-4163-a468-5080c82e6781>",
"WARC-Target-URI": "http://www.fluther.com/42968/my-fluther-screen-is-really-small-do-you-have-any-ideas/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db3f7164-7520-456d-9da8-b150c9e8cfc5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
14,
15,
37,
38,
113,
114,
169,
170,
375,
376,
418,
419,
430,
431,
445,
446,
468,
469,
492,
493,
510,
522,
571,
572,
632,
633,
655,
656,
787,
788,
805,
806,
901,
902,
925,
926,
963,
964,
986,
987,
1072,
1073,
1177,
1178,
1201,
1202,
1344,
1345,
1363,
1364,
1606,
1607,
1629,
1630,
1710,
1711,
1734,
1735,
1789,
1790,
1808,
1809,
2038,
2039,
2062,
2063,
2325,
2326,
2344,
2345,
2830,
2831,
2854,
2855,
2979,
2980,
3010,
3011,
3204,
3205,
3226,
3227,
3233,
3234,
3237,
3238,
3243,
3244,
3255,
3306,
3307,
3337,
3338,
3367,
3370
],
"line_end_idx": [
14,
15,
37,
38,
113,
114,
169,
170,
375,
376,
418,
419,
430,
431,
445,
446,
468,
469,
492,
493,
510,
522,
571,
572,
632,
633,
655,
656,
787,
788,
805,
806,
901,
902,
925,
926,
963,
964,
986,
987,
1072,
1073,
1177,
1178,
1201,
1202,
1344,
1345,
1363,
1364,
1606,
1607,
1629,
1630,
1710,
1711,
1734,
1735,
1789,
1790,
1808,
1809,
2038,
2039,
2062,
2063,
2325,
2326,
2344,
2345,
2830,
2831,
2854,
2855,
2979,
2980,
3010,
3011,
3204,
3205,
3226,
3227,
3233,
3234,
3237,
3238,
3243,
3244,
3255,
3306,
3307,
3337,
3338,
3367,
3370,
3400
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3400,
"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.43489933013916016,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.048322148621082306,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17181208729743958,
"rps_doc_frac_unique_words": 0.41806021332740784,
"rps_doc_mean_word_length": 4.3963212966918945,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.038358211517334,
"rps_doc_word_count": 598,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.046405479311943054,
"rps_doc_frac_chars_dupe_6grams": 0.03499428927898407,
"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.04564473032951355,
"rps_doc_frac_chars_top_3gram": 0.020540129393339157,
"rps_doc_frac_chars_top_4gram": 0.012552299536764622,
"rps_doc_books_importance": -334.4102783203125,
"rps_doc_books_importance_length_correction": -334.4102783203125,
"rps_doc_openwebtext_importance": -177.59808349609375,
"rps_doc_openwebtext_importance_length_correction": -177.59808349609375,
"rps_doc_wikipedia_importance": -196.36380004882812,
"rps_doc_wikipedia_importance_length_correction": -196.36380004882812
},
"fasttext": {
"dclm": 0.11575216054916382,
"english": 0.9336218237876892,
"fineweb_edu_approx": 1.1432682275772095,
"eai_general_math": 0.04594689980149269,
"eai_open_web_math": 0.2128482460975647,
"eai_web_code": 0.001702129957266152
}
}
|
{
"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.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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,225,735,887,079,319,000 |
Adam Pierzchała Adam Pierzchała - 1 year ago 109
Linux Question
Linux: how to get a list of all visible windows
Disclaimer: I know there is a very similar question on this topic.
I am trying to get exactly the same result that NoozNooz42 described here. However mdma answer doesn't fit my needs, because I'm interested in doing the same on linux. Preferrably with gnome, if it matters. So using JNA with user32 library is not a option here (or is it?).
Any suggestions will be great, I couldn't find almost anything on the topic.
P.S.
The only thing I have found is wmctrl command (I could call and parse it in java eventually) that lists windows but doesn't give me any information about the z-order.
Update:
It would be perfect if I could get a notification/callback when the z-order changes.
Answer Source
Use xprop, it shows window properties. List of windows in z-order is in property _NET_CLIENT_LIST_STACKING of the root window:
xprop -root | grep '_NET_CLIENT_LIST_STACKING(WINDOW)'
Output should look like this:
_NET_CLIENT_LIST_STACKING(WINDOW): window id # 0x2000003, 0x4000004,
0x1c00004, 0x1c00030, 0x1c00033, 0x2e00004
Later you can get more info about particular windows with:
xprop -id <id>
or
xwininfo -id <id>
|
{
"url": "https://codedump.io/share/AEgluAh0VTzk/1/linux-how-to-get-a-list-of-all-visible-windows",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "41874",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ACAY4Z22W3N6LQSCUTKWBTKXIYRGP5ZM",
"WARC-Concurrent-To": "<urn:uuid:3b2c11c4-6128-4629-96c5-2da3d885e6bb>",
"WARC-Date": "2017-12-14T03:02:51Z",
"WARC-IP-Address": "50.112.74.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QK7P42LBXZW6EMPYA6LQ37IYBE34IDFP",
"WARC-Record-ID": "<urn:uuid:1983fb26-0da8-4555-b869-647d3df2ae95>",
"WARC-Target-URI": "https://codedump.io/share/AEgluAh0VTzk/1/linux-how-to-get-a-list-of-all-visible-windows",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f528e1b3-0fdd-4aa5-876c-0490264b21d7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-146-47-105.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
49,
64,
65,
113,
114,
181,
182,
456,
457,
534,
535,
540,
707,
708,
716,
801,
802,
816,
817,
944,
945,
1000,
1001,
1031,
1032,
1101,
1144,
1145,
1204,
1205,
1220,
1221,
1224,
1225
],
"line_end_idx": [
49,
64,
65,
113,
114,
181,
182,
456,
457,
534,
535,
540,
707,
708,
716,
801,
802,
816,
817,
944,
945,
1000,
1001,
1031,
1032,
1101,
1144,
1145,
1204,
1205,
1220,
1221,
1224,
1225,
1242
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1242,
"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.37451738119125366,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.057915061712265015,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20849421620368958,
"rps_doc_frac_unique_words": 0.6479591727256775,
"rps_doc_mean_word_length": 4.903061389923096,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.0038610000628978014,
"rps_doc_unigram_entropy": 4.658262729644775,
"rps_doc_word_count": 196,
"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.02913632057607174,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -102.37129974365234,
"rps_doc_books_importance_length_correction": -102.37129974365234,
"rps_doc_openwebtext_importance": -63.86499786376953,
"rps_doc_openwebtext_importance_length_correction": -63.86499786376953,
"rps_doc_wikipedia_importance": -55.39404296875,
"rps_doc_wikipedia_importance_length_correction": -55.39404296875
},
"fasttext": {
"dclm": 0.17433196306228638,
"english": 0.8878752589225769,
"fineweb_edu_approx": 1.430632472038269,
"eai_general_math": 0.8924344778060913,
"eai_open_web_math": 0.2762725353240967,
"eai_web_code": 0.4775969982147217
}
}
|
{
"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": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-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
|
4,984,352,690,264,087,000 |
SOFTELメモ Developer's blog
会社概要 ブログ 調査依頼 社員募集 ...
【JavaScript】配列の要素の合計値を計算する
問題
数字の配列がありまして、合計値を出したいんです。
[1, 2, 3, 4, 5, 6, 7, 8, 9, 10] // → 55
答え
Array.prototype.reduce() を使うと
var data = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
data.reduce(function(a, x){return a + x;});
var data = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
data.reduce(function(a, x){return a + x;}, 0); // 初期値を明示してもよし
配列に数値以外がありうる時の例
var data = [1, 2, 3, 4, undefined, "5", NaN, 6, 7, 8, 9, 10, null];
data.reduce(function(a, x){return a + ((x || 0) - 0);}, 0);
関連するメモ
コメント
|
{
"url": "https://www.softel.co.jp/blogs/tech/archives/6070",
"source_domain": "www.softel.co.jp",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "36216",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HSQHGJYMYD4MTVDHU6LLCPUYKZ2KQ2JE",
"WARC-Concurrent-To": "<urn:uuid:b597335a-d18d-4227-8fc4-de7a2ae3ea49>",
"WARC-Date": "2020-01-22T04:53:21Z",
"WARC-IP-Address": "160.16.209.204",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IKQ6KCSYDSVON7EABH7FGY2KA5NQADJM",
"WARC-Record-ID": "<urn:uuid:35cdad73-0282-4d35-a68d-02079d234f22>",
"WARC-Target-URI": "https://www.softel.co.jp/blogs/tech/archives/6070",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f0e906d0-a571-488a-ab63-03dc5dddb43b>"
},
"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-43.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,
26,
27,
50,
51,
78,
79,
82,
83,
108,
109,
149,
150,
153,
154,
184,
185,
229,
273,
317,
379,
380,
396,
397,
465,
525,
526,
533,
534
],
"line_end_idx": [
26,
27,
50,
51,
78,
79,
82,
83,
108,
109,
149,
150,
153,
154,
184,
185,
229,
273,
317,
379,
380,
396,
397,
465,
525,
526,
533,
534,
538
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 538,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0.011152420192956924,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06842105090618134,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005263159982860088,
"rps_doc_frac_lines_end_with_ellipsis": 0.03448275849223137,
"rps_doc_frac_no_alph_words": 0.7842105031013489,
"rps_doc_frac_unique_words": 0.4642857015132904,
"rps_doc_mean_word_length": 3.904761791229248,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0.005263159982860088,
"rps_doc_unigram_entropy": 3.469245672225952,
"rps_doc_word_count": 84,
"rps_doc_frac_chars_dupe_10grams": 0.3140243887901306,
"rps_doc_frac_chars_dupe_5grams": 0.4573170840740204,
"rps_doc_frac_chars_dupe_6grams": 0.34756097197532654,
"rps_doc_frac_chars_dupe_7grams": 0.3140243887901306,
"rps_doc_frac_chars_dupe_8grams": 0.3140243887901306,
"rps_doc_frac_chars_dupe_9grams": 0.3140243887901306,
"rps_doc_frac_chars_top_2gram": 0.024390239268541336,
"rps_doc_frac_chars_top_3gram": 0.03658536821603775,
"rps_doc_frac_chars_top_4gram": 0.04878048971295357,
"rps_doc_books_importance": -84.23828125,
"rps_doc_books_importance_length_correction": -97.38634490966797,
"rps_doc_openwebtext_importance": -34.44352340698242,
"rps_doc_openwebtext_importance_length_correction": -47.59157943725586,
"rps_doc_wikipedia_importance": -38.62213897705078,
"rps_doc_wikipedia_importance_length_correction": -51.77019500732422
},
"fasttext": {
"dclm": 0.9996016621589661,
"english": 0.04676483944058418,
"fineweb_edu_approx": 1.4042941331863403,
"eai_general_math": 0.704620897769928,
"eai_open_web_math": 0.18949389457702637,
"eai_web_code": 0.31018388271331787
}
}
|
{
"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": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
-7,116,218,112,438,248,000 |
Interview Question: Passing-by-Value
Sample Question #67 (programming – C++)
In C++, what are some of the problems associated with passing an object by value rather than by reference?
Advertisements
This entry was posted in Sample Qs. Bookmark the permalink.
One Response to Interview Question: Passing-by-Value
1. Brett says:
Passing by value involves making a copy of the object being passed. This is inefficient for memory and speed. Memory is a serious issue, because if the object is huge (say an array of millions of elements), you could easily crash the machine.
Passing by value also means you can’t modify the original project itself.
Finally, passing by value won’t work when you have complicated virtual functions.
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
w
Connecting to %s
|
{
"url": "https://quantcareer.wordpress.com/2007/08/09/interview-question-passing-by-value/",
"source_domain": "quantcareer.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "55225",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PH66FNSDRAPIX4LDC33R7ILJSUODNUB7",
"WARC-Concurrent-To": "<urn:uuid:b27fe44d-a4d2-4ebc-9612-b14d78205eb7>",
"WARC-Date": "2018-04-22T10:12:53Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5KVVWAUTFOKFO3AXTJ3SG24BX7MRJSNY",
"WARC-Record-ID": "<urn:uuid:05024395-46be-49b5-8539-e3bc8a46709b>",
"WARC-Target-URI": "https://quantcareer.wordpress.com/2007/08/09/interview-question-passing-by-value/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a4022b52-c9d0-40e8-8878-787bb179d6d4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-166-67.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,
37,
38,
78,
79,
186,
187,
202,
262,
263,
316,
317,
334,
335,
582,
588,
666,
672,
758,
759,
773,
774,
829,
830,
849,
850,
923,
924,
938,
939,
1006,
1007,
1023,
1024,
1091,
1092,
1107,
1108,
1176,
1177,
1179,
1180
],
"line_end_idx": [
37,
38,
78,
79,
186,
187,
202,
262,
263,
316,
317,
334,
335,
582,
588,
666,
672,
758,
759,
773,
774,
829,
830,
849,
850,
923,
924,
938,
939,
1006,
1007,
1023,
1024,
1091,
1092,
1107,
1108,
1176,
1177,
1179,
1180,
1196
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1196,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3504273593425751,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008547009900212288,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20085470378398895,
"rps_doc_frac_unique_words": 0.5769230723381042,
"rps_doc_mean_word_length": 5.010989189147949,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.0042734998278319836,
"rps_doc_unigram_entropy": 4.426580429077148,
"rps_doc_word_count": 182,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12061403691768646,
"rps_doc_frac_chars_dupe_6grams": 0.06578946858644485,
"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.03070175088942051,
"rps_doc_frac_chars_top_3gram": 0.07017543911933899,
"rps_doc_frac_chars_top_4gram": 0.09210526198148727,
"rps_doc_books_importance": -120.00880432128906,
"rps_doc_books_importance_length_correction": -120.00880432128906,
"rps_doc_openwebtext_importance": -63.981536865234375,
"rps_doc_openwebtext_importance_length_correction": -63.97293472290039,
"rps_doc_wikipedia_importance": -48.11311340332031,
"rps_doc_wikipedia_importance_length_correction": -48.11311340332031
},
"fasttext": {
"dclm": 0.1588725447654724,
"english": 0.8600268959999084,
"fineweb_edu_approx": 2.5261073112487793,
"eai_general_math": -0.000010009999641624745,
"eai_open_web_math": 0.043731749057769775,
"eai_web_code": -0.000010009999641624745
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-948,329,669,562,682,600 |
google is terrified of the AGPL and it's hilarious
"The license places restrictions on software used over a network which are extremely difficult for Google to comply with. Using AGPL software requires that anything it links to must also be licensed under the AGPL. Even if you think you aren’t linking to anything important, it still presents a huge risk to Google because of how integrated much of our code is."
opensource.google.com/docs/usi
@lynnesbian they also refuse to use any software licensed under the WTFPLv2, which is why I've started using it as the default license for all my projects
Sign in to participate in the conversation
chaos.social
chaos.social – a Fediverse instance for & by the Chaos community
|
{
"url": "https://chaos.social/@tjg/103973514648401616",
"source_domain": "chaos.social",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "26170",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OW32IVLRPN5SZNQQ3SW4IZOTNQ5EVNZZ",
"WARC-Concurrent-To": "<urn:uuid:72542210-7e7b-4322-afeb-9f558dedb928>",
"WARC-Date": "2020-07-12T23:00:50Z",
"WARC-IP-Address": "116.202.53.178",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LO37BHTMUPJPTST5J7ISANYDME3IAEUJ",
"WARC-Record-ID": "<urn:uuid:892e92c4-0d9e-46e0-a011-cefc2dbe0970>",
"WARC-Target-URI": "https://chaos.social/@tjg/103973514648401616",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:56cd83d7-ead3-4c69-93a0-b185adf0f0a0>"
},
"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-117.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,
415,
416,
447,
448,
603,
604,
647,
660,
661
],
"line_end_idx": [
51,
52,
415,
416,
447,
448,
603,
604,
647,
660,
661,
725
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 725,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4755244851112366,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027972029522061348,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1258741319179535,
"rps_doc_frac_unique_words": 0.6837607026100159,
"rps_doc_mean_word_length": 5.008546829223633,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.210023880004883,
"rps_doc_word_count": 117,
"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.0238907802850008,
"rps_doc_frac_chars_top_3gram": 0.054607510566711426,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -70.20346069335938,
"rps_doc_books_importance_length_correction": -70.22396850585938,
"rps_doc_openwebtext_importance": -41.620811462402344,
"rps_doc_openwebtext_importance_length_correction": -41.64131546020508,
"rps_doc_wikipedia_importance": -23.0257568359375,
"rps_doc_wikipedia_importance_length_correction": -23.0462589263916
},
"fasttext": {
"dclm": 0.04255365952849388,
"english": 0.9416139721870422,
"fineweb_edu_approx": 1.950780987739563,
"eai_general_math": 0.05214608088135719,
"eai_open_web_math": 0.09423602372407913,
"eai_web_code": 0.06429862976074219
}
}
|
{
"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": "344.730285",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Martial law"
}
}
},
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,011,741,070,413,597,000 |
Message Boards Message Boards
0
|
9994 Views
|
10 Replies
|
2 Total Likes
View groups...
Share
Share this post:
How to Import Files That Stored in Different Folder
Posted 10 years ago
I have the profiles for a single set of parameters stored in several different directories,
like the profiles 1-25 in directory A, 26-50 in directory B, and so on. Is it possible to read them all from these directories using Mathematica (without copying to the same directory by hand)
Thanks in advance..
POSTED BY: selahittin cinar
10 Replies
This is it..
Thanks a lot Christopher and thanks the other repliers , you saved my life..
Selahittin..
POSTED BY: selahittin cinar
First suggestion is, break the problem up into small steps. Also, once you have located the files, then Import does not care that they are spread out over many sub-directores. This is how I would approch the example provided by dr.nb.
I am not a big fan of SetDirectory, but it does simplify the example:
SetDirectory[NotebookDirectory[]]
dirs = Select[FileNames["*"], DirectoryQ]
Restrict the pattern for the files you are looking for with "profile_shapes.*". Store the result that you get from FileNames as rawFileNames.
rawFileNames=FileNames["profile_shapes.*", dirs]
Next, use another even more restricted pattern to select the desired file names off the big list. For this example, I set up three ranges that gets the first four files off each sub directlry - knowing the numerical boundry for each. IntegerString will do the work of dealing with the leading zeros as you switch between one and two digit index numbers. Pasting the individual directory names is not necessary.
targetFileNames = Select[rawFileNames, ! StringFreeQ[#,
Join[
Table[IntegerString[i, 10, 4], {i, 1, 4}],
Table[IntegerString[i, 10, 4], {i, 26, 29}],
Table[IntegerString[i, 10, 4], {i, 51, 54}]
]] &]
In case you want to use the header rows later, don't throw it away, get the full table of data first and then separate the data rows of interest in a seperate step.
rawData=Import[#,"Table"]&/@targetFileNames;
headerData=Take[#,2]&/@rawData;
tableData=Drop[#,2]&/@rawData;
Now the selected table data is ready to be shown:
ListLinePlot[tableData, PlotRange->All]
I am stil confused b about what you are actually wanting to do. If you want particular files from each particular directory then you need to form the filepaths for each cirectory separately and selecte from them according to the sting patterns appropriate to each.
So, for example if you want files from directory dirA fo the form ending with .0001 through .0025 you might create those files using something like this (I am sure there are simpler string patterns that achieve this but this will do):
FileNames[{
___ ~~ ".000" ~~ CharacterRange["1", "9"],
___ ~~ ".001" ~~ CharacterRange["0", "9"],
___ ~~ ".002" ~~ CharacterRange["0", "5"]}, {dirA}]
and you would do similar things for the other directories with the appropriate numerical ranges in those.
POSTED BY: David Reiss
ListLinePlot[
Map[Drop[Import[#, "Table"], 2] &,
Table["dirA\\profile_shapes." <>
StringTake["000" <> ToString[i], -4], {i, 1, 4}]],
PlotRange -> All]
I have had some progress but stil I need to copy and paste this part dirA\\profile_shapes by hand.
I want to plot dirA\\profile_shapes, dirB\\profile_shapes and dirC\\profile_shapes on the same plot..
I need something like this, but it is not working for now..
ListLinePlot[
Map[Drop[Import[#, "Table"], 2] &,
Table["FileNames["*", dirs]" <>
StringTake["000" <> ToString[i], -4], {i, 1, 4}]],
PlotRange -> All]
any suggestion, I have attached the code..
Thanks..
Attachments:
POSTED BY: selahittin cinar
Let us say you have 3 directories: dirA, dirB, dirC. Then the list of files in those directories are given by
FileNames[{"*"}, {dirA, dirB,dirC}]
POSTED BY: David Reiss
These are 3 sample folders of my data.. I could not figure it out..
Since I have a bounch of them, I do not want to copy and paste them in one folder by hand..
Attachments:
POSTED BY: selahittin cinar
Sorry Christoper I saw your reply after I sent my post, I will check your answer later, I gotta go now..
Thanks..
Selahittin..
POSTED BY: selahittin cinar
Thanks for your answer.
I know how to import data if data is in a single folder. But my data are in different folder I want to collect all data and graph them (simply they are x and y values in table form).. I don't want to change file path for each folder..
If you need I can upload two samples folder..
I hope I explained clearly.
Selahittin..
POSTED BY: selahittin cinar
If by profiles you are talking about getting data from a file like, Import on a file then you can map import over a list of the files to get only the ones you want. Here are a couple of suggestions for now to collect the file names. In this example, the working NB is sitting on top of the target directories, for simplicity. FileNames looks for a pattern in the list of sub-folders.
In[ ]:= SetDirectory[NotebookDirectory[]];
dirs = Select[FileNames["*"], DirectoryQ]
Out[ ]= {"Dynamic", "Graphics", "Graph_Network", "helperfunctions", "Numeric", "Sound", "SystemModeler", "test", "WolframAlpha"}
In[ ]:= FileNames["*Data*.txt", dirs]
Out[ ]= {"test\\someDatajunk.txt"}
Same result using a "*" pattern to represent all sub-folders
In[ ]:= FileNames["*Data*.txt", {"*"}, 2]
Out[ ]= {"test\\someDatajunk.txt"}
Another example, pairing the expected file name patterns up with the known directory names
In[ ]:= FileNames @@@ {{"*Data*.txt", "test"}, {"*.wav", "Sound"}}
Out[ ]= {{"test\\someDatajunk.txt"}, {"Sound\\arnoud.wav", "Sound\\brettc.wav", "Sound\\cindie.wav", "Sound\\pratik.wav", "Sound\\rachelle.wav"}}
Certainly. One simple way is to use the full file path to the needed files in Import.
POSTED BY: David Reiss
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard
Group Abstract Group Abstract
|
{
"url": "https://community.wolfram.com/groups/-/m/t/252691",
"source_domain": "community.wolfram.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "146354",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FQWRXHTBA3R5QVMHSRE5ETIGQAX5JVCI",
"WARC-Concurrent-To": "<urn:uuid:dfd0b318-2d2e-4024-bc46-46853a1afc92>",
"WARC-Date": "2023-12-03T16:48:52Z",
"WARC-IP-Address": "140.177.8.58",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QR2WQEWQDCYR32CJA5GHPYZMWDP4ZBNW",
"WARC-Record-ID": "<urn:uuid:e28aed4e-c051-4e2c-b389-b6cfb26919f3>",
"WARC-Target-URI": "https://community.wolfram.com/groups/-/m/t/252691",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a6e027eb-50ff-46e2-b37f-30a5eb66e833>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-252\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,
30,
31,
33,
35,
46,
48,
59,
61,
75,
90,
96,
113,
114,
166,
167,
187,
279,
472,
473,
493,
521,
532,
545,
546,
623,
624,
637,
665,
900,
901,
971,
1005,
1047,
1189,
1238,
1649,
1705,
1716,
1765,
1816,
1866,
1878,
2043,
2088,
2120,
2151,
2201,
2241,
2509,
2510,
2745,
2757,
2802,
2847,
2901,
2902,
3009,
3032,
3046,
3081,
3116,
3171,
3189,
3292,
3293,
3403,
3404,
3467,
3481,
3516,
3550,
3605,
3623,
3624,
3667,
3668,
3677,
3690,
3718,
3829,
3865,
3888,
3956,
3957,
4049,
4062,
4090,
4195,
4196,
4205,
4206,
4219,
4247,
4271,
4272,
4508,
4509,
4555,
4556,
4584,
4585,
4598,
4626,
5010,
5053,
5095,
5224,
5225,
5263,
5298,
5299,
5360,
5402,
5437,
5438,
5529,
5596,
5742,
5829,
5852,
5877,
5948,
5962,
5974,
5981,
5992,
5993
],
"line_end_idx": [
30,
31,
33,
35,
46,
48,
59,
61,
75,
90,
96,
113,
114,
166,
167,
187,
279,
472,
473,
493,
521,
532,
545,
546,
623,
624,
637,
665,
900,
901,
971,
1005,
1047,
1189,
1238,
1649,
1705,
1716,
1765,
1816,
1866,
1878,
2043,
2088,
2120,
2151,
2201,
2241,
2509,
2510,
2745,
2757,
2802,
2847,
2901,
2902,
3009,
3032,
3046,
3081,
3116,
3171,
3189,
3292,
3293,
3403,
3404,
3467,
3481,
3516,
3550,
3605,
3623,
3624,
3667,
3668,
3677,
3690,
3718,
3829,
3865,
3888,
3956,
3957,
4049,
4062,
4090,
4195,
4196,
4205,
4206,
4219,
4247,
4271,
4272,
4508,
4509,
4555,
4556,
4584,
4585,
4598,
4626,
5010,
5053,
5095,
5224,
5225,
5263,
5298,
5299,
5360,
5402,
5437,
5438,
5529,
5596,
5742,
5829,
5852,
5877,
5948,
5962,
5974,
5981,
5992,
5993,
6022
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6022,
"ccnet_original_nlines": 127,
"rps_doc_curly_bracket": 0.006310199853032827,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3120676279067993,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.034588780254125595,
"rps_doc_frac_lines_end_with_ellipsis": 0.0078125,
"rps_doc_frac_no_alph_words": 0.303612619638443,
"rps_doc_frac_unique_words": 0.40702947974205017,
"rps_doc_mean_word_length": 5.0192742347717285,
"rps_doc_num_sentences": 67,
"rps_doc_symbol_to_word_ratio": 0.005380480084568262,
"rps_doc_unigram_entropy": 5.346097946166992,
"rps_doc_word_count": 882,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05489043891429901,
"rps_doc_frac_chars_dupe_6grams": 0.017167380079627037,
"rps_doc_frac_chars_dupe_7grams": 0.017167380079627037,
"rps_doc_frac_chars_dupe_8grams": 0.017167380079627037,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.016263840720057487,
"rps_doc_frac_chars_top_3gram": 0.02439575083553791,
"rps_doc_frac_chars_top_4gram": 0.03117235004901886,
"rps_doc_books_importance": -642.2894287109375,
"rps_doc_books_importance_length_correction": -642.2894287109375,
"rps_doc_openwebtext_importance": -339.2132873535156,
"rps_doc_openwebtext_importance_length_correction": -339.2132873535156,
"rps_doc_wikipedia_importance": -217.5884552001953,
"rps_doc_wikipedia_importance_length_correction": -217.5884552001953
},
"fasttext": {
"dclm": 0.06782042980194092,
"english": 0.7984530925750732,
"fineweb_edu_approx": 1.7464016675949097,
"eai_general_math": 0.5257381200790405,
"eai_open_web_math": 0.28710639476776123,
"eai_web_code": 0.04503459110856056
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "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,219,599,510,841,130,000 |
1 /*
2 * Copyright (c) 2013, 2019, Red Hat, Inc. All rights reserved.
3 *
4 * This code is free software; you can redistribute it and/or modify it
5 * under the terms of the GNU General Public License version 2 only, as
6 * published by the Free Software Foundation.
7 *
8 * This code is distributed in the hope that it will be useful, but WITHOUT
9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
11 * version 2 for more details (a copy is included in the LICENSE file that
12 * accompanied this code).
13 *
14 * You should have received a copy of the GNU General Public License version
15 * 2 along with this work; if not, write to the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
17 *
18 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
19 * or visit www.oracle.com if you need additional information or have any
20 * questions.
21 *
22 */
23
24 #include "precompiled.hpp"
25 #include "gc/shenandoah/shenandoahAsserts.hpp"
26 #include "gc/shenandoah/shenandoahBarrierSet.hpp"
27 #include "gc/shenandoah/shenandoahBarrierSetAssembler.hpp"
28 #include "gc/shenandoah/shenandoahCollectorPolicy.hpp"
29 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
30 #include "gc/shenandoah/shenandoahHeuristics.hpp"
31 #include "gc/shenandoah/shenandoahTraversalGC.hpp"
32 #include "memory/iterator.inline.hpp"
33 #include "runtime/interfaceSupport.inline.hpp"
34 #ifdef COMPILER1
35 #include "gc/shenandoah/c1/shenandoahBarrierSetC1.hpp"
36 #endif
37 #ifdef COMPILER2
38 #include "gc/shenandoah/c2/shenandoahBarrierSetC2.hpp"
39 #endif
40
41 class ShenandoahBarrierSetC1;
42 class ShenandoahBarrierSetC2;
43
44 template <bool STOREVAL_WRITE_BARRIER>
45 class ShenandoahUpdateRefsForOopClosure: public BasicOopIterateClosure {
46 private:
47 ShenandoahHeap* _heap;
48 ShenandoahBarrierSet* _bs;
49
50 template <class T>
51 inline void do_oop_work(T* p) {
52 oop o;
53 if (STOREVAL_WRITE_BARRIER) {
54 o = _heap->evac_update_with_forwarded(p);
55 if (!CompressedOops::is_null(o)) {
56 _bs->enqueue(o);
57 }
58 } else {
59 _heap->maybe_update_with_forwarded(p);
60 }
61 }
62 public:
63 ShenandoahUpdateRefsForOopClosure() : _heap(ShenandoahHeap::heap()), _bs(ShenandoahBarrierSet::barrier_set()) {
64 assert(UseShenandoahGC && ShenandoahCloneBarrier, "should be enabled");
65 }
66
67 virtual void do_oop(oop* p) { do_oop_work(p); }
68 virtual void do_oop(narrowOop* p) { do_oop_work(p); }
69 };
70
71 ShenandoahBarrierSet::ShenandoahBarrierSet(ShenandoahHeap* heap) :
72 BarrierSet(make_barrier_set_assembler<ShenandoahBarrierSetAssembler>(),
73 make_barrier_set_c1<ShenandoahBarrierSetC1>(),
74 make_barrier_set_c2<ShenandoahBarrierSetC2>(),
75 NULL /* barrier_set_nmethod */,
76 BarrierSet::FakeRtti(BarrierSet::ShenandoahBarrierSet)),
77 _heap(heap),
78 _satb_mark_queue_set()
79 {
80 }
81
82 ShenandoahBarrierSetAssembler* ShenandoahBarrierSet::assembler() {
83 BarrierSetAssembler* const bsa = BarrierSet::barrier_set()->barrier_set_assembler();
84 return reinterpret_cast<ShenandoahBarrierSetAssembler*>(bsa);
85 }
86
87 void ShenandoahBarrierSet::print_on(outputStream* st) const {
88 st->print("ShenandoahBarrierSet");
89 }
90
91 bool ShenandoahBarrierSet::is_a(BarrierSet::Name bsn) {
92 return bsn == BarrierSet::ShenandoahBarrierSet;
93 }
94
95 bool ShenandoahBarrierSet::is_aligned(HeapWord* hw) {
96 return true;
97 }
98
99 template <class T, bool STOREVAL_WRITE_BARRIER>
100 void ShenandoahBarrierSet::write_ref_array_loop(HeapWord* start, size_t count) {
101 assert(UseShenandoahGC && ShenandoahCloneBarrier, "should be enabled");
102 ShenandoahUpdateRefsForOopClosure<STOREVAL_WRITE_BARRIER> cl;
103 T* dst = (T*) start;
104 for (size_t i = 0; i < count; i++) {
105 cl.do_oop(dst++);
106 }
107 }
108
109 void ShenandoahBarrierSet::write_ref_array(HeapWord* start, size_t count) {
110 assert(UseShenandoahGC, "should be enabled");
111 if (count == 0) return;
112 if (!ShenandoahCloneBarrier) return;
113
114 if (!need_update_refs_barrier()) return;
115
116 if (_heap->is_concurrent_traversal_in_progress()) {
117 ShenandoahEvacOOMScope oom_evac_scope;
118 if (UseCompressedOops) {
119 write_ref_array_loop<narrowOop, /* wb = */ true>(start, count);
120 } else {
121 write_ref_array_loop<oop, /* wb = */ true>(start, count);
122 }
123 } else {
124 if (UseCompressedOops) {
125 write_ref_array_loop<narrowOop, /* wb = */ false>(start, count);
126 } else {
127 write_ref_array_loop<oop, /* wb = */ false>(start, count);
128 }
129 }
130 }
131
132 template <class T>
133 void ShenandoahBarrierSet::write_ref_array_pre_work(T* dst, size_t count) {
134 shenandoah_assert_not_in_cset_loc_except(dst, _heap->cancelled_gc());
135 if (ShenandoahSATBBarrier && _heap->is_concurrent_mark_in_progress()) {
136 T* elem_ptr = dst;
137 for (size_t i = 0; i < count; i++, elem_ptr++) {
138 T heap_oop = RawAccess<>::oop_load(elem_ptr);
139 if (!CompressedOops::is_null(heap_oop)) {
140 enqueue(CompressedOops::decode_not_null(heap_oop));
141 }
142 }
143 }
144 }
145
146 void ShenandoahBarrierSet::write_ref_array_pre(oop* dst, size_t count, bool dest_uninitialized) {
147 if (! dest_uninitialized) {
148 write_ref_array_pre_work(dst, count);
149 }
150 }
151
152 void ShenandoahBarrierSet::write_ref_array_pre(narrowOop* dst, size_t count, bool dest_uninitialized) {
153 if (! dest_uninitialized) {
154 write_ref_array_pre_work(dst, count);
155 }
156 }
157
158 template <class T>
159 inline void ShenandoahBarrierSet::inline_write_ref_field_pre(T* field, oop new_val) {
160 shenandoah_assert_not_in_cset_loc_except(field, _heap->cancelled_gc());
161 if (_heap->is_concurrent_mark_in_progress()) {
162 T heap_oop = RawAccess<>::oop_load(field);
163 if (!CompressedOops::is_null(heap_oop)) {
164 enqueue(CompressedOops::decode(heap_oop));
165 }
166 }
167 }
168
169 // These are the more general virtual versions.
170 void ShenandoahBarrierSet::write_ref_field_pre_work(oop* field, oop new_val) {
171 inline_write_ref_field_pre(field, new_val);
172 }
173
174 void ShenandoahBarrierSet::write_ref_field_pre_work(narrowOop* field, oop new_val) {
175 inline_write_ref_field_pre(field, new_val);
176 }
177
178 void ShenandoahBarrierSet::write_ref_field_pre_work(void* field, oop new_val) {
179 guarantee(false, "Not needed");
180 }
181
182 void ShenandoahBarrierSet::write_ref_field_work(void* v, oop o, bool release) {
183 shenandoah_assert_not_in_cset_loc_except(v, _heap->cancelled_gc());
184 shenandoah_assert_not_forwarded_except (v, o, o == NULL || _heap->cancelled_gc() || !_heap->is_concurrent_mark_in_progress());
185 shenandoah_assert_not_in_cset_except (v, o, o == NULL || _heap->cancelled_gc() || !_heap->is_concurrent_mark_in_progress());
186 }
187
188 void ShenandoahBarrierSet::write_region(MemRegion mr) {
189 assert(UseShenandoahGC, "should be enabled");
190 if (!ShenandoahCloneBarrier) return;
191 if (! need_update_refs_barrier()) return;
192
193 // This is called for cloning an object (see jvm.cpp) after the clone
194 // has been made. We are not interested in any 'previous value' because
195 // it would be NULL in any case. But we *are* interested in any oop*
196 // that potentially need to be updated.
197
198 oop obj = oop(mr.start());
199 shenandoah_assert_correct(NULL, obj);
200 if (_heap->is_concurrent_traversal_in_progress()) {
201 ShenandoahEvacOOMScope oom_evac_scope;
202 ShenandoahUpdateRefsForOopClosure</* wb = */ true> cl;
203 obj->oop_iterate(&cl);
204 } else {
205 ShenandoahUpdateRefsForOopClosure</* wb = */ false> cl;
206 obj->oop_iterate(&cl);
207 }
208 }
209
210 oop ShenandoahBarrierSet::load_reference_barrier_not_null(oop obj) {
211 if (ShenandoahLoadRefBarrier && _heap->has_forwarded_objects()) {
212 return load_reference_barrier_impl(obj);
213 } else {
214 return obj;
215 }
216 }
217
218 oop ShenandoahBarrierSet::load_reference_barrier(oop obj) {
219 if (obj != NULL) {
220 return load_reference_barrier_not_null(obj);
221 } else {
222 return obj;
223 }
224 }
225
226
227 oop ShenandoahBarrierSet::load_reference_barrier_mutator(oop obj) {
228 assert(ShenandoahLoadRefBarrier, "should be enabled");
229 assert(_heap->is_gc_in_progress_mask(ShenandoahHeap::EVACUATION | ShenandoahHeap::TRAVERSAL), "evac should be in progress");
230 shenandoah_assert_in_cset(NULL, obj);
231
232 oop fwd = resolve_forwarded_not_null(obj);
233 if (oopDesc::equals_raw(obj, fwd)) {
234 ShenandoahEvacOOMScope oom_evac_scope;
235
236 Thread* thread = Thread::current();
237 oop res_oop = _heap->evacuate_object(obj, thread);
238
239 // Since we are already here and paid the price of getting through runtime call adapters
240 // and acquiring oom-scope, it makes sense to try and evacuate more adjacent objects,
241 // thus amortizing the overhead. For sparsely live heaps, scan costs easily dominate
242 // total assist costs, and can introduce a lot of evacuation latency. This is why we
243 // only scan for _nearest_ N objects, regardless if they are eligible for evac or not.
244 // The scan itself should also avoid touching the non-marked objects below TAMS, because
245 // their metadata (notably, klasses) may be incorrect already.
246
247 size_t max = ShenandoahEvacAssist;
248 if (max > 0) {
249 // Traversal is special: it uses incomplete marking context, because it coalesces evac with mark.
250 // Other code uses complete marking context, because evac happens after the mark.
251 ShenandoahMarkingContext* ctx = _heap->is_concurrent_traversal_in_progress() ?
252 _heap->marking_context() : _heap->complete_marking_context();
253
254 ShenandoahHeapRegion* r = _heap->heap_region_containing(obj);
255 assert(r->is_cset(), "sanity");
256
257 HeapWord* cur = (HeapWord*)obj + obj->size() + ShenandoahBrooksPointer::word_size();
258
259 size_t count = 0;
260 while ((cur < r->top()) && ctx->is_marked(oop(cur)) && (count++ < max)) {
261 oop cur_oop = oop(cur);
262 if (oopDesc::equals_raw(cur_oop, resolve_forwarded_not_null(cur_oop))) {
263 _heap->evacuate_object(cur_oop, thread);
264 }
265 cur = cur + cur_oop->size() + ShenandoahBrooksPointer::word_size();
266 }
267 }
268
269 return res_oop;
270 }
271 return fwd;
272 }
273
274 oop ShenandoahBarrierSet::load_reference_barrier_impl(oop obj) {
275 assert(ShenandoahLoadRefBarrier, "should be enabled");
276 if (!CompressedOops::is_null(obj)) {
277 bool evac_in_progress = _heap->is_gc_in_progress_mask(ShenandoahHeap::EVACUATION | ShenandoahHeap::TRAVERSAL);
278 oop fwd = resolve_forwarded_not_null(obj);
279 if (evac_in_progress &&
280 _heap->in_collection_set(obj) &&
281 oopDesc::equals_raw(obj, fwd)) {
282 Thread *t = Thread::current();
283 if (t->is_GC_task_thread()) {
284 return _heap->evacuate_object(obj, t);
285 } else {
286 ShenandoahEvacOOMScope oom_evac_scope;
287 return _heap->evacuate_object(obj, t);
288 }
289 } else {
290 return fwd;
291 }
292 } else {
293 return obj;
294 }
295 }
296
297 void ShenandoahBarrierSet::storeval_barrier(oop obj) {
298 if (ShenandoahStoreValEnqueueBarrier && !CompressedOops::is_null(obj)) {
299 enqueue(obj);
300 }
301 }
302
303 void ShenandoahBarrierSet::keep_alive_barrier(oop obj) {
304 if (ShenandoahKeepAliveBarrier && _heap->is_concurrent_mark_in_progress()) {
305 enqueue(obj);
306 }
307 }
308
309 void ShenandoahBarrierSet::enqueue(oop obj) {
310 shenandoah_assert_not_forwarded_if(NULL, obj, _heap->is_concurrent_traversal_in_progress());
311 if (!_satb_mark_queue_set.is_active()) return;
312
313 // Filter marked objects before hitting the SATB queues. The same predicate would
314 // be used by SATBMQ::filter to eliminate already marked objects downstream, but
315 // filtering here helps to avoid wasteful SATB queueing work to begin with.
316 if (!_heap->requires_marking<false>(obj)) return;
317
318 ShenandoahThreadLocalData::satb_mark_queue(Thread::current()).enqueue(obj);
319 }
320
321 void ShenandoahBarrierSet::on_thread_create(Thread* thread) {
322 // Create thread local data
323 ShenandoahThreadLocalData::create(thread);
324 }
325
326 void ShenandoahBarrierSet::on_thread_destroy(Thread* thread) {
327 // Destroy thread local data
328 ShenandoahThreadLocalData::destroy(thread);
329 }
330
331 void ShenandoahBarrierSet::on_thread_attach(Thread *thread) {
332 assert(!thread->is_Java_thread() || !SafepointSynchronize::is_at_safepoint(),
333 "We should not be at a safepoint");
334 SATBMarkQueue& queue = ShenandoahThreadLocalData::satb_mark_queue(thread);
335 assert(!queue.is_active(), "SATB queue should not be active");
336 assert( queue.is_empty(), "SATB queue should be empty");
337 queue.set_active(_satb_mark_queue_set.is_active());
338 if (thread->is_Java_thread()) {
339 ShenandoahThreadLocalData::set_gc_state(thread, _heap->gc_state());
340 ShenandoahThreadLocalData::initialize_gclab(thread);
341 }
342 }
343
344 void ShenandoahBarrierSet::on_thread_detach(Thread *thread) {
345 SATBMarkQueue& queue = ShenandoahThreadLocalData::satb_mark_queue(thread);
346 queue.flush();
347 if (thread->is_Java_thread()) {
348 PLAB* gclab = ShenandoahThreadLocalData::gclab(thread);
349 if (gclab != NULL) {
350 gclab->retire();
351 }
352 }
353 }
|
{
"url": "https://builds.shipilev.net/patch-openjdk-shenandoah-jdk/latest/src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.cpp.html",
"source_domain": "builds.shipilev.net",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "17246",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VPXO3QXO6AKWZU4QALACITH3VW4V74JV",
"WARC-Concurrent-To": "<urn:uuid:2cd3100d-7e3d-46e2-884b-38dac2b9dac3>",
"WARC-Date": "2019-03-26T12:14:31Z",
"WARC-IP-Address": "31.7.184.68",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:CYSLNAO2FFQ5S6UJY7KD2UZQIJE24K2F",
"WARC-Record-ID": "<urn:uuid:285605f5-9c9a-4c1f-b9e7-b6a6e708da02>",
"WARC-Target-URI": "https://builds.shipilev.net/patch-openjdk-shenandoah-jdk/latest/src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.cpp.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dac31721-f808-44e2-876d-915f8b46a56f>"
},
"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-123-157-4.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,
8,
77,
85,
162,
239,
290,
298,
379,
457,
535,
615,
647,
655,
737,
816,
886,
894,
974,
1053,
1072,
1080,
1089,
1095,
1127,
1179,
1234,
1298,
1358,
1414,
1469,
1525,
1568,
1620,
1642,
1702,
1714,
1736,
1796,
1808,
1814,
1849,
1884,
1890,
1934,
2012,
2026,
2056,
2090,
2096,
2122,
2161,
2177,
2216,
2269,
2315,
2345,
2358,
2376,
2426,
2437,
2446,
2459,
2578,
2659,
2668,
2674,
2735,
2796,
2804,
2810,
2882,
2961,
3026,
3091,
3141,
3216,
3236,
3266,
3273,
3280,
3286,
3358,
3450,
3519,
3526,
3532,
3599,
3641,
3648,
3654,
3715,
3770,
3777,
3783,
3842,
3862,
3869,
3875,
3928,
4014,
4093,
4162,
4190,
4234,
4261,
4270,
4277,
4283,
4364,
4417,
4448,
4492,
4498,
4546,
4552,
4611,
4659,
4693,
4768,
4786,
4861,
4872,
4888,
4922,
4998,
5016,
5092,
5103,
5112,
5119,
5125,
5149,
5230,
5307,
5386,
5414,
5472,
5529,
5582,
5647,
5660,
5671,
5680,
5687,
5693,
5796,
5831,
5878,
5887,
5894,
5900,
6009,
6044,
6091,
6100,
6107,
6113,
6137,
6228,
6307,
6361,
6413,
6464,
6518,
6529,
6538,
6545,
6551,
6604,
6688,
6739,
6746,
6752,
6842,
6893,
6900,
6906,
6991,
7030,
7037,
7043,
7128,
7203,
7338,
7473,
7480,
7486,
7547,
7600,
7644,
7693,
7699,
7776,
7855,
7931,
7978,
7984,
8018,
8063,
8122,
8170,
8234,
8266,
8282,
8347,
8379,
8388,
8395,
8401,
8475,
8548,
8598,
8614,
8635,
8644,
8651,
8657,
8722,
8748,
8802,
8818,
8839,
8848,
8855,
8861,
8867,
8940,
9002,
9134,
9179,
9185,
9235,
9279,
9327,
9333,
9378,
9438,
9444,
9542,
9637,
9731,
9825,
9921,
10019,
10091,
10097,
10141,
10165,
10274,
10367,
10457,
10562,
10568,
10641,
10684,
10690,
10786,
10792,
10821,
10906,
10943,
11029,
11085,
11100,
11181,
11194,
11205,
11211,
11236,
11245,
11264,
11271,
11277,
11347,
11409,
11453,
11573,
11625,
11658,
11704,
11750,
11792,
11833,
11885,
11905,
11957,
12009,
12022,
12040,
12063,
12074,
12090,
12111,
12120,
12127,
12133,
12193,
12273,
12296,
12305,
12312,
12318,
12380,
12464,
12487,
12496,
12503,
12509,
12560,
12660,
12714,
12720,
12809,
12897,
12980,
13037,
13043,
13126,
13133,
13139,
13206,
13241,
13291,
13298,
13304,
13372,
13408,
13459,
13466,
13472,
13539,
13624,
13674,
13756,
13826,
13891,
13950,
13989,
14066,
14128,
14137,
14144,
14150,
14217,
14299,
14321,
14360,
14425,
14455,
14483,
14494,
14503
],
"line_end_idx": [
8,
77,
85,
162,
239,
290,
298,
379,
457,
535,
615,
647,
655,
737,
816,
886,
894,
974,
1053,
1072,
1080,
1089,
1095,
1127,
1179,
1234,
1298,
1358,
1414,
1469,
1525,
1568,
1620,
1642,
1702,
1714,
1736,
1796,
1808,
1814,
1849,
1884,
1890,
1934,
2012,
2026,
2056,
2090,
2096,
2122,
2161,
2177,
2216,
2269,
2315,
2345,
2358,
2376,
2426,
2437,
2446,
2459,
2578,
2659,
2668,
2674,
2735,
2796,
2804,
2810,
2882,
2961,
3026,
3091,
3141,
3216,
3236,
3266,
3273,
3280,
3286,
3358,
3450,
3519,
3526,
3532,
3599,
3641,
3648,
3654,
3715,
3770,
3777,
3783,
3842,
3862,
3869,
3875,
3928,
4014,
4093,
4162,
4190,
4234,
4261,
4270,
4277,
4283,
4364,
4417,
4448,
4492,
4498,
4546,
4552,
4611,
4659,
4693,
4768,
4786,
4861,
4872,
4888,
4922,
4998,
5016,
5092,
5103,
5112,
5119,
5125,
5149,
5230,
5307,
5386,
5414,
5472,
5529,
5582,
5647,
5660,
5671,
5680,
5687,
5693,
5796,
5831,
5878,
5887,
5894,
5900,
6009,
6044,
6091,
6100,
6107,
6113,
6137,
6228,
6307,
6361,
6413,
6464,
6518,
6529,
6538,
6545,
6551,
6604,
6688,
6739,
6746,
6752,
6842,
6893,
6900,
6906,
6991,
7030,
7037,
7043,
7128,
7203,
7338,
7473,
7480,
7486,
7547,
7600,
7644,
7693,
7699,
7776,
7855,
7931,
7978,
7984,
8018,
8063,
8122,
8170,
8234,
8266,
8282,
8347,
8379,
8388,
8395,
8401,
8475,
8548,
8598,
8614,
8635,
8644,
8651,
8657,
8722,
8748,
8802,
8818,
8839,
8848,
8855,
8861,
8867,
8940,
9002,
9134,
9179,
9185,
9235,
9279,
9327,
9333,
9378,
9438,
9444,
9542,
9637,
9731,
9825,
9921,
10019,
10091,
10097,
10141,
10165,
10274,
10367,
10457,
10562,
10568,
10641,
10684,
10690,
10786,
10792,
10821,
10906,
10943,
11029,
11085,
11100,
11181,
11194,
11205,
11211,
11236,
11245,
11264,
11271,
11277,
11347,
11409,
11453,
11573,
11625,
11658,
11704,
11750,
11792,
11833,
11885,
11905,
11957,
12009,
12022,
12040,
12063,
12074,
12090,
12111,
12120,
12127,
12133,
12193,
12273,
12296,
12305,
12312,
12318,
12380,
12464,
12487,
12496,
12503,
12509,
12560,
12660,
12714,
12720,
12809,
12897,
12980,
13037,
13043,
13126,
13133,
13139,
13206,
13241,
13291,
13298,
13304,
13372,
13408,
13459,
13466,
13472,
13539,
13624,
13674,
13756,
13826,
13891,
13950,
13989,
14066,
14128,
14137,
14144,
14150,
14217,
14299,
14321,
14360,
14425,
14455,
14483,
14494,
14503,
14509
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14509,
"ccnet_original_nlines": 352,
"rps_doc_curly_bracket": 0.009649179875850677,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10135921835899353,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021747570484876633,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5335922241210938,
"rps_doc_frac_unique_words": 0.6079500913619995,
"rps_doc_mean_word_length": 7.657833099365234,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.006213590037077665,
"rps_doc_unigram_entropy": 6.238296985626221,
"rps_doc_word_count": 1283,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04254452884197235,
"rps_doc_frac_chars_dupe_6grams": 0.02117048017680645,
"rps_doc_frac_chars_dupe_7grams": 0.010585240088403225,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006513989996165037,
"rps_doc_frac_chars_top_3gram": 0.00916031002998352,
"rps_doc_frac_chars_top_4gram": 0.005801530089229345,
"rps_doc_books_importance": -986.4872436523438,
"rps_doc_books_importance_length_correction": -986.4872436523438,
"rps_doc_openwebtext_importance": -721.2637939453125,
"rps_doc_openwebtext_importance_length_correction": -721.2637939453125,
"rps_doc_wikipedia_importance": -403.7942199707031,
"rps_doc_wikipedia_importance_length_correction": -403.7942199707031
},
"fasttext": {
"dclm": 0.8360893726348877,
"english": 0.3058595061302185,
"fineweb_edu_approx": 1.7670934200286865,
"eai_general_math": 0.8129290342330933,
"eai_open_web_math": 0.1881176233291626,
"eai_web_code": 0.5129015445709229
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-4,471,717,220,436,785,700 |
{{blogList.blogTitle}}
Whether you're buying a new laptop or building a desktop, it's always the same. You enjoy blistering performance for the first few months, even a year at times, and slowly, performance deteriorates. Games start stuttering, opening a few browser tabs seems to throw off your system.
No, it may not be time to upgrade your PC or laptop yet! Dust and other foreign particles can enter your components and clog them – increasing heat. The thermal paste on your CPU might have started to wear off, and your fans and heatsinks aren’t as efficient as they used to be; airflow issues might also be compounded by careless or non-existent cable management.
All of the above comes at a significant performance hit in some cases. Take a look at some of our testing below:
1: Cinebench Score Before Cleaning
2: Cinebench Score After Cleaning
1: Temperatures and Clock Speeds Before Cleaning
2: Temperatures and Clock Speeds After Cleaning
Even if you ARE upgrading, you should clean out your system to make sure that you're not limiting your hardware's performance in any way.
Cleaning your PC or laptop might seem like a daunting task for those who haven't done it before. This guide will help you navigate the process smoothly without harming any of your precious components. A clean PC will offer relatively better stability, better performance, and better thermals while looking gorgeous!
What You'll Need
Get the following things together before you begin:
a) A powerful blower device (some vacuum cleaners that work in reverse will also do) or a can of compressed air. Either way, the objective is to blow pressurized air into the small fins to get the dust out.
b) A dust mask. Trust me, if your system hasn’t been cleaned out in a while, prepare to be engulfed in gigantic dust clouds as soon as you get started.
c) A soft, lint-free, micro-fiber cloth. Sometimes, even compressed air won’t be enough. You have to rely on good old wiping in those cases. Keep this cloth ready; you'll need it.
d) An open space that's going to get VERY dusty in a bit.
e) Zip ties or cable ties. These nifty little lifesavers are brilliant for cable management and a clean-looking system. Keep a few of them on hand (10-12).
f) Patience. Managing cables can be frustrating at times. Be patient and be ready for some scratched/slightly bruised fingers once you're done.
g) Thermal Paste. You’ll need to re-apply thermal paste once you remove your CPU cooler.
h) 99% Iso-Propyl Alcohol (IPA) Solution. If you can't find this, you can even use 75% IPA rubbing alcohol.
Now, let's start cleaning!
Fans, Filters, and CPU Heatsink Dust Cleaning
Dust is a part of our lives wherever we live. It tends to accumulate over time, reaching catastrophic levels in a PC at times. The accumulation of dust clogs the heatsink, filters, and case fans, affecting the thermal performance of your PC.
Less-than-efficient airflow causes your entire system to run at higher temperatures than it needs to – wasting valuable power.
Cleaning Process
a) Unscrew the case fans as well as the CPU cooler and heatsink. Consult your CPU cooler manual for detailed instructions.
b) If you're using liquid cooling, please read on, otherwise move on to the next step. The liquid cooling heatsink will be mounted away from the CPU, usually towards the front or the top of the cabinet. Carefully remove the fan as well as the heatsink from the case before unscrewing the cooler fixed atop your CPU.
c) Remove your processor from its socket and keep it aside. Somewhere away from the dust preferably.
d) Hold up the blower or the can of compressed air and aim it at the heatsink and CPU fan first. If you see dust pouring out the opposite side, it’s working.
e) Once you’re done, repeat this process with the case fans as well.
f) Now, all the loose dust should be out. However, in most cases, your fan leaves will often retain a lot of dust.
g) Use a cloth to wipe each leaf individually, reaching as far down as you can. If you have large hands, this might be hard. Use the back of an old toothbrush or something alike to guide the cloth in between the gaps.
h) Your clean fans and CPU heatsink should now look something like this.
Cable Management
Clogged, haphazard cables can affect airflow in a big way. What’s more, if you have a transparent side window in your case, you don’t want people looking in at a mess of cables inside.
Once your CPU cooler and fans are clean, you need to get those power supply cables clean as well. If you’ve already managed your cables effectively, go ahead, and aim your blower at them. This should take care of most of the dust lodged between the wires. You can proceed to the next component after this step.
If you need to improve your cabling before cleaning your PC's interior, read on!
Managing Cables
a) In most cases, you can find a hole right next to your motherboard’s 24-pin power cable. Similarly, you can find such spaces for every single power port on your motherboard.
b) If your power cables aren't coming in from behind those gaps, we’ll need to re-do the cabling. If your wires are already using those gaps, you're good to jump to the next step.
c) Remove the back panel from your cabinet (it should open from both sides)
d) Unplug the cables going from the PSU (power supply) to the motherboard and other components like fans and storage devices.
e) Pull the cables towards the back of your case and route them through the gaps nearest to where they're needed. Avoid overlaps as much as possible.
f) Make sure you've plugged in all the cables.
g) Now, use the zip ties to group cables in bunches and press them flat against the backplate of your cabinet.
h) You could also go a step further and organize the I/O and power cables at the back of your case, as shown above.
Overall System Cleaning
If you've already managed your cables well, it should give you more than enough room to clean out the rest of your system.
Cleaning Process
a) Blow air into your system top to bottom.
b) Once you're done with one side, remove the backplate of your cabinet and clean that side as well.
c) You might encounter more stubborn grime while cleaning out your system. Use the soft cloth to wipe them clean.
d) Please avoid using any liquid cleaning agents during this process.
CPU Thermal Paste Replacement
Now that you've cleaned your CPU cooler and other cabinet internals, you'll need to re-apply thermal paste on your processor before use.
Process of Re-applying Thermal Paste
a) Wet the soft cloth with a little 99% IPA solution. Do NOT use water for this. It won't work, and you'll risk the safety of your motherboard and other parts.
b) Place the CPU back into the motherboard socket before proceeding. It'll make things much easier!
c) Quickly dab the top of the processor with the wet portion of the cloth and gently rub off the dried thermal paste. Keep wetting the fabric as needed. You shouldn't need to apply much force if using enough of the 99% IPA solution.
d) Once the top of the processor is clean, repeat the above with the copper contact of the CPU cooler (located at the bottom of the heatsink for air coolers).
e) Once both your processor and CPU cooler contact plate are clean and shiny, grab your thermal paste.
f) Apply a blob of paste, right at the center of the processor. It shouldn’t be too big or too small. Just enough to spread out evenly over the processor when affixing the CPU cooler atop it.
g) Re-install the CPU cooler on the processor without shifting its position too much.
h) That's it. Your CPU is ready to go again.
Wrap-Up
Your system should run cooler and faster now that you’ve unclogged all the dust and dirt from it. It should offer better performance as well as better stability after this thorough cleaning. For an even more stable experience, make sure you update all your software and drivers to the latest version as soon as you can.
In case you’re upgrading to AMD’s latest 3rd Generation Ryzen processors, you can find the newest version of BIOS for all MSI motherboards here.
|
{
"url": "https://www.msi.com/blog/a-guide-to-cleaning-your-system-for-better-performance-and-thermals",
"source_domain": "www.msi.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "86970",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y422IZ5IYKRUCXBQGPAOFOPTBH6MEWHS",
"WARC-Concurrent-To": "<urn:uuid:8e392854-3e21-4086-bd67-301a5f5a6a5e>",
"WARC-Date": "2021-07-25T19:03:09Z",
"WARC-IP-Address": "69.192.0.17",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LYDLWMWBJJF6GBITU5NFSLAKHVF67ZY6",
"WARC-Record-ID": "<urn:uuid:6b75a4ff-a253-43e2-acf1-1767ec6e122d>",
"WARC-Target-URI": "https://www.msi.com/blog/a-guide-to-cleaning-your-system-for-better-performance-and-thermals",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:11caf789-fbfb-4162-9afe-ee35d6c2279c>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-218.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
23,
24,
306,
308,
673,
675,
788,
789,
824,
826,
827,
861,
863,
864,
913,
915,
916,
964,
966,
1104,
1106,
1422,
1424,
1425,
1442,
1443,
1495,
1702,
1854,
2034,
2036,
2038,
2096,
2252,
2396,
2485,
2593,
2595,
2622,
2624,
2625,
2671,
2672,
2914,
2916,
2918,
2920,
3047,
3049,
3050,
3067,
3068,
3191,
3193,
3195,
3511,
3612,
3770,
3839,
3954,
4172,
4245,
4247,
4249,
4251,
4252,
4269,
4270,
4455,
4457,
4459,
4770,
4772,
4853,
4855,
4856,
4872,
4873,
5049,
5229,
5305,
5307,
5309,
5435,
5437,
5439,
5589,
5636,
5747,
5749,
5751,
5867,
5869,
5870,
5894,
5895,
6018,
6020,
6021,
6038,
6039,
6083,
6184,
6298,
6368,
6370,
6371,
6401,
6402,
6539,
6541,
6542,
6579,
6580,
6740,
6840,
6842,
6844,
7077,
7079,
7081,
7240,
7343,
7535,
7537,
7539,
7625,
7627,
7629,
7674,
7676,
7677,
7685,
7686,
8006
],
"line_end_idx": [
23,
24,
306,
308,
673,
675,
788,
789,
824,
826,
827,
861,
863,
864,
913,
915,
916,
964,
966,
1104,
1106,
1422,
1424,
1425,
1442,
1443,
1495,
1702,
1854,
2034,
2036,
2038,
2096,
2252,
2396,
2485,
2593,
2595,
2622,
2624,
2625,
2671,
2672,
2914,
2916,
2918,
2920,
3047,
3049,
3050,
3067,
3068,
3191,
3193,
3195,
3511,
3612,
3770,
3839,
3954,
4172,
4245,
4247,
4249,
4251,
4252,
4269,
4270,
4455,
4457,
4459,
4770,
4772,
4853,
4855,
4856,
4872,
4873,
5049,
5229,
5305,
5307,
5309,
5435,
5437,
5439,
5589,
5636,
5747,
5749,
5751,
5867,
5869,
5870,
5894,
5895,
6018,
6020,
6021,
6038,
6039,
6083,
6184,
6298,
6368,
6370,
6371,
6401,
6402,
6539,
6541,
6542,
6579,
6580,
6740,
6840,
6842,
6844,
7077,
7079,
7081,
7240,
7343,
7535,
7537,
7539,
7625,
7627,
7629,
7674,
7676,
7677,
7685,
7686,
8006,
8150
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8150,
"ccnet_original_nlines": 135,
"rps_doc_curly_bracket": 0.0004908000119030476,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43885713815689087,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023428570479154587,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16171428561210632,
"rps_doc_frac_unique_words": 0.3497536778450012,
"rps_doc_mean_word_length": 4.474313735961914,
"rps_doc_num_sentences": 96,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.489299297332764,
"rps_doc_word_count": 1421,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03271469101309776,
"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.007864110171794891,
"rps_doc_frac_chars_top_3gram": 0.008178669959306717,
"rps_doc_frac_chars_top_4gram": 0.005190310068428516,
"rps_doc_books_importance": -736.526123046875,
"rps_doc_books_importance_length_correction": -736.526123046875,
"rps_doc_openwebtext_importance": -422.17681884765625,
"rps_doc_openwebtext_importance_length_correction": -422.17681884765625,
"rps_doc_wikipedia_importance": -207.89010620117188,
"rps_doc_wikipedia_importance_length_correction": -207.89010620117188
},
"fasttext": {
"dclm": 0.09783118963241577,
"english": 0.9313825368881226,
"fineweb_edu_approx": 1.6291464567184448,
"eai_general_math": 0.009408240206539631,
"eai_open_web_math": 0.19845306873321533,
"eai_web_code": 0.011062740348279476
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,521,446,376,059,812,400 |
Manipulation des événements associés aux objets d’affichage
Flash Player 9 et les versions ultérieures, Adobe AIR 1.0 et les versions ultérieures
La classe DisplayObject hérite de la classe EventDispatcher. Cela signifie que chaque objet d’affichage peut être pleinement impliqué dans le modèle d’événement (décrit dans le chapitre Gestion des événements). Chaque objet d’affichage peut utiliser sa méthode addEventListener() (héritée de la classe EventDispatcher) pour attendre un événement particulier, mais ceci uniquement si l’objet écouteur fait partie du flux d’événement de l’événement considéré.
Lorsque Flash Player ou AIR distribue un objet événement, celui-ci effectue un aller-retour à partir de la scène via l’objet d’affichage où s’est produit l’événement. Par exemple, si un utilisateur clique sur un objet d’affichage appelé child1, Flash Player distribue un objet événement à partir de la scène via la hiérarchie de la liste d’affichage jusqu’à l’objet d’affichage child1.
D’un point de vue conceptuel, le flux d’événement est divisé en trois phases, comme illustré par le diagramme suivant :
<Trois phases du flux d’événement>
Pour plus d’informations, voir Gestion des événements.
Lors de la gestion des événements liés aux objets d’affichage, il est important de ne pas oublier l’effet potentiel des objets écouteurs d’événement sur l’éventuelle suppression automatique des objets d’affichage de la mémoire (garbage collection) lorsqu’ils sont supprimés de la liste d’affichage. Si des objets d’un objet d’affichage sont enregistrés en tant qu’écouteurs d’événement, ce dernier n’est pas supprimé de la mémoire même s’il est supprimé de la liste d’affichage, car il continue à posséder des références à ces objets écouteur. Pour plus d’informations, voir Gestion des écouteurs d’événement.
|
{
"url": "https://help.adobe.com/fr_FR/as3/dev/WS5b3ccc516d4fbf351e63e3d118a9b90204-7dfb.html",
"source_domain": "help.adobe.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "24509",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4G4ECYFBPYPU7QB3E5WL7MS6XEPGL2F3",
"WARC-Concurrent-To": "<urn:uuid:b71b01ae-48e9-47a5-8e56-5bf6a0559eed>",
"WARC-Date": "2022-05-23T11:24:59Z",
"WARC-IP-Address": "23.62.27.197",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IVD7EYYQDWVFOUXRVSMEPC2Z7XGLCWTI",
"WARC-Record-ID": "<urn:uuid:6aef113d-75ff-4498-a76b-2a61bacfdfab>",
"WARC-Target-URI": "https://help.adobe.com/fr_FR/as3/dev/WS5b3ccc516d4fbf351e63e3d118a9b90204-7dfb.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cdb855ff-a389-4d56-a67e-15d9a4141d9e>"
},
"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-189\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,
60,
61,
147,
148,
606,
607,
993,
994,
1114,
1115,
1150,
1151,
1206,
1207
],
"line_end_idx": [
60,
61,
147,
148,
606,
607,
993,
994,
1114,
1115,
1150,
1151,
1206,
1207,
1816
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1816,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12737126648426056,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008130080066621304,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20867209136486053,
"rps_doc_frac_unique_words": 0.50957852602005,
"rps_doc_mean_word_length": 6.0804595947265625,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.570202350616455,
"rps_doc_word_count": 261,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07183364778757095,
"rps_doc_frac_chars_dupe_6grams": 0.07183364778757095,
"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.025204790756106377,
"rps_doc_frac_chars_top_3gram": 0.04158790037035942,
"rps_doc_frac_chars_top_4gram": 0.03780718147754669,
"rps_doc_books_importance": -157.83338928222656,
"rps_doc_books_importance_length_correction": -154.8861846923828,
"rps_doc_openwebtext_importance": -68.71539306640625,
"rps_doc_openwebtext_importance_length_correction": -68.71539306640625,
"rps_doc_wikipedia_importance": -73.49900817871094,
"rps_doc_wikipedia_importance_length_correction": -73.46240234375
},
"fasttext": {
"dclm": 0.9639343023300171,
"english": 0.0012001299764961004,
"fineweb_edu_approx": 1.1951894760131836,
"eai_general_math": 0.004252790007740259,
"eai_open_web_math": 0.14995110034942627,
"eai_web_code": 0.8885542750358582
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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
|
2,183,725,020,719,851,800 |
Ask Your Question
0
Reference system in SimpleBlobDetector
asked 2017-11-03 05:38:51 -0500
Ema90 gravatar image
Trying the SimpleBlobDetection to identify circumferences in low-resolution images, i'm in doubt about the meaning of the x and y properties of the returned keypoints. In particular, since i need to map from the pixel domain to a physical domain (in my problem every pixel has a side length expressed in meters), i believed that keypoint.x = 0 and keypoint.y = 0 indicated to the upper left corner of the upper left pixel, instead it seams that keypoint.x = 0 and keypoint.y = 0 refer to the center of the upper left pixel. Is my impression right?
edit retag flag offensive close merge delete
Comments
1
integer pixels are used here, no subpixel accuracy, so there is no "upper left corner" of a pixel
berak gravatar imageberak ( 2017-11-03 05:48:20 -0500 )edit
1
In most cases, the integer value of a pixel represents the center of the pixel. For example
Mat tst(1,3,CV_32F);
tst.setTo( 0 );
tst.at<float>( 0 ) = 1;
tst.at<float>( 1 ) = 2;
tst.at<float>( 2 ) = 1;
Moments m = moments(tst);
cout<<m.m01/m.m00<<" "<<m.m10/m.m00<<"\n";
prints "0 1"
Tetragramm gravatar imageTetragramm ( 2017-11-03 09:50:38 -0500 )edit
The x property of the SimpleBlobDetector keypoint is of type float. Therefore, when keypoint.x = 1.5, do it indicate a point between a pair of pixels?
Ema90 gravatar imageEma90 ( 2017-11-07 02:40:56 -0500 )edit
1.5 would be exactly on the dividing line between two pixels. For example, if you make that 1 2 2 1 instead, you'll get 1.5, ie: the middle of the four pixels, or right between the middle two.
Tetragramm gravatar imageTetragramm ( 2017-11-07 17:52:45 -0500 )edit
1 answer
Sort by » oldest newest most voted
0
answered 2017-11-09 02:10:07 -0500
Ema90 gravatar image
Thanks a lot!!! Now it's clear to me. Only one last curiosity: following this convention, the upper left corner of the upper left pixel has x = -0.5 and y = -0.5 ?
edit flag offensive delete link more
Comments
Yes. Of course, you can't really get anything there, unless you're doing things like reflecting the border. Because to get sub-pixel measurements on something, you have to interpolate between pixels, and there's nothing above or left of (0,0).
On the other hand, who knows what anyone is actually using this stuff for, so sure.
Tetragramm gravatar imageTetragramm ( 2017-11-09 17:53:54 -0500 )edit
Question Tools
1 follower
Stats
Asked: 2017-11-03 05:38:51 -0500
Seen: 202 times
Last updated: Nov 03 '17
|
{
"url": "https://answers.opencv.org/question/177490/reference-system-in-simpleblobdetector/?sort=latest",
"source_domain": "answers.opencv.org",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "60215",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Q2PBDCWNGDPVC4UR2YWP2MT4JP5Z4BWG",
"WARC-Concurrent-To": "<urn:uuid:b6e12305-05de-49b5-b503-d31b0e2ecaeb>",
"WARC-Date": "2022-01-19T04:26:02Z",
"WARC-IP-Address": "172.67.218.21",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:NDGYS2UB5S3TJ4KVELFAJMXSQLAAWYH7",
"WARC-Record-ID": "<urn:uuid:5f5b6fbd-3e41-452a-936e-9ce23dc39024>",
"WARC-Target-URI": "https://answers.opencv.org/question/177490/reference-system-in-simpleblobdetector/?sort=latest",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d5be2a8e-d992-4b5f-a9a3-381e9cfad475>"
},
"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-84\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,
18,
20,
21,
60,
61,
93,
94,
115,
116,
664,
665,
710,
711,
720,
721,
723,
724,
822,
823,
883,
885,
886,
978,
979,
1000,
1016,
1040,
1064,
1088,
1114,
1157,
1158,
1171,
1172,
1242,
1243,
1394,
1395,
1455,
1456,
1649,
1650,
1720,
1721,
1730,
1731,
1766,
1768,
1769,
1804,
1805,
1826,
1827,
1991,
1992,
2029,
2030,
2039,
2040,
2284,
2285,
2369,
2370,
2440,
2441,
2456,
2457,
2468,
2469,
2475,
2476,
2509,
2510,
2526,
2527
],
"line_end_idx": [
18,
20,
21,
60,
61,
93,
94,
115,
116,
664,
665,
710,
711,
720,
721,
723,
724,
822,
823,
883,
885,
886,
978,
979,
1000,
1016,
1040,
1064,
1088,
1114,
1157,
1158,
1171,
1172,
1242,
1243,
1394,
1395,
1455,
1456,
1649,
1650,
1720,
1721,
1730,
1731,
1766,
1768,
1769,
1804,
1805,
1826,
1827,
1991,
1992,
2029,
2030,
2039,
2040,
2284,
2285,
2369,
2370,
2440,
2441,
2456,
2457,
2468,
2469,
2475,
2476,
2509,
2510,
2526,
2527,
2551
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2551,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2868462800979614,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0015847899485379457,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4136291742324829,
"rps_doc_frac_unique_words": 0.5289672613143921,
"rps_doc_mean_word_length": 4.8287153244018555,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.964365482330322,
"rps_doc_word_count": 397,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07668232172727585,
"rps_doc_frac_chars_dupe_6grams": 0.066771000623703,
"rps_doc_frac_chars_dupe_7grams": 0.03860197961330414,
"rps_doc_frac_chars_dupe_8grams": 0.03860197961330414,
"rps_doc_frac_chars_dupe_9grams": 0.03860197961330414,
"rps_doc_frac_chars_top_2gram": 0.020865939557552338,
"rps_doc_frac_chars_top_3gram": 0.03129889816045761,
"rps_doc_frac_chars_top_4gram": 0.026604069396853447,
"rps_doc_books_importance": -250.6775360107422,
"rps_doc_books_importance_length_correction": -250.6775360107422,
"rps_doc_openwebtext_importance": -159.79739379882812,
"rps_doc_openwebtext_importance_length_correction": -159.79739379882812,
"rps_doc_wikipedia_importance": -106.22692108154297,
"rps_doc_wikipedia_importance_length_correction": -106.22692108154297
},
"fasttext": {
"dclm": 0.5517427325248718,
"english": 0.8046307563781738,
"fineweb_edu_approx": 3.006920576095581,
"eai_general_math": 0.869598388671875,
"eai_open_web_math": 0.19150316715240479,
"eai_web_code": 0.08506327867507935
}
}
|
{
"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": "006.3",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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,623,946,835,075,625,000 |
0 Favourites
How do I fix this detection issue?
• I've been getting my fair share out of these forums lately. But I'm glad they are here, really excited about this program and what I can do with it!
Anyway, after fixing an instancing problem I was facing with the help of these forums, I've come across another bug with what I'm trying to do (bring instances of items to a player character when they are within a certain distance of the instanced item).
Below is the capx file, and in it you'll see that the magnetizing concept works fine for the first coin but the detection is acting strangely. It seems to be working for only random coins when it should be working for all of them. The second coin, you can stand right beside it and it won't budge. The furthest one you can stand directly under and it won't move (even if I crank the global variable determining the distance needed for the detection).
EDIT: If I crank the variable high enough, it does work on all coins. But it seems anything below 100 doesn't. Also, if I get close to the coin and jump, THEN it activates and is attracted to the player... am I missing something with the event for detection that requires a vertical update before it gets attracted? I don't understand it. Haha.
Any help with this problem?
drive.google.com/file/d/0B_fsFsHtHjNqbFBTOU02OVUzZzQ/view
EDIT:
This capx file allows you to see better how sometimes it works and sometimes it doesn't. (also xbox gamepad support woot)
drive.google.com/file/d/0B_fsFsHtHjNqQmI0aVRZTy1OanM/view
• Construct 3
Buy Construct 3
Develop games in your browser. Powerful, performant & highly capable.
Buy Now Construct 3 users don't see these ads
• Instead of using System->compare use system->"pick by comparison". The system->compare condition does no picking so it only ever compares with the first instance.
• Instead of using System->compare use system->"pick by comparison". The system->compare condition does no picking so it only ever compares with the first instance.
Dude, you are a lowkey livesaver. Haha. Made the entire thing work like a charm. Loving these forums and how helpful the community is. It makes creating games that much more fun.
Thanks!
Jump to:
Active Users
There are 1 visitors browsing this topic (0 users and 1 guests)
|
{
"url": "https://www.construct.net/forum/construct-2/how-do-i-18/how-do-i-fix-this-detection-is-96625",
"source_domain": "www.construct.net",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "40728",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EJ6AIBVZJIZ75G6EY22UOROOZ7XCJAWA",
"WARC-Concurrent-To": "<urn:uuid:a949f31f-e41a-427b-bf0a-b3a7a89f8f13>",
"WARC-Date": "2018-07-19T17:45:35Z",
"WARC-IP-Address": "104.20.218.35",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5W4KOESL4KAN772622C6QJBY232X7XBS",
"WARC-Record-ID": "<urn:uuid:90911670-9762-4126-86b2-b64b28f415fc>",
"WARC-Target-URI": "https://www.construct.net/forum/construct-2/how-do-i-18/how-do-i-fix-this-detection-is-96625",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:60564886-322d-4931-8458-18910911fc1d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-170-172-222.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,
13,
14,
49,
50,
203,
204,
463,
464,
919,
920,
1269,
1270,
1302,
1303,
1365,
1366,
1376,
1377,
1503,
1504,
1566,
1567,
1583,
1584,
1604,
1605,
1679,
1680,
1730,
1897,
1898,
2065,
2066,
2249,
2250,
2262,
2263,
2272,
2285
],
"line_end_idx": [
13,
14,
49,
50,
203,
204,
463,
464,
919,
920,
1269,
1270,
1302,
1303,
1365,
1366,
1376,
1377,
1503,
1504,
1566,
1567,
1583,
1584,
1604,
1605,
1679,
1680,
1730,
1897,
1898,
2065,
2066,
2249,
2250,
2262,
2263,
2272,
2285,
2348
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2348,
"ccnet_original_nlines": 39,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4156378507614136,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030864199623465538,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18312756717205048,
"rps_doc_frac_unique_words": 0.5236842036247253,
"rps_doc_mean_word_length": 4.728947162628174,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.0020576100796461105,
"rps_doc_unigram_entropy": 4.967281818389893,
"rps_doc_word_count": 380,
"rps_doc_frac_chars_dupe_10grams": 0.14579854905605316,
"rps_doc_frac_chars_dupe_5grams": 0.14579854905605316,
"rps_doc_frac_chars_dupe_6grams": 0.14579854905605316,
"rps_doc_frac_chars_dupe_7grams": 0.14579854905605316,
"rps_doc_frac_chars_dupe_8grams": 0.14579854905605316,
"rps_doc_frac_chars_dupe_9grams": 0.14579854905605316,
"rps_doc_frac_chars_top_2gram": 0.015581520274281502,
"rps_doc_frac_chars_top_3gram": 0.014468559995293617,
"rps_doc_frac_chars_top_4gram": 0.012242630124092102,
"rps_doc_books_importance": -186.2431182861328,
"rps_doc_books_importance_length_correction": -186.2431182861328,
"rps_doc_openwebtext_importance": -104.5713119506836,
"rps_doc_openwebtext_importance_length_correction": -104.5713119506836,
"rps_doc_wikipedia_importance": -77.03746795654297,
"rps_doc_wikipedia_importance_length_correction": -77.03746795654297
},
"fasttext": {
"dclm": 0.30328428745269775,
"english": 0.9416326284408569,
"fineweb_edu_approx": 1.3975285291671753,
"eai_general_math": 0.6230320334434509,
"eai_open_web_math": 0.282223105430603,
"eai_web_code": 0.4474450349807739
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "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": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-166,781,593,710,755,300 |
weblog.lol
Personalizing your weblog
Now that you've written a blog post or two and familiarized yourself with Markdown a little, it's time to make your weblog a little more your own. We're going to do that by learning how to use your weblog's configuration page.
You can find the configuration page by visiting the main weblog.lol page. To get there:
1. Visit https://omg.lol.
2. Click "Dashboard".
3. If you have more than one omg.lol address, click the one you want to use. If not, move on to the next step.
4. Click "Weblog".
Once you're there, you should see a new blog post screen. Look below the blog post's text area for a button that says "Configuration" and click it. You'll see a text area that looks a lot like the blog post editing area. Feel free to click inside that text area and look around.
Configuration file basics
weblog.lol uses what's commonly referred to as a "configuration file" to customize your weblog. If you're used to using programs with a settings window of some kind, this is a little different: You don't click buttons or check boxes to change the settings, but instead edit text.
You might have noticed that the text you're looking at is similar to the front matter of a blog post. Front matter and the configuration file behave similarly, using pairs of setting names and values.
For instance, similar to how you set the date in a post's front matter using the setting name date and a date value:
Date: 2013-02-10 13:45
... you can set your weblog's title using the setting name Weblog name and some text:
Weblog name: A Pretty Fine Weblog
Using the configuration file, you can:
... and much more.
In case you didn't notice, there's a space between the colon and the configuration value for each setting. Make sure to keep that in there. In other words:
;; correct
Weblog name: A Pretty Fine Weblog
;; incorrect
Weblog name:A Pretty Fine Weblog
You may have just noticed some lines starting with ;;. Let's cover that.
Understanding comments
There is one other thing to know about the configuration file before we start poking around, and that's the idea of "comments."
Simply put, any line that begins with ;; or // is a comment. That means weblog.lol will ignore that line when it's deciding how to configure your weblog.
You can use comments to add notes to your configuration file to keep track of what does what or try new things out by commenting out one line and adding another that's a little different just to see what happens without forgetting what the original line looked like in case you need to switch back.
Here's an example of how you can use comments:
;; tell marketing to pick a better name for this weblog
Weblog name: A Blog Full of Things You Should Buy Right Now
What if I mess something up?
If you're new to configuration files, or just a normal human being who occasionally makes a typo or forgets the right name for something, there's a chance you'll make a mistake and mess up your weblog. Or, you might just make a bunch of changes to your weblog's configuration and decide you don't like them. There are two ways to handle this:
1. You can always copy and paste your configuration file into a text editor (like Apple's Notes or Windows' Notepad) and save it. That's a good practice once you've made a few changes no matter what.
2. You can copy the original configuration file from our site repository on GitHub and get back to a completely default state.
If you need to do the latter:
1. Visit our copy on GitHub.
2. Click on the button that says "Raw" at the top of the configuration file text.
3. Select all the text and copy it.
4. Paste the text back into your configuration file on weblog.lol.
Now that you know how to get back to a good state you can start poking around a little without worrying too much.
Personalize your weblog's title
Your weblog's title is the simplest thing to change in your configuration that you'll be able to observe immediately. It's also the very first option you can set in the configuration file, so let's start there.
Your weblog's title is what people see at the top of the page when they visit your blog. It's also what they see in browser tabs, RSS readers, and any preview widgets on social media. To set it:
1. Look for the line that reads Weblog title: weblog.lol
2. Change the text after Weblog title: to your weblog's title.
3. Click "Save & Publish"
You'll get a notification that your weblog is rebuilding. It might take a little time for that to happen: Each page has to be updated with your weblog's new title.
You can see the results a couple of ways:
Either way, at the top of your page you'll see your new weblog title in the upper left of the page.
Set your weblog author and description
Just like you changed the title, you can change your weblog's author and description.
The author setting turns up in your weblog's RSS feeds, and you can also use it in your weblog templates if you want to add a byline to your blog posts, or put your name in a copyright notice.
By default it looks like this:
Author: Your Name
As with the Weblog title setting, you can modify it by changing the text after the colon.
Your weblog description is also something you won't see very often. It also shows up in your RSS feeds and can be added to templates. Some people like to use their weblog description as a subtitle in their templates, but that's a step beyond what we're trying to accomplish today.
By default, it looks like this:
Weblog description: This is a weblog.
Go ahead and change it to whatever suits you.
Set your weblog's timezone
Finally, we're going to end these very basic customizations by setting your weblog's timezone.
As we noted at the beginning of this guide, your weblog defaults to the UTC timezone. When it makes a blank post the time will reflect UTC. To get it to show your timezone, you'll need to change the Timezone setting.
To make this change, you'll first need to know what to call your timezone. Wikipedia has a helpful reference. Visit that page and scroll down to the "List" section and start looking for your country and major city in the "TZ database name" column. Once you've found it, copy the value. It will look something like America/Los_Angeles or Africa/Cairo .
By default, the configuration file looks like this:
Timezone: UTC
Replace UTC with the value you copied.
Next steps
We're going to take a break from the configuration file for now, but will be coming back to it later in this guide to change some advanced settings. You can skip ahead if you like, or move on to the next section, where we'll learn how to make a page.
|
{
"url": "https://weblog.lol/quickstart-3-personalize",
"source_domain": "weblog.lol",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "12428",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SUCX7ASUEOUD4BYVICA2HPXEL6LYXORA",
"WARC-Concurrent-To": "<urn:uuid:f1c2b01e-f827-45fe-849b-4e650d4ab8ae>",
"WARC-Date": "2023-03-22T16:38:40Z",
"WARC-IP-Address": "5.78.24.5",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QOFVYIVRWLKDQ6XOICVWBNX7JZZTS6SM",
"WARC-Record-ID": "<urn:uuid:9c6ea444-6e70-4b6c-a3c8-d69ceeb5d4c0>",
"WARC-Target-URI": "https://weblog.lol/quickstart-3-personalize",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:706d9104-b466-4511-8328-010c4d1a9fcb>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-134\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
12,
38,
39,
266,
267,
355,
356,
384,
408,
521,
542,
543,
822,
823,
849,
850,
1130,
1131,
1332,
1333,
1450,
1451,
1474,
1475,
1561,
1562,
1596,
1597,
1636,
1637,
1656,
1657,
1813,
1814,
1826,
1860,
1873,
1906,
1907,
1980,
1981,
2004,
2005,
2133,
2134,
2288,
2289,
2588,
2589,
2636,
2637,
2693,
2753,
2754,
2783,
2784,
3127,
3128,
3330,
3459,
3460,
3490,
3491,
3522,
3606,
3644,
3713,
3714,
3828,
3829,
3861,
3862,
4073,
4074,
4269,
4270,
4329,
4394,
4422,
4423,
4587,
4588,
4630,
4631,
4731,
4732,
4771,
4772,
4858,
4859,
5052,
5053,
5084,
5085,
5103,
5104,
5194,
5195,
5476,
5477,
5509,
5510,
5548,
5549,
5595,
5596,
5623,
5624,
5719,
5720,
5937,
5938,
6290,
6291,
6343,
6344,
6358,
6359,
6398,
6399,
6410,
6411
],
"line_end_idx": [
11,
12,
38,
39,
266,
267,
355,
356,
384,
408,
521,
542,
543,
822,
823,
849,
850,
1130,
1131,
1332,
1333,
1450,
1451,
1474,
1475,
1561,
1562,
1596,
1597,
1636,
1637,
1656,
1657,
1813,
1814,
1826,
1860,
1873,
1906,
1907,
1980,
1981,
2004,
2005,
2133,
2134,
2288,
2289,
2588,
2589,
2636,
2637,
2693,
2753,
2754,
2783,
2784,
3127,
3128,
3330,
3459,
3460,
3490,
3491,
3522,
3606,
3644,
3713,
3714,
3828,
3829,
3861,
3862,
4073,
4074,
4269,
4270,
4329,
4394,
4422,
4423,
4587,
4588,
4630,
4631,
4731,
4732,
4771,
4772,
4858,
4859,
5052,
5053,
5084,
5085,
5103,
5104,
5194,
5195,
5476,
5477,
5509,
5510,
5548,
5549,
5595,
5596,
5623,
5624,
5719,
5720,
5937,
5938,
6290,
6291,
6343,
6344,
6358,
6359,
6398,
6399,
6410,
6411,
6661
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6661,
"ccnet_original_nlines": 123,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4565807282924652,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008819540031254292,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16689281165599823,
"rps_doc_frac_unique_words": 0.309584379196167,
"rps_doc_mean_word_length": 4.364716053009033,
"rps_doc_num_sentences": 87,
"rps_doc_symbol_to_word_ratio": 0.0013568500289693475,
"rps_doc_unigram_entropy": 5.166841983795166,
"rps_doc_word_count": 1179,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.030703460797667503,
"rps_doc_frac_chars_dupe_6grams": 0.01982121914625168,
"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.016323359683156013,
"rps_doc_frac_chars_top_3gram": 0.02720559947192669,
"rps_doc_frac_chars_top_4gram": 0.005829770117998123,
"rps_doc_books_importance": -771.1934814453125,
"rps_doc_books_importance_length_correction": -771.1934814453125,
"rps_doc_openwebtext_importance": -466.42132568359375,
"rps_doc_openwebtext_importance_length_correction": -466.42132568359375,
"rps_doc_wikipedia_importance": -317.217529296875,
"rps_doc_wikipedia_importance_length_correction": -317.217529296875
},
"fasttext": {
"dclm": 0.3203316926956177,
"english": 0.9177026152610779,
"fineweb_edu_approx": 1.7167991399765015,
"eai_general_math": 0.3503662943840027,
"eai_open_web_math": 0.2232782244682312,
"eai_web_code": 0.20231777429580688
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,764,776,215,656,377,000 |
买小红书号在哪买？买小红书号在哪买好？
分享
举报
2023-11-12 07:07:12
优质解答
青云
已服务500+客户，累计成交380+账号
金牌顾问 - 从事抖音号出售3年
2小时前
一、小红书号的价值
1.1 小红书号的商业价值
小红书号可以作为一种商业资源，拥有大量的粉丝和用户，可以为企业带来更多的曝光和销售机会。
1.2 小红书号的个人价值
小红书号可以作为个人品牌的一种展示方式，可以展示个人的生活方式、兴趣爱好等，吸引更多的关注和认可。
1.3 小红书号的社交价值
小红书号可以作为一种社交平台，可以与更多的用户进行交流和互动，扩大社交圈子。
二、小红书号的购买方式
2.1 自主购买
可以通过自主搜索、联系卖家等方式购买小红书号，但需要注意风险和合法性问题。
2.2 第三方平台购买
可以通过一些大型的自媒体账号交易平台购买小红书号，可以更加安全和便捷。
2.3 转让平台购买
可以通过一些小红书号转让平台购买小红书号，但需要注意平台的信誉和合法性问题。
三、小红书号的购买风险
3.1 法律风险
购买小红书号需要注意相关法律法规，避免违法行为。
3.2 安全风险
购买小红书号需要注意账号的安全性，避免账号被盗或被封禁等问题。
3.3 信誉风险
购买小红书号需要注意卖家的信誉度，避免受到欺诈或虚假交易等问题。
四、小红书号的购买建议
4.1 选择正规平台购买
建议选择正规的自媒体账号交易平台或小红书号转让平台购买，可以更加安全和可靠。
4.2 注意账号的合法性
建议购买小红书号时注意账号的合法性，避免违法行为。
4.3 注意账号的安全性
建议购买小红书号后注意账号的安全性，避免账号被盗或被封禁等问题。
结语：在如今的社交媒体时代，小红书号已经成为了一种非常有价值的资源。但是，购买小红书号也需要注意相关的风险和合法性问题。因此，建议大家选择正规平台购买小红书号，并注意账号的合法性和安全性。买小红书号在哪买？选择正规平台，就能轻松购买到自己心仪的小红书号。
该回答被网友采纳
如果该回复不能解决您的需求，可 咨询答主 进行详细解答
评论(2)
热心网友
2022年9月28日 13:44:51
不错啊，我在你这里买的40级抖音号，现在都快接近45了！
热心网友
2022年9月28日 13:45:08
我看下面推荐的50级左右的账号，有的价格还不要5W呢，我算捡漏了吗
|
{
"url": "http://www.rud-gr.com/wenzhang-14-8643.html",
"source_domain": "www.rud-gr.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "27576",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CNUIAFP4UHCLLQ5OA3POBLUSPI66JTGW",
"WARC-Concurrent-To": "<urn:uuid:a8db8845-149d-4264-ac61-ef4c06c8804c>",
"WARC-Date": "2024-08-06T05:33:06Z",
"WARC-IP-Address": "103.139.1.2",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HJF6FDOGE6FN3U6ZYT75XLAGNBR5W67M",
"WARC-Record-ID": "<urn:uuid:d96771a1-4e46-48dc-b268-e274d7201cb9>",
"WARC-Target-URI": "http://www.rud-gr.com/wenzhang-14-8643.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:01aa7356-853a-4666-b611-6bfb48e6a56c>"
},
"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-150\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,
20,
21,
24,
27,
47,
52,
55,
56,
77,
78,
95,
96,
101,
102,
112,
113,
127,
128,
173,
174,
188,
189,
239,
240,
254,
255,
294,
295,
307,
308,
317,
318,
356,
357,
369,
370,
406,
407,
418,
419,
458,
459,
471,
472,
481,
482,
507,
508,
517,
518,
550,
551,
560,
561,
594,
595,
607,
608,
621,
622,
661,
662,
675,
676,
702,
703,
716,
717,
750,
751,
879,
880,
889,
917,
923,
928,
929,
949,
950,
979,
984,
985,
1005,
1006
],
"line_end_idx": [
20,
21,
24,
27,
47,
52,
55,
56,
77,
78,
95,
96,
101,
102,
112,
113,
127,
128,
173,
174,
188,
189,
239,
240,
254,
255,
294,
295,
307,
308,
317,
318,
356,
357,
369,
370,
406,
407,
418,
419,
458,
459,
471,
472,
481,
482,
507,
508,
517,
518,
550,
551,
560,
561,
594,
595,
607,
608,
621,
622,
661,
662,
675,
676,
702,
703,
716,
717,
750,
751,
879,
880,
889,
917,
923,
928,
929,
949,
950,
979,
984,
985,
1005,
1006,
1039
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1039,
"ccnet_original_nlines": 84,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004901960026472807,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9950980544090271,
"rps_doc_frac_unique_words": 0.9692307710647583,
"rps_doc_mean_word_length": 14.015384674072266,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.131731986999512,
"rps_doc_word_count": 65,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.030735459178686142,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -94.07108306884766,
"rps_doc_books_importance_length_correction": -94.07108306884766,
"rps_doc_openwebtext_importance": -58.07779312133789,
"rps_doc_openwebtext_importance_length_correction": -44.93281173706055,
"rps_doc_wikipedia_importance": -55.98253631591797,
"rps_doc_wikipedia_importance_length_correction": -55.98253631591797
},
"fasttext": {
"dclm": 0.08724982291460037,
"english": 0.0007556700147688389,
"fineweb_edu_approx": 1.3094161748886108,
"eai_general_math": 0.00288563990034163,
"eai_open_web_math": 0.02520132064819336,
"eai_web_code": 0.4309687614440918
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "384.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Telecommunication"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "9",
"label": "FAQ"
}
},
"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
|
-2,269,958,500,652,573,400 |
22
I prefer using figures created inside TeX, but I only know very labor-intensive methods. The following creates a permutation diagram for (6,3,2,4,1,5) with some colors and additional symbols.
I'm considering a project that would call for lots of these sorts of figures. Would it work to write a macro to create things like this? Any other advice for making this less painful?
\[ \begin{matrix}[cc|cccccc|c]
& & & & & & {\color{blue}\downarrow} & {\color{blue}\downarrow} & S \\ \hline
& 6 & {\color{red}\newmoon} & & & & & & {\color{red}\leftarrow} \\
{\color{blue}*} &5 & & & & & & {\color{blue}\newmoon} & \\
& 4 & & & & {\color{red}\newmoon} & & & {\color{red}\leftarrow} \\
& 3 & & {\color{red}\newmoon} & & & & & {\color{red}\leftarrow} \\
& 2 & & & \fullmoon & & & & \\
{\color{blue}*} & 1 & & & & & {\color{blue}\newmoon} & & \\ \hline
& & 1 & 2 & 3 & 4 & 5 & 6 & \\
& & {\color{red}*} & {\color{red}*} & & {\color{red}*} & & &
\end{matrix} \]
enter image description here
• The permutation diagram for (6,3,2,4,1,5) consists of the points (1,6), (2,3), (3,2), (4,4), (5,1), and (6,5). For purposes of this question, everything else is decoration (but decoration that I want to include). – Brian Hopkins Apr 21 '13 at 0:29
• And what are the rules of this decoration? (When blue/red/white, star/arrow?) – Przemysław Scherwentke Apr 21 '13 at 0:45
• Two players, red and blue, alternate selecting dots. Red moves down the right column, blue moves right to left across the top row (S is for "strategic"). The last move after the state shown will color the white dot blue, put an arrow above it on top, and an asterisk next to the 2 on the left. This illustrates an algorithm for dividing indivisible items between two players when both know the other's preferences. Blue's ranking of the six items is 1, 2, 3, 4, 5, 6, red's is 6, 3, 2, 4, 1, 5, thus the permutation diagram. More at "Taking Turns," College Math. J. 41(4) 2010 pp298-297. – Brian Hopkins Apr 21 '13 at 1:10
• Wow, thanks very much for all of the helpful answers. Although I can only accept one, I learned from all of them. – Brian Hopkins Apr 21 '13 at 20:57
18
I was tempted to use a matrix of nodes but my solution borrows from Jake's awesome code in Chinese checkers board using TikZ which effectively sets up a matrix of nodes manually.
This solution needs the tikz and the xstring packages.
The syntax
You use the code below as, for example
\drawpermutate{blue/{1/1,3/2}/left,red/{3/4,2/3}/right}
screenshot
\drawpermutate{green/{1/1,3/5,4/2}/left,orange/{3/4,2/3}/right}
enter image description here
You'll notice that each part of the argument has three parts to it:
• colour: this should be self explanatory
• {list of coordinates}: note that this needs to be grouped in its own {}, and each ordered pair (x,y) needs to be written as x/y
• left or right: this can either be left or right depending on how you want the legend to be displayed. Actually, it can either be left or anything else- if it is not left, it'll go on the right (and underneath).
The code
Here's a complete MWE that you can play with; the code is fairly detailed in its comments- it basically uses a few loops to set up the nodes, and then do the appropriate thing at each node (circle, arrow, or *).
% arara: pdflatex
% !arara: indent: {overwrite: true}
\documentclass{standalone}
\usepackage{tikz}
\usepackage{xstring}
\newcommand{\drawpermutate}[1]{%
\begin{tikzpicture}
% setup the nodes
\foreach [evaluate=\i as \x using int(\i-1)]\i in {0,1,...,8}
{
\foreach [evaluate=\j as \y using int(\j-1)] \j in {0,1,...,8}
{
% \node at (\i,\j)[name=perm-\x-\y,label=\x-\y]{};
\node at (\i,\j)[name=perm-\x-\y,]{};
}
}
% draw numbers 1 to 6 in both x and y direction
\foreach \i in {1,...,6}
{
\node at (perm-\i-0.center){\i};
\node at (perm-0-\i.center){\i};
}
\node at (perm-7-7.center){$S$};
% vertical lines
\draw ([xshift=-5mm]perm-1--1.south west)--([xshift=-5mm]perm-1-7.north west);
\draw ([xshift=-5mm]perm-7--1.south west)--([xshift=-5mm]perm-7-7.north west);
% horizontal lines
\draw ([yshift=5mm]perm--1-0.south west)--([yshift=5mm]perm-7-0.south east);
\draw ([yshift=5mm]perm--1-6.south west)--([yshift=5mm]perm-7-6.south east);
% draw user input
\foreach \mystyle/\coords/\leftorright in {#1}
{
\foreach \x/\y in \coords
{
\node[circle,fill=\mystyle,draw=\mystyle] at (perm-\x-\y){};
\IfStrEq{\leftorright}{left}{%
\node[\mystyle] at (perm--1-\y){*};
\node[\mystyle] at (perm-\x-7){$\downarrow$};
}
{% otherwise put it on the right
\node[\mystyle] at (perm-7-\y){$\leftarrow$};
\node[\mystyle] at (perm-\x--1){*};
}
}
}
\end{tikzpicture}
}
\begin{document}
%\drawpermutate{blue/{1/1,3/5,4/2}/left,red/{3/4,2/3}/right}
\drawpermutate{green/{1/1,3/5,4/2}/left,orange/{3/4,2/3}/right}
\end{document}
• Nice solution too! The possibility to choose where the decorations will go seems also to be a good decision. – Gonzalo Medina Apr 21 '13 at 2:56
10
TikZ is not mandatory:-)
enter image description here
\documentclass{article}
\usepackage{color}
\makeatletter
\def\pdiag#1{{%
\setlength\unitlength{15pt}%
\begin{picture}(10,10)(-2,-2)%
\put(0,-2){\line(0,1){10}}%
\put(7,-2){\line(0,1){10}}%
\put(-2,-0){\line(1,0){10}}%
\put(-2,7){\line(1,0){10}}%
\put(7.2,7){S}%
\count@\z@
\@for\yc:=#1\do{%
\expandafter\ycdef\yc
\advance\count@\@ne
\put(-1,\count@){\the\count@}%
\put(\count@,-1){\the\count@}%
\put(\count@,\y){\if r\c\color{red}\else\if b\c\color{blue}\fi\fi
\circle*{.3}}%
\if r\c
\put(\count@,-2){\color{red}$\ast$}%
\put(7,\y){\color{red}$\leftarrow$}%
\fi
\if b\c
\put(-2,\y){\color{blue}$\ast$}%
\put(\count@,7.1){\color{blue}$\downarrow$}%
\fi
}%
\end{picture}}}
\def\ycdef#1#2{\def\y{#1}\def\c{#2}}
\begin{document}
\pdiag{6r,3r,2x,4r,1b,5b}
\end{document}
10
enter image description here
With the Asymptote module permdiag.asy typesetting of this nice little permutation game can be completely automated. Processing of the following file permdiag-test.asy
import permdiag;
permDiag pd=permDiag(new int[]{6,3,2,4,1,5});
for(int i=1;i<=pd.n;++i){
shipout("diag"+format("%02d",i),pd.board(i));
}
with asy -f pdf permdiag-test.asy results in 6 files diag01.pdf..diag06.pdf, which were combined together with
\documentclass[a4paper]{article}
\usepackage{graphicx}
\begin{document}
\noindent%
\includegraphics[scale=1]{diag00.pdf}\quad
\includegraphics[scale=1]{diag01.pdf}\quad
\includegraphics[scale=1]{diag02.pdf}\\[10mm]
\noindent%
\includegraphics[scale=1]{diag03.pdf}\quad
\includegraphics[scale=1]{diag04.pdf}\quad
\includegraphics[scale=1]{diag05.pdf}
\end{document}
And this is the main permdiag.asy, which handles the permDiag class:
struct permDiag{
int n;
int[] perm;
int[] dotState;
int[][] tperm;
picture boardPic;
guide dotShape;
pen[] dotFill;
void drawNumbers(){
for(int i=0;i<n;++i){
label(boardPic,string(i+1),(i,-1));
label(boardPic,string(n-i),(-1,n-1-i));
}
}
void drawArrows(){
for(int i=0;i<n;++i){
if(dotState[i]>0){
if(dotState[i]==1){
label(boardPic,"$\leftarrow$",(n+0.5,tperm[i][0]-1));
}else{
label(boardPic,"$\downarrow$",(tperm[i][2]-1,n+0.5));
}
}
}
}
void drawStars(){
for(int i=0;i<n;++i){
if(dotState[i]>0){
if(dotState[i]==2){
label(boardPic,"*",(-2,tperm[i][0]-1));
}else{
label(boardPic,"*",(tperm[i][3]-1,-2));
}
}
}
}
void drawLines(){
draw(boardPic,(-2.5,-0.5)--(n+1.5,-0.5));
draw(boardPic,(-2.5,n-0.5)--(n+1.5,n-0.5));
draw(boardPic,(-0.5,-2.5)--(-0.5,n+1.5));
draw(boardPic,(n-0.5,-2.5)--(n-0.5,n+1.5));
}
void play(int hstep){
erase(boardPic);
int tmp;
int redblu=0;
for(int i=0;i<n;++i){
tperm[i][0]=perm[i];
tperm[i][4]=i+1;
}
dotState=array(n,0);
for(int i=0;i<hstep;++i){
for(int j=n-1;j>i;--j){
if(tperm[j][redblu]>tperm[j-1][redblu]){
tmp=tperm[j][redblu];
tperm[j][redblu]=tperm[j-1][redblu];
tperm[j-1][redblu]=tmp;
tmp=tperm[j][1-redblu];
tperm[j][1-redblu]=tperm[j-1][1-redblu];
tperm[j-1][1-redblu]=tmp;
}
}
dotState[i]=1+redblu;
redblu=1-redblu;
}
}
picture board(int move){
assert(move>=0 && move<=n);
// move number, 0 = initial state,
// odd - after red move
// even - after blu move
play(move);
for(int i=0;i<n;++i){
filldraw(boardPic,shift(tperm[i][5]-1,tperm[i][0]-1)*dotShape,dotFill[dotState[i]]);
}
drawNumbers();
drawArrows();
drawStars();
drawLines();
label(boardPic,"$\mathcal{S}$",(n+0.5,n+0.5));
return boardPic;
}
void operator init(int[] perm){
assert(perm.length>0);
this.n=perm.length;
this.perm=copy(perm);
this.dotState=array(n,0);
this.dotShape=scale(0.382)*unitcircle;
this.dotFill=new pen[]{lightyellow,red,blue};
this.tperm=new int[n][6];
boardPic.size(20*n);
}
}
//// Example:
//
// import permdiag;
// permDiag pd=permDiag(new int[]{6,3,2,4,1,5});
//
// for(int i=0;i<=pd.n;++i){
// shipout("diag"+format("%02d",i),pd.board(i));
// }
//
Edit: Fixed picture scaling for different values of n. Example permdiag-test2.asy:
import permdiag;
permDiag pda=permDiag(new int[]{3,1,2,4});
permDiag pdb=permDiag(new int[]{9,19,17,1,8,13,18,11,10,4,5,7,2,3,15,16,12,6,20,14});
int i;
i=3;
shipout("diag-"+format("n%d-",pda.n)+format("%02d",i),pda.board(i));
i=12;
shipout("diag-"+format("n%d-",pdb.n)+format("%02d",i),pdb.board(i));
processed with asy -f pdf permdiag-test2.asy results in two pictures, diag-n4-03.pdf and diag-n20-12.pdf:
enter image description here
enter image description here
• 2
This is above & beyond and very impressive. – Brian Hopkins Apr 22 '13 at 2:18
8
Here's a macro for you, also based on TikZ:
\documentclass{article}
\usepackage{tikz,etoolbox}
\def\bluename{blue}
\def\redname{red}
\def\circlerad{3pt}
%
\newcommand*\permdiagram[1]{%
% Loop for the first time over #1, printing the circles in
% the desired style.
\begin{tikzpicture}[x=1.5em,y=1.5em]
\foreach[count=\i from 1] \val/\hue in {#1} {
\ifdefequal{\val}{\hue}{
\draw (\i,\val) circle[radius = \circlerad];
}{
\fill[color=\hue] (\i,\val) circle[radius = \circlerad];
}
}
% Now we know how many there are. Loop again, printing the
% arrows and stars at the edges.
\let\count=\i
\foreach[count=\i from 1] \val/\hue in {#1} {
\ifdefequal{\val}{\hue}{}{
% Blue above and below, red at the left and right
\ifdefequal{\hue}{\bluename}{
\node at (\i,\count+1) {$\color{\bluename}\downarrow$};
\node at (-0.5,\val) {$\color{\bluename}*$};
}{
\node at (\count+1,\val) {$\color{\redname}\leftarrow$};
\node at (\i,-0.5) {$\color{\redname}*$};
}
}
}
% Finally, print the frame: the axis values, the lines, and "S"
\node at (\count+1,\count+1) {$S$};
\foreach \i in {1,...,\count} {
\node at (0,\i) {$\i$};
\node at (\i,0) {$\i$};
}
\draw[thick]
(-1,0.5) -- (\count+1.5,0.5)
(0.5,-1) -- (0.5,\count+1.5)
(-1,\count+0.5) -- (\count+1.5,\count+0.5)
(\count+0.5,-1) -- (\count+0.5,\count+1.5);
\end{tikzpicture}
}
\begin{document}
\permdiagram{6/red,3/red,2,4/red,1/blue,5/blue}
\end{document}
enter image description here
The macro \permdiagram takes one mandatory argument, which is a comma-separated list giving the values (in order) of your permutation, each of which is optionally separated by a slash from its color (which must be either blue or red, but these are configurable by changing \bluename or \redname). If there's no slash, an empty circle is drawn; otherwise, a solid circle of that color is drawn. You can configure the radii via \circlerad, and you can set the scale of the whole picture by editing the x=1.5em,y=1.5em option to {tikzpicture}.
I chose not to do this as a matrix because it is way too sparse, as I'm sure you noticed when asking the question. Instead, I just place the circles directly at the required coordinates, after which I know how many there are and I can draw the stuff on the boundary.
• Ah, this is nice! My answer seems useless now. – Gonzalo Medina Apr 21 '13 at 1:22
2
If you are asking if it possible to write something like
\permdiag(6,3,2,4,1,5)
and obtain a similar picture, the answer is YES. However, the addidtional rules are needed. In particular, I thought that red circles mean numbers moved up, blue -- moved down, white -- unchanged, but it is not true, because 3 not 4 is white. If these rules are easy in terms of comparing numbers, making such a macro is an exercise.
For example (this is only a sketch, without graphics and with some simple rules)
\documentclass[a4paper,11pt,leqno]{article}
\begin{document}
\newcount\pei
\newcount\peii
\newcount\peiii
\def\perm(#1,#2,#3){\pei#1 \peii#2 \peiii#3
\ifcase\pei\or100\or010\or001\fi\endgraf
\ifcase\peii\or200\or020\or002\fi\endgraf
\ifcase\peiii\or300\or030\or003\fi\endgraf
}
\perm(1,2,3)
\perm(3,1,2)
\end{document}
enter image description here
• @Werner Thank you for editing a picture. How could I achieve such a cut? – Przemysław Scherwentke Apr 21 '13 at 1:18
• 2
I recompiled the MWE, zoomed in on the important part, copy-and-pasted it using the regular "Insert image" interface (copy-and-paste have been made available since February 2013). See also How do you crop an attached PDF? – Werner Apr 21 '13 at 1:29
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://tex.stackexchange.com/questions/109830/easier-way-to-make-permutation-diagrams",
"source_domain": "tex.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "180528",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QUCEHDC6XUFTOJQGBQNSDAHUS7NCCIXX",
"WARC-Concurrent-To": "<urn:uuid:ce3b864c-ee5c-4c57-9878-db9c97b28ac8>",
"WARC-Date": "2019-07-23T01:14:55Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OVOEMXMY7EMPW3LTBWEZFPJBIRKFCAJY",
"WARC-Record-ID": "<urn:uuid:a5d22d60-597f-47c2-b3a8-baabb8387059>",
"WARC-Target-URI": "https://tex.stackexchange.com/questions/109830/easier-way-to-make-permutation-diagrams",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:92796d83-f3f1-4f87-a1fa-393734a2058f>"
},
"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-137-111-185.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,
3,
4,
196,
197,
381,
382,
415,
495,
565,
629,
699,
768,
801,
869,
900,
962,
978,
979,
1008,
1009,
1261,
1387,
2014,
2168,
2171,
2172,
2351,
2352,
2407,
2408,
2419,
2420,
2459,
2460,
2516,
2517,
2528,
2529,
2593,
2594,
2623,
2624,
2692,
2693,
2737,
2869,
3084,
3085,
3094,
3095,
3307,
3308,
3326,
3362,
3389,
3390,
3408,
3429,
3430,
3463,
3487,
3513,
3583,
3593,
3668,
3682,
3754,
3808,
3822,
3832,
3833,
3889,
3922,
3932,
3977,
4022,
4032,
4073,
4074,
4099,
4186,
4273,
4300,
4385,
4470,
4471,
4497,
4552,
4562,
4600,
4614,
4691,
4738,
4794,
4860,
4878,
4927,
4993,
5049,
5067,
5081,
5082,
5092,
5093,
5115,
5117,
5118,
5135,
5136,
5197,
5198,
5262,
5263,
5278,
5427,
5430,
5431,
5456,
5457,
5486,
5487,
5511,
5530,
5544,
5545,
5561,
5590,
5621,
5649,
5677,
5706,
5734,
5750,
5761,
5779,
5801,
5821,
5852,
5883,
5949,
5982,
5990,
6027,
6064,
6068,
6076,
6109,
6154,
6158,
6161,
6177,
6178,
6215,
6232,
6233,
6259,
6260,
6261,
6276,
6279,
6280,
6309,
6310,
6478,
6479,
6496,
6542,
6543,
6569,
6617,
6619,
6620,
6731,
6732,
6765,
6787,
6804,
6815,
6859,
6903,
6949,
6960,
7004,
7048,
7087,
7102,
7103,
7172,
7173,
7190,
7199,
7213,
7231,
7248,
7249,
7269,
7287,
7304,
7305,
7327,
7353,
7395,
7441,
7447,
7451,
7452,
7473,
7499,
7524,
7552,
7616,
7631,
7695,
7707,
7717,
7723,
7728,
7729,
7749,
7775,
7800,
7828,
7878,
7893,
7943,
7955,
7965,
7971,
7976,
7977,
7997,
8043,
8091,
8137,
8185,
8189,
8190,
8191,
8215,
8236,
8249,
8267,
8293,
8320,
8349,
8355,
8381,
8411,
8441,
8490,
8522,
8569,
8603,
8637,
8688,
8734,
8744,
8752,
8780,
8803,
8809,
8813,
8814,
8841,
8873,
8932,
8980,
9028,
9044,
9077,
9168,
9174,
9193,
9211,
9228,
9245,
9296,
9317,
9321,
9322,
9356,
9383,
9407,
9433,
9463,
9506,
9556,
9586,
9611,
9615,
9618,
9619,
9633,
9636,
9657,
9707,
9710,
9740,
9792,
9798,
9801,
9802,
9885,
9886,
9903,
9946,
10032,
10039,
10044,
10113,
10119,
10188,
10189,
10295,
10296,
10325,
10326,
10355,
10356,
10362,
10445,
10447,
10448,
10492,
10493,
10517,
10518,
10545,
10546,
10566,
10584,
10604,
10605,
10608,
10638,
10699,
10722,
10761,
10811,
10842,
10895,
10904,
10969,
10977,
10983,
11047,
11084,
11102,
11152,
11185,
11243,
11281,
11347,
11406,
11417,
11484,
11544,
11554,
11562,
11568,
11636,
11676,
11712,
11742,
11772,
11778,
11795,
11830,
11865,
11914,
11964,
11984,
11986,
12003,
12004,
12052,
12053,
12068,
12069,
12098,
12099,
12640,
12641,
12908,
12909,
12996,
12998,
12999,
13056,
13057,
13080,
13081,
13415,
13416,
13497,
13498,
13542,
13543,
13560,
13561,
13575,
13590,
13606,
13607,
13651,
13692,
13734,
13777,
13779,
13780,
13793,
13794,
13807,
13822,
13823,
13852,
13853,
13974,
13980,
14234,
14235,
14247,
14248,
14348,
14349
],
"line_end_idx": [
3,
4,
196,
197,
381,
382,
415,
495,
565,
629,
699,
768,
801,
869,
900,
962,
978,
979,
1008,
1009,
1261,
1387,
2014,
2168,
2171,
2172,
2351,
2352,
2407,
2408,
2419,
2420,
2459,
2460,
2516,
2517,
2528,
2529,
2593,
2594,
2623,
2624,
2692,
2693,
2737,
2869,
3084,
3085,
3094,
3095,
3307,
3308,
3326,
3362,
3389,
3390,
3408,
3429,
3430,
3463,
3487,
3513,
3583,
3593,
3668,
3682,
3754,
3808,
3822,
3832,
3833,
3889,
3922,
3932,
3977,
4022,
4032,
4073,
4074,
4099,
4186,
4273,
4300,
4385,
4470,
4471,
4497,
4552,
4562,
4600,
4614,
4691,
4738,
4794,
4860,
4878,
4927,
4993,
5049,
5067,
5081,
5082,
5092,
5093,
5115,
5117,
5118,
5135,
5136,
5197,
5198,
5262,
5263,
5278,
5427,
5430,
5431,
5456,
5457,
5486,
5487,
5511,
5530,
5544,
5545,
5561,
5590,
5621,
5649,
5677,
5706,
5734,
5750,
5761,
5779,
5801,
5821,
5852,
5883,
5949,
5982,
5990,
6027,
6064,
6068,
6076,
6109,
6154,
6158,
6161,
6177,
6178,
6215,
6232,
6233,
6259,
6260,
6261,
6276,
6279,
6280,
6309,
6310,
6478,
6479,
6496,
6542,
6543,
6569,
6617,
6619,
6620,
6731,
6732,
6765,
6787,
6804,
6815,
6859,
6903,
6949,
6960,
7004,
7048,
7087,
7102,
7103,
7172,
7173,
7190,
7199,
7213,
7231,
7248,
7249,
7269,
7287,
7304,
7305,
7327,
7353,
7395,
7441,
7447,
7451,
7452,
7473,
7499,
7524,
7552,
7616,
7631,
7695,
7707,
7717,
7723,
7728,
7729,
7749,
7775,
7800,
7828,
7878,
7893,
7943,
7955,
7965,
7971,
7976,
7977,
7997,
8043,
8091,
8137,
8185,
8189,
8190,
8191,
8215,
8236,
8249,
8267,
8293,
8320,
8349,
8355,
8381,
8411,
8441,
8490,
8522,
8569,
8603,
8637,
8688,
8734,
8744,
8752,
8780,
8803,
8809,
8813,
8814,
8841,
8873,
8932,
8980,
9028,
9044,
9077,
9168,
9174,
9193,
9211,
9228,
9245,
9296,
9317,
9321,
9322,
9356,
9383,
9407,
9433,
9463,
9506,
9556,
9586,
9611,
9615,
9618,
9619,
9633,
9636,
9657,
9707,
9710,
9740,
9792,
9798,
9801,
9802,
9885,
9886,
9903,
9946,
10032,
10039,
10044,
10113,
10119,
10188,
10189,
10295,
10296,
10325,
10326,
10355,
10356,
10362,
10445,
10447,
10448,
10492,
10493,
10517,
10518,
10545,
10546,
10566,
10584,
10604,
10605,
10608,
10638,
10699,
10722,
10761,
10811,
10842,
10895,
10904,
10969,
10977,
10983,
11047,
11084,
11102,
11152,
11185,
11243,
11281,
11347,
11406,
11417,
11484,
11544,
11554,
11562,
11568,
11636,
11676,
11712,
11742,
11772,
11778,
11795,
11830,
11865,
11914,
11964,
11984,
11986,
12003,
12004,
12052,
12053,
12068,
12069,
12098,
12099,
12640,
12641,
12908,
12909,
12996,
12998,
12999,
13056,
13057,
13080,
13081,
13415,
13416,
13497,
13498,
13542,
13543,
13560,
13561,
13575,
13590,
13606,
13607,
13651,
13692,
13734,
13777,
13779,
13780,
13793,
13794,
13807,
13822,
13823,
13852,
13853,
13974,
13980,
14234,
14235,
14247,
14248,
14348,
14349,
14439
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14439,
"ccnet_original_nlines": 425,
"rps_doc_curly_bracket": 0.02784126065671444,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18297767639160156,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006622519809752703,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5298013091087341,
"rps_doc_frac_unique_words": 0.470144122838974,
"rps_doc_mean_word_length": 6.170898914337158,
"rps_doc_num_sentences": 141,
"rps_doc_symbol_to_word_ratio": 0.0049055698327720165,
"rps_doc_unigram_entropy": 5.978155612945557,
"rps_doc_word_count": 1457,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06328550726175308,
"rps_doc_frac_chars_dupe_6grams": 0.04137470945715904,
"rps_doc_frac_chars_dupe_7grams": 0.028917809948325157,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008008009754121304,
"rps_doc_frac_chars_top_3gram": 0.018685350194573402,
"rps_doc_frac_chars_top_4gram": 0.022244470193982124,
"rps_doc_books_importance": -1991.1370849609375,
"rps_doc_books_importance_length_correction": -1991.1370849609375,
"rps_doc_openwebtext_importance": -1213.515625,
"rps_doc_openwebtext_importance_length_correction": -1213.515625,
"rps_doc_wikipedia_importance": -1064.2852783203125,
"rps_doc_wikipedia_importance_length_correction": -1064.2852783203125
},
"fasttext": {
"dclm": 0.16929173469543457,
"english": 0.650658130645752,
"fineweb_edu_approx": 1.2531219720840454,
"eai_general_math": 0.9749071002006531,
"eai_open_web_math": 0.8745972514152527,
"eai_web_code": 0.5600303411483765
}
}
|
{
"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": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,155,714,368,878,977,500 |
Subscribe to GameFromScratch on YouTube Support GameFromScratch on Patreon
8. August 2014
I write a great many tutorials targeting newer developers and as a direct result I am exposed to a fair number of programming related questions. I don’t mind in the least by the way, it’s why I run this site.
However, I notice one very common thread among those questions…
They often could have been solved with just a few minutes in the debugger.
Then it dawned on me. Lots of newer programmers likely don’t know all that much about debugging. Many are probably resorting to printing to the console to see how their program works. For good reason too… if you pick up say… a C++ book, it’s about the language, not the tooling. Of course, there are dedicated books such as Beginning Visual C++ 2013 or the Eclipse IDE: Pocket Guide, but these tend not to be books beginners start with. Hell, for someone just starting out, figuring out where the language begins and the IDE ends is challenging enough!
Which is all a shame, as basic debugging skills will make your life a hell of a lot easier. Not only will it make solving problems much easier, but it will help a great deal in understanding how your language works. Plus the most tragic part of all, it’s actually very simple and often incredibly consistent across tools and programming languages.
So, if you have no prior debugging experience, give me 20 minutes of your time. I guarantee you it will be worthwhile, or your money back!
I am going to use a couple different languages/IDEs int this tutorial, but as you will see, the process is remarkably similar regardless to what language you use. I am primarily going to start with Visual Studio, then illustrate how you can perform similar actions in other environments. First a quick glossary of terms you are going to hear.
Glossary of terms
These are a few of the terms we are going to be covering during this tutorial. Don’t worry over much if the following descriptions don’t make a lot of sense, it should be clearer by the time you finish.
Breakpoint
This one is critical, these are instructions that tell your code HEY, STOP RUNNING, I WANT TO LOOK AT SOMETHING HERE! We will be using breakpoints extensively. You can generally add/remove/enable/disable breakpoints.
Watch
This one is incredibly well named. Basically these are variables you’ve said you want to keep a watch on the value of.
Local
Think of these like Watch expressions the IDE automatically made for you. Basically every variable in local scope will be listed as a local. Not all IDEs do this, but most do.
Expression Evaluation
This is powerful. Basically you can type some code and see what result it returns, while your code is running. Generally you do this once a breakpoint has been hit causing your code to pause and your debugger to be shown.
Call Stack
This is the hierarchy of function calls you are currently in. For example, if you called myFunc() from main(), your callstack would look like
myFunc()
main().
Don’t worry, this should make sense shortly.
C++ and Visual Studio Debugger
I am going to start with Visual Studio/Visual C++ then show other platforms later on. Once again, most of the process you see here is applicable to other environments.
Let’s start with this ultra simple code example:
void someFunction(int & inValue)
{
inValue = 43;
}
int main(int argc, char ** argv)
{
int i = 42;
someFunction(i);
return 0;
}
The code is extremely simple. We create a simple int, assign it a value, then pass it into a function that will assign it a different value. Now time to do some basic debugging.
The first thing you need to do is start debugging. In Visual Studio, there are a couple ways to do this. First thing, in C++, you need to tell it that you are building for debugging. You see, when you make a debug build a few different things happen. There are little bits of information added to your code that make the debugger work. There are some other changes too, like memory being zeroed out, but those are beyond what we are talking about here. The take away is, you need to build for debugging, then run the debugger, although generally this task is one and the same for you the developer.
From the Visual Studio toolbar, you can do both:
image
Or, you can run from the Debug menu:
image
As you can see, F5 is also an option. It’s worth noting, debug code generally runs a bit slower and bigger, so when you are finished development, you want to compile for release.
Ok, so that’s how we start the debugger, but in this code sample, it will simply start, run, then finish. That’s not very exciting.
Enter the breakpoint!
Ok, now we are going to enter the wonderful world of breakpoints, your new best friends. Let’s start by setting a breakpoint on our first line, where we declare i. There are a number of ways of setting a breakpoint. In the IDE you can right click the line of code you want to break on then select Breakpoint –> Insert Breakpoint, like so:
image
… for the sake of this tutorial, please just ignore Tracepoints, at least for now.
You can also set a breakpoint in the Debug menu, using Toggle Breakpoint, or by hitting F9:
image
The line of code you just set a breakpoint on should now have a red bullet in the margin:
image
Go ahead and press F5 to debug your program. Things will go much differently this time, your code will stop executing on the line with the breakpoint. You can hover your mouse over a variable to see it’s value:
image
In this case, you will see that the value is gibberish. This is because i hasn’t been assigned yet. Notice the little yellow arrow on the left hand side? This is the line of code you are currently executing.
image
Stepping over the corpses of your vanquished foes
Now we need to navigate in the debugger. This is done using a couple simple commands:
image
Step Into, Step Over and Step Out. These are also available in the toolbar:
image
As you can see, you can also use the hotkey F11 and F10. These keys change from program to program... if they didn’t, that would just make life too easy, wouldn’t it?
Now as to what these do…
Step Into, steps into the currently running line of code. For example, if you are on a function, it will step into that function. I will show this in a second.
Step Over jumps to the next line of code in the same scope. Step out, jumps up on the callstack. Again, I will explain this in a second.
So what we want to do now is Step Over, and now it should look like this:
image
The little yellow arrow will now have advanced to the next line of code. Notice now if we hover over the value of i, it is now 42 like we would have expected. That is because the line of code has now executed. This is a very important thing to realize… the line of code your breakpoint stopped on hasn’t executed yet. So if you want to see what value is assigned to a variable, you generally want to set the breakpoint to the next line of code.
Now we want to “Step Into” the current line of code. That is, we want to see what happens when someFunction() executes. If we chose “Step Over”, we would jump to the next line ( return 0; ). There is another important thing to realize here… even if you Step Over some code, it is still being run like normal, it just isn’t showing you it in the debugger. That said, we want to see someFunction() in action, so choose Step Into or choose this icon:
image
Now the line of code jumps to the beginning of someFunction():
image
You can hover over parameters to see their value:
image
You can continue stepping in and over code like normal, or if you are done looking at someFunction ( or some other function someFunction calls ), you can choose Step Out to jump up on the callstack.
image
Callstack me, maybe? No, I didn’t just make that pun did I?
Callstack… there’s that word again. Now that we are actually in a bit of a call stack, let’s take a look at what I mean.
In Visual Studio, make sure the CallStack window is being shown. This is controlled using Debug->Window->CallStack or CTRL + ALT + C like so:
image
A window like the following should appear:
image
The key to the name is “STACK”. Think about it like a stack of plates at a cafeteria. Each time a function is called, it’s like putting a plate on the stack. The bottom most plate/function is the oldest, while the top most is the newest. In this case, the call stack tells us that on line 9, in the function main, we called someFunction() and are currently running on line 2. Speaking of “lines”, you have the option of toggling them on or off in Visual Studio ( and most other IDEs ).
The process of toggling line numbers on/off, isn’t incredibly straight forward. That said, line numbers can be incredibly handy, so lets do it. First select the menu Tools->Options…
image
Then in the resulting dialog on the left hand side scroll down until you find Text Editor->C/C++->General, then click the checkbox next to Line Numbers. Obviously if you are using Visual Studio and a language other than C++, you need to pick the appropriate language:
image
Now line numbers will be displayed next to your code:
image
Ok… back to the callstack. Double clicking an entry in the callstack brings you to that line of code. In this trivial example, the utility is questionable. However, when working with a real project, where the callstack might span multiple source files, it becomes a very quick and easy way to jump between source files and for seeing how you ended up where you are. This obviously is a hell of a lot more useful when someFunction() is possible called from thousands of different locations for example.
Locals, no more witty titles after that last witless one…
Now let’s take a look at locals, a concept I mentioned earlier. This is basically all the local ( non-global ) functions in the current scope. While debugging inside someFunction, like so:
image
Open up the locals window. Like before it can be toggled using the menu Debug->Windows->Locals:
image
Now you will have a new window, like so:
image
This is a list of all variables in the local scope. Inside someFunction() there is only one value, it’s parameter inValue. Here you can see that the current value is 42 and it’s data type is int reference. As you step through someFunction, as values chance, they will be updated in the locals window.
Step out of someFunction ( Shift + F11, or using the icon or menus listed above ), and you will see the locals change to those of main():
image
Now you see something somewhat unique to C and C++ ( and other languages with direct memory management ). The value passed in, argv, is a pointer to a pointer of type char. This is to say, it points to a pointer that points to the memory address of a char data type. If that is greek to you at this point, don’t worry about it. You will notice though that the locals window has done a couple very cool things.
First, you see a hex value:
image
This is the actual address of the pointer in memory. After all, that is what pointers actually are, locations in memory. This is incredibly useful in debugging, even if you yourself don’t use pointers, code you depend on might. Look out for values like 0x0000000 or 0xFFFFFFFF. If you look at the value of a pointer and it’s one of those values, your object wasn’t allocated or has been deleted. These are some of the most common bugs you will find in C++ code.
The other neat thing that visual studio did was this:
image
The debugger was actually smart enough to go look at the data actually stored at the memory address this pointer points at. Very handy. You may also notice the triangle to the left of argv. This is because there is more information available. We will see this a bit more later.
Ok, now what?
So… what do you do once you have found what you were looking for? You have a couple options. Here they are from the debug toolbar:
image
Or using the following commands from the Debug menu:
image
One thing to keep in mind, when your programming is running, the options and menu’s available in Visual Studio are different. For example, if you want to create a new project, you need to Stop Debugging before the menu options are even available.
Playing God with your Program
Ok, let’s rewind a bit and go back to the locals menu. This time we are going to use a slightly different code example.
#include <iostream>
#include <string>
class MyClass{
public:
int myInt;
std::string myString;
MyClass() :
myInt(4),
myString("Hello World"),
myPrivateInt(5)
{
}
private:
int myPrivateInt;
};
int main(int argc, char** argv)
{
MyClass myClass;
std::cout << myClass.myString;
return 0;
}
Now let’s try setting a breakpoint on the final line of main, like so:
image
If you run this code, you will see:
image
You will have to ALT+TAB over to it, since debugger has given focus to Visual Studio.
Now lets look at some of the funky things you can do to a running program. Now let’s set another breakpoint, this one on the cout line. Remember, the code on the line you’ve breakpointed hasn’t been run yet!
image
Now restart or debug your program again. It will hit the first breakpoint right away. Now go look at the locals window again:
image
As you can see, data types composed of other data types, like myClass can be expanded to show all the other values that compose it. Now let’s do something kinda neat.
You can change the values of a program as it is running. Sorta… For basic data types, it’s extremely straight forward. For example, to change the value of myInt while debugging, simply right click it in the locals window and select Edit Value, like so:
image
You can now change the value:
image
From this point on ( during this debug session ), that value is now 42. Of course, if the value is changed in code, it will of course be updated. This allows you to tweak values interactively and see how it will affect your program’s execution.
With objects however, it is slightly more complicated. In the previous case, we edited myInt which is a member of myClass. But we couldn’t simply edit MyClass directly, as the debugger has no idea how. Therefore you can’t just right click myString and select edit. The debugger simply doesn’t know how to edit this data type ( this isn’t true for non-C++ languages ). You can however modify the values that make up the string, like so:
image
As you can see, myString is of type std::basic_string, which is composed of an array of character values that make up the string. So we can edit the character values to say… lower case our string.
image
Once again, Visual Studio is smart enough to understand the datatype. So we could either enter the value ‘w’ or the ascii code 119. Now if you continue execution of your program it will automatically run to the next breakpoint. And if you look at the output, you should see:
image
One very important thing to note here… all of these changes are temporary. They only last as long as the current debugging session. The next time you run your program, it will run like normal.
I’m sick of these damned breakpoints
In that last example, when we selected Continue, we jumped to the next breakpoint, like so:
image
As you add more and more breakpoints to your code, they can make stepping through it incredibly annoying. So, what can we do about that?
Well the first thing we can do is disable it. Right click the red dot and select Disable Breakpoint, or select the line and hit CTRL + F9
image
And the breakpoint will be disabled. Now it will show up as a hollow circle:
image
This allows you to re-enable it later, but until you do, the debugger will completely ignore the breakpoint. You can re-enable it the same way you disabled it. Right clicking and selecting enable, or by hitting CTRL + F9.
You can also remove a breakpoint complete in a couple ways. First you single left click the red dot, and it will be removed. The F9 key will also toggle a breakpoint on and off completely. You can also right click and select Delete Breakpoint ( see shot above ).
Sometimes you want to remove or disable/enable them all at once. You can do this using the debug menu:
image
Breakpoints are your friend, learn to love them!
I’m Watching You!
Now we are going to look at two final concepts, watches and expressions. Let’s start with watches.
Until this point, we’ve only been able to look at variables declared in the local scope. That’s all well and good, but what happens when we want to watch a value declared in a different scope? Don’t worry, the debugger’s got you covered!
Consider this simple code example and breakpoint:
image
At this point in execution, your locals will look like:
image
That said, stringInADifferentScope has already been declared and allocated… how would you look at this value?
Well, there are two ways. As you may be able to guess from the preamble, they are watches and expressions. A watch is a variable you are keeping an eye on, even if its not currently local. You can set a watch while debugging code by right clicking the variable and selecting Add Watch:
image
Now you can look at watches in the watch window using the menu Debug->Windows->Watch->Watch 1 ( or CTRL+ALT+W then 1 ). You can have up to 4 sets of Watch windows in Visual Studio. Now you can inspect the value of watched variables at any time:
image
If you watch a variable that isn’t in scope, it tells you:
image
When the variable notInScope comes back in scope, it’s value can be retrieved by hitting the refresh icon.
The other option is Evaluate Expression, which is called QuickWatch in Visual Studio. It’s an incredibly cool feature. You can invoke QuickWatch while debugging by right clicking and selecting QuickWatch… or by pressing Shift + F9.
image
This opens a dialog that allows you to enter whatever value you want into the Expression tab, then press Re-Evaluate and it will look up the value:
image
The Add Watch button allows you to add the selected Expression to the watch window we just saw.
The cool thing about this you can actually call some functions on your object and get the results:
image
On One Condition
Back to breakpoints for a second, then I am done I promise.
Consider the following code sample:
image
This is a very common bug scenario, but you really don’t want to run through the debugger 100K times do you? Generally with these kinds of errors, its only the last couple of iterations you want to look at. Fortunately we have something called a conditional breakpoint. This, as the name suggests, will only break if a certain condition is met.
Add a breakpoint like normal. Add it to the line inside of the loop. Now right click the red dot and selection Condition…
image
Now you can set the condition you will break on.
image
The breakpoint icon will now have a white plus in it:
image
Next time you run the code, it will only trip when the condition is hit:
image
Unfortunately, in Visual Studio, conditional breakpoints can make your code ungodly slow, so only use them when absolutely required. In other languages and IDEs, this isn’t always the case. I honestly think this is a bug in Visual Studio, as the above code should not require several seconds to evaluate, even with the additional overhead.
One of the keys to happiness is a bad memory
One other thing that can be incredibly useful, especially in C++ is to look at a location in memory. This functionality isn’t always available, depending on the language you are using. In Visual C++, it’s incredibly easy and useful. In the previous example, we filled an array of char with 100K exclamation marks ( at least, once we remove the = sign from <= :) ). Let’s say we wanted to look at memory for data.
In the Debug->Windows menu, select Memory->Memory 1
image
A window will open up like this:
image
That is showing what’s in memory, starting at the address 0x00287764. What you want is the address of the variable data. In the address box enter the value &data. (For non-C++ programmers reading this, & is the address of operator, which returns the memory location of a variable ).
Now you will see:
image
As you can see, data is located at 0x006D781C and is full of exclamation marks ( shown on the right ), which is represented by ascii character code 21 ( as shown on the left ). Looking at memory can often help you find nasty bugs.
Debugging in other languages/IDEs
The instructions above were obviously C++ and Visual Studio related, but you will find other than the windows looking a bit different, some slightly different names and different hot keys, the process is almost identical. Instead of going through the same process for every language, I will instead point out where all of these things are located or what they are called.
Java in Eclipse
Starting/Stopping:
Just like in Visual Studio, there is both a debug and run mode. In order to debug in Eclipse you need to run using debug. There is a menu option available:
image
You can also right click your project in the Package Explorer and select Debug As->Java Application.
image
Or using the Debug icon in the toolbar:
image
When you debug in Eclipse, you will be prompted to open in Debug perspective:
image
A perspective is simply a collection of windows and toolbars to accomplish a given task… such as debugging. You can switch between perspectives using the top bar:
image
Or using the menu Window->Open Perspective.
Setting a Breakpoint:
You can set a breakpoint in a number of ways in Eclipse. In a source window, you can right click the side column and select Toggle Breakpoint ( or CTRL+SHIFT+B ). This adds a breakpoint, or removes on if there is one currently added.
image
You can also toggle a breakpoint using the Run menu:
image
Step Into/Step Over/Step Out:
While running in Debug perspective, you can perform stepping using the toolbar:
image
You can also resume and stop your program using this toolbar. The icons are Step In, Stop Over and Step Out, from left to right.
You can also step using the Run Menu:
image
You can also use F5/F6/F7 to control stepping.
Watch Window
In Eclipse, Locals and Watch are in the same view, “Variables”.
image
Variables should be available automatically when you launch into Debug perspective. However you can also open It using the menu Window->Show View->Variables. Or Alt+Shift+Q, then V.
image
Local Window:
See above.
Evaluate Expression:
Evaluate expression is called “Expressions” in Eclipse and is available using the same menu you used to open Variables.
image
Once again, you can dynamically execute code and see the results using Expressions.
Conditional Breakpoints
To set a conditional breakpoint in Eclipse, add a breakpoint like normal. Then right click the dot and select Breakpoint Properties:
image
Then in the resulting dialog, check condition and enter your condition logic in the box below:
image
JavaScript in Chrome
Starting/Stopping:
In Chrome ( and other browsers, IE, Opera, Safari and Firefox are all very similar in functionality ), there is no such thing as debug or release, unless I suppose you count minified code. Simply set a breakpoint in your JavaScript and refresh the page. You will however have to open Developer Tools to be able to set a breakpoint. Do this by clicking the Chrome menu button, selecting Tools->Developer Tools
image
Or as you can see above, press F12 or Ctrl + Shift + I. Memorize that key combo, trust me…
Setting a Breakpoint:
To set a breakpoint, in the go to a source file:
image
Then in the source listing, right click on the left column and select Add Breakpoint:
image
… bet you can guess how to set a Conditional Breakpoint… ;)
You can also toggle a breakpoint using CTRL + B.
Step Into/Step Over/Step Out:
Step Over: F10
Step Into: F11
Step Out: Shift + F11
Or you can use the toolbar:
image
Watch Window
Window is located on the right hand side of the developer tools and is called Watch Expressions:
image
Expressions and Watches are combined into the same interface. You can simply add a new one by clicking the + icon, then type code accordingly:
image
Local Window:
Called Scope Variables in Chrome. Located in same area:
image
Evaluate Expression:
See watch above.
Conditional Breakpoints:
Just like adding a regular breakpoint, but instead choose Conditional Breakpoint.
image
Then type your conditional logic code:
image
WebStorm / JavaScript
Ok.. I’m just being lazy here. I remember I already wrote an article about debugging in WebStorm… recycling is good, no? ;)
Debugging your app in WebStorm
It actually covers 100% of what we just talked about above, except of course the memory view, as it isn’t applicable.
Ok, Done talking now
As you can see, across tools the experience is very similar. Some IDEs are worse ( Xcode… ), some are very limited ( Haxe in FlashDevelop ), but generally the process is almost always exactly the same. Of course, I only looked at a couple IDEs but you will find the experience very consistent in several different IDEs. It’s mostly a matter of learning a few new hotkeys and window locations.
One area that is massively different in command line debuggers, such as gdb. You are still doing basically the same things, just no nice UI layer over top. A discussion of gdb debugging is way beyond the scope of this document and there’s tons of information out there. Heck, there are books written on the subject!
Hopefully that process was useful to you. A while back I posted an example where the debugger saved my ass if you want to see this actual process in action. Debugging should be a part of your development process, it will make your life a hell of a lot easier, and your hair a hell of a lot less white.
Let me know if that wasn’t very clear, this tutorial may actually require a step by step video companion to go along with it. If so, please let me know.
Programming
blog comments powered by Disqus
See More Tutorials on DevGa.me!
Month List
|
{
"url": "https://www.gamefromscratch.com/post/2014/08/08/Debugging-101-tutorial-or-How-to-bring-sanity-to-an-insane-world.aspx",
"source_domain": "www.gamefromscratch.com",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "106429",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L6QDGDBXU5U525O3RS76ANPDZ6UYAPX4",
"WARC-Concurrent-To": "<urn:uuid:2190c85d-c48d-43a9-a6fc-5ee0609eca58>",
"WARC-Date": "2018-10-23T19:22:30Z",
"WARC-IP-Address": "104.31.77.138",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:R2SQZ2HRXJS3XYJVTIQHC6N5E3P3RDUK",
"WARC-Record-ID": "<urn:uuid:9384d6ba-4192-419d-832a-3db64522fb9c>",
"WARC-Target-URI": "https://www.gamefromscratch.com/post/2014/08/08/Debugging-101-tutorial-or-How-to-bring-sanity-to-an-insane-world.aspx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:241bec9d-6ad0-4cfe-9c9d-281e433a6b1d>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-43-223-53.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
75,
90,
91,
93,
94,
304,
305,
307,
308,
372,
373,
375,
376,
451,
452,
454,
455,
1014,
1015,
1017,
1018,
1368,
1369,
1371,
1372,
1512,
1513,
1515,
1516,
1518,
1519,
1864,
1865,
1867,
1868,
1870,
1871,
1889,
1890,
1892,
1893,
2097,
2098,
2100,
2101,
2112,
2113,
2332,
2333,
2335,
2336,
2342,
2343,
2463,
2464,
2466,
2467,
2473,
2474,
2652,
2653,
2655,
2656,
2678,
2679,
2903,
2904,
2906,
2907,
2918,
2919,
3062,
3063,
3072,
3073,
3081,
3082,
3084,
3085,
3130,
3131,
3133,
3134,
3136,
3137,
3168,
3169,
3171,
3172,
3341,
3342,
3344,
3345,
3394,
3395,
3428,
3430,
3448,
3450,
3451,
3484,
3486,
3502,
3523,
3537,
3539,
3540,
3542,
3543,
3721,
3722,
3724,
3725,
4331,
4332,
4334,
4335,
4384,
4385,
4391,
4392,
4429,
4430,
4436,
4437,
4439,
4440,
4620,
4621,
4623,
4624,
4757,
4758,
4760,
4761,
4763,
4764,
4786,
4787,
4789,
4790,
5132,
5133,
5139,
5140,
5142,
5143,
5226,
5227,
5229,
5230,
5322,
5323,
5329,
5330,
5332,
5333,
5423,
5424,
5426,
5427,
5433,
5434,
5436,
5437,
5650,
5651,
5653,
5654,
5660,
5661,
5663,
5664,
5875,
5876,
5882,
5883,
5885,
5886,
5936,
5937,
5939,
5940,
5942,
5943,
6030,
6031,
6033,
6034,
6040,
6041,
6043,
6044,
6121,
6122,
6128,
6129,
6297,
6298,
6300,
6301,
6326,
6327,
6489,
6490,
6630,
6631,
6633,
6634,
6708,
6709,
6715,
6716,
6718,
6719,
7168,
7169,
7171,
7172,
7624,
7625,
7627,
7628,
7634,
7635,
7637,
7638,
7701,
7702,
7704,
7705,
7711,
7712,
7714,
7715,
7765,
7766,
7772,
7773,
7775,
7776,
7975,
7976,
7978,
7979,
7985,
7986,
7988,
7989,
7991,
7992,
8053,
8054,
8056,
8057,
8059,
8060,
8182,
8183,
8185,
8186,
8329,
8330,
8336,
8337,
8339,
8340,
8383,
8384,
8390,
8391,
8393,
8394,
8885,
8886,
8888,
8889,
9073,
9074,
9080,
9081,
9083,
9084,
9353,
9354,
9356,
9357,
9363,
9364,
9366,
9367,
9421,
9422,
9428,
9429,
9431,
9432,
9938,
9939,
9941,
9942,
9944,
9945,
10003,
10004,
10006,
10007,
10198,
10199,
10201,
10202,
10208,
10209,
10211,
10212,
10309,
10310,
10312,
10313,
10319,
10320,
10322,
10323,
10364,
10365,
10367,
10368,
10374,
10375,
10377,
10378,
10683,
10684,
10686,
10687,
10825,
10826,
10828,
10829,
10835,
10836,
10838,
10839,
10841,
10842,
11256,
11257,
11259,
11260,
11288,
11289,
11291,
11292,
11298,
11299,
11301,
11302,
11304,
11305,
11772,
11773,
11775,
11776,
11830,
11831,
11833,
11834,
11840,
11841,
11843,
11844,
12126,
12127,
12129,
12130,
12132,
12133,
12147,
12148,
12150,
12151,
12284,
12285,
12287,
12288,
12294,
12295,
12297,
12298,
12351,
12352,
12354,
12355,
12361,
12362,
12364,
12365,
12613,
12614,
12616,
12617,
12619,
12620,
12650,
12651,
12653,
12654,
12775,
12776,
12778,
12779,
12799,
12817,
12818,
12833,
12841,
12856,
12882,
12883,
12899,
12918,
12952,
12976,
12982,
12988,
12989,
12998,
13020,
13023,
13055,
13057,
13078,
13113,
13127,
13129,
13130,
13132,
13133,
13204,
13205,
13207,
13208,
13214,
13215,
13217,
13218,
13254,
13255,
13257,
13258,
13264,
13265,
13267,
13268,
13354,
13355,
13357,
13358,
13568,
13569,
13571,
13572,
13578,
13579,
13581,
13582,
13710,
13711,
13713,
13714,
13720,
13721,
13723,
13724,
13892,
13893,
13895,
13896,
14152,
14153,
14155,
14156,
14162,
14163,
14165,
14166,
14196,
14197,
14199,
14200,
14206,
14207,
14209,
14210,
14457,
14458,
14460,
14461,
14902,
14903,
14905,
14906,
14912,
14913,
14915,
14916,
15114,
15115,
15117,
15118,
15124,
15125,
15127,
15128,
15406,
15407,
15409,
15410,
15416,
15417,
15419,
15420,
15615,
15616,
15618,
15619,
15621,
15622,
15659,
15660,
15662,
15663,
15755,
15756,
15758,
15759,
15765,
15766,
15768,
15769,
15907,
15908,
15910,
15911,
16050,
16051,
16053,
16054,
16060,
16061,
16063,
16064,
16142,
16143,
16145,
16146,
16152,
16153,
16155,
16156,
16380,
16381,
16383,
16384,
16386,
16387,
16653,
16654,
16656,
16657,
16761,
16762,
16768,
16769,
16771,
16772,
16821,
16822,
16824,
16825,
16843,
16844,
16846,
16847,
16947,
16948,
17188,
17189,
17191,
17192,
17242,
17243,
17245,
17246,
17252,
17253,
17255,
17256,
17312,
17313,
17315,
17316,
17322,
17323,
17433,
17434,
17436,
17437,
17726,
17727,
17729,
17730,
17736,
17737,
17739,
17740,
17987,
17988,
17990,
17991,
17997,
17998,
18057,
18058,
18060,
18061,
18067,
18068,
18070,
18071,
18178,
18179,
18181,
18182,
18417,
18418,
18420,
18421,
18427,
18428,
18430,
18431,
18579,
18580,
18582,
18583,
18589,
18590,
18592,
18593,
18689,
18690,
18692,
18693,
18792,
18793,
18795,
18796,
18802,
18803,
18805,
18806,
18808,
18809,
18826,
18827,
18829,
18830,
18890,
18891,
18927,
18928,
18930,
18931,
18937,
18938,
18940,
18941,
19289,
19290,
19292,
19293,
19417,
19418,
19420,
19421,
19427,
19428,
19430,
19431,
19480,
19481,
19483,
19484,
19490,
19491,
19493,
19494,
19548,
19549,
19551,
19552,
19558,
19559,
19561,
19562,
19635,
19636,
19638,
19639,
19645,
19646,
19648,
19649,
19992,
19993,
19995,
19996,
19998,
19999,
20044,
20045,
20047,
20048,
20465,
20466,
20468,
20469,
20521,
20522,
20528,
20529,
20531,
20532,
20565,
20566,
20572,
20573,
20575,
20576,
20863,
20864,
20866,
20867,
20885,
20886,
20888,
20889,
20895,
20896,
20898,
20899,
21131,
21132,
21134,
21135,
21137,
21138,
21172,
21173,
21175,
21176,
21549,
21550,
21552,
21553,
21555,
21556,
21558,
21559,
21575,
21576,
21578,
21579,
21598,
21599,
21757,
21758,
21764,
21765,
21866,
21867,
21873,
21874,
21876,
21877,
21917,
21918,
21924,
21925,
21927,
21928,
22006,
22007,
22013,
22014,
22016,
22017,
22181,
22182,
22188,
22189,
22233,
22234,
22236,
22237,
22239,
22240,
22262,
22263,
22499,
22500,
22506,
22507,
22560,
22561,
22567,
22568,
22570,
22571,
22601,
22602,
22682,
22683,
22689,
22690,
22820,
22821,
22823,
22824,
22862,
22863,
22869,
22870,
22917,
22918,
22920,
22921,
22934,
22935,
23000,
23001,
23007,
23008,
23010,
23011,
23195,
23196,
23198,
23199,
23205,
23206,
23208,
23209,
23223,
23224,
23235,
23236,
23238,
23239,
23260,
23261,
23381,
23382,
23388,
23389,
23473,
23474,
23476,
23477,
23501,
23502,
23636,
23637,
23643,
23644,
23739,
23740,
23746,
23747,
23749,
23750,
23752,
23753,
23774,
23775,
23777,
23778,
23797,
23798,
24210,
24211,
24217,
24218,
24220,
24221,
24313,
24314,
24316,
24317,
24339,
24340,
24389,
24390,
24396,
24397,
24399,
24400,
24486,
24487,
24493,
24494,
24554,
24555,
24604,
24605,
24607,
24608,
24638,
24639,
24654,
24655,
24670,
24671,
24693,
24694,
24696,
24697,
24725,
24726,
24732,
24733,
24735,
24736,
24738,
24739,
24752,
24753,
24850,
24851,
24857,
24858,
24860,
24861,
25005,
25006,
25012,
25013,
25015,
25016,
25030,
25031,
25088,
25089,
25095,
25096,
25098,
25099,
25120,
25121,
25138,
25139,
25141,
25142,
25167,
25168,
25250,
25251,
25257,
25258,
25297,
25298,
25304,
25305,
25307,
25308,
25330,
25331,
25333,
25334,
25459,
25460,
25462,
25463,
25494,
25495,
25497,
25498,
25616,
25617,
25619,
25620,
25641,
25642,
25644,
25645,
26041,
26042,
26044,
26045,
26364,
26365,
26367,
26368,
26672,
26673,
26675,
26676,
26830,
26831,
26843,
26844,
26845,
26877,
26878,
26910,
26911
],
"line_end_idx": [
75,
90,
91,
93,
94,
304,
305,
307,
308,
372,
373,
375,
376,
451,
452,
454,
455,
1014,
1015,
1017,
1018,
1368,
1369,
1371,
1372,
1512,
1513,
1515,
1516,
1518,
1519,
1864,
1865,
1867,
1868,
1870,
1871,
1889,
1890,
1892,
1893,
2097,
2098,
2100,
2101,
2112,
2113,
2332,
2333,
2335,
2336,
2342,
2343,
2463,
2464,
2466,
2467,
2473,
2474,
2652,
2653,
2655,
2656,
2678,
2679,
2903,
2904,
2906,
2907,
2918,
2919,
3062,
3063,
3072,
3073,
3081,
3082,
3084,
3085,
3130,
3131,
3133,
3134,
3136,
3137,
3168,
3169,
3171,
3172,
3341,
3342,
3344,
3345,
3394,
3395,
3428,
3430,
3448,
3450,
3451,
3484,
3486,
3502,
3523,
3537,
3539,
3540,
3542,
3543,
3721,
3722,
3724,
3725,
4331,
4332,
4334,
4335,
4384,
4385,
4391,
4392,
4429,
4430,
4436,
4437,
4439,
4440,
4620,
4621,
4623,
4624,
4757,
4758,
4760,
4761,
4763,
4764,
4786,
4787,
4789,
4790,
5132,
5133,
5139,
5140,
5142,
5143,
5226,
5227,
5229,
5230,
5322,
5323,
5329,
5330,
5332,
5333,
5423,
5424,
5426,
5427,
5433,
5434,
5436,
5437,
5650,
5651,
5653,
5654,
5660,
5661,
5663,
5664,
5875,
5876,
5882,
5883,
5885,
5886,
5936,
5937,
5939,
5940,
5942,
5943,
6030,
6031,
6033,
6034,
6040,
6041,
6043,
6044,
6121,
6122,
6128,
6129,
6297,
6298,
6300,
6301,
6326,
6327,
6489,
6490,
6630,
6631,
6633,
6634,
6708,
6709,
6715,
6716,
6718,
6719,
7168,
7169,
7171,
7172,
7624,
7625,
7627,
7628,
7634,
7635,
7637,
7638,
7701,
7702,
7704,
7705,
7711,
7712,
7714,
7715,
7765,
7766,
7772,
7773,
7775,
7776,
7975,
7976,
7978,
7979,
7985,
7986,
7988,
7989,
7991,
7992,
8053,
8054,
8056,
8057,
8059,
8060,
8182,
8183,
8185,
8186,
8329,
8330,
8336,
8337,
8339,
8340,
8383,
8384,
8390,
8391,
8393,
8394,
8885,
8886,
8888,
8889,
9073,
9074,
9080,
9081,
9083,
9084,
9353,
9354,
9356,
9357,
9363,
9364,
9366,
9367,
9421,
9422,
9428,
9429,
9431,
9432,
9938,
9939,
9941,
9942,
9944,
9945,
10003,
10004,
10006,
10007,
10198,
10199,
10201,
10202,
10208,
10209,
10211,
10212,
10309,
10310,
10312,
10313,
10319,
10320,
10322,
10323,
10364,
10365,
10367,
10368,
10374,
10375,
10377,
10378,
10683,
10684,
10686,
10687,
10825,
10826,
10828,
10829,
10835,
10836,
10838,
10839,
10841,
10842,
11256,
11257,
11259,
11260,
11288,
11289,
11291,
11292,
11298,
11299,
11301,
11302,
11304,
11305,
11772,
11773,
11775,
11776,
11830,
11831,
11833,
11834,
11840,
11841,
11843,
11844,
12126,
12127,
12129,
12130,
12132,
12133,
12147,
12148,
12150,
12151,
12284,
12285,
12287,
12288,
12294,
12295,
12297,
12298,
12351,
12352,
12354,
12355,
12361,
12362,
12364,
12365,
12613,
12614,
12616,
12617,
12619,
12620,
12650,
12651,
12653,
12654,
12775,
12776,
12778,
12779,
12799,
12817,
12818,
12833,
12841,
12856,
12882,
12883,
12899,
12918,
12952,
12976,
12982,
12988,
12989,
12998,
13020,
13023,
13055,
13057,
13078,
13113,
13127,
13129,
13130,
13132,
13133,
13204,
13205,
13207,
13208,
13214,
13215,
13217,
13218,
13254,
13255,
13257,
13258,
13264,
13265,
13267,
13268,
13354,
13355,
13357,
13358,
13568,
13569,
13571,
13572,
13578,
13579,
13581,
13582,
13710,
13711,
13713,
13714,
13720,
13721,
13723,
13724,
13892,
13893,
13895,
13896,
14152,
14153,
14155,
14156,
14162,
14163,
14165,
14166,
14196,
14197,
14199,
14200,
14206,
14207,
14209,
14210,
14457,
14458,
14460,
14461,
14902,
14903,
14905,
14906,
14912,
14913,
14915,
14916,
15114,
15115,
15117,
15118,
15124,
15125,
15127,
15128,
15406,
15407,
15409,
15410,
15416,
15417,
15419,
15420,
15615,
15616,
15618,
15619,
15621,
15622,
15659,
15660,
15662,
15663,
15755,
15756,
15758,
15759,
15765,
15766,
15768,
15769,
15907,
15908,
15910,
15911,
16050,
16051,
16053,
16054,
16060,
16061,
16063,
16064,
16142,
16143,
16145,
16146,
16152,
16153,
16155,
16156,
16380,
16381,
16383,
16384,
16386,
16387,
16653,
16654,
16656,
16657,
16761,
16762,
16768,
16769,
16771,
16772,
16821,
16822,
16824,
16825,
16843,
16844,
16846,
16847,
16947,
16948,
17188,
17189,
17191,
17192,
17242,
17243,
17245,
17246,
17252,
17253,
17255,
17256,
17312,
17313,
17315,
17316,
17322,
17323,
17433,
17434,
17436,
17437,
17726,
17727,
17729,
17730,
17736,
17737,
17739,
17740,
17987,
17988,
17990,
17991,
17997,
17998,
18057,
18058,
18060,
18061,
18067,
18068,
18070,
18071,
18178,
18179,
18181,
18182,
18417,
18418,
18420,
18421,
18427,
18428,
18430,
18431,
18579,
18580,
18582,
18583,
18589,
18590,
18592,
18593,
18689,
18690,
18692,
18693,
18792,
18793,
18795,
18796,
18802,
18803,
18805,
18806,
18808,
18809,
18826,
18827,
18829,
18830,
18890,
18891,
18927,
18928,
18930,
18931,
18937,
18938,
18940,
18941,
19289,
19290,
19292,
19293,
19417,
19418,
19420,
19421,
19427,
19428,
19430,
19431,
19480,
19481,
19483,
19484,
19490,
19491,
19493,
19494,
19548,
19549,
19551,
19552,
19558,
19559,
19561,
19562,
19635,
19636,
19638,
19639,
19645,
19646,
19648,
19649,
19992,
19993,
19995,
19996,
19998,
19999,
20044,
20045,
20047,
20048,
20465,
20466,
20468,
20469,
20521,
20522,
20528,
20529,
20531,
20532,
20565,
20566,
20572,
20573,
20575,
20576,
20863,
20864,
20866,
20867,
20885,
20886,
20888,
20889,
20895,
20896,
20898,
20899,
21131,
21132,
21134,
21135,
21137,
21138,
21172,
21173,
21175,
21176,
21549,
21550,
21552,
21553,
21555,
21556,
21558,
21559,
21575,
21576,
21578,
21579,
21598,
21599,
21757,
21758,
21764,
21765,
21866,
21867,
21873,
21874,
21876,
21877,
21917,
21918,
21924,
21925,
21927,
21928,
22006,
22007,
22013,
22014,
22016,
22017,
22181,
22182,
22188,
22189,
22233,
22234,
22236,
22237,
22239,
22240,
22262,
22263,
22499,
22500,
22506,
22507,
22560,
22561,
22567,
22568,
22570,
22571,
22601,
22602,
22682,
22683,
22689,
22690,
22820,
22821,
22823,
22824,
22862,
22863,
22869,
22870,
22917,
22918,
22920,
22921,
22934,
22935,
23000,
23001,
23007,
23008,
23010,
23011,
23195,
23196,
23198,
23199,
23205,
23206,
23208,
23209,
23223,
23224,
23235,
23236,
23238,
23239,
23260,
23261,
23381,
23382,
23388,
23389,
23473,
23474,
23476,
23477,
23501,
23502,
23636,
23637,
23643,
23644,
23739,
23740,
23746,
23747,
23749,
23750,
23752,
23753,
23774,
23775,
23777,
23778,
23797,
23798,
24210,
24211,
24217,
24218,
24220,
24221,
24313,
24314,
24316,
24317,
24339,
24340,
24389,
24390,
24396,
24397,
24399,
24400,
24486,
24487,
24493,
24494,
24554,
24555,
24604,
24605,
24607,
24608,
24638,
24639,
24654,
24655,
24670,
24671,
24693,
24694,
24696,
24697,
24725,
24726,
24732,
24733,
24735,
24736,
24738,
24739,
24752,
24753,
24850,
24851,
24857,
24858,
24860,
24861,
25005,
25006,
25012,
25013,
25015,
25016,
25030,
25031,
25088,
25089,
25095,
25096,
25098,
25099,
25120,
25121,
25138,
25139,
25141,
25142,
25167,
25168,
25250,
25251,
25257,
25258,
25297,
25298,
25304,
25305,
25307,
25308,
25330,
25331,
25333,
25334,
25459,
25460,
25462,
25463,
25494,
25495,
25497,
25498,
25616,
25617,
25619,
25620,
25641,
25642,
25644,
25645,
26041,
26042,
26044,
26045,
26364,
26365,
26367,
26368,
26672,
26673,
26675,
26676,
26830,
26831,
26843,
26844,
26845,
26877,
26878,
26910,
26911,
26921
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 26921,
"ccnet_original_nlines": 1017,
"rps_doc_curly_bracket": 0.00037145998794585466,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44722980260849,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018710259348154068,
"rps_doc_frac_lines_end_with_ellipsis": 0.005893909838050604,
"rps_doc_frac_no_alph_words": 0.15567666292190552,
"rps_doc_frac_unique_words": 0.20272646844387054,
"rps_doc_mean_word_length": 4.463720321655273,
"rps_doc_num_sentences": 260,
"rps_doc_symbol_to_word_ratio": 0.0049046301282942295,
"rps_doc_unigram_entropy": 5.688788890838623,
"rps_doc_word_count": 4548,
"rps_doc_frac_chars_dupe_10grams": 0.003251069923862815,
"rps_doc_frac_chars_dupe_5grams": 0.049701988697052,
"rps_doc_frac_chars_dupe_6grams": 0.01866902969777584,
"rps_doc_frac_chars_dupe_7grams": 0.006403630133718252,
"rps_doc_frac_chars_dupe_8grams": 0.003251069923862815,
"rps_doc_frac_chars_dupe_9grams": 0.003251069923862815,
"rps_doc_frac_chars_top_2gram": 0.014777599833905697,
"rps_doc_frac_chars_top_3gram": 0.005911040119826794,
"rps_doc_frac_chars_top_4gram": 0.0037929199170321226,
"rps_doc_books_importance": -2068.55322265625,
"rps_doc_books_importance_length_correction": -2068.55322265625,
"rps_doc_openwebtext_importance": -1222.219482421875,
"rps_doc_openwebtext_importance_length_correction": -1222.219482421875,
"rps_doc_wikipedia_importance": -767.7899169921875,
"rps_doc_wikipedia_importance_length_correction": -767.7899169921875
},
"fasttext": {
"dclm": 0.043392181396484375,
"english": 0.875239372253418,
"fineweb_edu_approx": 2.3611204624176025,
"eai_general_math": 0.05163443088531494,
"eai_open_web_math": 0.3636464476585388,
"eai_web_code": 0.005374370142817497
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,819,506,704,387,156,000 |
Skip to content
Get-Brokerhypervisorconnection
Gets hypervisor connections matching the specified criteria.
Syntax
Get-BrokerHypervisorConnection [-Uid] <Int32> [-Property <String[]>] [-AdminAddress <String>] [-BearerToken <String>] [-TraceParent <String>] [-TraceState <String>] [-VirtualSiteId <String>] [<CommonParameters>]
Get-BrokerHypervisorConnection [[-Name] <String>] [-ExplicitPreferredController <Boolean>] [-ExtraSpinUpTimeSecs <Int32>] [-FaultReason <String>] [-FaultState <String>] [-FaultStateDuration <TimeSpan>] [-HypHypervisorConnectionUid <Guid>] [-HypHypervisorType <String>] [-IsReady <Boolean>] [-MachineCount <Int32>] [-MaxAbsoluteActiveActions <Int32>] [-MaxAbsoluteNewActionsPerMinute <Int32>] [-MaxAbsolutePvdPowerActions <Int32>] [-MaxPercentageActiveActions <Int32>] [-MaxPvdPowerActionsPercentageOfDesktops <Int32>] [-Metadata <String>] [-PreferredController <String>] [-State <HypervisorConnectionState>] [-TimeFaultStateEntered <DateTime>] [-ZoneExternalUid <Guid>] [-ZoneHealthy <Boolean>] [-ZoneUid <Guid>] [-ReturnTotalRecordCount] [-MaxRecordCount <Int32>] [-Skip <Int32>] [-SortBy <String>] [-Filter <String>] [-FilterScope <Guid>] [-Property <String[]>] [-AdminAddress <String>] [-BearerToken <String>] [-TraceParent <String>] [-TraceState <String>] [-VirtualSiteId <String>] [<CommonParameters>]
Detailed Description
The Get-BrokerHypervisorConnection cmdlet gets hypervisor connections matching the specified criteria. If no parameters are specified this cmdlet enumerates all hypervisor connections.
Brokerhypervisorconnection Object
The BrokerHypervisorConnection represents hypervisor connection object. It contains the following properties:
• Capabilities (System.String[]) The set of capabilities as reported by the hypervisor.
• ExplicitPreferredController (System.Boolean?) Whether the PreferredController property was explicity set through the SDK or automatically chosen.
• ExtraSpinUpTimeSecs (System.Int32?) The extra time a VM is allowed to start before it is marked as failed on session launch
• FaultReason (System.String) Detailed fault state description if connection is currently in a fault state.
• FaultState (System.String) Current fault state indicator associsted with hypervisor connection, or 'None' if connection is operating normally.
• FaultStateDuration (System.TimeSpan?) Period for which the hypervisor has been in fault state
• HypervisorCapabilities (System.String[]) The set of hypervisor capabilities as reported by the hypervisor.
• HypHypervisorConnectionUid (System.Guid) The Guid that identifies the hypervisor connection.
• HypHypervisorType (System.String) The type of hypervisor connected to.
• IsReady (System.Boolean) Indicates that the connection is ready to be used in the configuration of managed machines.
• MachineCount (System.Int32) Count of machines associated with this hypervisor connection.
• MaxAbsoluteActiveActions (System.Int32?) Maximum number of active power actions allowed at any one time (defined in the metadata named 'Citrix_Broker_MaxAbsoluteActiveActions' on the hypervisor connection in the Citrix Hosting Service).
• MaxAbsoluteNewActionsPerMinute (System.Int32?) Maximum number of new actions that can be fired off to the hypervisor in any one minute (defined in the metadata named 'Citrix_Broker_MaxAbsoluteNewActionsPerMinute' on the hypervisor connection in the Citrix Hosting Service).
• MaxAbsolutePvdPowerActions (System.Int32?) This property is no longer supported.
• MaxPercentageActiveActions (System.Int32?) Maximum percentage of machines on the connection that can have active power actions at any one time (defined in the metadata named 'Citrix_Broker_MaxPowerActionsPercentageOfDesktops' on the hypervisor connection in the Citrix Hosting Service).
• MaxPvdPowerActionsPercentageOfDesktops (System.Int32?) This property is no longer supported.
• MetadataMap (System.Collections.Generic.Dictionary<string, string>) Collection of all the metadata associated to the hypervisor connection.
• Name (System.String) The display name of the hypervisor connection.
• PreferredController (System.String) The name of the controller which is preferred to be used, when available, to perform all communication to the hypervisor. The name is in DOMAIN\machine form. A preferred controller may have been automatically chosen when the hypervisor connection was created.
• State (Citrix.Broker.Admin.SDK.HypervisorConnectionState) The state of the hypervisor connection.
• TimeFaultStateEntered (System.DateTime?) Time at which the hypervisor entered fault state
• Uid (System.Int32) Unique internal identifier of hypervisor connection.
• ZoneExternalUid (System.Guid?) The Guid that is the external zone uid of the hypervisor connection.
• ZoneHealthy (System.Boolean?) Health state of the Zone associated with this hypervisor connection.
• ZoneUid (System.Guid?) The Guid that identifies the zone associated with the hypervisor connection.
Parameters
Name Description Required? Pipeline Input Default Value
Uid Gets the hypervisor connection with the specified internal id. true false
Name Gets hypervisor connections with the specified name. false false
ExplicitPreferredController Gets hypervisor connections based on whether their preferred controller was explicitly specified or not false false
ExtraSpinUpTimeSecs Gets the extra time a VM is allowed to start before it is marked as failed on session launch false false
FaultReason Gets hypervisor connections with fault reasons matching that specified. false false
FaultState Gets hypervisor connections with fault states matching that specified. false false
FaultStateDuration Period for which the hypervisor has been in fault state false false
HypHypervisorConnectionUid Gets hypervisor connections with the specified Guid. false false
HypHypervisorType Gets hypervisor connections with the specified value of the hypervisor type. false false
IsReady Gets hypervisor connections with the specified value of the IsReady flag. false false
MachineCount Gets hypervisor connections with the specified machine count. false false
MaxAbsoluteActiveActions Gets hypervisor connections with the specified MaxAbsoluteActiveActions value. false false
MaxAbsoluteNewActionsPerMinute Gets hypervisor connections with the specified MaxAbsoluteNewActionsPerMinute value. false false
MaxAbsolutePvdPowerActions This property is no longer supported. false false
MaxPercentageActiveActions Gets hypervisor connections with the specified MaxPercentageActiveActions value. false false
MaxPvdPowerActionsPercentageOfDesktops This property is no longer supported. false false
Metadata Gets records with matching metadata entries.
The value being compared with is a concatenation of the key name, a colon, and the value. For example: -Metadata "abc:x*" matches records with a metadata entry having a key name of "abc" and a value starting with the letter "x". false false
PreferredController Gets hypervisor connections with the specified preferred controller. Specify the SAM name of the controller. false false
State Gets hypervisor connections with the specified connection state. Values can be can be:
o Unavailable - The broker is unable to contact the hypervisor.
o InMaintenanceMode - The hosting server is in maintenance mode.
o On - The broker is in contact with the hypervisor. false false
TimeFaultStateEntered Time at which the hypervisor entered fault state false false
ZoneExternalUid Gets the hypervisor connections with the specified zone external uid. false false
ZoneHealthy Health state of the Zone associated with this hypervisor connection. false false
ZoneUid Gets the hypervisor connections with the specified zone uid. false false
ReturnTotalRecordCount When specified, this causes the cmdlet to output an error record containing the number of records available. This error record is additional information and does not affect the objects written to the output pipeline. See about_Broker_Filtering for details. false false False
MaxRecordCount Specifies the maximum number of records to return. false false 250
Skip Skips the specified number of records before returning results. Also reduces the count returned by -ReturnTotalRecordCount. false false 0
SortBy Sorts the results by the specified list of properties. The list is a set of property names separated by commas, semi-colons, or spaces. Optionally, prefix each name with a + or - to indicate ascending or descending order. Ascending order is assumed if no prefix is present. false false The default sort order is by name or unique identifier.
Filter Gets records that match a PowerShell style filter expression. See about_Broker_Filtering for details. false false
FilterScope Gets only results allowed by the specified scope id. false false
Property Specifies the properties to be returned. This is similar to piping the output of the command through Select-Object, but the properties are filtered more efficiently at the server. false false
AdminAddress Specifies the address of a XenDesktop controller that the PowerShell snapin will connect to. This can be provided as a host name or an IP address. false false Localhost. Once a value is provided by any cmdlet, this value will become the default.
BearerToken Specifies the bearer token assigned to the calling user false false
TraceParent Specifies the trace parent assigned for internal diagnostic tracing use false false
TraceState Specifies the trace state assigned for internal diagnostic tracing use false false
VirtualSiteId Specifies the virtual site the PowerShell snap-in will connect to. false false
Input Type
None
Return Values
Citrix.Broker.Admin.Sdk.Hypervisorconnection
Get-BrokerHypervisorConnection returns an object for each matching hypervisor connection.
Examples
Example 1
C:\PS> $hvConn = Get-BrokerHypervisorConnection -Name "hvConnectionName"
Description
Gets a hypervisor connection by name.
Example 2
C:\PS> $hvConn = Get-BrokerHypervisorConnection -PreferredController "domainName\controllerName"
Description
Gets hypervisor connections by preferred controller.
Example 3
C:\PS> $machine = Get-BrokerMachine -Uid $machineUid
C:\PS> $hvConn = Get-BrokerHypervisorConnection -Uid $machine.HypervisorConnectionUid
Description
Gets hypervisor connection used by a (power managed) machine.
Was this article helpful?
|
{
"url": "https://developer-docs.citrix.com/projects/citrix-daas-sdk/en/latest/Broker/Get-BrokerHypervisorConnection/",
"source_domain": "developer-docs.citrix.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "244316",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TT5OXSDB3JMMQJTHVOZZSPYQIZFJ2FPZ",
"WARC-Concurrent-To": "<urn:uuid:5b29f17d-04be-48ad-a207-ab9c3829015b>",
"WARC-Date": "2022-07-06T04:29:06Z",
"WARC-IP-Address": "54.166.113.21",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JUI2SCONLOJTUGTQ5WF3JASEALFH2LEL",
"WARC-Record-ID": "<urn:uuid:27a61cc5-ceb2-4b5d-93db-9daabd265281>",
"WARC-Target-URI": "https://developer-docs.citrix.com/projects/citrix-daas-sdk/en/latest/Broker/Get-BrokerHypervisorConnection/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d76cce97-72fc-4038-a36d-54d248907939>"
},
"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-63\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,
16,
17,
48,
49,
110,
111,
118,
119,
333,
334,
1341,
1342,
1363,
1364,
1549,
1550,
1584,
1585,
1695,
1696,
1786,
1787,
1937,
1938,
2066,
2067,
2177,
2178,
2325,
2326,
2424,
2425,
2536,
2537,
2634,
2635,
2710,
2711,
2832,
2833,
2927,
2928,
3169,
3170,
3448,
3449,
3534,
3535,
3826,
3827,
3924,
3925,
4069,
4070,
4142,
4143,
4443,
4444,
4546,
4547,
4641,
4642,
4718,
4719,
4823,
4824,
4927,
4928,
5032,
5033,
5044,
5045,
5101,
5179,
5249,
5393,
5518,
5614,
5708,
5795,
5887,
5994,
6088,
6175,
6291,
6419,
6496,
6616,
6705,
6759,
7000,
7141,
7234,
7298,
7363,
7428,
7511,
7609,
7702,
7783,
8081,
8163,
8306,
8655,
8776,
8853,
9054,
9313,
9393,
9489,
9583,
9676,
9677,
9688,
9689,
9694,
9695,
9709,
9710,
9755,
9756,
9846,
9847,
9856,
9857,
9867,
9868,
9941,
9942,
9954,
9955,
9993,
9994,
10004,
10005,
10102,
10103,
10115,
10116,
10169,
10170,
10180,
10181,
10236,
10237,
10323,
10324,
10336,
10337,
10399,
10400
],
"line_end_idx": [
16,
17,
48,
49,
110,
111,
118,
119,
333,
334,
1341,
1342,
1363,
1364,
1549,
1550,
1584,
1585,
1695,
1696,
1786,
1787,
1937,
1938,
2066,
2067,
2177,
2178,
2325,
2326,
2424,
2425,
2536,
2537,
2634,
2635,
2710,
2711,
2832,
2833,
2927,
2928,
3169,
3170,
3448,
3449,
3534,
3535,
3826,
3827,
3924,
3925,
4069,
4070,
4142,
4143,
4443,
4444,
4546,
4547,
4641,
4642,
4718,
4719,
4823,
4824,
4927,
4928,
5032,
5033,
5044,
5045,
5101,
5179,
5249,
5393,
5518,
5614,
5708,
5795,
5887,
5994,
6088,
6175,
6291,
6419,
6496,
6616,
6705,
6759,
7000,
7141,
7234,
7298,
7363,
7428,
7511,
7609,
7702,
7783,
8081,
8163,
8306,
8655,
8776,
8853,
9054,
9313,
9393,
9489,
9583,
9676,
9677,
9688,
9689,
9694,
9695,
9709,
9710,
9755,
9756,
9846,
9847,
9856,
9857,
9867,
9868,
9941,
9942,
9954,
9955,
9993,
9994,
10004,
10005,
10102,
10103,
10115,
10116,
10169,
10170,
10180,
10181,
10236,
10237,
10323,
10324,
10336,
10337,
10399,
10400,
10425
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10425,
"ccnet_original_nlines": 151,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25323909521102905,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009422849863767624,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23851589858531952,
"rps_doc_frac_unique_words": 0.25315457582473755,
"rps_doc_mean_word_length": 6.734227180480957,
"rps_doc_num_sentences": 127,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.9474968910217285,
"rps_doc_word_count": 1268,
"rps_doc_frac_chars_dupe_10grams": 0.08607564866542816,
"rps_doc_frac_chars_dupe_5grams": 0.27591052651405334,
"rps_doc_frac_chars_dupe_6grams": 0.24862396717071533,
"rps_doc_frac_chars_dupe_7grams": 0.17999765276908875,
"rps_doc_frac_chars_dupe_8grams": 0.1586836874485016,
"rps_doc_frac_chars_dupe_9grams": 0.10668697208166122,
"rps_doc_frac_chars_top_2gram": 0.040988411754369736,
"rps_doc_frac_chars_top_3gram": 0.046843890100717545,
"rps_doc_frac_chars_top_4gram": 0.04075419157743454,
"rps_doc_books_importance": -759.3330078125,
"rps_doc_books_importance_length_correction": -759.3330078125,
"rps_doc_openwebtext_importance": -404.4657287597656,
"rps_doc_openwebtext_importance_length_correction": -404.4657287597656,
"rps_doc_wikipedia_importance": -314.896484375,
"rps_doc_wikipedia_importance_length_correction": -314.896484375
},
"fasttext": {
"dclm": 0.023110030218958855,
"english": 0.7099332213401794,
"fineweb_edu_approx": 1.7018071413040161,
"eai_general_math": 0.014572500251233578,
"eai_open_web_math": 0.03227818012237549,
"eai_web_code": 0.121512770652771
}
}
|
{
"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.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
640,492,563,618,078,500 |
UtypesTigerTeam telecon 2012-11-27
Participants
OL Omar Laurino
MG Matthew Graham
MD Markus Demleitner
PF Pierre Fernique
PD Pat Dowler
GL Gerard Lemson
Action items from last time
JS: get VOSpec utypes usage: Usage of utypes in VOSpec distributed to tiger team members. JS to put the info in Volute before to formally close the action
MG (fallback MD): Solicit more Apps feedback: Only VO-IRAF pending. See new action item on OL
JS+GL+MD: Provide some example serializations (with references and collections if possible?): Action not finished yet. Discussions held between GL and MD on how to use groups to represent the serialization. If template is created JS will insert consistent metadata to create a "real" example.
Today's agenda:
GL distributed URL with a VO-DML example https://volute.googlecode.com/svn/trunk/projects/dm/vo-dml/models/sample
OL VO-DML XML process contains a XMI magicdraw representation (not standard)
GL VO-DML XML could be written by hand. Not necessary to write magic draw to derive it. It is simpler to create a small UML as starting point
OL enumerates deferred items from previous teleconf:
Implementation effort
MD Pierre asked about the impact on the VOTable generator. It should be deferred again until having the PhotDMv1-1 example (at least)
Validation
At very least, validation will include the utypes checking (string comparison with existing VO DM) but as soon as there is a new DM or a DAL service, a new validation is needed.
With the new schema, at least a general validator could be created. This is in the use cases.
MD In practice, the "syntactic" validation of documents that is provided by such tools is only part of a full validator; we should be careful not to promise turn-key full validation.
GL Different levels of validation. Some of them are easier. Utypes check and warnings (like schema validation).
Grouping in TAP schema
MD Can we represent GROUPs in TAP schema? We run with similar problems with Europlanet (link distributed) http://dc.zah.uni-heidelberg.de/__system__/dc_tables/show/tableinfo/tap_schema.groups
This could be not enough
GL If we need to do it in groups in VOtable we should probably do it at DB level
JS Ask for clarification on the target of this effort
GL This could be used to infere that two fields are together and also could be used for the response
OL it this related with utypes? Is this related with DM serialization?
GL Yes, it is related with DM serializationin some way
OL TAP schema is now defining a DM
GL This could be used also to express in a DB an existing DM
OL Why not to use VO-DML
GL it is a different thing. It is not a 1-1 mapping. Some part of DB could represent a part of a certain DM
MG This could be out of the scope of the utypes Tiger Team
GL Although not the main tiger team target, this is a concern on utypes
MD If we target TAP_SCHEMA, we probably should also deal with VOSI tables.
MG Use of utypes in VOSI is marginal
MG request for a clear schedule on tiger team deliverables
GL working draft for next interop? VO-DML and mapping in VOTable
GL+MD+Pierre+Jesus on preparation of serializations
PF complains on some details inside VO-DML example: e.g. units are outside the field, so the use is different than in standard VOTable
OL asked if there is an agreement within the Tiger Team about VO-DML (or a closer concept) as a good approach to handle utypes?
GL Two different aspects has to be discussed: how to express UML and how to map to VOTable. First point looks clearer
OL Is it a good approach for first point?
PF SED example distributed... is there a way to express this example with this approach
GL if there is not a standard DM behind, there are not utypes and utypes cannot therefore used. That implies that a UML should be created
PF if the DM is too complex to describe the approach is difficult
MD Probably this is going to be clarified with the examples
GL Other point, the prefix stuff. Is this going to be used to reference a IVOA schema. This could connect with PF question on representation of a DM not standarized yet into IVOA. However the prefix could be not enough
MD To follow the string comparison approach, the utypes should be constant (this could be a problem for extensions) That implies the prefixes should be constant
If we can, we should even try to keep the strings constant over data model changes (at least extensions). To still allow figuring out the URI "of the data model" (say, the VO-DML definition for it), we have DataModel.URI in the STC serialization.
OL Where the prefix is useful is avoided clashes, so same utypes can be understood in a different way (not in string comparison). This is related with the namespaces.
GL I think it has certain use to identify the DM
Goals for next teleconf:
GL continue with the work I have started on examples. Do you have time for this Markus?
MD Examples will be circulated in two weeks
MG use cases document will be also closed in two weeks. Not clear if this is going to be published as a note
Next telecon: Two weeks, same time, same place.
Open Action Items:
OL to distribute use of utypes in IRIS
JS to put VOSpec utypes use in Volute
JS+GL+MD+PF: Provide some example serializations
<!--
* Set ALLOWTOPICRENAME = TWikiAdminGroup
-->
Topic revision: r3 - 2021-04-13 - GiuliaIafrate
This site is powered by the TWiki collaboration platformCopyright © 2008-2022 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback
|
{
"url": "https://wiki.ivoa.net/twiki/bin/view/IVOA/UtypeTigerTeamMinTel7",
"source_domain": "wiki.ivoa.net",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "22250",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C4PTYQPFJZ24UST2QWSBPCHPMNMDCCYP",
"WARC-Concurrent-To": "<urn:uuid:815e5f36-4320-43ae-868d-7c374526b039>",
"WARC-Date": "2022-08-14T18:08:28Z",
"WARC-IP-Address": "140.105.79.59",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:JHLMYK4YZPZ22VMC3HJNAY3M6IAFURPC",
"WARC-Record-ID": "<urn:uuid:a9a82806-eb8b-431f-a3c4-a7f272b90b81>",
"WARC-Target-URI": "https://wiki.ivoa.net/twiki/bin/view/IVOA/UtypeTigerTeamMinTel7",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3d778f20-c2a1-47d4-805d-45e5a35e3e49>"
},
"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-76\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,
35,
36,
49,
50,
66,
67,
85,
86,
107,
108,
127,
128,
142,
143,
160,
161,
189,
190,
345,
346,
440,
441,
734,
735,
751,
752,
866,
867,
944,
945,
1087,
1088,
1141,
1142,
1164,
1165,
1299,
1300,
1311,
1312,
1490,
1491,
1585,
1586,
1769,
1770,
1882,
1883,
1906,
1907,
2099,
2100,
2125,
2126,
2207,
2208,
2262,
2263,
2364,
2365,
2436,
2437,
2492,
2493,
2528,
2529,
2590,
2591,
2616,
2617,
2725,
2726,
2785,
2786,
2858,
2859,
2934,
2935,
2972,
2973,
3032,
3033,
3098,
3099,
3151,
3152,
3287,
3288,
3416,
3417,
3535,
3536,
3578,
3579,
3667,
3668,
3806,
3807,
3873,
3874,
3934,
3935,
4154,
4155,
4316,
4317,
4564,
4565,
4732,
4733,
4782,
4783,
4808,
4809,
4897,
4898,
4942,
4943,
5052,
5053,
5101,
5102,
5121,
5122,
5161,
5162,
5200,
5201,
5250,
5251,
5252,
5257,
5298,
5302,
5303,
5351,
5353,
5549
],
"line_end_idx": [
35,
36,
49,
50,
66,
67,
85,
86,
107,
108,
127,
128,
142,
143,
160,
161,
189,
190,
345,
346,
440,
441,
734,
735,
751,
752,
866,
867,
944,
945,
1087,
1088,
1141,
1142,
1164,
1165,
1299,
1300,
1311,
1312,
1490,
1491,
1585,
1586,
1769,
1770,
1882,
1883,
1906,
1907,
2099,
2100,
2125,
2126,
2207,
2208,
2262,
2263,
2364,
2365,
2436,
2437,
2492,
2493,
2528,
2529,
2590,
2591,
2616,
2617,
2725,
2726,
2785,
2786,
2858,
2859,
2934,
2935,
2972,
2973,
3032,
3033,
3098,
3099,
3151,
3152,
3287,
3288,
3416,
3417,
3535,
3536,
3578,
3579,
3667,
3668,
3806,
3807,
3873,
3874,
3934,
3935,
4154,
4155,
4316,
4317,
4564,
4565,
4732,
4733,
4782,
4783,
4808,
4809,
4897,
4898,
4942,
4943,
5052,
5053,
5101,
5102,
5121,
5122,
5161,
5162,
5200,
5201,
5250,
5251,
5252,
5257,
5298,
5302,
5303,
5351,
5353,
5549,
5605
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5605,
"ccnet_original_nlines": 138,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3903930187225342,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.10567685961723328,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1475982517004013,
"rps_doc_frac_unique_words": 0.3795309066772461,
"rps_doc_mean_word_length": 4.702558517456055,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0.0008733600261621177,
"rps_doc_unigram_entropy": 5.238089084625244,
"rps_doc_word_count": 938,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.014509179629385471,
"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.014282479882240295,
"rps_doc_frac_chars_top_3gram": 0.01246882975101471,
"rps_doc_frac_chars_top_4gram": 0.014509179629385471,
"rps_doc_books_importance": -552.6239013671875,
"rps_doc_books_importance_length_correction": -552.6239013671875,
"rps_doc_openwebtext_importance": -314.0383605957031,
"rps_doc_openwebtext_importance_length_correction": -314.0383605957031,
"rps_doc_wikipedia_importance": -225.488525390625,
"rps_doc_wikipedia_importance_length_correction": -225.488525390625
},
"fasttext": {
"dclm": 0.028120459988713264,
"english": 0.8929466605186462,
"fineweb_edu_approx": 1.8377279043197632,
"eai_general_math": 0.724496066570282,
"eai_open_web_math": 0.3304547667503357,
"eai_web_code": 0.3126499652862549
}
}
|
{
"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.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.